| /linux-4.1.27/drivers/gpu/drm/savage/ |
| D | savage_state.c | 282 unsigned char reorder = 0; in savage_dispatch_dma_prim() local
300 reorder = 1; in savage_dispatch_dma_prim()
336 if (reorder) { in savage_dispatch_dma_prim()
375 if (reorder) { in savage_dispatch_dma_prim()
379 int reorder[3] = { -1, -1, -1 }; in savage_dispatch_dma_prim() local
380 reorder[start % 3] = 2; in savage_dispatch_dma_prim()
386 BCI_WRITE((i + reorder[i % 3]) | in savage_dispatch_dma_prim()
388 reorder[(i + 1) % 3]) << 16)); in savage_dispatch_dma_prim()
390 BCI_WRITE(i + reorder[i % 3]); in savage_dispatch_dma_prim()
423 unsigned char reorder = 0; in savage_dispatch_vb_prim() local
[all …]
|
| /linux-4.1.27/kernel/ |
| D | padata.c | 175 struct padata_list *reorder; in padata_get_next() local
190 reorder = &next_queue->reorder; in padata_get_next()
192 if (!list_empty(&reorder->list)) { in padata_get_next()
193 padata = list_entry(reorder->list.next, in padata_get_next()
196 spin_lock(&reorder->lock); in padata_get_next()
199 spin_unlock(&reorder->lock); in padata_get_next()
339 spin_lock(&pqueue->reorder.lock); in padata_do_serial()
341 list_add_tail(&padata->list, &pqueue->reorder.list); in padata_do_serial()
342 spin_unlock(&pqueue->reorder.lock); in padata_do_serial()
400 __padata_list_init(&pqueue->reorder); in padata_init_pqueues()
|
| /linux-4.1.27/arch/mips/lib/ |
| D | memcpy.S | 363 .set reorder /* DADDI_WAR */ define
379 .set reorder /* DADDI_WAR */ define
464 .set reorder /* DADDI_WAR */ define
481 .set reorder /* DADDI_WAR */ define
554 .set reorder /* DADDI_WAR */ define
576 .set reorder /* DADDI_WAR */ define
598 .set reorder; /* DADDI_WAR */ \
614 .set reorder /* DADDI_WAR */ define
649 .set reorder /* DADDI_WAR */ define
664 .set reorder /* DADDI_WAR */ define
|
| D | csum_partial.S | 196 .set reorder /* DADDI_WAR */ define
228 .set reorder /* DADDI_WAR */ define
297 .set reorder define
522 .set reorder /* DADDI_WAR */ define
554 .set reorder /* DADDI_WAR */ define
570 .set reorder /* DADDI_WAR */ define
596 .set reorder define
659 .set reorder /* DADDI_WAR */ define
676 .set reorder /* DADDI_WAR */ define
750 .set reorder define
[all …]
|
| D | strnlen_user.S | 57 .set reorder define
|
| D | memset.S | 154 .set reorder define
|
| /linux-4.1.27/arch/mips/include/asm/ |
| D | asm.h | 100 .set reorder; \
113 .set reorder; \
180 .set reorder; \
187 .set reorder; \
|
| D | stackframe.h | 149 .set reorder
180 .set reorder
289 .set reorder
327 .set reorder
|
| /linux-4.1.27/net/sched/ |
| D | sch_netem.c | 89 u32 reorder; member
473 q->reorder < get_crandom(&q->reorder_cor)) { in netem_enqueue()
692 q->reorder = r->probability; in get_reorder()
859 q->reorder = ~0; in netem_change()
966 struct tc_netem_reorder reorder; in netem_dump() local
985 reorder.probability = q->reorder; in netem_dump()
986 reorder.correlation = q->reorder_cor.rho; in netem_dump()
987 if (nla_put(skb, TCA_NETEM_REORDER, sizeof(reorder), &reorder)) in netem_dump()
|
| /linux-4.1.27/arch/x86/boot/ |
| D | code16gcc.h | 5 # This is done this way instead via asm() to make sure gcc does not reorder
|
| /linux-4.1.27/drivers/net/wimax/i2400m/ |
| D | rx.c | 988 u32 reorder; in i2400m_rx_edata() local
1023 reorder = le32_to_cpu(hdr->reorder); in i2400m_rx_edata()
1024 ro_needed = reorder & I2400M_RO_NEEDED; in i2400m_rx_edata()
1027 ro_type = (reorder >> I2400M_RO_TYPE_SHIFT) & I2400M_RO_TYPE; in i2400m_rx_edata()
1028 ro_cin = (reorder >> I2400M_RO_CIN_SHIFT) & I2400M_RO_CIN; in i2400m_rx_edata()
1029 ro_sn = (reorder >> I2400M_RO_SN_SHIFT) & I2400M_RO_SN; in i2400m_rx_edata()
|
| D | control.c | 1397 dlhr.reorder = 1; in i2400m_dev_initialize()
|
| /linux-4.1.27/include/uapi/linux/wimax/ |
| D | i2400m.h | 227 __le32 reorder; /* bits defined in i2400m_ro */ member
567 __u8 reorder; /* 0 disabled, 1 enabled */ member
|
| /linux-4.1.27/include/linux/ |
| D | padata.h | 93 struct padata_list reorder; member
|
| /linux-4.1.27/arch/mips/include/asm/mach-malta/ |
| D | kernel-entry-init.h | 42 .set reorder
|
| /linux-4.1.27/drivers/staging/slicoss/ |
| D | TODO | 19 - reorder code to elminate use of forward declarations
|
| /linux-4.1.27/drivers/net/wireless/brcm80211/brcmfmac/ |
| D | core.h | 195 u8 *reorder; member
|
| D | core.c | 540 if (rd->reorder) in brcmf_rx_frame()
541 brcmf_rxreorder_process_info(ifp, rd->reorder, skb); in brcmf_rx_frame()
|
| D | fwsignal.c | 1681 rd->reorder = data; in brcmf_fws_hdrpull()
|
| /linux-4.1.27/arch/mips/kernel/ |
| D | mcount.S | 220 .set reorder define
|
| D | r2300_fpu.S | 126 .set reorder define
|
| D | genex.S | 501 .set reorder define
|
| D | r4k_fpu.S | 277 .set reorder define
|
| D | octeon_switch.S | 78 .set reorder define
|
| D | scall64-o32.S | 123 .set reorder define
|
| /linux-4.1.27/arch/arm/mach-pxa/ |
| D | sleep.S | 157 @ Do not reorder...
|
| /linux-4.1.27/Documentation/RCU/ |
| D | checklist.txt | 93 given modern CPUs' tendency to reorder memory references.
119 Please note that compilers can also reorder code, and
412 and the compiler to freely reorder code into and out of RCU
|
| D | rcu_dereference.txt | 146 to reorder the non-existent subsequent dereferences.
199 value-speculation optimizations reorder operations by design.
|
| /linux-4.1.27/net/dccp/ |
| D | feat.c | 1062 bool is_server, bool reorder) in dccp_feat_reconcile() argument
1076 if (!reorder) in dccp_feat_reconcile()
|
| /linux-4.1.27/Documentation/networking/ |
| D | l2tp.txt | 131 REORDERTO - reorder timeout (in millisecs). If 0, don't try to reorder.
|
| D | timestamping.txt | 238 itself does not reorder the segments. The stack indeed tries to avoid
|
| D | bonding.txt | 2242 coalescing), and a "many to many" topology will reorder at a
|
| /linux-4.1.27/arch/mips/include/asm/sibyte/ |
| D | sb1250_scd.h | 156 .set reorder ; \
|
| /linux-4.1.27/Documentation/ |
| D | memory-barriers.txt | 500 hardware[*] will not reorder the memory accesses. CPU cache coherency
637 b = p; /* BUG: Compiler and CPU can both reorder!!! */
670 'b', which means that the CPU is within its rights to reorder them:
1351 (*) The compiler is within its rights to reorder loads and stores
1353 rights to reorder loads to the same variable. This means that
1474 (*) The compiler is within its rights to reorder memory accesses unless
1619 which may then reorder things however it wishes.
2464 efficient to reorder, combine or merge accesses - something that would cause
2630 Similarly, it has to be assumed that compiler might reorder the instruction
2949 reorder successive loads to the same location. On such architectures,
|
| D | unaligned-memory-access.txt | 106 that you could reorder the fields in the structure in order to place fields
|
| D | DMA-API-HOWTO.txt | 340 proper memory barriers. The CPU may reorder stores to
|
| /linux-4.1.27/drivers/scsi/ |
| D | u14-34f.c | 1578 static int reorder(unsigned int j, unsigned long cursec, in reorder() function
1697 if (reorder(j, cursec, ihdlr, il, n_ready)) n_ready = 1; in flush_dev()
|
| D | eata.c | 2098 static int reorder(struct hostdata *ha, unsigned long cursec, in reorder() function
2262 if (reorder(ha, cursec, ihdlr, il, n_ready)) in flush_dev()
|
| /linux-4.1.27/ |
| D | Makefile | 628 KBUILD_CFLAGS += $(call cc-option,-fno-reorder-blocks,) \
|
| /linux-4.1.27/Documentation/filesystems/ |
| D | porting | 287 and vmtruncate, and the reorder the vmtruncate + foofs_vmtruncate sequence to
|
| /linux-4.1.27/arch/mips/ |
| D | Kconfig | 1870 # CPU may reorder R->R, R->W, W->R, W->W
1877 # CPU may reorder reads and writes beyond LL/SC
1878 # CPU may reorder R->LL, R->LL, W->LL, W->LL, R->SC, R->SC, W->SC, W->SC
|
| /linux-4.1.27/Documentation/scsi/ |
| D | ChangeLog.megaraid | 428 iii. Module compilation reorder in Makefile so that unresolved symbols do
|