/linux-master/drivers/gpu/drm/nouveau/include/nvkm/core/ |
H A D | mm.h | 21 struct list_head nodes; member in struct:nvkm_mm 48 list_for_each_entry(node, &mm->nodes, nl_entry) {
|
/linux-master/drivers/gpu/drm/nouveau/nvkm/core/ |
H A D | mm.c | 26 #define node(root, dir) ((root)->nl_entry.dir == &mm->nodes) ? NULL : \ 36 list_for_each_entry(node, &mm->nodes, nl_entry) { 246 prev = list_last_entry(&mm->nodes, typeof(*node), nl_entry); 255 list_add_tail(&node->nl_entry, &mm->nodes); 259 INIT_LIST_HEAD(&mm->nodes); 275 list_add_tail(&node->nl_entry, &mm->nodes); 286 int nodes = 0; local 291 list_for_each_entry(node, &mm->nodes, nl_entry) { 293 if (++nodes > mm->heap_nodes) { 300 list_for_each_entry_safe(node, temp, &mm->nodes, nl_entr [all...] |
/linux-master/drivers/md/ |
H A D | md-cluster.h | 13 int (*join)(struct mddev *mddev, int nodes);
|
/linux-master/drivers/net/wireless/ath/ath9k/ |
H A D | dynack.h | 64 * @nodes: ath_node linked list 74 struct list_head nodes; member in struct:ath_dynack
|
/linux-master/fs/hpfs/ |
H A D | anode.c | 406 int i, j, nodes; local 428 nodes = btree->n_used_nodes + btree->n_free_nodes; 438 btree->n_free_nodes = nodes - btree->n_used_nodes; 453 nodes = btree->n_used_nodes + btree->n_free_nodes; 472 btree->n_free_nodes = nodes - btree->n_used_nodes;
|
/linux-master/fs/jffs2/ |
H A D | nodemgmt.c | 53 * 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 D | write.c | 37 f->inocache->nodes = (struct jffs2_raw_node_ref *)f->inocache;
|
/linux-master/fs/ubifs/ |
H A D | log.c | 349 * 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/include/uapi/linux/ |
H A D | scif_ioctl.h | 188 * @nodes: pointer to an array of node_ids 193 __u64 nodes; member in struct:scifioctl_node_ids
|
/linux-master/lib/ |
H A D | interval_tree_test.c | 14 __param(int, nnodes, 100, "Number of nodes in the interval tree"); 19 __param(bool, search_all, false, "Searches will iterate all nodes in the tree"); 24 static struct interval_tree_node *nodes = NULL; variable in typeref:struct:interval_tree_node 49 nodes[i].start = a; 50 nodes[i].last = b; 68 nodes = kmalloc_array(nnodes, sizeof(struct interval_tree_node), 70 if (!nodes) 75 kfree(nodes); 88 interval_tree_insert(nodes + j, &root); 90 interval_tree_remove(nodes [all...] |
/linux-master/Documentation/sphinx/ |
H A D | automarkup.py | 7 from docutils import nodes namespace 113 repl.append(nodes.Text(t[done:m.start()])) 123 repl.append(nodes.Text(t[done:])) 146 target_text = nodes.Text(match.group(0)) 157 lit_text = nodes.literal(classes=['xref', 'c', 'c-func']) 206 target_text = nodes.Text(match.group(0)) 217 lit_text = nodes.literal(classes=['xref', 'c', class_str[match.re]]) 271 return nodes.Text(match.group(0)) 290 return nodes.reference('', nodes [all...] |
H A D | cdomain.py | 35 from docutils import nodes namespace 185 param += nodes.emphasis(argname, argname) 194 """Transform a C signature into RST nodes."""
|
H A D | kernel_abi.py | 42 from docutils import nodes, statemachine namespace 97 node = nodes.section()
|
H A D | kernel_feat.py | 40 from docutils import nodes, statemachine namespace 117 node = nodes.section()
|
H A D | kernel_include.py | 36 from docutils import io, nodes, statemachine namespace 100 path = nodes.reprunicode(path) 157 literal_block = nodes.literal_block(rawtext, source=path, 173 literal_block += nodes.inline(value, value, 176 literal_block += nodes.Text(value, value) 178 literal_block += nodes.Text(text, text)
|
H A D | kerneldoc.py | 37 from docutils import nodes, statemachine namespace 125 return [nodes.error(None, nodes.paragraph(text = "kernel-doc missing"))] 145 node = nodes.section() 153 return [nodes.error(None, nodes.paragraph(text = "kernel-doc missing"))]
|
H A D | kfigure.py | 56 from docutils import nodes namespace 61 from sphinx.util.nodes import clean_astext 90 node = nodes.literal_block(data, data) 438 class kernel_image(nodes.image): 457 if len(result) == 2 or isinstance(result[0], nodes.system_message): 475 class kernel_figure(nodes.figure): 494 if len(result) == 2 or isinstance(result[0], nodes.system_message): 541 img_node = nodes.image(node.rawsource, **node.attributes) 550 class kernel_render(nodes.General, nodes [all...] |
H A D | rstFlatTable.py | 45 from docutils import nodes namespace 94 class rowSpan(nodes.General, nodes.Element): pass # pylint: disable=C0103,C0321 95 class colSpan(nodes.General, nodes.Element): pass # pylint: disable=C0103,C0321 117 nodes.literal_block(self.block_text, self.block_text), 122 node = nodes.Element() # anonymous container for parsing 156 table = nodes.table() 157 tgroup = nodes.tgroup(cols=len(colwidths)) 162 colspec = nodes [all...] |
H A D | translations.py | 11 from docutils import nodes namespace 31 class LanguagesNode(nodes.Element): 64 pxref += nodes.Text(lang_name) 77 # Iterate over the child nodes; any resolved links will have 78 # the type 'nodes.reference', while unresolved links will be 79 # type 'nodes.Text'. 81 isinstance(xref, nodes.reference), node.children)) 89 node.replace_self(nodes.raw('', html_content, format='html'))
|
/linux-master/arch/arm/mach-sunxi/ |
H A D | mc_smp.c | 689 * This holds any device nodes that we requested resources for, 702 int (*get_smp_nodes)(struct sunxi_mc_smp_nodes *nodes); 706 static void __init sunxi_mc_smp_put_nodes(struct sunxi_mc_smp_nodes *nodes) argument 708 of_node_put(nodes->prcm_node); 709 of_node_put(nodes->cpucfg_node); 710 of_node_put(nodes->sram_node); 711 of_node_put(nodes->r_cpucfg_node); 712 memset(nodes, 0, sizeof(*nodes)); 715 static int __init sun9i_a80_get_smp_nodes(struct sunxi_mc_smp_nodes *nodes) argument 741 sun8i_a83t_get_smp_nodes(struct sunxi_mc_smp_nodes *nodes) argument 781 struct sunxi_mc_smp_nodes nodes = { 0 }; local [all...] |
/linux-master/arch/powerpc/lib/ |
H A D | qspinlock.c | 26 struct qnode nodes[MAX_NODES]; member in struct:qnodes 275 struct qnode *qnode = &qnodesp->nodes[idx]; 554 node = &qnodesp->nodes[idx];
|
/linux-master/arch/sparc/kernel/ |
H A D | cpumap.c | 45 int num_nodes; /* Number of nodes in a level in a cpuinfo tree */ 51 /* Offsets into nodes[] for each level of the tree */ 53 struct cpuinfo_node nodes[] __counted_by(total_nodes); 86 * nodes. 121 * end index, and number of nodes for each level in the cpuinfo tree. The 122 * total number of cpuinfo nodes required to build the tree is returned. 197 new_tree = kzalloc(struct_size(new_tree, nodes, n), GFP_ATOMIC); 211 node = &new_tree->nodes[n]; 252 node = &new_tree->nodes[level_rover[level]]; 277 node = &new_tree->nodes[ [all...] |
/linux-master/arch/x86/events/amd/ |
H A D | ibs.c | 1353 int nodes; local 1356 nodes = 0; 1364 ++nodes; 1376 if (!nodes) { 1387 * success we initialize all nodes with this offset. This updates then
|
/linux-master/arch/x86/include/asm/uv/ |
H A D | uv_mmrs.h | 2931 unsigned long nodes:64; /* RW */ member in struct:uvh_node_present_0_u::uvh_node_present_0_s 2936 unsigned long nodes:64; /* RW */ member in struct:uvh_node_present_0_u::uvyh_node_present_0_s 2941 unsigned long nodes:64; /* RW */ member in struct:uvh_node_present_0_u::uv5h_node_present_0_s 2963 unsigned long nodes:64; /* RW */ member in struct:uvh_node_present_1_u::uvh_node_present_1_s 2968 unsigned long nodes:64; /* RW */ member in struct:uvh_node_present_1_u::uvyh_node_present_1_s 2973 unsigned long nodes:64; /* RW */ member in struct:uvh_node_present_1_u::uv5h_node_present_1_s 3003 unsigned long nodes:64; /* RW */ member in struct:uvh_node_present_table_u::uvh_node_present_table_s 3008 unsigned long nodes:64; /* RW */ member in struct:uvh_node_present_table_u::uvxh_node_present_table_s 3013 unsigned long nodes:64; /* RW */ member in struct:uvh_node_present_table_u::uv4h_node_present_table_s 3018 unsigned long nodes member in struct:uvh_node_present_table_u::uv3h_node_present_table_s 3023 unsigned long nodes:64; /* RW */ member in struct:uvh_node_present_table_u::uv2h_node_present_table_s [all...] |
/linux-master/arch/x86/kernel/apic/ |
H A D | apic_numachip.c | 147 u32 nodes = 1; local 151 /* Account for nodes per socket in multi-core-module processors */ 154 nodes = ((val >> 3) & 7) + 1; 157 c->topo.pkg_id = node / nodes;
|