Searched refs:nodes (Results 226 - 250 of 253) sorted by relevance

1234567891011

/linux-master/drivers/target/iscsi/
H A Discsi_target_stat.c154 CONFIGFS_ATTR_RO(iscsi_stat_instance_, nodes);
/linux-master/fs/ubifs/
H A Dtnc_commit.c97 * fill_gap - make index nodes in gaps in dirty index LEBs.
104 * This function returns the number of index nodes written into the gap.
148 dbg_gc("LEB %d:%d to %d len %d nodes written %d wasted bytes %d",
213 * layout_leb_in_gaps - layout index nodes using in-the-gaps method.
217 * This function lays out new index nodes for dirty znodes using in-the-gaps
221 * This function returns the number of index nodes written into the gaps, or a
231 /* Get an index LEB with lots of obsolete index nodes */
251 list_for_each_entry(snod, &sleb->nodes, list) {
270 * The obsolete index nodes form gaps that can be
297 dbg_gc("LEB %d wrote %d index nodes", lnu
[all...]
H A Dubifs.h98 * There is no notion of truncation key because truncation nodes do not exist
100 * keys for truncation nodes because the code becomes simpler. So we define
149 /* Maximum number of data nodes to bulk-read */
246 * Dirty flag bits (lpt_drty_flgs) for LPT special nodes.
302 * @list: list of scanned nodes
323 * @nodes_cnt: number of nodes scanned
324 * @nodes: list of struct ubifs_scan_node
331 struct list_head nodes; member in struct:ubifs_scan_leb
462 * LPROPS_INDEX: LEB contains indexing nodes (this flag also exists on flash)
615 * @nbranch: branches to child nodes
[all...]
H A Dlprops.c1114 list_for_each_entry(snod, &sleb->nodes, list) {
1161 * nodes from an uncompleted commit due to an
H A Ddebug.c697 pr_err("LEB %-7d free %-8d dirty %-8d used %-8d free + dirty %-8d dark %-4d dead %-4d nodes fit %-3d flags %#-4x (",
851 pr_err("LEB %d has %d nodes ending at %d\n", lnum,
854 list_for_each_entry(snod, &sleb->nodes, list) {
1261 ubifs_err(c, "2 xent/dent nodes with the same name");
1305 /* Only dirty zbranch may have no on-flash nodes */
1621 /* Iterate over all indexing nodes */
2282 * o makes sure that all leaf nodes exist and their CRCs are correct;
2286 * The function reads whole indexing tree and all nodes, so it is pretty
2318 * dbg_check_data_nodes_order - check that list of data nodes is sorted.
2320 * @head: the list of nodes ('struc
[all...]
/linux-master/drivers/acpi/numa/
H A Dhmat.c763 * We'll also use the sorting to prime the candidate nodes with known
889 * Skip offline nodes. This can happen when memory
946 for_each_node_mask(nid, default_dram_type->nodes) {
/linux-master/drivers/memory/tegra/
H A Dtegra30.c1343 list_for_each_entry(node, &mc->provider.nodes, node_list) {
H A Dtegra20-emc.c960 list_for_each_entry(node, &provider->nodes, node_list) {
969 * SRC and DST nodes should have matching TAG in order to have
H A Dmc.c763 list_for_each_entry(node, &mc->provider.nodes, node_list) {
H A Dtegra124.c1181 list_for_each_entry(node, &mc->provider.nodes, node_list) {
H A Dtegra124-emc.c1295 list_for_each_entry(node, &provider->nodes, node_list) {
1304 * SRC and DST nodes should have matching TAG in order to have
H A Dtegra30-emc.c1478 list_for_each_entry(node, &provider->nodes, node_list) {
1487 * SRC and DST nodes should have matching TAG in order to have
/linux-master/include/acpi/
H A Dacpi_bus.h411 * 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/fs/jffs2/
H A Dscan.c266 pr_notice("Cowardly refusing to erase blocks on filesystem with no valid JFFS2 nodes\n");
933 /* We can't summarise nodes we don't grok */
984 ic->nodes = (void *)ic;
H A Dwbuf.c156 /* It has to have had some nodes or we couldn't be here */
272 /* Recover from failure to write wbuf. Recover the nodes up to the
318 /* All nodes were obsolete. Nothing to recover. */
319 jffs2_dbg(1, "No non-obsolete nodes to be recovered. Just filing block bad\n");
332 dbg_noderef("wbuf recover %08x-%08x (%d bytes in %d nodes)\n",
375 /* It wasn't. Go on and try to recover nodes complete in the wbuf */
377 dbg_noderef("wbuf now recover %08x-%08x (%d bytes in %d nodes)\n",
489 struct jffs2_raw_node_ref **p = &ic->nodes;
/linux-master/fs/ntfs3/
H A Dntfs_fs.h410 struct indx_node *nodes[20]; member in struct:ntfs_fnd
/linux-master/kernel/cgroup/
H A Dcpuset.c460 static inline void check_insane_mems_config(nodemask_t *nodes) argument
463 movable_only_nodes(nodes)) {
465 pr_info("Unsupported (movable nodes only) cpuset configuration detected (nmask=%*pbl)!\n"
467 nodemask_pr_args(nodes));
2674 * Migrate memory region from one set of nodes to another. This is
2729 * @newmems: new nodes that the task will be set
2782 * is idempotent. Also migrate pages in each mm to new nodes.
4332 * or memory nodes, we need to walk over the cpuset hierarchy,
4571 * nodes have been taken down, cpuset_hotplug_update_tasks() is invoked on
4849 * Are any of the nodes i
[all...]
/linux-master/fs/btrfs/
H A Ddisk-io.c2154 if (path->slots[0] >= btrfs_header_nritems(path->nodes[0])) {
2164 btrfs_item_key_to_cpu(path->nodes[0], &key, path->slots[0]);
4322 * and then a transaction commit runs the same delayed nodes
4323 * before any delayed worker has done something with the nodes.
4941 l = path->nodes[0];
/linux-master/kernel/sched/
H A Dfair.c1598 * 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/fs/f2fs/
H A Dsegment.c451 unsigned int nodes = get_pages(sbi, F2FS_DIRTY_NODES); local
459 nodes >= threshold || meta >= threshold ||
462 return dents + qdata + nodes + meta + imeta > global_threshold;
/linux-master/lib/
H A Dmaple_tree.c15 * pivots. In the case of dense nodes, the pivots are implied by the position
25 * The following illustrates the layout of a range64 nodes slots and pivots.
41 * Internal (non-leaf) nodes contain pointers to other nodes.
42 * Leaf nodes contain entries.
73 * * MA_STATE_PREALLOC - Preallocated nodes, WARN_ON allocation
147 struct ma_topiary *free; /* nodes to be freed */
165 static inline int mt_alloc_bulk(gfp_t gfp, size_t size, void **nodes) argument
167 return kmem_cache_alloc_bulk(maple_node_cache, gfp, size, nodes);
175 static inline void mt_free_bulk(size_t size, void __rcu **nodes) argument
[all...]
/linux-master/drivers/gpu/drm/amd/amdkfd/
H A Dkfd_svm.c1995 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,
/linux-master/drivers/md/
H A Dmd.c6410 mddev->bitmap_info.nodes = 0;
6982 * check whether the device shows up in other nodes
7566 if (mddev->bitmap_info.nodes) {
7575 mddev->bitmap_info.nodes = 0;
8547 int md_setup_cluster(struct mddev *mddev, int nodes) argument
8561 ret = md_cluster_ops->join(mddev, nodes);
9222 * so other nodes are informed. It should be harmless for normal
/linux-master/include/linux/
H A Dsyscalls.h840 const int __user *nodes,
/linux-master/mm/
H A Dhugetlb.c1420 /* 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...]

Completed in 458 milliseconds

1234567891011