Searched defs:cases (Results 1 - 17 of 17) sorted by relevance

/external/proguard/src/proguard/classfile/instruction/
H A DLookUpSwitchInstruction.java35 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/icu4c/test/intltest/
H A Dcalcasts.cpp7 * 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 Dtstnorm.cpp374 * 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/webkit/WebKit/chromium/tests/
H A DKURLTest.cpp61 // 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 Dusage-analyzer.cc151 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 Dprettyprinter.cc143 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 Dast.h583 void Initialize(Expression* tag, ZoneList<CaseClause*>* cases) { argument
585 cases_ = cases;
591 ZoneList<CaseClause*>* cases() const { return cases_; } function in class:v8::internal::SwitchStatement
H A Dparser.cc1726 // labels can be simply ignored in all other cases; except for
2034 // variable, then *var is set to that variable. In all other cases,
2490 ZoneListWrapper<CaseClause> cases = factory()->NewList<CaseClause>(4); local
2494 cases.Add(clause);
2498 if (statement) statement->Initialize(tag, cases.elements());
/external/icu4c/test/cintltst/
H A Dcnormtst.c572 * 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 Dcapitst.c1247 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 Dcmsccoll.c1660 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/bluetooth/glib/glib/
H A Dgtestutils.c58 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 Dcodegen-arm.cc765 // 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...]
/external/icu4c/i18n/
H A Ducol.cpp1238 // It is similar in the end results to the collIterNormalize, but for the cases when we
1745 * Handles both normal and iterative cases.
2190 // be the sentinel. Most of the cases already check for this, but we
4283 * in which cases the contents of dest is undefined
4504 /* Usually, we'll have non-zero primary1 & primary2, except in cases of LatinOne and friends, when primary2 will */
4692 inline void doCaseShift(uint8_t **cases, uint32_t &caseShift) { argument
4694 *(*cases)++ = UCOL_CASE_BYTE_START;
4776 uint8_t *primaries = *result, *secondaries = second, *tertiaries = tert, *cases = caseB, *quads = quad; local
4887 uint8_t *caseStart = cases;
4973 /* Usually, we'll have non-zero primary1 & primary2, except in cases o
[all...]
/external/v8/src/ia32/
H A Dcodegen-ia32.cc775 // Call the stub for all other cases.
1397 // These two cases can only happen with shifts by 0 or 1 when
1693 // TODO(199): Optimize some special cases of operations involving a
2115 // Here we split control flow to the stub call and inlined cases
2260 // Here we split control flow to the stub call and inlined cases
2381 // Here we split control flow to the stub call and inlined cases
2489 // from the stack. This also deals with cases where a local variable
3018 ZoneList<CaseClause*>* cases = node->cases(); local
3019 int length = cases
[all...]
/external/v8/src/x64/
H A Dcodegen-x64.cc710 // from the stack. This also deals with cases where a local variable
1194 ZoneList<CaseClause*>* cases = node->cases(); local
1195 int length = cases->length();
1205 CaseClause* clause = cases->at(i);
1261 CaseClause* clause = cases->at(i);
2626 // There are two cases where the target is not read in the right hand
3426 // NOTE: The code below assumes that the slow cases (calls to runtime)
4351 // Call the stub for all other cases.
4531 // introducing variables. In those cases, w
[all...]
/external/proguard/lib/
H A Dproguard.jarMETA-INF/ META-INF/MANIFEST.MF proguard/evaluation/Stack.class Stack.java package proguard ...

Completed in 256 milliseconds