/external/chromium/base/ |
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[i].rhs)) [all...] |
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); ++i) [all...] |
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...] |
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[i].expected_with_units 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...] |
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,
|
/dalvik/dx/src/com/android/dx/dex/code/ |
SwitchData.java | 37 /** {@code non-null;} sorted list of switch cases (keys) */ 38 private final IntList cases; field in class:SwitchData 56 * @param cases {@code non-null;} sorted list of switch cases (keys) 61 IntList cases, CodeAddress[] targets) { 68 if (cases == null) { 69 throw new NullPointerException("cases == null"); 76 int sz = cases.size(); 79 throw new IllegalArgumentException("cases / targets mismatch"); 83 throw new IllegalArgumentException("too many cases"); [all...] |
/external/proguard/src/proguard/classfile/instruction/ |
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.length; index++ [all...] |
/dalvik/dx/src/com/android/dx/rop/code/ |
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; [all...] |
/external/webkit/WebKit/chromium/tests/ |
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[i].lastPathComponent, kurl.lastPathComponent()) 117 ComponentCase cases[] = { local 210 } cases[] = { local [all...] |
/external/chromium/third_party/icu/source/test/intltest/ |
calcasts.cpp | 7 * behavior of a calendar to a certain set of 'test cases', involving 42 void CalendarCaseTest::doTestCases(const TestCase *cases, Calendar *cal) { 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[i].dayOfWeek,status) [all...] |
calcasts.h | 7 * behavior of a calendar to a certain set of 'test cases', involving 40 * @param cases array of items to test. Terminate with a "-1" for era. 42 void doTestCases(const TestCase *cases, Calendar *cal); 56 // test cases
|
/external/icu4c/test/intltest/ |
calcasts.cpp | 7 * behavior of a calendar to a certain set of 'test cases', involving 42 void CalendarCaseTest::doTestCases(const TestCase *cases, Calendar *cal) { 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[i].dayOfWeek,status) [all...] |
calcasts.h | 7 * behavior of a calendar to a certain set of 'test cases', involving 40 * @param cases array of items to test. Terminate with a "-1" for era. 42 void doTestCases(const TestCase *cases, Calendar *cal); 56 // test cases
|
/external/chromium/googleurl/src/ |
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...] |
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[i].expected_component.len, host_info.out_host.len) 621 IPAddressCase cases[] = { local 1183 } cases[] = { local 1454 } cases[] = { local 1583 } cases[] = { local [all...] |
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[i].host, parsed.host)) [all...] |
/external/dropbear/libtomcrypt/src/mac/hmac/ |
hmac_test.c | 23 TEST CASES SOURCE: 30 Test Cases for HMAC-MD5 and HMAC-SHA-1 53 } cases[] = { 55 3. Test Cases for HMAC-SHA-1 121 2. Test Cases for HMAC-MD5 268 for(i=0; i < (int)(sizeof(cases) / sizeof(cases[0])); i++) { 269 int hash = find_hash(cases[i].algo); 273 if((err = hmac_memory(hash, cases[i].key, cases[i].keylen, cases[i].data, cases[i].datalen, digest, &outlen)) != CRYPT_OK) [all...] |
/cts/tools/utils/ |
DescriptionGenerator.java | 52 * Input: The source files of the test cases. It will be represented 241 * information of all the test package, test suite and test cases. 399 * @param cases A collection of test cases included by the test suite class. 401 void appendTestCases(Node elem, Collection<TestMethod> cases) { 402 if (cases.isEmpty()) { 406 for (TestMethod caze : cases) { 490 * @param cases The test cases included in this test suite. 492 TestClass(String name, Collection<TestMethod> cases) { 516 ArrayList<TestMethod> cases = new ArrayList<TestMethod>(); local [all...] |
/bionic/libc/arch-sh/bionic/ |
ffs.S | 59 bt Lzero ! testing here to accelerate ret=1..8 cases
|
/dalvik/dx/src/com/android/dx/cf/code/ |
Machine.java | 175 * @param cases {@code non-null;} the list of key-target pairs, plus the default 178 public void auxSwitchArg(SwitchList cases);
|
BasicBlocker.java | 247 SwitchList cases, int padding) { 249 addWorkIfNecessary(cases.getDefaultTarget(), true); 251 int sz = cases.size(); 253 addWorkIfNecessary(cases.getTarget(i), true); 256 targetLists[offset] = cases.getTargets();
|
BytecodeArray.java | 825 SwitchList cases = new SwitchList(count); local 862 SwitchList cases = new SwitchList(npairs); local [all...] |
/dalvik/dx/src/com/android/dx/cf/direct/ |
CodeObserver.java | 155 SwitchList cases, int padding) { 156 int sz = cases.size(); 167 sb.append(Hex.s4(cases.getValue(i))); 169 sb.append(Hex.u2(cases.getTarget(i))); 174 sb.append(Hex.u2(cases.getDefaultTarget()));
|
/external/v8/src/ |
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);
|
/external/dropbear/libtomcrypt/src/hashes/ |
md4.c | 261 } cases[] = { 288 for(i = 0; i < (int)(sizeof(cases) / sizeof(cases[0])); i++) { 290 md4_process(&md, (unsigned char *)cases[i].input, (unsigned long)strlen(cases[i].input)); 292 if (XMEMCMP(digest, cases[i].digest, 16) != 0) {
|