/linux-4.1.27/arch/arm/include/asm/ |
H A D | glue.h | 12 * into the kernel in an efficient manner. The idea is to use branches
|
H A D | kgdb.h | 69 * conditional branches.
|
/linux-4.1.27/arch/nios2/include/asm/ |
H A D | asm-macros.h | 102 * Tests the bit in reg2 and branches to label if the 114 * Tests the bit in reg2 and branches to label if the 191 * original bit was zero it branches to label. 204 * original bit was non-zero it branches to label. 217 * original bit was zero it branches to label. 230 * original bit was non-zero it branches to label. 243 * original bit was zero it branches to label. 256 * original bit was non-zero it branches to label. 268 * If the all the bits in the mask are zero it branches to label. 280 * If the any of the bits in the mask are 1 it branches to label.
|
/linux-4.1.27/arch/sparc/include/asm/ |
H A D | spinlock_64.h | 18 * code. They live in their own section, but the newer V9 branches 20 * variants. The rule is that the branches that go into and out of 21 * the spinner sections must be pre-V9 branches.
|
/linux-4.1.27/arch/powerpc/include/asm/ |
H A D | kdump.h | 19 * branches, so we can just add the PAGE_OFFSET and don't worry about it.
|
/linux-4.1.27/include/linux/ |
H A D | jump_label.h | 10 * Jump labels provide an interface to generate dynamic branches using 17 * object, and for as long as there are references all branches referring to 22 * OTOH, since the affected branches are unconditional, their runtime overhead
|
H A D | percpu-refcount.h | 126 * branches as it can't assume that @ref->percpu_count is not NULL.
|
H A D | etherdevice.h | 292 * The function doesn't need any conditional branches and possibly uses
|
H A D | perf_event.h | 71 * nr: number of taken branches stored in entries[] 74 * branches (to, from) are stored from most recent
|
/linux-4.1.27/arch/c6x/kernel/ |
H A D | vectors.S | 13 ; branches to the label _c_int00 which handles initialization for the C code.
|
/linux-4.1.27/arch/arm/mach-realview/ |
H A D | platsmp.c | 72 * secondary CPU branches to this address. realview_smp_prepare_cpus()
|
/linux-4.1.27/arch/arm/mach-vexpress/ |
H A D | platsmp.c | 62 * secondary CPU branches to this address. vexpress_smp_dt_prepare_cpus()
|
/linux-4.1.27/arch/mips/kernel/ |
H A D | branch.c | 252 * exception only. It does not handle compact branches/jumps and cannot 253 * be used in interrupt context. (Compact branches/jumps do not cause 310 * exception only. It does not handle compact branches/jumps and cannot 311 * be used in interrupt context. (Compact branches/jumps do not cause 406 * MIPS R6 Compact branches and forbidden slots: 407 * Compact branches do not throw exceptions because they do 607 * Compact branches for R6 for the __compute_return_epc_for_insn() 642 * Compact branches for R6 for the __compute_return_epc_for_insn() 832 * Compact branches: __compute_return_epc_for_insn()
|
/linux-4.1.27/arch/powerpc/net/ |
H A D | bpf_jit_comp.c | 460 /*** Jump and branches ***/ bpf_jit_build_body() 522 /* Sometimes branches are constructed "backward", with bpf_jit_build_body() 577 * The range of standard conditional branches is +/- 32Kbytes. Since bpf_jit_compile() 580 * used, distinct from short branches. bpf_jit_compile() 584 * For now, both branch types assemble to 2 words (short branches padded bpf_jit_compile() 591 * All generation choices assumed to be 'worst-case', e.g. branches all bpf_jit_compile() 604 * If we optimise this, near branches will be shorter. On the bpf_jit_compile() 606 * generate the biggest code. On subsequent passes, branches will be bpf_jit_compile() 608 * code, more branches may fall into the short category, and code will bpf_jit_compile()
|
/linux-4.1.27/tools/perf/scripts/python/ |
H A D | export-to-postgresql.py | 47 print >> sys.stderr, "where: columns 'all' or 'branches'" 61 if columns not in ("all", "branches"): 64 branches = (columns == "branches") variable 138 if branches: 430 if branches:
|
/linux-4.1.27/arch/x86/kernel/cpu/ |
H A D | perf_event_intel_lbr.c | 35 #define LBR_JCC_BIT 2 /* do not capture conditional branches */ 41 #define LBR_FAR_BIT 8 /* do not capture far branches */ 76 * x86control flow changes include branches, interrupts, traps, faults 537 * all branches, may need the help of the SW filter 774 * we need to inspect opcodes. Mismatched branches are 775 * discarded. Therefore, the number of branches returned 786 /* if sampling all branches, then nothing to filter */ intel_pmu_lbr_filter() 838 * NHM/WSM erratum: must include REL_JMP+IND_JMP to get CALL branches
|
H A D | perf_event.c | 442 * using the LBR to capture ALL taken branches at the 450 /* must capture all branches */ precise_br_compat() 504 * the branches at the priv level of the x86_pmu_hw_config()
|
H A D | perf_event_p4.c | 692 /* mispredicted branches retired */
|
/linux-4.1.27/arch/xtensa/lib/ |
H A D | memset.S | 26 * This code tries to use fall-through branches for the common 27 * case of an aligned destination (except for the branches to
|
H A D | checksum.S | 299 one 2-byte chunk. (2) It branches to here from above if
|
H A D | usercopy.S | 38 * case of aligned destinations (except for the branches to
|
H A D | memcopy.S | 53 * This code tries to use fall-through branches for the common
|
/linux-4.1.27/arch/parisc/ |
H A D | Makefile | 64 # (> 0x40000) for branches to reach stubs. 69 # Use long jumps instead of long branches (needed if your linker fails to
|
/linux-4.1.27/drivers/staging/lustre/include/linux/lnet/linux/ |
H A D | lib-lnet.h | 50 /* compiler optimizer will elide unused branches */ lnet_page2phys()
|
/linux-4.1.27/arch/sh/lib64/ |
H A D | copy_page.S | 64 /* Minimal code size. The extra branches inside the loop don't cost much
|
/linux-4.1.27/arch/mips/include/asm/ |
H A D | kprobes.h | 87 /* Per-thread fields, used while emulating branches */
|
H A D | uasm.h | 288 /* Convenience functions for labeled branches. */
|
/linux-4.1.27/arch/powerpc/platforms/cell/spufs/ |
H A D | spu_save_crt0.S | 8 * branches to 'main'.
|
H A D | spu_restore_crt0.S | 7 * sequence. Sets up an initial stack frame, then branches to
|
/linux-4.1.27/arch/m68k/ifpsp060/ |
H A D | iskeleton.S | 60 | _isp_unimp() branches to here so that the operating system 88 | stack frame and branches to this routine. 123 | Integer Instruction stack frame and branches to this routine. 128 | stack frame and branches to the _real_trace() entry point.
|
/linux-4.1.27/arch/blackfin/kernel/ |
H A D | perf_event.c | 36 * 0x04 o pc invariant branches 37 * 0x06 o mispredicted branches 38 * 0x09 o predicted branches taken
|
/linux-4.1.27/arch/arm/mach-spear/ |
H A D | platsmp.c | 118 * soft interrupt, and then the secondary CPU branches to this address. spear13xx_smp_prepare_cpus()
|
/linux-4.1.27/arch/arm/mach-mvebu/ |
H A D | platsmp-a9.c | 37 * soft interrupt, and then the secondary CPU branches to this mvebu_cortex_a9_boot_secondary()
|
/linux-4.1.27/tools/perf/util/ |
H A D | thread-stack.h | 52 * @branch_count: number of branches seen between call and return
|
H A D | evsel.c | 261 "branches", 377 { "branch", "branches", "bpu", "btb", "bpc", },
|
H A D | hist.c | 625 * The report shows the percentage of total branches captured iter_add_next_branch_entry()
|
H A D | parse-events.c | 56 .alias = "branches",
|
H A D | machine.c | 1629 * Add branches to call stack for easier browsing. This gives thread__resolve_callchain_sample()
|
/linux-4.1.27/arch/sparc/kernel/ |
H A D | ktlb.S | 23 /* sun4v_itlb_miss branches here with the missing virtual 131 /* sun4v_dtlb_miss branches here with the missing virtual
|
H A D | spiterrs.S | 19 /* __spitfire_cee_trap branches here with AFSR in %g4 and
|
H A D | kprobes.c | 40 * to handle relative branches correctly. See below.
|
H A D | wof.S | 151 /* This instruction branches to a routine which will check
|
/linux-4.1.27/fs/ubifs/ |
H A D | misc.h | 217 return (struct ubifs_branch *)((void *)idx->branches + ubifs_idx_branch() 229 return (void *)((struct ubifs_branch *)idx->branches)->key; ubifs_idx_key()
|
H A D | ubifs-media.h | 753 * @branches: LEB number / offset / length / key branches 759 __u8 branches[]; member in struct:ubifs_idx_node
|
H A D | lpt.c | 690 * To calculate the internal node branches, we keep information about ubifs_create_dflt_lpt() 745 /* Set branches to the level below */ ubifs_create_dflt_lpt()
|
H A D | replay.c | 226 /* Set c->replay_sqnum to help deal with dangling branches. */ apply_replay_entry()
|
H A D | ubifs.h | 609 * @nbranch: branches to child nodes 772 * @zbranch: array of znode branches (@c->fanout elements)
|
H A D | io.c | 64 * not aligned lengths. Indexing nodes also store real lengths in branches.
|
/linux-4.1.27/arch/ia64/lib/ |
H A D | clear_user.S | 42 // contains only 2 branches. 95 // so we focus on alignment (no branches required)
|
H A D | memcpy.S | 42 * so, we handle everything with no taken branches (other than the loop
|
H A D | memset.S | 41 #define p_scr p6 // default register for same-cycle branches
|
/linux-4.1.27/kernel/trace/ |
H A D | trace_branch.c | 352 "annotated branches stats\n"); init_annotated_branch_stats() 408 "all branches stats\n"); all_annotated_branch_stats()
|
H A D | trace_events_filter.c | 462 * climbing up and down the tree branches, an array of the
|
/linux-4.1.27/include/uapi/linux/ |
H A D | perf_event.h | 153 * of branches and therefore it supersedes all the other types. 156 PERF_SAMPLE_BRANCH_USER_SHIFT = 0, /* user branches */ 157 PERF_SAMPLE_BRANCH_KERNEL_SHIFT = 1, /* kernel branches */ 158 PERF_SAMPLE_BRANCH_HV_SHIFT = 2, /* hypervisor branches */ 167 PERF_SAMPLE_BRANCH_COND_SHIFT = 10, /* conditional branches */
|
/linux-4.1.27/arch/xtensa/include/asm/ |
H A D | uaccess.h | 81 * On success, kernel_ok branches to a label indicated by parameter 110 * On error, user_ok branches to a label indicated by parameter 140 * On error, access_ok branches to a label indicated by parameter
|
/linux-4.1.27/arch/mips/math-emu/ |
H A D | dsemul.c | 64 * branches, but gives us a cleaner interface to the exception mips_dsemul()
|
H A D | cp1emu.c | 561 * Compact branches for R6 for the isBranchInstr() 597 * Compact branches for R6 for the isBranchInstr() 705 /* Need to check for R6 bc1nez and bc1eqz branches */ isBranchInstr()
|
/linux-4.1.27/arch/arc/ |
H A D | Makefile | 115 # and gcc choosing optimal(shorter) branches at -O3
|
/linux-4.1.27/arch/arc/kernel/ |
H A D | module.c | 103 * so any branches/jumps are absolute 32 bit jmps apply_relocate_add()
|
H A D | signal.c | 44 * on resuming user mode, signal handler branches off to BTA of orig JMP
|
H A D | entry.S | 21 * -Vector table jumps (@8 bytes) converted into branches (@4 bytes)
|
/linux-4.1.27/arch/parisc/kernel/ |
H A D | perf_images.h | 223 * ctr1: predicted taken branches, actually taken 224 * ctr2: all predicted taken branches (nullfied or not) 270 * ctr1: counts branches predicted not-taken, but actually taken 271 * ctr2: counts all predictable branches predicted not-taken 1953 * ctr0: counts non-nullified unpredictable branches 1955 * ctr2: counts all unpredictable branches (nullified or not) 2290 * ctr0: mispredicted branches 2291 * ctr1: predicted taken branches, actually taken 2292 * ctr2: predicted taken branches (includes nullfied) 2293 * ctr3: all branches 2337 * ctr0: mispredicted branches 2338 * ctr1: branches predicted not-taken, but actually taken 2339 * ctr2: branches predicted not-taken (includes nullified) 2340 * ctr3: all branches 2996 * ctr0 : Total number of mispredicted branches. 2997 * ctr1 : Some Non-Nullified unpredictable branches. 2998 * ctr2 : Total number of branches (Nullified + Non-Nullified) 3001 * ctr3 : Remaining Non-Nullified unpredictable branches. 3044 * ctr0: correctly predicted branches by the pop_latch 3046 * ctr2: all branches, (includes nullified)
|
H A D | module.c | 491 * for direct branches (jumps between different section of the get_stub()
|
H A D | pacache.S | 683 /* conditional branches nullify on forward taken branch, and on
|
/linux-4.1.27/arch/ia64/kernel/ |
H A D | irq_ia64.c | 434 * That's where the IVT branches when we get an external 435 * interrupt. This branches to the correct hardware IRQ handler via
|
H A D | gate.S | 21 * complications with the linker (which likes to create PLT stubs for branches
|
/linux-4.1.27/include/drm/ |
H A D | drm_dp_mst_helper.h | 110 * primary branch device at the root, along with any other branches connected 111 * to downstream port of parent branches.
|
/linux-4.1.27/arch/x86/mm/ |
H A D | tlb.c | 213 * Both branches below are implicit full barriers (MOV to CR or flush_tlb_mm_range()
|
/linux-4.1.27/drivers/clk/rockchip/ |
H A D | clk.c | 33 * Most clock branches have a form like
|
/linux-4.1.27/drivers/video/fbdev/aty/ |
H A D | radeon_accel.c | 4 * "ACCEL_MMIO" ifdef branches in XFree86
|
/linux-4.1.27/include/uapi/linux/netfilter_bridge/ |
H A D | ebtables.h | 21 /* verdicts >0 are "branches" */
|
/linux-4.1.27/arch/s390/kernel/ |
H A D | ftrace.c | 47 * The jg instruction branches to offset 24 to skip as many instructions
|
H A D | uprobes.c | 63 /* all branches */ check_per_event()
|
/linux-4.1.27/arch/sh/kernel/cpu/sh4a/ |
H A D | perf_event.c | 69 * 0x0204 number of unconditional branches
|
/linux-4.1.27/arch/parisc/include/asm/ |
H A D | bitops.h | 127 * This algorithm avoids branches by making use of nullification.
|
/linux-4.1.27/arch/powerpc/kernel/ |
H A D | uprobes.c | 122 * including ones that alter code flow (branches, calls, returns) arch_uprobe_post_xol()
|
H A D | setup_64.c | 791 * The hardlockup detector breaks PMU event based branches and is likely
|
H A D | head_8xx.S | 76 * adding more processor specific branches around code I don't need.
|
H A D | exceptions-64e.S | 1389 * into the new core via SCOM. That doesn't process branches, so there
|
H A D | exceptions-64s.S | 91 * Therefore any relative branches in this section must only
|
/linux-4.1.27/arch/powerpc/lib/ |
H A D | copy_32.S | 305 * this stuff handles faults in the cacheline loop and branches to either
|
H A D | sstep.c | 638 * branches, and barrier instructions).
|
/linux-4.1.27/arch/alpha/kernel/ |
H A D | ptrace.c | 194 * branch (emulation can be tricky for fp branches). ptrace_set_bpt()
|
/linux-4.1.27/arch/alpha/oprofile/ |
H A D | op_model_ev67.c | 246 /* Unfortunately, TAK is undefined on mispredicted branches. ev67_handle_interrupt()
|
/linux-4.1.27/arch/tile/kernel/ |
H A D | single_step.c | 422 /* branches */ single_step_once() 428 * For branches, we use a rewriting trick to let the single_step_once()
|
/linux-4.1.27/fs/ext4/ |
H A D | move_extent.c | 672 /* Swap original branches with new branches */ ext4_move_extents()
|
H A D | indirect.c | 1079 * ext4_free_branches - free an array of branches 1085 * @depth: depth of the branches to free 1087 * We are freeing all blocks referred from these branches (numbers are 1133 BUFFER_TRACE(bh, "free child branches"); ext4_free_branches() 1500 * The start and end partial branches may not be at the same ext4_ind_remove_space()
|
/linux-4.1.27/drivers/video/fbdev/core/ |
H A D | cfbcopyarea.c | 22 * help moving some redundant computations and branches out of the loop, too.
|
/linux-4.1.27/arch/mn10300/kernel/ |
H A D | kgdb.c | 264 /* potential 3-byte conditional branches */ kgdb_arch_do_singlestep()
|
H A D | kprobes.c | 224 /* potential 3-byte conditional branches */ find_nextpc()
|
H A D | gdb-stub.c | 636 /* potential 3-byte conditional branches */ gdbstub_single_step()
|
/linux-4.1.27/arch/arm/probes/kprobes/ |
H A D | test-core.h | 96 * Or for branches, TEST_BRANCH_B and TEST_BRANCH_F (branch forwards/backwards).
|
H A D | test-core.c | 69 * The test case is constructed such that test_insn branches to 73 * backwards branches... 76 * b test_done @ helps to cope with off by 1 branches
|
/linux-4.1.27/arch/arm/mach-exynos/ |
H A D | platsmp.c | 395 * secondary CPU branches to this address. exynos_smp_prepare_cpus()
|
/linux-4.1.27/arch/alpha/include/asm/ |
H A D | uaccess.h | 448 * (not off of the *next* instruction as branches are).
|
/linux-4.1.27/arch/alpha/math-emu/ |
H A D | math.c | 361 case 0x30 ... 0x3f: /* branches */ alpha_fp_emul_imprecise()
|
/linux-4.1.27/kernel/bpf/ |
H A D | verifier.c | 23 * All paths of conditional branches are analyzed until 'bpf_exit' insn. 34 * insn is less then 4K, but there are too many branches that change stack/regs. 35 * Number of 'branches to be analyzed' is limited to 1k 1467 * this function is called when verifier exploring different branches of 2006 /* adjust branches in the whole program */ convert_ctx_accesses()
|
/linux-4.1.27/fs/ext2/ |
H A D | inode.c | 1042 * ext2_free_branches - free an array of branches 1046 * @depth: depth of the branches to free 1048 * We are freeing all blocks referred from these branches (numbers are
|
/linux-4.1.27/tools/perf/ |
H A D | builtin-stat.c | 24 484,357,498 branches # 283.455 M/sec 25 6,388,934 branch-misses # 1.32% of all branches 959 fprintf(output, " of all branches "); print_branch_misses()
|
H A D | builtin-report.c | 655 "Display callchains using output_type (graph, flat, fractal, or none) , min percent threshold, optional print limit, callchain order, key (function or address), add branches. " cmd_report()
|
H A D | builtin-record.c | 913 "branch any", "sample any taken branches",
|
/linux-4.1.27/drivers/media/rc/ |
H A D | iguanair.c | 321 * for a branch. Immediately following the branches, there iguanair_set_tx_carrier()
|
/linux-4.1.27/arch/x86/include/uapi/asm/ |
H A D | msr-index.h | 127 #define DEBUGCTLMSR_BTF (1UL << 1) /* single-step on branches */
|
/linux-4.1.27/arch/sh/kernel/ |
H A D | kprobes.c | 144 * on the next instruction, following branches. Two probes are set if the
|
H A D | traps_64.c | 644 in some situations, inter-mode branches from SHcompact -> SHmedia
|
/linux-4.1.27/arch/sparc/lib/ |
H A D | memcpy.S | 181 so even if it looks weird, the branches
|
/linux-4.1.27/drivers/w1/masters/ |
H A D | ds2482.c | 295 * @param dbit The direction to choose if both branches are valid
|
/linux-4.1.27/arch/mips/mm/ |
H A D | uasm.c | 508 /* Convenience functions for labeled branches. */ uasm_il_bltz()
|
/linux-4.1.27/arch/m68k/fpsp040/ |
H A D | x_operr.S | 303 | and does an rte. If enabled, it cleans up the stack and branches
|
H A D | setox.S | 64 | Notes: The usual case should take the branches 1.1 -> 1.3 -> 2. 226 | Notes: The usual case should take the branches 1.1 -> 1.3 -> 2.
|
H A D | get_op.S | 9 | determines the opclass (0, 2, or 3) and branches to the
|
/linux-4.1.27/samples/bpf/ |
H A D | test_verifier.c | 213 "program doesn't init R0 before exit in all branches",
|
/linux-4.1.27/arch/s390/net/ |
H A D | bpf_jit_comp.c | 974 * For s390x relative branches: ip = ip + off_bytes bpf_jit_insn() 975 * For BPF relative branches: insn = insn + off_insns + 1 bpf_jit_insn()
|
/linux-4.1.27/arch/mips/net/ |
H A D | bpf_jit.c | 488 /* Compute the immediate value for PC-relative branches. */ b_imm() 495 * We want a pc-relative branch. We only do forward branches b_imm()
|
/linux-4.1.27/drivers/infiniband/hw/mlx5/ |
H A D | odp.c | 233 * Avoid branches - this code will perform correctly pagefault_single_data_segment()
|
/linux-4.1.27/arch/unicore32/kernel/ |
H A D | entry.S | 682 * This code is copied to 0xffff0200 so we can use branches in the
|
/linux-4.1.27/arch/mips/lib/ |
H A D | memcpy.S | 393 * wide-issue mips processors because the code has fewer branches and
|
H A D | csum_partial.S | 583 * wide-issue mips processors because the code has fewer branches and
|
/linux-4.1.27/arch/cris/arch-v10/lib/ |
H A D | usercopy.c | 20 delay-slots for taken branches. Note also that the postincrement in
|
/linux-4.1.27/net/ipv4/ |
H A D | ip_gre.c | 102 (branches, that exceed pmtu are pruned) and tunnel mtu
|
H A D | af_inet.c | 808 /* Remaining two branches are temporary solution for missing inet_shutdown()
|
/linux-4.1.27/drivers/edac/ |
H A D | i5400_edac.c | 21 * This Memory Controller manages DDR2 FB-DIMMs. It has 2 branches, each with 831 * 2 branches, each with 2 channels
|
H A D | i7300_edac.c | 59 * channels on both branches should be filled
|
H A D | i5000_edac.c | 921 * 2 branches, each with 2 channels
|
/linux-4.1.27/drivers/media/platform/vsp1/ |
H A D | vsp1_video.c | 459 * contains no loop and that all branches end at the output WPF. vsp1_pipeline_validate()
|
/linux-4.1.27/drivers/usb/host/ |
H A D | ohci-hcd.c | 1042 /* empty the interrupt branches */ ohci_restart()
|
/linux-4.1.27/arch/cris/arch-v10/kernel/ |
H A D | head.S | 156 ;; Jumpgate for branches.
|
/linux-4.1.27/arch/m68k/ifpsp060/src/ |
H A D | ilsp.S | 32 # effect, branches to one of the branch table entries located here.
|
H A D | isp.S | 32 # effect, branches to one of the branch table entries located 2968 # The routine then branches to _real_cas(). This external routine #
|
H A D | fplsp.S | 33 # effect, branches to one of the branch table entries located here. 6718 # Notes: The usual case should take the branches 1.1 -> 1.3 -> 2.# 6886 # Notes: The usual case should take the branches 1.1 -> 1.3 -> 2.#
|
H A D | fpsp.S | 33 # effect, branches to one of the branch table entries located 3763 # adjusts the operand using fix_skewed_ops() and then branches to # 6824 # Notes: The usual case should take the branches 1.1 -> 1.3 -> 2.# 6992 # Notes: The usual case should take the branches 1.1 -> 1.3 -> 2.# 16265 # the stacked fdbcc instruction opcode and then branches to a routine # 16894 # the stacked ftrapcc instruction opcode and then branches to a routine # 17466 # the stacked fscc instruction opcode and then branches to a routine #
|
H A D | pfpsp.S | 32 # effect, branches to one of the branch table entries located 3762 # adjusts the operand using fix_skewed_ops() and then branches to #
|
/linux-4.1.27/arch/arm/kernel/ |
H A D | entry-armv.S | 1026 * This code is copied to 0xffff1000 so we can use branches in the
|
/linux-4.1.27/fs/ext3/ |
H A D | inode.c | 2329 * ext3_free_branches - free an array of branches 2335 * @depth: depth of the branches to free 2337 * We are freeing all blocks referred from these branches (numbers are 2375 BUFFER_TRACE(bh, "free child branches"); ext3_free_branches()
|
/linux-4.1.27/kernel/ |
H A D | seccomp.c | 524 /* Clean up single-reference branches iteratively. */ put_seccomp_filter()
|
/linux-4.1.27/net/netfilter/ |
H A D | nfnetlink_log.c | 646 * what is actually present? way more branches and checks, but more nfulnl_log_packet()
|
/linux-4.1.27/arch/s390/include/asm/ |
H A D | pgtable.h | 104 * modules will reside. That makes sure that inter module branches always
|
/linux-4.1.27/net/core/ |
H A D | filter.c | 618 * a cell if not previously written, and we check all branches to be sure
|
/linux-4.1.27/net/ipv6/ |
H A D | ip6_fib.c | 560 * the branches would not match less specific routes fib6_add_1()
|
/linux-4.1.27/lib/ |
H A D | radix-tree.c | 57 * and then inserting an item at index ULONG_MAX. This requires 2 new branches
|
H A D | assoc_array.c | 53 * we're iterating over the branches rooted here (we may, however, see assoc_array_subtree_iterate()
|
/linux-4.1.27/drivers/media/usb/uvc/ |
H A D | uvc_driver.c | 1282 * Extension Units connected to the main chain as single-unit branches are
|
/linux-4.1.27/arch/x86/lguest/ |
H A D | boot.c | 1355 * kernel, but it's slow because of all the indirect branches.
|
/linux-4.1.27/arch/powerpc/perf/ |
H A D | core-book3s.c | 466 /* Target branches use two entries power_pmu_bhrb_read()
|
/linux-4.1.27/fs/ceph/ |
H A D | inode.c | 238 * branches/splits are included in i_fragtree)
|
/linux-4.1.27/fs/ocfs2/ |
H A D | alloc.c | 1101 * Change range of the branches in the right most path according to the leaf 3180 * a) There are branches to the left. ocfs2_rotate_tree_left()
|
/linux-4.1.27/arch/x86/kvm/ |
H A D | emulate.c | 171 #define NearBranch ((u64)1 << 52) /* Near branches */
|