Searched refs:next_ptr (Results 1 – 7 of 7) sorted by relevance
201 local int next_ptr = 0; variable230 if (buf == NULL || next_ptr >= MAX_PTR) return NULL; in zcalloc()231 table[next_ptr].org_ptr = buf; in zcalloc()236 table[next_ptr++].new_ptr = buf; in zcalloc()248 for (n = 0; n < next_ptr; n++) { in zcfree()252 while (++n < next_ptr) { in zcfree()255 next_ptr--; in zcfree()
205 local int next_ptr = 0; variable234 if (buf == NULL || next_ptr >= MAX_PTR) return NULL; in zcalloc()235 table[next_ptr].org_ptr = buf; in zcalloc()240 table[next_ptr++].new_ptr = buf; in zcalloc()252 for (n = 0; n < next_ptr; n++) { in zcfree()256 while (++n < next_ptr) { in zcfree()259 next_ptr--; in zcfree()
199 local int next_ptr = 0; variable230 if (buf == NULL || next_ptr >= MAX_PTR) return NULL; in zcalloc()231 table[next_ptr].org_ptr = buf; in zcalloc()236 table[next_ptr++].new_ptr = buf; in zcalloc()251 for (n = 0; n < next_ptr; n++) { in zcfree()255 while (++n < next_ptr) { in zcfree()258 next_ptr--; in zcfree()
66 list_node->next_ptr = list; in dtop_add_linked_list()81 head_ptr = head_ptr->next_ptr; in dtop_rem_linked_list()
288 curr_ptr = curr_ptr->next_ptr; in dtop_write_pollingdata_csv()410 curr_ptr = curr_ptr->next_ptr; in dtop_poll()433 curr_ptr = curr_ptr->next_ptr; in dtop_print_snapshot_diff()455 curr_ptr = curr_ptr->next_ptr; in dtop_reset_dp_initial_values()476 curr_ptr = curr_ptr->next_ptr; in deconstruct_dpgs()
51 struct dtop_linked_list *next_ptr; member
73 curr_ptr = curr_ptr->next_ptr; in dtop_print_terminal()112 curr_ptr = curr_ptr->next_ptr; in dtop_poll_periodically()