Searched refs:list_end (Results 1 – 4 of 4) 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 …]
70 static const heap_node* list_end = variable86 freelist->next_node = offset_from_node(list_end); in init_heap()108 for (p = freelist, prev = 0; p && p != list_end; in fallback_malloc()147 for (p = freelist, prev = 0; p && p != list_end; in fallback_free()192 for (p = freelist, prev = 0; p && p != list_end; in print_free_list()
530 const __be32 *list, *list_end; in __of_parse_phandle_with_args() local541 list_end = list + size / sizeof(*list); in __of_parse_phandle_with_args()544 while (list < list_end) { in __of_parse_phandle_with_args()587 if (list + count > list_end) { in __of_parse_phandle_with_args()
727 const __be32 *list, *list_end; in fdtdec_parse_phandle_with_args() local737 list_end = list + size / sizeof(*list); in fdtdec_parse_phandle_with_args()740 while (list < list_end) { in fdtdec_parse_phandle_with_args()790 if (list + count > list_end) { in fdtdec_parse_phandle_with_args()