Lines Matching refs:node
704 ret = do_write(ff, &n->node, sizeof(u32));
1060 struct bpf_prog_info_node *node;
1063 node = rb_entry(next, struct bpf_prog_info_node, rb_node);
1064 next = rb_next(&node->rb_node);
1066 node->info_linear->data_len;
1069 bpil_addr_to_offs(node->info_linear);
1070 ret = do_write(ff, node->info_linear, len);
1075 bpil_offs_to_addr(node->info_linear);
1103 struct btf_node *node;
1105 node = rb_entry(next, struct btf_node, rb_node);
1106 next = rb_next(&node->rb_node);
1107 ret = do_write(ff, &node->id,
1108 sizeof(u32) * 2 + node->data_size);
1354 "%s/devices/system/node/node%lu",
1375 n->node = idx;
1401 return na->node - nb->node;
1413 scnprintf(path, PATH_MAX, "%s/devices/system/node/",
1431 r = sscanf(ent->d_name, "node%u", &idx);
1465 * node in system. The format of data is as follows:
1471 * For each node we store map of physical indexes for
1472 * each node:
1474 * 32 - node id | node index
1476 * 48 - bitmap | bitmap of memory indexes that belongs to node
1514 _W(node)
1847 struct bpf_prog_info_node *node;
1849 node = rb_entry(next, struct bpf_prog_info_node, rb_node);
1850 next = rb_next(&node->rb_node);
1852 __bpf_event__print_bpf_prog_info(&node->info_linear->info,
1871 struct btf_node *node;
1873 node = rb_entry(next, struct btf_node, rb_node);
1874 next = rb_next(&node->rb_node);
1875 fprintf(fp, "# btf info of id %u\n", node->id);
2069 fprintf(fp, "# node%u meminfo : total = %"PRIu64" kB,"
2071 n->node, n->mem_total, n->mem_free);
2073 fprintf(fp, "# node%u cpu list : ", n->node);
2242 fprintf(fp, "# %3" PRIu64 " [%s]: %s\n", n->node, buf_size, buf_map);
2726 /* node number */
2727 if (do_read_u32(ff, &n->node))
3002 _R(node)
3195 struct btf_node *node = NULL;
3217 node = malloc(sizeof(struct btf_node) + data_size);
3218 if (!node)
3221 node->id = id;
3222 node->data_size = data_size;
3224 if (__do_read(ff, node->data, data_size))
3227 __perf_env__insert_btf(env, node);
3228 node = NULL;
3234 free(node);