Lines Matching defs:nzones
242 static int nzones; /* number of zones */
563 for (i = 0; i < nzones; i = j) {
567 for (j = i + 1; j < nzones && zones[j].z_name == NULL; ++j)
777 for (i = 0; i < nzones; ++i) {
787 for (i = 0; i < nzones; ++i) {
795 for (i = 0; i < nzones; ++i) {
1025 for (i = 0; i < nzones; ++i)
1113 if (iscont && nzones > 0 &&
1116 zones[nzones - 1].z_untiltime > min_time &&
1117 zones[nzones - 1].z_untiltime < max_time &&
1118 zones[nzones - 1].z_untiltime >= z.z_untiltime) {
1125 (int)((nzones + 1) * sizeof (*zones)));
1126 zones[nzones++] = z;