| /kernel/linux/linux-5.10/mm/ |
| H A D | migrate.c | 1731 * Migrate an array of page address onto an array of nodes and fill
1737 const int __user *nodes, in do_pages_move()
1755 if (get_user(node, nodes + i)) in do_pages_move()
1818 * Determine the nodes of an array of pages and store it in an array of status.
1856 * Determine the nodes of a user array of pages and store it in
1942 const int __user *nodes, in kernel_move_pages()
1960 if (nodes) in kernel_move_pages()
1962 nodes, status, flags); in kernel_move_pages()
1972 const int __user *, nodes, in SYSCALL_DEFINE6()
1975 return kernel_move_pages(pid, nr_pages, pages, nodes, statu in SYSCALL_DEFINE6()
1734 do_pages_move(struct mm_struct *mm, nodemask_t task_nodes, unsigned long nr_pages, const void __user * __user *pages, const int __user *nodes, int __user *status, int flags) do_pages_move() argument
1940 kernel_move_pages(pid_t pid, unsigned long nr_pages, const void __user * __user *pages, const int __user *nodes, int __user *status, int flags) kernel_move_pages() argument
[all...] |
| /kernel/linux/linux-6.6/drivers/md/ |
| H A D | md-cluster.c | 469 * The bitmaps are not same for different nodes in process_suspend_info()
475 * different nodes are match up well. in process_suspend_info()
732 * 4. Upconverts ack lock resource from CR to EX. This forces the BAST on other nodes
733 * and the other nodes read the message. The thread will wait here until all other
734 * nodes have released ack lock resource.
860 static int join(struct mddev *mddev, int nodes) in join() argument
888 if (nodes < cinfo->slot_number) { in join()
890 cinfo->slot_number, nodes); in join()
1137 * We need to ensure all the nodes can grow to a larger in resize_bitmaps()
1144 for (i = 0; i < mddev->bitmap_info.nodes; in resize_bitmaps()
[all...] |
| /third_party/ninja/src/ |
| H A D | build_test.cc | 283 // Mark all the out* nodes dirty
in TEST_F()
994 // added nodes, but not phony edges to the graph.
in TEST_F()
997 // Verify that nodes for blah.h and bar.h were added and that they
in TEST_F()
2304 EXPECT_EQ("in1", out1_deps->nodes[0]->path());
in TEST_F()
2309 EXPECT_EQ("in1", out2_deps->nodes[0]->path());
in TEST_F()
2333 EXPECT_EQ("in1", out1_deps->nodes[0]->path());
in TEST_F()
2334 EXPECT_EQ("in2", out1_deps->nodes[1]->path());
in TEST_F()
2339 EXPECT_EQ("in1", out2_deps->nodes[0]->path());
in TEST_F()
2340 EXPECT_EQ("in2", out2_deps->nodes[1]->path());
in TEST_F()
2364 EXPECT_EQ("in1", out1_deps->nodes[ in TEST_F()
[all...] |
| /kernel/linux/linux-5.10/arch/x86/include/asm/uv/ |
| H A D | uv_mmrs.h | 2931 unsigned long nodes:64; /* RW */ member
2936 unsigned long nodes:64; /* RW */ member
2941 unsigned long nodes:64; /* RW */ member
2963 unsigned long nodes:64; /* RW */ member
2968 unsigned long nodes:64; /* RW */ member
2973 unsigned long nodes:64; /* RW */ member
3003 unsigned long nodes:64; /* RW */ member
3008 unsigned long nodes:64; /* RW */ member
3013 unsigned long nodes:64; /* RW */ member
3018 unsigned long nodes member
3023 unsigned long nodes:64; /* RW */ global() member
[all...] |
| /kernel/linux/linux-6.6/arch/x86/include/asm/uv/ |
| H A D | uv_mmrs.h | 2931 unsigned long nodes:64; /* RW */ member
2936 unsigned long nodes:64; /* RW */ member
2941 unsigned long nodes:64; /* RW */ member
2963 unsigned long nodes:64; /* RW */ member
2968 unsigned long nodes:64; /* RW */ member
2973 unsigned long nodes:64; /* RW */ member
3003 unsigned long nodes:64; /* RW */ member
3008 unsigned long nodes:64; /* RW */ member
3013 unsigned long nodes:64; /* RW */ member
3018 unsigned long nodes member
3023 unsigned long nodes:64; /* RW */ global() member
[all...] |
| /kernel/linux/linux-6.6/fs/btrfs/ |
| H A D | inode.c | 170 eb = warn->path.nodes[0]; in data_reloc_print_warning_inode()
271 eb = path.nodes[0]; in print_data_reloc_error()
540 leaf = path->nodes[0]; in insert_inline_extent()
1845 * if path->nodes[0] is NULL or not if it needs to use the path afterwards.
1857 struct extent_buffer *leaf = path->nodes[0]; in can_nocow_file_extent()
2015 leaf = path->nodes[0]; in run_delalloc_nocow()
2025 leaf = path->nodes[0]; in run_delalloc_nocow()
2032 leaf = path->nodes[0]; in run_delalloc_nocow()
2113 if (!path->nodes[0]) in run_delalloc_nocow()
2909 leaf = path->nodes[ in insert_reserved_file_extent()
[all...] |
| /kernel/linux/linux-5.10/arch/x86/events/amd/ |
| H A D | ibs.c | 922 int nodes; in setup_ibs_ctl() local
925 nodes = 0; in setup_ibs_ctl()
933 ++nodes; in setup_ibs_ctl()
945 if (!nodes) { in setup_ibs_ctl()
956 * success we initialize all nodes with this offset. This updates then
|
| /kernel/linux/linux-5.10/net/qrtr/ |
| H A D | ns.c | 18 static RADIX_TREE(nodes, GFP_KERNEL);
75 node = radix_tree_lookup(&nodes, node_id); in node_get()
86 if (radix_tree_insert(&nodes, node_id, node)) { in node_get()
614 radix_tree_for_each_slot(node_slot, &nodes, &node_iter, 0) { in ctrl_cmd_new_lookup()
|
| /kernel/linux/linux-5.10/sound/pci/hda/ |
| H A D | hda_proc.c | 743 int i, nodes; in print_codec_info() local
759 nodes = snd_hda_get_sub_nodes(codec, fg, &nid); in print_codec_info()
760 if (! nid || nodes < 0) { in print_codec_info()
770 for (i = 0; i < nodes; i++, nid++) { in print_codec_info()
|
| /kernel/linux/linux-5.10/fs/ubifs/ |
| H A D | replay.c | 42 * sorts the replay list in nodes sequence number order, and then inserts all
583 * with the authentication nodes on this LEB. Authentication nodes are written
587 * because a powercut happened when some nodes were written but not the
588 * corresponding authentication node. This function returns the number of nodes
604 list_for_each_entry(snod, &sleb->nodes, list) { in authenticate_sleb()
636 * A powercut can happen when some nodes were written, but not yet in authenticate_sleb()
642 dbg_mnt("%d unauthenticated nodes found on LEB %d, Ignoring them", in authenticate_sleb()
646 dbg_mnt("%d unauthenticated nodes found on non-last LEB %d", in authenticate_sleb()
662 * This function replays bud @bud, recovers it if needed, and adds all nodes
[all...] |
| /kernel/linux/linux-6.6/fs/ubifs/ |
| H A D | replay.c | 42 * sorts the replay list in nodes sequence number order, and then inserts all
583 * with the authentication nodes on this LEB. Authentication nodes are written
587 * because a powercut happened when some nodes were written but not the
588 * corresponding authentication node. This function returns the number of nodes
604 list_for_each_entry(snod, &sleb->nodes, list) { in authenticate_sleb()
636 * A powercut can happen when some nodes were written, but not yet in authenticate_sleb()
642 dbg_mnt("%d unauthenticated nodes found on LEB %d, Ignoring them", in authenticate_sleb()
646 dbg_mnt("%d unauthenticated nodes found on non-last LEB %d", in authenticate_sleb()
662 * This function replays bud @bud, recovers it if needed, and adds all nodes
[all...] |
| /kernel/linux/linux-6.6/drivers/interconnect/qcom/ |
| H A D | msm8939.c | 1284 .nodes = msm8939_snoc_nodes,
1305 .nodes = msm8939_snoc_mm_nodes,
1334 .nodes = msm8939_bimc_nodes,
1406 .nodes = msm8939_pcnoc_nodes,
|
| H A D | qcs404.c | 987 .nodes = qcs404_bimc_nodes,
1042 .nodes = qcs404_pcnoc_nodes,
1071 .nodes = qcs404_snoc_nodes,
|
| /kernel/linux/linux-6.6/sound/pci/hda/ |
| H A D | hda_proc.c | 779 int i, nodes; in print_codec_info() local
795 nodes = snd_hda_get_sub_nodes(codec, fg, &nid); in print_codec_info()
796 if (! nid || nodes < 0) { in print_codec_info()
806 for (i = 0; i < nodes; i++, nid++) { in print_codec_info()
|
| /kernel/linux/linux-6.6/arch/powerpc/lib/ |
| H A D | qspinlock.c | 25 struct qnode nodes[MAX_NODES]; member
278 struct qnode *qnode = &qnodesp->nodes[idx]; in get_tail_qnode()
569 node = &qnodesp->nodes[idx]; in queued_spin_lock_mcs_queue()
|
| /kernel/linux/linux-5.10/drivers/md/persistent-data/ |
| H A D | dm-btree.h | 55 * because previously-shared btree nodes have now diverged.
200 struct cursor_node nodes[DM_BTREE_CURSOR_MAX_DEPTH]; member
|
| /kernel/linux/linux-5.10/net/tipc/ |
| H A D | name_table.h | 99 * - used by name_distr to send bulk updates to new nodes
124 u32 upper, struct tipc_nlist *nodes);
|
| /kernel/linux/linux-5.10/drivers/staging/media/ipu3/ |
| H A D | ipu3.h | 20 * master queue, the driver queues a buffer also to all other active nodes.
21 * If user space hasn't provided a buffer to all other video nodes first,
113 struct imgu_video_device nodes[IMGU_NODE_NUM]; member
|
| /kernel/linux/linux-6.6/drivers/staging/media/ipu3/ |
| H A D | ipu3.h | 20 * master queue, the driver queues a buffer also to all other active nodes.
21 * If user space hasn't provided a buffer to all other video nodes first,
108 struct imgu_video_device nodes[IMGU_NODE_NUM]; member
|
| /kernel/linux/linux-6.6/drivers/scsi/elx/efct/ |
| H A D | efct_xport.h | 121 /* number of allocated nodes */
125 /* array of pointers to nodes */
126 struct efc_node **nodes; member
|
| /kernel/linux/linux-6.6/drivers/net/ethernet/wangxun/txgbe/ |
| H A D | txgbe_type.h | 182 struct txgbe_nodes nodes; member
|
| /kernel/linux/linux-6.6/certs/ |
| H A D | Makefile | 48 cmd_gen_key = openssl req -new -nodes -utf8 -$(CONFIG_MODULE_SIG_HASH) -days 36500 \
|
| /kernel/linux/linux-6.6/drivers/md/persistent-data/ |
| H A D | dm-btree.h | 56 * because previously-shared btree nodes have now diverged.
201 struct cursor_node nodes[DM_BTREE_CURSOR_MAX_DEPTH]; member
|
| /kernel/linux/linux-6.6/net/tipc/ |
| H A D | name_table.h | 97 * - used by name_distr to send bulk updates to new nodes
120 struct tipc_nlist *nodes);
|
| /third_party/node/deps/v8/src/compiler/ |
| H A D | common-node-cache.h | 22 // Bundles various caches for common nodes.
85 // Return all nodes from the cache.
86 void GetCachedNodes(ZoneVector<Node*>* nodes);
|