Searched refs:precedingBreaks (Results 1 – 3 of 3) sorted by relevance
1666 boolean[] precedingBreaks = new boolean[TESTSTRINGLEN*2 + 1]; in RunMonkey()1748 Arrays.fill(precedingBreaks, false); in RunMonkey()1820 precedingBreaks[i] = !expectedBreaks[i]; // Forces an error. in RunMonkey()1829 precedingBreaks[testText.length()] = true; in RunMonkey()1840 precedingBreaks[i] = !expectedBreaks[i]; // Forces an error. in RunMonkey()1842 precedingBreaks[breakPos] = true; in RunMonkey()1860 } else if (precedingBreaks[i] != expectedBreaks[i]) { in RunMonkey()
1670 boolean[] precedingBreaks = new boolean[TESTSTRINGLEN*2 + 1]; in RunMonkey()1752 Arrays.fill(precedingBreaks, false); in RunMonkey()1824 precedingBreaks[i] = !expectedBreaks[i]; // Forces an error. in RunMonkey()1833 precedingBreaks[testText.length()] = true; in RunMonkey()1844 precedingBreaks[i] = !expectedBreaks[i]; // Forces an error. in RunMonkey()1846 precedingBreaks[breakPos] = true; in RunMonkey()1864 } else if (precedingBreaks[i] != expectedBreaks[i]) { in RunMonkey()
4134 char precedingBreaks[TESTSTRINGLEN*2+1]; in RunMonkey() local4268 memset(precedingBreaks, 0, sizeof(precedingBreaks)); in RunMonkey()4270 precedingBreaks[testText.length()] = 1; in RunMonkey()4281 if (breakPos >= 0 && breakPos < (int32_t)sizeof(precedingBreaks)) { in RunMonkey()4282 precedingBreaks[i] = 2; // Forces an error. in RunMonkey()4286 precedingBreaks[breakPos] = 1; in RunMonkey()4303 } else if (precedingBreaks[i] != expectedBreaks[i]) { in RunMonkey()