| /linux/arch/mips/kernel/ |
| H A D | bmips_5xxx_init.S | 39 .set reorder ;
199 .set reorder define
291 .set reorder define
316 .set reorder define
403 .set reorder define
439 .set reorder define
472 .set reorder define
496 .set reorder define
516 .set reorder define
541 .set reorder define
[all …]
|
| H A D | r2300_fpu.S | 124 .set reorder define
|
| H A D | mcount.S | 220 .set reorder define
|
| H A D | genex.S | 153 .set reorder define
649 .set reorder define
|
| H A D | r4k_fpu.S | 411 .set reorder define
|
| H A D | octeon_switch.S | 54 .set reorder define
|
| /linux/arch/mips/lib/ |
| H A D | csum_partial.S | 198 .set reorder /* DADDI_WAR */ define
230 .set reorder /* DADDI_WAR */ define
300 .set reorder define
498 .set reorder /* DADDI_WAR */ define
530 .set reorder /* DADDI_WAR */ define
546 .set reorder /* DADDI_WAR */ define
572 .set reorder define
635 .set reorder /* DADDI_WAR */ define
652 .set reorder /* DADDI_WAR */ define
726 .set reorder define
|
| H A D | strnlen_user.S | 55 .set reorder define
|
| /linux/net/sched/ |
| H A D | sch_netem.c | 108 u32 reorder;
579 q->reorder < get_crandom(&q->reorder_cor, &q->prng)) { in netem_enqueue()
924 q->reorder = r->probability; in get_loss_clg()
1125 q->reorder = ~0; in netem_change()
1256 struct tc_netem_reorder reorder; in netem_dump()
1284 reorder.probability = q->reorder; in netem_dump()
1285 reorder.correlation = q->reorder_cor.rho; in netem_dump()
1286 if (nla_put(skb, TCA_NETEM_REORDER, sizeof(reorder), &reorder)) in netem_dump()
98 u32 reorder; global() member
1226 struct tc_netem_reorder reorder; netem_dump() local
[all...] |
| /linux/drivers/net/wireless/broadcom/brcm80211/brcmfmac/ |
| H A D | proto.h | 15 u8 *reorder; member
108 return !!rd->reorder; in brcmf_proto_is_reorder_skb()
|
| /linux/lib/crypto/mips/ |
| H A D | chacha-core.S | 169 .set reorder
180 .set reorder
197 .set reorder define
363 .set reorder define
|
| /linux/arch/mips/include/asm/ |
| H A D | asm.h | 104 .set reorder; \
117 .set reorder; \
|
| /linux/arch/mips/include/asm/mach-malta/ |
| H A D | kernel-entry-init.h | 42 .set reorder
|
| /linux/fs/xfs/libxfs/ |
| H A D | xfs_log_recover.h | 34 enum xlog_recover_reorder (*reorder)(struct xlog_recover_item *item); member
|
| /linux/tools/memory-model/Documentation/ |
| H A D | control-dependencies.txt | 53 b = 1; /* BUG: Compiler and CPU can both reorder!!! */
88 "b", which means that the CPU is within its rights to reorder them: The
195 compiler cannot reorder volatile accesses and also cannot reorder
|
| H A D | ordering.txt | 464 reorder marked writes with each other or with other unordered
472 reorder marked reads with each other or with other unordered
483 However, many CPUs will happily reorder these operations with
|
| H A D | locking.txt | 271 But suppose that the compiler was permitted to reorder the spin loop
|
| /linux/arch/arm/mach-pxa/ |
| H A D | sleep.S | 158 @ Do not reorder...
|
| /linux/net/dccp/ |
| H A D | feat.c | |
| /linux/Documentation/ |
| H A D | memory-barriers.txt | 550 hardware[*] will not reorder the memory accesses. CPU cache coherency
731 b = 1; /* BUG: Compiler and CPU can both reorder!!! */
764 'b', which means that the CPU is within its rights to reorder them:
868 compiler cannot reorder volatile accesses and also cannot reorder
1560 (*) The compiler is within its rights to reorder loads and stores
1562 rights to reorder loads to the same variable. This means that
1683 (*) The compiler is within its rights to reorder memory accesses unless
1832 which may then reorder things however it wishes.
2488 efficient to reorder, combine or merge accesses - something that would cause
2689 Similarly, it has to be assumed that compiler might reorder the instruction
[all …]
|
| /linux/arch/mips/include/asm/sibyte/ |
| H A D | sb1250_scd.h | 143 .set reorder ; \
|
| /linux/Documentation/RCU/ |
| H A D | checklist.rst | 128 CPUs' tendency to reorder memory references. One must
154 Please note that compilers can also reorder code, and
482 and the compiler to freely reorder code into and out of RCU
|
| H A D | rcu_dereference.rst | 141 to reorder the non-existent subsequent dereferences.
210 value-speculation optimizations reorder operations by design.
|
| /linux/fs/xfs/ |
| H A D | xfs_buf_item_recover.c | 1156 .reorder = xlog_recover_buf_reorder,
|
| /linux/Documentation/core-api/ |
| H A D | unaligned-memory-access.rst | 115 that you could reorder the fields in the structure in order to place fields
|