>  WKS::gc_heap::a_fit_free_list_p  C++
   WKS::gc_heap::soh_try_fit  C++
   WKS::gc_heap::allocate_soh  C++
   WKS::gc_heap::try_allocate_more_space  C++
   WKS::gc_heap::allocate_more_space  C++
   WKS::gc_heap::allocate  C++
   WKS::GCHeap::Alloc  C++
   Alloc  C++
   AllocateObject  C++
   JIT_New  C++
//此處省略一萬行
   RtlUserThreadStart()  未知

BOOL gc_heap::a_fit_free_list_p (int gen_number,
                                 size_t size,
                                 alloc_context* acontext,
                                 uint32_t flags,
                                 int align_const)
{
    BOOL can_fit = FALSE;
    //獲取當(dāng)前收集代地址
    generation* gen = generation_of (gen_number);
    //獲取當(dāng)前收集代 空閑列表一直
    allocator* gen_allocator = generation_allocator (gen);
    //遍歷冫空閑列表里面的bucket，找到何時(shí)的空間存儲(chǔ)對(duì)象
    for (unsigned int a_l_idx = gen_allocator->first_suitable_bucket(size); a_l_idx < gen_allocator->number_of_buckets(); a_l_idx++)
    {
        //索引的空閑列表的頭部指針
        uint8_t* free_list = gen_allocator->alloc_list_head_of (a_l_idx);
        uint8_t* prev_free_item = 0;
        //如果獲取到的空閑列表空間不為0
        while (free_list != 0)
        {
            //獲取當(dāng)前索引空閑了free_list里面bucket的長度
            size_t free_list_size = unused_array_size (free_list);
           //如果需要分配對(duì)象長度小于free_lis里面獲取的長度，那么表示對(duì)象可以放入空閑列表
            if ((size + Align (min_obj_size, align_const)) <= free_list_size)
            {
                //unlink，斷開鏈接。意思是從空閑列表里面把空間拿出來，因?yàn)樗僮鞯氖擎湵怼?                // 把獲取到的free_lsit的bucket長度從free_lsit鏈表里面拿掉，也就是個(gè)鏈表操作
                gen_allocator->unlink_item (a_l_idx, free_list, prev_free_item, FALSE);
                //計(jì)算出對(duì)象需要的空間也就是參數(shù)size,最終需要分配的長度
                size_t limit = limit_from_size (size, flags, free_list_size, gen_number, align_const);
                //收集代靜態(tài)數(shù)據(jù)new_allocation減去對(duì)象最終分配空間大小
                dd_new_allocation (dynamic_data_of (gen_number)) -= limit;
                //空閑列表頭部指針+對(duì)象占用空間大小，指向的是剩余的空間地址
                uint8_t*  remain = (free_list + limit);
                // 當(dāng)前代的空閑列表大小減去分配對(duì)象的大小，剩余值remain_size
                size_t remain_size = (free_list_size - limit);
                //如果剩余值，大于或者等于一個(gè)空閑列表的大小
                if (remain_size >= Align(min_free_list, align_const))
                {
                   //重新把它作為空閑列表，放入free_list的bucket里面去
                    make_unused_array (remain, remain_size);
                    gen_allocator->thread_item_front (remain, remain_size);
                    assert (remain_size >= Align (min_obj_size, align_const));
                }
                else  //如果剩余值小于
                {
                    //這里直接把剩余值給分配對(duì)象大小得了，也就是上面計(jì)算的分配對(duì)象大小+剩余的空間
                    limit += remain_size;
                }
                //代的空閑空間減去對(duì)象需要的空間 
                generation_free_list_space (gen) -= limit;
                assert ((ptrdiff_t)generation_free_list_space (gen) >= 0);
                //把a(bǔ)lloc_context指向計(jì)算的空間，對(duì)象就分配到alloc_context指向的地址
                adjust_limit_clr (free_list, limit, size, acontext, flags, 0, align_const, gen_number);


                can_fit = TRUE;
                goto end;
            }         
        }
    }
end:
    return can_fit;
}