28  fTree(*rootNode) {  in RBBITableBuilder()
70     if (fTree==NULL) {  in build()
78     fTree = fTree->flattenVariables();  in build()
82         fTree->printTree(TRUE);  in build()
103         bofTop->fRightChild = fTree;  in build()
106         fTree               = bofTop;  in build()
120     cn->fLeftChild = fTree;  in build()
121     fTree->fParent = cn;  in build()
130     fTree = cn;  in build()
136     fTree->flattenSets();  in build()
140         fTree->printTree(TRUE);  in build()
152     calcNullable(fTree);  in build()
153     calcFirstPos(fTree);  in build()
154     calcLastPos(fTree);  in build()
155     calcFollowPos(fTree);  in build()
158         printPosSets(fTree);  in build()
165         calcChainedFollowPos(fTree);  in build()
505     RBBINode  *bofNode = fTree->fLeftChild->fLeftChild;  in bofFixup()
514     UVector *matchStartNodes = fTree->fLeftChild->fRightChild->fFirstPosSet;  in bofFixup()
587     setAdd(initialState->fPositions, fTree->fFirstPosSet);  in buildStateTable()
707     fTree->findNodes(&endMarkerNodes, RBBINode::endMark, *fStatus);  in flagAcceptingStates()
765     fTree->findNodes(&lookAheadNodes, RBBINode::lookAhead, *fStatus);  in flagLookAheadStates()
801     fTree->findNodes(&tagNodes, RBBINode::tag, *fStatus);  in flagTaggedStates()
1066     if (fTree == NULL) {  in getTableSize()
1097     if (U_FAILURE(*fStatus) || fTree == NULL) {  in exportTable()