/* * iteration_check.c: test races having to do with radix tree iteration * Copyright (c) 2016 Intel Corporation * Author: Ross Zwisler * * This program is free software; you can redistribute it and/or modify it * under the terms and conditions of the GNU General Public License, * version 2, as published by the Free Software Foundation. * * This program is distributed in the hope it will be useful, but WITHOUT * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for * more details. */ #include #include #include "test.h" #define NUM_THREADS 5 #define MAX_IDX 100 #define TAG 0 #define NEW_TAG 1 static pthread_mutex_t tree_lock = PTHREAD_MUTEX_INITIALIZER; static pthread_t threads[NUM_THREADS]; static unsigned int seeds[3]; static RADIX_TREE(tree, GFP_KERNEL); static bool test_complete; static int max_order; /* relentlessly fill the tree with tagged entries */ static void *add_entries_fn(void *arg) { rcu_register_thread(); while (!test_complete) { unsigned long pgoff; int order; for (pgoff = 0; pgoff < MAX_IDX; pgoff++) { pthread_mutex_lock(&tree_lock); for (order = max_order; order >= 0; order--) { if (item_insert_order(&tree, pgoff, order) == 0) { item_tag_set(&tree, pgoff, TAG); break; } } pthread_mutex_unlock(&tree_lock); } } rcu_unregister_thread(); return NULL; } /* * Iterate over the tagged entries, doing a radix_tree_iter_retry() as we find * things that have been removed and randomly resetting our iteration to the * next chunk with radix_tree_iter_resume(). Both radix_tree_iter_retry() and * radix_tree_iter_resume() cause radix_tree_next_slot() to be called with a * NULL 'slot' variable. */ static void *tagged_iteration_fn(void *arg) { struct radix_tree_iter iter; void **slot; rcu_register_thread(); while (!test_complete) { rcu_read_lock(); radix_tree_for_each_tagged(slot, &tree, &iter, 0, TAG) { void *entry = radix_tree_deref_slot(slot); if (unlikely(!entry)) continue; if (radix_tree_deref_retry(entry)) { slot = radix_tree_iter_retry(&iter); continue; } if (rand_r(&seeds[0]) % 50 == 0) { slot = radix_tree_iter_resume(slot, &iter); rcu_read_unlock(); rcu_barrier(); rcu_read_lock(); } } rcu_read_unlock(); } rcu_unregister_thread(); return NULL; } /* * Iterate over the entries, doing a radix_tree_iter_retry() as we find things * that have been removed and randomly resetting our iteration to the next * chunk with radix_tree_iter_resume(). Both radix_tree_iter_retry() and * radix_tree_iter_resume() cause radix_tree_next_slot() to be called with a * NULL 'slot' variable. */ static void *untagged_iteration_fn(void *arg) { struct radix_tree_iter iter; void **slot; rcu_register_thread(); while (!test_complete) { rcu_read_lock(); radix_tree_for_each_slot(slot, &tree, &iter, 0) { void *entry = radix_tree_deref_slot(slot); if (unlikely(!entry)) continue; if (radix_tree_deref_retry(entry)) { slot = radix_tree_iter_retry(&iter); continue; } if (rand_r(&seeds[1]) % 50 == 0) { slot = radix_tree_iter_resume(slot, &iter); rcu_read_unlock(); rcu_barrier(); rcu_read_lock(); } } rcu_read_unlock(); } rcu_unregister_thread(); return NULL; } /* * Randomly remove entries to help induce radix_tree_iter_retry() calls in the * two iteration functions. */ static void *remove_entries_fn(void *arg) { rcu_register_thread(); while (!test_complete) { int pgoff; pgoff = rand_r(&seeds[2]) % MAX_IDX; pthread_mutex_lock(&tree_lock); item_delete(&tree, pgoff); pthread_mutex_unlock(&tree_lock); } rcu_unregister_thread(); return NULL; } static void *tag_entries_fn(void *arg) { rcu_register_thread(); while (!test_complete) { tag_tagged_items(&tree, &tree_lock, 0, MAX_IDX, 10, TAG, NEW_TAG); } rcu_unregister_thread(); return NULL; } /* This is a unit test for a bug found by the syzkaller tester */ void iteration_test(unsigned order, unsigned test_duration) { int i; printf("Running %siteration tests for %d seconds\n", order > 0 ? "multiorder " : "", test_duration); max_order = order; test_complete = false; for (i = 0; i < 3; i++) seeds[i] = rand(); if (pthread_create(&threads[0], NULL, tagged_iteration_fn, NULL)) { perror("create tagged iteration thread"); exit(1); } if (pthread_create(&threads[1], NULL, untagged_iteration_fn, NULL)) { perror("create untagged iteration thread"); exit(1); } if (pthread_create(&threads[2], NULL, add_entries_fn, NULL)) { perror("create add entry thread"); exit(1); } if (pthread_create(&threads[3], NULL, remove_entries_fn, NULL)) { perror("create remove entry thread"); exit(1); } if (pthread_create(&threads[4], NULL, tag_entries_fn, NULL)) { perror("create tag entry thread"); exit(1); } sleep(test_duration); test_complete = true; for (i = 0; i < NUM_THREADS; i++) { if (pthread_join(threads[i], NULL)) { perror("pthread_join"); exit(1); } } item_kill_tree(&tree); } 32c4cf4c82f503d6a00a67de (patch) tree329a05b424d783db675a4c711bd7633575e8181b /include/dt-bindings/sound/cs35l32.h parent49def1853334396f948dcb4cedb9347abb318df5 (diff)
x86/ioapic: Restore IO-APIC irq_chip retrigger callback
commit d32932d02e18 removed the irq_retrigger callback from the IO-APIC chip and did not add it to the new IO-APIC-IR irq chip. Unfortunately the software resend fallback is not enabled on X86, so edge interrupts which are received during the lazy disabled state of the interrupt line are not retriggered and therefor lost. Restore the callbacks. [ tglx: Massaged changelog ] Fixes: d32932d02e18 ("x86/irq: Convert IOAPIC to use hierarchical irqdomain interfaces") Signed-off-by: Ruslan Ruslichenko <rruslich@cisco.com> Cc: xe-linux-external@cisco.com Cc: stable@vger.kernel.org Link: http://lkml.kernel.org/r/1484662432-13580-1-git-send-email-rruslich@cisco.com Signed-off-by: Thomas Gleixner <tglx@linutronix.de>
Diffstat (limited to 'include/dt-bindings/sound/cs35l32.h')