1683     int     breakPos = -1;  in next()  local
1824     breakPos = p2;  in next()
1825     return breakPos;  in next()
2014     int     breakPos = -1;  in next()  local
2196     breakPos = p2;  in next()
2197     return breakPos;  in next()
2388     int     breakPos = -1;  in next()  local
2544     breakPos = p2;  in next()
2545     return breakPos;  in next()
4011         int32_t breakPos = 0;  in RunMonkey()  local
4014             breakPos = mk.next(breakPos);  in RunMonkey()
4015             if (breakPos == -1) {  in RunMonkey()
4018             if (breakPos > testText.length()) {  in RunMonkey()
4021             expectedBreaks[breakPos] = 1;  in RunMonkey()
4073             breakPos = bi->following(i);  in RunMonkey()
4074             if (breakPos <= i ||  in RunMonkey()
4075                 breakPos < lastBreakPos ||  in RunMonkey()
4076                 breakPos > testText.length() ||  in RunMonkey()
4077                 (breakPos > lastBreakPos && lastBreakPos > i)) {  in RunMonkey()
4081                          name, seed, i, breakPos, lastBreakPos);  in RunMonkey()
4084             followingBreaks[breakPos] = 1;  in RunMonkey()
4085             lastBreakPos = breakPos;  in RunMonkey()
4093             breakPos = bi->preceding(i);  in RunMonkey()
4094             if (breakPos >= i ||  in RunMonkey()
4095                 breakPos > lastBreakPos ||  in RunMonkey()
4096                 (breakPos < 0 && testText.getChar32Start(i)>0) ||  in RunMonkey()
4097                 (breakPos < lastBreakPos && lastBreakPos < testText.getChar32Start(i)) ) {  in RunMonkey()
4101                     name,  i, breakPos, lastBreakPos);  in RunMonkey()
4102                 if (breakPos >= 0 && breakPos < (int32_t)sizeof(precedingBreaks)) {  in RunMonkey()
4106                 if (breakPos >= 0) {  in RunMonkey()
4107                     precedingBreaks[breakPos] = 1;  in RunMonkey()
4109                 lastBreakPos = breakPos;  in RunMonkey()