| /external/chromium/net/base/ |
| file_stream.h | 64 // Returns the number of bytes available to read from the current stream
66 int64 Available();
|
| file_stream_unittest.cc | 61 ASSERT_EQ(kTestDataSize, read_stream.Available());
93 // Try 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();
[all...] |
| file_stream_posix.cc | 345 int64 FileStream::Available() {
|
| file_stream_win.cc | 201 int64 FileStream::Available() {
|
| /external/v8/test/cctest/ |
| test-alloc.cc | 45 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) {
|
| test-spaces.cc | 194 while (new_space.Available() >= Page::kMaxNonCodeHeapObjectSize) {
226 while (s->Available() > 0) {
257 intptr_t available = lo->Available(); local
261 CHECK(lo->Available() < available);
|
| /external/llvm/lib/Target/Hexagon/ |
| HexagonMachineScheduler.cpp | 264 /// Keep track of available resources.
550 Available.push(SU);
575 DEBUG(dbgs() << "*** " << Available.getName() << " cycle "
608 /// Release pending ready nodes in to the available queue. This makes them
611 // If the available queue is empty, it is safe to reset MinReadyCycle.
612 if (Available.empty())
616 // so, add them to the available queue.
630 Available.push(SU);
639 if (Available.isInQueue(SU))
640 Available.remove(Available.find(SU))
[all...] |
| HexagonMachineScheduler.h | 341 ReadyQueue Available;
351 /// MinReadyCycle - Cycle of the soonest available instruction.
360 DAG(0), Available(ID, Name+".A"),
372 return Available.getID() == ConvergingVLIWScheduler::TopQID;
|
| /external/llvm/lib/CodeGen/ |
| MachineScheduler.cpp | 802 ReadyQueue Available;
811 /// MinReadyCycle - Cycle of the soonest available instruction.
820 DAG(0), Available(ID, Name+".A"),
828 return Available.getID() == ConvergingScheduler::TopQID;
[all...] |
| RegisterScavenging.cpp | 12 // It also provides a mechanism to make registers available by evicting them to
244 /// getRegsAvailable - Return all available registers in the register class
319 "No available scavenger restore location!");
345 BitVector Available = getRegsAvailable(RC);
346 Available &= Candidates;
347 if (Available.any())
348 Candidates = Available;
|
| /external/v8/src/ |
| spaces-inl.h | 316 intptr_t LargeObjectSpace::Available() {
317 return ObjectSizeFor(heap()->isolate()->memory_allocator()->Available());
|
| spaces.h | 961 // Returns the maximum available bytes of heaps.
962 intptr_t Available() { return capacity_ < size_ ? 0 : capacity_ - size_; }
967 // Returns the maximum available executable bytes of heaps.
976 // Returns maximum available bytes that the old space can have.
978 return (Available() / Page::kPageSize) * Page::kMaxNonCodeHeapObjectSize;
1357 intptr_t available() { return available_; } function in class:v8::internal::BASE_EMBEDDED
[all...] |
| heap.cc | 214 intptr_t Heap::Available() {
217 return new_space_.Available() +
218 old_pointer_space_->Available() +
219 old_data_space_->Available() +
220 code_space_->Available() +
221 map_space_->Available() +
222 cell_space_->Available();
271 // Note that MemoryAllocator->MaxAvailable() undercounts the memory available
274 // and does not count available bytes already in the old space or code
317 ", available: %8" V8_PTR_PREFIX "d\n"
[all...] |
| spaces.cc | 698 ", available: %%%d\n\n",
[all...] |
| heap.h | 483 // Returns the available bytes in space w/o growing.
485 // all available bytes. Check MaxHeapObjectSize() instead.
486 intptr_t Available();
[all...] |
| /external/chromium/chrome/browser/safe_browsing/ |
| bloom_filter.cc | 131 int64 remaining64 = filter.Available();
|
| /external/stlport/ |
| configure | 27 Available options:
|
| /external/chromium/chrome/browser/themes/ |
| browser_theme_pack.cc | 284 int64 avail = file.Available();
[all...] |
| /build/core/ |
| main.mk | 913 @echo "Available sub-modules:"
|
| /external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/org.apache.ant_1.7.1.v20090120-1145/lib/ |
| ant.jar | |
| /prebuilts/tools/common/ant/ |
| ant.jar | |
| /prebuilts/tools/darwin-x86/swt/ |
| swt.jar | |
| /external/webkit/PerformanceTests/SunSpider/tests/sunspider-0.9/ |
| string-unpack-code.js | [all...] |
| /external/webkit/PerformanceTests/SunSpider/tests/sunspider-0.9.1/ |
| string-unpack-code.js | [all...] |
| /prebuilts/tools/darwin-x86_64/swt/ |
| swt.jar | |
