| /external/vboot_reference/tests/ |
| D | tlcl_tests.c | 40 static struct srcall calls[MAXCALLS]; variable
53 memset(calls, 0, sizeof(calls)); in ResetMocks()
55 calls[i].rsp = calls[i].rsp_buf; in ResetMocks()
64 struct srcall *c = calls + call_idx; in SetResponse()
86 struct srcall *c = calls + ncalls++; in VbExTpmSendReceive()
133 TEST_PTR_EQ(calls[0].req, buf, "SendReceive req ptr"); in TlclTest()
134 TEST_EQ(calls[0].req_size, 10, "SendReceive size"); in TlclTest()
137 calls[0].retval = VBERROR_SIMULATED; in TlclTest()
161 TEST_EQ(calls[0].req_cmd, TPM_ORD_Startup, " cmd"); in SendCommandTest()
165 TEST_EQ(calls[0].req_cmd, TPM_ORD_SaveState, " cmd"); in SendCommandTest()
[all …]
|
| /external/valgrind/memcheck/tests/ |
| D | recursive-merge.c | 10 calls++; \
11 (*fnptr[(int)*calls])(calls,seq); \
19 __attribute__((noinline)) void f_a(char *calls, char*seq);
20 __attribute__((noinline)) void f_b(char *calls, char*seq);
21 __attribute__((noinline)) void f_c(char *calls, char*seq);
22 __attribute__((noinline)) void f_d(char *calls, char*seq);
24 __attribute__((noinline)) void f_a(char *calls, char*seq)
27 __attribute__((noinline)) void f_b(char *calls, char*seq)
30 __attribute__((noinline)) void f_c(char *calls, char*seq)
33 __attribute__((noinline)) void f_d(char *calls, char*seq)
[all …]
|
| /external/v8/test/mjsunit/ |
| D | getters-on-elements.js | 81 var calls = 0;
87 ap.__defineGetter__(0, function() { calls++; return 0; });
94 assertEquals(0, calls);
97 assertEquals(1, calls);
100 assertEquals(2, calls);
107 calls = 0;
117 assertEquals(0, calls);
125 assertEquals(3, calls);
131 calls = 0;
146 assertEquals(1, calls);
[all …]
|
| D | setters-on-elements.js | 74 var calls = 0;
80 ap.__defineSetter__(index, function() { calls++; });
87 assertEquals(0, calls);
90 assertEquals(1, calls);
93 assertEquals(2, calls);
100 calls = 0;
108 apap.__defineSetter__(index, function() { calls++; });
112 assertEquals(3, calls);
118 calls = 0;
128 assertEquals(0, calls);
[all …]
|
| /external/llvm/test/tools/llvm-cov/Inputs/ |
| D | test_-b_-f.output | 4 No calls
9 No calls
14 No calls
19 No calls
24 No calls
29 No calls
35 No calls
41 No calls
46 No calls
51 No calls
[all …]
|
| /external/eigen/unsupported/test/ |
| D | BVH.cpp | 48 BallPointStuff() : calls(0), count(0) {} in BallPointStuff()
49 BallPointStuff(const VectorType &inP) : p(inP), calls(0), count(0) {} in BallPointStuff()
52 bool intersectVolume(const BoxType &r) { ++calls; return r.contains(p); } in intersectVolume()
54 ++calls; in intersectObject()
60 …bool intersectVolumeVolume(const BoxType &r1, const BoxType &r2) { ++calls; return !(r1.intersecti… in intersectVolumeVolume()
61 …bool intersectVolumeObject(const BoxType &r, const BallType &b) { ++calls; return r.squaredExterio… in intersectVolumeObject()
62 …bool intersectObjectVolume(const BallType &b, const BoxType &r) { ++calls; return r.squaredExterio… in intersectObjectVolume()
64 ++calls; in intersectObjectObject()
69 …bool intersectVolumeObject(const BoxType &r, const VectorType &v) { ++calls; return r.contains(v);… in intersectVolumeObject()
71 ++calls; in intersectObjectObject()
[all …]
|
| /external/eigen/unsupported/doc/examples/ |
| D | BVH_Example.cpp | 16 PointPointMinimizer() : calls(0) {} in PointPointMinimizer()
19 …double minimumOnVolumeVolume(const Box2d &r1, const Box2d &r2) { ++calls; return r1.squaredExterio… in minimumOnVolumeVolume()
20 …double minimumOnVolumeObject(const Box2d &r, const Vector2d &v) { ++calls; return r.squaredExterio… in minimumOnVolumeObject()
21 …double minimumOnObjectVolume(const Vector2d &v, const Box2d &r) { ++calls; return r.squaredExterio… in minimumOnObjectVolume()
22 …double minimumOnObjectObject(const Vector2d &v1, const Vector2d &v2) { ++calls; return (v1 - v2).s… in minimumOnObjectObject()
24 int calls; member
43 …std::cout << "Brute force distance = " << sqrt(minDistSq) << ", calls = " << minimizer.calls << st… in main()
46 minimizer.calls = 0; in main()
49 …std::cout << "BVH distance = " << sqrt(minDistSq) << ", calls = " << minimizer.calls << st… in main()
|
| /external/v8/test/mjsunit/harmony/ |
| D | proxies-with-unscopables.js | 41 var calls = 0;
46 if (key === 'x' && calls < 1) {
47 calls++;
74 var calls = 0;
77 calls++;
79 return calls === 2;
94 assertEquals(2, calls);
107 var calls = 0;
110 if (calls++ === 0) {
|
| D | object-literals-method.js | 82 var calls = 0;
85 calls++;
90 assertEquals(1, calls);
230 var calls = 0;
233 calls++;
239 assertEquals(1, calls);
|
| /external/strace/ |
| D | count.c | 42 int calls, errors; member
68 cc->calls++; in count_syscall()
125 int m = counts[*((int *) a)].calls; in count_cmp()
126 int n = counts[*((int *) b)].calls; in count_cmp()
184 if (counts == NULL || counts[i].calls == 0) in call_summary_pers()
186 tv_mul(&dtv, &overhead, counts[i].calls); in call_summary_pers()
188 call_cum += counts[i].calls; in call_summary_pers()
200 if (cc->calls == 0) in call_summary_pers()
202 tv_div(&dtv, &cc->time, cc->calls); in call_summary_pers()
214 cc->calls, in call_summary_pers()
|
| /external/antlr/antlr-3.4/runtime/Java/src/main/java/org/antlr/runtime/tree/ |
| D | CommonTreeNodeStream.java | 54 protected IntArray calls; field in CommonTreeNodeStream
77 if ( calls != null ) calls.clear(); in reset()
126 if ( calls==null ) { in push()
127 calls = new IntArray(); in push()
129 calls.push(p); // save current index in push()
137 int ret = calls.pop(); in pop()
|
| D | BufferedTreeNodeStream.java | 120 protected IntArray calls; field in BufferedTreeNodeStream
344 if ( calls==null ) { in push()
345 calls = new IntArray(); in push()
347 calls.push(p); // save current index in push()
355 int ret = calls.pop(); in pop()
363 if (calls != null) { in reset()
364 calls.clear(); in reset()
|
| /external/llvm/test/CodeGen/Mips/llvm-ir/ |
| D | call.ll | 3 ; FIXME: We should remove the need for -enable-mips-tail-calls
4 ; RUN: llc -march=mips -mcpu=mips32 -enable-mips-tail-calls < %s | FileCheck %s -check-prefix=A…
5 ; RUN: llc -march=mips -mcpu=mips32r2 -enable-mips-tail-calls < %s | FileCheck %s -check-prefix=A…
6 ; RUN: llc -march=mips -mcpu=mips32r3 -enable-mips-tail-calls < %s | FileCheck %s -check-prefix=A…
7 ; RUN: llc -march=mips -mcpu=mips32r5 -enable-mips-tail-calls < %s | FileCheck %s -check-prefix=A…
8 ; RUN: llc -march=mips -mcpu=mips32r6 -enable-mips-tail-calls < %s | FileCheck %s -check-prefix=A…
9 ; RUN: llc -march=mips64 -mcpu=mips4 -enable-mips-tail-calls < %s | FileCheck %s -check-prefix=A…
10 ; RUN: llc -march=mips64 -mcpu=mips64 -enable-mips-tail-calls < %s | FileCheck %s -check-prefix=A…
11 ; RUN: llc -march=mips64 -mcpu=mips64r2 -enable-mips-tail-calls < %s | FileCheck %s -check-prefix=A…
12 ; RUN: llc -march=mips64 -mcpu=mips64r3 -enable-mips-tail-calls < %s | FileCheck %s -check-prefix=A…
[all …]
|
| /external/robolectric/src/test/java/com/xtremelabs/robolectric/shadows/ |
| D | FragmentTransactionTest.java | 193 final Map<String, Boolean> calls = new HashMap<String, Boolean>(); in hide_shouldCallOnHiddenChangedOnFragment() local
198 calls.put(key, hidden); in hide_shouldCallOnHiddenChangedOnFragment()
203 assertEquals(true, calls.get(key)); in hide_shouldCallOnHiddenChangedOnFragment()
209 final Map<String, Boolean> calls = new HashMap<String, Boolean>(); in show_shouldCallOnHiddenChangedOnFragment() local
214 calls.put(key, hidden); in show_shouldCallOnHiddenChangedOnFragment()
219 assertEquals(false, calls.get(key)); in show_shouldCallOnHiddenChangedOnFragment()
225 final Map<String, Boolean> calls = new HashMap<String, Boolean>(); in hide_shouldNotCallOnHiddenChangedOnFragmentIfAlreadyHidden() local
230 calls.put(key, hidden); in hide_shouldNotCallOnHiddenChangedOnFragmentIfAlreadyHidden()
235 assertFalse(calls.containsKey(key)); in hide_shouldNotCallOnHiddenChangedOnFragmentIfAlreadyHidden()
241 final Map<String, Boolean> calls = new HashMap<String, Boolean>(); in show_shouldNotCallOnHiddenChangedOnFragmentIfAlreadyNotHidden() local
[all …]
|
| /external/antlr/antlr-3.4/runtime/ObjC/Framework/ |
| D | ANTLRCommonTreeNodeStream.m | 62 calls = [[ANTLRIntArray newArrayWithLen:INITIAL_CALL_STACK_SIZE] retain];
78 calls = [[ANTLRIntArray newArrayWithLen:INITIAL_CALL_STACK_SIZE] retain];
96 if ( calls ) [calls release];
106 if ( calls != nil )
107 [calls reset]; // [calls clear]; // in Java
195 if ( calls == nil ) {
196 calls = [[ANTLRIntArray newArrayWithLen:INITIAL_CALL_STACK_SIZE] retain];
198 [calls push:p]; // save current anIndex
207 int ret = [calls pop];
246 @synthesize calls;
|
| /external/guava/guava-gwt/test-super/com/google/common/base/super/com/google/common/base/ |
| D | SuppliersTest.java | 88 transient int calls = 0; field in SuppliersTest.CountingSupplier
91 calls++; in get()
92 return calls * 10; in get()
111 assertEquals(0, countingSupplier.calls); in checkMemoize()
116 assertEquals(1, countingSupplier.calls); in checkMemoize()
121 assertEquals(1, countingSupplier.calls); in checkMemoize()
|
| /external/guava/guava-tests/test/com/google/common/base/ |
| D | SuppliersTest.java | 96 transient int calls = 0; field in SuppliersTest.CountingSupplier
99 calls++; in get()
100 return calls * 10; in get()
135 assertEquals(0, countingSupplier.calls); in checkMemoize()
140 assertEquals(1, countingSupplier.calls); in checkMemoize()
145 assertEquals(1, countingSupplier.calls); in checkMemoize()
203 assertEquals(0, countingSupplier.calls); in checkExpiration()
207 assertEquals(1, countingSupplier.calls); in checkExpiration()
211 assertEquals(1, countingSupplier.calls); in checkExpiration()
217 assertEquals(2, countingSupplier.calls); in checkExpiration()
[all …]
|
| /external/deqp/doc/testspecs/GLES2/ |
| D | performance.texture.upload.txt | 43 calls. Subgroup 'upload' measures the duration of upload calls (i.e.
44 recorded iteration time includes only multiple texture upload calls).
47 includes multiple upload and draw calls and one buffer swap). Texture
51 The amount of draw calls is automatically calibrated to find a workload
|
| /external/deqp/doc/testspecs/GLES31/ |
| D | functional.debug.txt | 68 Message filtering tests use a partially randomized set of API calls. The
69 messages produced by these calls are first gathered without any filtering.
71 (unfiltered) state and the API calls are re-run. The messages from the second
76 calls and with verification after every push/pop.
78 Asynchronous message generation is tested by running the same set of API calls
80 comparing the generated messages. The set of API calls used is randomized.
82 Other than the calls necessari to query the log these cases use identical
|
| /external/v8/test/webkit/fast/js/ |
| D | caller-property-expected.txt | 33 …properties may not be accessed on strict mode functions or the arguments objects for calls to them.
35 …properties may not be accessed on strict mode functions or the arguments objects for calls to them.
37 …properties may not be accessed on strict mode functions or the arguments objects for calls to them.
39 …properties may not be accessed on strict mode functions or the arguments objects for calls to them.
42 …properties may not be accessed on strict mode functions or the arguments objects for calls to them.
43 …properties may not be accessed on strict mode functions or the arguments objects for calls to them.
46 …properties may not be accessed on strict mode functions or the arguments objects for calls to them.
47 …properties may not be accessed on strict mode functions or the arguments objects for calls to them.
|
| /external/strace/debian/ |
| D | control | 14 a trace of all the system calls made by a another process/program.
18 System calls and signals are events that happen at the user/kernel
28 a trace of all the system calls made by a another process/program.
35 System calls and signals are events that happen at the user/kernel
47 a trace of all the system calls made by a another process/program.
51 System calls and signals are events that happen at the user/kernel
|
| /external/llvm/lib/Transforms/Scalar/ |
| D | PlaceSafepoints.cpp | 278 std::vector<CallInst *> &calls, in scanOneBB() argument
285 calls.push_back(CI); in scanOneBB()
304 std::vector<CallInst *> &calls, in scanInlinedCode() argument
306 calls.clear(); in scanInlinedCode()
309 scanOneBB(start, end, calls, seen, worklist); in scanInlinedCode()
313 scanOneBB(&*BB->begin(), end, calls, seen, worklist); in scanInlinedCode()
792 std::vector<CallInst *> calls; // new calls in InsertSafepointPoll() local
809 scanInlinedCode(&*(start), &*(after), calls, BBs); in InsertSafepointPoll()
817 assert(!calls.empty() && "slow path not found for safepoint poll"); in InsertSafepointPoll()
824 for (size_t i = 0; i < calls.size(); i++) { in InsertSafepointPoll()
[all …]
|
| /external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime/Tree/ |
| D | BufferedTreeNodeStream.cs | 160 protected Stack<int> calls; field in Antlr.Runtime.Tree.BufferedTreeNodeStream
507 if ( calls == null ) in Push()
509 calls = new Stack<int>(); in Push()
511 calls.Push( p ); // save current index in Push()
522 int ret = calls.Pop(); in Pop()
531 if ( calls != null ) in Reset()
533 calls.Clear(); in Reset()
|
| /external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime.Tree/ |
| D | BufferedTreeNodeStream.cs | 151 protected Stack<int> calls; field in Antlr.Runtime.Tree.BufferedTreeNodeStream
427 if (calls == null) { in Push()
428 calls = new Stack<int>(); in Push()
430 calls.Push(p); // save current index in Push()
440 int ret = calls.Pop(); in Pop()
448 if (calls != null) { in Reset()
449 calls.Clear(); in Reset()
|
| /external/guava/guava-tests/test/com/google/common/collect/ |
| D | ForwardingTestCase.java | 45 private final List<String> calls = new ArrayList<String>(); field in ForwardingTestCase
48 calls.add(id); in called()
52 return calls.toString(); in getCalls()
56 return !calls.isEmpty(); in isCalled()
|