Searched refs:node_start (Results 1 – 7 of 7) sorted by relevance
| /arch/x86/mm/ |
| D | numa_64.c | 327 u64 max_addr, int node_start, in split_nodes_equally() argument
355 for (i = node_start; i < num_nodes + node_start; i++) { in split_nodes_equally()
364 if (i == num_nodes + node_start - 1) in split_nodes_equally()
378 return i - node_start + 1; in split_nodes_equally()
387 u64 max_addr, int node_start, u64 size) in split_nodes_by_size() argument
389 int i = node_start; in split_nodes_by_size()
393 return i - node_start; in split_nodes_by_size()
|
| D | init_64.c | 1167 static int __meminitdata node_start; variable
1220 if (p_end != p || node_start != node) { in vmemmap_populate()
1223 addr_start, addr_end-1, p_start, p_end-1, node_start); in vmemmap_populate()
1225 node_start = node; in vmemmap_populate()
1243 addr_start, addr_end-1, p_start, p_end-1, node_start); in vmemmap_populate_print_last()
1246 node_start = 0; in vmemmap_populate_print_last()
|
| /arch/sparc/prom/ |
| D | tree_64.c | 175 int prom_searchsiblings(int node_start, const char *nodename) in prom_searchsiblings() argument
181 for(thisnode = node_start; thisnode; in prom_searchsiblings()
|
| D | tree_32.c | 198 int prom_searchsiblings(int node_start, char *nodename) in prom_searchsiblings() argument
203 for(thisnode = node_start; thisnode; in prom_searchsiblings()
|
| /arch/sparc/include/asm/ |
| D | oplib_32.h | 217 extern int prom_searchsiblings(int node_start, char *name);
|
| D | oplib_64.h | 258 extern int prom_searchsiblings(int node_start, const char *name);
|
| /arch/m68k/include/asm/ |
| D | oplib.h | 249 extern int prom_searchsiblings(int node_start, char *name);
|