forked from Minki/linux
82 lines
2.3 KiB
C
82 lines
2.3 KiB
C
|
/*
|
||
|
|
* Copyright 2010 Tilera Corporation. All Rights Reserved.
|
||
|
|
*
|
||
|
|
* This program is free software; you can redistribute it and/or
|
||
|
|
* modify it under the terms of the GNU General Public License
|
||
|
|
* as published by the Free Software Foundation, version 2.
|
||
|
|
*
|
||
|
|
* This program is distributed in the hope that it will be useful, but
|
||
|
|
* WITHOUT ANY WARRANTY; without even the implied warranty of
|
||
|
|
* MERCHANTABILITY OR FITNESS FOR A PARTICULAR PURPOSE, GOOD TITLE or
|
||
|
|
* NON INFRINGEMENT. See the GNU General Public License for
|
||
|
|
* more details.
|
||
|
|
*/
|
||
|
|
|
||
|
|
#ifndef _ASM_TILE_MMZONE_H
|
||
|
|
#define _ASM_TILE_MMZONE_H
|
||
|
|
|
||
|
|
extern struct pglist_data node_data[];
|
||
|
|
#define NODE_DATA(nid) (&node_data[nid])
|
||
|
|
|
||
|
|
extern void get_memcfg_numa(void);
|
||
|
|
|
||
|
|
#ifdef CONFIG_DISCONTIGMEM
|
||
|
|
|
||
|
|
#include <asm/page.h>
|
||
|
|
|
||
|
|
/*
|
||
|
|
* Generally, memory ranges are always doled out by the hypervisor in
|
||
|
|
* fixed-size, power-of-two increments. That would make computing the node
|
||
|
|
* very easy. We could just take a couple high bits of the PA, which
|
||
|
|
* denote the memory shim, and we'd be done. However, when we're doing
|
||
|
|
* memory striping, this may not be true; PAs with different high bit
|
||
|
|
* values might be in the same node. Thus, we keep a lookup table to
|
||
|
|
* translate the high bits of the PFN to the node number.
|
||
|
|
*/
|
||
|
|
extern int highbits_to_node[];
|
||
|
|
|
||
|
|
static inline int pfn_to_nid(unsigned long pfn)
|
||
|
|
{
|
||
|
|
return highbits_to_node[__pfn_to_highbits(pfn)];
|
||
|
|
}
|
||
|
|
|
||
|
|
/*
|
||
|
|
* Following are macros that each numa implmentation must define.
|
||
|
|
*/
|
||
|
|
|
||
|
|
#define node_start_pfn(nid) (NODE_DATA(nid)->node_start_pfn)
|
||
|
|
#define node_end_pfn(nid) \
|
||
|
|
({ \
|
||
|
|
pg_data_t *__pgdat = NODE_DATA(nid); \
|
||
|
|
__pgdat->node_start_pfn + __pgdat->node_spanned_pages; \
|
||
|
|
})
|
||
|
|
|
||
|
|
#define kern_addr_valid(kaddr) virt_addr_valid((void *)kaddr)
|
||
|
|
|
||
|
|
static inline int pfn_valid(int pfn)
|
||
|
|
{
|
||
|
|
int nid = pfn_to_nid(pfn);
|
||
|
|
|
||
|
|
if (nid >= 0)
|
||
|
|
return (pfn < node_end_pfn(nid));
|
||
|
|
return 0;
|
||
|
|
}
|
||
|
|
|
||
|
|
/* Information on the NUMA nodes that we compute early */
|
||
|
|
extern unsigned long node_start_pfn[];
|
||
|
|
extern unsigned long node_end_pfn[];
|
||
|
|
extern unsigned long node_memmap_pfn[];
|
||
|
|
extern unsigned long node_percpu_pfn[];
|
||
|
|
extern unsigned long node_free_pfn[];
|
||
|
|
#ifdef CONFIG_HIGHMEM
|
||
|
|
extern unsigned long node_lowmem_end_pfn[];
|
||
|
|
#endif
|
||
|
|
#ifdef CONFIG_PCI
|
||
|
|
extern unsigned long pci_reserve_start_pfn;
|
||
|
|
extern unsigned long pci_reserve_end_pfn;
|
||
|
|
#endif
|
||
|
|
|
||
|
|
#endif /* CONFIG_DISCONTIGMEM */
|
||
|
|
|
||
|
|
#endif /* _ASM_TILE_MMZONE_H */
|