HomeSort by: relevance | last modified time | path
    Searched defs:end (Results 1 - 25 of 553) sorted by relevancy

1 2 3 4 5 6 7 8 91011>>

  /src/sys/lib/libkern/
scanc.c 40 const u_char *end = &cp[size]; local in function:scanc
42 while (cp < end && (table[*cp] & mask) == 0)
44 return (end - cp);
skpc.c 40 u_char *end = &cp[size]; local in function:skpc
42 while (cp < end && *cp == (u_char) mask)
44 return (end - cp);
dkcksum.c 57 const uint16_t *start, *end; local in function:dkcksum_sized
62 end = (const uint16_t *)&lp->d_partitions[npartitions];
63 while (start < end) {
  /src/lib/libutil/
disklabel_dkcksum.c 49 uint16_t *start, *end; local in function:disklabel_dkcksum
54 end = (uint16_t *)(void *)&lp->d_partitions[lp->d_npartitions];
55 while (start < end)
  /src/sys/external/bsd/compiler_rt/dist/test/profile/Linux/
instrprof-basic.c 13 int end(int i) { function in typeref:typename:int
22 end(1);
  /src/sys/external/bsd/compiler_rt/dist/test/profile/
instrprof-basic.c 13 int end(int i) { function in typeref:typename:int
22 end(1);
  /src/sys/external/isc/libsodium/dist/builds/msvc/build/
buildbase.bat 60 GOTO end
64 GOTO end
69 :end label
  /src/usr.bin/make/unit-tests/
deptgt-end.mk 1 # $NetBSD: deptgt-end.mk,v 1.6 2020/10/23 19:28:17 rillig Exp $
3 # Tests for the special target .END in dependency declarations,
16 .END:
21 # The .END node can define dependencies, just like a regular target.
22 .END: end-action
23 end-action: .NOTMAIN
36 # The deferred commands are run in the order '.END .BEGIN all'.
38 # '.BEGIN all .END', but it is implemented correctly.
41 # the deferred commands are appended to the commands of the .END node
    [all...]
varmod-mtime.mk 95 end:= ${%s:L:gmtime} macro
96 .if ${not_found_mtime} > ${end}
  /src/bin/sh/
arith_token.c 77 char *end; local in function:arith_token
89 a_t_val.val = strtoimax(buf, &end, 0);
90 if (is_in_name(*end)) {
91 token = *end;
92 while (is_in_name(*++end))
96 "%.*s", token, (int)(end - buf), buf);
98 arith_buf = end;
  /src/sbin/disklabel/
dkcksum.c 63 const uint16_t *start, *end; local in function:dkcksum_sized
68 end = (const uint16_t *)&lp->d_partitions[npartitions];
69 while (start < end) {
  /src/usr.bin/mkcsmapper/
ldef.h 31 u_int32_t end; member in struct:__anonc97882b00108
  /src/sys/dev/fdt/
fdt_memory.h 43 uint64_t end; member in struct:fdt_memory
  /src/games/battlestar/
misc.c 47 const char *end = array + size; local in function:card
50 while (array < end)
  /src/lib/libc/stdlib/
lsearch.c 81 char *element, *end; local in function:linear_base
87 end = (char *)base + *nelp * width;
88 for (element = (char *)base; element < end; element += width)
105 memcpy(end, key, width);
106 return end;
  /src/sys/arch/atari/stand/ahdilabel/
magic.c 48 u_int *end, *p; local in function:check_magic
50 end = (u_int *)&bblk[BBMINSIZE - sizeof(struct disklabel)];
51 for (p = (u_int *)bblk; p < end; ++p) {
cksum.c 41 u_short *start, *end, sum = 0; local in function:dkcksum
44 end = (u_short *)&dl->d_partitions[dl->d_npartitions];
45 while (start < end)
  /src/sys/crypto/blowfish/
bf_skey.c 81 const unsigned char *d, *end; local in function:BF_set_key
90 end= &(data[len]);
93 if (d >= end) d = data;
97 if (d >= end) d = data;
101 if (d >= end) d = data;
105 if (d >= end) d = data;
  /src/sys/arch/atari/include/
pmap.h 89 paddr_t end; /* PA of last page in segment */ member in struct:memseg
  /src/lib/libcurses/
copywin.c 56 __LDATA *sp, *end; local in function:copywin
112 end = sp + dmaxcol - dmincol;
114 for (dcol = dmincol; sp <= end; dcol++, sp++) {
inchstr.c 137 __LDATA *end, *start; local in function:winchnstr
153 end = &win->alines[win->cury]->line[epos];
155 while (start <= end) {
  /src/lib/libc/locale/
_wcstod.h 65 char *buf, *end; local in function:INT_NAME
80 * We could attempt to find the end of the numeric portion of the
107 val = _STRTOD_FUNC(buf, &end, loc);
108 if (buf == end) {
121 *endptr = __UNCONST(start + (size_t)(end - buf));
  /src/lib/libukfs/
ukfs_disklabel.c 130 uint16_t *start, *end; local in function:ukfs__disklabel_dkcksum
141 end = (uint16_t *)(void *)&lp->d_partitions[npart];
142 while (start < end) {
  /src/lib/libusbhid/
data.c 43 int i, end, offs; local in function:hid_get_data
55 end = (hpos + hsize + 7) / 8 - offs;
57 for (i = 0; i < end; i++)
76 int i, end, offs, mask; local in function:hid_set_data
96 end = (hpos + hsize) / 8 - offs;
98 for (i = 0; i < end; i++)
  /src/lib/libwrap/
percent_x.c 43 char *end = result + result_len - 1; /* end of result buffer */ local in function:percent_x
82 if (bp + expansion_len >= end) {

Completed in 21 milliseconds

1 2 3 4 5 6 7 8 91011>>