Searched refs:nodes (Results 201 - 225 of 253) sorted by relevance

1234567891011

/linux-master/drivers/net/ethernet/hisilicon/hns3/hns3pf/
H A Dhclge_tm.c1725 struct hclge_tm_nodes_cmd *nodes; local
1743 nodes = (struct hclge_tm_nodes_cmd *)desc.data;
1744 *qset_num = le16_to_cpu(nodes->qset_num);
1750 struct hclge_tm_nodes_cmd *nodes; local
1767 nodes = (struct hclge_tm_nodes_cmd *)desc.data;
1768 *pri_num = nodes->pri_num;
/linux-master/fs/jffs2/
H A Dreadinode.c156 /* We only check the data CRC of unchecked nodes */
206 * This function is used when we read an inode. Data nodes arrive in
207 * arbitrary order -- they may be older or newer than the nodes which
229 Note that such nodes won't be REF_UNCHECKED since there are no data to
301 /* ... and is good. Kill 'this' and any subsequent nodes which are also overlapped */
313 dbg_readinode("Done killing overlapped nodes\n");
445 we add nodes to the real fragtree, as long as they don't overlap. And
446 having thrown away the majority of overlapped nodes as we went, there
447 really shouldn't be many sets of nodes which do overlap. If we start at
448 the end, we can use the overlap markers -- we can just eat nodes whic
[all...]
H A Dnodelist.h78 scan the nodes which are listed for it and build up a proper map of
79 which nodes are currently valid. JFFSv1 always used to keep that whole
129 /* flash_offset & 3 always has to be zero, because nodes are
141 /* Dirent nodes should be REF_PRISTINE only if they are not a deletion
148 copied. If you need to do anything different to GC inode-less nodes, then
155 dirent nodes) would take more space than this does. We also keep
167 struct jffs2_raw_node_ref *nodes; member in struct:jffs2_inode_cache
225 we're actually building up the original map of which nodes go where,
H A Dnodemgmt.c53 * jffs2_reserve_space - request physical space to write nodes to flash
113 * of nodes.
132 * don't know, if unchecked size contains obsoleted nodes, which could give us some
134 * of nodes.
494 * Should only be used to report nodes for which space has been allocated
512 /* Allow non-obsolete nodes only to be added at the end of c->nextblock,
513 if c->nextblock is set. Note that wbuf.c will file obsolete nodes
609 function without actually obliterating any nodes or freeing
681 obliterate nodes that look obsolete. If they weren't
797 obsolete dirent nodes t
[all...]
H A Dnodelist.c220 /* Skip all the nodes which are completed before this one starts */
383 /* If we now share a page with other nodes, mark either previous
563 /* Pass 'c' argument to indicate that nodes should be marked obsolete as
627 ref->next_in_ino = ic->nodes;
628 ic->nodes = ref;
691 /* Calculate totlen from surrounding nodes or eraseblock */
H A Dgc.c214 finished checking all its nodes */
298 pr_warn("eep. End of raw list while still supposedly nodes to GC\n");
368 We can just copy any pristine nodes, but have
401 the alloc_sem() (for marking nodes invalid) so we must
445 the only valid nodes in the block, followed by erasure,
447 held _all_ the nodes of that inode.... never been seen but
549 frag->node->raw = f->inocache->nodes;
901 /* On a medium where we can't actually mark nodes obsolete
924 for (raw = f->inocache->nodes; raw != (void *)f->inocache; raw = raw->next_in_ino) {
1189 circles dirtying the nodes i
[all...]
H A Dwrite.c37 f->inocache->nodes = (struct jffs2_raw_node_ref *)f->inocache;
/linux-master/fs/btrfs/
H A Dprops.c170 leaf = path->nodes[0];
H A Dctree.h39 * 2) It also triggers readahead for nodes;
41 * will still trigger readahead for other nodes and leaves that follow
52 * level 0 is always the leaf, and nodes[1...BTRFS_MAX_LEVEL] will point
59 struct extent_buffer *nodes[BTRFS_MAX_LEVEL]; member in struct:btrfs_path
69 * and to force calls to keep space in the nodes
229 * Xarray that keeps track of delayed nodes of every inode, protected
617 * it while holding a write lock on a leaf and often on upper level nodes
H A Dblock-group.c751 leaf = path->nodes[0];
783 leaf = path->nodes[0];
1981 leaf = path->nodes[0];
2501 leaf = path->nodes[0];
2628 leaf = path->nodes[0];
3078 leaf = path->nodes[0];
3494 * allocate new block groups as a result of COWing nodes of the root
4218 * needing it, as we might not need to COW all nodes/leafs from
H A Dfree-space-cache.c107 leaf = path->nodes[0];
185 leaf = path->nodes[0];
214 leaf = path->nodes[0];
771 leaf = path->nodes[0];
1169 leaf = path->nodes[0];
2806 * Since the allocation info of tree-log nodes are not recorded
2813 * Advance the pointer not to overwrite the tree-log nodes.
H A Dzoned.c311 if (path->slots[0] >= btrfs_header_nritems(path->nodes[0])) {
322 leaf = path->nodes[0];
1262 btrfs_item_key_to_cpu(path->nodes[0], &found_key, path->slots[0]);
/linux-master/fs/ocfs2/cluster/
H A Dheartbeat.c54 * - o2hb_quorum_region_bitmap tracks live regions that have seen all nodes
405 printk(KERN_NOTICE "o2hb: all nodes hb write hung, maybe region %s (%pg) is down.\n",
863 * live nodes heartbeat on it. In other words, the region has been
864 * added to all nodes.
973 /* dead nodes only come to life after some number of
984 mlog(ML_HEARTBEAT, "o2hb: Add node %d to live nodes "
1000 /* We want to be sure that all nodes agree on the
1023 /* live nodes only go dead after enough consequtive missed
1036 "nodes bitmap\n", slot->ds_node_num);
1068 static int o2hb_highest_node(unsigned long *nodes, in argument
1073 o2hb_lowest_node(unsigned long *nodes, int numbits) argument
[all...]
/linux-master/drivers/gpu/drm/amd/amdgpu/
H A Damdgpu_psp.h158 struct psp_xgmi_node_info nodes[AMDGPU_XGMI_MAX_CONNECTED_NODES]; member in struct:psp_xgmi_topology_info
/linux-master/drivers/gpu/drm/i915/gt/
H A Dintel_execlists_submission.c188 * 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...]
/linux-master/fs/ubifs/
H A Dorphan.c37 * the commit is run, are written to the orphan area in 1 or more orphan nodes.
399 * write_orph_nodes - write orphan nodes until there are no more to commit.
403 * This function writes orphan nodes for all the orphans to commit. On success,
645 list_for_each_entry(snod, &sleb->nodes, list) {
662 * row, the commit number written on orphan nodes will continue
767 * Orph nodes always start at c->orph_first and are written to each
769 * but may contain out of date orphan nodes if the unmap didn't go
772 * there are orphan nodes from the next commit (i.e. the commit did not
959 list_for_each_entry(snod, &sleb->nodes, list) {
1046 dbg_cmt("total number of leaf nodes i
[all...]
H A Dlog.c349 * reference nodes for all journal heads which will define new journal after
350 * the commit has been finished. The commit start and reference nodes are
637 * needed for commit. This function rewrites the reference nodes in the log
638 * omitting duplicates, and failed CS nodes, and leaving no gaps.
663 list_for_each_entry(snod, &sleb->nodes, list) {
/linux-master/fs/btrfs/tests/
H A Dinode-tests.c30 path.nodes[0] = leaf;
64 path.nodes[0] = leaf;
/linux-master/tools/perf/
H A Dbuiltin-c2c.c91 unsigned long **nodes; member in struct:perf_c2c
1204 bitmap_and(set, c2c_he->cpuset, c2c.nodes[node], c2c.cpus_cnt);
2282 unsigned long **nodes; local
2297 nodes = zalloc(sizeof(unsigned long *) * c2c.nodes_cnt);
2298 if (!nodes)
2301 c2c.nodes = nodes;
2320 nodes[node] = set;
2435 fprintf(out, " Load hits on peer cache or nodes : %10d\n", stats->lcl_peer + stats->rmt_peer);
3115 pr_err("Failed setup nodes\
[all...]
/linux-master/drivers/acpi/acpica/
H A Daclocal.h1228 u32 nodes; member in struct:acpi_integrity_info
/linux-master/drivers/md/bcache/
H A Dbcache.h63 * contain metadata (including btree nodes).
111 * free smaller than a bucket - so, that's how big our btree nodes are.
116 * bucket's gen for deleting btree nodes when we rewrite/split a node.)
118 * Anyways, btree nodes are big - big enough to be inefficient with a textbook
121 * The way this is solved is that btree nodes are internally log structured; we
150 * wrapping around. It also merges adjacent btree nodes if they're empty enough.
164 * nodes in the btree, and those writes will be mostly empty (appending at most
173 * For simplicity, we only journal updates to leaf nodes; updates to parent
174 * nodes are rare enough (since our leaf nodes ar
484 size_t nodes; member in struct:gc_stat
[all...]
/linux-master/fs/dlm/
H A Ddlm_internal.h132 struct dlm_config_node *nodes; member in struct:dlm_recover
169 * Some internal flags are shared between the master and process nodes;
367 /* dlm_header is first element of all structs sent between nodes */
580 struct list_head ls_nodes; /* current nodes in ls */
582 int ls_num_nodes; /* number of nodes in ls */
/linux-master/drivers/memory/tegra/
H A Dtegra20.c400 list_for_each_entry(node, &mc->provider.nodes, node_list) {
/linux-master/net/tipc/
H A Dname_table.c142 * subtree. If not, it has lower > end, then nodes on
672 * Used on nodes which have received a multicast/broadcast message
700 /* tipc_nametbl_lookup_mcast_nodes(): look up all destination nodes matching
702 * Used on nodes which are sending out a multicast/broadcast message
703 * Returns a list of nodes, including own node if applicable
706 struct tipc_nlist *nodes)
720 tipc_nlist_add(nodes, p->sk.node);
705 tipc_nametbl_lookup_mcast_nodes(struct net *net, struct tipc_uaddr *ua, struct tipc_nlist *nodes) argument
/linux-master/sound/pci/hda/
H A Dpatch_hdmi.c2009 int i, nodes; local
2012 nodes = snd_hda_get_sub_nodes(codec, codec->core.afg, &start_nid);
2013 if (!start_nid || nodes < 0) {
2014 codec_warn(codec, "HDMI: failed to get afg sub nodes\n");
2030 for (i = 0; i < nodes; i++) {
2043 for (i = 0; i < nodes; i++) {

Completed in 434 milliseconds

1234567891011