Searched refs:last (Results 1 - 25 of 856) sorted by relevance

1234567891011>>

/freebsd-head/contrib/apr/strings/
H A Dapr_strtok.c27 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-head/lib/libc/string/
H A Dwcsrchr.c37 const wchar_t *last; local
39 last = NULL;
42 last = s;
48 return ((wchar_t *)last);
H A Dwcstok.c44 wchar_t ** __restrict last)
50 if (s == NULL && (s = *last) == NULL)
64 *last = NULL;
82 *last = s;
43 wcstok(wchar_t * __restrict s, const wchar_t * __restrict delim, wchar_t ** __restrict last) argument
H A Dstrtok.c54 __strtok_r(char *s, const char *delim, char **last) argument
59 if (s == NULL && (s = *last) == NULL)
73 *last = NULL;
91 *last = s;
102 static char *last; local
104 return (__strtok_r(s, delim, &last));
/freebsd-head/contrib/dialog/samples/
H A Dinfobox614 last='\'
17 $DIALOG $last
26 --title "INFO BOX" $* $last
32 You have $left $unit to read this..." 0 0 $last
H A Dinfobox512 last='\'
15 $DIALOG $last
30 You have $left $unit to read this..." 0 0 $last
/freebsd-head/sys/netpfil/ipfw/pmod/
H A Dpmod.h34 void tcpmod_uninit(struct ip_fw_chain *ch, int last);
/freebsd-head/usr.bin/last/
H A DMakefile4 PROG= last
/freebsd-head/crypto/heimdal/lib/wind/
H A Dstringprep.py80 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...]
H A Dtest-normalize.c50 char *last; local
55 for(n = strtok_r(buf, " ", &last);
57 n = strtok_r(NULL, " ", &last)) {
85 char *last; local
95 c = strtok_r(buf, ";", &last);
100 if (strtok_r(NULL, ";", &last) == NULL)
102 if (strtok_r(NULL, ";", &last) == NULL)
104 c = strtok_r(NULL, ";", &last);
108 if (strtok_r(NULL, ";", &last) == NULL)
110 c = last;
[all...]
/freebsd-head/contrib/libpcap/missing/
H A Dstrtok_r.c44 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-head/contrib/ncurses/misc/
H A Dmakedef.cmd61 * `last' is the index of the last symbol defined
63 last = 0
133 when names.last = new_name then
135 codes.last = new_code
140 last = last + 1
141 names.last = new_name
142 codes.last = 0
155 do while inx <= last
[all...]
/freebsd-head/contrib/netbsd-tests/lib/libc/gen/
H A Dt_randomid.c41 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-head/contrib/netbsd-tests/lib/libc/hash/
H A Dh_hash.c71 #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-head/sys/libkern/
H A Dmemmem.c38 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-head/bin/mkdir/
H A Dmkdir.c145 int first, last, retval; local
153 for (first = 1, last = 0; !last ; ++p) {
155 last = 1;
159 if (!last && p[1] == '\0')
160 last = 1;
179 if (last)
181 if (mkdir(path, last ? omode : S_IRWXU | S_IRWXG | S_IRWXO) < 0) {
188 if (last)
196 if (last)
[all...]
/freebsd-head/sys/netpfil/ipfw/nat64/
H A Dip_fw_nat64.h54 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-head/contrib/libdivsufsort/lib/
H A Dtrsort.c79 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 Dsssort.c168 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-head/usr.bin/users/
H A Dusers.cc69 set<string>::iterator last = names.end(); local
70 --last;
71 copy(names.begin(), last, ostream_iterator<string>(cout, " "));
72 cout << *last << endl;
/freebsd-head/sbin/ping/
H A Dutils.c65 } last; local
88 last.uc[0] = *w;
89 last.uc[1] = 0;
90 sum += last.us;
/freebsd-head/contrib/bmake/lst.lib/
H A DlstConcat.c83 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-head/contrib/ncurses/ncurses/tinfo/
H A Dentries.c56 * | NULL |<--+---- |<--+---- | last
71 ENTRY *ep, *last; local
73 for (last = 0, ep = headp; ep != 0; last = ep, ep = ep->next) {
75 if (last != 0) {
76 last->next = ep->next;
79 ep->next->last = last;
85 _nc_tail = last;
/freebsd-head/contrib/ntp/ntpdc/
H A Dnl.pl.in4 $last = 0;
14 $last = 1;
37 $found = 0 if $last;
/freebsd-head/sys/x86/x86/
H A Ddelay.c79 u_int last, mask, u; local
99 last = func(tc) & mask;
103 if (u < last)
104 now += mask - last + u + 1;
106 now += u - last;
107 last = u;

Completed in 103 milliseconds

1234567891011>>