2 * Written by Pat Gaughen (gone@us.ibm.com) Mar 2002
11 #ifdef CONFIG_DISCONTIGMEM
13 extern struct pglist_data *node_data[];
14 #define NODE_DATA(nid) (node_data[nid])
16 #define node_localnr(pfn, nid) ((pfn) - NODE_DATA(nid)->node_start_pfn)
17 #define node_start_pfn(nid) (NODE_DATA(nid)->node_start_pfn)
18 #define node_end_pfn(nid) \
20 pg_data_t *__pgdat = NODE_DATA(nid); \
21 __pgdat->node_start_pfn + __pgdat->node_spanned_pages - 1; \
24 #define pmd_page(pmd) (pfn_to_page(pmd_val(pmd) >> PAGE_SHIFT))
26 * pfn_valid should be made as fast as possible, and the current definition
27 * is valid for machines that are NUMA, but still contiguous, which is what
28 * is currently supported. A more generalised, but slower definition would
29 * be something like this - mbligh:
30 * ( pfn_to_pgdat(pfn) && ((pfn) < node_end_pfn(pfn_to_nid(pfn))) )
32 #if 1 /* M32R_FIXME */
33 #define pfn_valid(pfn) (1)
35 #define pfn_valid(pfn) ((pfn) < num_physpages)
39 * generic node memory support, the following assumptions apply:
42 static __inline__ int pfn_to_nid(unsigned long pfn)
46 for (node = 0 ; node < MAX_NUMNODES ; node++)
47 if (pfn >= node_start_pfn(node) && pfn <= node_end_pfn(node))
53 static __inline__ struct pglist_data *pfn_to_pgdat(unsigned long pfn)
55 return(NODE_DATA(pfn_to_nid(pfn)));
58 #endif /* CONFIG_DISCONTIGMEM */
59 #endif /* _ASM_MMZONE_H_ */