f6bb2a2c0b
This results in no change in structure size on 64-bit machines as it fits in the padding between the gfp_t and the void *. 32-bit machines will grow the structure from 8 to 12 bytes. Almost all radix trees are protected with (at least) a spinlock, so as they are converted from radix trees to xarrays, the data structures will shrink again. Initialising the spinlock requires a name for the benefit of lockdep, so RADIX_TREE_INIT() now needs to know the name of the radix tree it's initialising, and so do IDR_INIT() and IDA_INIT(). Also add the xa_lock() and xa_unlock() family of wrappers to make it easier to use the lock. If we could rely on -fplan9-extensions in the compiler, we could avoid all of this syntactic sugar, but that wasn't added until gcc 4.6. Link: http://lkml.kernel.org/r/20180313132639.17387-8-willy@infradead.org Signed-off-by: Matthew Wilcox <mawilcox@microsoft.com> Reviewed-by: Jeff Layton <jlayton@kernel.org> Cc: Darrick J. Wong <darrick.wong@oracle.com> Cc: Dave Chinner <david@fromorbit.com> Cc: Ryusuke Konishi <konishi.ryusuke@lab.ntt.co.jp> Cc: Will Deacon <will.deacon@arm.com> Signed-off-by: Andrew Morton <akpm@linux-foundation.org> Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org> |
||
|---|---|---|
| .. | ||
| sched | ||
| unaligned | ||
| atomic.h | ||
| bitmap.h | ||
| bitops.h | ||
| bug.h | ||
| compiler-gcc.h | ||
| compiler.h | ||
| coresight-pmu.h | ||
| debug_locks.h | ||
| delay.h | ||
| err.h | ||
| export.h | ||
| filter.h | ||
| ftrace.h | ||
| gfp.h | ||
| hardirq.h | ||
| hash.h | ||
| hashtable.h | ||
| interrupt.h | ||
| irqflags.h | ||
| jhash.h | ||
| kallsyms.h | ||
| kern_levels.h | ||
| kernel.h | ||
| linkage.h | ||
| list.h | ||
| lockdep.h | ||
| log2.h | ||
| module.h | ||
| mutex.h | ||
| poison.h | ||
| proc_fs.h | ||
| rbtree_augmented.h | ||
| rbtree.h | ||
| rcu.h | ||
| refcount.h | ||
| seq_file.h | ||
| spinlock.h | ||
| stacktrace.h | ||
| string.h | ||
| stringify.h | ||
| time64.h | ||
| types.h | ||