Searched refs:precedingBreaks (Results 1 – 3 of 3) sorted by relevance
1841 boolean[] precedingBreaks = new boolean[TESTSTRINGLEN*2 + 1]; in RunMonkey()1924 Arrays.fill(precedingBreaks, false); in RunMonkey()1996 precedingBreaks[i] = !expectedBreaks[i]; // Forces an error. in RunMonkey()2005 precedingBreaks[testText.length()] = true; in RunMonkey()2016 precedingBreaks[i] = !expectedBreaks[i]; // Forces an error. in RunMonkey()2018 precedingBreaks[breakPos] = true; in RunMonkey()2036 } else if (precedingBreaks[i] != expectedBreaks[i]) { in RunMonkey()
1842 boolean[] precedingBreaks = new boolean[TESTSTRINGLEN*2 + 1]; in RunMonkey()1925 Arrays.fill(precedingBreaks, false); in RunMonkey()1997 precedingBreaks[i] = !expectedBreaks[i]; // Forces an error. in RunMonkey()2006 precedingBreaks[testText.length()] = true; in RunMonkey()2017 precedingBreaks[i] = !expectedBreaks[i]; // Forces an error. in RunMonkey()2019 precedingBreaks[breakPos] = true; in RunMonkey()2037 } else if (precedingBreaks[i] != expectedBreaks[i]) { in RunMonkey()
4261 char precedingBreaks[TESTSTRINGLEN*2+1]; in RunMonkey() local4401 memset(precedingBreaks, 0, sizeof(precedingBreaks)); in RunMonkey()4403 precedingBreaks[testText.length()] = 1; in RunMonkey()4414 if (breakPos >= 0 && breakPos < (int32_t)sizeof(precedingBreaks)) { in RunMonkey()4415 precedingBreaks[i] = 2; // Forces an error. in RunMonkey()4419 precedingBreaks[breakPos] = 1; in RunMonkey()4436 } else if (precedingBreaks[i] != expectedBreaks[i]) { in RunMonkey()