| /external/qemu-pc-bios/bochs/bios/ |
| D | notes | 24 * drive sets the busy bit in Status Reg to 1
26 > drive sets the aborted-command bit in the Error register and
28 > Drive also sets the busy bit in the Status register to 0.
34 transferred, the drive sets the data-request bit to 1, sets
37 the data, the drive sets the data-request bit and the busy bit to 0.
39 the first sector of data, the drive sets the data-request bit to 0,
41 transferred, the drive sets the data-request bit to 1, the busy bit to 0,
43 the drive sets the data-request bit and busy bit to 0.
|
| /external/clang/utils/ |
| D | token-delta.py | 63 def delta(self, c, sets): argument
67 if len(sets) <= 1:
71 res = self.search(c, sets)
76 refined = sum(map(list, map(self.split, sets)), [])
77 if len(refined) == len(sets):
82 def search(self, c, sets): argument
83 for i,S in enumerate(sets):
90 if len(sets) > 2:
91 complement = sum(sets[:i] + sets[i+1:],[])
93 return self.delta(complement, sets[:i] + sets[i+1:])
|
| /external/icu4c/test/intltest/ |
| D | usettest.h | 167 … void testSpan(const UnicodeSetWithStrings *sets[4], const void *s, int32_t length, UBool isUTF16,
171 … void testSpan(const UnicodeSetWithStrings *sets[4], const void *s, int32_t length, UBool isUTF16,
174 void testSpanBothUTFs(const UnicodeSetWithStrings *sets[4],
178 …void testSpanContents(const UnicodeSetWithStrings *sets[4], uint32_t whichSpans, const char *testN…
179 …void testSpanUTF16String(const UnicodeSetWithStrings *sets[4], uint32_t whichSpans, const char *te…
180 …void testSpanUTF8String(const UnicodeSetWithStrings *sets[4], uint32_t whichSpans, const char *tes…
|
| D | usettest.cpp | 3070 void UnicodeSetTest::testSpan(const UnicodeSetWithStrings *sets[4], in testSpan()
3095 limitsCount=getSpans(*sets[i], (UBool)(i&1), in testSpan()
3142 if(!sets[SLOW]->getSet().containsAll(string)) { in testSpan()
3147 if(!sets[FAST]->getSet().containsAll(string)) { in testSpan()
3153 if(!sets[SLOW]->getSet().containsNone(string)) { in testSpan()
3158 if(!sets[FAST]->getSet().containsNone(string)) { in testSpan()
3171 void UnicodeSetTest::testSpan(const UnicodeSetWithStrings *sets[4], in testSpan()
3177 testSpan(sets, s, length, isUTF16, whichSpans, expectLimits, expectCount, testName, index); in testSpan()
3210 void UnicodeSetTest::testSpanBothUTFs(const UnicodeSetWithStrings *sets[4], in testSpanBothUTFs()
3220 testSpan(sets, s16, length16, TRUE, whichSpans, expectLimits, expectCount, testName, index); in testSpanBothUTFs()
[all …]
|
| /external/valgrind/main/cachegrind/ |
| D | cg_sim.c | 45 Int sets; member
62 c->sets = (c->size / c->line_size) / c->assoc; in cachesim_initcache()
63 c->sets_min_1 = c->sets - 1; in cachesim_initcache()
65 c->tag_shift = c->line_size_bits + VG_(log2)(c->sets); in cachesim_initcache()
76 sizeof(UWord) * c->sets * c->assoc); in cachesim_initcache()
78 for (i = 0; i < c->sets * c->assoc; i++) in cachesim_initcache()
|
| /external/bison/tests/ |
| D | sets.at | 22 # Extract the information about the grammar sets from a bison
81 AT_CHECK([[bison --trace=sets input.y]], [], [], [stderr])
82 AT_EXTRACT_SETS([stderr], [sets])
83 AT_CHECK([[cat sets]], [],
165 AT_CHECK([[bison --trace=sets input.y]], [], [], [stderr])
211 AT_CHECK([[bison --trace=sets input.y]], [], [], [stderr])
212 AT_EXTRACT_SETS([stderr], [sets])
213 AT_CHECK([[cat sets]], [],
|
| /external/valgrind/main/callgrind/ |
| D | threads.c | 113 t->lastdump_cost = CLG_(get_eventset_cost)( CLG_(sets).full ); in new_thread()
114 t->sighandler_cost = CLG_(get_eventset_cost)( CLG_(sets).full ); in new_thread()
115 CLG_(init_cost)( CLG_(sets).full, t->lastdump_cost ); in new_thread()
116 CLG_(init_cost)( CLG_(sets).full, t->sighandler_cost ); in new_thread()
213 CLG_(zero_cost)( CLG_(sets).full, es->cost ); in CLG_()
282 CLG_(add_and_zero_cost)( CLG_(sets).full, in CLG_()
332 es->cost = CLG_(get_eventset_cost)(CLG_(sets).full); in new_exec_state()
333 CLG_(zero_cost)( CLG_(sets).full, es->cost ); in new_exec_state()
426 CLG_(print_cost)(-9, CLG_(sets).full, es->cost); in exec_state_save()
453 CLG_(print_cost)(-9, CLG_(sets).full, es->cost); in exec_state_restore()
|
| D | sim.c | 74 int sets; member
158 for (i = 0; i < c->sets * c->assoc; i++) in cachesim_clearcache()
161 for (i = 0; i < c->sets * c->assoc; i++) { in cachesim_clearcache()
183 c->sets = (c->size / c->line_size) / c->assoc; in cachesim_initcache()
184 c->sets_min_1 = c->sets - 1; in cachesim_initcache()
186 c->tag_shift = c->line_size_bits + VG_(log2)(c->sets); in cachesim_initcache()
204 sizeof(UWord) * c->sets * c->assoc); in cachesim_initcache()
219 for (i = 0, set = 0; set < c->sets; set++) {
600 sizeof(line_use) * c->sets * c->assoc); in cacheuse_initcache()
602 sizeof(line_loaded) * c->sets * c->assoc); in cacheuse_initcache()
[all …]
|
| D | dump.c | 513 c->cost = CLG_(get_eventset_cost)( CLG_(sets).full ); in init_fcost()
514 CLG_(init_cost)( CLG_(sets).full, c->cost ); in init_fcost()
638 CLG_(print_cost)(-5, CLG_(sets).full, c->cost); in fprint_fcost()
647 CLG_(add_and_zero_cost)( CLG_(sets).full, dump_total_cost, c->cost ); in fprint_fcost()
675 CLG_ASSERT(CLG_(is_zero_cost)( CLG_(sets).full, jcc->cost)); in fprint_jcc()
749 if (!CLG_(is_zero_cost)( CLG_(sets).full, jcc->cost)) { in fprint_jcc()
759 CLG_(init_cost)( CLG_(sets).full, jcc->cost ); in fprint_jcc()
817 if (!CLG_(is_zero_cost)( CLG_(sets).full, currCost->cost )) { in fprint_bbcc()
838 (!CLG_(is_zero_cost)( CLG_(sets).full, jcc->cost ))) in fprint_bbcc()
842 if (!CLG_(is_zero_cost)( CLG_(sets).full, currCost->cost )) { in fprint_bbcc()
[all …]
|
| D | command.c | 239 CLG_(init_cost_lz)( CLG_(sets).full, &sum ); in dump_state_of_thread()
240 CLG_(copy_cost_lz)( CLG_(sets).full, &tmp, ti->lastdump_cost ); in dump_state_of_thread()
241 CLG_(add_diff_cost)( CLG_(sets).full, sum, in dump_state_of_thread()
244 CLG_(copy_cost)( CLG_(sets).full, ti->lastdump_cost, tmp ); in dump_state_of_thread()
268 CLG_(copy_cost)( CLG_(sets).full, sum, ce->jcc->cost ); in dump_state_of_thread()
269 CLG_(copy_cost)( CLG_(sets).full, tmp, ce->enter_cost ); in dump_state_of_thread()
270 CLG_(add_diff_cost)( CLG_(sets).full, sum, in dump_state_of_thread()
272 CLG_(copy_cost)( CLG_(sets).full, ce->enter_cost, tmp ); in dump_state_of_thread()
|
| /external/llvm/lib/DebugInfo/ |
| D | DWARFDebugAranges.cpp | 66 SetCollection sets; in extract() local
71 sets.push_back(set); in extract()
75 std::for_each(sets.begin(), sets.end(), CountArangeDescriptors(count)); in extract()
80 std::for_each(sets.begin(), sets.end(), range_adder); in extract()
|
| /external/iptables/extensions/ |
| D | libxt_SET.man | 1 This modules adds and/or deletes entries from IP sets which can be defined
5 add the address(es)/port(s) of the packet to the sets
8 delete the address(es)/port(s) of the packet from the sets
|
| /external/guava/guava-testlib/src/com/google/common/collect/testing/features/ |
| D | FeatureUtil.java | 310 public static <T> Set<T> intersection(Set<? extends T> ... sets) { in intersection() argument
311 if (sets.length == 0) { in intersection()
315 Set<T> results = Helpers.copyToSet(sets[0]); in intersection()
316 for (int i = 1; i < sets.length; i++) { in intersection()
317 Set<? extends T> set = sets[i]; in intersection()
|
| /external/llvm/lib/Support/ |
| D | regfree.c | 65 if (g->sets != NULL) in llvm_regfree()
66 free((char *)g->sets); in llvm_regfree()
|
| /external/protobuf/gtest/scripts/ |
| D | fuse_gtest_files.py | 63 import sets
150 processed_files = sets.Set() # Holds all gtest headers we've processed.
178 processed_files = sets.Set()
|
| /external/chromium/testing/gmock/scripts/ |
| D | fuse_gmock_files.py | 66 import sets
123 processed_files = sets.Set() # Holds all gmock headers we've processed.
162 processed_files = sets.Set()
|
| /external/gtest/scripts/ |
| D | fuse_gtest_files.py | 63 import sets
150 processed_files = sets.Set() # Holds all gtest headers we've processed.
178 processed_files = sets.Set()
|
| /external/chromium/testing/gtest/scripts/ |
| D | fuse_gtest_files.py | 63 import sets
150 processed_files = sets.Set() # Holds all gtest headers we've processed.
178 processed_files = sets.Set()
|
| /external/protobuf/gtest/test/ |
| D | gtest_filter_unittest.py | 47 import sets
202 self.assertEqual(sets.Set(set_var), sets.Set(full_partition))
209 return list(sets.Set(tests_to_run) - sets.Set(PARAM_TESTS))
|
| /external/chromium/testing/gtest/test/ |
| D | gtest_filter_unittest.py | 47 import sets
246 self.assertEqual(sets.Set(set_var), sets.Set(full_partition))
253 return list(sets.Set(tests_to_run) - sets.Set(PARAM_TESTS))
|
| /external/gtest/test/ |
| D | gtest_filter_unittest.py | 47 import sets
246 self.assertEqual(sets.Set(set_var), sets.Set(full_partition))
253 return list(sets.Set(tests_to_run) - sets.Set(PARAM_TESTS))
|
| /external/srec/tools/thirdparty/OpenFst/fst/lib/ |
| D | equivalent.h | 81 static MappedId FindSet(UnionFind<MappedId> *sets, MappedId id) { in FindSet()
82 MappedId repr = sets->FindSet(id); in FindSet()
86 sets->MakeSet(id); in FindSet()
|
| /external/icu4c/i18n/ |
| D | rematch.cpp | 2793 UVector *sets = fPattern->fSets; in MatchAt() local
3233 UnicodeSet **sets = fPattern->fStaticSets; in MatchAt() local
3234 if (sets[URX_GC_NORMAL]->contains(c)) goto GC_Extend; in MatchAt()
3235 if (sets[URX_GC_CONTROL]->contains(c)) goto GC_Control; in MatchAt()
3236 if (sets[URX_GC_L]->contains(c)) goto GC_L; in MatchAt()
3237 if (sets[URX_GC_LV]->contains(c)) goto GC_V; in MatchAt()
3238 if (sets[URX_GC_LVT]->contains(c)) goto GC_T; in MatchAt()
3239 if (sets[URX_GC_V]->contains(c)) goto GC_V; in MatchAt()
3240 if (sets[URX_GC_T]->contains(c)) goto GC_T; in MatchAt()
3249 if (sets[URX_GC_L]->contains(c)) goto GC_L; in MatchAt()
[all …]
|
| /external/llvm/test/TableGen/ |
| D | SetTheory.td | 2 // RUN: llvm-tblgen -print-sets %s | FileCheck %s
5 // The -print-sets driver configures a primitive SetTheory instance that
6 // understands these sets:
38 // Mixed sets and elements are flattened.
62 // The 'and' operator intersects two sets. The result has the same order as the
|
| /external/llvm/include/llvm/Target/ |
| D | TargetSchedule.td | 17 // available across all chip sets for the target. Eg., IntUnit, FPUnit, ...
19 // all chip sets of the target. Each functional unit is treated as a resource
72 // instructions across chip sets. An instruction uses the same itinerary class
73 // across all chip sets. Thus a new chip set can be added without modifying
|