68     fData = new RBBIDataWrapper(data, status); // status checked in constructor  in UOBJECT_DEFINE_RTTI_IMPLEMENTATION()
70     if(fData == nullptr) {  in UOBJECT_DEFINE_RTTI_IMPLEMENTATION()
74     if (fData->fForwardTable->fLookAheadResultsSize > 0) {  in UOBJECT_DEFINE_RTTI_IMPLEMENTATION()
76             uprv_malloc(fData->fForwardTable->fLookAheadResultsSize * sizeof(int32_t)));  in UOBJECT_DEFINE_RTTI_IMPLEMENTATION()
118     fData = new RBBIDataWrapper(data, RBBIDataWrapper::kDontAdopt, status);  in RuleBasedBreakIterator()
120     if(fData == nullptr) {  in RuleBasedBreakIterator()
124     if (fData->fForwardTable->fLookAheadResultsSize > 0) {  in RuleBasedBreakIterator()
126             uprv_malloc(fData->fForwardTable->fLookAheadResultsSize * sizeof(int32_t)));  in RuleBasedBreakIterator()
144     fData = new RBBIDataWrapper(udm, status); // status checked in constructor  in RuleBasedBreakIterator()
146     if(fData == nullptr) {  in RuleBasedBreakIterator()
150     if (fData->fForwardTable->fLookAheadResultsSize > 0) {  in RuleBasedBreakIterator()
152             uprv_malloc(fData->fForwardTable->fLookAheadResultsSize * sizeof(int32_t)));  in RuleBasedBreakIterator()
254     if (fData != nullptr) {  in ~RuleBasedBreakIterator()
255         fData->removeReference();  in ~RuleBasedBreakIterator()
256         fData = nullptr;  in ~RuleBasedBreakIterator()
310     if (fData != nullptr) {  in operator =()
311         fData->removeReference();  in operator =()
312         fData = nullptr;  in operator =()
314     if (that.fData != nullptr) {  in operator =()
315         fData = that.fData->addReference();  in operator =()
320     if (fData && fData->fForwardTable->fLookAheadResultsSize > 0) {  in operator =()
322             uprv_malloc(fData->fForwardTable->fLookAheadResultsSize * sizeof(int32_t)));  in operator =()
384     if (that2.fData == fData ||  in operator ==()
385         (fData != nullptr && that2.fData != nullptr && *that2.fData == *fData)) {  in operator ==()
399     if (fData != nullptr) {  in hashCode()
400         hash = fData->hashCode();  in hashCode()
737     const RBBIStateTable *statetable = fData->fForwardTable;  in handleNext()
738     bool use8BitsTrie = ucptrie_getValueWidth(fData->fTrie) == UCPTRIE_VALUE_BITS_8;  in handleNext()
755     const RBBIStateTable *statetable = fData->fReverseTable;  in handleSafePrevious()
756     bool use8BitsTrie = ucptrie_getValueWidth(fData->fTrie) == UCPTRIE_VALUE_BITS_8;  in handleSafePrevious()
789     const RBBIStateTable *statetable       = fData->fForwardTable;  in handleNext()
853             category = trieFunc(fData->fTrie, c);  in handleNext()
873         U_ASSERT(category<fData->fHeader->fCatCount);  in handleNext()
889             U_ASSERT(accepting < fData->fForwardTable->fLookAheadResultsSize);  in handleNext()
906         U_ASSERT(rule == 0 || rule < fData->fForwardTable->fLookAheadResultsSize);  in handleNext()
973     const RBBIStateTable *stateTable = fData->fReverseTable;  in handleSafePrevious()
982     if (fData == nullptr || UTEXT_GETNATIVEINDEX(&fText)==0) {  in handleSafePrevious()
1000         category = trieFunc(fData->fTrie, c);  in handleSafePrevious()
1017         U_ASSERT(category<fData->fHeader->fCatCount);  in handleSafePrevious()
1054     int32_t  idx = fRuleStatusIndex + fData->fRuleStatusTable[fRuleStatusIndex];  in getRuleStatus()
1055     int32_t  tagVal = fData->fRuleStatusTable[idx];  in getRuleStatus()
1067     int32_t  numVals = fData->fRuleStatusTable[fRuleStatusIndex];  in getRuleStatusVec()
1075         fillInVec[i] = fData->fRuleStatusTable[fRuleStatusIndex + i + 1];  in getRuleStatusVec()
1093     if (fData != nullptr) {  in getBinaryRules()
1094         retPtr = (const uint8_t *)fData->fHeader;  in getBinaryRules()
1095         length = fData->fHeader->fLength;  in getBinaryRules()
1284     fData->printData();  in dumpTables()
1293     if (fData != nullptr) {  in getRules()
1294         return fData->getRuleSourceString();  in getRules()