30     fStatus             = fRB->fStatus;  in RBBITableBuilder()
33     if (U_FAILURE(*fStatus)) {  in RBBITableBuilder()
37         *fStatus = status;  in RBBITableBuilder()
41         *fStatus = U_MEMORY_ALLOCATION_ERROR;;  in RBBITableBuilder()
64     if (U_FAILURE(*fStatus)) {  in build()
97             *fStatus = U_MEMORY_ALLOCATION_ERROR;  in build()
117         *fStatus = U_MEMORY_ALLOCATION_ERROR;  in build()
125         *fStatus = U_MEMORY_ALLOCATION_ERROR;  in build()
259         n->fFirstPosSet->addElement(n, *fStatus);  in calcFirstPos()
305         n->fLastPosSet->addElement(n, *fStatus);  in calcLastPos()
387     UVector         endMarkerNodes(*fStatus);  in calcChainedFollowPos()
388     UVector         leafNodes(*fStatus);  in calcChainedFollowPos()
391     if (U_FAILURE(*fStatus)) {  in calcChainedFollowPos()
396     tree->findNodes(&endMarkerNodes, RBBINode::endMark, *fStatus);  in calcChainedFollowPos()
399     tree->findNodes(&leafNodes, RBBINode::leafChar, *fStatus);  in calcChainedFollowPos()
400     if (U_FAILURE(*fStatus)) {  in calcChainedFollowPos()
491     if (U_FAILURE(*fStatus)) {  in bofFixup()
545     if (U_FAILURE(*fStatus)) {  in buildStateTable()
554     failState = new RBBIStateDescriptor(lastInputSymbol, fStatus);  in buildStateTable()
556         *fStatus = U_MEMORY_ALLOCATION_ERROR;  in buildStateTable()
559     failState->fPositions = new UVector(*fStatus);  in buildStateTable()
561         *fStatus = U_MEMORY_ALLOCATION_ERROR;  in buildStateTable()
563     if (failState->fPositions == NULL || U_FAILURE(*fStatus)) {  in buildStateTable()
566     fDStates->addElement(failState, *fStatus);  in buildStateTable()
567     if (U_FAILURE(*fStatus)) {  in buildStateTable()
573     initialState = new RBBIStateDescriptor(lastInputSymbol, fStatus);  in buildStateTable()
575         *fStatus = U_MEMORY_ALLOCATION_ERROR;  in buildStateTable()
577     if (U_FAILURE(*fStatus)) {  in buildStateTable()
580     initialState->fPositions = new UVector(*fStatus);  in buildStateTable()
582         *fStatus = U_MEMORY_ALLOCATION_ERROR;  in buildStateTable()
584     if (U_FAILURE(*fStatus)) {  in buildStateTable()
588     fDStates->addElement(initialState, *fStatus);  in buildStateTable()
589     if (U_FAILURE(*fStatus)) {  in buildStateTable()
625                         U = new UVector(*fStatus);  in buildStateTable()
627                         	*fStatus = U_MEMORY_ALLOCATION_ERROR;  in buildStateTable()
656 …                 RBBIStateDescriptor *newState = new RBBIStateDescriptor(lastInputSymbol, fStatus);  in buildStateTable()
658                     	*fStatus = U_MEMORY_ALLOCATION_ERROR;  in buildStateTable()
660                     if (U_FAILURE(*fStatus)) {  in buildStateTable()
664                     fDStates->addElement(newState, *fStatus);  in buildStateTable()
665                     if (U_FAILURE(*fStatus)) {  in buildStateTable()
695     if (U_FAILURE(*fStatus)) {  in flagAcceptingStates()
698     UVector     endMarkerNodes(*fStatus);  in flagAcceptingStates()
703     if (U_FAILURE(*fStatus)) {  in flagAcceptingStates()
707     fTree->findNodes(&endMarkerNodes, RBBINode::endMark, *fStatus);  in flagAcceptingStates()
708     if (U_FAILURE(*fStatus)) {  in flagAcceptingStates()
757     if (U_FAILURE(*fStatus)) {  in flagLookAheadStates()
760     UVector     lookAheadNodes(*fStatus);  in flagLookAheadStates()
765     fTree->findNodes(&lookAheadNodes, RBBINode::lookAhead, *fStatus);  in flagLookAheadStates()
766     if (U_FAILURE(*fStatus)) {  in flagLookAheadStates()
790     if (U_FAILURE(*fStatus)) {  in flagTaggedStates()
793     UVector     tagNodes(*fStatus);  in flagTaggedStates()
798     if (U_FAILURE(*fStatus)) {  in flagTaggedStates()
801     fTree->findNodes(&tagNodes, RBBINode::tag, *fStatus);  in flagTaggedStates()
802     if (U_FAILURE(*fStatus)) {  in flagTaggedStates()
846         fRB->fRuleStatusVals->addElement(1, *fStatus);  // Num of statuses in group  in mergeRuleStatusVals()
847         fRB->fRuleStatusVals->addElement((int32_t)0, *fStatus);  //   and our single status of zero  in mergeRuleStatusVals()
899             fRB->fRuleStatusVals->addElement(thisStatesTagValues->size(), *fStatus);  in mergeRuleStatusVals()
901                 fRB->fRuleStatusVals->addElement(thisStatesTagValues->elementAti(i), *fStatus);  in mergeRuleStatusVals()
925         *vector = new UVector(*fStatus);  in sortedAdd()
927     if (*vector == NULL || U_FAILURE(*fStatus)) {  in sortedAdd()
942     vec->insertElementAt(val, i, *fStatus);  in sortedAdd()
982     dest->setSize(sourceSize+destOriginalSize, *fStatus);  in setAdd()
1007     dest->setSize(di, *fStatus);  in setAdd()
1097     if (U_FAILURE(*fStatus) || fTree == NULL) {  in exportTable()
1103         *fStatus = U_BRK_INTERNAL_ERROR;  in exportTable()
1225 RBBIStateDescriptor::RBBIStateDescriptor(int lastInputSymbol, UErrorCode *fStatus) {  in RBBIStateDescriptor()  argument
1234     fDtran     = new UVector(lastInputSymbol+1, *fStatus);  in RBBIStateDescriptor()
1235     if (U_FAILURE(*fStatus)) {  in RBBIStateDescriptor()
1239         *fStatus = U_MEMORY_ALLOCATION_ERROR;  in RBBIStateDescriptor()
1242     fDtran->setSize(lastInputSymbol+1, *fStatus);    // fDtran needs to be pre-sized.  in RBBIStateDescriptor()