/freebsd-9.3-release/contrib/ntp/ntpd/ |
H A D | ntp_request.c | 2449 ik->shift = htons(ntx.shift);
|
H A D | ntp_control.c | 2336 if (0 == ntx.shift) \ 2427 (sys_var[varid].text, 1 << ntx.shift)
|
/freebsd-9.3-release/lib/libc/stdlib/ |
H A D | malloc.c | 2586 unsigned shift, diff, regind, elm, bit; local 2597 shift = ffs(size) - 1; 2598 diff >>= shift; local 2599 size >>= shift; local 2607 * multiply by (2^21 / D) and then right shift by 21 positions.
|
/freebsd-9.3-release/sys/fs/nfs/ |
H A D | nfs_commonsubs.c | 3215 int cnt = 0, gotd = 0, shift = 0; local 3226 * shift - lower order bits of range (ie. "val >> shift" should 3243 if (cnt == 0 && (val >> shift) == 0x0) { 3259 shift = utf8_shift[cnt - 1];
|
/freebsd-9.3-release/contrib/binutils/bfd/ |
H A D | elflink.c | 7085 bfd_vma relocation = 0, shift, x; 7158 shift = (start + 1) - len; 7160 shift = (8 * wordsz) - (start + len); 7189 x = (x & ~(mask << shift)) | ((relocation & mask) << shift); 7196 relocation, (mask << shift), 7197 ((relocation & mask) << shift), x); 7075 bfd_vma relocation = 0, shift, x; local
|
/freebsd-9.3-release/sys/cam/ctl/ |
H A D | ctl.c | 3924 int shift; local 3965 * The shift method for cylinder calculation is 3974 for (shift = 31; shift > 0; shift--) { 3975 if (sectors_per_cylinder & (1 << shift)) 3978 cylinders = (lun->be_lun->maxlba + 1) >> shift;
|
/freebsd-9.3-release/sys/dev/e1000/ |
H A D | if_igb.c | 4487 u32 random[10], mrqc, shift = 0; local 4495 shift = 6; 4499 (i % adapter->num_queues) << shift;
|
/freebsd-9.3-release/contrib/binutils/binutils/ |
H A D | readelf.c | 8188 int shift; 8192 shift = 0; 8198 val |= ((unsigned int)c & 0x7f) << shift; 8199 shift += 7; 8185 int shift; local
|
/freebsd-9.3-release/contrib/gcc/config/mips/ |
H A D | mips.c | 2156 Assume that the final action in the sequence should be a left shift. */ 2161 unsigned int i, shift; 2165 shift = 0; 2167 value /= 2, shift++; 2171 codes[i].value = shift; 2226 lowest bit is set. We don't want to shift in this case. */ 2232 16 bits are clear, so the final action will be a shift. */ 2237 /* The final action could be a shift, add or inclusive OR. 2505 /* A number between 1 and 8 inclusive is efficient for a shift. 9486 the division is not immediately followed by a shift[ 2155 unsigned int i, shift; local [all...] |
/freebsd-9.3-release/contrib/llvm/lib/Target/ARM/Disassembler/ |
H A D | ARMDisassembler.cpp | 1603 unsigned shift; local 1605 shift = ARM_AM::getAM2Opc(ARM_AM::add, imm, ShOp); 1607 shift = ARM_AM::getAM2Opc(ARM_AM::sub, imm, ShOp); 1608 Inst.addOperand(MCOperand::CreateImm(shift));
|
/freebsd-9.3-release/sys/mips/mips/ |
H A D | support.S | 780 sll t2, t1, 16 # shift that left 16
|
/freebsd-9.3-release/contrib/gcc/ |
H A D | fold-const.c | 416 ARITH nonzero specifies arithmetic shifting; otherwise use logical shift. 478 ARITH nonzero specifies arithmetic shifting; otherwise use logical shift. 3492 large enough to contain it. In these cases we can avoid the shift 3633 /* Make a new bitfield reference, shift the constant over the 5006 /* We must use a signed type in order to get an arithmetic right shift. 5382 the mask must be shifted to account for the shift done by 5737 left-shift overflow is implementation-defined rather than 5738 undefined in C90, so do not convert signed left shift into 6554 /* If INNER is a right shift of a constant and it plus BITNUM does 8245 tree folded_compare, shift; 8210 tree folded_compare, shift; local [all...] |
/freebsd-9.3-release/sys/dev/bxe/ |
H A D | bxe.c | 2041 "Set GPIO %d (shift %d) -> output low\n", 2050 "Set GPIO %d (shift %d) -> output high\n", 2059 "Set GPIO %d (shift %d) -> input\n", 2150 "Clear GPIO INT %d (shift %d) -> output low\n", 2159 "Set GPIO INT %d (shift %d) -> output high\n", 7054 uint32_t shift = engine ? BXE_PATH1_LOAD_CNT_SHIFT : local 7060 val = ((val & mask) >> shift); 7076 uint32_t shift = SC_PATH(sc) ? BXE_PATH1_LOAD_CNT_SHIFT : local 7085 val1 = ((val & mask) >> shift); 7094 val |= ((val1 << shift) 7109 uint32_t shift = SC_PATH(sc) ? BXE_PATH1_LOAD_CNT_SHIFT : local [all...] |
H A D | bxe_elink.c | 6917 uint8_t shift = 8*4; local 6926 while (shift > 0) { 6928 shift -= 4; 6929 digit = ((num & mask) >> shift); 6941 if (shift == 4*4) {
|
/freebsd-9.3-release/usr.bin/xlint/lint1/ |
H A D | tree.c | 941 goto shift; 944 * ANSI C does not perform balancing for shift operations, 961 shift: 964 /* negative shift */ 967 /* shift equal to size fo object */ 970 /* shift greater than size of object */
|
/freebsd-9.3-release/contrib/llvm/tools/clang/lib/CodeGen/ |
H A D | CGBuiltin.cpp | 1643 unsigned shift, bool rightshift) { 1647 if (shift > 0 && shift == j) 1664 // \brief Right-shift a vector by a constant. 1675 // lshr/ashr are undefined when the shift amount is equal to the vector 1684 // to a shift of size-1. 5025 // than 16 bytes, emit a logical right shift of the destination. 5056 // than 32 bytes, emit a logical right shift of the destination. 5094 // than 32 bytes, emit a logical right shift of the destination. 1641 EmitNeonCall(Function *F, SmallVectorImpl<Value*> &Ops, const char *name, unsigned shift, bool rightshift) argument
|
H A D | CodeGenFunction.h | 2165 unsigned shift = 0, bool rightshift = false);
|
/freebsd-9.3-release/lib/libpmc/ |
H A D | libpmc.c | 2038 PMCMASK(packed-shift, 0x02),
|
/freebsd-9.3-release/contrib/gcc/config/i386/ |
H A D | i386.c | 76 COSTS_N_BYTES (2), /* variable shift costs */ 77 COSTS_N_BYTES (3), /* constant shift costs */ 130 COSTS_N_INSNS (3), /* variable shift costs */ 131 COSTS_N_INSNS (2), /* constant shift costs */ 183 COSTS_N_INSNS (3), /* variable shift costs */ 184 COSTS_N_INSNS (2), /* constant shift costs */ 236 COSTS_N_INSNS (4), /* variable shift costs */ 237 COSTS_N_INSNS (1), /* constant shift costs */ 289 COSTS_N_INSNS (1), /* variable shift costs */ 290 COSTS_N_INSNS (1), /* constant shift cost 9766 int shift = 63; local 19172 rtx words[4], shift; local [all...] |
/freebsd-9.3-release/sys/cddl/contrib/opensolaris/uts/common/dtrace/ |
H A D | dtrace.c | 1071 * Shift the 128-bit value in a by b. If b is positive, shift left. 1072 * If b is negative, shift right. 5743 int shift = (sizeof (uintptr_t) * NBBY) - 4, i = 0; 5781 while (shift >= 0) { 5782 mask = (uintptr_t)0xf << shift; 5784 if (val >= ((uintptr_t)1 << shift)) 5785 c[i++] = "0123456789abcdef"[(val & mask) >> shift]; 5786 shift -= 4;
|
/freebsd-9.3-release/contrib/binutils/gas/config/ |
H A D | tc-alpha.c | 159 /* XXX: The non-shift version appears to trigger a compiler bug when 1842 insn |= ((val & ((1 << operand->bits) - 1)) << operand->shift);
|