1
0

var.c 6.8 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237
  1. #include "__virtualmath.h"
  2. Var *makeVar(wchar_t *name, LinkValue *value, LinkValue *name_, Inter *inter) {
  3. Var *tmp;
  4. MACRO_CALLOC(tmp, 1, sizeof(Var));
  5. setGC(&tmp->gc_status);
  6. tmp->name = memWidecpy(name);
  7. tmp->value = value;
  8. tmp->name_ = name_;
  9. tmp->next = NULL;
  10. tmp->gc_next = NULL;
  11. tmp->gc_next = inter->base_var;
  12. tmp->gc_last = NULL;
  13. if (inter->base_var != NULL)
  14. inter->base_var->gc_last = tmp;
  15. inter->base_var = tmp;
  16. return tmp;
  17. }
  18. void freeVar(Var **var) {
  19. Var *free_value = *var;
  20. FREE_BASE(free_value, return_);
  21. memFree(free_value->name);
  22. if ((*var)->gc_next != NULL)
  23. (*var)->gc_next->gc_last = (*var)->gc_last;
  24. *var = (*var)->gc_next;
  25. memFree(free_value);
  26. return_: return;
  27. }
  28. HashTable *makeHashTable(Inter *inter) {
  29. HashTable *tmp;
  30. MACRO_CALLOC(tmp, 1, sizeof(HashTable));
  31. MACRO_CALLOC(tmp->hashtable, MAX_SIZE, sizeof(Var *));
  32. setGC(&tmp->gc_status);
  33. gc_addTmpLink(&tmp->gc_status);
  34. tmp->gc_next = NULL;
  35. // hashTable 不算入 inter 的 run_gc 中
  36. tmp->gc_next = inter->hash_base;
  37. tmp->gc_last = NULL;
  38. if (inter->hash_base != NULL)
  39. inter->hash_base->gc_last = tmp;
  40. inter->hash_base = tmp;
  41. return tmp;
  42. }
  43. void freeHashTable(HashTable **value) {
  44. HashTable *free_value = *value;
  45. FREE_BASE(free_value, return_);
  46. memFree(free_value->hashtable);
  47. if ((*value)->gc_next != NULL)
  48. (*value)->gc_next->gc_last = (*value)->gc_last;
  49. *value = (*value)->gc_next;
  50. memFree(free_value);
  51. return_: return;
  52. }
  53. VarList *makeVarList(Inter *inter, bool make_hash, HashTable *hs) {
  54. VarList *tmp = calloc(1, sizeof(VarList));
  55. tmp->next = NULL;
  56. if (make_hash)
  57. tmp->hashtable = makeHashTable(inter);
  58. else {
  59. assert(hs != NULL);
  60. tmp->hashtable = hs;
  61. gc_addTmpLink(&tmp->hashtable->gc_status);
  62. }
  63. tmp->default_var = NULL;
  64. return tmp;
  65. }
  66. VarList *freeVarList(VarList *vl) {
  67. VarList *next_var = NULL;
  68. FREE_BASE(vl, return_);
  69. next_var = vl->next;
  70. for (PASS; vl->default_var != NULL; vl->default_var = freeDefaultVar(vl->default_var))
  71. PASS;
  72. if (vl->hashtable != NULL)
  73. gc_freeTmpLink(&vl->hashtable->gc_status);
  74. memFree(vl);
  75. return_:
  76. return next_var;
  77. }
  78. DefaultVar *makeDefaultVar(wchar_t *name, vint times) {
  79. DefaultVar *tmp;
  80. tmp = memCalloc(1, sizeof(DefaultVar));
  81. tmp->name = memWidecpy(name);
  82. tmp->times = times;
  83. tmp->next = NULL;
  84. return tmp;
  85. }
  86. DefaultVar *freeDefaultVar(DefaultVar *dv) {
  87. DefaultVar *next = dv->next;
  88. memFree(dv->name);
  89. memFree(dv);
  90. return next;
  91. }
  92. DefaultVar *connectDefaultVar(DefaultVar *base, wchar_t *name, vint times) {
  93. for (DefaultVar **tmp = &base; PASS; tmp = &(*tmp)->next){
  94. if (*tmp == NULL){
  95. *tmp = makeDefaultVar(name, times);
  96. break;
  97. }
  98. if (eqWide((*tmp)->name, name)){
  99. (*tmp)->times = times;
  100. break;
  101. }
  102. }
  103. return base;
  104. }
  105. vint findDefault(DefaultVar *base, wchar_t *name) {
  106. for (DefaultVar **tmp = &base; *tmp != NULL; tmp = &(*tmp)->next)
  107. if (eqWide((*tmp)->name, name))
  108. return (*tmp)->times;
  109. return 0;
  110. }
  111. /**
  112. * hashTable使用time33算法
  113. * @param key
  114. * @return
  115. */
  116. vhashn time33(wchar_t *key){ // hash func
  117. vhashn hash = 5381;
  118. while(*key)
  119. hash += (hash << (vhashn)5) + (*key++);
  120. return (hash & (vhashn)0x7FFFFFFF) % MAX_SIZE;
  121. }
  122. static void addVarCore(Var **base, wchar_t *name, LinkValue *value, LinkValue *name_, Inter *inter) {
  123. for (PASS; true; base = &(*base)->next) {
  124. if (*base == NULL) {
  125. *base = makeVar(name, value, name_, inter);
  126. break;
  127. } else if (eqWide((*base)->name, name)) {
  128. (*base)->value = value;
  129. break;
  130. }
  131. }
  132. }
  133. void addVar(wchar_t *name, LinkValue *value, LinkValue *name_, Inter *inter, HashTable *ht) {
  134. vhashn index = time33(name);
  135. addVarCore(&ht->hashtable[index], name, value, name_, inter);
  136. }
  137. void updateHashTable(HashTable *update, HashTable *new, Inter *inter) {
  138. for (int i = 0; i < MAX_SIZE; i++)
  139. for (Var *tmp = new->hashtable[i]; tmp != NULL; tmp = tmp->next)
  140. addVarCore(&update->hashtable[i], tmp->name, tmp->value, tmp->name_, inter);
  141. }
  142. LinkValue *findVar(wchar_t *name, VarOperation operating, Var **re, HashTable *ht) {
  143. LinkValue *tmp = NULL;
  144. vhashn index = time33(name);
  145. for (Var **base = &ht->hashtable[index]; *base != NULL; base = &(*base)->next){
  146. if (eqWide((*base)->name, name)){
  147. tmp = (*base)->value;
  148. if (operating == del_var) {
  149. Var *next = (*base)->next;
  150. (*base)->next = NULL;
  151. *base = next;
  152. }
  153. if (re != NULL)
  154. *re = *base; // 返回值
  155. goto return_;
  156. }
  157. }
  158. return_: return tmp;
  159. }
  160. /**
  161. * @param name
  162. * @param times
  163. * @param operating read_var-不复制读取 get_var-复制读取 del_var-删除且返回(不复制)
  164. * @param inter
  165. * @param var_list
  166. * @return
  167. */
  168. LinkValue *findFromVarList(wchar_t *name, vint times, Var **re, VarOperation operating, FUNC_CORE) {
  169. LinkValue *tmp = NULL;
  170. vint base = findDefault(var_list->default_var, name) + times;
  171. for (vint i = 0; i < base && var_list->next != NULL; i++)
  172. var_list = var_list->next;
  173. if (operating == del_var && var_list != NULL)
  174. tmp = findVar(name, del_var, re, var_list->hashtable);
  175. else {
  176. for (PASS; var_list != NULL && tmp == NULL; var_list = var_list->next)
  177. tmp = findVar(name, operating, re, var_list->hashtable);
  178. }
  179. return tmp;
  180. }
  181. void addFromVarList(wchar_t *name, LinkValue *name_, vint times, LinkValue *value, FUNC_CORE) {
  182. vint base = findDefault(var_list->default_var, name) + times;
  183. for (vint i = 0; i < base && var_list->next != NULL; i++)
  184. var_list = var_list->next;
  185. addVar(name, value, name_, inter, var_list->hashtable);
  186. }
  187. VarList *pushVarList(VarList *base, Inter *inter){
  188. VarList *new = makeVarList(inter, true, NULL);
  189. new->next = base;
  190. return new;
  191. }
  192. VarList *copyVarList(VarList *base, bool n_new, Inter *inter){
  193. VarList *new = NULL;
  194. VarList **tmp = &new;
  195. for (int i=0; base != NULL; tmp = &(*tmp)->next, base = base->next,i++)
  196. *tmp = copyVarListCore(base, inter);
  197. if (n_new)
  198. return pushVarList(new, inter);
  199. return new;
  200. }
  201. VarList *makeObjectVarList(Inherit *value, Inter *inter, VarList *base) {
  202. VarList *tmp = base == NULL ? makeVarList(inter, true, NULL) : base;
  203. VarList *next = tmp;
  204. assert(tmp != NULL);
  205. while (next->next != NULL)
  206. next = next->next;
  207. for (PASS; value != NULL;next = next->next, value = value->next)
  208. next->next = copyVarListCore(value->value->value->object.var, inter); // 复制一个
  209. return tmp;
  210. }