aboutsummaryrefslogtreecommitdiffstats
path: root/net/lapb/lapb_timer.c
diff options
context:
space:
mode:
authorLinus Torvalds <torvalds@linux-foundation.org>2018-06-10 12:44:53 -0400
committerLinus Torvalds <torvalds@linux-foundation.org>2018-06-10 12:44:53 -0400
commitf4e5b30d809d3882c69f43b5c90779af033d40c4 (patch)
tree1b8e67b40d348bfea17e827cedf0fd9101b5536a /net/lapb/lapb_timer.c
parenta2211de0f979aa83e9008fd04f39ea5f63473154 (diff)
parent1d9f3e20a56d33e55748552aeec597f58542f92d (diff)
Merge branch 'x86-urgent-for-linus' of git://git.kernel.org/pub/scm/linux/kernel/git/tip/tip
Pull x86 updates and fixes from Thomas Gleixner: - Fix the (late) fallout from the vector management rework causing hlist corruption and irq descriptor reference leaks caused by a missing sanity check. The straight forward fix triggered another long standing issue to surface. The pre rework code hid the issue due to being way slower, but now the chance that user space sees an EBUSY error return when updating irq affinities is way higher, though quite a bunch of userspace tools do not handle it properly despite the fact that EBUSY could be returned for at least 10 years. It turned out that the EBUSY return can be avoided completely by utilizing the existing delayed affinity update mechanism for irq remapped scenarios as well. That's a bit more error handling in the kernel, but avoids fruitless fingerpointing discussions with tool developers. - Decouple PHYSICAL_MASK from AMD SME as its going to be required for the upcoming Intel memory encryption support as well. - Handle legacy device ACPI detection properly for newer platforms - Fix the wrong argument ordering in the vector allocation tracepoint - Simplify the IDT setup code for the APIC=n case - Use the proper string helpers in the MTRR code - Remove a stale unused VDSO source file - Convert the microcode update lock to a raw spinlock as its used in atomic context. * 'x86-urgent-for-linus' of git://git.kernel.org/pub/scm/linux/kernel/git/tip/tip: x86/intel_rdt: Enable CMT and MBM on new Skylake stepping x86/apic/vector: Print APIC control bits in debugfs genirq/affinity: Defer affinity setting if irq chip is busy x86/platform/uv: Use apic_ack_irq() x86/ioapic: Use apic_ack_irq() irq_remapping: Use apic_ack_irq() x86/apic: Provide apic_ack_irq() genirq/migration: Avoid out of line call if pending is not set genirq/generic_pending: Do not lose pending affinity update x86/apic/vector: Prevent hlist corruption and leaks x86/vector: Fix the args of vector_alloc tracepoint x86/idt: Simplify the idt_setup_apic_and_irq_gates() x86/platform/uv: Remove extra parentheses x86/mm: Decouple dynamic __PHYSICAL_MASK from AMD SME x86: Mark native_set_p4d() as __always_inline x86/microcode: Make the late updat#define __BTREE_TP(pfx, type, sfx) pfx ## type ## sfx #define _BTREE_TP(pfx, type, sfx) __BTREE_TP(pfx, type, sfx) #define BTREE_TP(pfx) _BTREE_TP(pfx, BTREE_TYPE_SUFFIX,) #define BTREE_FN(name) BTREE_TP(btree_ ## name) #define BTREE_TYPE_HEAD BTREE_TP(struct btree_head) #define VISITOR_F
0 files changed, 0 insertions, 0 deletions
n> BTREE_FN(init_mempool)(BTREE_TYPE_HEAD *head, mempool_t *mempool) { btree_init_mempool(&head->h, mempool); } static inline int BTREE_FN(init)(BTREE_TYPE_HEAD *head) { return btree_init(&head->h); } static inline void BTREE_FN(destroy)(BTREE_TYPE_HEAD *head) { btree_destroy(&head->h); } static inline int BTREE_FN(merge)(BTREE_TYPE_HEAD *target, BTREE_TYPE_HEAD *victim, gfp_t gfp) { return btree_merge(&target->h, &victim->h, BTREE_TYPE_GEO, gfp); } #if (BITS_PER_LONG > BTREE_TYPE_BITS) static inline void *BTREE_FN(lookup)(BTREE_TYPE_HEAD *head, BTREE_KEYTYPE key) { unsigned long _key = key; return btree_lookup(&head->h, BTREE_TYPE_GEO, &_key); } static inline int BTREE_FN(insert)(BTREE_TYPE_HEAD *head, BTREE_KEYTYPE key, void *val, gfp_t gfp) { unsigned long _key = key; return btree_insert(&head->h, BTREE_TYPE_GEO, &_key, val, gfp); } static inline int BTREE_FN(update)(BTREE_TYPE_HEAD *head, BTREE_KEYTYPE key, void *val) { unsigned long _key = key; return btree_update(&head->h, BTREE_TYPE_GEO, &_key, val); } static inline void *BTREE_FN(remove)(BTREE_TYPE_HEAD *head, BTREE_KEYTYPE key) { unsigned long _key = key; return btree_remove(&head->h, BTREE_TYPE_GEO, &_key); } static inline void *BTREE_FN(last)(BTREE_TYPE_HEAD *head, BTREE_KEYTYPE *key) { unsigned long _key; void *val = btree_last(&head->h, BTREE_TYPE_GEO, &_key); if (val) *key = _key; return val; } static inline void *BTREE_FN(get_prev)(BTREE_TYPE_HEAD *head, BTREE_KEYTYPE *key) {