Lines Matching defs:nfields
125 static void inleap(char ** fields, int nfields);
126 static void inlink(char ** fields, int nfields);
127 static void inrule(char ** fields, int nfields);
128 static int inzcont(char ** fields, int nfields);
129 static int inzone(char ** fields, int nfields);
130 static int inzsub(char ** fields, int nfields, int iscont);
809 register int nfields;
831 nfields = 0;
832 while (fields[nfields] != NULL) {
835 if (strcmp(fields[nfields], "-") == 0)
836 fields[nfields] = &nada;
837 ++nfields;
839 if (nfields == 0) {
842 wantcont = inzcont(fields, nfields);
849 inrule(fields, nfields);
853 wantcont = inzone(fields, nfields);
856 inlink(fields, nfields);
863 else inleap(fields, nfields);
935 inrule(fields, nfields)
937 const int nfields;
941 if (nfields != RULE_FIELDS) {
964 inzone(fields, nfields)
966 const int nfields;
971 if (nfields < ZONE_MINFIELDS || nfields > ZONE_MAXFIELDS) {
1005 return inzsub(fields, nfields, FALSE);
1009 inzcont(fields, nfields)
1011 const int nfields;
1013 if (nfields < ZONEC_MINFIELDS || nfields > ZONEC_MAXFIELDS) {
1017 return inzsub(fields, nfields, TRUE);
1021 inzsub(fields, nfields, iscont)
1023 const int nfields;
1065 hasuntil = nfields > i_untilyear;
1073 (nfields > i_untilmonth) ?
1075 (nfields > i_untilday) ? fields[i_untilday] : "1",
1076 (nfields > i_untiltime) ? fields[i_untiltime] : "0");
1102 inleap(fields, nfields)
1104 const int nfields;
1113 if (nfields != LEAP_FIELDS) {
1206 inlink(fields, nfields)
1208 const int nfields;
1212 if (nfields != LINK_FIELDS) {