Lines Matching refs:fStatus
36 fStatus(&status), in RBBITableBuilder()
70 if (U_FAILURE(*fStatus)) { in buildForwardTable()
103 *fStatus = U_MEMORY_ALLOCATION_ERROR; in buildForwardTable()
123 *fStatus = U_MEMORY_ALLOCATION_ERROR; in buildForwardTable()
131 *fStatus = U_MEMORY_ALLOCATION_ERROR; in buildForwardTable()
264 n->fFirstPosSet->addElement(n, *fStatus); in calcFirstPos()
310 n->fLastPosSet->addElement(n, *fStatus); in calcLastPos()
390 if (node == NULL || U_FAILURE(*fStatus)) { in addRuleRootNodes()
394 dest->addElement(node, *fStatus); in addRuleRootNodes()
411 UVector leafNodes(*fStatus); in calcChainedFollowPos()
412 if (U_FAILURE(*fStatus)) { in calcChainedFollowPos()
417 tree->findNodes(&leafNodes, RBBINode::leafChar, *fStatus); in calcChainedFollowPos()
418 if (U_FAILURE(*fStatus)) { in calcChainedFollowPos()
426 UVector ruleRootNodes(*fStatus); in calcChainedFollowPos()
429 UVector matchStartNodes(*fStatus); in calcChainedFollowPos()
436 if (U_FAILURE(*fStatus)) { in calcChainedFollowPos()
511 if (U_FAILURE(*fStatus)) { in bofFixup()
565 if (U_FAILURE(*fStatus)) { in buildStateTable()
574 failState = new RBBIStateDescriptor(lastInputSymbol, fStatus); in buildStateTable()
576 *fStatus = U_MEMORY_ALLOCATION_ERROR; in buildStateTable()
579 failState->fPositions = new UVector(*fStatus); in buildStateTable()
581 *fStatus = U_MEMORY_ALLOCATION_ERROR; in buildStateTable()
583 if (failState->fPositions == NULL || U_FAILURE(*fStatus)) { in buildStateTable()
586 fDStates->addElement(failState, *fStatus); in buildStateTable()
587 if (U_FAILURE(*fStatus)) { in buildStateTable()
593 initialState = new RBBIStateDescriptor(lastInputSymbol, fStatus); in buildStateTable()
595 *fStatus = U_MEMORY_ALLOCATION_ERROR; in buildStateTable()
597 if (U_FAILURE(*fStatus)) { in buildStateTable()
600 initialState->fPositions = new UVector(*fStatus); in buildStateTable()
602 *fStatus = U_MEMORY_ALLOCATION_ERROR; in buildStateTable()
604 if (U_FAILURE(*fStatus)) { in buildStateTable()
608 fDStates->addElement(initialState, *fStatus); in buildStateTable()
609 if (U_FAILURE(*fStatus)) { in buildStateTable()
645 U = new UVector(*fStatus); in buildStateTable()
647 *fStatus = U_MEMORY_ALLOCATION_ERROR; in buildStateTable()
676 … RBBIStateDescriptor *newState = new RBBIStateDescriptor(lastInputSymbol, fStatus); in buildStateTable()
678 *fStatus = U_MEMORY_ALLOCATION_ERROR; in buildStateTable()
680 if (U_FAILURE(*fStatus)) { in buildStateTable()
684 fDStates->addElement(newState, *fStatus); in buildStateTable()
685 if (U_FAILURE(*fStatus)) { in buildStateTable()
709 fLookAheadRuleMap = new UVector32(fRB->fScanner->numRules() + 1, *fStatus); in mapLookAheadRules()
711 *fStatus = U_MEMORY_ALLOCATION_ERROR; in mapLookAheadRules()
713 if (U_FAILURE(*fStatus)) { in mapLookAheadRules()
785 if (U_FAILURE(*fStatus)) { in flagAcceptingStates()
788 UVector endMarkerNodes(*fStatus); in flagAcceptingStates()
793 if (U_FAILURE(*fStatus)) { in flagAcceptingStates()
797 fTree->findNodes(&endMarkerNodes, RBBINode::endMark, *fStatus); in flagAcceptingStates()
798 if (U_FAILURE(*fStatus)) { in flagAcceptingStates()
838 if (U_FAILURE(*fStatus)) { in flagLookAheadStates()
841 UVector lookAheadNodes(*fStatus); in flagLookAheadStates()
846 fTree->findNodes(&lookAheadNodes, RBBINode::lookAhead, *fStatus); in flagLookAheadStates()
847 if (U_FAILURE(*fStatus)) { in flagLookAheadStates()
880 if (U_FAILURE(*fStatus)) { in flagTaggedStates()
883 UVector tagNodes(*fStatus); in flagTaggedStates()
888 if (U_FAILURE(*fStatus)) { in flagTaggedStates()
891 fTree->findNodes(&tagNodes, RBBINode::tag, *fStatus); in flagTaggedStates()
892 if (U_FAILURE(*fStatus)) { in flagTaggedStates()
936 fRB->fRuleStatusVals->addElement(1, *fStatus); // Num of statuses in group in mergeRuleStatusVals()
937 fRB->fRuleStatusVals->addElement((int32_t)0, *fStatus); // and our single status of zero in mergeRuleStatusVals()
989 fRB->fRuleStatusVals->addElement(thisStatesTagValues->size(), *fStatus); in mergeRuleStatusVals()
991 fRB->fRuleStatusVals->addElement(thisStatesTagValues->elementAti(i), *fStatus); in mergeRuleStatusVals()
1015 *vector = new UVector(*fStatus); in sortedAdd()
1017 if (*vector == NULL || U_FAILURE(*fStatus)) { in sortedAdd()
1032 vec->insertElementAt(val, i, *fStatus); in sortedAdd()
1072 dest->setSize(sourceSize+destOriginalSize, *fStatus); in setAdd()
1097 dest->setSize(di, *fStatus); in setAdd()
1370 if (U_FAILURE(*fStatus) || fTree == NULL) { in exportTable()
1377 *fStatus = U_BRK_INTERNAL_ERROR; in exportTable()
1583 if (U_FAILURE(*fStatus) || fSafeTable == nullptr) { in exportSafeTable()
1590 *fStatus = U_BRK_INTERNAL_ERROR; in exportSafeTable()
1760 RBBIStateDescriptor::RBBIStateDescriptor(int lastInputSymbol, UErrorCode *fStatus) { in RBBIStateDescriptor() argument
1769 fDtran = new UVector32(lastInputSymbol+1, *fStatus); in RBBIStateDescriptor()
1770 if (U_FAILURE(*fStatus)) { in RBBIStateDescriptor()
1774 *fStatus = U_MEMORY_ALLOCATION_ERROR; in RBBIStateDescriptor()