var.c 6.3 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233
  1. #include "__virtualmath.h"
  2. Var *makeVar(char *name, LinkValue *value, LinkValue *name_, Inter *inter) {
  3. Var *list_tmp = inter->base_var;
  4. Var *tmp;
  5. tmp = memCalloc(1, sizeof(Var));
  6. setGC(&tmp->gc_status);
  7. tmp->name = memStrcpy(name);
  8. tmp->value = copyLinkValue(value, inter);
  9. tmp->name_ = copyLinkValue(name_, inter);
  10. tmp->next = NULL;
  11. tmp->gc_next = NULL;
  12. tmp->gc_last = NULL;
  13. if (list_tmp == NULL){
  14. inter->base_var = tmp;
  15. tmp->gc_last = NULL;
  16. goto return_;
  17. }
  18. for (PASS; list_tmp->gc_next != NULL; list_tmp = list_tmp->gc_next)
  19. PASS;
  20. list_tmp->gc_next = tmp;
  21. tmp->gc_last = list_tmp;
  22. return_:
  23. return tmp;
  24. }
  25. void freeVar(Var **var) {
  26. Var *free_value = *var;
  27. freeBase(free_value, return_);
  28. memFree(free_value->name);
  29. if ((*var)->gc_next != NULL)
  30. (*var)->gc_next->gc_last = (*var)->gc_last;
  31. *var = (*var)->gc_next;
  32. memFree(free_value);
  33. return_: return;
  34. }
  35. HashTable *makeHashTable(Inter *inter) {
  36. HashTable *list_tmp = inter->hash_base;
  37. HashTable *tmp;
  38. tmp = memCalloc(1, sizeof(Value));
  39. tmp->hashtable = (Var **)calloc(MAX_SIZE, sizeof(Var *));
  40. setGC(&tmp->gc_status);
  41. tmp->gc_next = NULL;
  42. tmp->gc_last = NULL;
  43. if (list_tmp == NULL){
  44. inter->hash_base = tmp;
  45. tmp->gc_last = NULL;
  46. goto return_;
  47. }
  48. for (PASS; list_tmp->gc_next != NULL; list_tmp = list_tmp->gc_next)
  49. PASS;
  50. list_tmp->gc_next = tmp;
  51. tmp->gc_last = list_tmp;
  52. return_:
  53. return tmp;
  54. }
  55. void freeHashTable(HashTable **value) {
  56. HashTable *free_value = *value;
  57. freeBase(free_value, return_);
  58. memFree(free_value->hashtable);
  59. if ((*value)->gc_next != NULL)
  60. (*value)->gc_next->gc_last = (*value)->gc_last;
  61. *value = (*value)->gc_next;
  62. memFree(free_value);
  63. return_: return;
  64. }
  65. VarList *makeVarList(Inter *inter) {
  66. VarList *tmp = calloc(1, sizeof(VarList));
  67. tmp->next = NULL;
  68. tmp->hashtable = makeHashTable(inter);
  69. return tmp;
  70. }
  71. VarList *freeVarList(VarList *vl, bool self){
  72. freeBase(vl, return_);
  73. if (self){
  74. VarList *next_var = vl->next;
  75. memFree(vl);
  76. return next_var;
  77. }
  78. return_:
  79. return vl;
  80. }
  81. /**
  82. * hashTable使用time33算法
  83. * @param key
  84. * @return
  85. */
  86. HASH_INDEX time33(char *key){ // hash function
  87. HASH_INDEX hash = 5381;
  88. while(*key)
  89. hash += (hash << (HASH_INDEX)5) + (*key++);
  90. return (hash & (HASH_INDEX)0x7FFFFFFF) % MAX_SIZE;
  91. }
  92. void addVarCore(Var **base, char *name, LinkValue *value, LinkValue *name_, Inter *inter) {
  93. for (PASS; true; base = &(*base)->next) {
  94. if (*base == NULL) {
  95. *base = makeVar(name, value, name_, inter);
  96. break;
  97. } else if (eqString((*base)->name, name)) {
  98. (*base)->value->value = value->value;
  99. (*base)->value->father = value->father;
  100. break;
  101. }
  102. }
  103. }
  104. void addVar(char *name, LinkValue *value, LinkValue *name_, INTER_FUNCTIONSIG_CORE) {
  105. HASH_INDEX index = time33(name);
  106. addVarCore(&var_list->hashtable->hashtable[index], name, value, name_, inter);
  107. }
  108. void updateHashTable(HashTable *update, HashTable *new, Inter *inter) {
  109. for (int i = 0; i < MAX_SIZE; i++)
  110. for (Var *tmp = new->hashtable[i]; tmp != NULL; tmp = tmp->next)
  111. addVarCore(&update->hashtable[i], tmp->name, tmp->value, tmp->name_, inter);
  112. }
  113. LinkValue *findVar(char *name, bool del_var, INTER_FUNCTIONSIG_CORE) {
  114. LinkValue *tmp = NULL;
  115. HASH_INDEX index = time33(name);
  116. for (Var **base = &var_list->hashtable->hashtable[index]; *base != NULL; base = &(*base)->next){
  117. if (eqString((*base)->name, name)){
  118. tmp = (*base)->value;
  119. if (del_var) {
  120. Var *next = (*base)->next;
  121. (*base)->next = NULL;
  122. *base = next;
  123. }
  124. goto return_;
  125. }
  126. }
  127. return_:
  128. return copyLinkValue(tmp, inter);
  129. }
  130. LinkValue *findFromVarList(char *name, NUMBER_TYPE times, bool del_var, INTER_FUNCTIONSIG_CORE) {
  131. LinkValue *tmp = NULL;
  132. for (NUMBER_TYPE i=0; i < times && var_list->next != NULL; i++)
  133. var_list = var_list->next;
  134. for (PASS; var_list != NULL && tmp == NULL; var_list = var_list->next)
  135. tmp = findVar(name, del_var, CALL_INTER_FUNCTIONSIG_CORE(var_list));
  136. return tmp;
  137. }
  138. void addFromVarList(char *name, LinkValue *name_, NUMBER_TYPE times, LinkValue *value, INTER_FUNCTIONSIG_CORE) {
  139. for (NUMBER_TYPE i=0; i < times && var_list->next != NULL; i++)
  140. var_list = var_list->next;
  141. addVar(name, value, name_, CALL_INTER_FUNCTIONSIG_CORE(var_list));
  142. }
  143. VarList *pushVarList(VarList *base, Inter *inter){
  144. VarList *new = makeVarList(inter);
  145. new->next = base;
  146. return new;
  147. }
  148. VarList *popVarList(VarList *base) {
  149. if (base->next == NULL)
  150. return base;
  151. return freeVarList(base, true);
  152. }
  153. VarList *copyVarListCore(VarList *base, Inter *inter){
  154. VarList *tmp = makeVarList(inter);
  155. tmp->hashtable = base->hashtable;
  156. return tmp;
  157. }
  158. VarList *copyVarList(VarList *base, bool n_new, Inter *inter){
  159. VarList *new = NULL;
  160. VarList **tmp = &new;
  161. for (int i=0; base != NULL; tmp = &(*tmp)->next, base = base->next,i++)
  162. *tmp = copyVarListCore(base, inter);
  163. if (n_new)
  164. return pushVarList(new, inter);
  165. return new;
  166. }
  167. VarList *connectVarListBack(VarList *base, VarList *back){
  168. VarList **tmp = NULL;
  169. for (tmp = &base; *tmp != NULL; tmp = &(*tmp)->next)
  170. PASS;
  171. *tmp = back;
  172. return base;
  173. }
  174. bool comparVarList(VarList *dest, VarList *src) {
  175. for (PASS; src != NULL; src = src->next)
  176. if (src->hashtable == dest->hashtable)
  177. return true;
  178. return false;
  179. }
  180. VarList *connectSafeVarListBack(VarList *base, VarList *back){
  181. VarList **last_node = &base;
  182. for (PASS; *last_node != NULL; ){
  183. if ((*last_node)->hashtable == back->hashtable)
  184. *last_node = freeVarList(*last_node, true);
  185. else
  186. last_node = &(*last_node)->next;
  187. }
  188. *last_node = back;
  189. return base;
  190. }
  191. VarList *makeObjectVarList(FatherValue *value, Inter *inter){
  192. VarList *tmp = makeVarList(inter);
  193. for (PASS; value != NULL; value = value->next) {
  194. VarList *new = copyVarList(value->value->value->object.var, false, inter);
  195. tmp = connectVarListBack(tmp, new);
  196. }
  197. return tmp;
  198. }