/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/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/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) { 494 * @param cases The test cases included in this test suite. 496 TestClass(String name, Collection<TestMethod> cases) { 520 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...] |
BaseMachine.java | 57 /** {@code null-ok;} auxiliary switch cases argument */ 236 public final void auxSwitchArg(SwitchList cases) { 237 if (cases == null) { 238 throw new NullPointerException("cases == null"); 241 auxCases = cases; 335 * Gets the switch cases auxiliary argument.
|
/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) {
|
/external/sqlite/android/ |
Android.mk | 51 # test cases in PhoneNumberUtilsTest.cpp.
|
/external/v8/tools/ |
test.py | 57 def __init__(self, cases): 58 self.cases = cases 59 self.queue = Queue(len(cases)) 60 for case in cases: 63 self.remaining = len(cases) 64 self.total = len(cases) 152 print 'Running %i tests' % len(self.cases) 225 def __init__(self, cases, templates): 226 super(CompactProgressIndicator, self).__init__(cases) [all...] |
/external/v8/test/mjsunit/ |
array-indexing.js | 34 // Negative cases. 53 // Negative cases.
|
/system/core/sh/ |
nodes.h | 82 union node *cases; member in struct:ncase
|
nodes.c | 156 calcsize(n->ncase.cases); 254 new->ncase.cases = copynode(n->ncase.cases);
|
/external/libffi/ |
Libffi.mk | 16 # point OS-specific issues started to creep in. In some cases there
|
/external/v8/test/mjsunit/regress/ |
regress-260.js | 29 // conditions twice, even in cases where the loop condition is
|
/frameworks/base/tools/aidl/ |
AST.h | 276 vector<string> cases; member in struct:Case 288 vector<Case*> cases; member in struct:SwitchStatement
|
AST.cpp | 591 cases.push_back(c); 601 int N = this->cases.size(); 604 string s = this->cases[i]; 632 int N = this->cases.size(); 634 this->cases[i]->Write(to);
|