Lines Matching refs:NODE
47 typedef INT16 NODE;
104 NODE
106 IN NODE q,
113 IN NODE q,
115 IN NODE r
121 IN NODE Old
272 STATIC NODE mPos, mMatchPos, mAvail, *mPosition, *mParent, *mPrev, *mNext = NULL;
519 NODE i;
530 mNext[i] = (NODE)(i + 1);
541 NODE
543 IN NODE q,
550 Find child node given the parent node and the edge character
554 q - the parent node
559 The child node (NIL if not found)
563 NODE r;
577 IN NODE q,
579 IN NODE r
585 Create a new child for a given parent node.
589 q - the parent node
591 r - the child node
597 NODE h, t;
599 h = (NODE)HASH(q, c);
612 NODE Old
618 Split a node.
622 Old - the node to split
628 NODE New, t;
661 NODE q, r, j, t;
670 // The usage of PERC_FLAG ensures proper node deletion
688 mPosition[t] = (NODE)(mPos | PERC_FLAG);
709 // Node split or creation is involved.
718 mMatchPos = (NODE)(mPosition[r] & ~PERC_FLAG);
777 NODE q, r, s, t, u;
792 t = (NODE)(mPosition[r] & ~PERC_FLAG);
884 NODE LastMatchPos;
1393 i - the top node
