Lines Matching refs:Available
153 int Heap::Available() {
156 return new_space_.Available() +
157 old_pointer_space_->Available() +
158 old_data_space_->Available() +
159 code_space_->Available() +
160 map_space_->Available() +
161 cell_space_->Available();
197 // Note that MemoryAllocator->MaxAvailable() undercounts the memory available
200 // and does not count available bytes already in the old space or code
247 PrintF("Memory allocator, used: %8d, available: %8d\n",
249 MemoryAllocator::Available());
250 PrintF("New space, used: %8d, available: %8d\n",
252 new_space_.Available());
253 PrintF("Old pointers, used: %8d, available: %8d, waste: %8d\n",
255 old_pointer_space_->Available(),
257 PrintF("Old data space, used: %8d, available: %8d, waste: %8d\n",
259 old_data_space_->Available(),
261 PrintF("Code space, used: %8d, available: %8d, waste: %8d\n",
263 code_space_->Available(),
265 PrintF("Map space, used: %8d, available: %8d, waste: %8d\n",
267 map_space_->Available(),
269 PrintF("Cell space, used: %8d, available: %8d, waste: %8d\n",
271 cell_space_->Available(),
275 lo_space_->Available());
432 return new_space_.Available() >= requested_size;
434 return old_pointer_space_->Available() >= requested_size;
436 return old_data_space_->Available() >= requested_size;
438 return code_space_->Available() >= requested_size;
440 return map_space_->Available() >= requested_size;
442 return cell_space_->Available() >= requested_size;
444 return lo_space_->Available() >= requested_size;
3605 LOG(IntEvent("heap-available", Available()));
