Searched refs:list_end (Results 1 – 2 of 2) sorted by relevance
27 void SearchPathList::AddPaths(const char* list, const char* list_end) { in AddPaths() argument31 list_.Append(list, list_end - list); in AddPaths()
64 static const heap_node *list_end = (heap_node *) ( &heap [ HEAP_SIZE ] ); // one past the end of …75 freelist->next_node = offset_from_node ( list_end );96 p && p != list_end; prev = p, p = node_from_offset ( p->next_node)) {134 p && p != list_end; prev = p, p = node_from_offset (p->next_node)) {179 p && p != list_end; prev = p, p = node_from_offset (p->next_node)) {