Searched defs:be (Results 1 - 3 of 3) sorted by relevance

H A Dhash_fnv.c154 unsigned char *be = bp + len; /* beyond end of buffer */ local
159 while (bp < be) {
196 unsigned char *be = bp + len; /* beyond end of buffer */ local
201 while (bp < be) {
H A Dpcre_compile.c23 contributors may be used to endorse or promote products derived from
59 COMPILE_PCREx macro will already be appropriately set. */
100 soon as they can be, so that hopefully there will never be an overrun. The code
105 remembering forward references to groups so that they can be filled in at the
285 length entry. The first three must be alpha, lower, upper, as this is assumed
362 /* The POSIX class substitutes must be in the order of the POSIX class names,
443 are no longer used. This used to be a table of strings, but in order to reduce
451 substring, so that the whole string ends with \0\0, which can be detected when
489 "(?R or (?[+-]digits must be followe
9536 pcre_uchar *be = cc - 1 - LINK_SIZE + GET(cc, -LINK_SIZE); local
H A Dzend_strtod.c47 * we can represent 10^k exactly), we may be able to
88 * appropriate. If MALLOC is undefined, malloc will be invoked
270 #error "Exactly one of IEEE_LITTLE_ENDIAN IEEE_BIG_ENDIAN, VAX, or IBM should be defined."
287 * An alternative that might be better on some machines is
1421 * 3. Under the assumption that input will be rounded nearest,
1462 ndigits can be negative.
1478 int bbits, b2, b5, be, dig, i, ieps, ilim = 0, ilim0, ilim1, local
1525 b = d2b(value(d), &be, &bbits);
1549 * We want k to be too large rather than too small.
1572 i = bbits + be

Completed in 243 milliseconds