| /dports/lang/kawa/kawa-3.1.1/gnu/bytecode/ |
| H A D | SwitchState.java | 40 int numCases; field in SwitchState
74 numCases = 0; in SwitchState()
130 numCases = 1; in insertCase()
144 copyBefore = numCases; in insertCase()
149 int hi = numCases - 1; in insertCase()
162 if (numCases >= values.length) { in insertCase()
163 values = new int[2 * numCases]; in insertCase()
173 numCases++; in insertCase()
209 if (numCases <= 1) { in finish()
210 if (numCases == 1) { in finish()
[all …]
|
| /dports/math/vtk9/VTK-9.1.0/Filters/Core/ |
| H A D | vtk3DLinearGridInternal.h | 97 int caseOffset = numCases; in BuildCases()
143 int numCases = std::pow(2, this->NumVerts); in BuildCases() local
144 int** cases = new int*[numCases]; in BuildCases()
149 for (int i = 0; i < numCases; ++i) in BuildCases()
184 int** cases = new int*[numCases]; in BuildCases()
189 for (int i = 0; i < numCases; ++i) in BuildCases()
224 int** cases = new int*[numCases]; in BuildCases()
229 for (int i = 0; i < numCases; ++i) in BuildCases()
264 int** cases = new int*[numCases]; in BuildCases()
269 for (int i = 0; i < numCases; ++i) in BuildCases()
[all …]
|
| /dports/java/openjdk17/jdk17u-jdk-17.0.1-12-1/test/jdk/java/lang/invoke/MethodHandles/ |
| H A D | TestTableSwitch.java | 119 for (int numCases = 1; numCases < 5; numCases++) { in nonVoidCases()
120 tests.add(new Object[] { returnType, numCases, List.of() }); in nonVoidCases()
121 tests.add(new Object[] { returnType, numCases, List.of(TEST_TYPES) }); in nonVoidCases()
133 …public void testNonVoidHandles(Class<?> type, int numCases, List<Class<?>> additionalTypes) throws… in testNonVoidHandles() argument
142 Object[] returnValues = new Object[numCases]; in testNonVoidHandles()
143 MethodHandle[] cases = new MethodHandle[numCases]; in testNonVoidHandles()
163 for (int i = 0; i < numCases; i++) { in testNonVoidHandles()
167 …assertEquals(mhSwitch.invokeWithArguments(testArguments(numCases, testArguments)), defaultReturnVa… in testNonVoidHandles()
|
| /dports/math/vtk8/VTK-8.2.0/Filters/Core/ |
| H A D | vtkContour3DLinearGrid.cxx | 120 int caseOffset = numCases; in BuildCases()
166 int numCases = std::pow(2,this->NumVerts); in BuildCases() local
167 int **cases = new int*[numCases]; in BuildCases()
172 for ( int i=0; i < numCases; ++i) in BuildCases()
206 int **cases = new int*[numCases]; in BuildCases()
211 for ( int i=0; i < numCases; ++i) in BuildCases()
245 int **cases = new int*[numCases]; in BuildCases()
250 for ( int i=0; i < numCases; ++i) in BuildCases()
284 int **cases = new int*[numCases]; in BuildCases()
289 for ( int i=0; i < numCases; ++i) in BuildCases()
[all …]
|
| /dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/angle/third_party/VK-GL-CTS/src/external/vulkancts/modules/vulkan/transform_feedback/ |
| H A D | vktTransformFeedbackFuzzLayoutTests.cpp | 386 for (deUint32 ndx = 0; ndx < numCases; ndx++) in createRandomCaseGroup()
734 const deUint32 numCases = 50; in init() local
739 …Ctx, "scalar_types", "Scalar types only, per-block buffers", numCases, stage, unused … in init()
740 …ctor_types", "Scalar and vector types only, per-block buffers", numCases, stage, unused|FE… in init()
741 …estCtx, "basic_types", "All basic types, per-block buffers", numCases, stage, unused|al… in init()
742 …p, m_testCtx, "basic_arrays", "Arrays, per-block buffers", numCases, stage, unused|al… in init()
744 …ic_instance_arrays", "Basic instance arrays, per-block buffers", numCases, stage, unused|al… in init()
745 …stCtx, "nested_structs", "Nested structs, per-block buffers", numCases, stage, unused|al… in init()
746 …ted_structs_arrays", "Nested structs, arrays, per-block buffers", numCases, stage, unused|al… in init()
750 …x, "all_instance_array", "All random features, shared buffer", numCases*2, stage, allFeat… in init()
[all …]
|
| /dports/java/openjdk11/jdk11u-jdk-11.0.13-8-1/test/jdk/java/io/RandomAccessFile/ |
| H A D | ParameterCheck.java | 51 int numCases = off.length; in doTest() local
52 int[] got = new int[numCases]; in doTest()
67 for(int i = 0; i < numCases; i++) { in doTest()
|
| /dports/java/openjdk13/jdk13u-jdk-13.0.10-1-1/test/jdk/java/io/RandomAccessFile/ |
| H A D | ParameterCheck.java | 51 int numCases = off.length; in doTest() local
52 int[] got = new int[numCases]; in doTest()
67 for(int i = 0; i < numCases; i++) { in doTest()
|
| /dports/java/openjdk11-jre/jdk11u-jdk-11.0.13-8-1/test/jdk/java/io/RandomAccessFile/ |
| H A D | ParameterCheck.java | 51 int numCases = off.length; in doTest() local
52 int[] got = new int[numCases]; in doTest()
67 for(int i = 0; i < numCases; i++) { in doTest()
|
| /dports/java/openjdk12/openjdk-jdk12u-jdk-12.0.2-10-4/test/jdk/java/io/RandomAccessFile/ |
| H A D | ParameterCheck.java | 51 int numCases = off.length; in doTest() local
52 int[] got = new int[numCases]; in doTest()
67 for(int i = 0; i < numCases; i++) { in doTest()
|
| /dports/java/openjdk15/jdk15u-jdk-15.0.6-1-1/test/jdk/java/io/RandomAccessFile/ |
| H A D | ParameterCheck.java | 51 int numCases = off.length; in doTest() local
52 int[] got = new int[numCases]; in doTest()
67 for(int i = 0; i < numCases; i++) { in doTest()
|
| /dports/java/openjdk16/jdk16u-jdk-16.0.2-7-1/test/jdk/java/io/RandomAccessFile/ |
| H A D | ParameterCheck.java | 51 int numCases = off.length; in doTest() local
52 int[] got = new int[numCases]; in doTest()
67 for(int i = 0; i < numCases; i++) { in doTest()
|
| /dports/java/openjdk17/jdk17u-jdk-17.0.1-12-1/test/jdk/java/io/RandomAccessFile/ |
| H A D | ParameterCheck.java | 51 int numCases = off.length; in doTest() local
52 int[] got = new int[numCases]; in doTest()
67 for(int i = 0; i < numCases; i++) { in doTest()
|
| /dports/java/openjdk14/jdk14u-jdk-14.0.2-12-1/test/jdk/java/io/RandomAccessFile/ |
| H A D | ParameterCheck.java | 51 int numCases = off.length; in doTest() local
52 int[] got = new int[numCases]; in doTest()
67 for(int i = 0; i < numCases; i++) { in doTest()
|
| /dports/java/openjdk8/jdk8u-jdk8u312-b07.1/jdk/test/java/io/RandomAccessFile/ |
| H A D | ParameterCheck.java | 51 int numCases = off.length; in doTest() local
52 int[] got = new int[numCases]; in doTest()
67 for(int i = 0; i < numCases; i++) { in doTest()
|
| /dports/java/openjdk8-jre/jdk8u-jdk8u312-b07.1/jdk/test/java/io/RandomAccessFile/ |
| H A D | ParameterCheck.java | 51 int numCases = off.length; in doTest() local
52 int[] got = new int[numCases]; in doTest()
67 for(int i = 0; i < numCases; i++) { in doTest()
|
| /dports/www/firefox-esr/firefox-91.8.0/js/src/vm/ |
| H A D | CodeCoverage.cpp | 266 size_t numCases = high - low + 1; in writeScript() local
269 if (index < numCases) { in writeScript()
272 MOZ_ASSERT(index == numCases); in writeScript()
277 for (size_t j = 0; j < numCases + 1; j++) { in writeScript()
294 for (size_t i = 0; i < numCases + 1; i++) { in writeScript()
301 for (size_t j = 0; j < numCases + 1; j++) { in writeScript()
317 if (i < numCases) { in writeScript()
356 if (i < numCases) { in writeScript()
|
| /dports/www/firefox/firefox-99.0/js/src/vm/ |
| H A D | CodeCoverage.cpp | 266 size_t numCases = high - low + 1; in writeScript() local
269 if (index < numCases) { in writeScript()
272 MOZ_ASSERT(index == numCases); in writeScript()
277 for (size_t j = 0; j < numCases + 1; j++) { in writeScript()
294 for (size_t i = 0; i < numCases + 1; i++) { in writeScript()
301 for (size_t j = 0; j < numCases + 1; j++) { in writeScript()
317 if (i < numCases) { in writeScript()
356 if (i < numCases) { in writeScript()
|
| /dports/mail/thunderbird/thunderbird-91.8.0/js/src/vm/ |
| H A D | CodeCoverage.cpp | 266 size_t numCases = high - low + 1; in writeScript() local
269 if (index < numCases) { in writeScript()
272 MOZ_ASSERT(index == numCases); in writeScript()
277 for (size_t j = 0; j < numCases + 1; j++) { in writeScript()
294 for (size_t i = 0; i < numCases + 1; i++) { in writeScript()
301 for (size_t j = 0; j < numCases + 1; j++) { in writeScript()
317 if (i < numCases) { in writeScript()
356 if (i < numCases) { in writeScript()
|
| /dports/lang/spidermonkey78/firefox-78.9.0/js/src/vm/ |
| H A D | CodeCoverage.cpp | 271 size_t numCases = high - low + 1; in writeScript() local
274 if (index < numCases) { in writeScript()
277 MOZ_ASSERT(index == numCases); in writeScript()
282 for (size_t j = 0; j < numCases + 1; j++) { in writeScript()
299 for (size_t i = 0; i < numCases + 1; i++) { in writeScript()
306 for (size_t j = 0; j < numCases + 1; j++) { in writeScript()
322 if (i < numCases) { in writeScript()
361 if (i < numCases) { in writeScript()
|
| /dports/java/openjdk17/jdk17u-jdk-17.0.1-12-1/test/micro/org/openjdk/bench/java/lang/invoke/ |
| H A D | MethodHandlesTableSwitchOpaqueSingle.java | 86 public int numCases; field in MethodHandlesTableSwitchOpaqueSingle
92 MethodHandle[] cases = IntStream.range(0, numCases) in setupTrial()
98 input = ThreadLocalRandom.current().nextInt(numCases); in setupTrial()
|
| H A D | MethodHandlesTableSwitchRandom.java | 86 public int numCases; field in MethodHandlesTableSwitchRandom
98 MethodHandle[] cases = IntStream.range(0, numCases) in setupTrial()
108 inputs[i] = rand.nextInt(numCases); in setupTrial()
|
| H A D | MethodHandlesTableSwitchConstant.java | 92 public int numCases; field in MethodHandlesTableSwitchConstant
103 MethodHandle[] cases = IntStream.range(0, numCases) in setupTrial()
112 int input = ThreadLocalRandom.current().nextInt(numCases) + offset; in setupTrial()
|
| /dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/angle/third_party/VK-GL-CTS/src/modules/gles3/functional/ |
| H A D | es3fFragOpInteractionTests.cpp | 52 const int numCases = 100; in init() local
76 for (int ndx = 0; ndx < numCases; ndx++) in init()
|
| /dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/angle/third_party/VK-GL-CTS/src/modules/gles2/functional/ |
| H A D | es2fFragOpInteractionTests.cpp | 52 const int numCases = 100; in init() local
76 for (int ndx = 0; ndx < numCases; ndx++) in init()
|
| /dports/cad/verilator/verilator-4.216/src/ |
| H A D | V3Case.cpp | 162 const uint32_t numCases = 1UL << m_caseWidth; in isCaseTreeFast() local
164 for (uint32_t i = 0; i < numCases; ++i) m_valueItem[i] = nullptr; in isCaseTreeFast()
188 for (uint32_t i = 0; i < numCases; ++i) { in isCaseTreeFast()
224 for (uint32_t i = 0; i < numCases; ++i) { in isCaseTreeFast()
229 for (uint32_t i = 0; i < numCases; ++i) { in isCaseTreeFast()
246 for (uint32_t i = 0; i < numCases; ++i) { in isCaseTreeFast()
|