2333 FreeSpace* FreeListCategory::PickNodeFromList(int* node_size) {  in AllocateChunk()  argument
2346     *node_size = node->Size();  in AllocateChunk()
2347     available_ -= *node_size;  in AllocateChunk()
2361                                               int* node_size) {  in AllocateChunk()  argument
2362   FreeSpace* node = PickNodeFromList(node_size);  in AllocateChunk()
2363   if ((node != nullptr) && (*node_size < size_in_bytes)) {  in AllocateChunk()
2364     Free(node, *node_size);  in AllocateChunk()
2365     *node_size = 0;  in AllocateChunk()
2373                                                  int* node_size) {  in AllocateChunk()  argument
2399       *node_size = size;  in AllocateChunk()
2515 FreeSpace* FreeList::FindNodeIn(FreeListCategoryType category, int* node_size) {  in AllocateChunk()  argument
2516   FreeSpace* node = GetFreeListCategory(category)->PickNodeFromList(node_size);  in AllocateChunk()
2519         ->add_available_in_free_list(category, -(*node_size));  in AllocateChunk()
2526 FreeSpace* FreeList::FindNodeFor(int size_in_bytes, int* node_size) {  in AllocateChunk()  argument
2531     node = FindNodeIn(kSmall, node_size);  in AllocateChunk()
2536     node = FindNodeIn(kMedium, node_size);  in AllocateChunk()
2541     node = FindNodeIn(kLarge, node_size);  in AllocateChunk()
2545   node = huge_list_.SearchForNodeInList(size_in_bytes, node_size);  in AllocateChunk()
2548     page->add_available_in_large_free_list(-(*node_size));  in AllocateChunk()
2554     node = small_list_.PickNodeFromList(size_in_bytes, node_size);  in AllocateChunk()
2556       DCHECK(size_in_bytes <= *node_size);  in AllocateChunk()
2558       page->add_available_in_small_free_list(-(*node_size));  in AllocateChunk()
2561     node = medium_list_.PickNodeFromList(size_in_bytes, node_size);  in AllocateChunk()
2563       DCHECK(size_in_bytes <= *node_size);  in AllocateChunk()
2565       page->add_available_in_medium_free_list(-(*node_size));  in AllocateChunk()
2568     node = large_list_.PickNodeFromList(size_in_bytes, node_size);  in AllocateChunk()
2570       DCHECK(size_in_bytes <= *node_size);  in AllocateChunk()
2572       page->add_available_in_large_free_list(-(*node_size));  in AllocateChunk()
2585   int node_size = 0;  in AllocateChunk()  local
2587   node = FindNodeFor(static_cast<int>(hint_size_in_bytes), &node_size);  in AllocateChunk()
2589   if (node == nullptr) node = FindNodeIn(kHuge, &node_size);  in AllocateChunk()
2590   if (node == nullptr) node = FindNodeIn(kLarge, &node_size);  in AllocateChunk()
2599     intptr_t left_over = node_size - hint_size_in_bytes;  in AllocateChunk()