Lines Matching full:nfields
149 static void inleap(char ** fields, int nfields);
150 static void inlink(char ** fields, int nfields);
151 static void inrule(char ** fields, int nfields);
152 static int inzcont(char ** fields, int nfields);
153 static int inzone(char ** fields, int nfields);
154 static int inzsub(char ** fields, int nfields, int iscont);
946 register int nfields;
973 nfields = 0;
974 while (fields[nfields] != NULL) {
977 if (strcmp(fields[nfields], "-") == 0)
978 fields[nfields] = &nada;
979 ++nfields;
981 if (nfields == 0) {
984 wantcont = inzcont(fields, nfields);
991 inrule(fields, nfields);
995 wantcont = inzone(fields, nfields);
998 inlink(fields, nfields);
1006 else inleap(fields, nfields);
1088 inrule(fields, nfields)
1090 const int nfields;
1094 if (nfields != RULE_FIELDS) {
1117 inzone(fields, nfields)
1119 const int nfields;
1124 if (nfields < ZONE_MINFIELDS || nfields > ZONE_MAXFIELDS) {
1158 return inzsub(fields, nfields, FALSE);
1162 inzcont(fields, nfields)
1164 const int nfields;
1166 if (nfields < ZONEC_MINFIELDS || nfields > ZONEC_MAXFIELDS) {
1170 return inzsub(fields, nfields, TRUE);
1174 inzsub(fields, nfields, iscont)
1176 const int nfields;
1218 hasuntil = nfields > i_untilyear;
1226 (nfields > i_untilmonth) ?
1228 (nfields > i_untilday) ? fields[i_untilday] : "1",
1229 (nfields > i_untiltime) ? fields[i_untiltime] : "0");
1255 inleap(fields, nfields)
1257 const int nfields;
1266 if (nfields != LEAP_FIELDS) {
1359 inlink(fields, nfields)
1361 const int nfields;
1365 if (nfields != LINK_FIELDS) {
