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

  /src/lib/libresolv/
res_update.c 105 int nzones = 0, nscount = 0, n; local in function:res_nupdate
187 nzones++;
205 return (nzones);
res_update.c 105 int nzones = 0, nscount = 0, n; local in function:res_nupdate
187 nzones++;
205 return (nzones);
  /src/sys/fs/filecorefs/
filecore.h 111 unsigned nzones:8; /* number of zones in the map */ member in struct:filecore_disc_record
filecore.h 111 unsigned nzones:8; /* number of zones in the map */ member in struct:filecore_disc_record
  /src/sys/sys/
disklabel_acorn.h 79 uint8_t nzones; member in struct:filecore_bootblock
disklabel_acorn.h 79 uint8_t nzones; member in struct:filecore_bootblock
  /src/sys/arch/acorn32/stand/lib/
riscoscalls.h 402 uint8_t nzones; member in struct:filecore_disc
riscoscalls.h 402 uint8_t nzones; member in struct:filecore_disc
  /src/lib/libc/time/
zic.c 352 static ptrdiff_t nzones; /* number of zones */ variable in typeref:typename:ptrdiff_t
1156 for (i = 0; i < nzones; i = j) {
1160 for (j = i + 1; j < nzones && zones[j].z_name == NULL; ++j)
1665 for (i = 0; i < nzones; ++i) {
1675 for (i = 0; i < nzones; ++i) {
1683 for (i = 0; i < nzones; ++i) {
1936 for (i = 0; i < nzones; ++i)
2021 if (iscont && nzones > 0 &&
2024 zones[nzones - 1].z_untiltime > min_time &&
2025 zones[nzones - 1].z_untiltime < max_time &
    [all...]
zic.c 352 static ptrdiff_t nzones; /* number of zones */ variable in typeref:typename:ptrdiff_t
1156 for (i = 0; i < nzones; i = j) {
1160 for (j = i + 1; j < nzones && zones[j].z_name == NULL; ++j)
1665 for (i = 0; i < nzones; ++i) {
1675 for (i = 0; i < nzones; ++i) {
1683 for (i = 0; i < nzones; ++i) {
1936 for (i = 0; i < nzones; ++i)
2021 if (iscont && nzones > 0 &&
2024 zones[nzones - 1].z_untiltime > min_time &&
2025 zones[nzones - 1].z_untiltime < max_time &
    [all...]

Completed in 28 milliseconds