Searched refs:best (Results 1 – 16 of 16) sorted by relevance
117 struct HeapNode *node, *best = NULL; in heapAlloc() local130 if (!node->used && node->size >= sz && (!best || best->size > node->size)) { in heapAlloc()131 best = node; in heapAlloc()132 if (best->size == sz) in heapAlloc()139 if (!best) //alloc failed in heapAlloc()142 if (best->size - sz > sizeof(struct HeapNode)) { //there is a point to split up the chunk in heapAlloc()144 node = (struct HeapNode*)(best->data + sz); in heapAlloc()148 node->size = best->size - sz - sizeof(struct HeapNode); in heapAlloc()149 node->prev = best; in heapAlloc()151 if (best != gHeapTail) in heapAlloc()[all …]
211 as to best accomplish the objectives of such unenforceable or
226 as to best accomplish the objectives of such unenforceable or
250 as to best accomplish the objectives of such unenforceable or