Searched refs:list_end (Results 1 – 2 of 2) sorted by relevance
249 struct slist *list_end, in LoadStackParamSize() argument253 while (cur_list < list_end && cur_list->n_type == N_PSYM) { in LoadStackParamSize()263 struct slist *list_end, in LoadLineInfo() argument268 while (cur_list < list_end && cur_list->n_type != N_SLINE) { in LoadLineInfo()277 while (cur_list < list_end && cur_list->n_type == N_SLINE) { in LoadLineInfo()284 if (cur_list == list_end && cur_list->n_type == N_ENDM) in LoadLineInfo()286 } while (list < list_end); in LoadLineInfo()292 struct slist *list_end, in LoadFuncSymbols() argument301 while (cur_list < list_end) { in LoadFuncSymbols()303 while (cur_list < list_end && cur_list->n_type != N_FUN) { in LoadFuncSymbols()[all …]
69 static const heap_node *list_end = (heap_node *) ( &heap [ HEAP_SIZE ] ); // one past the end of … variable80 freelist->next_node = offset_from_node ( list_end ); in init_heap()101 p && p != list_end; prev = p, p = node_from_offset ( p->next_node)) { in fallback_malloc()139 p && p != list_end; prev = p, p = node_from_offset (p->next_node)) { in fallback_free()184 p && p != list_end; prev = p, p = node_from_offset (p->next_node)) { in print_free_list()