Home
last modified time | relevance | path

Searched refs:nodes (Results 576 - 600 of 924) sorted by relevance

1...<<21222324252627282930>>...37

/kernel/linux/linux-5.10/lib/
H A Dradix-tree.c58 * Per-cpu pool of preloaded nodes
263 ret = rtp->nodes; in radix_tree_node_alloc()
264 rtp->nodes = ret->parent; in radix_tree_node_alloc()
294 * Must only free zeroed nodes into the slab. We can be left with in radix_tree_node_rcu_free()
342 node->parent = rtp->nodes; in __radix_tree_preload()
343 rtp->nodes = node; in __radix_tree_preload()
590 * Until there is more than one item in the tree, no nodes are
646 * Free any nodes below this node. The tree is presumed to not need
741 * Until there is more than one item in the tree, no nodes are
811 * must manage lifetimes of leaf nodes (e
[all...]
/kernel/linux/linux-6.6/drivers/interconnect/qcom/
H A Dsdm660.c1510 .nodes = sdm660_a2noc_nodes,
1539 .nodes = sdm660_bimc_nodes,
1594 .nodes = sdm660_cnoc_nodes,
1616 .nodes = sdm660_gnoc_nodes,
1656 .nodes = sdm660_mnoc_nodes,
1694 .nodes = sdm660_snoc_nodes,
/kernel/linux/linux-6.6/lib/
H A Dradix-tree.c60 * Per-cpu pool of preloaded nodes
265 ret = rtp->nodes; in radix_tree_node_alloc()
266 rtp->nodes = ret->parent; in radix_tree_node_alloc()
296 * Must only free zeroed nodes into the slab. We can be left with in radix_tree_node_rcu_free()
344 node->parent = rtp->nodes; in __radix_tree_preload()
345 rtp->nodes = node; in __radix_tree_preload()
592 * Until there is more than one item in the tree, no nodes are
648 * Free any nodes below this node. The tree is presumed to not need
743 * Until there is more than one item in the tree, no nodes are
813 * must manage lifetimes of leaf nodes (e
[all...]
/third_party/ffmpeg/libavcodec/
H A Dtruemotion2.c108 int nodes; ///< total number of nodes in tree member
157 huff.nodes = get_bits(&ctx->gb, 17); in tm2_build_huff_table()
167 if ((huff.nodes <= 0) || (huff.nodes > 0x10000)) { in tm2_build_huff_table()
169 "nodes: %i\n", huff.nodes); in tm2_build_huff_table()
176 /* allocate space for codes - it is exactly ceil(nodes / 2) entries */ in tm2_build_huff_table()
177 huff.max_num = (huff.nodes + 1) >> 1; in tm2_build_huff_table()
/kernel/linux/linux-5.10/drivers/md/
H A Dmd-cluster.c469 * The bitmaps are not same for different nodes in process_suspend_info()
475 * different nodes are match up well. in process_suspend_info()
729 * 4. Upconverts ack lock resource from CR to EX. This forces the BAST on other nodes
730 * and the other nodes read the message. The thread will wait here until all other
731 * nodes have released ack lock resource.
857 static int join(struct mddev *mddev, int nodes) in join() argument
885 if (nodes < cinfo->slot_number) { in join()
887 cinfo->slot_number, nodes); in join()
1133 * We need to ensure all the nodes can grow to a larger in resize_bitmaps()
1140 for (i = 0; i < mddev->bitmap_info.nodes; in resize_bitmaps()
[all...]
/kernel/linux/linux-5.10/tools/perf/util/
H A Dheader.c688 struct numa_topology_node *n = &tp->nodes[i]; in write_numa_topology()
1293 static int build_mem_topology(struct memory_node *nodes, u64 size, u64 *cntp) in build_mem_topology() argument
1324 "failed to write MEM_TOPOLOGY, way too many nodes\n")) { in build_mem_topology()
1329 ret = memory_node__read(&nodes[cnt++], idx); in build_mem_topology()
1336 qsort(nodes, cnt, sizeof(nodes[0]), memory_node__sort); in build_mem_topology()
1349 * 16 - count | number of nodes
1361 static struct memory_node nodes[MAX_MEMORY_NODES]; in write_mem_topology() local
1370 ret = build_mem_topology(&nodes[0], MAX_MEMORY_NODES, &nr); in write_mem_topology()
1387 struct memory_node *n = &nodes[ in write_mem_topology()
2037 struct memory_node *nodes; print_mem_topology() local
2500 struct numa_node *nodes, *n; process_numa_topology() local
2765 struct memory_node *nodes; process_mem_topology() local
[all...]
/kernel/linux/linux-5.10/mm/
H A Dmigrate.c1731 * 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 Dmd-cluster.c469 * 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 Dbuild_test.cc283 // 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...]
/base/hiviewdfx/faultloggerd/interfaces/innerkits/async_stack/include/
H A Dunique_stack_table.h63 std::vector<UniStackNode> nodes; member
/base/msdp/device_status/tools/vdev/include/
H A Dvirtual_device.h65 static void GetInputDeviceNodes(std::map<std::string, std::string> &nodes);
/foundation/arkui/ace_engine/frameworks/core/common/recorder/
H A Dnode_data_cache.h75 void GetNodeData(const std::string& pageUrl, std::unordered_map<std::string, std::string>& nodes);
/foundation/graphic/graphic_2d/rosen/modules/render_service_client/test/
H A Drender_service_client_app_demo.cpp34 std::vector<std::shared_ptr<RSCanvasNode>> nodes; variable
H A Drender_service_client_first_frame_callback_demo.cpp34 std::vector<std::shared_ptr<RSCanvasNode>> nodes; variable
/foundation/distributeddatamgr/datamgr_service/services/distributeddataservice/service/rdb/
H A Drdb_cloud.h66 static QueryNodes ConvertQuery(DBQueryNodes&& nodes);
/foundation/distributeddatamgr/datamgr_service/services/distributeddataservice/service/data_share/subscriber_managers/
H A Drdb_subscriber_manager.h87 void SetObserverNotifyOnEnabled(std::vector<ObserverNode> &nodes);
/kernel/linux/linux-5.10/drivers/md/persistent-data/
H A Ddm-btree.h55 * 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 Dname_table.h99 * - 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 Dipu3.h20 * 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 Dipu3.h20 * 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 Defct_xport.h121 /* 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 Dtxgbe_type.h182 struct txgbe_nodes nodes; member
/kernel/linux/linux-6.6/certs/
H A DMakefile48 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 Ddm-btree.h56 * 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 Dname_table.h97 * - used by name_distr to send bulk updates to new nodes
120 struct tipc_nlist *nodes);

Completed in 27 milliseconds

1...<<21222324252627282930>>...37