Lines Matching refs:NODE
36 typedef INT16 NODE;
94 NODE
96 IN NODE q,
103 IN NODE q,
105 IN NODE r
111 IN NODE Old
262 STATIC NODE mPos, mMatchPos, mAvail, *mPosition, *mParent, *mPrev, *mNext = NULL;
509 NODE i;
520 mNext[i] = (NODE)(i + 1);
531 NODE
533 IN NODE q,
540 Find child node given the parent node and the edge character
544 q - the parent node
549 The child node (NIL if not found)
553 NODE r;
567 IN NODE q,
569 IN NODE r
575 Create a new child for a given parent node.
579 q - the parent node
581 r - the child node
587 NODE h, t;
589 h = (NODE)HASH(q, c);
602 NODE Old
608 Split a node.
612 Old - the node to split
618 NODE New, t;
651 NODE q, r, j, t;
660 // The usage of PERC_FLAG ensures proper node deletion
678 mPosition[t] = (NODE)(mPos | PERC_FLAG);
699 // Node split or creation is involved.
708 mMatchPos = (NODE)(mPosition[r] & ~PERC_FLAG);
767 NODE q, r, s, t, u;
782 t = (NODE)(mPosition[r] & ~PERC_FLAG);
874 NODE LastMatchPos;
1383 i - the top node
