Lines Matching defs:expectedModCount
1004 int expectedModCount = modCount;
1008 if (expectedModCount != modCount) {
1017 int expectedModCount = modCount;
1022 if (expectedModCount != modCount) {
1195 int expectedModCount;
1198 expectedModCount = modCount;
1211 if (modCount != expectedModCount)
1222 if (modCount != expectedModCount)
1232 if (modCount != expectedModCount)
1238 expectedModCount = modCount;
1280 if (modCount != expectedModCount)
1284 expectedModCount = modCount;
1690 int expectedModCount;
1694 expectedModCount = m.modCount;
1708 if (m.modCount != expectedModCount)
1719 if (m.modCount != expectedModCount)
1729 if (m.modCount != expectedModCount)
1736 expectedModCount = m.modCount;
1742 if (m.modCount != expectedModCount)
1746 expectedModCount = m.modCount;
2707 int expectedModCount; // for CME checks
2711 int side, int est, int expectedModCount) {
2717 this.expectedModCount = expectedModCount;
2726 expectedModCount = t.modCount;
2744 int side, int est, int expectedModCount) {
2745 super(tree, origin, fence, side, est, expectedModCount);
2762 (tree, e, current = s, -1, est >>>= 1, expectedModCount);
2786 if (tree.modCount != expectedModCount)
2801 if (tree.modCount != expectedModCount)
2822 int side, int est, int expectedModCount) {
2823 super(tree, origin, fence, side, est, expectedModCount);
2840 (tree, e, current = s, -1, est >>>= 1, expectedModCount);
2864 if (tree.modCount != expectedModCount)
2879 if (tree.modCount != expectedModCount)
2895 int side, int est, int expectedModCount) {
2896 super(tree, origin, fence, side, est, expectedModCount);
2913 (tree, e, current = s, -1, est >>>= 1, expectedModCount);
2937 if (tree.modCount != expectedModCount)
2952 if (tree.modCount != expectedModCount)
2967 int side, int est, int expectedModCount) {
2968 super(tree, origin, fence, side, est, expectedModCount);
2985 (tree, e, current = s, -1, est >>>= 1, expectedModCount);
3009 if (tree.modCount != expectedModCount)
3024 if (tree.modCount != expectedModCount)
