longest
DeserializeNumberSigned(char *pBuffer, size_t zBUfferLength, struct CTypeDescriptor *pType, longest L)
static longest
longest L = 0;
memcpy(&L, REINTERPRET_CAST(longest *, ulNumber), sizeof(longest));
longest L = llliGetNumber(szLocation, pType, ulNumber);
static void DeserializeNumberSigned(char *pBuffer, size_t zBUfferLength, struct CTypeDescriptor *pType, longest L);
static longest llliGetNumber(char *szLocation, struct CTypeDescriptor *pType, unsigned long ulNumber);
longest = min(arglenmax, INT_MAX - 2);
(void) printf("%-*s ", (int) longest, zone);
static size_t longest;
char *longest;
longest = NULL;
longest = OPERAND(scan);
r->regmust = longest;
longest arg;
ptrdiff_t longest;
longest = 0;
if (q - name > longest) {
longest = q - name;
} else if (q - name == longest)
unsigned count = 1, u, longest = 0, c = 0;
if (c > longest)
longest = c;
num_buf = malloc(longest + 1);
int nmatches, longest;
longest = 0;
if (q - name > longest) {
longest = q - name;
} else if (q - name == longest)
static int debug, longest, quiet, reverse;
longest = 1;
if (len > 0 && !longest)
wc_count_t charct, linect, wordct, longest;
linect = wordct = charct = longest = 0;
if (linelen > longest)
longest = linelen;
print_counts(linect, wordct, charct, longest, file);
if (dolongest && longest > tlongest)
tlongest = longest;
wc_count_t longest, const char *name)
(void)printf(WCFMT, (WCCAST)longest);
int nmatches, longest;
longest = 0;
if (q - name > longest) {
longest = q - name;
} else if (q - name == longest)
struct riprt *longest;
longest = NULL;
if (!longest
|| longest->rrt_info.rip6_plen <
longest = rrt;
rrt = longest;
const char *longest;
len = strlen(msg_no); longest = msg_no;
i = strlen(msg_yes); if (i > len) {len = i; longest = msg_yes; }
i = strlen(msg_all); if (i > len) {len = i; longest = msg_all; }
i = strlen(msg_some); if (i > len) {len = i; longest = msg_some; }
i = strlen(msg_none); if (i > len) {len = i; longest = msg_none; }
select_menu_width = snprintf(NULL, 0, "%-40s %s", "", longest);
int nmatches, longest;
longest = 0;
if (q - name > longest) {
longest = q - name;
} else if (q - name == longest)