2086     int     breakPos = -1;  in next()  local
2220     breakPos = p2;  in next()
2221     return breakPos;  in next()
2411     int     breakPos = -1;  in next()  local
2589     breakPos = p2;  in next()
2590     return breakPos;  in next()
2786     int     breakPos = -1;  in next()  local
2932     breakPos = p2;  in next()
2933     return breakPos;  in next()
4321         int32_t breakPos = 0;  in RunMonkey()  local
4324             breakPos = mk.next(breakPos);  in RunMonkey()
4325             if (breakPos == -1) {  in RunMonkey()
4328             if (breakPos > testText.length()) {  in RunMonkey()
4331             expectedBreaks[breakPos] = 1;  in RunMonkey()
4333             expected[expectedCount ++] = breakPos;  in RunMonkey()
4385             breakPos = bi->following(i);  in RunMonkey()
4386             if (breakPos <= i ||  in RunMonkey()
4387                 breakPos < lastBreakPos ||  in RunMonkey()
4388                 breakPos > testText.length() ||  in RunMonkey()
4389                 (breakPos > lastBreakPos && lastBreakPos > i)) {  in RunMonkey()
4393                          name, seed, i, breakPos, lastBreakPos);  in RunMonkey()
4396             followingBreaks[breakPos] = 1;  in RunMonkey()
4397             lastBreakPos = breakPos;  in RunMonkey()
4405             breakPos = bi->preceding(i);  in RunMonkey()
4406             if (breakPos >= i ||  in RunMonkey()
4407                 breakPos > lastBreakPos ||  in RunMonkey()
4408                 (breakPos < 0 && testText.getChar32Start(i)>0) ||  in RunMonkey()
4409                 (breakPos < lastBreakPos && lastBreakPos < testText.getChar32Start(i)) ) {  in RunMonkey()
4413                     name,  i, breakPos, lastBreakPos);  in RunMonkey()
4414                 if (breakPos >= 0 && breakPos < (int32_t)sizeof(precedingBreaks)) {  in RunMonkey()
4418                 if (breakPos >= 0) {  in RunMonkey()
4419                     precedingBreaks[breakPos] = 1;  in RunMonkey()
4421                 lastBreakPos = breakPos;  in RunMonkey()