Searched refs:nextlen (Results 1 – 5 of 5) sorted by relevance
715 int nextlen = tree[0].Len; /* length of next code */ local720 if (nextlen == 0) max_count = 138, min_count = 3;724 curlen = nextlen; nextlen = tree[n+1].Len;725 if (++count < max_count && curlen == nextlen) {738 if (nextlen == 0) {740 } else if (curlen == nextlen) {760 int nextlen = tree[0].Len; /* length of next code */ local766 if (nextlen == 0) max_count = 138, min_count = 3;769 curlen = nextlen; nextlen = tree[n+1].Len;770 if (++count < max_count && curlen == nextlen) {[all …]
388 int i, nextlen; in ofmt_fit_width() local400 nextlen = 0; in ofmt_fit_width()404 nextlen = strlen(sp->s_fields[i + 1]); in ofmt_fit_width()407 if (strlen(value) + nextlen > width || ptr >= lim) { in ofmt_fit_width()
2072 int nextlen = tree[0].Len; /* length of next code */ local2077 if (nextlen == 0) max_count = 138, min_count = 3;2081 curlen = nextlen; nextlen = tree[n+1].Len;2082 if (++count < max_count && curlen == nextlen) {2095 if (nextlen == 0) {2097 } else if (curlen == nextlen) {2117 int nextlen = tree[0].Len; /* length of next code */ local2123 if (nextlen == 0) max_count = 138, min_count = 3;2126 curlen = nextlen; nextlen = tree[n+1].Len;2127 if (++count < max_count && curlen == nextlen) {[all …]
2908 int nextlen = tree[0].Len; /* length of next code */ local2913 if (nextlen == 0) max_count = 138, min_count = 3;2917 curlen = nextlen; nextlen = tree[n+1].Len;2918 if (++count < max_count && curlen == nextlen) {2931 if (nextlen == 0) {2933 } else if (curlen == nextlen) {2955 int nextlen = tree[0].Len; /* length of next code */ local2961 if (nextlen == 0) max_count = 138, min_count = 3;2964 curlen = nextlen; nextlen = tree[n+1].Len;2965 if (++count < max_count && curlen == nextlen) {[all …]
337 size_t nextlen; in sctp_chunkify() local354 nextlen = next_msg_hdr->smh_msglen; in sctp_chunkify()359 if ((firstseg_len != 0) && (nextlen > remaining_len)) in sctp_chunkify()