Home
last modified time | relevance | path

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

/linux/tools/perf/util/
H A Dcallchain.c585 struct callchain_cursor_node *cursor_node; in fill_node() local
591 cursor_node = callchain_cursor_current(cursor); in fill_node()
593 while (cursor_node) { in fill_node()
601 call->ip = cursor_node->ip; in fill_node()
602 map_symbol__copy(&call->ms, &cursor_node->ms); in fill_node()
603 call->srcline = cursor_node->srcline; in fill_node()
605 if (cursor_node->branch) { in fill_node()
608 if (cursor_node->branch_from) { in fill_node()
623 if (cursor_node->branch_flags.predicted) in fill_node()
626 if (cursor_node->branch_flags.abort) in fill_node()
[all …]
/linux/drivers/md/persistent-data/
H A Ddm-btree.h190 struct cursor_node { struct
201 struct cursor_node nodes[DM_BTREE_CURSOR_MAX_DEPTH]; argument
H A Ddm-btree.c1471 struct cursor_node *n = c->nodes + c->depth - 1; in prefetch_values()
1486 struct cursor_node *n = c->nodes + c->depth - 1; in leaf_node()
1495 struct cursor_node *n = c->nodes + c->depth; in push_node()
1523 struct cursor_node *n; in inc_or_backtrack()
1546 struct cursor_node *n; in find_leaf()
1624 struct cursor_node *n = c->nodes + c->depth - 1; in dm_btree_cursor_get_value()
/linux/tools/perf/python/
H A Dilist.py300 if not cursor_seen and node == tree.cursor_node:
336 node = tree.cursor_node