| /external/pdfium/xfa/src/fxbarcode/common/ |
| BC_CommonBitSource.h | 14 int32_t Available();
|
| BC_CommonBitSource.cpp | 66 int32_t CBC_CommonBitSource::Available() {
|
| /external/sfntly/cpp/src/sfntly/port/ |
| file_input_stream.h | 32 virtual int32_t Available();
|
| input_stream.h | 30 virtual int32_t Available() = 0;
|
| memory_input_stream.h | 32 virtual int32_t Available();
|
| memory_input_stream.cc | 38 int32_t MemoryInputStream::Available() {
|
| /toolchain/binutils/binutils-2.25/gas/testsuite/gas/m68hc11/ |
| malis-include.s | 9 ;; Available at:
|
| /external/pdfium/xfa/src/fxbarcode/datamatrix/ |
| BC_DataMatrixDecodedBitStreamParser.cpp | 92 } while (mode != PAD_ENCODE && bits.Available() > 0);
167 if (oneByte == 254 && bits->Available() == 0) {
173 } while (bits->Available() > 0);
184 if (bits->Available() == 8) {
260 } while (bits->Available() > 0);
271 if (bits->Available() == 8) {
351 } while (bits->Available() > 0);
360 if (bits->Available() == 8) {
391 } while (bits->Available() > 0);
412 if (bits->Available() <= 16) {
[all...] |
| /prebuilts/tools/darwin-x86_64/protoc/include/google/protobuf/stubs/ |
| bytestream.h | 100 // while (source->Available() > 0) {
111 // Returns the number of bytes left to read from the source. Available()
112 // should decrease by N each time Skip(N) is called. Available() may not
113 // increase. Available() returning 0 indicates that the ByteSource is
118 virtual size_t Available() const = 0;
121 // reposition the source. The returned region is empty iff Available() == 0.
126 // The length of the returned StringPiece will be <= Available().
132 // REQUIRES: Available() >= n
140 // REQUIRES: Available() >= n
292 // assert(source.Available() == 5)
[all...] |
| /external/google-breakpad/src/common/ |
| byte_cursor.h | 102 // Return the number of bytes available to read at the cursor.
103 size_t Available() const { return size_t(buffer_->end - here_); }
106 bool AtEnd() const { return Available() == 0; }
171 = static_cast<const uint8_t *>(memchr(here_, '\0', Available()));
187 // - If there are not LIMIT bytes available at the cursor, clear the
236 // If there are at least SIZE bytes available to read from the buffer,
240 if (Available() >= size) {
|
| /external/llvm/lib/Target/Hexagon/ |
| HexagonMachineScheduler.cpp | 82 /// Keep track of available resources.
299 Available.push(SU);
324 DEBUG(dbgs() << "*** " << Available.getName() << " cycle "
357 /// Release pending ready nodes in to the available queue. This makes them
360 // If the available queue is empty, it is safe to reset MinReadyCycle.
361 if (Available.empty())
365 // so, add them to the available queue.
379 Available.push(SU);
388 if (Available.isInQueue(SU))
389 Available.remove(Available.find(SU))
[all...] |
| HexagonMachineScheduler.h | 137 ReadyQueue Available;
147 /// MinReadyCycle - Cycle of the soonest available instruction.
156 DAG(nullptr), SchedModel(nullptr), Available(ID, Name+".A"),
173 return Available.getID() == ConvergingVLIWScheduler::TopQID;
|
| /external/sfntly/cpp/src/sfntly/data/ |
| font_input_stream.h | 63 virtual int32_t Available();
|
| font_input_stream.cc | 35 int32_t FontInputStream::Available() {
37 return stream_->Available();
|
| /external/v8/src/extensions/ |
| statistics-extension.cc | 121 {heap->new_space()->Available(), "new_space_available_bytes"},
124 {heap->old_space()->Available(), "old_space_available_bytes"},
127 {heap->code_space()->Available(), "code_space_available_bytes"},
130 {heap->lo_space()->Available(), "lo_space_available_bytes"},
|
| /frameworks/opt/net/wifi/service/java/com/android/server/wifi/anqp/ |
| IPAddressTypeAvailabilityElement.java | 15 public enum IPv6Availability {NotAvailable, Available, Unknown, Reserved}
|
| /external/sfntly/cpp/src/test/ |
| memory_io_test.cc | 43 EXPECT_EQ(is.Available(), (int32_t)kTestBufferLen);
72 EXPECT_EQ(is.Available(), (int32_t)kTestBufferLen - 50);
|
| file_io_test.cc | 48 EXPECT_EQ(length, (size_t)is.Available());
109 EXPECT_EQ((size_t)font_is1.Available(), length);
|
| /external/llvm/lib/Target/AMDGPU/ |
| R600MachineScheduler.cpp | 65 (Available[CurInstKind].empty());
67 (!Available[IDFetch].empty() || !Available[IDOther].empty());
69 if (CurInstKind == IDAlu && !Available[IDFetch].empty()) {
76 (FetchInstCount + Available[IDFetch].size());
86 // Available[IDFetch].size() * 2 : GPRs required in the Fetch clause
92 unsigned NearRegisterRequirement = 2 * Available[IDFetch].size();
179 MoveUnits(Pending[IDFetch], Available[IDFetch]);
207 Available[IDOther].push_back(SU);
423 // If there is a T_XYZW alu available, use i
[all...] |
| R600MachineScheduler.h | 54 std::vector<SUnit *> Available[IDLast], Pending[IDLast];
|
| /external/v8/tools/ |
| try_perf.py | 73 'Available public benchmarks: %s' % (benchmark, PUBLIC_BENCHMARKS))
|
| /external/webrtc/webrtc/tools/rtcbot/rtcBotReportVisualizer/ |
| main.js | 57 analyzeData(reports, filesNames, "Available Send Bandwidth-bot1", "bot1",
59 analyzeData(reports, filesNames, "Available Send Bandwidth-bot2", "bot2",
63 analyzeData(reports, filesNames, "Available Receive Bandwidth-bot1", "bot1",
65 analyzeData(reports, filesNames, "Available Receive Bandwidth-bot2", "bot2",
|
| /external/llvm/lib/Target/Mips/ |
| Mips16InstrInfo.cpp | 364 BitVector Available = rs.getRegsAvailable(&Mips::CPU16RegsRegClass);
365 Available &= Candidates;
373 Reg = Available.find_first();
385 Available.reset(Reg);
389 SpReg = Available.find_first();
401 Available.reset(SpReg);
|
| /external/llvm/lib/CodeGen/ |
| RegisterScavenging.cpp | 12 // It also provides a mechanism to make registers available by evicting them to
274 /// getRegsAvailable - Return all available registers in the register class
349 "No available scavenger restore location!");
383 BitVector Available = getRegsAvailable(RC);
384 Available &= Candidates;
385 if (Available.any())
386 Candidates = Available;
398 // Find an available scavenging slot.
|
| /external/curl/ |
| curl-config.in | 13 # are also available at http://curl.haxx.se/docs/copyright.html.
34 Available values for OPTION include:
|
