| /external/chromium_org/third_party/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();
|
| /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();
|
| /external/chromium_org/net/base/ |
| mock_file_stream.cc | 25 int64 MockFileStream::Available() {
26 return ReturnError64(FileStream::Available());
|
| file_stream.h | 112 // Returns the number of bytes available to read from the current stream
114 virtual int64 Available();
|
| mock_file_stream.h | 35 virtual int64 Available() OVERRIDE;
|
| /external/chromium_org/v8/src/extensions/ |
| statistics-extension.cc | 124 AddNumber(args.GetIsolate(), result, heap->new_space()->Available(),
130 AddNumber(args.GetIsolate(), result, heap->old_pointer_space()->Available(),
137 AddNumber(args.GetIsolate(), result, heap->old_data_space()->Available(),
144 AddNumber(args.GetIsolate(), result, heap->code_space()->Available(),
150 AddNumber(args.GetIsolate(), result, heap->cell_space()->Available(),
156 AddNumber(args.GetIsolate(), result, heap->property_cell_space()->Available(),
163 AddNumber(args.GetIsolate(), result, heap->lo_space()->Available(),
|
| /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...] |
| /external/chromium_org/third_party/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/llvm/lib/Target/Hexagon/ |
| HexagonMachineScheduler.cpp | 82 /// Keep track of available resources.
291 Available.push(SU);
316 DEBUG(dbgs() << "*** " << Available.getName() << " cycle "
349 /// Release pending ready nodes in to the available queue. This makes them
352 // If the available queue is empty, it is safe to reset MinReadyCycle.
353 if (Available.empty())
357 // so, add them to the available queue.
371 Available.push(SU);
380 if (Available.isInQueue(SU))
381 Available.remove(Available.find(SU))
[all...] |
| HexagonMachineScheduler.h | 137 ReadyQueue Available;
147 /// MinReadyCycle - Cycle of the soonest available instruction.
156 DAG(0), SchedModel(0), 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/chromium_org/third_party/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/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/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/R600/ |
| R600MachineScheduler.cpp | 66 (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);
444 // If there is a T_XYZW alu available, use i
[all...] |
