Searched refs:node (Results 1 - 25 of 39) sorted by relevance

12

/ast/src/lib/libvcodex/Vchuff/
H A Dvchtrie.c37 { short node; member in struct:_node_s
49 Node_t* root; /* parent node of the new table */
57 short *node, *size; local
71 if(!(node = (short*)malloc(2*s*sizeof(short))) )
73 size = node+s;
74 memcpy(node, trie->node, trie->next*sizeof(short));
76 if(trie->node)
77 free(trie->node);
78 trie->node
[all...]
H A Dvchuff.h28 /* A Huffman decoding trie is stored in Vchtrie_t.node and Vchtrie_t.size.
31 ** the bits corresponding to this byte. node[p] is the byte.
34 ** next level. node[p] is the base of the next level.
38 { short* node; /* data or next trie base to look up */ member in struct:_vchtrie_s
H A Dvchuffman.c162 short *node, *size; local
198 node = huff->trie->node;
209 *o = (Vcchar_t)node[p]; /* decode the byte */
218 sz = -size[p]; p = node[p]; /* trie recursion */
/ast/src/lib/libvgraph/
H A Dgrsearch.c10 Grnode_t* node; /* search stack */ member in struct:_dfsgraph_s
H A Dgraph.c19 static void nodefree(Dt_t* nodes, Void_t* node, Dtdisc_t* disc) argument
24 if(node)
26 (*gr->disc->eventf)(gr, GR_NODE|GR_CLOSING, node, gr->disc ); local
28 for(dt = ((Grnode_t*)node)->data; dt; dt = next)
33 free(node);
73 Grnode_t node, *nd; local
80 /* see if the node already exists */
81 node.label = label;
82 nd = dtsearch(gr->nodes, &node);
84 if(type < 0) /* deleting a node */
[all...]
/ast/src/cmd/ksh93/tests/
H A Dtreemove.sh70 # add node to tree which uses "typeset -m" to move a local variable
76 typeset -C node
77 node.one="hello"
78 node.two="world"
81 typeset -m tr.subtree["a_node"]=node
90 nameref node=tr.subtree["a_node"]
91 node.one="hello"
92 node.two="world"
H A Dnameref.sh407 nameref node=var.foo
408 node=bar
503 nameref node=treename.nodes[4]
504 node=()
505 typeset +p node.elements
524 nameref node=$1
525 compound -A node.elements
526 node.elements[/]=(filepath=foobar)
H A Dvartree2.sh57 nameref node=srcdata.hashnodes["${index}"]
59 for i in "${node.xlfd[@]}" ; do
88 new_index="${node.name}"
90 # skip if the leaf node already exists
124 nameref node=srcdata.hashnodes["${index}"]
126 for i in "${node.xlfd[@]}" ; do
155 new_index="${node.name}"
157 # skip if the leaf node already exists
297 # remove parent node (array element) and then check whether the child is gone, too:
301 ) && err_exit "global: parent node remove
[all...]
H A Dvartree1.sh52 nameref node=srcdata.hashnodes["${index}"]
54 for i in "${node.xlfd[@]}" ; do
84 new_index="${node.name}"
86 # skip if the leaf node already exists
H A Dcomvar.sh503 typeset -C node
504 node.one="hello"
505 node.two="world"
508 typeset -m tr.subtree["a_node"]=node
/ast/src/cmd/kshlib/dbm_t/
H A Ddbm_t.c65 Namval_t node; member in struct:dbm_array
112 ap->node.nvname = ap->name;
115 ap->node.nvname = ap->key.dptr;
131 ap->node.nvname = ap->key.dptr;
132 sfprintf(ap->strbuf,"%s=%s\0",nv_name(&ap->node),val);
138 ap->vallen = check_size(&ap->node.nvalue,ap->vallen,data.dsize);
139 memcpy(ap->node.nvalue,data.dptr,data.dsize);
140 ap->node.nvalue[data.dsize] = 0;
142 ap->cur = &ap->node;
161 if(ap->node
[all...]
/ast/src/cmd/pack/
H A Dhuffinit.c37 int node; member in struct:__anon177
88 heap[n].node = i;
98 parent[heap[1].node] = ++lastnode;
103 parent[heap[1].node] = lastnode;
104 heap[1].node = lastnode;
/ast/src/cmd/ksh93/bltins/
H A Dalarm.c41 Namval_t *node; member in struct:tevent
104 register char *name = nv_name(tp->node);
111 sfprintf(sfstdout,e_alrm2,name,nv_getnum(tp->node));
144 sh_fun(tp->action,tp->node,(char**)0);
148 nv_unset(tp->node);
149 nv_close(tp->node);
270 tp->node = np;
H A Dmkservice.c124 Namval_t* node; member in struct:Service_s
178 nv_unset(sp->node);
299 if (sh_fun(nq, sp->node, av))
327 r=sh_fun(nq, sp->node, av);
338 if(sp->node)
339 nv_unset(sp->node);
442 sp->node = 0;
454 sp->node = np;
/ast/src/cmd/std/
H A Dtsort.c61 Node_t* node; member in struct:List_s
79 if (visit(p->node))
124 p->node = head;
/ast/src/lib/libcmd/
H A Dexpr.c495 Node_t node; local
525 if (expr_or(&state, &node))
527 if (node.type&T_STR)
529 if (*node.str)
530 sfprintf(sfstdout,"%s\n",node.str);
533 sfprintf(sfstdout,"%d\n",node.num);
534 return numeric(&node)?node.num==0:*node.str==0;
/ast/src/lib/libodelta/
H A Dsuftree.c31 ** instead of being stored in an array, the children of a node
62 static Suftree *child_find(Suftree* node, Element c) argument
67 for(np = CHILD(node); np; np = SIBLING(np))
76 SIBLING(np) = CHILD(node);
77 CHILD(node) = np;
109 ** tree node that points to the longest prefix
110 ** that terminates at a node in the current tree.
111 ** locus: defines a tree node to be constructed that
141 /* make root node */
214 /* make an internal node labele
[all...]
/ast/src/lib/libexpr/
H A Dexeval.c131 register Exnode_t* node; local
142 if (node = (dp->fmt == '*') ? fmt->args->param[dp->size] : fmt->args->arg)
143 fmt->value = exeval(fmt->expr, node, fmt->env);
152 node = fmt->actuals->data.operand.left;
153 from = node->type;
178 fmt->value = exeval(fmt->expr, node, fmt->env);
181 node = excast(fmt->expr, node, to, NiL, 0);
182 fmt->value = exeval(fmt->expr, node, fmt->env);
183 node
351 register Exnode_t* node; local
[all...]
/ast/src/cmd/ksh93/sh/
H A Darith.c79 /* do binding to node now */
459 Namval_t *mp,node; local
461 memset(&node,0,sizeof(node));
462 nv_clone(mp,&node,0);
463 nv_offattr(&node,NV_RDONLY|NV_NOFREE);
464 nv_putval(&node,np->nvname,0);
465 if(nv_isattr(&node,NV_NOFREE))
466 return(r=nv_getnum(&node));
H A Dxec.c79 Namval_t *node; member in struct:funenv
671 static int set_instance(Shell_t *shp,Namval_t *nq, Namval_t *node, struct Namref *nr) argument
700 memcpy(node,L_ARGNOD,sizeof(*node));
713 static void unset_instance(Namval_t *nq, Namval_t *node, struct Namref *nr,long mode) argument
715 L_ARGNOD->nvalue.nrp = node->nvalue.nrp;
716 L_ARGNOD->nvflag = node->nvflag;
717 L_ARGNOD->nvfun = node->nvfun;
1486 Namval_t node, *namespace=0; local
1488 Namval_t node; local
3282 Namval_t node,*mp,*np, *nref[9], **nr=nref; local
3541 Namval_t node; local
[all...]
/ast/src/lib/libast/regex/
H A Dregcomp.c137 * allocate a new Rex_t node
141 #define node(a,b,c,d,e) node(a,b,c,d,e, const char* file, unsigned int line) macro
145 node(Cenv_t* env, int type, int lo, int hi, size_t extra) function
149 DEBUG_TEST(0x0800,(sfprintf(sfstdout, "%s:%d node(%d,%d,%d,%u)\n", file, line, type, lo, hi, sizeof(Rex_t) + extra)),(0));
167 #undef node macro
168 #define node(a,b,c,d,e) node(a,b,c,d,e,__FILE__,__LINE__) macro
172 * free a Trie_node_t node
187 * free a Rex_t node
[all...]
/ast/src/lib/libz/
H A Dtrees.c427 /* Index within the heap array of least frequent node in the Huffman tree */
450 * Restore the heap property by moving down the tree starting at node k,
451 * exchanging a node with the smallest of its two sons if necessary, stopping
458 int k; /* node to move down */
521 if (n > max_code) continue; /* not a leaf node */
628 int node; /* new node being created */ local
651 node = s->heap[++(s->heap_len)] = (max_code < 2 ? ++max_code : 0);
652 tree[node].Freq = 1;
653 s->depth[node]
[all...]
/ast/src/lib/libast/vmalloc/
H A Dvmbest.c50 static int vmintree(Block_t* node, Block_t* b) argument
52 static int vmintree(node,b)
53 Block_t* node;
58 for(t = node; t; t = LINK(t))
61 if(LEFT(node) && vmintree(LEFT(node),b))
63 if(RIGHT(node) && vmintree(RIGHT(node),b))
139 static int vmchktree(Block_t* node) argument
141 static int vmchktree(node)
[all...]
/ast/src/cmd/tw/
H A Dexpr.c201 getval(Expr_t* pgm, Exnode_t* node, Exid_t* sym, Exref_t* ref, void* env, int elt, Exdisc_t* disc) argument
215 NoP(node);
246 v.string = sum((Exsum_t*)node->local.pointer, PATH(ftw));
285 v.string = sum((Exsum_t*)node->local.pointer, PATH(ftw));
376 sp = (Exsum_t*)node->local.pointer;
431 refval(Expr_t* pgm, Exnode_t* node, Exid_t* sym, Exref_t* ref, char* str, int elt, Exdisc_t* disc) argument
444 return getval(pgm, node, sym, ref, &ftwbuf, elt, disc);
581 node->local.pointer = (char*)sp;
594 setval(Expr_t* pgm, Exnode_t* node, Exid_t* sym, Exref_t* ref, void* env, int elt, Extype_t val, Exdisc_t* disc) argument
602 NoP(node);
[all...]
/ast/src/cmd/codexlib/lzh/
H A Dlzh.c90 short node[TREESIZE / 2]; member in struct:State_s
474 state->node[~j] = i;
505 state->node[~r] = q;
509 state->node[~s] = p;
537 q = state->node[p];
555 q = state->node[p + N_CHAR];
571 state->node[~(state->child[r] = state->child[state->most_p])] = r;
584 = state->node[p + N_CHAR] = state->most_p = q;
681 state->node[i] = j;
735 state->node[N_CHA
[all...]

Completed in 99 milliseconds

12