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 pfn_to_page(pfn) \
26 unsigned long __pfn = pfn; \
27 int __node = pfn_to_nid(__pfn); \
28 &NODE_DATA(__node)->node_mem_map[node_localnr(__pfn,__node)]; \
31 #define page_to_pfn(pg) \
33 struct page *__page = pg; \
34 struct zone *__zone = page_zone(__page); \
35 (unsigned long)(__page - __zone->zone_mem_map) \
36 + __zone->zone_start_pfn; \
38 #define pmd_page(pmd) (pfn_to_page(pmd_val(pmd) >> PAGE_SHIFT))
40 * pfn_valid should be made as fast as possible, and the current definition
41 * is valid for machines that are NUMA, but still contiguous, which is what
42 * is currently supported. A more generalised, but slower definition would
43 * be something like this - mbligh:
44 * ( pfn_to_pgdat(pfn) && ((pfn) < node_end_pfn(pfn_to_nid(pfn))) )
46 #if 1 /* M32R_FIXME */
47 #define pfn_valid(pfn) (1)
49 #define pfn_valid(pfn) ((pfn) < num_physpages)
53 * generic node memory support, the following assumptions apply:
56 static __inline__
int pfn_to_nid(unsigned long pfn
)
60 for (node
= 0 ; node
< MAX_NUMNODES
; node
++)
61 if (pfn
>= node_start_pfn(node
) && pfn
<= node_end_pfn(node
))
67 static __inline__
struct pglist_data
*pfn_to_pgdat(unsigned long pfn
)
69 return(NODE_DATA(pfn_to_nid(pfn
)));
72 #endif /* CONFIG_DISCONTIGMEM */
73 #endif /* _ASM_MMZONE_H_ */