Lines Matching refs:NODE
26 typedef INT16 NODE;
84 NODE
86 IN NODE q,
93 IN NODE q,
95 IN NODE r
101 IN NODE Old
252 STATIC NODE mPos, mMatchPos, mAvail, *mPosition, *mParent, *mPrev, *mNext = NULL;
506 NODE i;
517 mNext[i] = (NODE)(i + 1);
528 NODE
530 IN NODE q,
537 Find child node given the parent node and the edge character
541 q - the parent node
546 The child node (NIL if not found)
550 NODE r;
564 IN NODE q,
566 IN NODE r
572 Create a new child for a given parent node.
576 q - the parent node
578 r - the child node
584 NODE h, t;
586 h = (NODE)HASH(q, c);
599 NODE Old
605 Split a node.
609 Old - the node to split
615 NODE New, t;
648 NODE q, r, j, t;
657 // The usage of PERC_FLAG ensures proper node deletion
675 mPosition[t] = (NODE)(mPos | PERC_FLAG);
696 // Node split or creation is involved.
705 mMatchPos = (NODE)(mPosition[r] & ~PERC_FLAG);
764 NODE q, r, s, t, u;
779 t = (NODE)(mPosition[r] & ~PERC_FLAG);
871 NODE LastMatchPos;
1380 i - the top node
