Lines Matching defs:ent
535 upb_map_entry ent;
552 memset(&ent, 0, sizeof(ent));
557 ent.v.val.val = (uint64_t)_upb_msg_new(entry->submsgs[0], d->arena);
560 decode_tosubmsg(d, &ent.k, layout, field, val.str_val);
563 _upb_map_set(map, &ent.k, map->key_size, &ent.v, map->val_size, d->arena);
1535 /* Existing ent is in its main posisiton (it has the same hash as us, and
1536 * is the head of our chain). Insert to new ent and append to this chain. */
1541 /* Existing ent is not in its main position (it is a node in some other
1542 * chain). This implies that no existing ent in the table has our hash.
1543 * Evict it (updating its chain) and use its ent for head of our chain. */
2446 cleanup_ent *ent = a->cleanup_head;
2449 while (ent) {
2450 ent->cleanup(ent->ud);
2451 ent = ent->next;
2469 cleanup_ent *ent = upb_malloc(&a->head.alloc, sizeof(cleanup_ent));
2470 if (!ent) {
2474 ent->cleanup = func;
2475 ent->ud = ud;
2476 ent->next = a->cleanup_head;
2477 a->cleanup_head = ent;
3875 upb_map_entry ent;
3876 UPB_ASSERT(sizeof(ent.k) == sizeof(ent.v));
3877 return sizeof(ent.k);