Searched refs:MAX_ORDER (Results 1 – 2 of 2) sorted by relevance
54 return 1 << (MAX_ORDER - 1); in GetNumMaxPages()90 for( int i = 0; i < MAX_ORDER; ++i ) in Initialize()96 m_FreeArea[MAX_ORDER - 1].PushBack(&(m_pPages[i * numMaxPages])); in Initialize()181 static const s32 MAX_ORDER = MaxOrder; variable291 PageList m_FreeArea[MAX_ORDER];298 for(int i = order; i < MAX_ORDER; i++) in GetFreePage()330 while(order < MAX_ORDER - 1) in JointBuddies()402 for(int order = 0; order <= MAX_ORDER; order++) in GetNearestHigherOrder()409 NN_LOG_WARN("No nearest higher order: numPages=%d, MAX_ORDER=%d", numPages, MAX_ORDER); in GetNearestHigherOrder()415 for(int order = 0; order <= MAX_ORDER; order++) in GetNearestLowerOrder()[all …]
56 return 1 << (MAX_ORDER - 1); in GetNumMaxPages()101 for (size_t i = 0; i < MAX_ORDER; ++i ) in Initialize()108 m_FreeArea[MAX_ORDER - 1].PushBack(&(m_pPages[i * numMaxPages])); in Initialize()222 static const s32 MAX_ORDER = MaxOrder; variable377 PageList m_FreeArea[MAX_ORDER];393 for(s32 i = order; i < MAX_ORDER; i++) in GetFreePage()450 while(order < MAX_ORDER - 1) in JointBuddies()560 for(int order = 0; order <= MAX_ORDER; order++) in GetNearestHigherOrder()567 NN_LOG_WARN("No nearest higher order: numPages=%d, MAX_ORDER=%d", numPages, MAX_ORDER); in GetNearestHigherOrder()573 for(int order = 0; order <= MAX_ORDER; order++) in GetNearestLowerOrder()[all …]