On 17/12/06, Ingo Molnar <[email protected]> wrote:
* Catalin Marinas <[email protected]> wrote:
> Do you need these fixes to avoid a compiler error? If yes, this is
> caused by a bug in gcc-4.x. The kmemleak container_of macro has
> protection for non-constant offsets passed to container_of but the
> faulty gcc always returns true for builtin_contant_p, even when this
> is not the case. Previous versions (3.4) or one of the latest 4.x gcc
> don't have this bug.
correct, i needed it for gcc 4.0.2. If you want this feature upstream,
this has to be solved - no way are we going to phase out portions of
gcc4. It's not hard as you can see it from my patch, non-static
container_of is very rare. We do alot of other hackery to keep older
compilers alive, and we only drop compiler support if some important
feature really, really needs new gcc and a sane workaround is not
possible.
There might be a simpler solution (haven't tried it), just before your
compilation error line:
#undef container_of
#define container_of(...) __container_of(...)
I could add some meaningful macros that eliminate the use of the
non-constant offset to make this more obvious.
> In the -rt kernel, is there any protection against a re-entrant
> __cache_free (via cache_flusharray -> free_block -> slab_destroy) or
> this is not needed?
the problem on -rt is the per-CPU slab buffer handling. In vanilla they
are handled with irqs off/on - but inside is an unbound algorithm so for
-rt i converted the local_irq_disable() logic to per-CPU locks. So this
is an -rt only problem.
hm, even on vanilla you might run into problems in slab_destroy(), there
we hold the l3 lock.
It seems that slab_destroy doesn't take the l3 lock again if it is
already held, otherwise it would fail without kmemleak. However, I
can't guarantee that even a minor change wouldn't break kmemleak.
> There are also the memleak_object structures that need to be
> allocated/freed. To avoid any locking dependencies, I ended up
> delaying the memleak_object structures freeing in an RCU manner. It
> might work if I do the same with the hash nodes.
yeah, delayed RCU freeing might work better.
I could also use a simple allocator based on alloc_pages since
kmemleak doesn't track pages. It could be so simple that it would
never need to free any pages, just grow the size as required and reuse
the freed memleak objects from a list.
This would simplify the recursiveness and also work on any other slab
allocator (looking back at the amount of time I spend to sort out the
recursiveness and locking dependencies, I could've implemented a full
allocator).
I'll try to implement your other suggestions as well. Thanks.
--
Catalin
-
To unsubscribe from this list: send the line "unsubscribe linux-kernel" in
the body of a message to [email protected]
More majordomo info at http://vger.kernel.org/majordomo-info.html
Please read the FAQ at http://www.tux.org/lkml/
[Index of Archives]
[Kernel Newbies]
[Netfilter]
[Bugtraq]
[Photo]
[Stuff]
[Gimp]
[Yosemite News]
[MIPS Linux]
[ARM Linux]
[Linux Security]
[Linux RAID]
[Video 4 Linux]
[Linux for the blind]
[Linux Resources]
