Searched refs:Available (Results 1 - 25 of 50) sorted by relevance

12

/external/chromium_org/v8/src/extensions/
H A Dstatistics-extension.cc108 AddNumber(result, heap->new_space()->Available(),
114 AddNumber(result, heap->old_pointer_space()->Available(),
120 AddNumber(result, heap->old_data_space()->Available(),
126 AddNumber(result, heap->code_space()->Available(),
132 AddNumber(result, heap->cell_space()->Available(),
138 AddNumber(result, heap->property_cell_space()->Available(),
144 AddNumber(result, heap->lo_space()->Available(),
/external/chromium_org/net/base/
H A Dmock_file_stream.cc25 int64 MockFileStream::Available() { function in class:net::testing::MockFileStream
26 return ReturnError64(FileStream::Available());
H A Dfile_stream.h104 virtual int64 Available();
H A Dmock_file_stream.h35 virtual int64 Available() OVERRIDE;
H A Dfile_stream_unittest.cc110 ASSERT_EQ(kTestDataSize, read_stream->Available());
145 int64 avail = stream.Available();
165 int64 total_bytes_avail = stream.Available();
198 int64 total_bytes_avail = stream.Available();
233 int64 total_bytes_avail = stream->Available();
264 int64 total_bytes_avail = stream.Available();
305 int64 total_bytes_avail = stream.Available();
551 int64 total_bytes_avail = stream->Available();
590 int64 total_bytes_avail = stream->Available();
641 int64 total_bytes_avail = stream->Available();
[all...]
/external/chromium/net/base/
H A Dfile_stream.h66 int64 Available();
H A Dfile_stream_unittest.cc61 ASSERT_EQ(kTestDataSize, read_stream.Available());
94 int64 avail = stream.Available();
114 int64 total_bytes_avail = stream.Available();
145 int64 total_bytes_avail = stream.Available();
180 int64 total_bytes_avail = stream.Available();
213 int64 total_bytes_avail = stream.Available();
249 int64 total_bytes_avail = stream.Available();
452 int64 total_bytes_avail = stream.Available();
491 int64 total_bytes_avail = stream.Available();
540 int64 total_bytes_avail = stream.Available();
[all...]
/external/llvm/lib/Target/Hexagon/
H A DHexagonMachineScheduler.cpp291 Available.push(SU);
316 DEBUG(dbgs() << "*** " << Available.getName() << " cycle "
353 if (Available.empty())
371 Available.push(SU);
380 if (Available.isInQueue(SU))
381 Available.remove(Available.find(SU));
395 for (unsigned i = 0; Available.empty(); ++i) {
402 if (Available.size() == 1)
403 return *Available
[all...]
H A DHexagonMachineScheduler.h137 ReadyQueue Available; member in struct:llvm::ConvergingVLIWScheduler::SchedBoundary
156 DAG(0), SchedModel(0), Available(ID, Name+".A"),
173 return Available.getID() == ConvergingVLIWScheduler::TopQID;
/external/sfntly/cpp/src/sfntly/port/
H A Dfile_input_stream.h32 virtual int32_t Available();
H A Dinput_stream.h30 virtual int32_t Available() = 0;
H A Dmemory_input_stream.h32 virtual int32_t Available();
H A Dmemory_input_stream.cc38 int32_t MemoryInputStream::Available() { function in class:sfntly::MemoryInputStream
/external/sfntly/cpp/src/test/
H A Dmemory_io_test.cc43 EXPECT_EQ(is.Available(), (int32_t)kTestBufferLen);
72 EXPECT_EQ(is.Available(), (int32_t)kTestBufferLen - 50);
H A Dfile_io_test.cc48 EXPECT_EQ(length, (size_t)is.Available());
109 EXPECT_EQ((size_t)font_is1.Available(), length);
/external/v8/test/cctest/
H A Dtest-alloc.cc45 while (new_space->Available() > kNewSpaceFillerSize) {
46 int available_before = static_cast<int>(new_space->Available());
48 if (available_before == new_space->Available()) {
70 while (old_data_space->Available() > kOldDataSpaceFillerSize) {
80 while (old_pointer_space->Available() > kOldPointerSpaceFillerSize) {
104 while (map_space->Available() > kMapSpaceFillerSize) {
H A Dtest-spaces.cc194 while (new_space.Available() >= Page::kMaxNonCodeHeapObjectSize) {
226 while (s->Available() > 0) {
257 intptr_t available = lo->Available();
261 CHECK(lo->Available() < available);
/external/llvm/lib/Target/R600/
H A DR600MachineScheduler.cpp66 (Available[CurInstKind].empty());
68 (!Available[IDFetch].empty() || !Available[IDOther].empty());
70 if (CurInstKind == IDAlu && !Available[IDFetch].empty()) {
77 (FetchInstCount + Available[IDFetch].size());
84 // Available[IDFetch].size() * 2 : GPRs required in the Fetch clause
90 unsigned NearRegisterRequirement = 2 * Available[IDFetch].size();
194 MoveUnits(Pending[IDFetch], Available[IDFetch]);
236 Available[IDOther].push_back(SU);
475 std::vector<SUnit *> &AQ = Available[QI
[all...]
H A DR600MachineScheduler.h54 std::vector<SUnit *> Available[IDLast], Pending[IDLast]; member in class:llvm::R600SchedStrategy
/external/sfntly/cpp/src/sfntly/data/
H A Dfont_input_stream.cc35 int32_t FontInputStream::Available() { function in class:sfntly::FontInputStream
37 return stream_->Available();
H A Dfont_input_stream.h63 virtual int32_t Available();
/external/llvm/lib/CodeGen/
H A DMachineScheduler.cpp1234 ReadyQueue Available; member in struct:__anon21175::ConvergingScheduler::SchedBoundary
1293 Available.clear();
1318 DAG(0), SchedModel(0), Rem(0), Available(ID, Name+".A"),
1330 return Available.getID() == ConvergingScheduler::TopQID;
1552 I = Bot.Available.begin(), E = Bot.Available.end(); I != E; ++I) {
1599 DEBUG(dbgs() << Available.getName() << " RemLatency SU("
1616 DEBUG(dbgs() << " " << Available.getName() << " + Remain MOps: "
1627 DEBUG(dbgs() << " " << Available.getName() << " + Remain CritRes: "
1652 // ILat = max N.depth for N in Available|Pendin
[all...]
H A DRegisterScavenging.cpp380 BitVector Available = getRegsAvailable(RC); local
381 Available &= Candidates;
382 if (Available.any())
383 Candidates = Available;
/external/llvm/lib/Target/Mips/
H A DMips16InstrInfo.cpp367 BitVector Available = rs.getRegsAvailable(&Mips::CPU16RegsRegClass); local
369 Available &= Candidates;
378 Reg = Available.find_first();
390 Available.reset(Reg);
394 SpReg = Available.find_first();
406 Available.reset(SpReg);
/external/chromium_org/v8/test/cctest/
H A Dtest-spaces.cc333 while (new_space.Available() >= Page::kMaxNonCodeHeapObjectSize) {
365 while (s->Available() > 0) {
396 intptr_t available = lo->Available();
400 CHECK(lo->Available() < available);

Completed in 263 milliseconds

12