| /external/llvm/lib/Target/R600/ |
| D | R600MachineScheduler.h | 65 ReadyQueue *Available[IDLast], *Pending[IDLast]; variable
79 Available[IDAlu] = new ReadyQueue(QAlu, "AAlu"); in R600SchedStrategy()
80 Available[IDFetch] = new ReadyQueue(QFetch, "AFetch"); in R600SchedStrategy()
81 Available[IDOther] = new ReadyQueue(QOther, "AOther"); in R600SchedStrategy()
89 delete Available[I]; in ~R600SchedStrategy() local
|
| D | R600MachineScheduler.cpp | 34 Available[IDAlu]->clear(); in initialize()
35 Available[IDFetch]->clear(); in initialize()
36 Available[IDOther]->clear(); in initialize()
71 (Available[CurInstKind]->empty()); in pickNode()
73 (!Available[IDFetch]->empty() || !Available[IDOther]->empty()); in pickNode()
107 Available[i]->dump(); in pickNode()
159 MoveUnits(Pending[IDFetch], Available[IDFetch]); in schedNode()
161 MoveUnits(Pending[IDOther], Available[IDOther]); in schedNode()
416 ReadyQueue *AQ = Available[QID]; in pickOther()
|
| /external/llvm/lib/Target/Hexagon/ |
| D | HexagonMachineScheduler.cpp | 290 Available.push(SU); in releaseNode()
315 DEBUG(dbgs() << "*** " << Available.getName() << " cycle " in bumpCycle()
352 if (Available.empty()) in releasePending()
370 Available.push(SU); in releasePending()
379 if (Available.isInQueue(SU)) in removeReady()
380 Available.remove(Available.find(SU)); in removeReady()
394 for (unsigned i = 0; Available.empty(); ++i) { in pickOnlyChoice()
401 if (Available.size() == 1) in pickOnlyChoice()
402 return *Available.begin(); in pickOnlyChoice()
591 CandResult BotResult = pickNodeFromQueue(Bot.Available, in pickNodeBidrectional()
[all …]
|
| D | HexagonMachineScheduler.h | 137 ReadyQueue Available; member
156 DAG(0), SchedModel(0), Available(ID, Name+".A"), in SchedBoundary()
173 return Available.getID() == ConvergingVLIWScheduler::TopQID; in isTop()
|
| /external/v8/test/cctest/ |
| D | test-alloc.cc | 45 while (new_space->Available() > kNewSpaceFillerSize) { in AllocateAfterFailures()
46 int available_before = static_cast<int>(new_space->Available()); in AllocateAfterFailures()
48 if (available_before == new_space->Available()) { in AllocateAfterFailures()
70 while (old_data_space->Available() > kOldDataSpaceFillerSize) { in AllocateAfterFailures()
80 while (old_pointer_space->Available() > kOldPointerSpaceFillerSize) { in AllocateAfterFailures()
104 while (map_space->Available() > kMapSpaceFillerSize) { in AllocateAfterFailures()
|
| D | test-spaces.cc | 194 while (new_space.Available() >= Page::kMaxNonCodeHeapObjectSize) { in TEST()
226 while (s->Available() > 0) { in TEST()
257 intptr_t available = lo->Available(); in TEST()
261 CHECK(lo->Available() < available); in TEST()
|
| /external/llvm/lib/CodeGen/ |
| D | MachineScheduler.cpp | 1032 ReadyQueue Available; member
1071 Available.clear(); in reset()
1095 DAG(0), SchedModel(0), Rem(0), Available(ID, Name+".A"), in SchedBoundary()
1107 return Available.getID() == ConvergingScheduler::TopQID; in isTop()
1303 I = Bot.Available.begin(), E = Bot.Available.end(); I != E; ++I) { in registerRoots()
1341 for (ReadyQueue::iterator I = Available.begin(), E = Available.end(); in setLatencyPolicy()
1357 DEBUG(dbgs() << "Increase ILP: " << Available.getName() << '\n'); in setLatencyPolicy()
1372 Available.push(SU); in releaseNode()
1406 DEBUG(dbgs() << " *** " << Available.getName() << " cycle " in bumpCycle()
1485 if (Available.empty()) in releasePending()
[all …]
|
| D | RegisterScavenging.cpp | 348 BitVector Available = getRegsAvailable(RC); in scavengeRegister() local
349 Available &= Candidates; in scavengeRegister()
350 if (Available.any()) in scavengeRegister()
351 Candidates = Available; in scavengeRegister()
|
| /external/chromium/net/base/ |
| D | file_stream_unittest.cc | 61 ASSERT_EQ(kTestDataSize, read_stream.Available()); in TEST_F()
94 int64 avail = stream.Available(); in TEST_F()
114 int64 total_bytes_avail = stream.Available(); in TEST_F()
145 int64 total_bytes_avail = stream.Available(); in TEST_F()
180 int64 total_bytes_avail = stream.Available(); in TEST_F()
213 int64 total_bytes_avail = stream.Available(); in TEST_F()
249 int64 total_bytes_avail = stream.Available(); in TEST_F()
452 int64 total_bytes_avail = stream.Available(); in TEST_F()
491 int64 total_bytes_avail = stream.Available(); in TEST_F()
540 int64 total_bytes_avail = stream.Available(); in TEST_F()
[all …]
|
| D | file_stream.h | 66 int64 Available();
|
| /external/markdown/docs/ |
| D | README | 8 supported by the [Available Extensions][].
13 [Available Extensions]: http://www.freewisdom.org/projects/python-markdown/Available_Extensions
|
| /external/qemu/distrib/sdl-1.2.15/ |
| D | README.MiNT | 203 Available if _MCH cookie is ST, Mega ST, STE, Mega STE, TT or Falcon.
209 Available on all machines.
212 Available on all machines (I think).
215 Available if _MCH cookie is STE or Falcon. Supports teamtap.
218 Available with multitasking OS.
221 Available on all machines (I think).
|
| /external/iptables/extensions/ |
| D | libxt_cpu.man | 15 Available since Linux 2.6.36.
|
| D | libxt_quota2.man | 2 on a per-match basis. Available modes are packet counting or byte counting.
|
| /external/dnsmasq/dbus/ |
| D | DBus-interface | 31 Available methods are:
115 Available signals are:
|
| /external/markdown/docs/extensions/ |
| D | index.txt | 1 Available Extensions
|
| /external/v8/src/ |
| D | spaces-inl.h | 316 intptr_t LargeObjectSpace::Available() { in Available() function
317 return ObjectSizeFor(heap()->isolate()->memory_allocator()->Available()); in Available()
|
| D | heap.cc | 214 intptr_t Heap::Available() { in Available() function in v8::internal::Heap
217 return new_space_.Available() + in Available()
218 old_pointer_space_->Available() + in Available()
219 old_data_space_->Available() + in Available()
220 code_space_->Available() + in Available()
221 map_space_->Available() + in Available()
222 cell_space_->Available(); in Available()
319 isolate_->memory_allocator()->Available()); in PrintShortHeapStatistics()
323 new_space_.Available()); in PrintShortHeapStatistics()
328 old_pointer_space_->Available(), in PrintShortHeapStatistics()
[all …]
|
| D | spaces.h | 962 intptr_t Available() { return capacity_ < size_ ? 0 : capacity_ - size_; } in Available() function
978 return (Available() / Page::kPageSize) * Page::kMaxNonCodeHeapObjectSize; in MaxAvailable()
1484 intptr_t Available() { return free_list_.available(); } in Available() function
2129 intptr_t Available() { in Available() function
2486 inline intptr_t Available();
|
| /external/clang/www/analyzer/ |
| D | menu.html.incl | 21 <li><a href="/available_checks.html">Available Checks</a></li>
|
| /external/chromium/chrome/browser/safe_browsing/ |
| D | bloom_filter.cc | 131 int64 remaining64 = filter.Available(); in LoadFile()
|
| /external/srec/config/en.us/ |
| D | baseline.par | 115 G2P.Available = YES
|
| D | baseline8k.par | 124 G2P.Available = YES
|
| D | baseline11k.par | 122 G2P.Available = YES
|
| /external/stlport/ |
| D | configure | 27 Available options:
|