HomeSort by: relevance | last modified time | path
    Searched defs:overflow (Results 1 - 21 of 21) sorted by relevancy

  /src/lib/libm/arch/vax/
n_scalbn.S 57 jgeq overflow
71 3: jbs $8, %r3, overflow /* did exponent overflow? */
78 overflow: label
79 pushl $ERANGE /* overflow */
  /src/lib/libc/compat/gen/
compat_ldexp_ieee754.c 56 overflow(double val) function in typeref:typename:double
126 * Check for underflow and overflow, and if none, calculate the
133 return overflow(val);
  /src/sys/external/bsd/drm2/dist/include/drm/
drm_debugfs_crc.h 52 * @overflow: whether an overflow occured.
62 bool opened, overflow; member in struct:drm_crtc_crc
  /src/sys/arch/hppa/spmath/
md.h 58 #define overflow result->ovflow macro
  /src/lib/libm/src/
s_exp2f.c 50 * underflow or overflow trap as well as generating infinity or zero.
63 static volatile double overflow = 0x1p+1000; variable in typeref:typename:volatile double
68 #define overflow (huge * huge) macro
136 return overflow; /* +infinity with overflow */
  /src/sys/external/bsd/drm2/dist/drm/i915/gt/uc/
intel_guc_log.h 61 u32 overflow; member in struct:intel_guc_log::__anon87a525670208
intel_guc_log.c 187 bool overflow = false; local in function:guc_check_log_buf_overflow
190 overflow = true;
192 log->stats[type].overflow = full_cnt;
201 "GuC log buffer overflow\n");
204 return overflow;
295 /* copy the whole buffer in case of overflow */
  /src/usr.bin/sort/
files.c 148 static int overflow = 0; local in function:makekey
151 if (overflow) {
152 overflow = enterkey(recbuf, bufend, line_data, line_size, ftbl);
153 return overflow ? BUFFEND : 0;
163 overflow = 1;
165 overflow = enterkey(recbuf, bufend, line_data, line_size, ftbl);
167 return overflow ? BUFFEND : 0;
  /src/common/dist/zlib/contrib/iostream/
zfstream.cpp 173 int gzfilebuf::overflow( int c ) { function in class:gzfilebuf
  /src/common/dist/zlib/contrib/iostream3/
zfstream.cc 214 gzfilebuf::overflow(int_type c) function in class:gzfilebuf
230 // Overflow doesn't fail if nothing is to be written
301 return traits_type::eq_int_type(this->overflow(), traits_type::eof()) ? -1 : 0;
322 // so that overflow(c) can safely add the extra character c to the sequence.
  /src/sys/lib/libsa/
netif.h 64 int overflow; member in struct:netif_stats
  /src/usr.bin/indent/
io.c 249 int overflow = ind_add(ind, code.s, code.len) - opt.max_line_length; local in function:compute_lined_up_code_indent
250 if (overflow >= 0
252 ind -= 2 + overflow;
  /src/sys/dev/ic/
igsfb_subr.c 489 uint8_t vclk1, vclk2, vclk3, overflow, reg, seq_mode; local in function:igsfb_set_mode
517 overflow = (((mode->vtotal - 2) & 0x400) >> 10) |
621 igs_ext_write(iot, ioh, IGS_EXT_VOVFL, overflow);
  /src/sys/dev/
lockstat.c 271 u_int cpuno, overflow; local in function:lockstat_stop
291 overflow = 0;
293 overflow += ((lscpu_t *)ci->ci_lockstat)->lc_overflow;
295 if (overflow != 0) {
298 overflow);
  /src/sys/netipsec/
keydb.h 154 int overflow; /* overflow flag */ member in struct:secreplay
  /src/sys/dev/dtv/
dtvvar.h 98 bool overflow; member in struct:dtv_demux::__anon478bed330208
  /src/common/dist/zlib/
trees.c 552 int overflow = 0; /* number of elements with bit length too large */ local in function:gen_bitlen
557 * overflow in the case of the bit length tree).
564 if (bits > max_length) bits = max_length, overflow++;
577 if (overflow == 0) return;
579 Tracev((stderr,"\nbit length overflow\n"));
587 s->bl_count[bits + 1] += 2; /* move one overflow item as its brother */
589 /* The brother of the overflow item also moves one step up,
592 overflow -= 2;
593 } while (overflow > 0);
943 Assert(s->pending < 2 * (s->lit_bufsize + sx), "pendingBuf overflow");
    [all...]
  /src/sys/dev/pci/ixgbe/
ixv.c 1136 bool overflow = false; local in function:ixv_set_rxfilter
1178 overflow = true;
1189 if (overflow) {
3171 bool overflow = false; local in function:ixv_ioctl
3189 overflow = true;
3196 if (overflow && ((ec->ec_flags & ETHER_F_ALLMULTI) == 0)) {
  /src/usr.bin/xlint/lint1/
lint1.h 526 bool overflow; /* for octal and hex escapes */ member in struct:__anondcf084d01b08
tree.c 752 /* https://gcc.gnu.org/onlinedocs/gcc/Integer-Overflow-Builtins.html */
1095 uint64_t max_value, bool *overflow)
1105 *overflow = r > 0 && l > max_value / r;
1122 *overflow = l > max_value - r;
1125 *overflow = l < r;
1129 /* TODO: warn about overflow. */
1160 int64_t min_value, int64_t max_value, bool *overflow)
1168 *overflow = l == min_value;
1169 return *overflow ? l : -l;
1176 *overflow = true
1264 bool overflow = false; local in function:fold_constant_integer
    [all...]
  /src/sys/net/
zlib.c 793 * Initialize the hash table (avoiding 64K overflow for 16 bit systems).
2599 int overflow = 0; /* number of elements with bit length too large */ local in function:gen_bitlen
2604 * overflow in the case of the bit length tree).
2611 if (bits > max_length) bits = max_length, overflow++;
2624 if (overflow == 0) return;
2626 Trace((stderr,"\nbit length overflow\n"));
2634 s->bl_count[bits+1] += 2; /* move one overflow item as its brother */
2636 /* The brother of the overflow item also moves one step up,
2639 overflow -= 2;
2640 } while (overflow > 0)
    [all...]

Completed in 24 milliseconds