/freebsd-11-stable/contrib/apr/strings/ |
H A D | apr_strtok.c | 27 APR_DECLARE(char *) apr_strtok(char *str, const char *sep, char **last) argument 32 str = *last; /* start where we left off */ 46 *last = token + 1; 47 while (**last && !strchr(sep, **last)) 48 ++*last; 50 if (**last) { 51 **last = '\0'; 52 ++*last;
|
/freebsd-11-stable/lib/libc/string/ |
H A D | wcsrchr.c | 35 const wchar_t *last; local 37 last = NULL; 40 last = s; 46 return ((wchar_t *)last);
|
H A D | memmem.c | 41 register char *cur, *last; local 57 /* the last position where its possible to find "s" in "l" */ 58 last = (char *)cl + l_len - s_len; 60 for (cur = (char *)cl; cur <= last; cur++)
|
H A D | wcstok.c | 42 wchar_t ** __restrict last) 48 if (s == NULL && (s = *last) == NULL) 62 *last = NULL; 80 *last = s; 41 wcstok(wchar_t * __restrict s, const wchar_t * __restrict delim, wchar_t ** __restrict last) argument
|
/freebsd-11-stable/contrib/dialog/samples/ |
H A D | infobox6 | 14 last='\' 17 $DIALOG $last 26 --title "INFO BOX" $* $last 32 You have $left $unit to read this..." 0 0 $last
|
H A D | infobox5 | 12 last='\' 15 $DIALOG $last 30 You have $left $unit to read this..." 0 0 $last
|
/freebsd-11-stable/sys/netpfil/ipfw/pmod/ |
H A D | pmod.h | 34 void tcpmod_uninit(struct ip_fw_chain *ch, int last);
|
/freebsd-11-stable/usr.bin/last/ |
H A D | Makefile | 2 # $FreeBSD: stable/11/usr.bin/last/Makefile 338451 2018-09-04 09:53:45Z philip $ 4 PROG= last
|
/freebsd-11-stable/sys/arm/include/ |
H A D | stdarg.h | 47 #define va_start(ap, last) \ 48 __builtin_va_start((ap), (last)) 67 #define va_start(ap, last) \ 68 ((ap) = (va_list)__builtin_next_arg(last)) 70 #define va_start(ap, last) \ 71 ((ap) = (va_list)&(last) + __va_size(last))
|
/freebsd-11-stable/crypto/heimdal/lib/wind/ |
H A D | stringprep.py | 80 last = 0 82 if last: 83 if last[0] == x[0]: 84 last = (last[0], last[1], last[2], last[3] + x[3]) 86 ret.append(last) 87 last [all...] |
/freebsd-11-stable/contrib/libpcap/missing/ |
H A D | strtok_r.c | 44 pcap_strtok_r(char *s, const char *delim, char **last) argument 49 if (s == NULL && (s = *last) == NULL) 63 *last = NULL; 81 *last = s;
|
/freebsd-11-stable/contrib/ncurses/ncurses/tinfo/ |
H A D | entries.c | 55 * | NULL |<--+---- |<--+---- | last 92 ENTRY *ep, *last; local 94 for (last = 0, ep = headp; ep != 0; last = ep, ep = ep->next) { 96 if (last != 0) { 97 last->next = ep->next; 100 ep->next->last = last; 106 _nc_tail = last;
|
/freebsd-11-stable/sys/riscv/include/ |
H A D | stdarg.h | 47 #define va_start(ap, last) \ 48 __builtin_va_start((ap), (last)) 65 #define va_start(ap, last) \ 66 ((ap) = (va_list)&(last) + __va_size(last))
|
/freebsd-11-stable/contrib/netbsd-tests/lib/libc/gen/ |
H A D | t_randomid.c | 41 uint32_t last[65536]; variable 56 memset(last, 0, sizeof(last)); 64 if (last[id] > 0) { 65 diff = n - last[id]; 69 printf("id %5d: last call at %9"PRIu32 73 id, last[id], n, diff, lowest); 83 last[id] = n;
|
/freebsd-11-stable/contrib/netbsd-tests/lib/libc/hash/ |
H A D | h_hash.c | 71 #define CHOMP(buf, len, last) \ 76 last = 1; \ 84 int len, outlen, last; local 87 last = 0; 90 CHOMP(buf, len, last); 96 while (!last && 99 CHOMP(buf, len, last); 109 while (!last && 112 CHOMP(buf, len, last);
|
/freebsd-11-stable/bin/mkdir/ |
H A D | mkdir.c | 143 int first, last, retval; local 151 for (first = 1, last = 0; !last ; ++p) { 153 last = 1; 157 if (!last && p[1] == '\0') 158 last = 1; 177 if (last) 179 if (mkdir(path, last ? omode : S_IRWXU | S_IRWXG | S_IRWXO) < 0) { 186 if (last) 194 if (last) [all...] |
/freebsd-11-stable/sys/libkern/ |
H A D | memmem.c | 38 char *cur, *last; local 54 /* the last position where its possible to find "s" in "l" */ 55 last = __DECONST(char *, cl) + l_len - s_len; 57 for (cur = __DECONST(char *, cl); cur <= last; cur++)
|
/freebsd-11-stable/sys/netpfil/ipfw/nat64/ |
H A D | ip_fw_nat64.h | 54 void nat64stl_uninit(struct ip_fw_chain *ch, int last); 56 void nat64lsn_uninit(struct ip_fw_chain *ch, int last); 58 void nat64clat_uninit(struct ip_fw_chain *ch, int last);
|
/freebsd-11-stable/contrib/libdivsufsort/lib/ |
H A D | trsort.c | 79 tr_insertionsort(const saidx_t *ISAd, saidx_t *first, saidx_t *last) { argument 83 for(a = first + 1; a < last; ++a) { 167 tr_pivot(const saidx_t *ISAd, saidx_t *first, saidx_t *last) { argument 171 t = last - first; 176 return tr_median3(ISAd, first, middle, last - 1); 179 return tr_median5(ISAd, first, first + t, middle, last - 1 - t, last - 1); 185 last = tr_median3(ISAd, last - 1 - (t << 1), last 222 tr_partition(const saidx_t *ISAd, saidx_t *first, saidx_t *middle, saidx_t *last, saidx_t **pa, saidx_t **pb, saidx_t v) argument 264 tr_copy(saidx_t *ISA, const saidx_t *SA, saidx_t *first, saidx_t *a, saidx_t *b, saidx_t *last, saidx_t depth) argument 289 tr_partialcopy(saidx_t *ISA, const saidx_t *SA, saidx_t *first, saidx_t *a, saidx_t *b, saidx_t *last, saidx_t depth) argument 327 tr_introsort(saidx_t *ISA, const saidx_t *ISAd, saidx_t *SA, saidx_t *first, saidx_t *last, trbudget_t *budget) argument 557 saidx_t *first, *last; local [all...] |
H A D | sssort.c | 168 saidx_t *first, saidx_t *last, saidx_t depth) { 173 for(i = last - 2; first <= i; --i) { 175 do { *(j - 1) = *j; } while((++j < last) && (*j < 0)); 176 if(last <= j) { break; } 263 ss_pivot(const sauchar_t *Td, const saidx_t *PA, saidx_t *first, saidx_t *last) { argument 267 t = last - first; 272 return ss_median3(Td, PA, first, middle, last - 1); 275 return ss_median5(Td, PA, first, first + t, middle, last - 1 - t, last - 1); 281 last 167 ss_insertionsort(const sauchar_t *T, const saidx_t *PA, saidx_t *first, saidx_t *last, saidx_t depth) argument 291 ss_partition(const saidx_t *PA, saidx_t *first, saidx_t *last, saidx_t depth) argument 310 ss_mintrosort(const sauchar_t *T, const saidx_t *PA, saidx_t *first, saidx_t *last, saidx_t depth) argument 461 ss_rotate(saidx_t *first, saidx_t *middle, saidx_t *last) argument 502 ss_inplacemerge(const sauchar_t *T, const saidx_t *PA, saidx_t *first, saidx_t *middle, saidx_t *last, saidx_t depth) argument 545 ss_mergeforward(const sauchar_t *T, const saidx_t *PA, saidx_t *first, saidx_t *middle, saidx_t *last, saidx_t *buf, saidx_t depth) argument 595 ss_mergebackward(const sauchar_t *T, const saidx_t *PA, saidx_t *first, saidx_t *middle, saidx_t *last, saidx_t *buf, saidx_t depth) argument 654 ss_swapmerge(const sauchar_t *T, const saidx_t *PA, saidx_t *first, saidx_t *middle, saidx_t *last, saidx_t *buf, saidx_t bufsize, saidx_t depth) argument 747 sssort(const sauchar_t *T, const saidx_t *PA, saidx_t *first, saidx_t *last, saidx_t *buf, saidx_t bufsize, saidx_t depth, saidx_t n, saint_t lastsuffix) argument [all...] |
/freebsd-11-stable/contrib/gcc/ |
H A D | genmddeps.c | 33 static struct filedep *deps, **last = &deps; variable in typeref:struct: 40 *last = n; 41 last = &n->next; 55 *last = NULL;
|
/freebsd-11-stable/usr.bin/users/ |
H A D | users.cc | 67 set<string>::iterator last = names.end(); local 68 --last; 69 copy(names.begin(), last, ostream_iterator<string>(cout, " ")); 70 cout << *last << endl;
|
/freebsd-11-stable/contrib/gcclibs/libgomp/config/linux/ |
H A D | bar.c | 38 gomp_barrier_wait_end (gomp_barrier_t *bar, bool last) argument 40 if (last)
|
/freebsd-11-stable/contrib/bmake/lst.lib/ |
H A D | lstConcat.c | 83 ListNode last; /* the last element in the list. Keeps local 96 * last element of list two to be NIL to make the loop easier and 105 * first element of the second list to the last element of the 107 * last element of the list to the first element of the second list 108 * The last element of the second list, if it exists, then becomes 109 * the last element of the first list. 123 * first element to the last and vice versa 131 * We set the nextPtr of the last element of list 2 to be nil to make 135 * datum field of the corresponding element in l2. The 'last' nod [all...] |
/freebsd-11-stable/sys/arm64/include/ |
H A D | stdarg.h | 47 #define va_start(ap, last) \ 48 __builtin_va_start((ap), (last))
|