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

  /src/tools/llvm/
Makefile 12 realdepends realall: config/config.status need-dl need-terminfo support-modules
36 need-dl: Makefile
37 printf '#include <dlfcn.h>\nint main(void){void *p; return dladdr(p, p);}' > need-dl.c
38 if ${HOST_CC} -o need-dl.out -D_GNU_SOURCE need-dl.c > /dev/null 2>&1; then \
40 elif ${HOST_CC} -o need-dl.out -D_GNU_SOURCE need-dl.c -ldl > /dev/null 2>&1; then \
46 need-terminfo: Makefile
47 printf 'int setupterm(char *, int, int *);\nint main(void){return setupterm("", 0, 0);}' > need-terminfo.
    [all...]
  /src/lib/libc/gen/
fnmatch.c 76 int negate, ok, need; local in function:rangematch
91 need = 1;
92 for (ok = 0; (c = FOLDCASE(*pattern++, flags)) != ']' || need;) {
93 need = 0;
  /src/sys/external/isc/libsodium/dist/src/libsodium/crypto_pwhash/scryptsalsa208sha256/nosse/
pwhash_scryptsalsa208sha256_nosse.c 297 size_t B_size, V_size, XY_size, need; local in function:escrypt_kdf_nosse
338 need = B_size + V_size;
339 if (need < V_size) {
344 need += XY_size;
345 if (need < XY_size) {
349 if (local->size < need) {
353 if (!alloc_region(local, need)) {
  /src/games/backgammon/backgammon/
main.c 70 static const char need[] = "Do you need instructions for this program?"; variable in typeref:typename:const char[]
120 /* need this now beceause getarg() may try to load a game */
157 writel(need);
  /src/sys/external/isc/libsodium/dist/src/libsodium/crypto_pwhash/scryptsalsa208sha256/
crypto_scrypt-common.c 147 size_t need; local in function:escrypt_r
167 need = prefixlen + saltlen + 1 +
169 if (need > buflen || need < saltlen) {
205 size_t need; local in function:escrypt_gensalt_r
207 need = prefixlen + saltlen + 1;
208 if (need > buflen || need < saltlen || saltlen < srclen) {
  /src/sys/external/isc/libsodium/dist/src/libsodium/crypto_pwhash/scryptsalsa208sha256/sse/
pwhash_scryptsalsa208sha256_sse.c 313 size_t B_size, V_size, XY_size, need; local in function:escrypt_kdf_sse
358 need = B_size + V_size;
360 if (need < V_size) {
366 need += XY_size;
368 if (need < XY_size) {
373 if (local->size < need) {
377 if (!alloc_region(local, need)) {
  /src/usr.bin/hexdump/
display.c 239 int need, nread; local in function:get
251 for (need = blocksize, nread = 0;;) {
258 if (need == blocksize)
260 if (!need && vflag != ALL &&
266 memset((char *)curp + nread, 0, need);
271 length == -1 ? need : MIN(length, need), stdin);
281 if (!(need -= n)) {
292 need = blocksize;
  /src/common/lib/libc/hash/rmd160/
rmd160.c 138 uint32_t have, off, need; local in function:RMD160Update
141 need = 64 - have;
145 if (len >= need) {
147 memcpy(ctx->buffer + have, input, (size_t)need);
149 off = need;
  /src/usr.bin/at/
parsetime.c 152 static bool need; /* scanner - need to advance to next argument */ variable in typeref:typename:bool
206 need = true;
230 * if we need to read another argument, walk along the
234 if (need) {
240 need = false;
250 need = true;
  /src/sbin/dump/
tape.c 468 * Each of the N workers should have requests that need to
822 * Need our own seek pointer.
829 * Need the pid of the next worker in the loop...
939 ssize_t got, need = count; local in function:atomic_read
941 while ((got = read(fd, buf, need)) > 0 && (need -= got) > 0)
943 return (got < 0 ? got : count - need);
953 ssize_t got, need = count; local in function:atomic_write
955 while ((got = write(fd, buf, need)) > 0 && (need -= got) > 0
    [all...]
  /src/usr.bin/col/
col.c 289 /* may need to allocate here */
313 int need; local in function:main
315 need = l->l_lsize ? l->l_lsize * 2 : 90;
317 (unsigned)need * sizeof(CHAR))) == NULL)
319 l->l_lsize = need;
327 * If things are put in out of order, they will need sorting
  /src/bin/rcp/
rcp.c 603 size_t need; local in function:sink
605 need = strlen(targ) + strlen(cp) + 2;
606 if (need > cursize) {
607 need += 256;
608 newnamebuf = realloc(namebuf, need);
611 cursize = need;
  /src/sys/net/
zlib.c 71 /* XXX doesn't seem to need anything at all, but this is for consistency. */
676 need_more, /* block not completed, need more input or more output */
678 finish_started, /* finish started, need only more output at next deflate */
1394 Assert((ulg)s->strstart <= s->window_size-MIN_LOOKAHEAD, "need lookahead");
1505 Assert((ulg)s->strstart <= s->window_size-MIN_LOOKAHEAD, "need lookahead");
1766 * at the end of the input file. We need MAX_MATCH bytes
1861 * at the end of the input file. We need MAX_MATCH bytes
2062 * need for the L_CODES extra codes used during heap construction. However
2664 * Generate the codes for a given tree and bit counts (which need not be
3398 uLong need; /* stream check value * member in struct:internal_state::__anon0201f153050a::__anon0201f1530608
5097 uInt need; \/* bits needed *\/ member in struct:inflate_codes_state::__anon0201f1530e0a::__anon0201f1530f08
    [all...]

Completed in 26 milliseconds