273   struct list_node * ancestor;  member
291   struct list_node * ancestor;  member
755 ne_is_ancestor_element(uint64_t id, struct list_node * ancestor)  in ne_is_ancestor_element()  argument
759   for (; ancestor; ancestor = ancestor->previous)  in ne_is_ancestor_element()
760     for (element = ancestor->node; element->id; ++element)  in ne_is_ancestor_element()
780 ne_ctx_push(nestegg * ctx, struct ebml_element_desc * ancestor, void * data)  in ne_ctx_push()  argument
785   item->previous = ctx->ancestor;  in ne_ctx_push()
786   item->node = ancestor;  in ne_ctx_push()
788   ctx->ancestor = item;  in ne_ctx_push()
796   item = ctx->ancestor;  in ne_ctx_pop()
797   ctx->ancestor = item->previous;  in ne_ctx_pop()
807   s->ancestor = ctx->ancestor;  in ne_ctx_save()
821   ctx->ancestor = s->ancestor;  in ne_ctx_restore()
882   list = (struct ebml_list *) (ctx->ancestor->data + desc->offset);  in ne_read_master()
908            ctx->ancestor->data + desc->offset, desc->offset);  in ne_read_single_master()
910   ne_ctx_push(ctx, desc->children, ctx->ancestor->data + desc->offset);  in ne_read_single_master()
919   storage = (struct ebml_type *) (ctx->ancestor->data + desc->offset);  in ne_read_simple()
979   if (!ctx->ancestor)  in ne_parse()
987     element = ne_find_element(id, ctx->ancestor->node);  in ne_parse()
1001         data_offset = (int64_t *) (ctx->ancestor->data + element->data_offset);  in ne_parse()
1020     } else if (ne_is_ancestor_element(id, ctx->ancestor->previous)) {  in ne_parse()
1022       if (top_level && ctx->ancestor->node == top_level) {  in ne_parse()
1042     while (ctx->ancestor)  in ne_parse()
1496   while (ctx->ancestor)  in nestegg_destroy()
1572     ctx->ancestor = NULL;  in nestegg_track_seek()
1579     while (ctx->ancestor)  in nestegg_track_seek()
1618   while (ctx->ancestor)  in nestegg_track_seek()