Searched refs:next_insert_pos (Results 1 - 4 of 4) sorted by relevance

/barrelfish-master/lib/phoenix/
H A Dstruct.h33 int next_insert_pos; member in struct:_val_t
H A Diterator.c51 itr->next_insert_pos = 0;
64 itr->next_insert_pos = 0;
93 if (itr->next_insert_pos >= itr->max_list)
99 itr->list_array[itr->next_insert_pos] = list;
101 if (itr->next_insert_pos == 0)
105 itr->next_insert_pos += 1;
117 if (itr->current_index >= itr->val->next_insert_pos)
131 else if (itr->current_list + 1 < itr->next_insert_pos)
160 if (itr->current_list >= itr->next_insert_pos)
H A Diterator.h36 int next_insert_pos; member in struct:iterator_t
H A Dmap_reduce.c1355 val->next_insert_pos = 0;
1357 val->array[val->next_insert_pos++] = reduced_val;
1531 new_vals->next_insert_pos = 0;
1536 else if (insert_pos->vals->next_insert_pos >= insert_pos->vals->size)
1549 insert_pos->vals->next_insert_pos = 1;
1563 new_vals->next_insert_pos = 0;
1572 insert_pos->vals->array[insert_pos->vals->next_insert_pos++] = val;

Completed in 801 milliseconds