/external/chromium/base/ |
H A D | version_unittest.cc | 16 } cases[] = { local 29 for (size_t i = 0; i < ARRAYSIZE_UNSAFE(cases); ++i) { 30 scoped_ptr<Version> vers(Version::GetVersionFromString(cases[i].input)); 31 EXPECT_EQ(cases[i].success, vers.get() != NULL); 32 if (cases[i].success) 33 EXPECT_EQ(cases[i].parts, vers->components().size()); 42 } cases[] = { local 54 for (size_t i = 0; i < ARRAYSIZE_UNSAFE(cases); ++i) { 55 scoped_ptr<Version> lhs(Version::GetVersionFromString(cases[i].lhs)); 56 scoped_ptr<Version> rhs(Version::GetVersionFromString(cases[ [all...] |
H A D | hmac_unittest.cc | 62 // Test cases from RFC 2202 section 3 70 } cases[] = { local 122 for (size_t i = 0; i < ARRAYSIZE_UNSAFE(cases); ++i) { 124 ASSERT_TRUE(hmac.Init(reinterpret_cast<const unsigned char*>(cases[i].key), 125 cases[i].key_len)); 126 std::string data_string(cases[i].data, cases[i].data_len); 129 EXPECT_EQ(memcmp(cases[i].digest, digest, kDigestSize), 0); 146 } cases[] = { local 158 for (size_t i = 0; i < ARRAYSIZE_UNSAFE(cases); [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 751 const struct BinaryTestData cases[] = { local 819 const struct BinaryTestData cases[] = { local 856 const struct BinaryBooleanTestData cases[] = { local 901 const struct BinaryIntTestData cases[] = { local 978 const struct UnaryBooleanTestData cases[] = { local [all...] |
H A D | time_win_unittest.cc | 180 TestCase cases[] = { local 188 while (cases[test_case].func) { 191 cases[test_case].func(); 200 printf("%s: %1.2fus per call\n", cases[test_case].description,
|
H A D | string_util_unittest.cc | 344 } cases[] = { local 356 for (size_t i = 0; i < ARRAYSIZE_UNSAFE(cases); ++i) 357 EXPECT_EQ(cases[i].expected, GetByteDisplayUnits(cases[i].bytes)); 366 } cases[] = { local 386 for (size_t i = 0; i < ARRAYSIZE_UNSAFE(cases); ++i) { 387 EXPECT_EQ(cases[i].expected, 388 FormatBytes(cases[i].bytes, cases[i].units, false)); 389 EXPECT_EQ(cases[ 401 } cases[] = { local 432 } cases[] = { local 504 } cases[] = { local 520 } cases[] = { local 577 } cases[] = { local 642 } cases[] = { local 704 } cases[] = { local 756 } cases[] = { local 1408 } cases[] = { local 1442 } cases[] = { local [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/googleurl/src/ |
H A D | gurl_unittest.cc | 155 // The tricky cases for relative URL resolving are tested in the 197 } cases[] = { local 205 for (size_t i = 0; i < ARRAYSIZE(cases); i++) { 206 GURL url(cases[i].input); 208 EXPECT_EQ(cases[i].expected, origin.spec()); 216 } cases[] = { local 222 for (size_t i = 0; i < ARRAYSIZE(cases); i++) { 223 GURL url(cases[i].input); 225 EXPECT_EQ(cases[i].expected, empty_path.spec()); 275 } cases[] local 356 } 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 505 IPAddressCase cases[] = { local 578 for (size_t i = 0; i < arraysize(cases); i++) { 581 static_cast<int>(strlen(cases[i].input8))); 586 url_canon::CanonicalizeIPAddress(cases[i].input8, component, &output1, 590 EXPECT_EQ(cases[i].expected_family, host_info.family); 592 EXPECT_STREQ(cases[i].expected, out_str1.c_str()); 593 EXPECT_EQ(cases[i].expected_component.begin, host_info.out_host.begin); 594 EXPECT_EQ(cases[ 621 IPAddressCase cases[] = { local 1183 } cases[] = { local 1454 } cases[] = { local 1583 } cases[] = { local [all...] |
/external/chromium/third_party/icu/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...] |
H A D | tstnorm.cpp | 374 * Run a few specific cases that are failing for Verisign. 763 cases[][4]={ local 777 /* ### TODO: add more interesting cases */ 820 for(i=0; i<(int32_t)(sizeof(cases)/sizeof(cases[0])); ++i) { 821 switch(*cases[i][0]) { 829 left=UnicodeString(cases[i][1], "").unescape(); 830 right=UnicodeString(cases[i][2], "").unescape(); 831 expect=UnicodeString(cases[i][3], "").unescape(); 838 errln("error in Normalizer::concatenate(), cases[] fail [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 | 385 * Run a few specific cases that are failing for Verisign. 774 cases[][4]={ local 788 /* ### TODO: add more interesting cases */ 803 for(i=0; i<(int32_t)(sizeof(cases)/sizeof(cases[0])); ++i) { 804 switch(*cases[i][0]) { 812 left=UnicodeString(cases[i][1], "").unescape(); 813 right=UnicodeString(cases[i][2], "").unescape(); 814 expect=UnicodeString(cases[i][3], "").unescape(); 821 dataerrln("error in Normalizer::concatenate(), cases[] fail [all...] |
/external/webkit/WebKit/chromium/tests/ |
H A D | KURLTest.cpp | 61 // Test the cases where we should be the same as WebKit's old KURL. 75 } cases[] = { local 83 for (size_t i = 0; i < ARRAYSIZE_UNSAFE(cases); i++) { 85 WebCore::KURL kurl(WebCore::ParsedURLString, cases[i].url); 87 EXPECT_EQ(cases[i].protocol, kurl.protocol()); 88 EXPECT_EQ(cases[i].host, kurl.host()); 89 EXPECT_EQ(cases[i].port, kurl.port()); 90 EXPECT_EQ(cases[i].user, kurl.user()); 91 EXPECT_EQ(cases[i].pass, kurl.pass()); 92 EXPECT_EQ(cases[ 117 ComponentCase cases[] = { local 210 } cases[] = { local [all...] |
/external/v8/src/ |
H A D | usage-analyzer.cc | 151 ZoneList<CaseClause*>* cases = node->cases(); local 152 for (int i = cases->length(); i-- > 0;) { 153 WeightScaler ws(this, static_cast<float>(1.0 / cases->length())); 154 CaseClause* clause = cases->at(i);
|
H A D | prettyprinter.cc | 143 ZoneList<CaseClause*>* cases = node->cases(); local 144 for (int i = 0; i < cases->length(); i++) 145 PrintCaseClause(cases->at(i)); 849 for (int i = 0; i < node->cases()->length(); i++) { 850 PrintCaseClause(node->cases()->at(i));
|
H A D | ast.h | 583 void Initialize(Expression* tag, ZoneList<CaseClause*>* cases) { argument 585 cases_ = cases; 591 ZoneList<CaseClause*>* cases() const { return cases_; } function in class:v8::internal::SwitchStatement
|
/external/chromium/third_party/icu/source/test/cintltst/ |
H A D | cnormtst.c | 572 * Here we pick some specific cases and test the C API. 592 /* normal case with length>=0 (length -1 used for special cases below) */ 619 /* specific cases */ 770 /* test cases to improve test code coverage */ 1478 } cases[]={ local 1480 * special cases for UAX #15 bug 1494 /* TODO: add test cases for UNORM_FCC here (j2151) */ 1501 for(i=0; i<LENGTHOF(cases); ++i) { 1504 cases[i].input, -1, 1505 cases[ [all...] |
H A D | capitst.c | 1247 u_uastrcpy(testString1, "XFILE What subset of all possible test cases has the highest probability of detecting the most errors?"); 1248 u_uastrcpy(testString2, "Xf_ile What subset of all possible test cases has the lowest probability of detecting the least errors?"); 1658 * cases. This test tries to check this. 1853 const char* cases[] = { local 1858 uint32_t casesSize = sizeof(cases)/sizeof(cases[0]); 1874 log_verbose("Testing order of the test cases\n"); 1875 genericLocaleStarter("en", cases, casesSize); 1895 unescapedLen = u_unescape(cases[i], buffer, 256); 1938 unescapedLen = u_unescape(cases[ [all...] |
H A D | cmsccoll.c | 1660 log_verbose("Testing %d/%d of possible test cases\n", noCases, charsToTestSize); 1689 log_verbose("Testing locales, number of cases = %i\n", noCases); 2262 /* of the string. Checks a couple of edge cases.*/ 3877 static const char* cases[] = { local 3896 for(i = 0; i < sizeof(cases)/sizeof(cases[0]); i++) { 3898 length = u_unescape(cases[i], currCase, 256); 3909 static const char* cases[] = { local 3931 for(j = 1; j < sizeof(cases)/sizeof(cases[ [all...] |
/external/icu4c/test/cintltst/ |
H A D | cnormtst.c | 571 * Here we pick some specific cases and test the C API. 591 /* normal case with length>=0 (length -1 used for special cases below) */ 618 /* specific cases */ 769 /* test cases to improve test code coverage */ 1468 } cases[]={ local 1470 * special cases for UAX #15 bug 1480 /* TODO: add test cases for UNORM_FCC here (j2151) */ 1487 for(i=0; i<LENGTHOF(cases); ++i) { 1490 cases[i].input, -1, 1491 cases[ [all...] |
H A D | capitst.c | 1225 u_uastrcpy(testString1, "XFILE What subset of all possible test cases has the highest probability of detecting the most errors?"); 1226 u_uastrcpy(testString2, "Xf_ile What subset of all possible test cases has the lowest probability of detecting the least errors?"); 1636 * cases. This test tries to check this. 1831 const char* cases[] = { local 1836 uint32_t casesSize = sizeof(cases)/sizeof(cases[0]); 1852 log_verbose("Testing order of the test cases\n"); 1853 genericLocaleStarter("en", cases, casesSize); 1873 unescapedLen = u_unescape(cases[i], buffer, 256); 1916 unescapedLen = u_unescape(cases[ [all...] |
H A D | cmsccoll.c | 1664 log_verbose("Testing %d/%d of possible test cases\n", noCases, charsToTestSize); 1693 log_verbose("Testing locales, number of cases = %i\n", noCases); 2266 /* of the string. Checks a couple of edge cases.*/ 3890 static const char* cases[] = { local 3909 for(i = 0; i < sizeof(cases)/sizeof(cases[0]); i++) { 3911 length = u_unescape(cases[i], currCase, 256); 3922 static const char* cases[] = { local 3944 for(j = 1; j < sizeof(cases)/sizeof(cases[ [all...] |
/external/bluetooth/glib/glib/ |
H A D | gtestutils.c | 58 GSList *cases; member in struct:GTestSuite 361 " -l List test cases available in a test executable\n" 404 * list test cases available in a test executable. 572 * For individual test cases however, the random number generator is 574 * effective for all test cases. 777 * default base URI for all test cases. Calling it from within 849 * cases to be run are filtered according to 885 * multiple tests. In this cases, g_test_create_case() will be 1041 suite->cases = g_slist_prepend (suite->cases, test_cas [all...] |
/external/v8/src/arm/ |
H A D | codegen-arm.cc | 765 // Other cases should have been handled before this point. 850 // Other cases should have been handled before this point. 980 // smi tagging these two cases can only happen with shifts 1482 ZoneList<CaseClause*>* cases = node->cases(); local 1483 int length = cases->length(); 1487 CaseClause* clause = cases->at(i); 1509 if (i > 0 && cases->at(i - 1)->is_default()) { 1520 if (i < length - 1 && cases->at(i + 1)->is_default()) { 2400 // introducing variables. In those cases, w [all...] |