Re: [Ltp-coverage] 2.5.67-gcov and 2.4.20-gcov

[Jörn Engel]

On Fri, 18 April 2003 09:07:58 +1000, Paul Mackerras wrote:
> J�örn Engel writes:
> 
> > The bit in arch/ppc/kernel/entry.S was necessary for me to compile
> > this for a ppc 405gp based system, gcov would grow the kernel beyond
> > the relative jump distance for "bnel syscall_trace".
> > 
> > Paulus, Ben, is the relative jump a wanted optimization or unclean
> > code that went unnoticed so far? IOW should this go into mainline or
> > remain part of the gcov patch?
> 
> What's unclean about bnel?

Nothing, as long as it works. But the jump target may only be 1<<13
bytes away. With gcov, it is further. syscall_trace is in a different
source file, so the distance can grow quite large.

> I think ret_from_fork would be better like this:
> 
> 	.globl	ret_from_fork
> ret_from_fork:
> 	bl	schedule_tail
> 	lwz	r0,TASK_PTRACE(r2)
> 	andi.	r0,r0,PT_TRACESYS
> 	beq+	ret_from_except
> 	bl	syscall_trace
> 	b	ret_from_except
> 
> Unless of course you have bloated the kernel beyond 32MB, but then we
> would be in all sorts of difficulties.

Does bl leave 25 bits for the jump target? I don't have a ppc manual
or test hardware with me over the holidays. Will check next week.

32MB sounds quite sufficient. My current record is 28MB for vmlinux on
i386, after allyesconfig basically. This is for statical analysis
only, I would think about booting such a monster.

> > +.section ".ctors","aw"
> > +.globl  __CTOR_LIST__
> > +.type   __CTOR_LIST__,@object
> > +__CTOR_LIST__:
> > +.section ".dtors","aw"
> > +.globl  __DTOR_LIST__
> > +.type   __DTOR_LIST__,@object
> > +__DTOR_LIST__:
> 
> Can't you do this in arch/ppc/vmlinux.lds using PROVIDE() instead of
> making the same change to each of the head*.S files?

Maybe, but why bother. As long as the patch doesn't go into mainline,
the change is identical for arch/*/kernel/head*.S, which is easy to
understand.

If you think it would still be nicer, I will do the change.

Jörn

-- 
Data dominates. If you've chosen the right data structures and organized
things well, the algorithms will almost always be self-evident. Data
structures, not algorithms, are central to programming.
-- Rob Pike