Lines Matching defs:node
690 ret = do_write(ff, &n->node, sizeof(u32));
967 struct bpf_prog_info_node *node;
970 node = rb_entry(next, struct bpf_prog_info_node, rb_node);
971 next = rb_next(&node->rb_node);
973 node->info_linear->data_len;
976 bpf_program__bpil_addr_to_offs(node->info_linear);
977 ret = do_write(ff, node->info_linear, len);
982 bpf_program__bpil_offs_to_addr(node->info_linear);
1017 struct btf_node *node;
1019 node = rb_entry(next, struct btf_node, rb_node);
1020 next = rb_next(&node->rb_node);
1021 ret = do_write(ff, &node->id,
1022 sizeof(u32) * 2 + node->data_size);
1251 "%s/devices/system/node/node%lu",
1272 n->node = idx;
1290 return na->node - nb->node;
1301 scnprintf(path, PATH_MAX, "%s/devices/system/node/",
1319 r = sscanf(ent->d_name, "node%u", &idx);
1345 * node in system. The format of data is as follows:
1351 * For each node we store map of physical indexes for
1352 * each node:
1354 * 32 - node id | node index
1356 * 48 - bitmap | bitmap of memory indexes that belongs to node
1394 _W(node)
1653 struct bpf_prog_info_node *node;
1655 node = rb_entry(next, struct bpf_prog_info_node, rb_node);
1656 next = rb_next(&node->rb_node);
1658 __bpf_event__print_bpf_prog_info(&node->info_linear->info,
1677 struct btf_node *node;
1679 node = rb_entry(next, struct btf_node, rb_node);
1680 next = rb_next(&node->rb_node);
1681 fprintf(fp, "# btf info of id %u\n", node->id);
1874 fprintf(fp, "# node%u meminfo : total = %"PRIu64" kB,"
1876 n->node, n->mem_total, n->mem_free);
1878 fprintf(fp, "# node%u cpu list : ", n->node);
2032 fprintf(fp, "# %3" PRIu64 " [%s]: %s\n", n->node, buf_size, buf_map);
2515 /* node number */
2516 if (do_read_u32(ff, &n->node))
2792 _R(node)
2951 struct btf_node *node = NULL;
2973 node = malloc(sizeof(struct btf_node) + data_size);
2974 if (!node)
2977 node->id = id;
2978 node->data_size = data_size;
2980 if (__do_read(ff, node->data, data_size))
2983 __perf_env__insert_btf(env, node);
2984 node = NULL;
2990 free(node);