Lines Matching refs:NODE
24 typedef INT32 NODE;
84 NODE
86 IN NODE NodeQ,
93 IN NODE NodeQ,
95 IN NODE NodeR
101 IN NODE Old
260 STATIC NODE mPos, mMatchPos, mAvail, *mPosition, *mParent, *mPrev, *mNext = NULL;
515 NODE Index;
528 mNext[Index] = (NODE) (Index + 1);
538 NODE
540 IN NODE NodeQ,
547 Find child node given the parent node and the edge character
551 NodeQ - the parent node
556 The child node (NIL if not found)
560 NODE NodeR;
577 IN NODE Parent,
579 IN NODE Child
585 Create a new child for a given parent node.
589 Parent - the parent node
591 Child - the child node
597 NODE Node1;
598 NODE Node2;
600 Node1 = (NODE) HASH (Parent, CharC);
613 NODE Old
619 Split a node.
623 Old - the node to split
629 NODE New;
630 NODE TempNode;
665 NODE NodeQ;
666 NODE NodeR;
667 NODE Index2;
668 NODE NodeT;
678 // The usage of PERC_FLAG ensures proper node deletion
682 NodeR = (NODE) ((mMatchPos + 1) | WNDSIZ);
701 mPosition[NodeT] = (NODE) (mPos | (UINT32) PERC_FLAG);
707 NodeQ = (NODE) (mText[mPos] + WNDSIZ);
721 // Node split or creation is involved.
729 mMatchPos = (NODE) (mPosition[NodeR] & (UINT32)~PERC_FLAG);
798 NODE NodeQ;
799 NODE NodeR;
800 NODE NodeS;
801 NODE NodeT;
802 NODE NodeU;
823 NodeT = (NODE) (mPosition[NodeR] & (UINT32)~PERC_FLAG);
841 mPosition[NodeQ] = (NODE) (NodeS | WNDSIZ);
855 mPosition[NodeQ] = (NODE) (NodeS | WNDSIZ | (UINT32) PERC_FLAG);
930 NODE LastMatchPos;
1506 Index - the top node
