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()
395 dest->addElement(node, *fStatus); in addRuleRootNodes()
412 UVector leafNodes(*fStatus); in calcChainedFollowPos()
413 if (U_FAILURE(*fStatus)) { in calcChainedFollowPos()
418 tree->findNodes(&leafNodes, RBBINode::leafChar, *fStatus); in calcChainedFollowPos()
419 if (U_FAILURE(*fStatus)) { in calcChainedFollowPos()
427 UVector ruleRootNodes(*fStatus); in calcChainedFollowPos()
430 UVector matchStartNodes(*fStatus); in calcChainedFollowPos()
437 if (U_FAILURE(*fStatus)) { in calcChainedFollowPos()
512 if (U_FAILURE(*fStatus)) { in bofFixup()
566 if (U_FAILURE(*fStatus)) { in buildStateTable()
575 failState = new RBBIStateDescriptor(lastInputSymbol, fStatus); in buildStateTable()
577 *fStatus = U_MEMORY_ALLOCATION_ERROR; in buildStateTable()
580 failState->fPositions = new UVector(*fStatus); in buildStateTable()
582 *fStatus = U_MEMORY_ALLOCATION_ERROR; in buildStateTable()
584 if (failState->fPositions == NULL || U_FAILURE(*fStatus)) { in buildStateTable()
587 fDStates->addElement(failState, *fStatus); in buildStateTable()
588 if (U_FAILURE(*fStatus)) { in buildStateTable()
594 initialState = new RBBIStateDescriptor(lastInputSymbol, fStatus); in buildStateTable()
596 *fStatus = U_MEMORY_ALLOCATION_ERROR; in buildStateTable()
598 if (U_FAILURE(*fStatus)) { in buildStateTable()
601 initialState->fPositions = new UVector(*fStatus); in buildStateTable()
603 *fStatus = U_MEMORY_ALLOCATION_ERROR; in buildStateTable()
605 if (U_FAILURE(*fStatus)) { in buildStateTable()
609 fDStates->addElement(initialState, *fStatus); in buildStateTable()
610 if (U_FAILURE(*fStatus)) { in buildStateTable()
646 U = new UVector(*fStatus); in buildStateTable()
648 *fStatus = U_MEMORY_ALLOCATION_ERROR; in buildStateTable()
677 … RBBIStateDescriptor *newState = new RBBIStateDescriptor(lastInputSymbol, fStatus); in buildStateTable()
679 *fStatus = U_MEMORY_ALLOCATION_ERROR; in buildStateTable()
681 if (U_FAILURE(*fStatus)) { in buildStateTable()
685 fDStates->addElement(newState, *fStatus); in buildStateTable()
686 if (U_FAILURE(*fStatus)) { in buildStateTable()
710 fLookAheadRuleMap = new UVector32(fRB->fScanner->numRules() + 1, *fStatus); in mapLookAheadRules()
712 *fStatus = U_MEMORY_ALLOCATION_ERROR; in mapLookAheadRules()
714 if (U_FAILURE(*fStatus)) { in mapLookAheadRules()
786 if (U_FAILURE(*fStatus)) { in flagAcceptingStates()
789 UVector endMarkerNodes(*fStatus); in flagAcceptingStates()
794 if (U_FAILURE(*fStatus)) { in flagAcceptingStates()
798 fTree->findNodes(&endMarkerNodes, RBBINode::endMark, *fStatus); in flagAcceptingStates()
799 if (U_FAILURE(*fStatus)) { in flagAcceptingStates()
839 if (U_FAILURE(*fStatus)) { in flagLookAheadStates()
842 UVector lookAheadNodes(*fStatus); in flagLookAheadStates()
847 fTree->findNodes(&lookAheadNodes, RBBINode::lookAhead, *fStatus); in flagLookAheadStates()
848 if (U_FAILURE(*fStatus)) { in flagLookAheadStates()
881 if (U_FAILURE(*fStatus)) { in flagTaggedStates()
884 UVector tagNodes(*fStatus); in flagTaggedStates()
889 if (U_FAILURE(*fStatus)) { in flagTaggedStates()
892 fTree->findNodes(&tagNodes, RBBINode::tag, *fStatus); in flagTaggedStates()
893 if (U_FAILURE(*fStatus)) { in flagTaggedStates()
937 fRB->fRuleStatusVals->addElement(1, *fStatus); // Num of statuses in group in mergeRuleStatusVals()
938 fRB->fRuleStatusVals->addElement((int32_t)0, *fStatus); // and our single status of zero in mergeRuleStatusVals()
990 fRB->fRuleStatusVals->addElement(thisStatesTagValues->size(), *fStatus); in mergeRuleStatusVals()
992 fRB->fRuleStatusVals->addElement(thisStatesTagValues->elementAti(i), *fStatus); in mergeRuleStatusVals()
1016 *vector = new UVector(*fStatus); in sortedAdd()
1018 if (*vector == NULL || U_FAILURE(*fStatus)) { in sortedAdd()
1033 vec->insertElementAt(val, i, *fStatus); in sortedAdd()
1075 dest->setSize(sourceSize+destOriginalSize, *fStatus); in setAdd()
1076 if (U_FAILURE(*fStatus)) { in setAdd()
1103 dest->setSize(di, *fStatus); in setAdd()
1376 if (U_FAILURE(*fStatus) || fTree == NULL) { in exportTable()
1383 *fStatus = U_BRK_INTERNAL_ERROR; in exportTable()
1598 if (U_FAILURE(*fStatus) || fSafeTable == nullptr) { in exportSafeTable()
1605 *fStatus = U_BRK_INTERNAL_ERROR; in exportSafeTable()
1775 RBBIStateDescriptor::RBBIStateDescriptor(int lastInputSymbol, UErrorCode *fStatus) { in RBBIStateDescriptor() argument
1784 fDtran = new UVector32(lastInputSymbol+1, *fStatus); in RBBIStateDescriptor()
1785 if (U_FAILURE(*fStatus)) { in RBBIStateDescriptor()
1789 *fStatus = U_MEMORY_ALLOCATION_ERROR; in RBBIStateDescriptor()