Home
last modified time | relevance | path

Searched refs:cursor_node (Results 1 – 3 of 3) sorted by relevance

/Linux-v4.19/tools/perf/util/
Dcallchain.c561 struct callchain_cursor_node *cursor_node; in fill_node() local
567 cursor_node = callchain_cursor_current(cursor); in fill_node()
569 while (cursor_node) { in fill_node()
577 call->ip = cursor_node->ip; in fill_node()
578 call->ms.sym = cursor_node->sym; in fill_node()
579 call->ms.map = map__get(cursor_node->map); in fill_node()
580 call->srcline = cursor_node->srcline; in fill_node()
582 if (cursor_node->branch) { in fill_node()
585 if (cursor_node->branch_from) { in fill_node()
592 if (cursor_node->branch_flags.predicted) in fill_node()
[all …]
/Linux-v4.19/drivers/md/persistent-data/
Ddm-btree.h189 struct cursor_node { struct
200 struct cursor_node nodes[DM_BTREE_CURSOR_MAX_DEPTH]; argument
Ddm-btree.c998 struct cursor_node *n = c->nodes + c->depth - 1; in prefetch_values()
1013 struct cursor_node *n = c->nodes + c->depth - 1; in leaf_node()
1022 struct cursor_node *n = c->nodes + c->depth; in push_node()
1050 struct cursor_node *n; in inc_or_backtrack()
1073 struct cursor_node *n; in find_leaf()
1150 struct cursor_node *n = c->nodes + c->depth - 1; in dm_btree_cursor_get_value()