/external/v8/test/mjsunit/regress/ |
H A D | regress-2056.js | 30 var cases = [ variable 53 for (i = 0; i < cases.length; ++i) { 54 var c = cases[i]; 60 for (i = 0; i < cases.length; ++i) { 61 var c = cases[i];
|
/external/v8/test/webkit/ |
H A D | char-at.js | 30 var cases = [ variable 114 for (var i = 0; i < cases.length; ++i) 116 var item = cases[i];
|
/external/vboot_reference/tests/ |
H A D | crc32_test.c | 19 } cases[] = { local 41 for (i = 0; i < ARRAY_SIZE(cases); ++i) { 44 crc32 = Crc32(cases[i].vector, cases[i].len); 45 EXPECT(crc32 == cases[i].crc32);
|
/external/deqp/modules/gles2/functional/ |
H A D | es2fScissorTests.cpp | 64 } cases[] = local 82 for(int caseNdx = 0; caseNdx < DE_LENGTH_OF_ARRAY(cases); caseNdx++) 86 cases[caseNdx].name, 87 cases[caseNdx].desc, 88 cases[caseNdx].scissor, 89 cases[caseNdx].render, 90 cases[caseNdx].type, 91 cases[caseNdx].primitives));
|
H A D | es2fShaderConstExprTests.cpp | 50 void addChildGroup (const char* name, const char* desc, const gls::ShaderConstExpr::TestParams* cases, int numCases); 53 void ShaderConstExprBuiltinTests::addChildGroup (const char* name, const char* desc, const gls::ShaderConstExpr::TestParams* cases, int numCases) argument 55 const std::vector<tcu::TestNode*> children = createTests(m_testCtx, m_context.getRenderContext(), m_context.getContextInfo(), cases, numCases, glu::GLSL_VERSION_100_ES); 72 const TestParams cases[] = local 85 addChildGroup("trigonometry", "Trigonometry", cases, DE_LENGTH_OF_ARRAY(cases)); 89 const TestParams cases[] = local 100 addChildGroup("exponential", "Exponential", cases, DE_LENGTH_OF_ARRAY(cases)); 104 const TestParams cases[] local 124 const TestParams cases[] = local 170 const TestParams cases[] = local 181 const TestParams cases[] = local [all...] |
/external/deqp/modules/gles3/functional/ |
H A D | es3fScissorTests.cpp | 74 } cases[] = local 92 for (int caseNdx = 0; caseNdx < DE_LENGTH_OF_ARRAY(cases); caseNdx++) 96 cases[caseNdx].name, 97 cases[caseNdx].desc, 98 cases[caseNdx].scissor, 99 cases[caseNdx].render, 100 cases[caseNdx].type, 101 cases[caseNdx].primitives));
|
H A D | es3fShaderConstExprTests.cpp | 51 void addChildGroup (const char* name, const char* desc, const gls::ShaderConstExpr::TestParams* cases, int numCases); 54 void ShaderConstExprBuiltinTests::addChildGroup (const char* name, const char* desc, const gls::ShaderConstExpr::TestParams* cases, int numCases) argument 56 const std::vector<tcu::TestNode*> children = createTests(m_testCtx, m_context.getRenderContext(), m_context.getContextInfo(), cases, numCases, glu::GLSL_VERSION_300_ES); 73 const TestParams cases[] = local 92 addChildGroup("angle_and_trigonometry", "Angles and Trigonometry", cases, DE_LENGTH_OF_ARRAY(cases)); 96 const TestParams cases[] = local 107 addChildGroup("exponential", "Exponential", cases, DE_LENGTH_OF_ARRAY(cases)); 111 const TestParams cases[] local 153 const TestParams cases[] = local 167 const TestParams cases[] = local 213 const TestParams cases[] = local 252 const TestParams cases[] = local 287 const TestParams cases[] = local [all...] |
H A D | es3fBufferCopyTests.cpp | 255 tcu::TestCaseGroup* basicGroup = new tcu::TestCaseGroup(m_testCtx, "basic", "Basic buffer copy cases"); 290 } cases[] = local 302 for (int ndx = 0; ndx < DE_LENGTH_OF_ARRAY(cases); ndx++) 309 subrangeGroup->addChild(new BasicBufferCopyCase(m_context, cases[ndx].name, "", 310 srcTarget, cases[ndx].srcSize, hint, 311 dstTarget, cases[ndx].dstSize, hint, 312 cases[ndx].srcOffset, cases[ndx].dstOffset, cases[ndx].copySize,
|
/external/libcxxabi/test/ |
H A D | test_demangle.pass.cpp | 20 const char* cases[][2] = variable 29624 std::cout << cases[i][0] << " -> " << cases[i][1] << '\\n'; local [all...] |
/external/okhttp/okhttp-hpacktests/src/test/java/com/squareup/okhttp/internal/spdy/hpackjson/ |
H A D | Story.java | 28 private List<Case> cases; field in class:Story 40 return cases; 52 story.cases = new ArrayList<>(); 53 for (Case caze : cases) { 54 story.cases.add(caze.clone());
|
/external/deqp/modules/gles2/performance/ |
H A D | es2pTextureFilteringTests.cpp | 65 } cases[] = local 80 for (int caseNdx = 0; caseNdx < DE_LENGTH_OF_ARRAY(cases); caseNdx++) 86 deUint32 minFilter = cases[caseNdx].filter; 91 bool minify = cases[caseNdx].minify; 92 string name = string(cases[caseNdx].name) + (minify ? "_minify_" : "_magnify_") + texFormats[formatNdx].name;
|
H A D | es2pBlendTests.cpp | 143 } cases[] = local 163 for (int caseNdx = 0; caseNdx < DE_LENGTH_OF_ARRAY(cases); caseNdx++) 164 addChild(new BlendCase(m_context, cases[caseNdx].name, "", cases[caseNdx].modeRGB, cases[caseNdx].modeAlpha, cases[caseNdx].srcRGB, cases[caseNdx].dstRGB, cases[caseNdx].srcAlpha, cases[caseNdx].dstAlpha));
|
/external/deqp/modules/gles3/performance/ |
H A D | es3pTextureFilteringTests.cpp | 66 } cases[] = local 81 for (int caseNdx = 0; caseNdx < DE_LENGTH_OF_ARRAY(cases); caseNdx++) 86 deUint32 minFilter = cases[caseNdx].filter; 91 bool minify = cases[caseNdx].minify; 92 string name = string(cases[caseNdx].name) + (minify ? "_minify_" : "_magnify_") + texFormats[formatNdx].name;
|
H A D | es3pBlendTests.cpp | 146 } cases[] = local 170 for (int caseNdx = 0; caseNdx < DE_LENGTH_OF_ARRAY(cases); caseNdx++) 171 addChild(new BlendCase(m_context, cases[caseNdx].name, "", cases[caseNdx].modeRGB, cases[caseNdx].modeAlpha, cases[caseNdx].srcRGB, cases[caseNdx].dstRGB, cases[caseNdx].srcAlpha, cases[caseNdx].dstAlpha));
|
/external/deqp/modules/glshared/ |
H A D | glsShaderConstExprTests.cpp | 43 const TestParams* cases, 98 const int minComponents = cases[caseNdx].minComponents; 99 const int maxComponents = cases[caseNdx].maxComponents; 100 const DataType inType = cases[caseNdx].inType; 101 const DataType outType = cases[caseNdx].outType; 102 const string expression = cases[caseNdx].expression; 110 expected.elements[0].int32 = (int)cases[caseNdx].output; 114 expected.elements[0].int32 = (unsigned int)cases[caseNdx].output; 118 expected.elements[0].bool32 = cases[caseNdx].output!=0.0f; 122 expected.elements[0].float32 = cases[caseNd 40 createTests(tcu::TestContext& testContext, glu::RenderContext& renderContext, const glu::ContextInfo& contextInfo, const TestParams* cases, int numCases, glu::GLSLVersion version, TestShaderStage testStage) argument [all...] |
/external/dexmaker/src/dx/java/com/android/dx/dex/code/ |
H A D | SwitchData.java | 38 /** {@code non-null;} sorted list of switch cases (keys) */ 39 private final IntList cases; field in class:SwitchData 57 * @param cases {@code non-null;} sorted list of switch cases (keys) 62 IntList cases, CodeAddress[] targets) { 69 if (cases == null) { 70 throw new NullPointerException("cases == null"); 77 int sz = cases.size(); 80 throw new IllegalArgumentException("cases / targets mismatch"); 84 throw new IllegalArgumentException("too many cases"); 61 SwitchData(SourcePosition position, CodeAddress user, IntList cases, CodeAddress[] targets) argument 210 packedCodeSize(IntList cases) argument 226 sparseCodeSize(IntList cases) argument 239 shouldPack(IntList cases) argument [all...] |
/external/dexmaker/src/dx/java/com/android/dx/rop/code/ |
H A D | SwitchInsn.java | 25 * Instruction which contains switch cases. 29 /** {@code non-null;} list of switch cases */ 30 private final IntList cases; field in class:SwitchInsn 39 * @param cases {@code non-null;} list of switch cases 42 RegisterSpecList sources, IntList cases) { 49 if (cases == null) { 50 throw new NullPointerException("cases == null"); 53 this.cases = cases; 41 SwitchInsn(Rop opcode, SourcePosition position, RegisterSpec result, RegisterSpecList sources, IntList cases) argument [all...] |
/external/proguard/src/proguard/classfile/instruction/ |
H A D | LookUpSwitchInstruction.java | 35 public int[] cases; field in class:LookUpSwitchInstruction 49 int[] cases, 54 this.cases = cases; 68 this.cases = lookUpSwitchInstruction.cases; 93 cases = new int[jumpOffsetCount]; 98 cases[index] = readInt(code, offset); offset += 4; 114 writeInt(code, offset, cases.length); offset += 4; 117 for (int index = 0; index < cases 47 LookUpSwitchInstruction(byte opcode, int defaultOffset, int[] cases, int[] jumpOffsets) argument [all...] |
/external/v8/test/promises-aplus/lib/ |
H A D | mocha.js | 86 ' test cases are found'); 173 this.cases = []; 178 this.cases.push(new TestCase(this.description + ' :before', undefined, 181 for (var i = 0; i < described.cases.length; ++i) { 182 this.cases.push(new TestCase(described.cases[i].description, 184 described.cases[i].fn, 189 this.cases.push(new TestCase(this.description + ' :after', 195 this.hasRun = this.currentIndex === this.cases.length; 202 this.cases[thi [all...] |
/external/deqp/modules/gles2/stress/ |
H A D | es2sLongRunningTests.cpp | 56 // Buffer cases. 81 } cases[] = local 114 for (int caseNdx = 0; caseNdx < DE_LENGTH_OF_ARRAY(cases); caseNdx++) 116 const int redundantBufferFactor = cases[caseNdx].redundantBufferFactor > 0 ? cases[caseNdx].redundantBufferFactor : memoryLimitCases[memoryLimitNdx].redundantBufferFactor; 119 (string() + cases[caseNdx].name + memoryLimitCases[memoryLimitNdx].nameSuffix).c_str(), 120 (string() + cases[caseNdx].desc + memoryLimitCases[memoryLimitNdx].descSuffix).c_str(), 123 contexts, cases[caseNdx].probs, 130 // Texture cases. 153 } cases[] local 211 } cases[] = local 259 } cases[] = local [all...] |
/external/deqp/modules/gles3/stress/ |
H A D | es3sLongRunningTests.cpp | 56 // Buffer cases. 81 } cases[] = local 114 for (int caseNdx = 0; caseNdx < DE_LENGTH_OF_ARRAY(cases); caseNdx++) 116 const int redundantBufferFactor = cases[caseNdx].redundantBufferFactor > 0 ? cases[caseNdx].redundantBufferFactor : memoryLimitCases[memoryLimitNdx].redundantBufferFactor; 119 (string() + cases[caseNdx].name + memoryLimitCases[memoryLimitNdx].nameSuffix).c_str(), 120 (string() + cases[caseNdx].desc + memoryLimitCases[memoryLimitNdx].descSuffix).c_str(), 123 contexts, cases[caseNdx].probs, 130 // Texture cases. 153 } cases[] local 211 } cases[] = local 259 } cases[] = local [all...] |
/external/icu/icu4c/source/test/intltest/ |
H A D | calcasts.cpp | 7 * behavior of a calendar to a certain set of 'test cases', involving 42 void CalendarCaseTest::doTestCases(const TestCase *cases, Calendar *cal) { argument 51 for(i=0;cases[i].era>=0;i++) { 52 UDate t = (JULIAN_EPOCH+(ONE_DAY*cases[i].julian)); 54 logln("Test case %d: julianday%f -> date %f\n", i, cases[i].julian, t); 61 checkField(cal, UCAL_ERA, cases[i].era, status); 62 checkField(cal, UCAL_YEAR, cases[i].year,status); 63 checkField(cal, UCAL_MONTH, cases[i].month - 1,status); 64 checkField(cal, UCAL_DATE, cases[i].day,status); 65 checkField(cal, UCAL_DAY_OF_WEEK, cases[ [all...] |
/external/icu/icu4j/main/tests/core/src/com/ibm/icu/dev/test/calendar/ |
H A D | CalendarTest.java | 73 public void doTestCases(TestCase[] cases, Calendar cal) argument 95 // Now iterate through the test cases and see what happens 96 for (int i = 0; i < cases.length; i++) 99 TestCase test = cases[i]; 134 * Process test cases for <code>add</code> and <code>roll</code> methods.
|
/external/deqp/executor/tools/ |
H A D | xeTestLogCompare.cpp | 218 static void computeCaseList (vector<string>& cases, const vector<ShortBatchResult>& batchResults) argument 220 // \todo [2012-07-10 pyry] Do proper case ordering (eg. handle missing cases nicely). 229 cases.push_back(caseIter->casePath); 310 // Compare cases.
|
/external/deqp/framework/delibs/dethread/ |
H A D | deThreadTest.c | 595 } cases[] = local 608 for (caseNdx = 0; caseNdx < DE_LENGTH_OF_ARRAY(cases); caseNdx++) 610 int numThreads = cases[caseNdx].numThreads; 611 int initTimeMs = cases[caseNdx].initTimeMs; 612 int repeatCount = cases[caseNdx].repeatCount;
|