node 131 lib/lua/lcode.c static int patchtestreg (FuncState *fs, int node, int reg) { node 132 lib/lua/lcode.c Instruction *i = getjumpcontrol(fs, node); node 344 lib/lua/lobject.h Node *node; node 252 lib/lua/ltable.c Node *n = &t->node[i]; node 275 lib/lua/ltable.c t->node = cast(Node *, dummynode); /* use common `dummynode' */ node 284 lib/lua/ltable.c t->node = luaM_newvector(L, size, Node); node 301 lib/lua/ltable.c Node *nold = t->node; /* save old hash ... */ node 328 lib/lua/ltable.c int nsize = (t->node == dummynode) ? 0 : sizenode(t); node 367 lib/lua/ltable.c t->node = cast(Node *, dummynode); node 375 lib/lua/ltable.c if (t->node != dummynode) node 376 lib/lua/ltable.c luaM_freearray(L, t->node, sizenode(t), Node); node 383 lib/lua/ltable.c while (t->lastfree-- > t->node) { node 573 lib/lua/ltable.c else if (t->node == dummynode) /* hash part is empty? */ node 13 lib/lua/ltable.h #define gnode(t,i) (&(t)->node[i]) node 70 tools/capdis.c struct lnode *node; node 72 tools/capdis.c node = (struct lnode *) malloc (sizeof (struct lnode)); node 73 tools/capdis.c if (node == NULL) { node 77 tools/capdis.c node->address = address; node 78 tools/capdis.c node->data = data; node 79 tools/capdis.c node->next = 0; node 81 tools/capdis.c return node; node 88 tools/capdis.c struct lnode *node; node 90 tools/capdis.c node = ls->head; node 91 tools/capdis.c while ( node != NULL && node->address != address ) { node 92 tools/capdis.c node = node->next ; node 94 tools/capdis.c if (node == NULL) { node 98 tools/capdis.c return node; node 106 tools/capdis.c struct lnode *node; node 109 tools/capdis.c node = new_node(address, data); node 110 tools/capdis.c if (node == NULL) return 0; node 111 tools/capdis.c node->next = ls->head; node 112 tools/capdis.c ls->head = node; node 185 tools/chdk_dasm.c struct lnode *node; node 187 tools/chdk_dasm.c node = (struct lnode *) malloc (sizeof (struct lnode)); node 188 tools/chdk_dasm.c if (node == NULL) { node 192 tools/chdk_dasm.c node->address = address; node 193 tools/chdk_dasm.c node->data = data; node 194 tools/chdk_dasm.c node->next = 0; node 196 tools/chdk_dasm.c return node; node 203 tools/chdk_dasm.c struct lnode *node; node 205 tools/chdk_dasm.c node = ls->head; node 206 tools/chdk_dasm.c while ( node != NULL && node->address != address ) { node 207 tools/chdk_dasm.c node = node->next ; node 209 tools/chdk_dasm.c if (node == NULL) { node 213 tools/chdk_dasm.c return node; node 221 tools/chdk_dasm.c struct lnode *node; node 224 tools/chdk_dasm.c node = new_node(address, data); node 225 tools/chdk_dasm.c if (node == NULL) return 0; node 226 tools/chdk_dasm.c node->next = ls->head; node 227 tools/chdk_dasm.c ls->head = node; node 628 tools/packfi2/trees.c int node; /* new node being created */ node 651 tools/packfi2/trees.c node = s->heap[++(s->heap_len)] = (max_code < 2 ? ++max_code : 0); node 652 tools/packfi2/trees.c tree[node].Freq = 1; node 653 tools/packfi2/trees.c s->depth[node] = 0; node 654 tools/packfi2/trees.c s->opt_len--; if (stree) s->static_len -= stree[node].Len; node 667 tools/packfi2/trees.c node = elems; /* next internal node of the tree */ node 676 tools/packfi2/trees.c tree[node].Freq = tree[n].Freq + tree[m].Freq; node 677 tools/packfi2/trees.c s->depth[node] = (uch)((s->depth[n] >= s->depth[m] ? node 679 tools/packfi2/trees.c tree[n].Dad = tree[m].Dad = (ush)node; node 683 tools/packfi2/trees.c node, tree[node].Freq, n, tree[n].Freq, m, tree[m].Freq); node 687 tools/packfi2/trees.c s->heap[SMALLEST] = node++;