| /linux/tools/perf/util/ |
| H A D | stream.c | 70 struct callchain_node *cnode) in evsel_streams__set_hot_cnode() argument
77 es->streams[i].cnode = cnode; in evsel_streams__set_hot_cnode()
84 * way to find the cnode with smallest hit number and replace. in evsel_streams__set_hot_cnode()
86 hit = (es->streams[0].cnode)->hit; in evsel_streams__set_hot_cnode()
88 if ((es->streams[i].cnode)->hit < hit) { in evsel_streams__set_hot_cnode()
89 hit = (es->streams[i].cnode)->hit; in evsel_streams__set_hot_cnode()
94 if (cnode->hit > hit) in evsel_streams__set_hot_cnode()
95 es->streams[idx].cnode = cnode; in evsel_streams__set_hot_cnode()
103 struct callchain_node *cnode; update_hot_callchain() local
269 struct callchain_node *cnode = stream->cnode; print_stream_callchain() local
[all...] |
| H A D | callchain.c | 727 struct callchain_list *cnode) in match_chain() argument
733 match = match_chain_strings(cnode->srcline, node->srcline); in match_chain()
739 if (node->ms.sym && cnode->ms.sym) { in match_chain()
746 if (cnode->ms.sym->inlined || node->ms.sym->inlined) { in match_chain()
747 match = match_chain_strings(cnode->ms.sym->name, in match_chain()
752 match = match_chain_dso_addresses(cnode->ms.map, cnode->ms.sym->start, in match_chain()
761 match = match_chain_dso_addresses(cnode->ms.map, cnode->ip, node->ms.map, node->ip); in match_chain()
766 cnode in match_chain()
848 struct callchain_list *cnode; split_add_child() local
942 struct callchain_list *cnode; append_chain() local
1784 callchain_avg_cycles(struct callchain_node * cnode) callchain_avg_cycles() argument
[all...] |
| H A D | stream.h | 10 struct callchain_node *cnode; member
|
| H A D | machine.c | 2440 struct callchain_cursor_node *cnode; in lbr_callchain_add_stitched_lbr_ip() local
2445 cnode = &stitch_node->cursor; in lbr_callchain_add_stitched_lbr_ip()
2447 err = callchain_cursor_append(cursor, cnode->ip, in lbr_callchain_add_stitched_lbr_ip()
2448 &cnode->ms, in lbr_callchain_add_stitched_lbr_ip()
2449 cnode->branch, in lbr_callchain_add_stitched_lbr_ip()
2450 &cnode->branch_flags, in lbr_callchain_add_stitched_lbr_ip()
2451 cnode->nr_loop_iter, in lbr_callchain_add_stitched_lbr_ip()
2452 cnode->iter_cycles, in lbr_callchain_add_stitched_lbr_ip()
2453 cnode->branch_from, in lbr_callchain_add_stitched_lbr_ip()
2454 cnode in lbr_callchain_add_stitched_lbr_ip()
[all...] |
| H A D | callchain.h | 312 s64 callchain_avg_cycles(struct callchain_node *cnode);
|
| /linux/tools/bootconfig/ |
| H A D | main.c | 44 struct xbc_node *node, *cnode = NULL, *vnode; in xbc_show_compact_tree() local
51 if (!cnode) in xbc_show_compact_tree()
52 cnode = xbc_node_get_child(node); in xbc_show_compact_tree()
53 while (cnode && xbc_node_is_key(cnode) && !cnode->next) { in xbc_show_compact_tree()
54 vnode = xbc_node_get_child(cnode); in xbc_show_compact_tree()
56 * If @cnode has value and subkeys, this in xbc_show_compact_tree()
60 * key(@cnode) = value; in xbc_show_compact_tree()
61 * key(@cnode) { in xbc_show_compact_tree()
[all...] |
| /linux/arch/sparc/prom/ |
| H A D | tree_32.c | 27 phandle cnode; in __prom_getchild() local
30 cnode = prom_nodeops->no_child(node); in __prom_getchild()
34 return cnode; in __prom_getchild()
42 phandle cnode; in prom_getchild() local
47 cnode = __prom_getchild(node); in prom_getchild()
48 if (cnode == 0 || (s32)cnode == -1) in prom_getchild()
51 return cnode; in prom_getchild()
59 phandle cnode; in __prom_getsibling() local
62 cnode in __prom_getsibling()
[all...] |
| /linux/fs/ubifs/ |
| H A D | lpt_commit.c | 24 * first_dirty_cnode - find first dirty cnode.
28 * This function returns the first dirty cnode or %NULL if there is not one.
37 struct ubifs_cnode *cnode; in first_dirty_cnode() local
39 cnode = nnode->nbranch[i].cnode; in first_dirty_cnode()
40 if (cnode && in first_dirty_cnode()
41 test_bit(DIRTY_CNODE, &cnode->flags)) { in first_dirty_cnode()
42 if (cnode->level == 0) in first_dirty_cnode()
43 return cnode; in first_dirty_cnode()
44 nnode = (struct ubifs_nnode *)cnode; in first_dirty_cnode()
61 next_dirty_cnode(const struct ubifs_info * c,struct ubifs_cnode * cnode) next_dirty_cnode() argument
90 struct ubifs_cnode *cnode, *cnext; get_cnodes_to_commit() local
185 struct ubifs_cnode *cnode; layout_cnodes() local
363 struct ubifs_cnode *cnode; write_cnodes() local
1258 struct ubifs_cnode *cnode, *cnext; free_obsolete_cnodes() local
[all...] |
| H A D | debug.h | 286 int dbg_check_lpt_nodes(struct ubifs_info *c, struct ubifs_cnode *cnode,
|
| H A D | ubifs.h | 218 * LPT cnode flag bits.
220 * DIRTY_CNODE: cnode is dirty
221 * OBSOLETE_CNODE: cnode is being committed and has been copied (or deleted),
223 * COW_CNODE: cnode is being committed and must be copied before writing
542 * @cnext: next cnode to commit
560 * @cnext: next cnode to commit
583 * @cnode: cnode child
591 struct ubifs_cnode *cnode; member
598 * @cnext: next cnode t
[all...] |
| /linux/tools/perf/scripts/python/ |
| H A D | compaction-times.py | 69 class cnode: class
110 val = cnode(0);
162 self.val = cnode(0)
173 self.pending = cnode(ns(secs, nsecs))
|
| /linux/tools/perf/ui/stdio/ |
| H A D | hist.c | 212 struct callchain_node *cnode; in need_percent_display() local
217 cnode = rb_entry(node, struct callchain_node, rb_node); in need_percent_display()
218 return callchain_cumul_hits(cnode) != parent_samples; in need_percent_display()
225 struct callchain_node *cnode; in callchain__fprintf_graph() local
236 cnode = rb_entry(node, struct callchain_node, rb_node); in callchain__fprintf_graph()
237 list_for_each_entry(chain, &cnode->val, list) { in callchain__fprintf_graph()
270 root = &cnode->rb_root; in callchain__fprintf_graph()
|
| /linux/Documentation/ABI/testing/ |
| H A D | sysfs-firmware-sgi_uv | 61 cnode
68 The cnode entry contains the cnode number of the corresponding hub.
69 If a cnode value is not applicable, the value returned will be -1.
|
| /linux/fs/coda/ |
| H A D | Makefile | 8 coda-objs := psdev.o cache.o cnode.o inode.o dir.o file.o upcall.o \
|
| /linux/tools/perf/tests/ |
| H A D | hists_cumulate.c | 198 struct callchain_node *cnode; in do_test() local
238 cnode = rb_entry(rb_first(root), struct callchain_node, rb_node); in do_test()
241 list_for_each_entry(clist, &cnode->val, list) { in do_test()
|
| /linux/arch/sparc/include/asm/ |
| H A D | openprom.h | 267 int cnode; member
|
| /linux/Documentation/filesystems/ |
| H A D | coda.rst | 778 ViceFid sourceFid; /* cnode to link *to* */
1417 2. the cnode of the directory containing the object
1421 4. the cnode of the object
1423 The lookup call in the Coda FS Driver may request the cnode of the
1425 CodaCred's of the caller. The cache will return the cnode or indicate
|
| /linux/fs/nilfs2/ |
| H A D | btree.c | 2137 struct nilfs_btree_node *node, *cnode; in nilfs_btree_add_dirty_buffer() local
2158 cnode = (struct nilfs_btree_node *)cbh->b_data; in nilfs_btree_add_dirty_buffer()
2159 ckey = nilfs_btree_node_get_key(cnode, 0); in nilfs_btree_add_dirty_buffer()
|
| /linux/tools/power/pm-graph/ |
| H A D | sleepgraph.py | 2084 cnode = self.masterTopology(cname, clist, depth+1)
2085 node.children.append(cnode)
2106 for cnode in node.children:
2107 html += self.printTopology(cnode)
|