/third_party/protobuf/src/google/protobuf/stubs/ |
H A D | bytestream_unittest.cc | 53 size_t Available() const { return data_.size(); } in Available() function in google::protobuf::strings::__anon17053::MockByteSource 90 EXPECT_EQ(6, limit_source.Available()); in TEST() 92 EXPECT_EQ(5, limit_source.Available()); in TEST() 97 limit_source.CopyTo(&sink, limit_source.Available()); in TEST() 99 EXPECT_EQ(0, limit_source.Available()); in TEST() 100 EXPECT_EQ(6, source.Available()); in TEST() 106 source.CopyTo(&sink, source.Available()); in TEST() 108 EXPECT_EQ(0, source.Available()); in TEST()
|
H A D | bytestream.h | 101 // while (source->Available() > 0) { 112 // Returns the number of bytes left to read from the source. Available() 113 // should decrease by N each time Skip(N) is called. Available() may not 114 // increase. Available() returning 0 indicates that the ByteSource is 119 virtual size_t Available() const = 0; 122 // reposition the source. The returned region is empty iff Available() == 0. 127 // The length of the returned StringPiece will be <= Available(). 133 // REQUIRES: Available() >= n 141 // REQUIRES: Available() >= n 293 // assert(source.Available() [all...] |
H A D | bytestream.cc | 148 size_t ArrayByteSource::Available() const { in Available() function in google::protobuf::strings::ArrayByteSource 166 size_t LimitByteSource::Available() const { in Available() function in google::protobuf::strings::LimitByteSource 167 size_t available = source_->Available(); in Available()
|
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Target/SystemZ/ |
H A D | SystemZMachineScheduler.cpp | 11 // the MachineScheduler. It has a sorted Available set of SUs and a pickNode() 162 if (Available.empty()) in pickNode() 166 if (Available.size() == 1) { in pickNode() 168 HazardRec->dumpSU(*Available.begin(), dbgs()); dbgs() << "\n";); in pickNode() 169 return *Available.begin(); in pickNode() 172 // All nodes that are possible to schedule are stored in the Available set. in pickNode() 173 LLVM_DEBUG(dbgs() << "** Available: "; Available.dump(*HazardRec);); in pickNode() 176 for (auto *SU : Available) { in pickNode() 243 if (Available in schedNode() [all...] |
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Target/Hexagon/ |
H A D | HexagonMachineScheduler.cpp | 358 Available.push(SU); in releaseNode() 384 LLVM_DEBUG(dbgs() << "*** Next cycle " << Available.getName() << " cycle " in bumpCycle() 421 if (Available.empty()) in releasePending() 439 Available.push(SU); in releasePending() 448 if (Available.isInQueue(SU)) in removeReady() 449 Available.remove(Available.find(SU)); in removeReady() 464 if (Available.empty()) in pickOnlyChoice() 466 if (Available.size() == 1 && Pending.size() > 0) in pickOnlyChoice() 467 return !ResourceModel->isResourceAvailable(*Available in pickOnlyChoice() [all...] |
H A D | HexagonMachineScheduler.h | 137 ReadyQueue Available; member 157 : Available(ID, Name+".A"), in VLIWSchedBoundary() 192 return Available.getID() == ConvergingVLIWScheduler::TopQID; in isTop()
|
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Target/AMDGPU/ |
H A 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() 86 // Available[IDFetch].size() * 2 : GPRs required in the Fetch clause in pickNode() 92 unsigned NearRegisterRequirement = 2 * Available[IDFetch].size(); in pickNode() 176 MoveUnits(Pending[IDFetch], Available[IDFetch]); in schedNode() 204 Available[IDOther].push_back(SU); in releaseBottomNode() 455 std::vector<SUnit *> &AQ = Available[QI in pickOther() [all...] |
H A D | R600MachineScheduler.h | 53 std::vector<SUnit *> Available[IDLast], Pending[IDLast]; member in llvm::final
|
/third_party/node/deps/v8/src/extensions/ |
H A D | statistics-extension.cc | 108 new_space_available = heap->new_space()->Available(); in GetCounters() 118 {heap->old_space()->Available(), "old_space_available_bytes"}, in GetCounters() 121 {heap->code_space()->Available(), "code_space_available_bytes"}, in GetCounters() 124 {heap->lo_space()->Available(), "lo_space_available_bytes"}, in GetCounters() 127 {heap->code_lo_space()->Available(), "code_lo_space_available_bytes"}, in GetCounters()
|
/third_party/skia/third_party/externals/sfntly/cpp/src/test/ |
H A 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()
|
H A 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()
|
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/CodeGen/ |
H A D | MachineScheduler.cpp | 1859 Available.clear(); in reset() 2050 LLVM_DEBUG(dbgs() << Available.getName() << " RemLatency SU(" in findMaxLatency() 2067 LLVM_DEBUG(dbgs() << " " << Available.getName() << " + Remain MOps: " in getOtherResourceCount() 2079 dbgs() << " " << Available.getName() << " + Remain CritRes: " in getOtherResourceCount() 2105 checkHazard(SU) || (Available.size() >= ReadyListLimit); in releaseNode() 2108 Available.push(SU); in releaseNode() 2154 LLVM_DEBUG(dbgs() << "Cycle: " << CurrCycle << ' ' << Available.getName() in bumpCycle() 2304 LLVM_DEBUG(dbgs() << " " << Available.getName() << " TopLatency SU(" in bumpNode() 2309 LLVM_DEBUG(dbgs() << " " << Available.getName() << " BotLatency SU(" in bumpNode() 2351 if (Available in releasePending() [all...] |
/third_party/node/deps/v8/src/heap/ |
H A D | free-list.cc | 121 DCHECK(IsVeryLong() || Available() == SumFreeLists()); in TryFindNodeIn() 139 DCHECK(IsVeryLong() || Available() == SumFreeLists()); in SearchForNodeInList() 231 DCHECK(IsVeryLong() || Available() == SumFreeLists()); in Allocate() 337 DCHECK(IsVeryLong() || Available() == SumFreeLists()); in Allocate() 403 DCHECK(IsVeryLong() || Available() == SumFreeLists()); in Allocate()
|
H A D | large-spaces.h | 79 // Available bytes for objects in this space. 80 size_t Available() const override; 199 // Available bytes for objects in this space. 200 size_t Available() const override;
|
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Target/Mips/ |
H A D | Mips16InstrInfo.cpp | 378 BitVector Available = rs.getRegsAvailable(&Mips::CPU16RegsRegClass); in loadImmediate() local 379 Available &= Candidates; in loadImmediate() 387 Reg = Available.find_first(); in loadImmediate() 399 Available.reset(Reg); in loadImmediate() 403 SpReg = Available.find_first(); in loadImmediate() 415 Available.reset(SpReg); in loadImmediate()
|
/third_party/skia/third_party/externals/sfntly/cpp/src/sfntly/data/ |
H A D | font_input_stream.cc | 43 int32_t FontInputStream::Available() { in Available() function in sfntly::FontInputStream 45 return stream_->Available(); in Available()
|
H A D | font_input_stream.h | 63 virtual int32_t Available();
|
/third_party/python/PCbuild/ |
H A D | prepare_ssl.bat | 12 echo.Available flags:
15 echo.Available arguments:
|
H A D | prepare_tcltk.bat | 12 echo.Available flags:
15 echo.Available arguments:
|
H A D | build.bat | 18 echo.Available flags:
39 echo.Available flags to avoid building certain modules.
45 echo.Available arguments:
|
/third_party/skia/third_party/externals/sfntly/cpp/src/sfntly/port/ |
H A D | file_input_stream.h | 33 virtual int32_t Available();
|
H A D | input_stream.h | 28 virtual int32_t Available() = 0;
|
H A D | memory_input_stream.h | 33 virtual int32_t Available();
|
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/IR/ |
H A D | SafepointIRVerifier.cpp | 517 AvailableValueSet &Available); 784 AvailableValueSet &Available) { in transferInstruction() 787 Available.clear(); in transferInstruction() 789 Available.insert(&I); in transferInstruction() 783 transferInstruction(const Instruction &I, bool &Cleared, AvailableValueSet &Available) transferInstruction() argument
|
/third_party/skia/third_party/externals/dawn/src/dawn_native/ |
H A D | QuerySet.h | 63 enum class QuerySetState { Unavailable, Available, Destroyed }; member in dawn_native::QuerySetBase::QuerySetState
|