| /linux-master/tools/perf/util/ |
| H A D | stream.c | 71 struct callchain_node *cnode)
78 es->streams[i].cnode = cnode;
85 * way to find the cnode with smallest hit number and replace.
87 hit = (es->streams[0].cnode)->hit;
89 if ((es->streams[i].cnode)->hit < hit) {
90 hit = (es->streams[i].cnode)->hit;
95 if (cnode->hit > hit)
96 es->streams[idx].cnode = cnode;
70 evsel_streams__set_hot_cnode(struct evsel_streams *es, struct callchain_node *cnode) argument
104 struct callchain_node *cnode; local
270 struct callchain_node *cnode = stream->cnode; local
[all...] |
| H A D | stream.h | 8 struct callchain_node *cnode; member in struct:stream
|
| H A D | callchain.c | 729 struct callchain_list *cnode)
735 match = match_chain_strings(cnode->srcline, node->srcline);
741 if (node->ms.sym && cnode->ms.sym) {
748 if (cnode->ms.sym->inlined || node->ms.sym->inlined) {
749 match = match_chain_strings(cnode->ms.sym->name,
754 match = match_chain_dso_addresses(cnode->ms.map, cnode->ms.sym->start,
763 match = match_chain_dso_addresses(cnode->ms.map, cnode->ip, node->ms.map, node->ip);
768 cnode
728 match_chain(struct callchain_cursor_node *node, struct callchain_list *cnode) argument
850 struct callchain_list *cnode; local
944 struct callchain_list *cnode; local
1788 callchain_avg_cycles(struct callchain_node *cnode) argument
[all...] |
| H A D | callchain.h | 312 s64 callchain_avg_cycles(struct callchain_node *cnode);
|
| H A D | machine.c | 2473 struct callchain_cursor_node *cnode; local
2478 cnode = &stitch_node->cursor;
2480 err = callchain_cursor_append(cursor, cnode->ip,
2481 &cnode->ms,
2482 cnode->branch,
2483 &cnode->branch_flags,
2484 cnode->nr_loop_iter,
2485 cnode->iter_cycles,
2486 cnode->branch_from,
2487 cnode
[all...] |
| /linux-master/fs/coda/ |
| H A D | Makefile | 8 coda-objs := psdev.o cache.o cnode.o inode.o dir.o file.o upcall.o \
|
| /linux-master/arch/sparc/prom/ |
| H A D | tree_32.c | 27 phandle cnode; local
30 cnode = prom_nodeops->no_child(node);
34 return cnode;
42 phandle cnode; local
47 cnode = __prom_getchild(node);
48 if (cnode == 0 || (s32)cnode == -1)
51 return cnode;
59 phandle cnode; local
62 cnode
[all...] |
| H A D | tree_64.c | 45 phandle cnode; local
49 cnode = __prom_getchild(node);
50 if ((s32)cnode == -1)
52 return cnode;
58 phandle cnode; local
62 cnode = prom_node_to_node("parent", node);
63 if ((s32)cnode == -1)
65 return cnode;
|
| /linux-master/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; local
39 cnode = nnode->nbranch[i].cnode;
40 if (cnode &&
41 test_bit(DIRTY_CNODE, &cnode->flags)) {
42 if (cnode->level == 0)
43 return cnode;
44 nnode = (struct ubifs_nnode *)cnode;
61 next_dirty_cnode(const struct ubifs_info *c, struct ubifs_cnode *cnode) argument
90 struct ubifs_cnode *cnode, *cnext; local
185 struct ubifs_cnode *cnode; local
363 struct ubifs_cnode *cnode; local
1258 struct ubifs_cnode *cnode, *cnext; local
[all...] |
| H A D | lpt.c | 1539 if (branch->cnode)
1540 branch->cnode->parent = n;
1656 struct ubifs_cnode *cnode; local
1682 cnode = (struct ubifs_cnode *)c->nroot;
1684 while (cnode) {
1685 nnode = cnode->parent;
1686 nn = (struct ubifs_nnode *)cnode;
1687 if (cnode->level > 1) {
1703 cnode = (struct ubifs_cnode *)nnode;
1728 iip = cnode
1930 struct ubifs_cnode cnode; member in union:lpt_scan_node::__anon2468
1936 struct ubifs_cnode *cnode; member in union:lpt_scan_node::__anon2469
2380 dbg_check_lpt_nodes(struct ubifs_info *c, struct ubifs_cnode *cnode, int row, int col) argument
[all...] |
| H A D | debug.h | 285 int dbg_check_lpt_nodes(struct ubifs_info *c, struct ubifs_cnode *cnode,
|
| H A D | ubifs.h | 232 * LPT cnode flag bits.
234 * DIRTY_CNODE: cnode is dirty
235 * OBSOLETE_CNODE: cnode is being committed and has been copied (or deleted),
237 * COW_CNODE: cnode is being committed and must be copied before writing
554 * @cnext: next cnode to commit
572 * @cnext: next cnode to commit
595 * @cnode: cnode child
603 struct ubifs_cnode *cnode; member in union:ubifs_nbranch::__anon348
610 * @cnext: next cnode t
[all...] |
| /linux-master/drivers/platform/x86/ |
| H A D | uv_sysfs.c | 61 static union geoid_u cnode_to_geoid(int cnode) argument
65 uv_bios_get_geoinfo(ordinal_to_nasid(cnode), (u64)sizeof(union geoid_u), (u64 *)&geoid);
84 int cnode; local
95 for (cnode = 0; cnode < num_cnodes; cnode++) {
96 geoid = cnode_to_geoid(cnode);
101 prev_obj_to_cnode[obj->id] = cnode;
141 int cnode = get_obj_to_cnode(hub_info->id); local
143 return sprintf(buf, "%d\n", ordinal_to_nasid(cnode));
[all...] |
| /linux-master/tools/perf/scripts/python/ |
| H A D | compaction-times.py | 69 class cnode: class in inherits:
110 val = cnode(0);
162 self.val = cnode(0)
173 self.pending = cnode(ns(secs, nsecs))
|
| /linux-master/tools/perf/ui/stdio/ |
| H A D | hist.c | 208 struct callchain_node *cnode; local
213 cnode = rb_entry(node, struct callchain_node, rb_node);
214 return callchain_cumul_hits(cnode) != parent_samples;
221 struct callchain_node *cnode; local
232 cnode = rb_entry(node, struct callchain_node, rb_node);
233 list_for_each_entry(chain, &cnode->val, list) {
266 root = &cnode->rb_root;
|
| /linux-master/tools/perf/tests/ |
| H A D | hists_cumulate.c | 198 struct callchain_node *cnode; local
238 cnode = rb_entry(rb_first(root), struct callchain_node, rb_node);
241 list_for_each_entry(clist, &cnode->val, list) {
|
| /linux-master/arch/sparc/include/asm/ |
| H A D | openprom.h | 267 int cnode; member in struct:linux_prom_pci_intmap
|
| /linux-master/fs/nilfs2/ |
| H A D | btree.c | 2123 struct nilfs_btree_node *node, *cnode; local
2144 cnode = (struct nilfs_btree_node *)cbh->b_data;
2145 ckey = nilfs_btree_node_get_key(cnode, 0);
|
| /linux-master/tools/power/pm-graph/ |
| H A D | sleepgraph.py | 2061 cnode = self.masterTopology(cname, clist, depth+1)
2062 node.children.append(cnode)
2083 for cnode in node.children:
2084 html += self.printTopology(cnode)
|