| /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) {
|
| /cts/tools/utils/ |
| DescriptionGenerator.java | 54 * Input: The source files of the test cases. It will be represented
253 * information of all the test package, test suite and test cases.
411 * @param cases A collection of test cases included by the test suite class.
413 void appendTestCases(Node elem, Collection<TestMethod> cases) {
414 if (cases.isEmpty()) {
418 for (TestMethod caze : cases) {
502 * @param cases The test cases included in this test suite.
504 TestClass(String name, Collection<TestMethod> cases) {
528 ArrayList<TestMethod> cases = new ArrayList<TestMethod>(); local
[all...] |
| /external/webkit/LayoutTests/fast/dom/HTMLTableRowElement/script-tests/ |
| cells.js | 1 description('Test behavior of the HTMLTableRowElement cells attribute in cases where there is unusual nesting.');
|
| /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...] |
| /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);
|
| /dalvik/dx/src/com/android/dx/cf/code/ |
| BaseMachine.java | 57 /** {@code null-ok;} auxiliary switch cases argument */
246 public final void auxSwitchArg(SwitchList cases) {
247 if (cases == null) {
248 throw new NullPointerException("cases == null");
251 auxCases = cases;
345 * Gets the switch cases auxiliary argument.
|
| RopperMachine.java | 559 SwitchList cases = getAuxCases(); local
565 if (cases != null) {
566 if (cases.size() == 0) {
572 IntList values = cases.getValues();
[all...] |
| /external/chromium/chrome/browser/autocomplete/ |
| 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,
|
| /cts/ |
| CtsTestCaseList.mk | 27 # These test cases will be analyzed by the CTS API coverage tools.
|
| /external/dbus/test/name-test/ |
| tmp-session-like-system.conf | 71 to worry about. In some cases, we do set the limits lower than
|
| /external/libffi/ |
| Libffi.mk | 16 # point OS-specific issues started to creep in. In some cases there
|
| /external/sqlite/android/ |
| Android.mk | 60 # test cases in PhoneNumberUtilsTest.cpp.
|
| /external/v8/test/mjsunit/regress/ |
| regress-260.js | 29 // conditions twice, even in cases where the loop condition is
|
| regress-137.js | 42 case 15: return "F"; // Enough cases to trigger fast-case Smi switch.
|
| /external/v8/test/mjsunit/ |
| shifts.js | 30 // test a few corners cases with shifts
|
| div-mod.js | 90 // Test extreme corner cases of modulo.
161 // Edge cases
|
| math-sqrt.js | 28 // Tests the special cases specified by ES 15.8.2.17
|
| mul-exhaustive.js | 51 if (x === y) return; // Symmetric cases not necessary.
[all...] |
| /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);
|
| /frameworks/compile/libbcc/runtime/make/platform/ |
| clang_darwin.mk | 3 # not present in the libgcc that shipped on the platform. In such cases, we link
|
| /external/icu4c/test/cintltst/ |
| cnormtst.c | 167 const char* const cases[][3], int32_t lengthOfCases) {
176 source=CharsToUChars(cases[x][0]);
193 assertEqual(result, cases[x][expIndex], x);
200 assertEqual(result, cases[x][expIndex], x);
529 * Here we pick some specific cases and test the C API.
549 /* normal case with length>=0 (length -1 used for special cases below) */
576 /* specific cases */
737 /* test cases to improve test code coverage */
1436 } cases[]={ local
[all...] |
| /external/llvm/utils/TableGen/ |
| DAGISelMatcher.h | 470 /// to one matcher per opcode. If the opcode doesn't match any of the cases,
474 SmallVector<std::pair<const SDNodeInfo*, Matcher*>, 8> Cases;
476 SwitchOpcodeMatcher(const std::pair<const SDNodeInfo*, Matcher*> *cases,
478 : Matcher(SwitchOpcode), Cases(cases, cases+numcases) {}
484 unsigned getNumCases() const { return Cases.size(); }
486 const SDNodeInfo &getCaseOpcode(unsigned i) const { return *Cases[i].first; }
487 Matcher *getCaseMatcher(unsigned i) { return Cases[i].second; }
488 const Matcher *getCaseMatcher(unsigned i) const { return Cases[i].second;
[all...] |
| /external/icu4c/test/intltest/ |
| 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[] fails with "
[all...] |
