On Sun, Jan 15, 2017 at 01:10:47PM -0800, Luis R. Rodriguez wrote: > A linker table is a data structure that is stitched together from items > in multiple object files. Linux has historically implicitly used linker > tables for ages, however they were all built in an adhoc manner which > requires linker script modifications, per architecture. This adds a > general linker table solution so that a new linker table can be > implemented by changing C code only. The Linux linker table was > inspired by Michael Brown's iPXE's linker table solution, it has been > been completely re-written and adapted for integration and use on Linux. Ok, I understand that, but then you say: > The same philosophy is borrowed, extended and further simplified: This line made no sense :( > Linker tables enable an extremely light weight linker build time > solution for feature ordering and selection, this can help to both > simplify init sequences in a generic fashion and helps avoiding code > bit-rotting when desirable. Further changes will be added later > which will make more evident how code bit rot can be avoided using > linker tables. I have no idea why this is needed, nor what it means. I fail to understand the bit-rot reference. thanks, greg k-h -- To unsubscribe from this list: send the line "unsubscribe linux-arch" in the body of a message to majordomo@xxxxxxxxxxxxxxx More majordomo info at http://vger.kernel.org/majordomo-info.html
