Lines Matching refs:fStatus
33 fStatus(&status), in RBBITableBuilder()
66 if (U_FAILURE(*fStatus)) { in buildForwardTable()
99 *fStatus = U_MEMORY_ALLOCATION_ERROR; in buildForwardTable()
119 *fStatus = U_MEMORY_ALLOCATION_ERROR; in buildForwardTable()
127 *fStatus = U_MEMORY_ALLOCATION_ERROR; in buildForwardTable()
259 n->fFirstPosSet->addElement(n, *fStatus); in calcFirstPos()
305 n->fLastPosSet->addElement(n, *fStatus); in calcLastPos()
385 if (node == NULL || U_FAILURE(*fStatus)) { in addRuleRootNodes()
389 dest->addElement(node, *fStatus); in addRuleRootNodes()
406 UVector endMarkerNodes(*fStatus); in calcChainedFollowPos()
407 UVector leafNodes(*fStatus); in calcChainedFollowPos()
410 if (U_FAILURE(*fStatus)) { in calcChainedFollowPos()
415 tree->findNodes(&endMarkerNodes, RBBINode::endMark, *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()
515 if (U_FAILURE(*fStatus)) { in bofFixup()
569 if (U_FAILURE(*fStatus)) { in buildStateTable()
578 failState = new RBBIStateDescriptor(lastInputSymbol, fStatus); in buildStateTable()
580 *fStatus = U_MEMORY_ALLOCATION_ERROR; in buildStateTable()
583 failState->fPositions = new UVector(*fStatus); in buildStateTable()
585 *fStatus = U_MEMORY_ALLOCATION_ERROR; in buildStateTable()
587 if (failState->fPositions == NULL || U_FAILURE(*fStatus)) { in buildStateTable()
590 fDStates->addElement(failState, *fStatus); in buildStateTable()
591 if (U_FAILURE(*fStatus)) { in buildStateTable()
597 initialState = new RBBIStateDescriptor(lastInputSymbol, fStatus); in buildStateTable()
599 *fStatus = U_MEMORY_ALLOCATION_ERROR; in buildStateTable()
601 if (U_FAILURE(*fStatus)) { in buildStateTable()
604 initialState->fPositions = new UVector(*fStatus); in buildStateTable()
606 *fStatus = U_MEMORY_ALLOCATION_ERROR; in buildStateTable()
608 if (U_FAILURE(*fStatus)) { in buildStateTable()
612 fDStates->addElement(initialState, *fStatus); in buildStateTable()
613 if (U_FAILURE(*fStatus)) { in buildStateTable()
649 U = new UVector(*fStatus); in buildStateTable()
651 *fStatus = U_MEMORY_ALLOCATION_ERROR; in buildStateTable()
680 … RBBIStateDescriptor *newState = new RBBIStateDescriptor(lastInputSymbol, fStatus); in buildStateTable()
682 *fStatus = U_MEMORY_ALLOCATION_ERROR; in buildStateTable()
684 if (U_FAILURE(*fStatus)) { in buildStateTable()
688 fDStates->addElement(newState, *fStatus); in buildStateTable()
689 if (U_FAILURE(*fStatus)) { in buildStateTable()
719 if (U_FAILURE(*fStatus)) { in flagAcceptingStates()
722 UVector endMarkerNodes(*fStatus); in flagAcceptingStates()
727 if (U_FAILURE(*fStatus)) { in flagAcceptingStates()
731 fTree->findNodes(&endMarkerNodes, RBBINode::endMark, *fStatus); in flagAcceptingStates()
732 if (U_FAILURE(*fStatus)) { in flagAcceptingStates()
781 if (U_FAILURE(*fStatus)) { in flagLookAheadStates()
784 UVector lookAheadNodes(*fStatus); in flagLookAheadStates()
789 fTree->findNodes(&lookAheadNodes, RBBINode::lookAhead, *fStatus); in flagLookAheadStates()
790 if (U_FAILURE(*fStatus)) { in flagLookAheadStates()
814 if (U_FAILURE(*fStatus)) { in flagTaggedStates()
817 UVector tagNodes(*fStatus); in flagTaggedStates()
822 if (U_FAILURE(*fStatus)) { in flagTaggedStates()
825 fTree->findNodes(&tagNodes, RBBINode::tag, *fStatus); in flagTaggedStates()
826 if (U_FAILURE(*fStatus)) { in flagTaggedStates()
870 fRB->fRuleStatusVals->addElement(1, *fStatus); // Num of statuses in group in mergeRuleStatusVals()
871 fRB->fRuleStatusVals->addElement((int32_t)0, *fStatus); // and our single status of zero in mergeRuleStatusVals()
923 fRB->fRuleStatusVals->addElement(thisStatesTagValues->size(), *fStatus); in mergeRuleStatusVals()
925 fRB->fRuleStatusVals->addElement(thisStatesTagValues->elementAti(i), *fStatus); in mergeRuleStatusVals()
949 *vector = new UVector(*fStatus); in sortedAdd()
951 if (*vector == NULL || U_FAILURE(*fStatus)) { in sortedAdd()
966 vec->insertElementAt(val, i, *fStatus); in sortedAdd()
1006 dest->setSize(sourceSize+destOriginalSize, *fStatus); in setAdd()
1031 dest->setSize(di, *fStatus); in setAdd()
1301 if (U_FAILURE(*fStatus) || fTree == NULL) { in exportTable()
1308 *fStatus = U_BRK_INTERNAL_ERROR; in exportTable()
1486 if (U_FAILURE(*fStatus) || fSafeTable == nullptr) { in exportSafeTable()
1493 *fStatus = U_BRK_INTERNAL_ERROR; in exportSafeTable()
1649 RBBIStateDescriptor::RBBIStateDescriptor(int lastInputSymbol, UErrorCode *fStatus) { in RBBIStateDescriptor() argument
1658 fDtran = new UVector32(lastInputSymbol+1, *fStatus); in RBBIStateDescriptor()
1659 if (U_FAILURE(*fStatus)) { in RBBIStateDescriptor()
1663 *fStatus = U_MEMORY_ALLOCATION_ERROR; in RBBIStateDescriptor()