/linux-4.1.27/kernel/events/ |
H A D | internal.h | 197 static inline int get_recursion_context(int *recursion) get_recursion_context() argument 210 if (recursion[rctx]) get_recursion_context() 213 recursion[rctx]++; get_recursion_context() 219 static inline void put_recursion_context(int *recursion, int rctx) put_recursion_context() argument 222 recursion[rctx]--; put_recursion_context()
|
H A D | hw_breakpoint.c | 383 * path to avoid trap recursion attacks. validate_hw_breakpoint()
|
H A D | core.c | 3694 * 1) there is a lock recursion from perf_event_exit_task put_event() 4822 * If we 'fail' here, that's OK, it means recursion is already disabled perf_pending_event() 6180 int recursion[PERF_NR_CONTEXTS]; member in struct:swevent_htable 6385 return get_recursion_context(swhash->recursion); perf_swevent_get_recursion_context() 6393 put_recursion_context(swhash->recursion, rctx); perf_swevent_put_recursion_context()
|
H A D | uprobes.c | 734 * Needs GFP_NOWAIT to avoid i_mmap_rwsem recursion through build_map_info()
|
/linux-4.1.27/arch/powerpc/platforms/powernv/ |
H A D | opal-tracepoints.c | 40 * recursion.
|
/linux-4.1.27/lib/ |
H A D | smp_processor_id.c | 35 * Avoid recursion: check_preemption_disabled()
|
H A D | locking-selftest.c | 842 * read-lock / write-lock recursion that is actually safe. 880 * read-lock / write-lock recursion that is unsafe. 1871 DO_TESTCASE_6x2("irq read-recursion", irq_read_recursion); locking_selftest() 1872 // DO_TESTCASE_6x2B("irq read-recursion #2", irq_read_recursion2); locking_selftest()
|
/linux-4.1.27/arch/x86/include/asm/ |
H A D | linkage.h | 16 * and keeps it from doing tailcall recursion and/or using the
|
H A D | preempt.h | 31 * must be macros to avoid header recursion hell
|
/linux-4.1.27/arch/m68k/include/asm/ |
H A D | linkage.h | 11 * and keeps it from doing tailcall recursion and/or using the
|
/linux-4.1.27/kernel/locking/ |
H A D | spinlock_debug.c | 84 SPIN_BUG_ON(lock->owner == current, lock, "recursion"); debug_spin_lock_before() 86 lock, "cpu recursion"); debug_spin_lock_before() 229 RWLOCK_BUG_ON(lock->owner == current, lock, "recursion"); debug_write_lock_before() 231 lock, "cpu recursion"); debug_write_lock_before()
|
H A D | lockdep.c | 1783 * Allow read-after-read recursion of the same check_deadlock() 1846 * We are using global variables to control the recursion, to check_prev_add() 2027 * disabled to make this an IRQ-safe lock.. for recursion reasons lookup_chain_cache() 2466 * has ENABLED state, which would allow recursion deadlocks. mark_lock_irq() 2469 * has USED_IN state, which, again, would allow recursion deadlocks. mark_lock_irq() 2825 * context checking code. This tests GFP_FS recursion (a lock taken mark_irqflags() 3272 * Lockdep should run with IRQs disabled, recursion, head-ache, etc.. check_unlock() 3607 * and also avoid lockdep recursion:
|
/linux-4.1.27/include/asm-generic/ |
H A D | preempt.h | 24 * must be macros to avoid header recursion hell
|
/linux-4.1.27/crypto/asymmetric_keys/ |
H A D | x509_parser.h | 41 bool seen; /* Infinite recursion prevention */
|
/linux-4.1.27/fs/xfs/ |
H A D | xfs_buf_item.h | 57 unsigned int bli_recur; /* lock recursion count */
|
H A D | xfs_trans_buf.c | 127 * within the transaction, just increment its lock recursion count 151 * recursion count and return the buffer to the caller. xfs_trans_get_buf_map() 209 * recursion count and return the buffer to the caller. xfs_trans_getsb() 235 * lock recursion count and return a pointer to it. 260 * the lock recursion count and return the buffer to the caller. xfs_trans_read_buf_map() 262 * the lock recursion count, and return it to the caller. xfs_trans_read_buf_map() 343 * within this transaction, do decrement the recursion count but do 345 * modified within the transaction, decrement the recursion count and 346 * release the buffer if the recursion count goes to 0.
|
H A D | xfs_buf_item.c | 557 * This call ignores the recursion count. It is only called when the buffer 558 * should REALLY be unlocked, regardless of the recursion count.
|
H A D | xfs_iops.c | 1291 * prevent direct reclaim recursion back into the filesystem and blowing xfs_setup_inode()
|
/linux-4.1.27/crypto/ |
H A D | algboss.c | 131 int recursion = 0; cryptomgr_schedule_probe() local 137 recursion++; cryptomgr_schedule_probe() 138 else if (*p == ')' && !recursion--) cryptomgr_schedule_probe()
|
/linux-4.1.27/kernel/debug/kdb/ |
H A D | kdb_io.c | 752 /* Watch out for recursion here. Any routine that calls vkdb_printf() 756 kdb_nextline = 1; /* In case of recursion */ vkdb_printf() 802 suspend_grep = 1; /* for this recursion */ vkdb_printf() 806 suspend_grep = 1; /* for this recursion */ vkdb_printf() 813 suspend_grep = 1; /* for this recursion */ vkdb_printf() 816 suspend_grep = 1; /* for this recursion */ vkdb_printf() 826 suspend_grep = 1; /* for this recursion */ vkdb_printf()
|
H A D | kdb_support.c | 911 /* Maintain a small stack of kdb_flags to allow recursion without disturbing
|
/linux-4.1.27/fs/quota/ |
H A D | netlink.c | 55 * filesystem performing write and thus further recursion into quota_send_warning()
|
/linux-4.1.27/include/trace/ |
H A D | define_trace.h | 20 /* Prevent recursion */
|
/linux-4.1.27/arch/alpha/include/asm/ |
H A D | thread_info.h | 67 #define TIF_DIE_IF_KERNEL 9 /* dik recursion lock */
|
H A D | io.h | 564 * to play with; for now just use cpp anti-recursion logics and make sure
|
/linux-4.1.27/fs/btrfs/ |
H A D | tree-defrag.c | 46 * there's recursion here right now in the tree locking, btrfs_defrag_leaves()
|
H A D | check-integrity.c | 229 /* This structure is used to implement recursion without occupying 2465 * space is very small and the max recursion depth is limited. btrfsic_check_all_ref_blocks() 2577 * is very small and the max recursion depth is limited. btrfsic_is_block_ref_by_superblock() 2684 * is very small and the max recursion depth is limited. btrfsic_dump_tree_sub()
|
H A D | relocation.c | 671 * bakcrefs of these upper level blocks recursively. the recursion stop
|
/linux-4.1.27/net/ipv4/netfilter/ |
H A D | nf_log_ipv4.c | 37 /* One level of recursion won't kill us */ dump_ipv4_packet() 270 /* (ICMP allows recursion one level deep) */ dump_ipv4_packet()
|
H A D | arp_tables.c | 372 /* No recursion; use packet counter to save back ptrs (reset mark_source_chains()
|
H A D | ip_tables.c | 449 /* No recursion; use packet counter to save back ptrs (reset mark_source_chains()
|
/linux-4.1.27/kernel/trace/ |
H A D | trace.h | 403 * For function tracing recursion: 410 * function is called and recursion checks the GLOBAL bits. 413 * check for recursion. 417 * all three of these steps will do a recursion protection. 419 * did. The recursion that we are protecting against will 422 * To prevent the multiple recursion checks, if a recursion 433 /* Start of function recursion bits */ 495 /* A previous recursion check was made */ trace_test_and_set_recursion()
|
H A D | trace_selftest.c | 421 * This function is registered without the recursion safe flag. trace_selftest_test_recursion_func() 422 * The ftrace infrastructure should provide the recursion trace_selftest_test_recursion_func() 436 * We said we would provide our own recursion. By calling trace_selftest_test_recursion_safe_func() 466 pr_info("Testing ftrace recursion: "); trace_selftest_function_recursion() 502 pr_info("Testing ftrace recursion safe: "); trace_selftest_function_recursion()
|
H A D | trace_stack.c | 218 /* prevent recursion in schedule */ stack_trace_call()
|
H A D | ftrace.c | 280 * recursion safe and not dynamic and the arch supports passing ops, update_ftrace_function() 833 /* prevent recursion (from NMIs) */ ftrace_profile_alloc() 5209 * recursion, this function will be called by the mcount trampoline. 5210 * This function will handle recursion protection. 5232 * have its own recursion protection, then it should call the 5240 * If the func handles its own recursion, call it directly. ftrace_ops_get_func() 5241 * Otherwise call the recursion protected function that ftrace_ops_get_func()
|
H A D | ring_buffer.c | 2662 * checked and set (if it was set, then a recursion of that context
|
H A D | trace.c | 1942 * prevent recursion, since the user stack tracing may ftrace_trace_userstack()
|
/linux-4.1.27/include/linux/netfilter/ |
H A D | x_tables.h | 278 * Packet processing changes the seqcount only if no recursion happened 292 * 1 if no recursion on this cpu 293 * 0 if recursion detected
|
/linux-4.1.27/arch/mips/math-emu/ |
H A D | dsemul.c | 146 * can handle signals, recursion, and longjmps() in the context of do_dsemulret()
|
/linux-4.1.27/arch/mips/sgi-ip27/ |
H A D | ip27-irq.c | 76 * sure the same intr does not intr again, causing recursion that
|
/linux-4.1.27/tools/perf/tests/ |
H A D | bp_signal.c | 181 pr_debug("failed: RF EFLAG recursion issue detected\n"); test__bp_signal()
|
/linux-4.1.27/include/linux/ |
H A D | lockdep.h | 324 * 1: read-acquire (no recursion allowed) 325 * 2: read-acquire with same-instance recursion allowed
|
H A D | kobject.h | 161 * @kobj: the embedded kobject for this kset (recursion, isn't it fun...)
|
H A D | firewire.h | 275 * Otherwise there is a danger of recursion of inbound and outbound
|
H A D | ftrace.h | 98 * that the call back has its own recursion protection. If it does trace_init() 99 * not set this, then the ftrace infrastructure will add recursion trace_init()
|
H A D | pagemap.h | 335 * Clear __GFP_FS when allocating the page to avoid recursion into the fs
|
H A D | perf_event.h | 780 * 'Special' version for the scheduler, it hard assumes no recursion,
|
H A D | sched.h | 1707 /* bitmask and counter of trace recursion */
|
/linux-4.1.27/drivers/staging/lustre/lustre/libcfs/linux/ |
H A D | linux-tracefile.c | 187 * from here: this will lead to infinite recursion. cfs_tcd_owns_tage()
|
/linux-4.1.27/fs/freevxfs/ |
H A D | vxfs_bmap.c | 111 * vxfs_bmap_indir - recursion for vxfs_bmap_typed
|
/linux-4.1.27/net/ipv6/netfilter/ |
H A D | nf_log_ipv6.c | 38 /* One level of recursion won't kill us */ dump_ipv6_packet()
|
H A D | ip6_tables.c | 462 /* No recursion; use packet counter to save back ptrs (reset mark_source_chains()
|
/linux-4.1.27/scripts/dtc/ |
H A D | srcpos.c | 55 /* Detect infinite include recursion. */
|
/linux-4.1.27/net/core/ |
H A D | netpoll.c | 140 * case. Further, we test the poll_owner to avoid recursion on UP 334 /* don't get messages out of order, and no recursion */ netpoll_send_skb_on_dev()
|
/linux-4.1.27/drivers/acpi/acpica/ |
H A D | hwpci.c | 116 * specifically avoids any use of recursion by building a local
|
H A D | psparse.c | 491 * handles nested control method invocations without recursion. acpi_ps_parse_aml()
|
H A D | utdelete.c | 571 * for later processing (this eliminates recursion.) acpi_ut_update_object_reference()
|
/linux-4.1.27/arch/alpha/kernel/ |
H A D | sys_cabriolet.c | 133 prevents the possibility of recursion.
|
H A D | traps.c | 184 printk("die_if_kernel recursion detected.\n"); die_if_kernel() 684 printk("die_if_kernel recursion detected.\n"); do_entUna()
|
/linux-4.1.27/net/unix/ |
H A D | garbage.c | 18 * - explicit stack instead of recursion
|
/linux-4.1.27/drivers/staging/lustre/lnet/lnet/ |
H A D | router.c | 1617 LASSERT(!running); /* recursion check */ lnet_router_checker() 1632 * recursion breaker in LNetEQPoll would fail */ lnet_router_checker() 1667 running = 0; /* lock only needed for the recursion check */ lnet_router_checker()
|
/linux-4.1.27/drivers/staging/lustre/lustre/include/ |
H A D | lu_object.h | 90 * -# avoiding recursion. 92 * Generic code tries to replace recursion through layers by iterations 118 * Due to design goal of avoiding recursion, object creation (see
|
/linux-4.1.27/drivers/staging/lustre/lustre/libcfs/ |
H A D | tracefile.c | 124 * from here: this will lead to infinite recursion. cfs_trace_refill_stock() 195 * from here: this will lead to infinite recursion. cfs_tcd_shrink() 223 * from here: this will lead to infinite recursion. cfs_trace_get_tage()
|
/linux-4.1.27/arch/x86/mm/ |
H A D | mpx.c | 708 * avoid recursion, do_munmap() will check whether it comes unmap_single_bt() 901 * To avoid recursion, if a VM_MPX vma is found in the range mpx_notify_unmap() 903 * recursion represents having bounds tables for bounds tables, mpx_notify_unmap()
|
/linux-4.1.27/drivers/gpio/ |
H A D | gpio-bcm-kona.c | 508 * category than their parents, so it won't report false recursion.
|
H A D | gpio-tegra.c | 418 * category than their parents, so it won't report false recursion.
|
H A D | gpio-mcp23s08.c | 98 * category than their parents, so it won't report false recursion.
|
H A D | gpiolib.c | 455 * category than their parents, so it won't report false recursion.
|
/linux-4.1.27/arch/x86/kernel/ |
H A D | hw_breakpoint.c | 476 * Set up resume flag to avoid breakpoint recursion when hw_breakpoint_handler()
|
H A D | entry_64.S | 1003 TRACE_IRQS_OFF_DEBUG /* reload IDT in case of recursion */
|
/linux-4.1.27/arch/tile/kernel/ |
H A D | stack.c | 354 * Avoid possible crash recursion during backtrace. If it happens, it
|
H A D | intvec_32.S | 1423 * Clear TIF_SINGLESTEP to prevent recursion if we execute an ill.
|
/linux-4.1.27/drivers/usb/usbip/ |
H A D | stub_rx.c | 258 * spinlock recursion since stub_complete() is stub_recv_cmd_unlink()
|
/linux-4.1.27/drivers/md/persistent-data/ |
H A D | dm-space-map-metadata.c | 236 DMERR("lost track of recursion depth"); out()
|
/linux-4.1.27/arch/ia64/kernel/ |
H A D | entry.S | 1073 add out1=1,in1 // increment recursion count 1089 cmp.ne pReturn,p0=r0,in1 // if recursion count != 0, we need to do a br.ret 1099 add out1=1,in1 // increment recursion count 1112 cmp.ne pReturn,p0=r0,in1 // if recursion count != 0, we need to do a br.ret
|
H A D | kprobes.c | 801 /* Handle recursion cases */ pre_kprobes_handler()
|
/linux-4.1.27/net/mac80211/ |
H A D | offchannel.c | 290 * queue the work struct again to avoid recursion ieee80211_start_next_roc()
|
/linux-4.1.27/scripts/kconfig/ |
H A D | streamline_config.pl | 151 # prevent recursion
|
/linux-4.1.27/arch/sparc/kernel/ |
H A D | entry.S | 140 /* Prevent recursion */ 168 /* Prevent recursion */
|
H A D | mdesc.c | 624 /* Since we have an estimate of recursion depth, do a sanity check. */ find_back_node_value()
|
/linux-4.1.27/fs/ |
H A D | eventpoll.c | 84 * of epoll file descriptors, we use the current recursion depth as 123 * maximum recursion dept and loop cycles. 384 * that the recursion limit is not exceeded, and that 396 * the maximum recursion limit has been exceeded. 465 * recursion constraints. That are, no more than EP_MAX_POLLWAKE_NESTS, to
|
H A D | super.c | 203 * sget() can have s_umount recursion. alloc_super()
|
H A D | dcache.c | 735 * This tail recursion is done by hand as we don't want to depend 737 * Real recursion would eat up our stack space.
|
H A D | namei.c | 64 * There is still a significant amount of tail- and mid- recursion in
|
/linux-4.1.27/block/ |
H A D | bio.c | 394 * generic_make_request() that converts recursion into iteration, to prevent 434 * generic_make_request() converts recursion to iteration; this bio_alloc_bioset() 1778 * to avoid unbounded recursion and blowing the stack. Tail call bio_endio()
|
/linux-4.1.27/drivers/md/ |
H A D | dm-snap-persistent.c | 253 * to avoid generic_make_request recursion. chunk_io()
|
/linux-4.1.27/drivers/net/ppp/ |
H A D | pptp.c | 402 (header->flags&0xF) != 0) /* routing and recursion ctrl = 0 */ pptp_rcv()
|
/linux-4.1.27/drivers/media/v4l2-core/ |
H A D | v4l2-mem2mem.c | 323 * called on the driver. To prevent recursion, it should not be called directly
|
/linux-4.1.27/drivers/staging/lustre/lustre/ldlm/ |
H A D | interval_tree.c | 707 * It's much easy to eliminate the recursion, see interval_search for
|
/linux-4.1.27/drivers/input/gameport/ |
H A D | gameport.c | 637 * to do recursion gameport_disconnect_port()
|
/linux-4.1.27/drivers/gpu/drm/vmwgfx/ |
H A D | vmwgfx_mob.c | 493 * Uses tail recursion to set up a multilevel mob page table.
|
/linux-4.1.27/drivers/virtio/ |
H A D | virtio_balloon.c | 449 * recursion in the case it ends up triggering memory compaction virtballoon_migratepage()
|
/linux-4.1.27/arch/powerpc/platforms/pseries/ |
H A D | lpar.c | 694 * recursion. One example of this are spinlocks calling H_YIELD on
|
/linux-4.1.27/arch/parisc/kernel/ |
H A D | traps.c | 274 printk(KERN_CRIT "%s() recursion detected.\n", __func__); die_if_kernel()
|
/linux-4.1.27/net/batman-adv/ |
H A D | hard-interface.c | 85 /* no more parents..stop recursion */ batadv_is_on_batman_iface()
|
/linux-4.1.27/net/ipv4/ |
H A D | ip_gre.c | 78 kill network. IP hop limit plays role of "t->recursion" in this case,
|
H A D | fib_semantics.c | 568 * where gw must have narrower scope. This recursion stops
|
/linux-4.1.27/kernel/printk/ |
H A D | printk.c | 1646 * recursion and return - but flag the recursion so that vprintk_emit() 1663 "BUG: recent printk recursion!"; vprintk_emit()
|
/linux-4.1.27/drivers/net/irda/ |
H A D | irda-usb.c | 568 * and we could go in recursion and blow the kernel stack... write_bulk_callback() 843 * danger of recursion (new URB we submit fails, we come irda_usb_receive()
|
/linux-4.1.27/drivers/net/wireless/iwlwifi/pcie/ |
H A D | trans.c | 1120 * notification without endless recursion. Under very rare iwl_trans_pcie_stop_device() 1121 * circumstances, we might have a small recursion if the rfkill iwl_trans_pcie_stop_device()
|
/linux-4.1.27/drivers/mmc/card/ |
H A D | sdio_uart.c | 529 * causing undesirable effects. Let's stop the recursion here. sdio_uart_irq()
|
/linux-4.1.27/drivers/mtd/ |
H A D | sm_ftl.c | 265 /* Avoid infinite recursion on CIS reads, sm_recheck_media sm_read_sector()
|
/linux-4.1.27/drivers/net/slip/ |
H A D | slip.c | 28 * A.N.Kuznetsov : dev_tint() recursion fix.
|
/linux-4.1.27/drivers/pci/hotplug/ |
H A D | cpqphp_pci.c | 234 /* XXX: no recursion, wtf? */ PCI_ScanBusForNonBridge()
|
/linux-4.1.27/drivers/gpu/drm/i915/ |
H A D | i915_gem_userptr.c | 432 * the struct mutex. So in order to avoid that recursion, we have i915_gem_userptr_init__mm_struct()
|
H A D | i915_irq.c | 2768 /* Prevent pathological recursion due to driver bugs */ semaphore_passed()
|
/linux-4.1.27/drivers/infiniband/hw/mlx5/ |
H A D | mr.c | 883 /* We allocate with GFP_ATOMIC to avoid recursion into page-reclaim mlx5_ib_update_mtt()
|
/linux-4.1.27/drivers/dma/ |
H A D | edma.c | 779 * lead to some nasty recursion when we are in a NULL edma_callback()
|
/linux-4.1.27/mm/ |
H A D | swap.c | 980 * mutual recursion.
|
H A D | rmap.c | 544 * we'll deadlock on the anon_vma_lock_write() recursion. page_lock_anon_vma_read()
|
H A D | vmalloc.c | 1591 /* Please note that the recursion is strictly bounded. */ __vmalloc_area_node()
|
H A D | page_alloc.c | 2760 /* Avoid recursion of direct reclaim */ __alloc_pages_slowpath()
|
/linux-4.1.27/drivers/xen/xenbus/ |
H A D | xenbus_client.c | 348 * avoiding recursion within xenbus_switch_state.
|
/linux-4.1.27/drivers/iommu/ |
H A D | arm-smmu.c | 626 * recursion here as the SMMU table walker will not be wired arm_smmu_flush_pgtable()
|
/linux-4.1.27/drivers/mtd/ubi/ |
H A D | build.c | 898 * already. Well, generally this recursion works fine, but there are ubi_attach_mtd_dev()
|
/linux-4.1.27/drivers/block/ |
H A D | loop.c | 692 /* Avoid recursion */ loop_set_fd()
|
H A D | rbd.c | 5153 * rbd_dev_image_probe() recursion depth, which means it's also the
|
/linux-4.1.27/fs/gfs2/ |
H A D | bmap.c | 859 * @height: the height the recursion is at
|
H A D | glock.c | 917 * add_to_queue - Add a holder to the wait queue (but look for recursion)
|
/linux-4.1.27/arch/m68k/kernel/ |
H A D | head.S | 2992 /* A little safe recursion is good for the soul */ 3520 /* A little safe recursion is good for the soul */ 3567 console_putc #'\n' /* recursion is OK! */
|
/linux-4.1.27/drivers/infiniband/hw/ehca/ |
H A D | ehca_qp.c | 1235 * This internal func was intorduced to avoid recursion of ehca_modify_qp()!
|
/linux-4.1.27/drivers/block/drbd/ |
H A D | drbd_worker.c | 266 /* to avoid recursion in __req_mod */ drbd_request_endio()
|
/linux-4.1.27/net/bridge/netfilter/ |
H A D | ebtables.c | 772 /* end of udc, go back one 'recursion' step */ check_chainloops()
|
/linux-4.1.27/drivers/scsi/isci/ |
H A D | host.c | 926 /* Caution recursion ahead be forwarned sci_controller_start_next_phy()
|
/linux-4.1.27/drivers/atm/ |
H A D | horizon.c | 927 // Note on tail recursion: a GCC developer said that it is not likely
|
/linux-4.1.27/kernel/rcu/ |
H A D | tree_plugin.h | 581 * recursively up the tree. (Calm down, calm down, we do the recursion
|
H A D | tree.c | 2105 * endless recursion -- or would do so if it wasn't for the self-deadlock
|
/linux-4.1.27/tools/testing/ktest/ |
H A D | ktest.pl | 3505 # prevent recursion
|
/linux-4.1.27/kernel/sched/ |
H A D | core.c | 2909 * recursion and tracing preempt enabling caused by the tracing 2931 * an infinite recursion. preempt_schedule_context()
|
/linux-4.1.27/drivers/net/ethernet/3com/ |
H A D | 3c59x.c | 2140 * We can't allow a recursion from our interrupt handler back into the boomerang_start_xmit()
|
/linux-4.1.27/drivers/net/ethernet/intel/ixgbevf/ |
H A D | ixgbevf_main.c | 141 * potential recursion. ixgbevf_check_remove()
|
/linux-4.1.27/drivers/net/wireless/b43/ |
H A D | main.c | 1889 * so we avoid that recursion. */ b43_handle_firmware_panic()
|
/linux-4.1.27/fs/ubifs/ |
H A D | tnc.c | 2093 /* Tail recursion */ tnc_insert()
|
/linux-4.1.27/fs/jfs/ |
H A D | jfs_dmap.c | 2580 * again (recursion) for the next higher level of the mapping to dbAdjCtl()
|
/linux-4.1.27/fs/ext4/ |
H A D | ext4.h | 822 * well as infinite recursion, since it isn't turtles all the way
|
H A D | super.c | 5357 /* Don't account quota for quota files to avoid recursion */ ext4_quota_enable()
|
/linux-4.1.27/drivers/usb/host/ |
H A D | fotg210-hcd.c | 3251 if (!nested) /* Avoid recursion */ start_iaa_cycle()
|
H A D | fusbh200-hcd.c | 3198 if (!nested) /* Avoid recursion */ start_iaa_cycle()
|
/linux-4.1.27/drivers/net/ethernet/intel/ixgbe/ |
H A D | ixgbe_main.c | 328 * potential recursion. ixgbe_check_remove()
|
/linux-4.1.27/drivers/net/ethernet/intel/i40e/ |
H A D | i40e_main.c | 8973 * This uses recursion to find the tips of the branch to be
|
/linux-4.1.27/drivers/scsi/aic7xxx/ |
H A D | aic79xx_core.c | 1673 panic("ahd_run_qoutfifo recursion"); ahd_run_qoutfifo()
|
/linux-4.1.27/drivers/media/dvb-frontends/drx39xyj/ |
H A D | drxj.c | 1825 * Using DAP FASI directly to avoid endless recursion of RMWs to audio registers.
|