2007-10-11 11:14:21 +02:00
/ * ld s c r i p t t o m a k e x86 - 6 4 L i n u x k e r n e l
* Written b y M a r t i n M a r e s < m j @atrey.karlin.mff.cuni.cz>;
* /
# define L O A D _ O F F S E T _ _ S T A R T _ K E R N E L _ m a p
# include < a s m - g e n e r i c / v m l i n u x . l d s . h >
2009-01-13 20:41:35 +09:00
# include < a s m / a s m - o f f s e t s . h >
2009-02-13 11:14:01 -08:00
# include < a s m / p a g e _ t y p e s . h >
2007-10-11 11:14:21 +02:00
# undef i 3 8 6 / * i n c a s e t h e p r e p r o c e s s o r i s a 3 2 b i t o n e * /
OUTPUT_ F O R M A T ( " e l f64 - x86 - 6 4 " , " e l f64 - x86 - 6 4 " , " e l f64 - x86 - 6 4 " )
OUTPUT_ A R C H ( i 3 8 6 : x86 - 6 4 )
ENTRY( p h y s _ s t a r t u p _ 6 4 )
jiffies_ 6 4 = j i f f i e s ;
PHDRS {
text P T _ L O A D F L A G S ( 5 ) ; /* R_E */
data P T _ L O A D F L A G S ( 7 ) ; /* RWE */
user P T _ L O A D F L A G S ( 7 ) ; /* RWE */
data. i n i t P T _ L O A D F L A G S ( 7 ) ; /* RWE */
2009-01-13 20:41:35 +09:00
# ifdef C O N F I G _ S M P
percpu P T _ L O A D F L A G S ( 7 ) ; /* RWE */
# endif
2009-02-02 18:16:19 -08:00
data. i n i t 2 P T _ L O A D F L A G S ( 7 ) ; /* RWE */
2008-05-12 15:44:41 +02:00
note P T _ N O T E F L A G S ( 0 ) ; /* ___ */
2007-10-11 11:14:21 +02:00
}
SECTIONS
{
. = _ _ START_ K E R N E L ;
phys_ s t a r t u p _ 6 4 = s t a r t u p _ 6 4 - L O A D _ O F F S E T ;
.text : AT( A D D R ( . t e x t ) - L O A D _ O F F S E T ) {
2009-03-10 11:19:18 -07:00
_ text = . ; /* Text and read-only data */
2007-10-11 11:14:21 +02:00
/* First the code that has to be first for bootstrapping */
* ( .text .head )
_ stext = . ;
/* Then the rest */
TEXT_ T E X T
SCHED_ T E X T
LOCK_ T E X T
KPROBES_ T E X T
2008-12-09 23:53:16 +01:00
IRQENTRY_ T E X T
2007-10-11 11:14:21 +02:00
* ( .fixup )
* ( .gnu .warning )
2008-02-17 18:17:17 +03:00
_ etext = . ; /* End of text section */
2008-01-30 13:33:14 +01:00
} : text = 0 x90 9 0
2007-10-11 11:14:21 +02:00
2008-05-12 15:44:41 +02:00
NOTES : t e x t : n o t e
2007-10-11 11:14:21 +02:00
. = ALIGN( 1 6 ) ; /* Exception table */
2008-01-30 13:33:14 +01:00
_ _ ex_ t a b l e : A T ( A D D R ( _ _ e x _ t a b l e ) - L O A D _ O F F S E T ) {
_ _ start_ _ _ e x _ t a b l e = . ;
* ( _ _ ex_ t a b l e )
_ _ stop_ _ _ e x _ t a b l e = . ;
2008-05-12 15:44:41 +02:00
} : text = 0 x90 9 0
2007-10-11 11:14:21 +02:00
RODATA
2008-02-17 18:17:17 +03:00
. = ALIGN( P A G E _ S I Z E ) ; /* Align data segment to page size boundary */
2007-10-11 11:14:21 +02:00
/* Data */
.data : AT( A D D R ( . d a t a ) - L O A D _ O F F S E T ) {
DATA_ D A T A
CONSTRUCTORS
2009-03-10 11:19:18 -07:00
_ edata = . ; /* End of data section */
2007-10-11 11:14:21 +02:00
} : data
.data .cacheline_aligned : AT( A D D R ( . d a t a . c a c h e l i n e _ a l i g n e d ) - L O A D _ O F F S E T ) {
2009-03-10 11:19:18 -07:00
. = ALIGN( P A G E _ S I Z E ) ;
. = ALIGN( C O N F I G _ X 8 6 _ L 1 _ C A C H E _ B Y T E S ) ;
2007-10-11 11:14:21 +02:00
* ( .data .cacheline_aligned )
}
. = ALIGN( C O N F I G _ X 8 6 _ I N T E R N O D E _ C A C H E _ B Y T E S ) ;
.data .read_mostly : AT( A D D R ( . d a t a . r e a d _ m o s t l y ) - L O A D _ O F F S E T ) {
* ( .data .read_mostly )
}
# define V S Y S C A L L _ A D D R ( - 1 0 * 1 0 2 4 * 1 0 2 4 )
# define V S Y S C A L L _ P H Y S _ A D D R ( ( L O A D A D D R ( . d a t a . r e a d _ m o s t l y ) + S I Z E O F ( . d a t a . r e a d _ m o s t l y ) + 4 0 9 5 ) & ~ ( 4 0 9 5 ) )
# define V S Y S C A L L _ V I R T _ A D D R ( ( A D D R ( . d a t a . r e a d _ m o s t l y ) + S I Z E O F ( . d a t a . r e a d _ m o s t l y ) + 4 0 9 5 ) & ~ ( 4 0 9 5 ) )
# define V L O A D _ O F F S E T ( V S Y S C A L L _ A D D R - V S Y S C A L L _ P H Y S _ A D D R )
# define V L O A D ( x ) ( A D D R ( x ) - V L O A D _ O F F S E T )
# define V V I R T _ O F F S E T ( V S Y S C A L L _ A D D R - V S Y S C A L L _ V I R T _ A D D R )
# define V V I R T ( x ) ( A D D R ( x ) - V V I R T _ O F F S E T )
. = VSYSCALL_ A D D R ;
.vsyscall_0 : AT( V S Y S C A L L _ P H Y S _ A D D R ) { * ( . v s y s c a l l _ 0 ) } : u s e r
_ _ vsyscall_ 0 = V S Y S C A L L _ V I R T _ A D D R ;
. = ALIGN( C O N F I G _ X 8 6 _ L 1 _ C A C H E _ B Y T E S ) ;
.vsyscall_fn : AT( V L O A D ( . v s y s c a l l _ f n ) ) { * ( . v s y s c a l l _ f n ) }
. = ALIGN( C O N F I G _ X 8 6 _ L 1 _ C A C H E _ B Y T E S ) ;
.vsyscall_gtod_data : AT( V L O A D ( . v s y s c a l l _ g t o d _ d a t a ) )
{ * ( .vsyscall_gtod_data ) }
vsyscall_ g t o d _ d a t a = V V I R T ( . v s y s c a l l _ g t o d _ d a t a ) ;
.vsyscall_clock : AT( V L O A D ( . v s y s c a l l _ c l o c k ) )
{ * ( .vsyscall_clock ) }
vsyscall_ c l o c k = V V I R T ( . v s y s c a l l _ c l o c k ) ;
.vsyscall_1 ADDR( . v s y s c a l l _ 0 ) + 1 0 2 4 : A T ( V L O A D ( . v s y s c a l l _ 1 ) )
{ * ( .vsyscall_1 ) }
.vsyscall_2 ADDR( . v s y s c a l l _ 0 ) + 2 0 4 8 : A T ( V L O A D ( . v s y s c a l l _ 2 ) )
{ * ( .vsyscall_2 ) }
.vgetcpu_mode : AT( V L O A D ( . v g e t c p u _ m o d e ) ) { * ( . v g e t c p u _ m o d e ) }
vgetcpu_ m o d e = V V I R T ( . v g e t c p u _ m o d e ) ;
. = ALIGN( C O N F I G _ X 8 6 _ L 1 _ C A C H E _ B Y T E S ) ;
.jiffies : AT( V L O A D ( . j i f f i e s ) ) { * ( . j i f f i e s ) }
jiffies = V V I R T ( . j i f f i e s ) ;
.vsyscall_3 ADDR( . v s y s c a l l _ 0 ) + 3 0 7 2 : A T ( V L O A D ( . v s y s c a l l _ 3 ) )
{ * ( .vsyscall_3 ) }
2008-02-17 18:17:17 +03:00
. = VSYSCALL_ V I R T _ A D D R + P A G E _ S I Z E ;
2007-10-11 11:14:21 +02:00
# undef V S Y S C A L L _ A D D R
# undef V S Y S C A L L _ P H Y S _ A D D R
# undef V S Y S C A L L _ V I R T _ A D D R
# undef V L O A D _ O F F S E T
# undef V L O A D
# undef V V I R T _ O F F S E T
# undef V V I R T
.data .init_task : AT( A D D R ( . d a t a . i n i t _ t a s k ) - L O A D _ O F F S E T ) {
2009-03-10 11:19:18 -07:00
. = ALIGN( T H R E A D _ S I Z E ) ; /* init_task */
2007-10-11 11:14:21 +02:00
* ( .data .init_task )
} : data. i n i t
.data .page_aligned : AT( A D D R ( . d a t a . p a g e _ a l i g n e d ) - L O A D _ O F F S E T ) {
2009-03-10 11:19:18 -07:00
. = ALIGN( P A G E _ S I Z E ) ;
2007-10-11 11:14:21 +02:00
* ( .data .page_aligned )
}
.smp_locks : AT( A D D R ( . s m p _ l o c k s ) - L O A D _ O F F S E T ) {
2009-03-10 11:19:18 -07:00
/* might get freed after init */
. = ALIGN( P A G E _ S I Z E ) ;
_ _ smp_ a l t _ b e g i n = . ;
_ _ smp_ l o c k s = . ;
2007-10-11 11:14:21 +02:00
* ( .smp_locks )
2009-03-10 11:19:18 -07:00
_ _ smp_ l o c k s _ e n d = . ;
. = ALIGN( P A G E _ S I Z E ) ;
_ _ smp_ a l t _ e n d = . ;
2007-10-11 11:14:21 +02:00
}
2008-02-17 18:17:17 +03:00
. = ALIGN( P A G E _ S I Z E ) ; /* Init code and data */
2009-03-10 11:19:18 -07:00
_ _ init_ b e g i n = . ; /* paired with __init_end */
2007-10-11 11:14:21 +02:00
.init .text : AT( A D D R ( . i n i t . t e x t ) - L O A D _ O F F S E T ) {
_ sinittext = . ;
2008-01-20 14:15:03 +01:00
INIT_ T E X T
2007-10-11 11:14:21 +02:00
_ einittext = . ;
}
2008-01-20 14:15:03 +01:00
.init .data : AT( A D D R ( . i n i t . d a t a ) - L O A D _ O F F S E T ) {
_ _ initdata_ b e g i n = . ;
INIT_ D A T A
_ _ initdata_ e n d = . ;
}
2009-03-10 11:19:18 -07:00
.init .setup : AT( A D D R ( . i n i t . s e t u p ) - L O A D _ O F F S E T ) {
. = ALIGN( 1 6 ) ;
_ _ setup_ s t a r t = . ;
* ( .init .setup )
_ _ setup_ e n d = . ;
}
2007-10-11 11:14:21 +02:00
.initcall .init : AT( A D D R ( . i n i t c a l l . i n i t ) - L O A D _ O F F S E T ) {
2009-03-10 11:19:18 -07:00
_ _ initcall_ s t a r t = . ;
2007-10-11 11:14:21 +02:00
INITCALLS
2009-03-10 11:19:18 -07:00
_ _ initcall_ e n d = . ;
2007-10-11 11:14:21 +02:00
}
.con_initcall .init : AT( A D D R ( . c o n _ i n i t c a l l . i n i t ) - L O A D _ O F F S E T ) {
2009-03-10 11:19:18 -07:00
_ _ con_ i n i t c a l l _ s t a r t = . ;
2007-10-11 11:14:21 +02:00
* ( .con_initcall .init )
2009-03-10 11:19:18 -07:00
_ _ con_ i n i t c a l l _ e n d = . ;
2007-10-11 11:14:21 +02:00
}
2008-09-04 21:09:45 +02:00
.x86_cpu_dev .init : AT( A D D R ( . x86 _ c p u _ d e v . i n i t ) - L O A D _ O F F S E T ) {
2009-03-10 11:19:18 -07:00
_ _ x8 6 _ c p u _ d e v _ s t a r t = . ;
2008-09-04 21:09:45 +02:00
* ( .x86_cpu_dev .init )
2009-03-10 11:19:18 -07:00
_ _ x8 6 _ c p u _ d e v _ e n d = . ;
x86: use ELF section to list CPU vendor specific code
Replace the hardcoded list of initialization functions for each CPU
vendor by a list in an ELF section, which is read at initialization in
arch/x86/kernel/cpu/cpu.c to fill the cpu_devs[] array. The ELF
section, named .x86cpuvendor.init, is reclaimed after boot, and
contains entries of type "struct cpu_vendor_dev" which associates a
vendor number with a pointer to a "struct cpu_dev" structure.
This first modification allows to remove all the VENDOR_init_cpu()
functions.
This patch also removes the hardcoded calls to early_init_amd() and
early_init_intel(). Instead, we add a "c_early_init" member to the
cpu_dev structure, which is then called if not NULL by the generic CPU
initialization code. Unfortunately, in early_cpu_detect(), this_cpu is
not yet set, so we have to use the cpu_devs[] array directly.
This patch is part of the Linux Tiny project, and is needed for
further patch that will allow to disable compilation of unused CPU
support code.
Signed-off-by: Thomas Petazzoni <thomas.petazzoni@free-electrons.com>
Signed-off-by: Ingo Molnar <mingo@elte.hu>
Signed-off-by: Thomas Gleixner <tglx@linutronix.de>
2008-02-15 12:00:23 +01:00
}
2008-10-12 10:51:03 +02:00
SECURITY_ I N I T
2008-01-30 13:33:19 +01:00
. = ALIGN( 8 ) ;
.parainstructions : AT( A D D R ( . p a r a i n s t r u c t i o n s ) - L O A D _ O F F S E T ) {
2009-03-10 11:19:18 -07:00
_ _ parainstructions = . ;
2008-01-30 13:33:19 +01:00
* ( .parainstructions )
2009-03-10 11:19:18 -07:00
_ _ parainstructions_ e n d = . ;
2008-01-30 13:33:19 +01:00
}
2007-10-11 11:14:21 +02:00
.altinstructions : AT( A D D R ( . a l t i n s t r u c t i o n s ) - L O A D _ O F F S E T ) {
2009-03-10 11:19:18 -07:00
. = ALIGN( 8 ) ;
_ _ alt_ i n s t r u c t i o n s = . ;
2007-10-11 11:14:21 +02:00
* ( .altinstructions )
2009-03-10 11:19:18 -07:00
_ _ alt_ i n s t r u c t i o n s _ e n d = . ;
2007-10-11 11:14:21 +02:00
}
.altinstr_replacement : AT( A D D R ( . a l t i n s t r _ r e p l a c e m e n t ) - L O A D _ O F F S E T ) {
* ( .altinstr_replacement )
}
/ * .exit .text is discard a t r u n t i m e , n o t l i n k t i m e , t o d e a l w i t h r e f e r e n c e s
from . a l t i n s t r u c t i o n s a n d . e h _ f r a m e * /
2008-01-20 14:15:03 +01:00
.exit .text : AT( A D D R ( . e x i t . t e x t ) - L O A D _ O F F S E T ) {
EXIT_ T E X T
}
.exit .data : AT( A D D R ( . e x i t . d a t a ) - L O A D _ O F F S E T ) {
EXIT_ D A T A
}
2007-10-11 11:14:21 +02:00
# ifdef C O N F I G _ B L K _ D E V _ I N I T R D
2008-02-17 18:17:17 +03:00
. = ALIGN( P A G E _ S I Z E ) ;
2009-03-10 11:19:18 -07:00
.init .ramfs : AT( A D D R ( . i n i t . r a m f s ) - L O A D _ O F F S E T ) {
_ _ initramfs_ s t a r t = . ;
* ( .init .ramfs )
_ _ initramfs_ e n d = . ;
}
2007-10-11 11:14:21 +02:00
# endif
2009-01-13 20:41:35 +09:00
# ifdef C O N F I G _ S M P
/ *
* percpu o f f s e t s a r e z e r o - b a s e d o n S M P . P E R C P U _ V A D D R ( ) c h a n g e s t h e
* output P H D R , s o t h e n e x t o u t p u t s e c t i o n - _ _ d a t a _ n o s a v e - s h o u l d
2009-02-02 18:16:19 -08:00
* start a n o t h e r s e c t i o n d a t a . i n i t 2 . A l s o , p d a s h o u l d b e a t t h e h e a d o f
2009-01-13 20:41:35 +09:00
* percpu a r e a . P r e a l l o c a t e i t a n d d e f i n e t h e p e r c p u o f f s e t s y m b o l
* so t h a t i t c a n b e a c c e s s e d a s a p e r c p u v a r i a b l e .
2009-01-13 20:41:35 +09:00
* /
. = ALIGN( P A G E _ S I Z E ) ;
2009-01-19 12:21:28 +09:00
PERCPU_ V A D D R ( 0 , : p e r c p u )
2009-01-13 20:41:35 +09:00
# else
2008-02-17 18:17:17 +03:00
PERCPU( P A G E _ S I Z E )
2009-01-13 20:41:35 +09:00
# endif
2007-10-11 11:14:21 +02:00
2008-02-17 18:17:17 +03:00
. = ALIGN( P A G E _ S I Z E ) ;
2007-10-11 11:14:21 +02:00
_ _ init_ e n d = . ;
2009-01-13 20:41:35 +09:00
.data_nosave : AT( A D D R ( . d a t a _ n o s a v e ) - L O A D _ O F F S E T ) {
2009-03-10 11:19:18 -07:00
. = ALIGN( P A G E _ S I Z E ) ;
_ _ nosave_ b e g i n = . ;
* ( .data .nosave )
. = ALIGN( P A G E _ S I Z E ) ;
_ _ nosave_ e n d = . ;
2009-02-02 18:16:19 -08:00
} : data. i n i t 2 / * u s e a n o t h e r s e c t i o n d a t a . i n i t 2 , s e e P E R C P U _ V A D D R ( ) a b o v e * /
2007-10-11 11:14:21 +02:00
.bss : AT( A D D R ( . b s s ) - L O A D _ O F F S E T ) {
2009-03-10 11:19:18 -07:00
. = ALIGN( P A G E _ S I Z E ) ;
_ _ bss_ s t a r t = . ; /* BSS */
2007-10-11 11:14:21 +02:00
* ( .bss .page_aligned )
* ( .bss )
2009-03-10 11:19:18 -07:00
_ _ bss_ s t o p = . ;
2009-03-14 23:20:47 -07:00
}
x86: add brk allocation for very, very early allocations
Impact: new interface
Add a brk()-like allocator which effectively extends the bss in order
to allow very early code to do dynamic allocations. This is better than
using statically allocated arrays for data in subsystems which may never
get used.
The space for brk allocations is in the bss ELF segment, so that the
space is mapped properly by the code which maps the kernel, and so
that bootloaders keep the space free rather than putting a ramdisk or
something into it.
The bss itself, delimited by __bss_stop, ends before the brk area
(__brk_base to __brk_limit). The kernel text, data and bss is reserved
up to __bss_stop.
Any brk-allocated data is reserved separately just before the kernel
pagetable is built, as that code allocates from unreserved spaces
in the e820 map, potentially allocating from any unused brk memory.
Ultimately any unused memory in the brk area is used in the general
kernel memory pool.
Initially the brk space is set to 1MB, which is probably much larger
than any user needs (the largest current user is i386 head_32.S's code
to build the pagetables to map the kernel, which can get fairly large
with a big kernel image and no PSE support). So long as the system
has sufficient memory for the bootloader to reserve the kernel+1MB brk,
there are no bad effects resulting from an over-large brk.
Signed-off-by: Jeremy Fitzhardinge <jeremy.fitzhardinge@citrix.com>
Signed-off-by: H. Peter Anvin <hpa@zytor.com>
2009-02-26 17:35:44 -08:00
2009-03-14 23:20:47 -07:00
.brk : AT( A D D R ( . b r k ) - L O A D _ O F F S E T ) {
x86: add brk allocation for very, very early allocations
Impact: new interface
Add a brk()-like allocator which effectively extends the bss in order
to allow very early code to do dynamic allocations. This is better than
using statically allocated arrays for data in subsystems which may never
get used.
The space for brk allocations is in the bss ELF segment, so that the
space is mapped properly by the code which maps the kernel, and so
that bootloaders keep the space free rather than putting a ramdisk or
something into it.
The bss itself, delimited by __bss_stop, ends before the brk area
(__brk_base to __brk_limit). The kernel text, data and bss is reserved
up to __bss_stop.
Any brk-allocated data is reserved separately just before the kernel
pagetable is built, as that code allocates from unreserved spaces
in the e820 map, potentially allocating from any unused brk memory.
Ultimately any unused memory in the brk area is used in the general
kernel memory pool.
Initially the brk space is set to 1MB, which is probably much larger
than any user needs (the largest current user is i386 head_32.S's code
to build the pagetables to map the kernel, which can get fairly large
with a big kernel image and no PSE support). So long as the system
has sufficient memory for the bootloader to reserve the kernel+1MB brk,
there are no bad effects resulting from an over-large brk.
Signed-off-by: Jeremy Fitzhardinge <jeremy.fitzhardinge@citrix.com>
Signed-off-by: H. Peter Anvin <hpa@zytor.com>
2009-02-26 17:35:44 -08:00
. = ALIGN( P A G E _ S I Z E ) ;
_ _ brk_ b a s e = . ;
2009-03-14 23:20:47 -07:00
. + = 6 4 * 1 0 2 4 ; /* 64k alignment slop space */
2009-03-12 16:09:49 -07:00
* ( .brk_reservation ) /* areas brk users have reserved */
x86: add brk allocation for very, very early allocations
Impact: new interface
Add a brk()-like allocator which effectively extends the bss in order
to allow very early code to do dynamic allocations. This is better than
using statically allocated arrays for data in subsystems which may never
get used.
The space for brk allocations is in the bss ELF segment, so that the
space is mapped properly by the code which maps the kernel, and so
that bootloaders keep the space free rather than putting a ramdisk or
something into it.
The bss itself, delimited by __bss_stop, ends before the brk area
(__brk_base to __brk_limit). The kernel text, data and bss is reserved
up to __bss_stop.
Any brk-allocated data is reserved separately just before the kernel
pagetable is built, as that code allocates from unreserved spaces
in the e820 map, potentially allocating from any unused brk memory.
Ultimately any unused memory in the brk area is used in the general
kernel memory pool.
Initially the brk space is set to 1MB, which is probably much larger
than any user needs (the largest current user is i386 head_32.S's code
to build the pagetables to map the kernel, which can get fairly large
with a big kernel image and no PSE support). So long as the system
has sufficient memory for the bootloader to reserve the kernel+1MB brk,
there are no bad effects resulting from an over-large brk.
Signed-off-by: Jeremy Fitzhardinge <jeremy.fitzhardinge@citrix.com>
Signed-off-by: H. Peter Anvin <hpa@zytor.com>
2009-02-26 17:35:44 -08:00
_ _ brk_ l i m i t = . ;
2009-03-10 11:19:18 -07:00
}
2007-10-11 11:14:21 +02:00
_ end = . ;
/* Sections to be discarded */
/ DISCARD/ : {
* ( .exitcall .exit )
* ( .eh_frame )
2009-03-12 16:09:49 -07:00
* ( .discard )
2007-10-11 11:14:21 +02:00
}
STABS_ D E B U G
DWARF_ D E B U G
}
2008-02-21 13:45:16 +01:00
2009-02-08 09:58:39 -05:00
/ *
* Per- c p u s y m b o l s w h i c h n e e d t o b e o f f s e t f r o m _ _ p e r _ c p u _ l o a d
* for t h e b o o t p r o c e s s o r .
* /
# define I N I T _ P E R _ C P U ( x ) i n i t _ p e r _ c p u _ _ ## x = p e r _ c p u _ _ # # x + _ _ p e r _ c p u _ l o a d
INIT_ P E R _ C P U ( g d t _ p a g e ) ;
INIT_ P E R _ C P U ( i r q _ s t a c k _ u n i o n ) ;
2008-02-21 13:45:16 +01:00
/ *
* Build- t i m e c h e c k o n t h e i m a g e s i z e :
* /
ASSERT( ( _ e n d - _ t e x t < = K E R N E L _ I M A G E _ S I Z E ) ,
" kernel i m a g e b i g g e r t h a n K E R N E L _ I M A G E _ S I Z E " )
2009-01-19 12:21:28 +09:00
# ifdef C O N F I G _ S M P
ASSERT( ( p e r _ c p u _ _ i r q _ s t a c k _ u n i o n = = 0 ) ,
" irq_ s t a c k _ u n i o n i s n o t a t s t a r t o f p e r - c p u a r e a " ) ;
# endif
2009-03-10 10:57:16 +08:00
# ifdef C O N F I G _ K E X E C
# include < a s m / k e x e c . h >
ASSERT( k e x e c _ c o n t r o l _ c o d e _ s i z e < = K E X E C _ C O N T R O L _ C O D E _ M A X _ S I Z E ,
" kexec c o n t r o l c o d e s i z e i s t o o b i g " )
# endif