/linux-master/kernel/sched/ |
H A D | fair.c | 1598 * between these nodes are slowed down, to allow things to settle down. 1607 /* Handle placement on systems where not all nodes are directly connected. */ 1615 * All nodes are directly connected, and the same distance 1625 * which should be ok given the number of nodes rarely exceeds 8. 1632 * The furthest away nodes in the system are not interesting 1640 * of nodes, and move tasks towards the group with the most 1641 * memory accesses. When comparing two nodes at distance 1642 * "hoplimit", only nodes closer by than "hoplimit" are part 1643 * of each group. Skip other nodes. 1648 /* Add up the faults from nearby nodes 2724 nodemask_t nodes; local [all...] |
/linux-master/tools/testing/selftests/mm/ |
H A D | run_vmtests.sh | 55 ksm tests that do not require >=2 NUMA nodes 57 ksm tests that require >=2 NUMA nodes 380 # KSM test with 2 NUMA nodes and merge_across_nodes = 1 382 # KSM test with 2 NUMA nodes and merge_across_nodes = 0
|
/linux-master/mm/ |
H A D | hugetlb.c | 1420 /* Fallback to all nodes if page==NULL */ 2358 * persistent huge pages more or less balanced over allowed nodes. 2373 * nodes with surplus pages. 2596 /* Fallback to all nodes if page==NULL */ 2743 * evenly across all nodes with memory. Iterate across these nodes 2745 * when the nodes with surplus pages have no free pages. 2747 * on-line nodes with memory and will handle the hstate accounting. 4511 * devices of nodes that have memory. All on-line nodes shoul [all...] |
/linux-master/fs/ntfs3/ |
H A D | ntfs_fs.h | 410 struct indx_node *nodes[20]; member in struct:ntfs_fnd
|
/linux-master/drivers/net/ethernet/wangxun/txgbe/ |
H A D | txgbe_phy.c | 25 struct txgbe_nodes *nodes = &txgbe->nodes; local 32 snprintf(nodes->gpio_name, sizeof(nodes->gpio_name), "txgbe_gpio-%x", id); 33 snprintf(nodes->i2c_name, sizeof(nodes->i2c_name), "txgbe_i2c-%x", id); 34 snprintf(nodes->sfp_name, sizeof(nodes->sfp_name), "txgbe_sfp-%x", id); 35 snprintf(nodes->phylink_name, sizeof(nodes [all...] |
/linux-master/drivers/gpu/drm/amd/amdkfd/ |
H A D | kfd_svm.c | 1995 if (adev->kfd.dev->nodes[i]->xcp) 1996 id = adev->kfd.dev->nodes[i]->xcp->id; 4006 * regardless of the various gpu nodes. Of the remaining attributes,
|
H A D | kfd_device.c | 606 knode = kfd->nodes[i]; 613 kfd->nodes[i] = NULL; 674 "KFD num nodes cannot be 0, num_xcc_in_node: %d\n", 783 dev_info(kfd_device, "Total number of KFD nodes to be created: %d\n", 786 /* Allocate the KFD nodes */ 850 kfd->nodes[i] = node; 885 /* Cleanup KFD nodes */ 906 node = kfd->nodes[i]; 914 kfd_signal_reset_event(kfd->nodes[i]); 935 ret = kfd_resume(kfd->nodes[ [all...] |
H A D | kfd_chardev.c | 770 /* Return number of nodes, so that user space can alloacate 779 * nodes, but not more than args->num_of_nodes as that is 1546 args->gpu_id = dmabuf_adev->kfd.dev->nodes[xcp_id]->id; 2248 /* create the vm using render nodes for kfd pdd */
|
H A D | kfd_priv.h | 361 struct kfd_node *nodes[MAX_KFD_NODES]; member in struct:kfd_dev 1132 return dev->nodes[0]; 1135 if (kfd_irq_is_from_node(dev->nodes[i], node_id, vmid)) 1136 return dev->nodes[i]; 1512 return (node == node->kfd->nodes[0]);
|
/linux-master/fs/btrfs/ |
H A D | scrub.c | 423 eb = swarn->path->nodes[0]; 513 eb = path->nodes[0]; 1336 struct btrfs_fs_info *fs_info = path->nodes[0]->fs_info; 1340 btrfs_item_key_to_cpu(path->nodes[0], &key, path->slots[0]); 1380 if (path->nodes[0]) 1415 btrfs_item_key_to_cpu(path->nodes[0], &key, path->slots[0]); 1445 btrfs_item_key_to_cpu(path->nodes[0], &key, path->slots[0]); 1450 *size_ret = path->nodes[0]->fs_info->nodesize; 1453 ei = btrfs_item_ptr(path->nodes[0], path->slots[0], struct btrfs_extent_item); 1454 *flags_ret = btrfs_extent_flags(path->nodes[ [all...] |
H A D | inode.c | 178 eb = warn->path.nodes[0]; 279 eb = path.nodes[0]; 548 leaf = path->nodes[0]; 1858 * if path->nodes[0] is NULL or not if it needs to use the path afterwards. 1870 struct extent_buffer *leaf = path->nodes[0]; 2028 leaf = path->nodes[0]; 2038 leaf = path->nodes[0]; 2045 leaf = path->nodes[0]; 2126 if (!path->nodes[0]) 2940 leaf = path->nodes[ [all...] |
H A D | backref.c | 488 eb = path->nodes[level]; 505 eb = path->nodes[0]; 516 eb = path->nodes[0]; 605 * other tree nodes. This happens when qgroups does backref walks when 677 eb = path->nodes[level]; 684 eb = path->nodes[level]; 728 * New backrefs (i.e., for parent nodes) are added to the appropriate 1032 leaf = path->nodes[0]; 1168 leaf = path->nodes[0]; 1299 * If the node at this level is shared, than all nodes belo [all...] |
H A D | extent_io.c | 1577 * btree nodes/leafs whose content on disk is invalid - either garbage 2745 struct extent_buffer *clone = path->nodes[0]; 2751 if (path->slots[0] < btrfs_header_nritems(path->nodes[0])) 2770 btrfs_item_key_to_cpu(path->nodes[0], &key, path->slots[0]); 2777 copy_extent_buffer_full(clone, path->nodes[0]); 2782 clone->start = path->nodes[0]->start; 2786 path->nodes[0] = clone; 2819 btrfs_item_key_to_cpu(path->nodes[0], &key, path->slots[0] - 1); 2824 if (path->slots[0] >= btrfs_header_nritems(path->nodes[0])) { 2829 btrfs_item_key_to_cpu(path->nodes[ [all...] |
H A D | extent-tree.c | 152 btrfs_item_key_to_cpu(path->nodes[0], &key, 162 leaf = path->nodes[0]; 478 leaf = path->nodes[0]; 488 leaf = path->nodes[0]; 545 leaf = path->nodes[0]; 572 leaf = path->nodes[0]; 607 leaf = path->nodes[0]; 651 leaf = path->nodes[0]; 751 if (!path->nodes[level]) 754 btrfs_header_nritems(path->nodes[leve [all...] |
H A D | root-tree.c | 98 l = path->nodes[0]; 158 l = path->nodes[0]; 189 l = path->nodes[0]; 201 btrfs_mark_buffer_dirty(trans, path->nodes[0]); 244 leaf = path->nodes[0]; 251 leaf = path->nodes[0]; 368 leaf = path->nodes[0]; 444 leaf = path->nodes[0];
|
H A D | qgroup.c | 432 l = path->nodes[0]; 531 l = path->nodes[0]; 668 btrfs_mark_buffer_dirty(trans, path->nodes[0]); 737 leaf = path->nodes[0]; 756 leaf = path->nodes[0]; 845 l = path->nodes[0]; 891 l = path->nodes[0]; 933 l = path->nodes[0]; 973 leaf = path->nodes[0]; 1107 leaf = path->nodes[ [all...] |
H A D | ioctl.c | 1588 leaf = path->nodes[0]; 1883 l = path->nodes[0]; 1968 leaf = path->nodes[0]; 1994 leaf = path->nodes[0]; 2053 leaf = path->nodes[0]; 2233 btrfs_header_nritems(path->nodes[0])) { 2243 leaf = path->nodes[0]; 2316 btrfs_header_nritems(path->nodes[0])) { 2326 leaf = path->nodes[0]; 3014 btrfs_set_dir_item_key(path->nodes[ [all...] |
H A D | delayed-inode.c | 46 delayed_root->nodes = 0; 189 root->nodes++; 201 root->nodes--; 767 data_ptr = btrfs_item_ptr(path->nodes[0], path->slots[0], char); 768 write_extent_buffer(path->nodes[0], &curr->data, 853 struct extent_buffer *leaf = path->nodes[0]; 1038 leaf = path->nodes[0]; 1068 leaf = path->nodes[0]; 1188 ASSERT(path->nodes[0] == NULL); 2164 * nodes) an [all...] |
/linux-master/fs/bcachefs/ |
H A D | btree_node_scan.c | 41 static void found_btree_nodes_to_text(struct printbuf *out, struct bch_fs *c, found_btree_nodes nodes) argument 44 darray_for_each(nodes, i) { 98 * Given two found btree nodes, if their sequence numbers are equal, take the 173 if (darray_push(&f->nodes, n)) 310 prt_str(&buf, "overlapping btree nodes with same seq! halting\n "); 330 if (f->nodes.nr) 339 if (!f->nodes.nr) { 340 bch_err(c, "%s: no btree nodes found", __func__); 347 prt_printf(&buf, "%s: nodes found:\n", __func__); 348 found_btree_nodes_to_text(&buf, c, f->nodes); [all...] |
H A D | btree_node_scan_types.h | 27 found_btree_nodes nodes; member in struct:find_btree_nodes
|
/linux-master/drivers/interconnect/qcom/ |
H A D | x1e80100.c | 1360 .nodes = { &ebi }, 1366 .nodes = { &qxm_crypto }, 1373 .nodes = { &qsm_cfg, &qhs_ahb2phy0, 1410 .nodes = { &qhs_display_cfg }, 1416 .nodes = { &qxm_nsp, &qns_nsp_gemnoc }, 1422 .nodes = { &qnm_lpass_lpinoc, &qns_lpass_aggnoc }, 1429 .nodes = { &ebi }, 1435 .nodes = { &qns_mem_noc_hf }, 1441 .nodes = { &qnm_av1_enc, &qnm_camnoc_hf, 1451 .nodes [all...] |
/linux-master/drivers/interconnect/ |
H A D | core.c | 55 list_for_each_entry(n, &provider->nodes, node_list) { 117 /* draw nodes */ 118 list_for_each_entry(n, &provider->nodes, node_list) 122 list_for_each_entry(n, &provider->nodes, node_list) 133 list_for_each_entry(n, &provider->nodes, node_list) 157 list_for_each_entry(n, &provider->nodes, node_list) { 346 * multiple interconnect nodes. A single cell is used as an index into 347 * an array of icc nodes specified in the icc_onecell_data struct when 361 return icc_data->nodes[idx]; 888 * icc_link_create() - create a link between two nodes [all...] |
/linux-master/drivers/android/ |
H A D | binder.c | 22 * (proc->threads, proc->waiting_threads, proc->nodes) 698 struct rb_node *n = proc->nodes.rb_node; 739 struct rb_node **p = &proc->nodes.rb_node; 771 rb_insert_color(&node->rb_node, &proc->nodes); 911 rb_erase(&node->rb_node, &proc->nodes); 970 * print nodes) 4550 rb_erase(&node->rb_node, &proc->nodes); 5213 for (n = rb_first(&proc->nodes); n != NULL; n = rb_next(n)) { 5833 int threads, nodes, incoming_refs, outgoing_refs, active_transactions; local 5871 nodes [all...] |
/linux-master/include/acpi/ |
H A D | acpi_bus.h | 411 * Each device has a root software node plus two times as many nodes as the 445 * struct acpi_device_software_nodes - Software nodes for an ACPI device 447 * @nodes: Software nodes for root as well as ports and endpoints. 454 struct software_node *nodes; member in struct:acpi_device_software_nodes
|
/linux-master/drivers/gpu/drm/i915/gt/ |
H A D | intel_execlists_submission.c | 188 * engine, sorted by priority. Here we preallocate the nodes we need 194 } nodes[I915_NUM_ENGINES]; member in struct:virtual_engine 1032 rb_entry(rb, typeof(*ve), nodes[engine->id].rb); 1448 rb = &ve->nodes[engine->id].rb; 3203 rb_entry(rb, typeof(*ve), nodes[engine->id].rb); 3641 struct rb_node *node = &ve->nodes[sibling->id].rb; 3831 struct ve_node * const node = &ve->nodes[sibling->id]; 4027 GEM_BUG_ON(RB_EMPTY_NODE(&ve->nodes[sibling->id].rb)); 4028 RB_CLEAR_NODE(&ve->nodes[sibling->id].rb); 4143 rb_entry(rb, typeof(*ve), nodes[engin [all...] |