Lines Matching defs:next
1491 if ((e = e->next) == NULL) return NULL;
1528 our_e->next = NULL;
1537 new_e->next = mainpos_e->next;
1538 mainpos_e->next = new_e;
1544 *new_e = *mainpos_e; /* copies next. */
1545 while (chain->next != mainpos_e) {
1546 chain = (upb_tabent*)chain->next;
1549 chain->next = new_e;
1551 our_e->next = NULL;
1568 if (chain->next) {
1569 upb_tabent *move = (upb_tabent*)chain->next;
1579 while (chain->next && !eql(chain->next->key, key)) {
1580 chain = (upb_tabent*)chain->next;
1582 if (chain->next) {
1584 upb_tabent *rm = (upb_tabent*)chain->next;
1586 if (val) _upb_value_setval(val, chain->next->val.val);
1589 chain->next = rm->next;
1598 static size_t next(const upb_table *t, size_t i) {
1608 return next(t, -1);
1724 i->index = next(&i->t->t, i->index);
1859 for (i = begin(&t->t); i < upb_table_size(&t->t); i = next(&t->t, i)) {
2027 iter->index = next(&t->t, iter->index);
2329 struct mem_block *next;
2335 struct cleanup_ent *next;
2348 block->next = a->block_head;
2451 ent = ent->next;
2458 mem_block *next = block->next;
2464 block = next;
2476 ent->next = a->cleanup_head;
6196 * the value returned now is actually a "next" pointer into a linked list of all
6208 /* Backward local label. Relative to the next instruction. */
7255 /* Copies the next "bytes" bytes into "buf" and advances the stream.
7264 /* Slow path for getting the next "bytes" bytes, regardless of whether they are
7287 /* Gets the next "bytes" bytes, regardless of whether they are available in the
8068 * the next enclosing message. */
8199 /* We are already buffering, advance to the next segment and push it on the
9138 * expecting next. */
9583 * must be valid until the next accumulate_append() call (if any). */
9731 * that capturing should resume at the beginning of the next buffer.
9821 * we have to wait for the next escape to get the full code point). */
10866 * value parser (invoked next) will emit the mapentry's value field and then