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

  /src/lib/libc/gen/
stringlist.c 69 sl->sl_cur = 0;
92 if (sl->sl_cur == sl->sl_max - 1) {
102 sl->sl_str[sl->sl_cur++] = name;
119 for (i = 0; i < sl->sl_cur; i++)
137 for (i = 0; i < sl->sl_cur; i++)
149 for (i = 0; i < sl->sl_cur; i++)
153 for (j = i + 1; j < sl->sl_cur; j++)
155 sl->sl_str[--sl->sl_cur] = NULL;
getnetgrent.c 192 for (i = 0; i < sl->sl_cur; i++)
  /src/include/
stringlist.h 43 size_t sl_cur; member in struct:_stringlist
  /src/tests/lib/libpthread/
h_resolv.c 98 size_t i = (random() & 0x0fffffff) % hosts->sl_cur;
171 if (hosts->sl_cur == 0)
176 if ((ask = calloc(hosts->sl_cur, sizeof(int))) == NULL)
178 if ((got = calloc(hosts->sl_cur, sizeof(int))) == NULL)
200 for (i = 0; i < (int)hosts->sl_cur; i++) {
  /src/usr.sbin/services_mkdb/
output_cdb.c 78 for (i = 0; i < sl->sl_cur; ++i) {
93 for (i = 0; i < sl->sl_cur; ++i) {
119 for (i = 0; i < sl->sl_cur; i++) {
output_db.c 117 for (i = 0; i < sl->sl_cur; i++) {
174 for (i = 1, pos = 0; i < sl->sl_cur; i++) {
services_mkdb.c 300 for (i= 0; i < sl->sl_cur; i++)
314 assert(i < sl->sl_cur);
  /src/usr.bin/ftp/
complete.c 87 if (words->sl_cur == 0)
90 if (words->sl_cur == 1) { /* only once choice available */
104 for (i = 1 ; i < words->sl_cur ; i++) {
122 qsort(words->sl_str, words->sl_cur, sizeof(char *), comparstr);
336 for (i = 0; i < dirlist->sl_cur; i++) {
util.c 917 for (i = 0 ; i < sl->sl_cur ; i++) {
927 lines = (sl->sl_cur + columns - 1) / columns;
933 if (j * lines + i + lines >= sl->sl_cur) {
main.c 819 marg_sl->sl_cur = 0; /* reset to start of marg_sl */
  /src/usr.bin/locale/
locale.c 321 for (i = 0; i < locales->sl_cur; i++) {
358 for (i = 0; i < locales->sl_cur; i++) {
372 qsort(charmaps->sl_str, charmaps->sl_cur, sizeof(char *), scmp);
375 for (i = 0; i < charmaps->sl_cur; i++) {
437 qsort(locales->sl_str, locales->sl_cur, sizeof(char *), scmp);
  /src/usr.bin/mail/
complete.c 100 for (i = 0; i < sl->sl_cur; i++) {
110 lines = (sl->sl_cur + columns - 1) / columns;
117 if (j * lines + i + lines >= sl->sl_cur) {
255 if (words->sl_cur == 0)
258 if (words->sl_cur == 1) { /* only once choice available */
273 for (i = 1; i < words->sl_cur; i++) {
291 qsort(words->sl_str, words->sl_cur, sizeof(char *), comparstr);
  /src/libexec/ftpd/
popen.c 194 exit(ls_main(sl->sl_cur - 1, sl->sl_str));

Completed in 16 milliseconds