Home
last modified time | relevance | path

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

/linux-5.19.10/tools/perf/util/
Dcallchain.c568 struct callchain_cursor_node *cursor_node; in fill_node() local
574 cursor_node = callchain_cursor_current(cursor); in fill_node()
576 while (cursor_node) { in fill_node()
584 call->ip = cursor_node->ip; in fill_node()
585 call->ms = cursor_node->ms; in fill_node()
587 call->srcline = cursor_node->srcline; in fill_node()
589 if (cursor_node->branch) { in fill_node()
592 if (cursor_node->branch_from) { in fill_node()
599 if (cursor_node->branch_flags.predicted) in fill_node()
602 if (cursor_node->branch_flags.abort) in fill_node()
[all …]
/linux-5.19.10/drivers/md/persistent-data/
Ddm-btree.h189 struct cursor_node { struct
200 struct cursor_node nodes[DM_BTREE_CURSOR_MAX_DEPTH]; argument
Ddm-btree.c1460 struct cursor_node *n = c->nodes + c->depth - 1; in prefetch_values()
1475 struct cursor_node *n = c->nodes + c->depth - 1; in leaf_node()
1484 struct cursor_node *n = c->nodes + c->depth; in push_node()
1512 struct cursor_node *n; in inc_or_backtrack()
1535 struct cursor_node *n; in find_leaf()
1612 struct cursor_node *n = c->nodes + c->depth - 1; in dm_btree_cursor_get_value()