| /external/pdfium/xfa/src/fxbarcode/datamatrix/ |
| D | BC_DataMatrixDecodedBitStreamParser.cpp | 92 } while (mode != PAD_ENCODE && bits.Available() > 0); in Decode()
167 if (oneByte == 254 && bits->Available() == 0) { in DecodeAsciiSegment()
173 } while (bits->Available() > 0); in DecodeAsciiSegment()
184 if (bits->Available() == 8) { in DecodeC40Segment()
260 } while (bits->Available() > 0); in DecodeC40Segment()
271 if (bits->Available() == 8) { in DecodeTextSegment()
351 } while (bits->Available() > 0); in DecodeTextSegment()
360 if (bits->Available() == 8) { in DecodeAnsiX12Segment()
391 } while (bits->Available() > 0); in DecodeAnsiX12Segment()
412 if (bits->Available() <= 16) { in DecodeEdifactSegment()
[all …]
|
| /external/llvm/lib/Target/Hexagon/ |
| D | HexagonMachineScheduler.cpp | 299 Available.push(SU); in releaseNode()
324 DEBUG(dbgs() << "*** " << Available.getName() << " cycle " in bumpCycle()
361 if (Available.empty()) in releasePending()
379 Available.push(SU); in releasePending()
388 if (Available.isInQueue(SU)) in removeReady()
389 Available.remove(Available.find(SU)); in removeReady()
403 for (unsigned i = 0; Available.empty(); ++i) { in pickOnlyChoice()
410 if (Available.size() == 1) in pickOnlyChoice()
411 return *Available.begin(); in pickOnlyChoice()
598 CandResult BotResult = pickNodeFromQueue(Bot.Available, in pickNodeBidrectional()
[all …]
|
| D | HexagonMachineScheduler.h | 137 ReadyQueue Available; member
156 DAG(nullptr), SchedModel(nullptr), Available(ID, Name+".A"), in VLIWSchedBoundary()
173 return Available.getID() == ConvergingVLIWScheduler::TopQID; in isTop()
|
| /external/llvm/lib/Target/AMDGPU/ |
| D | R600MachineScheduler.cpp | 65 (Available[CurInstKind].empty()); in pickNode()
67 (!Available[IDFetch].empty() || !Available[IDOther].empty()); in pickNode()
69 if (CurInstKind == IDAlu && !Available[IDFetch].empty()) { in pickNode()
76 (FetchInstCount + Available[IDFetch].size()); in pickNode()
92 unsigned NearRegisterRequirement = 2 * Available[IDFetch].size(); in pickNode()
179 MoveUnits(Pending[IDFetch], Available[IDFetch]); in schedNode()
207 Available[IDOther].push_back(SU); in releaseBottomNode()
459 std::vector<SUnit *> &AQ = Available[QID]; in pickOther()
|
| D | R700Instructions.td | 11 // - Available to R700 and newer VLIW4/VLIW5 GPUs
12 // - Available only on R700 family GPUs.
|
| /external/google-breakpad/src/common/ |
| D | byte_cursor.h | 103 size_t Available() const { return size_t(buffer_->end - here_); } in Available() function
106 bool AtEnd() const { return Available() == 0; } in AtEnd()
171 = static_cast<const uint8_t *>(memchr(here_, '\0', Available())); in CString()
240 if (Available() >= size) { in CheckAvailable()
|
| /external/v8/src/extensions/ |
| D | statistics-extension.cc | 121 {heap->new_space()->Available(), "new_space_available_bytes"}, in GetCounters()
124 {heap->old_space()->Available(), "old_space_available_bytes"}, in GetCounters()
127 {heap->code_space()->Available(), "code_space_available_bytes"}, in GetCounters()
130 {heap->lo_space()->Available(), "lo_space_available_bytes"}, in GetCounters()
|
| /external/llvm/lib/CodeGen/ |
| D | MachineScheduler.cpp | 1666 Available.clear(); in reset()
1813 DEBUG(dbgs() << Available.getName() << " RemLatency SU(" in findMaxLatency()
1830 DEBUG(dbgs() << " " << Available.getName() << " + Remain MOps: " in getOtherResourceCount()
1841 DEBUG(dbgs() << " " << Available.getName() << " + Remain CritRes: " in getOtherResourceCount()
1868 Available.push(SU); in releaseNode()
1924 DEBUG(dbgs() << "Cycle: " << CurrCycle << ' ' << Available.getName() << '\n'); in bumpCycle()
2066 DEBUG(dbgs() << " " << Available.getName() in bumpNode()
2071 DEBUG(dbgs() << " " << Available.getName() in bumpNode()
2103 if (Available.empty()) in releasePending()
2122 Available.push(SU); in releasePending()
[all …]
|
| D | RegisterScavenging.cpp | 383 BitVector Available = getRegsAvailable(RC); in scavengeRegister() local
384 Available &= Candidates; in scavengeRegister()
385 if (Available.any()) in scavengeRegister()
386 Candidates = Available; in scavengeRegister()
|
| /external/markdown/docs/ |
| D | README | 8 supported by the [Available Extensions][].
13 [Available Extensions]: http://www.freewisdom.org/projects/python-markdown/Available_Extensions
|
| /external/sfntly/cpp/src/test/ |
| D | memory_io_test.cc | 43 EXPECT_EQ(is.Available(), (int32_t)kTestBufferLen); in TestMemoryInputStream()
72 EXPECT_EQ(is.Available(), (int32_t)kTestBufferLen - 50); in TestMemoryInputStream()
|
| D | file_io_test.cc | 48 EXPECT_EQ(length, (size_t)is.Available()); in TestFileInputStream()
109 EXPECT_EQ((size_t)font_is1.Available(), length); in TestFontInputStreamBasic()
|
| /external/sfntly/cpp/src/sfntly/data/ |
| D | font_input_stream.cc | 35 int32_t FontInputStream::Available() { in Available() function in sfntly::FontInputStream
37 return stream_->Available(); in Available()
|
| D | font_input_stream.h | 63 virtual int32_t Available();
|
| /external/llvm/lib/Target/Mips/ |
| D | Mips16InstrInfo.cpp | 364 BitVector Available = rs.getRegsAvailable(&Mips::CPU16RegsRegClass); in loadImmediate() local
365 Available &= Candidates; in loadImmediate()
373 Reg = Available.find_first(); in loadImmediate()
385 Available.reset(Reg); in loadImmediate()
389 SpReg = Available.find_first(); in loadImmediate()
401 Available.reset(SpReg); in loadImmediate()
|
| /external/pdfium/xfa/src/fxbarcode/common/ |
| D | BC_CommonBitSource.h | 14 int32_t Available();
|
| D | BC_CommonBitSource.cpp | 66 int32_t CBC_CommonBitSource::Available() { in Available() function in CBC_CommonBitSource
|
| /external/sfntly/cpp/src/sfntly/port/ |
| D | input_stream.h | 30 virtual int32_t Available() = 0;
|
| D | file_input_stream.h | 32 virtual int32_t Available();
|
| D | memory_input_stream.h | 32 virtual int32_t Available();
|
| /external/iptables/extensions/ |
| D | libxt_cpu.man | 15 Available since Linux 2.6.36.
|
| /external/v8/src/base/platform/ |
| D | time.cc | 599 bool Available() { return clock_id_ != kClockInvalid; } in Available() function in v8::base::KernelTimestampClock
623 bool Available() { return false; } in Available() function in v8::base::KernelTimestampClock
642 return kernel_tick_clock.Pointer()->Available(); in KernelTimestampAvailable()
|
| /external/lz4/programs/ |
| D | lz4cat.1 | 25 Available options are the same as \fBlz4\fR ones (man lz4).
|
| /external/dnsmasq/dbus/ |
| D | DBus-interface | 31 Available methods are:
115 Available signals are:
|
| /external/pdfium/xfa/src/fxbarcode/qrcode/ |
| D | BC_QRDecodedBitStreamParser.cpp | 51 if (bits.Available() < 4) { in Decode()
164 if ((count << 3) > bits->Available()) { in DecodeByteSegment()
|