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