MAX_NUMNODES      201 arch/x86/kernel/machine_kexec_32.c 	VMCOREINFO_LENGTH(node_data, MAX_NUMNODES);
MAX_NUMNODES      245 arch/x86/kernel/machine_kexec_64.c 	VMCOREINFO_LENGTH(node_data, MAX_NUMNODES);
MAX_NUMNODES      171 arch/x86/kernel/numaq_32.c 	if (m->trans_quad < MAX_NUMNODES && !node_online(m->trans_quad))
MAX_NUMNODES      156 arch/x86/kernel/pci-calgary_64.c static struct scal_detail	*scal_devs[MAX_NUMNODES] __initdata;
MAX_NUMNODES      157 arch/x86/kernel/pci-calgary_64.c static struct rio_detail	*rio_devs[MAX_NUMNODES * 4] __initdata;
MAX_NUMNODES     1291 arch/x86/kernel/pci-calgary_64.c 	if (numnodes > MAX_NUMNODES){
MAX_NUMNODES     1295 arch/x86/kernel/pci-calgary_64.c 			MAX_NUMNODES, numnodes);
MAX_NUMNODES      207 arch/x86/kernel/setup_percpu.c 	if (nr_node_ids == MAX_NUMNODES) {
MAX_NUMNODES      137 arch/x86/kernel/smpboot.c cpumask_t node_to_cpumask_map[MAX_NUMNODES] __read_mostly =
MAX_NUMNODES      138 arch/x86/kernel/smpboot.c 				{ [0 ... MAX_NUMNODES-1] = CPU_MASK_NONE };
MAX_NUMNODES      158 arch/x86/kernel/smpboot.c 	for (node = 0; node < MAX_NUMNODES; node++)
MAX_NUMNODES       36 arch/x86/kernel/summit_32.c static struct scal_detail   *scal_devs[MAX_NUMNODES] __initdata;
MAX_NUMNODES       37 arch/x86/kernel/summit_32.c static struct rio_detail    *rio_devs[MAX_NUMNODES*4] __initdata;
MAX_NUMNODES      110 arch/x86/kernel/summit_32.c 	if (rio_table_hdr->num_scal_dev > MAX_NUMNODES) {
MAX_NUMNODES      111 arch/x86/kernel/summit_32.c 		printk(KERN_WARNING "%s: MAX_NUMNODES too low!  Defined as %d, but system has %d nodes.\n", __func__, MAX_NUMNODES, rio_table_hdr->num_scal_dev);
MAX_NUMNODES       43 arch/x86/mm/numa_32.c struct pglist_data *node_data[MAX_NUMNODES] __read_mostly;
MAX_NUMNODES       54 arch/x86/mm/numa_32.c unsigned long node_start_pfn[MAX_NUMNODES] __read_mostly;
MAX_NUMNODES       55 arch/x86/mm/numa_32.c unsigned long node_end_pfn[MAX_NUMNODES] __read_mostly;
MAX_NUMNODES      106 arch/x86/mm/numa_32.c unsigned long node_remap_size[MAX_NUMNODES];
MAX_NUMNODES      107 arch/x86/mm/numa_32.c static void *node_remap_start_vaddr[MAX_NUMNODES];
MAX_NUMNODES      185 arch/x86/mm/numa_32.c static unsigned long node_remap_start_pfn[MAX_NUMNODES];
MAX_NUMNODES      186 arch/x86/mm/numa_32.c static void *node_remap_end_vaddr[MAX_NUMNODES];
MAX_NUMNODES      187 arch/x86/mm/numa_32.c static void *node_remap_alloc_vaddr[MAX_NUMNODES];
MAX_NUMNODES      188 arch/x86/mm/numa_32.c static unsigned long node_remap_offset[MAX_NUMNODES];
MAX_NUMNODES       23 arch/x86/mm/numa_64.c struct pglist_data *node_data[MAX_NUMNODES] __read_mostly;
MAX_NUMNODES      286 arch/x86/mm/numa_64.c 		if (rr == MAX_NUMNODES)
MAX_NUMNODES      336 arch/x86/mm/numa_64.c 	if (num_nodes > MAX_NUMNODES)
MAX_NUMNODES      337 arch/x86/mm/numa_64.c 		num_nodes = MAX_NUMNODES;
MAX_NUMNODES      400 arch/x86/mm/numa_64.c static struct bootnode nodes[MAX_NUMNODES] __initdata;
MAX_NUMNODES      578 arch/x86/mm/numa_64.c 	sparse_memory_present_with_active_regions(MAX_NUMNODES);
MAX_NUMNODES       48 arch/x86/mm/srat_32.c #define MAXCHUNKS		(MAX_CHUNKS_PER_NODE * MAX_NUMNODES)
MAX_NUMNODES       30 arch/x86/mm/srat_64.c static struct bootnode nodes[MAX_NUMNODES] __initdata;
MAX_NUMNODES       31 arch/x86/mm/srat_64.c static struct bootnode nodes_add[MAX_NUMNODES];
MAX_NUMNODES       90 arch/x86/mm/srat_64.c 	for (i = 0; i < MAX_NUMNODES; i++)
MAX_NUMNODES      347 arch/x86/mm/srat_64.c 	for (i = 0; i < MAX_NUMNODES; i++) {
MAX_NUMNODES      398 arch/x86/mm/srat_64.c static int fake_node_to_pxm_map[MAX_NUMNODES] __initdata = {
MAX_NUMNODES      399 arch/x86/mm/srat_64.c 	[0 ... MAX_NUMNODES-1] = PXM_INVAL
MAX_NUMNODES        8 include/acpi/acpi_numa.h #if MAX_NUMNODES > 256
MAX_NUMNODES        9 include/acpi/acpi_numa.h #define MAX_PXM_DOMAINS MAX_NUMNODES
MAX_NUMNODES       46 include/asm-m32r/mmzone.h 	for (node = 0 ; node < MAX_NUMNODES ; node++)
MAX_NUMNODES      166 include/asm-x86/acpi.h #define NR_NODE_MEMBLKS (MAX_NUMNODES*2)
MAX_NUMNODES       32 include/asm-x86/e820.h #define E820_X_MAX (E820MAX + 3 * MAX_NUMNODES)
MAX_NUMNODES       33 include/asm-x86/mmzone_64.h 	VIRTUAL_BUG_ON(nid >= MAX_NUMNODES || !node_data[nid]);
MAX_NUMNODES      157 include/asm-x86/numaq.h 	struct		eachquadmem eq[MAX_NUMNODES];	/* indexed by quad id */
MAX_NUMNODES       98 include/linux/acpi.h #define NR_NODE_MEMBLKS MAX_NUMNODES
MAX_NUMNODES      185 include/linux/hugetlb.h 	struct list_head hugepage_freelists[MAX_NUMNODES];
MAX_NUMNODES      186 include/linux/hugetlb.h 	unsigned int nr_huge_pages_node[MAX_NUMNODES];
MAX_NUMNODES      187 include/linux/hugetlb.h 	unsigned int free_huge_pages_node[MAX_NUMNODES];
MAX_NUMNODES      188 include/linux/hugetlb.h 	unsigned int surplus_huge_pages_node[MAX_NUMNODES];
MAX_NUMNODES      381 include/linux/mmzone.h #define MAX_ZONES_PER_ZONELIST (MAX_NUMNODES * MAX_NR_ZONES)
MAX_NUMNODES       92 include/linux/nodemask.h typedef struct { DECLARE_BITMAP(bits, MAX_NUMNODES); } nodemask_t;
MAX_NUMNODES      107 include/linux/nodemask.h #define nodes_setall(dst) __nodes_setall(&(dst), MAX_NUMNODES)
MAX_NUMNODES      113 include/linux/nodemask.h #define nodes_clear(dst) __nodes_clear(&(dst), MAX_NUMNODES)
MAX_NUMNODES      130 include/linux/nodemask.h 			__nodes_and(&(dst), &(src1), &(src2), MAX_NUMNODES)
MAX_NUMNODES      138 include/linux/nodemask.h 			__nodes_or(&(dst), &(src1), &(src2), MAX_NUMNODES)
MAX_NUMNODES      146 include/linux/nodemask.h 			__nodes_xor(&(dst), &(src1), &(src2), MAX_NUMNODES)
MAX_NUMNODES      154 include/linux/nodemask.h 			__nodes_andnot(&(dst), &(src1), &(src2), MAX_NUMNODES)
MAX_NUMNODES      162 include/linux/nodemask.h 			__nodes_complement(&(dst), &(src), MAX_NUMNODES)
MAX_NUMNODES      170 include/linux/nodemask.h 			__nodes_equal(&(src1), &(src2), MAX_NUMNODES)
MAX_NUMNODES      178 include/linux/nodemask.h 			__nodes_intersects(&(src1), &(src2), MAX_NUMNODES)
MAX_NUMNODES      186 include/linux/nodemask.h 			__nodes_subset(&(src1), &(src2), MAX_NUMNODES)
MAX_NUMNODES      193 include/linux/nodemask.h #define nodes_empty(src) __nodes_empty(&(src), MAX_NUMNODES)
MAX_NUMNODES      199 include/linux/nodemask.h #define nodes_full(nodemask) __nodes_full(&(nodemask), MAX_NUMNODES)
MAX_NUMNODES      205 include/linux/nodemask.h #define nodes_weight(nodemask) __nodes_weight(&(nodemask), MAX_NUMNODES)
MAX_NUMNODES      212 include/linux/nodemask.h 			__nodes_shift_right(&(dst), &(src), (n), MAX_NUMNODES)
MAX_NUMNODES      220 include/linux/nodemask.h 			__nodes_shift_left(&(dst), &(src), (n), MAX_NUMNODES)
MAX_NUMNODES      233 include/linux/nodemask.h 	return min_t(int, MAX_NUMNODES, find_first_bit(srcp->bits, MAX_NUMNODES));
MAX_NUMNODES      239 include/linux/nodemask.h 	return min_t(int,MAX_NUMNODES,find_next_bit(srcp->bits, MAX_NUMNODES, n+1));
MAX_NUMNODES      257 include/linux/nodemask.h 	return min_t(int,MAX_NUMNODES,
MAX_NUMNODES      258 include/linux/nodemask.h 			find_first_zero_bit(maskp->bits, MAX_NUMNODES));
MAX_NUMNODES      261 include/linux/nodemask.h #define NODE_MASK_LAST_WORD BITMAP_LAST_WORD_MASK(MAX_NUMNODES)
MAX_NUMNODES      263 include/linux/nodemask.h #if MAX_NUMNODES <= BITS_PER_LONG
MAX_NUMNODES      267 include/linux/nodemask.h 	[BITS_TO_LONGS(MAX_NUMNODES)-1] = NODE_MASK_LAST_WORD		\
MAX_NUMNODES      274 include/linux/nodemask.h 	[0 ... BITS_TO_LONGS(MAX_NUMNODES)-2] = ~0UL,			\
MAX_NUMNODES      275 include/linux/nodemask.h 	[BITS_TO_LONGS(MAX_NUMNODES)-1] = NODE_MASK_LAST_WORD		\
MAX_NUMNODES      282 include/linux/nodemask.h 	[0 ... BITS_TO_LONGS(MAX_NUMNODES)-1] =  0UL			\
MAX_NUMNODES      288 include/linux/nodemask.h 			__nodemask_scnprintf((buf), (len), &(src), MAX_NUMNODES)
MAX_NUMNODES      296 include/linux/nodemask.h 		__nodemask_parse_user((ubuf), (ulen), &(dst), MAX_NUMNODES)
MAX_NUMNODES      304 include/linux/nodemask.h 			__nodelist_scnprintf((buf), (len), &(src), MAX_NUMNODES)
MAX_NUMNODES      311 include/linux/nodemask.h #define nodelist_parse(buf, dst) __nodelist_parse((buf), &(dst), MAX_NUMNODES)
MAX_NUMNODES      318 include/linux/nodemask.h 		__node_remap((oldbit), &(old), &(new), MAX_NUMNODES)
MAX_NUMNODES      326 include/linux/nodemask.h 		__nodes_remap(&(dst), &(src), &(old), &(new), MAX_NUMNODES)
MAX_NUMNODES      334 include/linux/nodemask.h 		__nodes_onto(&(dst), &(orig), &(relmap), MAX_NUMNODES)
MAX_NUMNODES      342 include/linux/nodemask.h 		__nodes_fold(&(dst), &(orig), sz, MAX_NUMNODES)
MAX_NUMNODES      349 include/linux/nodemask.h #if MAX_NUMNODES > 1
MAX_NUMNODES      352 include/linux/nodemask.h 		(node) < MAX_NUMNODES;			\
MAX_NUMNODES      383 include/linux/nodemask.h #if MAX_NUMNODES > 1
MAX_NUMNODES      435 include/linux/nodemask.h #define next_online_node(nid)	(MAX_NUMNODES)
MAX_NUMNODES       60 include/linux/seq_file.h 	return seq_bitmap(m, mask->bits, MAX_NUMNODES);
MAX_NUMNODES      103 include/linux/slub_def.h 	struct kmem_cache_node *node[MAX_NUMNODES];
MAX_NUMNODES      997 kernel/compat.c 	nr_bits = min_t(unsigned long, maxnode - 1, MAX_NUMNODES);
MAX_NUMNODES     1595 kernel/cpuset.c 		.max_write_len = (100U + 6 * MAX_NUMNODES),
MAX_NUMNODES     2319 kernel/cpuset.c 	if (node == MAX_NUMNODES)
MAX_NUMNODES       34 mm/bootmem.c   bootmem_data_t bootmem_node_data[MAX_NUMNODES] __initdata;
MAX_NUMNODES      394 mm/hugetlb.c   	for (nid = 0; nid < MAX_NUMNODES; ++nid) {
MAX_NUMNODES      524 mm/hugetlb.c   		if (nid == MAX_NUMNODES)
MAX_NUMNODES      592 mm/hugetlb.c   	if (next_nid == MAX_NUMNODES)
MAX_NUMNODES      820 mm/hugetlb.c   		if (nid == MAX_NUMNODES)
MAX_NUMNODES     1044 mm/hugetlb.c   	for (i = 0; i < MAX_NUMNODES; ++i) {
MAX_NUMNODES     1336 mm/hugetlb.c   	for (i = 0; i < MAX_NUMNODES; ++i)
MAX_NUMNODES      113 mm/memcontrol.c 	struct mem_cgroup_per_node *nodeinfo[MAX_NUMNODES];
MAX_NUMNODES      279 mm/mempolicy.c 		if (current->il_next >= MAX_NUMNODES)
MAX_NUMNODES      281 mm/mempolicy.c 		if (current->il_next >= MAX_NUMNODES)
MAX_NUMNODES     1022 mm/mempolicy.c 	if (nlongs > BITS_TO_LONGS(MAX_NUMNODES)) {
MAX_NUMNODES     1025 mm/mempolicy.c 		for (k = BITS_TO_LONGS(MAX_NUMNODES); k < nlongs; k++) {
MAX_NUMNODES     1035 mm/mempolicy.c 		nlongs = BITS_TO_LONGS(MAX_NUMNODES);
MAX_NUMNODES     1050 mm/mempolicy.c 	const int nbytes = BITS_TO_LONGS(MAX_NUMNODES) * sizeof(long);
MAX_NUMNODES     1183 mm/mempolicy.c 	if (nmask != NULL && maxnode < MAX_NUMNODES)
MAX_NUMNODES     1210 mm/mempolicy.c 	DECLARE_BITMAP(bm, MAX_NUMNODES);
MAX_NUMNODES     1212 mm/mempolicy.c 	nr_bits = min_t(unsigned long, maxnode-1, MAX_NUMNODES);
MAX_NUMNODES     1236 mm/mempolicy.c 	DECLARE_BITMAP(bm, MAX_NUMNODES);
MAX_NUMNODES     1238 mm/mempolicy.c 	nr_bits = min_t(unsigned long, maxnode-1, MAX_NUMNODES);
MAX_NUMNODES     1262 mm/mempolicy.c 	nr_bits = min_t(unsigned long, maxnode-1, MAX_NUMNODES);
MAX_NUMNODES     1366 mm/mempolicy.c 	if (next >= MAX_NUMNODES)
MAX_NUMNODES     1368 mm/mempolicy.c 	if (next < MAX_NUMNODES)
MAX_NUMNODES     2185 mm/mempolicy.c 	unsigned long node[MAX_NUMNODES];
MAX_NUMNODES      845 mm/migrate.c   	while (pm->node != MAX_NUMNODES && pm->page != p)
MAX_NUMNODES      848 mm/migrate.c   	if (pm->node == MAX_NUMNODES)
MAX_NUMNODES      875 mm/migrate.c   	for (pp = pm; pp->node != MAX_NUMNODES; pp++) {
MAX_NUMNODES      948 mm/migrate.c   	for ( ; pm->node != MAX_NUMNODES; pm++) {
MAX_NUMNODES     1077 mm/migrate.c   	pm[nr_pages].node = MAX_NUMNODES;
MAX_NUMNODES       21 mm/mmzone.c    	if (nid == MAX_NUMNODES)
MAX_NUMNODES      139 mm/page_alloc.c     #if MAX_NUMNODES >= 32
MAX_NUMNODES      141 mm/page_alloc.c       #define MAX_ACTIVE_REGIONS (MAX_NUMNODES*50)
MAX_NUMNODES      153 mm/page_alloc.c   static unsigned long __meminitdata node_boundary_start_pfn[MAX_NUMNODES];
MAX_NUMNODES      154 mm/page_alloc.c   static unsigned long __meminitdata node_boundary_end_pfn[MAX_NUMNODES];
MAX_NUMNODES      158 mm/page_alloc.c   static unsigned long __meminitdata zone_movable_pfn[MAX_NUMNODES];
MAX_NUMNODES      165 mm/page_alloc.c #if MAX_NUMNODES > 1
MAX_NUMNODES      166 mm/page_alloc.c int nr_node_ids __read_mostly = MAX_NUMNODES;
MAX_NUMNODES     2065 mm/page_alloc.c static int node_load[MAX_NUMNODES];
MAX_NUMNODES     2112 mm/page_alloc.c 		val *= (MAX_NODE_LOAD*MAX_NUMNODES);
MAX_NUMNODES     2167 mm/page_alloc.c static int node_order[MAX_NUMNODES];
MAX_NUMNODES     2356 mm/page_alloc.c 	for (node = local_node + 1; node < MAX_NUMNODES; node++) {
MAX_NUMNODES     2912 mm/page_alloc.c 		if (nid == MAX_NUMNODES || early_node_map[i].nid == nid)
MAX_NUMNODES     2925 mm/page_alloc.c 		if (nid == MAX_NUMNODES || early_node_map[index].nid == nid)
MAX_NUMNODES     3256 mm/page_alloc.c 	return __absent_pages_in_range(MAX_NUMNODES, start_pfn, end_pfn);
MAX_NUMNODES     3549 mm/page_alloc.c #if MAX_NUMNODES > 1
MAX_NUMNODES     3763 mm/page_alloc.c 	return find_min_pfn_for_node(MAX_NUMNODES);
MAX_NUMNODES     3920 mm/page_alloc.c 	for (nid = 0; nid < MAX_NUMNODES; nid++)
MAX_NUMNODES     3995 mm/page_alloc.c 	for (i = 0; i < MAX_NUMNODES; i++) {
MAX_NUMNODES      306 mm/slab.c      #define NUM_INIT_LISTS (3 * MAX_NUMNODES)
MAX_NUMNODES      309 mm/slab.c      #define	SIZE_AC MAX_NUMNODES
MAX_NUMNODES      310 mm/slab.c      #define	SIZE_L3 (2 * MAX_NUMNODES)
MAX_NUMNODES      449 mm/slab.c      	struct kmem_list3 *nodelists[MAX_NUMNODES];
MAX_NUMNODES      905 mm/slab.c      	if (node == MAX_NUMNODES)
MAX_NUMNODES      916 mm/slab.c      	if (unlikely(node >= MAX_NUMNODES))
MAX_NUMNODES     1443 mm/slab.c      		if (i < MAX_NUMNODES)
MAX_NUMNODES       36 mm/sparse.c    #if MAX_NUMNODES <= 256