Searched refs:recursion (Results 1 - 142 of 142) sorted by relevance

/linux-4.1.27/kernel/events/
H A Dinternal.h197 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 Dhw_breakpoint.c383 * path to avoid trap recursion attacks. validate_hw_breakpoint()
H A Dcore.c3694 * 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 Duprobes.c734 * Needs GFP_NOWAIT to avoid i_mmap_rwsem recursion through build_map_info()
/linux-4.1.27/arch/powerpc/platforms/powernv/
H A Dopal-tracepoints.c40 * recursion.
/linux-4.1.27/lib/
H A Dsmp_processor_id.c35 * Avoid recursion: check_preemption_disabled()
H A Dlocking-selftest.c842 * 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 Dlinkage.h16 * and keeps it from doing tailcall recursion and/or using the
H A Dpreempt.h31 * must be macros to avoid header recursion hell
/linux-4.1.27/arch/m68k/include/asm/
H A Dlinkage.h11 * and keeps it from doing tailcall recursion and/or using the
/linux-4.1.27/kernel/locking/
H A Dspinlock_debug.c84 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 Dlockdep.c1783 * 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 Dpreempt.h24 * must be macros to avoid header recursion hell
/linux-4.1.27/crypto/asymmetric_keys/
H A Dx509_parser.h41 bool seen; /* Infinite recursion prevention */
/linux-4.1.27/fs/xfs/
H A Dxfs_buf_item.h57 unsigned int bli_recur; /* lock recursion count */
H A Dxfs_trans_buf.c127 * 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 Dxfs_buf_item.c557 * 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 Dxfs_iops.c1291 * prevent direct reclaim recursion back into the filesystem and blowing xfs_setup_inode()
/linux-4.1.27/crypto/
H A Dalgboss.c131 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 Dkdb_io.c752 /* 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 Dkdb_support.c911 /* Maintain a small stack of kdb_flags to allow recursion without disturbing
/linux-4.1.27/fs/quota/
H A Dnetlink.c55 * filesystem performing write and thus further recursion into quota_send_warning()
/linux-4.1.27/include/trace/
H A Ddefine_trace.h20 /* Prevent recursion */
/linux-4.1.27/arch/alpha/include/asm/
H A Dthread_info.h67 #define TIF_DIE_IF_KERNEL 9 /* dik recursion lock */
H A Dio.h564 * to play with; for now just use cpp anti-recursion logics and make sure
/linux-4.1.27/fs/btrfs/
H A Dtree-defrag.c46 * there's recursion here right now in the tree locking, btrfs_defrag_leaves()
H A Dcheck-integrity.c229 /* 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 Drelocation.c671 * bakcrefs of these upper level blocks recursively. the recursion stop
/linux-4.1.27/net/ipv4/netfilter/
H A Dnf_log_ipv4.c37 /* One level of recursion won't kill us */ dump_ipv4_packet()
270 /* (ICMP allows recursion one level deep) */ dump_ipv4_packet()
H A Darp_tables.c372 /* No recursion; use packet counter to save back ptrs (reset mark_source_chains()
H A Dip_tables.c449 /* No recursion; use packet counter to save back ptrs (reset mark_source_chains()
/linux-4.1.27/kernel/trace/
H A Dtrace.h403 * 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 Dtrace_selftest.c421 * 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 Dtrace_stack.c218 /* prevent recursion in schedule */ stack_trace_call()
H A Dftrace.c280 * 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 Dring_buffer.c2662 * checked and set (if it was set, then a recursion of that context
H A Dtrace.c1942 * prevent recursion, since the user stack tracing may ftrace_trace_userstack()
/linux-4.1.27/include/linux/netfilter/
H A Dx_tables.h278 * 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 Ddsemul.c146 * can handle signals, recursion, and longjmps() in the context of do_dsemulret()
/linux-4.1.27/arch/mips/sgi-ip27/
H A Dip27-irq.c76 * sure the same intr does not intr again, causing recursion that
/linux-4.1.27/tools/perf/tests/
H A Dbp_signal.c181 pr_debug("failed: RF EFLAG recursion issue detected\n"); test__bp_signal()
/linux-4.1.27/include/linux/
H A Dlockdep.h324 * 1: read-acquire (no recursion allowed)
325 * 2: read-acquire with same-instance recursion allowed
H A Dkobject.h161 * @kobj: the embedded kobject for this kset (recursion, isn't it fun...)
H A Dfirewire.h275 * Otherwise there is a danger of recursion of inbound and outbound
H A Dftrace.h98 * 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 Dpagemap.h335 * Clear __GFP_FS when allocating the page to avoid recursion into the fs
H A Dperf_event.h780 * 'Special' version for the scheduler, it hard assumes no recursion,
H A Dsched.h1707 /* bitmask and counter of trace recursion */
/linux-4.1.27/drivers/staging/lustre/lustre/libcfs/linux/
H A Dlinux-tracefile.c187 * from here: this will lead to infinite recursion. cfs_tcd_owns_tage()
/linux-4.1.27/fs/freevxfs/
H A Dvxfs_bmap.c111 * vxfs_bmap_indir - recursion for vxfs_bmap_typed
/linux-4.1.27/net/ipv6/netfilter/
H A Dnf_log_ipv6.c38 /* One level of recursion won't kill us */ dump_ipv6_packet()
H A Dip6_tables.c462 /* No recursion; use packet counter to save back ptrs (reset mark_source_chains()
/linux-4.1.27/scripts/dtc/
H A Dsrcpos.c55 /* Detect infinite include recursion. */
/linux-4.1.27/net/core/
H A Dnetpoll.c140 * 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 Dhwpci.c116 * specifically avoids any use of recursion by building a local
H A Dpsparse.c491 * handles nested control method invocations without recursion. acpi_ps_parse_aml()
H A Dutdelete.c571 * for later processing (this eliminates recursion.) acpi_ut_update_object_reference()
/linux-4.1.27/arch/alpha/kernel/
H A Dsys_cabriolet.c133 prevents the possibility of recursion.
H A Dtraps.c184 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 Dgarbage.c18 * - explicit stack instead of recursion
/linux-4.1.27/drivers/staging/lustre/lnet/lnet/
H A Drouter.c1617 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 Dlu_object.h90 * -# 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 Dtracefile.c124 * 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 Dmpx.c708 * 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 Dgpio-bcm-kona.c508 * category than their parents, so it won't report false recursion.
H A Dgpio-tegra.c418 * category than their parents, so it won't report false recursion.
H A Dgpio-mcp23s08.c98 * category than their parents, so it won't report false recursion.
H A Dgpiolib.c455 * category than their parents, so it won't report false recursion.
/linux-4.1.27/arch/x86/kernel/
H A Dhw_breakpoint.c476 * Set up resume flag to avoid breakpoint recursion when hw_breakpoint_handler()
H A Dentry_64.S1003 TRACE_IRQS_OFF_DEBUG /* reload IDT in case of recursion */
/linux-4.1.27/arch/tile/kernel/
H A Dstack.c354 * Avoid possible crash recursion during backtrace. If it happens, it
H A Dintvec_32.S1423 * Clear TIF_SINGLESTEP to prevent recursion if we execute an ill.
/linux-4.1.27/drivers/usb/usbip/
H A Dstub_rx.c258 * spinlock recursion since stub_complete() is stub_recv_cmd_unlink()
/linux-4.1.27/drivers/md/persistent-data/
H A Ddm-space-map-metadata.c236 DMERR("lost track of recursion depth"); out()
/linux-4.1.27/arch/ia64/kernel/
H A Dentry.S1073 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 Dkprobes.c801 /* Handle recursion cases */ pre_kprobes_handler()
/linux-4.1.27/net/mac80211/
H A Doffchannel.c290 * queue the work struct again to avoid recursion ieee80211_start_next_roc()
/linux-4.1.27/scripts/kconfig/
H A Dstreamline_config.pl151 # prevent recursion
/linux-4.1.27/arch/sparc/kernel/
H A Dentry.S140 /* Prevent recursion */
168 /* Prevent recursion */
H A Dmdesc.c624 /* Since we have an estimate of recursion depth, do a sanity check. */ find_back_node_value()
/linux-4.1.27/fs/
H A Deventpoll.c84 * 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 Dsuper.c203 * sget() can have s_umount recursion. alloc_super()
H A Ddcache.c735 * 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 Dnamei.c64 * There is still a significant amount of tail- and mid- recursion in
/linux-4.1.27/block/
H A Dbio.c394 * 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 Ddm-snap-persistent.c253 * to avoid generic_make_request recursion. chunk_io()
/linux-4.1.27/drivers/net/ppp/
H A Dpptp.c402 (header->flags&0xF) != 0) /* routing and recursion ctrl = 0 */ pptp_rcv()
/linux-4.1.27/drivers/media/v4l2-core/
H A Dv4l2-mem2mem.c323 * called on the driver. To prevent recursion, it should not be called directly
/linux-4.1.27/drivers/staging/lustre/lustre/ldlm/
H A Dinterval_tree.c707 * It's much easy to eliminate the recursion, see interval_search for
/linux-4.1.27/drivers/input/gameport/
H A Dgameport.c637 * to do recursion gameport_disconnect_port()
/linux-4.1.27/drivers/gpu/drm/vmwgfx/
H A Dvmwgfx_mob.c493 * Uses tail recursion to set up a multilevel mob page table.
/linux-4.1.27/drivers/virtio/
H A Dvirtio_balloon.c449 * recursion in the case it ends up triggering memory compaction virtballoon_migratepage()
/linux-4.1.27/arch/powerpc/platforms/pseries/
H A Dlpar.c694 * recursion. One example of this are spinlocks calling H_YIELD on
/linux-4.1.27/arch/parisc/kernel/
H A Dtraps.c274 printk(KERN_CRIT "%s() recursion detected.\n", __func__); die_if_kernel()
/linux-4.1.27/net/batman-adv/
H A Dhard-interface.c85 /* no more parents..stop recursion */ batadv_is_on_batman_iface()
/linux-4.1.27/net/ipv4/
H A Dip_gre.c78 kill network. IP hop limit plays role of "t->recursion" in this case,
H A Dfib_semantics.c568 * where gw must have narrower scope. This recursion stops
/linux-4.1.27/kernel/printk/
H A Dprintk.c1646 * 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 Dirda-usb.c568 * 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 Dtrans.c1120 * 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 Dsdio_uart.c529 * causing undesirable effects. Let's stop the recursion here. sdio_uart_irq()
/linux-4.1.27/drivers/mtd/
H A Dsm_ftl.c265 /* Avoid infinite recursion on CIS reads, sm_recheck_media sm_read_sector()
/linux-4.1.27/drivers/net/slip/
H A Dslip.c28 * A.N.Kuznetsov : dev_tint() recursion fix.
/linux-4.1.27/drivers/pci/hotplug/
H A Dcpqphp_pci.c234 /* XXX: no recursion, wtf? */ PCI_ScanBusForNonBridge()
/linux-4.1.27/drivers/gpu/drm/i915/
H A Di915_gem_userptr.c432 * the struct mutex. So in order to avoid that recursion, we have i915_gem_userptr_init__mm_struct()
H A Di915_irq.c2768 /* Prevent pathological recursion due to driver bugs */ semaphore_passed()
/linux-4.1.27/drivers/infiniband/hw/mlx5/
H A Dmr.c883 /* We allocate with GFP_ATOMIC to avoid recursion into page-reclaim mlx5_ib_update_mtt()
/linux-4.1.27/drivers/dma/
H A Dedma.c779 * lead to some nasty recursion when we are in a NULL edma_callback()
/linux-4.1.27/mm/
H A Dswap.c980 * mutual recursion.
H A Drmap.c544 * we'll deadlock on the anon_vma_lock_write() recursion. page_lock_anon_vma_read()
H A Dvmalloc.c1591 /* Please note that the recursion is strictly bounded. */ __vmalloc_area_node()
H A Dpage_alloc.c2760 /* Avoid recursion of direct reclaim */ __alloc_pages_slowpath()
/linux-4.1.27/drivers/xen/xenbus/
H A Dxenbus_client.c348 * avoiding recursion within xenbus_switch_state.
/linux-4.1.27/drivers/iommu/
H A Darm-smmu.c626 * recursion here as the SMMU table walker will not be wired arm_smmu_flush_pgtable()
/linux-4.1.27/drivers/mtd/ubi/
H A Dbuild.c898 * already. Well, generally this recursion works fine, but there are ubi_attach_mtd_dev()
/linux-4.1.27/drivers/block/
H A Dloop.c692 /* Avoid recursion */ loop_set_fd()
H A Drbd.c5153 * rbd_dev_image_probe() recursion depth, which means it's also the
/linux-4.1.27/fs/gfs2/
H A Dbmap.c859 * @height: the height the recursion is at
H A Dglock.c917 * add_to_queue - Add a holder to the wait queue (but look for recursion)
/linux-4.1.27/arch/m68k/kernel/
H A Dhead.S2992 /* 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 Dehca_qp.c1235 * This internal func was intorduced to avoid recursion of ehca_modify_qp()!
/linux-4.1.27/drivers/block/drbd/
H A Ddrbd_worker.c266 /* to avoid recursion in __req_mod */ drbd_request_endio()
/linux-4.1.27/net/bridge/netfilter/
H A Debtables.c772 /* end of udc, go back one 'recursion' step */ check_chainloops()
/linux-4.1.27/drivers/scsi/isci/
H A Dhost.c926 /* Caution recursion ahead be forwarned sci_controller_start_next_phy()
/linux-4.1.27/drivers/atm/
H A Dhorizon.c927 // Note on tail recursion: a GCC developer said that it is not likely
/linux-4.1.27/kernel/rcu/
H A Dtree_plugin.h581 * recursively up the tree. (Calm down, calm down, we do the recursion
H A Dtree.c2105 * endless recursion -- or would do so if it wasn't for the self-deadlock
/linux-4.1.27/tools/testing/ktest/
H A Dktest.pl3505 # prevent recursion
/linux-4.1.27/kernel/sched/
H A Dcore.c2909 * 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 D3c59x.c2140 * 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 Dixgbevf_main.c141 * potential recursion. ixgbevf_check_remove()
/linux-4.1.27/drivers/net/wireless/b43/
H A Dmain.c1889 * so we avoid that recursion. */ b43_handle_firmware_panic()
/linux-4.1.27/fs/ubifs/
H A Dtnc.c2093 /* Tail recursion */ tnc_insert()
/linux-4.1.27/fs/jfs/
H A Djfs_dmap.c2580 * again (recursion) for the next higher level of the mapping to dbAdjCtl()
/linux-4.1.27/fs/ext4/
H A Dext4.h822 * well as infinite recursion, since it isn't turtles all the way
H A Dsuper.c5357 /* Don't account quota for quota files to avoid recursion */ ext4_quota_enable()
/linux-4.1.27/drivers/usb/host/
H A Dfotg210-hcd.c3251 if (!nested) /* Avoid recursion */ start_iaa_cycle()
H A Dfusbh200-hcd.c3198 if (!nested) /* Avoid recursion */ start_iaa_cycle()
/linux-4.1.27/drivers/net/ethernet/intel/ixgbe/
H A Dixgbe_main.c328 * potential recursion. ixgbe_check_remove()
/linux-4.1.27/drivers/net/ethernet/intel/i40e/
H A Di40e_main.c8973 * This uses recursion to find the tips of the branch to be
/linux-4.1.27/drivers/scsi/aic7xxx/
H A Daic79xx_core.c1673 panic("ahd_run_qoutfifo recursion"); ahd_run_qoutfifo()
/linux-4.1.27/drivers/media/dvb-frontends/drx39xyj/
H A Ddrxj.c1825 * Using DAP FASI directly to avoid endless recursion of RMWs to audio registers.

Completed in 8629 milliseconds