/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/chromium/base/ |
H A D | version_unittest.cc | 22 } cases[] = { local 42 for (size_t i = 0; i < ARRAYSIZE_UNSAFE(cases); ++i) { 43 scoped_ptr<Version> vers(Version::GetVersionFromString(cases[i].input)); 44 EXPECT_EQ(cases[i].success, vers.get() != NULL); 45 if (cases[i].success) { 47 EXPECT_EQ(cases[i].parts, vers->components().size()); 57 } cases[] = { local 69 for (size_t i = 0; i < ARRAYSIZE_UNSAFE(cases); ++i) { 70 scoped_ptr<Version> lhs(Version::GetVersionFromString(cases[i].lhs)); 71 scoped_ptr<Version> rhs(Version::GetVersionFromString(cases[ [all...] |
H A D | string_number_conversions_unittest.cc | 64 } cases[] = { local 71 for (size_t i = 0; i < ARRAYSIZE_UNSAFE(cases); ++i) 72 EXPECT_EQ(cases[i].output, Uint64ToString(cases[i].input)); 80 } cases[] = { local 107 for (size_t i = 0; i < ARRAYSIZE_UNSAFE(cases); ++i) { 108 const char* ascii_chars = cases[i].input.c_str(); 110 EXPECT_EQ(cases[i].success, StringToInt(cases[i].input, &output)); 111 EXPECT_EQ(cases[ 178 } cases[] = { local 280 } cases[] = { local 350 } cases[] = { local 389 } cases[] = { local [all...] |
H A D | file_path_unittest.cc | 53 const struct UnaryTestData cases[] = { local 133 for (size_t i = 0; i < arraysize(cases); ++i) { 134 FilePath input(cases[i].input); 136 EXPECT_EQ(FilePath::StringType(cases[i].expected), observed.value()) << 142 const struct UnaryTestData cases[] = { local 220 for (size_t i = 0; i < arraysize(cases); ++i) { 221 FilePath input(cases[i].input); 223 EXPECT_EQ(FilePath::StringType(cases[i].expected), observed.value()) << 229 const struct BinaryTestData cases[] = { local 246 // Append introduces the default separator character, so these test cases 321 const struct UnaryTestData cases[] = { local 385 const struct UnaryBooleanTestData cases[] = { local 453 const struct UnaryTestData cases[] = { local 506 const struct BinaryBooleanTestData cases[] = { local 558 const struct BinaryTestData cases[] = { local 638 const struct BinaryBooleanTestData cases[] = { local 714 const struct UnaryTestData cases[] = { local 761 const struct BinaryTestData cases[] = { local 829 const struct UnaryTestData cases[] = { local 857 const struct BinaryTestData cases[] = { local 895 const struct BinaryBooleanTestData cases[] = { local 940 const struct BinaryIntTestData cases[] = { local 1017 const struct UnaryBooleanTestData cases[] = { local 1049 const struct UnaryTestData cases[] = { local [all...] |
H A D | time_win_unittest.cc | 184 TestCase cases[] = { local 192 while (cases[test_case].func) { 195 cases[test_case].func(); 204 printf("%s: %1.2fus per call\n", cases[test_case].description,
|
H A D | string_util_unittest.cc | 497 } cases[] = { local 509 for (size_t i = 0; i < ARRAYSIZE_UNSAFE(cases); ++i) 510 EXPECT_EQ(cases[i].expected, GetByteDisplayUnits(cases[i].bytes)); 519 } cases[] = { local 521 // under two pre-decimal digits, except in cases where it makes no 551 for (size_t i = 0; i < ARRAYSIZE_UNSAFE(cases); ++i) { 552 EXPECT_EQ(ASCIIToUTF16(cases[i].expected), 553 FormatBytes(cases[i].bytes, cases[ 566 } cases[] = { local 597 } cases[] = { local 1031 } cases[] = { local [all...] |
/external/chromium/crypto/ |
H A D | hmac_unittest.cc | 63 // Test cases from RFC 2202 section 3 71 } cases[] = { local 123 for (size_t i = 0; i < ARRAYSIZE_UNSAFE(cases); ++i) { 125 ASSERT_TRUE(hmac.Init(reinterpret_cast<const unsigned char*>(cases[i].key), 126 cases[i].key_len)); 127 std::string data_string(cases[i].data, cases[i].data_len); 130 EXPECT_EQ(0, memcmp(cases[i].digest, digest, kSHA1DigestSize)); 218 } cases[] = { local 230 for (size_t i = 0; i < ARRAYSIZE_UNSAFE(cases); [all...] |
/external/chromium/chrome/browser/metrics/ |
H A D | metrics_log_unittest.cc | 252 } cases[] = { local 258 for (size_t i = 0; i < ARRAYSIZE_UNSAFE(cases); i++) { 259 std::string hash_string = MetricsLog::CreateHash(cases[i].input); 269 EXPECT_EQ(cases[i].output, hash_hex);
|
/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/chromium/chrome/browser/autocomplete/ |
H A D | autocomplete_unittest.cc | 399 } cases[] = { local 411 for (size_t i = 0; i < ARRAYSIZE_UNSAFE(cases); ++i) { 412 m1.relevance = cases[i].r1; 413 m2.relevance = cases[i].r2; 414 EXPECT_EQ(cases[i].expected_result,
|
/external/chromium/googleurl/src/ |
H A D | gurl_unittest.cc | 156 // The tricky cases for relative URL resolving are tested in the 196 } cases[] = { local 204 for (size_t i = 0; i < ARRAYSIZE(cases); i++) { 205 GURL url(cases[i].input); 207 EXPECT_EQ(cases[i].expected, origin.spec()); 215 } cases[] = { local 221 for (size_t i = 0; i < ARRAYSIZE(cases); i++) { 222 GURL url(cases[i].input); 224 EXPECT_EQ(cases[i].expected, empty_path.spec()); 274 } cases[] local 355 } cases[] = { local [all...] |
H A D | url_parse_unittest.cc | 73 // Used for regular URL parse cases. 235 static URLParseCase cases[] = { variable 318 // Partially-complete IPv6 literals, and related cases. 330 // Declared outside for loop to try to catch cases in init() where we forget 333 for (size_t i = 0; i < arraysize(cases); i++) { 334 const char* url = cases[i].input; 338 EXPECT_TRUE(ComponentMatches(url, cases[i].scheme, parsed.scheme)); 339 EXPECT_TRUE(ComponentMatches(url, cases[i].username, parsed.username)); 340 EXPECT_TRUE(ComponentMatches(url, cases[i].password, parsed.password)); 341 EXPECT_TRUE(ComponentMatches(url, cases[ [all...] |
H A D | url_canon_unittest.cc | 73 // Test cases for CanonicalizeIPAddress(). The inputs are identical to 129 // causes it to fail in other cases. It is left a template in case we have 543 IPAddressCase cases[] = { local 616 for (size_t i = 0; i < arraysize(cases); i++) { 619 static_cast<int>(strlen(cases[i].input8))); 624 url_canon::CanonicalizeIPAddress(cases[i].input8, component, &output1, 628 EXPECT_EQ(cases[i].expected_family, host_info.family); 630 EXPECT_STREQ(cases[i].expected, out_str1.c_str()); 631 EXPECT_EQ(cases[i].expected_component.begin, host_info.out_host.begin); 632 EXPECT_EQ(cases[ 659 IPAddressCase cases[] = { local 1237 } cases[] = { local 1508 } cases[] = { local 1637 } cases[] = { local [all...] |
/external/icu4c/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...] |
H A D | tstnorm.cpp | 388 * Run a few specific cases that are failing for Verisign. 777 cases[][4]={ local 791 /* ### TODO: add more interesting cases */ 806 for(i=0; i<(int32_t)(sizeof(cases)/sizeof(cases[0])); ++i) { 807 switch(*cases[i][0]) { 815 left=UnicodeString(cases[i][1], "").unescape(); 816 right=UnicodeString(cases[i][2], "").unescape(); 817 expect=UnicodeString(cases[i][3], "").unescape(); 824 dataerrln("error in Normalizer::concatenate(), cases[] fail [all...] |
/external/webkit/Source/WebKit/chromium/tests/ |
H A D | KURLTest.cpp | 64 // Test the cases where we should be the same as WebKit's old KURL. 78 } cases[] = { local 86 for (size_t i = 0; i < ARRAYSIZE_UNSAFE(cases); i++) { 88 WebCore::KURL kurl(WebCore::ParsedURLString, cases[i].url); 90 EXPECT_EQ(cases[i].protocol, kurl.protocol()); 91 EXPECT_EQ(cases[i].host, kurl.host()); 92 EXPECT_EQ(cases[i].port, kurl.port()); 93 EXPECT_EQ(cases[i].user, kurl.user()); 94 EXPECT_EQ(cases[i].pass, kurl.pass()); 95 EXPECT_EQ(cases[ 120 ComponentCase cases[] = { local 213 } cases[] = { local [all...] |
/external/v8/src/ |
H A D | prettyprinter.cc | 192 ZoneList<CaseClause*>* cases = node->cases(); local 193 for (int i = 0; i < cases->length(); i++) 194 PrintCaseClause(cases->at(i)); 870 for (int i = 0; i < node->cases()->length(); i++) { 871 PrintCaseClause(node->cases()->at(i));
|
/external/chromium/net/socket/ |
H A D | transport_client_socket_pool_unittest.cc | 891 MockClientSocketFactory::ClientSocketType* cases[2] = { local 896 for (size_t index = 0; index < arraysize(cases); ++index) { 897 client_socket_factory_.set_client_socket_types(cases[index], 2);
|
/external/icu4c/test/cintltst/ |
H A D | cnormtst.c | 170 const char* const cases[][3], int32_t lengthOfCases) { 179 source=CharsToUChars(cases[x][0]); 196 assertEqual(result, cases[x][expIndex], x); 203 assertEqual(result, cases[x][expIndex], x); 532 * Here we pick some specific cases and test the C API. 552 /* normal case with length>=0 (length -1 used for special cases below) */ 579 /* specific cases */ 740 /* test cases to improve test code coverage */ 1439 } cases[]={ local 1441 * special cases fo 169 TestNormCases(UNormalizationMode mode, const char* const cases[][3], int32_t lengthOfCases) argument [all...] |
H A D | capitst.c | 1295 u_uastrcpy(testString1, "XFILE What subset of all possible test cases has the highest probability of detecting the most errors?"); 1296 u_uastrcpy(testString2, "Xf_ile What subset of all possible test cases has the lowest probability of detecting the least errors?"); 1706 * cases. This test tries to check this. 1901 const char* cases[] = { local 1906 uint32_t casesSize = sizeof(cases)/sizeof(cases[0]); 1922 log_verbose("Testing order of the test cases\n"); 1923 genericLocaleStarter("en", cases, casesSize); 1943 unescapedLen = u_unescape(cases[i], buffer, 256); 1986 unescapedLen = u_unescape(cases[ [all...] |
/external/llvm/utils/TableGen/ |
H A D | DAGISelMatcher.h | 471 /// to one matcher per opcode. If the opcode doesn't match any of the cases, 477 SwitchOpcodeMatcher(const std::pair<const SDNodeInfo*, Matcher*> *cases, argument 479 : Matcher(SwitchOpcode), Cases(cases, cases+numcases) {} 525 /// to one matcher per case. If the type doesn't match any of the cases, 531 SwitchTypeMatcher(const std::pair<MVT::SimpleValueType, Matcher*> *cases, argument 533 : Matcher(SwitchType), Cases(cases, cases+numcases) {}
|
/external/webkit/Source/JavaScriptCore/parser/ |
H A D | ASTBuilder.h | 423 CaseBlockNode* cases = new (m_globalData) CaseBlockNode(m_globalData, firstClauses, defaultClause, secondClauses); local 424 SwitchNode* result = new (m_globalData) SwitchNode(m_globalData, expr, cases);
|
/external/icu4c/i18n/ |
H A D | ucol.cpp | 1369 // It is similar in the end results to the collIterNormalize, but for the cases when we 1849 * Handles both normal and iterative cases. 2289 // be the sentinel. Most of the cases already check for this, but we 4190 * in which cases the contents of dest is undefined 4535 inline void doCaseShift(SortKeyByteSink &cases, uint32_t &caseShift) { argument 4537 cases.Append(UCOL_CASE_BYTE_START); 4605 SortKeyByteSink cases(caseB, LENGTHOF(caseB)); 4744 /* Usually, we'll have non-zero primary1 & primary2, except in cases of a-z and friends, when primary2 will */ 4824 doCaseShift(cases, caseShift); 4831 cases [all...] |