Searched refs:precedingBreaks (Results 1 – 3 of 3) sorted by relevance
1824 boolean[] precedingBreaks = new boolean[TESTSTRINGLEN*2 + 1]; in RunMonkey()1907 Arrays.fill(precedingBreaks, false); in RunMonkey()1979 precedingBreaks[i] = !expectedBreaks[i]; // Forces an error. in RunMonkey()1988 precedingBreaks[testText.length()] = true; in RunMonkey()1999 precedingBreaks[i] = !expectedBreaks[i]; // Forces an error. in RunMonkey()2001 precedingBreaks[breakPos] = true; in RunMonkey()2019 } else if (precedingBreaks[i] != expectedBreaks[i]) { in RunMonkey()
1827 boolean[] precedingBreaks = new boolean[TESTSTRINGLEN*2 + 1]; in RunMonkey()1910 Arrays.fill(precedingBreaks, false); in RunMonkey()1982 precedingBreaks[i] = !expectedBreaks[i]; // Forces an error. in RunMonkey()1991 precedingBreaks[testText.length()] = true; in RunMonkey()2002 precedingBreaks[i] = !expectedBreaks[i]; // Forces an error. in RunMonkey()2004 precedingBreaks[breakPos] = true; in RunMonkey()2022 } else if (precedingBreaks[i] != expectedBreaks[i]) { in RunMonkey()
3833 char precedingBreaks[TESTSTRINGLEN*2+1]; in RunMonkey() local3973 memset(precedingBreaks, 0, sizeof(precedingBreaks)); in RunMonkey()3975 precedingBreaks[testText.length()] = 1; in RunMonkey()3986 if (breakPos >= 0 && breakPos < (int32_t)sizeof(precedingBreaks)) { in RunMonkey()3987 precedingBreaks[i] = 2; // Forces an error. in RunMonkey()3991 precedingBreaks[breakPos] = 1; in RunMonkey()4008 } else if (precedingBreaks[i] != expectedBreaks[i]) { in RunMonkey()