Searched refs:bit (Results 26 - 50 of 476) sorted by relevance

1234567891011>>

/freebsd-11-stable/lib/libc/string/
H A Dstrcspn.c41 * NB: idx and bit are temporaries whose use causes gcc 3.4.2 to
45 u_long bit; local
52 #if LONG_BIT == 64 /* always better to unroll on 64-bit architectures */
61 bit = BIT(*charset);
62 tbl[idx] |= bit;
67 bit = BIT(*s1);
68 if ((tbl[idx] & bit) != 0)
H A Dstrspn.c41 * NB: idx and bit are temporaries whose use causes gcc 3.4.2 to
45 u_long bit; local
52 #if LONG_BIT == 64 /* always better to unroll on 64-bit architectures */
60 bit = BIT(*charset);
61 tbl[idx] |= bit;
66 bit = BIT(*s1);
67 if ((tbl[idx] & bit) == 0)
/freebsd-11-stable/sys/libkern/
H A Dstrcspn.c41 * NB: idx and bit are temporaries whose use causes gcc 3.4.2 to
45 u_long bit; local
52 #if LONG_BIT == 64 /* always better to unroll on 64-bit architectures */
61 bit = BIT(*charset);
62 tbl[idx] |= bit;
67 bit = BIT(*s1);
68 if ((tbl[idx] & bit) != 0)
H A Dstrspn.c41 * NB: idx and bit are temporaries whose use causes gcc 3.4.2 to
45 u_long bit; local
52 #if LONG_BIT == 64 /* always better to unroll on 64-bit architectures */
60 bit = BIT(*charset);
61 tbl[idx] |= bit;
66 bit = BIT(*s1);
67 if ((tbl[idx] & bit) == 0)
/freebsd-11-stable/contrib/bzip2/
H A Dunzcrash.c6 and then repeatedly decompress it, each time with a different bit of
7 the compressed data inverted, so as to test all possible one-bit errors.
64 void flip_bit ( int bit )
66 int byteno = bit / 8;
67 int bitno = bit % 8;
69 //fprintf ( stderr, "(byte %d bit %d mask %d)",
78 int bit; local
102 for (bit = 0; bit < nZ*8; bit
[all...]
/freebsd-11-stable/lib/libc/sparc64/fpu/
H A Dfpu_sqrt.c127 * zero bit at the top of x. Doing so means that q is not going to acquire
128 * a 1 bit in the first trip around the loop (since x0 < 2^NBITS). If the
163 * bit at a time, from the top down, and is not used itself in the loop
165 * in an integer, one word at a time, which saves a bit of work. Also,
166 * since 1 << k is always a `new' bit in q, 1 << k and 1 << (k+1) are
178 * Furthermore, we can prove with a bit of work that x never exceeds y by
185 * In fact, we want even one more bit (for a carry, to avoid compares), or
194 u_int bit, q, tt; local
255 * set the top bit in q, so we can do that manually and start
256 * the loop at the next bit dow
[all...]
H A Dfpu_mul.c62 * Each step consists of shifting the accumulator right one bit
63 * (maintaining any guard bits) and, if the next bit in y is set,
65 * we advance one bit leftward in y. Algorithmically:
68 * for (bit = 0; bit < FP_NMANT; bit++) {
70 * if (Y & (1 << bit))
77 * shifted right, but at most one bit.
93 * - bit FP_NMANT-1 is set, and FP_1*2 fits in a word.
97 * run 32 times without adding X to A. We can do a 32-bit shif
107 u_int a3, a2, a1, a0, x3, x2, x1, x0, bit, m; local
[all...]
/freebsd-11-stable/sys/powerpc/fpu/
H A Dfpu_sqrt.c128 * zero bit at the top of x. Doing so means that q is not going to acquire
129 * a 1 bit in the first trip around the loop (since x0 < 2^NBITS). If the
164 * bit at a time, from the top down, and is not used itself in the loop
166 * in an integer, one word at a time, which saves a bit of work. Also,
167 * since 1 << k is always a `new' bit in q, 1 << k and 1 << (k+1) are
179 * Furthermore, we can prove with a bit of work that x never exceeds y by
186 * In fact, we want even one more bit (for a carry, to avoid compares), or
194 u_int bit, q, tt; local
272 * set the top bit in q, so we can do that manually and start
273 * the loop at the next bit dow
[all...]
H A Dfpu_mul.c63 * Each step consists of shifting the accumulator right one bit
64 * (maintaining any guard bits) and, if the next bit in y is set,
66 * we advance one bit leftward in y. Algorithmically:
69 * for (bit = 0; bit < FP_NMANT; bit++) {
71 * if (Y & (1 << bit))
78 * shifted right, but at most one bit.
94 * - bit FP_NMANT-1 is set, and FP_1*2 fits in a word.
98 * run 32 times without adding X to A. We can do a 32-bit shif
107 u_int a3, a2, a1, a0, x3, x2, x1, x0, bit, m; local
[all...]
/freebsd-11-stable/contrib/xz/src/liblzma/rangecoder/
H A Dprice.h29 rc_bit_price(const probability prob, const uint32_t bit) argument
31 return lzma_rc_prices[(prob ^ ((UINT32_C(0) - bit)
59 const uint32_t bit = symbol & 1; local
61 price += rc_bit_price(probs[symbol], bit);
76 const uint32_t bit = symbol & 1; local
78 price += rc_bit_price(probs[model_index], bit);
79 model_index = (model_index << 1) + bit;
/freebsd-11-stable/lib/libvgl/
H A Dtext.c77 int lin, bit; local
80 for(bit = 0; bit < VGLTextFont->Width; bit++) {
81 if (VGLTextFont->BitmapArray[((ch*VGLTextFont->Height)+lin)]&(1<<bit))
84 VGLSetXY(Object, (x+7-bit), (y+lin), fgcol);
87 VGLSetXY(Object, (x+lin), (y-7+bit), fgcol);
90 VGLSetXY(Object, (x-7+bit), (y-lin), fgcol);
93 VGLSetXY(Object, (x-lin), (y+7-bit), fgcol);
96 VGLSetXY(Object, (x+lin+7-bit), (
[all...]
/freebsd-11-stable/usr.bin/dtc/
H A Dutil.hh102 for (int bit=(sizeof(T) - 1)*8 ; bit>=0 ; bit-= 8)
104 v.push_back((val >> bit) & 0xff);
/freebsd-11-stable/contrib/openbsm/bin/auditreduce/
H A Dauditreduce.h70 #define SETOPT(optmask, bit) (optmask |= bit)
71 #define ISOPTSET(optmask, bit) (optmask & bit)
/freebsd-11-stable/contrib/llvm-project/lldb/include/lldb/Utility/
H A DFlags.h24 /// The value type for flags is a 32 bit unsigned integer type.
27 /// Construct with initial flag bit values.
92 /// Test a single flag bit.
95 /// \b true if \a bit is set, \b false otherwise.
96 bool Test(ValueType bit) const { return (m_flags & bit) != 0; }
107 /// Test a single flag bit to see if it is clear (zero).
110 /// \b true if \a bit is 0, \b false otherwise.
111 bool IsClear(ValueType bit) const { return (m_flags & bit)
[all...]
/freebsd-11-stable/contrib/dialog/samples/
H A Dinputbox6-8bit2 # $Id: inputbox6-8bit,v 1.6 2010/01/13 10:20:03 tom Exp $
8 . ./testdata-8bit
H A Dmenubox-8bit2 # $Id: menubox-8bit,v 1.6 2010/01/13 10:20:03 tom Exp $
8 . ./testdata-8bit
H A Dmsgbox4-8bit2 # $Id: msgbox4-8bit,v 1.4 2010/01/13 10:20:03 tom Exp $
6 . ./testdata-8bit
/freebsd-11-stable/sys/contrib/octeon-sdk/
H A Dcvmx-gpio.h106 * @param bit The GPIO to use
110 static inline void cvmx_gpio_cfg(int bit, int mode) argument
112 if (bit > 15 && bit < 20)
118 gpio_xbit.u64 = cvmx_read_csr(CVMX_GPIO_XBIT_CFGX(bit));
123 cvmx_write_csr(CVMX_GPIO_XBIT_CFGX(bit), gpio_xbit.u64);
126 cvmx_dprintf("cvmx_gpio_cfg: Invalid GPIO bit(%d)\n", bit);
131 gpio_bit.u64 = cvmx_read_csr(CVMX_GPIO_BIT_CFGX(bit));
136 cvmx_write_csr(CVMX_GPIO_BIT_CFGX(bit), gpio_bi
[all...]
/freebsd-11-stable/crypto/openssl/util/
H A Dmkcerts.sh19 echo creating $CAbits bit PCA cert request
29 Test PCA (1024 bit)
55 echo creating $CAbits bit CA cert request
65 Test CA (1024 bit)
92 echo creating 512 bit server cert request
102 Server test cert (512 bit)
109 echo problems generating 512 bit server cert request
115 echo signing 512 bit server cert
123 echo problems signing 512 bit server cert
128 # create 1024 bit serve
[all...]
/freebsd-11-stable/contrib/groff/src/libs/libxutil/
H A DXFontName.c14 unsigned int *attrp, unsigned int bit)
28 *attrp |= bit;
36 unsigned int *attrp, unsigned int bit)
42 name = extractStringField (name, buf, sizeof (buf), attrp, bit);
45 if (!(*attrp & bit))
65 #define GetString(field,bit)\
68 &attributes, bit))) \
71 #define GetUnsigned(field,bit)\
74 &attributes, bit))) \
124 #define PutString(field, bit)\
13 extractStringField(char *name, char *buffer, int size, unsigned int *attrp, unsigned int bit) argument
35 extractUnsignedField(char *name, unsigned int *result, unsigned int *attrp, unsigned int bit) argument
[all...]
/freebsd-11-stable/contrib/ntp/libntp/
H A Datolfp.c96 register u_long bit; local
102 bit = 0x80000000;
103 while (bit != 0) {
106 tmp |= bit;
109 bit >>= 1;
/freebsd-11-stable/tools/tools/mwl/mwldebug/
H A Dmwldebug.c73 u_int bit; member in struct:__anon13701
103 return flags[i].bit;
114 if (flags[i].bit == flag)
164 u_int bit; local
176 bit = getflag(cp, tp-cp);
178 ndebug &= ~bit;
180 ndebug |= bit;
182 if (bit == 0) {
185 bit = strtoul(cp, NULL, 0);
190 ndebug = bit;
[all...]
/freebsd-11-stable/tools/tools/ath/athdebug/
H A Dathdebug.c84 uint64_t bit; member in struct:__anon13685
119 return flags[i].bit;
129 if (flags[i].bit == flag)
185 u_int bit; local
197 bit = getflag(cp, tp-cp);
199 ndebug &= ~bit;
201 ndebug |= bit;
203 if (bit == 0) {
205 bit = strtoul(cp, NULL, 0);
210 ndebug = bit;
[all...]
/freebsd-11-stable/sys/netpfil/ipfw/test/
H A Dtest_dn_sched.c88 int bit; local
92 for (bit = 1; mask != 1; bit++)
94 return (bit);
/freebsd-11-stable/sys/i386/i386/
H A Dgeode.c100 int bit; local
102 bit = *(int *)ptr;
103 if (bit < 0) {
104 bit = -bit;
110 u |= 1 << bit;
112 u &= ~(1 << bit);
119 int bit; local
122 bit = *(int *)ptr;
123 if (bit <
[all...]

Completed in 470 milliseconds

1234567891011>>