1795     int     breakPos = -1;  in next()  local
1936     breakPos = p2;  in next()
1937     return breakPos;  in next()
2121     int     breakPos = -1;  in next()  local
2303     breakPos = p2;  in next()
2304     return breakPos;  in next()
2495     int     breakPos = -1;  in next()  local
2651     breakPos = p2;  in next()
2652     return breakPos;  in next()
4115         int32_t breakPos = 0;  in RunMonkey()  local
4118             breakPos = mk.next(breakPos);  in RunMonkey()
4119             if (breakPos == -1) {  in RunMonkey()
4122             if (breakPos > testText.length()) {  in RunMonkey()
4125             expectedBreaks[breakPos] = 1;  in RunMonkey()
4176             breakPos = bi->following(i);  in RunMonkey()
4177             if (breakPos <= i ||  in RunMonkey()
4178                 breakPos < lastBreakPos ||  in RunMonkey()
4179                 breakPos > testText.length() ||  in RunMonkey()
4180                 (breakPos > lastBreakPos && lastBreakPos > i)) {  in RunMonkey()
4184                          name, seed, i, breakPos, lastBreakPos);  in RunMonkey()
4187             followingBreaks[breakPos] = 1;  in RunMonkey()
4188             lastBreakPos = breakPos;  in RunMonkey()
4196             breakPos = bi->preceding(i);  in RunMonkey()
4197             if (breakPos >= i ||  in RunMonkey()
4198                 breakPos > lastBreakPos ||  in RunMonkey()
4199                 (breakPos < 0 && testText.getChar32Start(i)>0) ||  in RunMonkey()
4200                 (breakPos < lastBreakPos && lastBreakPos < testText.getChar32Start(i)) ) {  in RunMonkey()
4204                     name,  i, breakPos, lastBreakPos);  in RunMonkey()
4205                 if (breakPos >= 0 && breakPos < (int32_t)sizeof(precedingBreaks)) {  in RunMonkey()
4209                 if (breakPos >= 0) {  in RunMonkey()
4210                     precedingBreaks[breakPos] = 1;  in RunMonkey()
4212                 lastBreakPos = breakPos;  in RunMonkey()