Lines Matching defs:nfields
111 static void inleap(char **fields, int nfields);
113 static void inlink(char **fields, int nfields);
114 static void inrule(char **fields, int nfields);
115 static int inzcont(char **fields, int nfields);
116 static int inzone(char **fields, int nfields);
117 static int inzsub(char **fields, int nfields, int iscont);
824 register int nfields;
851 nfields = 0;
852 while (fields[nfields] != NULL) {
855 if (strcmp(fields[nfields], "-") == 0)
856 fields[nfields] = &nada;
857 ++nfields;
859 if (nfields == 0) {
862 wantcont = inzcont(fields, nfields);
869 inrule(fields, nfields);
873 wantcont = inzone(fields, nfields);
876 inlink(fields, nfields);
885 else inleap(fields, nfields);
970 inrule(fields, nfields)
972 const int nfields;
976 if (nfields != RULE_FIELDS) {
998 inzone(fields, nfields)
1000 const int nfields;
1005 if (nfields < ZONE_MINFIELDS || nfields > ZONE_MAXFIELDS) {
1039 return (inzsub(fields, nfields, FALSE));
1043 inzcont(fields, nfields)
1045 const int nfields;
1047 if (nfields < ZONEC_MINFIELDS || nfields > ZONEC_MAXFIELDS) {
1052 return (inzsub(fields, nfields, TRUE));
1056 inzsub(fields, nfields, iscont)
1058 const int nfields;
1099 hasuntil = nfields > i_untilyear;
1107 (nfields > i_untilmonth) ?
1109 (nfields > i_untilday) ? fields[i_untilday] : "1",
1110 (nfields > i_untiltime) ? fields[i_untiltime] : "0");
1136 inleap(fields, nfields)
1138 const int nfields;
1147 if (nfields != LEAP_FIELDS) {
1235 inlink(fields, nfields)
1237 const int nfields;
1241 if (nfields != LINK_FIELDS) {