finsh_node.c 3.6 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187
  1. /*
  2. * File : finsh_node.c
  3. * This file is part of RT-Thread RTOS
  4. * COPYRIGHT (C) 2006 - 2010, RT-Thread Development Team
  5. *
  6. * The license and distribution terms for this file may be
  7. * found in the file LICENSE in this distribution or at
  8. * http://www.rt-thread.org/license/LICENSE
  9. *
  10. * Change Logs:
  11. * Date Author Notes
  12. * 2010-03-22 Bernard first version
  13. */
  14. #include <finsh.h>
  15. #include "finsh_node.h"
  16. #include "finsh_error.h"
  17. #include "finsh_var.h"
  18. #include "finsh_heap.h"
  19. struct finsh_node global_node_table[FINSH_NODE_MAX];
  20. int finsh_node_init()
  21. {
  22. memset(global_node_table, 0, sizeof(global_node_table));
  23. return 0;
  24. }
  25. struct finsh_node* finsh_node_allocate(u_char type)
  26. {
  27. int i;
  28. /* find an empty entry */
  29. for (i = 0; i < FINSH_NODE_MAX; i ++)
  30. {
  31. if (global_node_table[i].node_type == FINSH_NODE_UNKNOWN) break;
  32. }
  33. if (i == FINSH_NODE_MAX) return NULL;
  34. /* fill type field */
  35. global_node_table[i].node_type = type;
  36. /* return this allocated node */
  37. return &global_node_table[i];
  38. }
  39. struct finsh_node* finsh_node_new_id(char* id)
  40. {
  41. struct finsh_node* node;
  42. void* symbol;
  43. unsigned char type;
  44. symbol = NULL;
  45. type = 0;
  46. node = NULL;
  47. /* lookup variable firstly */
  48. symbol = (void*)finsh_var_lookup(id);
  49. if (symbol == NULL)
  50. {
  51. /* then lookup system variable */
  52. symbol = (void*)finsh_sysvar_lookup(id);
  53. if (symbol == NULL)
  54. {
  55. /* then lookup system call */
  56. symbol = (void*)finsh_syscall_lookup(id);
  57. if (symbol != NULL) type = FINSH_IDTYPE_SYSCALL;
  58. }
  59. else type = FINSH_IDTYPE_SYSVAR;
  60. }
  61. else type = FINSH_IDTYPE_VAR;
  62. if (symbol != NULL)
  63. {
  64. /* allocate a new node */
  65. node = finsh_node_allocate(FINSH_NODE_ID);
  66. /* allocate node error */
  67. if (node == NULL)
  68. {
  69. finsh_error_set(FINSH_ERROR_MEMORY_FULL);
  70. return NULL;
  71. }
  72. /* fill node value according type */
  73. switch (type)
  74. {
  75. case FINSH_IDTYPE_VAR:
  76. node->id.var = (struct finsh_var*)symbol;
  77. break;
  78. case FINSH_IDTYPE_SYSVAR:
  79. node->id.sysvar = (struct finsh_sysvar*)symbol;
  80. break;
  81. case FINSH_IDTYPE_SYSCALL:
  82. node->id.syscall = (struct finsh_syscall*)symbol;
  83. break;
  84. }
  85. /* fill identifier type */
  86. node->idtype = type;
  87. }
  88. else finsh_error_set(FINSH_ERROR_UNKNOWN_SYMBOL);
  89. return node;
  90. }
  91. struct finsh_node* finsh_node_new_char(char c)
  92. {
  93. struct finsh_node* node;
  94. node = finsh_node_allocate(FINSH_NODE_VALUE_CHAR);
  95. if (node == NULL)
  96. {
  97. finsh_error_set(FINSH_ERROR_MEMORY_FULL);
  98. return NULL;
  99. }
  100. node->value.char_value = c;
  101. return node;
  102. }
  103. struct finsh_node* finsh_node_new_int(int i)
  104. {
  105. struct finsh_node* node;
  106. node = finsh_node_allocate(FINSH_NODE_VALUE_INT);
  107. if (node == NULL)
  108. {
  109. finsh_error_set(FINSH_ERROR_MEMORY_FULL);
  110. return NULL;
  111. }
  112. node->value.int_value = i;
  113. return node;
  114. }
  115. struct finsh_node* finsh_node_new_long(long l)
  116. {
  117. struct finsh_node* node;
  118. node = finsh_node_allocate(FINSH_NODE_VALUE_LONG);
  119. if (node == NULL)
  120. {
  121. finsh_error_set(FINSH_ERROR_MEMORY_FULL);
  122. return NULL;
  123. }
  124. node->value.long_value = l;
  125. return node;
  126. }
  127. struct finsh_node* finsh_node_new_string(char* s)
  128. {
  129. struct finsh_node* node;
  130. node = finsh_node_allocate(FINSH_NODE_VALUE_STRING);
  131. if (node == NULL)
  132. {
  133. finsh_error_set(FINSH_ERROR_MEMORY_FULL);
  134. return NULL;
  135. }
  136. /* make string */
  137. node->value.ptr = finsh_heap_allocate(strlen(s) + 1);
  138. strncpy(node->value.ptr, s, strlen(s));
  139. ((u_char*)node->value.ptr)[strlen(s)] = '\0';
  140. return node;
  141. }
  142. struct finsh_node* finsh_node_new_ptr(void* ptr)
  143. {
  144. struct finsh_node* node;
  145. node = finsh_node_allocate(FINSH_NODE_VALUE_NULL);
  146. if (node == NULL)
  147. {
  148. finsh_error_set(FINSH_ERROR_MEMORY_FULL);
  149. return NULL;
  150. }
  151. node->value.ptr = ptr;
  152. return node;
  153. }