| /freebsd/contrib/dialog/ |
| H A D | buttons.c | 35 center_label(char *buffer, int longest, const char *label) in center_label() argument
41 if (len < longest) { in center_label()
42 int left = (longest - len) / 2; in center_label()
43 right = (longest - len - left); in center_label()
252 int *longest, in dlg_button_sizes() argument
258 *longest = 0; in dlg_button_sizes()
262 *longest = 1; in dlg_button_sizes()
265 if (len > *longest) in dlg_button_sizes()
266 *longest = len; in dlg_button_sizes()
274 if (*longest < 6 - (*longest & 1)) in dlg_button_sizes()
[all …]
|
| /freebsd/usr.bin/systat/ |
| H A D | cmds.c | 151 int nmatches, longest; in lookup() local
153 longest = 0; in lookup()
161 if (q - name > longest) { in lookup()
162 longest = q - name; in lookup()
165 } else if (q - name == longest) in lookup()
|
| /freebsd/lib/libdpv/ |
| H A D | dialog_util.c | 385 int longest = 0; in dialog_prompt_longestline() local
402 if (n > longest) in dialog_prompt_longestline()
403 longest = n; in dialog_prompt_longestline()
421 if (n > longest) in dialog_prompt_longestline()
422 longest = n; in dialog_prompt_longestline()
437 if (n > longest) in dialog_prompt_longestline()
438 longest = n; in dialog_prompt_longestline()
440 return (longest); in dialog_prompt_longestline()
|
| /freebsd/usr.sbin/lpr/lpc/ |
| H A D | lpc.c | 226 register int nmatches, longest; in getcmd() local
228 longest = 0; in getcmd()
236 if (q - name > longest) { in getcmd()
237 longest = q - name; in getcmd()
240 } else if (q - name == longest) in getcmd()
|
| /freebsd/crypto/heimdal/appl/ftp/ftp/ |
| H A D | main.c | 344 int nmatches, longest; in getcmd() local
346 longest = 0; in getcmd()
354 if (q - name > longest) { in getcmd()
355 longest = q - name; in getcmd()
358 } else if (q - name == longest) in getcmd()
|
| /freebsd/sys/compat/linux/ |
| H A D | stats_timing.d | 57 @longest[probeprov, probefunc] = max(this->timediff);
85 printa(@longest);
|
| H A D | trace_futexes.d | 159 @longest[probeprov, probefunc] = max(this->timediff);
179 printa(@longest);
|
| /freebsd/usr.sbin/bsdconfig/share/ |
| H A D | strings.subr | 460 # Simple wrapper to an awk(1) script to print the length of the longest line of
465 BEGIN { longest = 0 }
472 longest = ( len > longest ? len : longest )
478 longest = ( len > longest ? len : longest )
481 END { print longest }
|
| H A D | dialog.subr | 917 # Always process the menu-item arguments to get the longest tag-length,
918 # longest item-length (both used to bump the width), and the number of
951 # The sum total between the longest tag-length and the
952 # longest item-length should be used to bump menu width
1010 # Always process the menu-item arguments to get the longest tag-length,
1011 # longest item-length, longest help-length (help-length only considered
1047 # The sum total between the longest tag-length and the
1048 # longest item-length should be used to bump menu width
1115 # Always process the menu-item arguments to get the longest tag-length,
1116 # longest item-length (both used to bump the width), and the number of
[all …]
|
| /freebsd/crypto/openssl/ |
| H A D | configdata.pm.in | 263 my $longest = 0;
266 $longest = length($what) if $longest < length($what);
277 print " $what", ' ' x ($longest - length($what) + 1),
|
| /freebsd/contrib/sendmail/src/ |
| H A D | alias.c | 720 long naliases, bytes, longest; local
736 naliases = bytes = longest = 0;
938 if (rhssize > longest)
939 longest = rhssize;
947 map->map_file, naliases, longest, bytes);
951 map->map_file, naliases, longest, bytes);
|
| /freebsd/usr.bin/tsort/ |
| H A D | tsort.c | 90 static int debug, longest, quiet; variable
117 longest = 1; in main()
406 if (len > 0 && !longest) in find_cycle()
|
| /freebsd/sys/kern/ |
| H A D | kern_ubsan.c | 124 typedef __int128 longest; typedef
127 typedef int64_t longest; typedef
259 …rializeNumberSigned(char *pBuffer, size_t zBUfferLength, struct CTypeDescriptor *pType, longest L);
265 static longest llliGetNumber(char *szLocation, struct CTypeDescriptor *pType, unsigned long ulNumbe…
1347 DeserializeNumberSigned(char *pBuffer, size_t zBUfferLength, struct CTypeDescriptor *pType, longest…
1473 static longest
1477 longest L = 0;
1489 memcpy(&L, REINTERPRET_CAST(longest *, ulNumber), sizeof(longest));
1604 longest L = llliGetNumber(szLocation, pType, ulNumber);
|
| /freebsd/sys/contrib/zlib/doc/ |
| H A D | algorithm.txt | 25 the longest match is selected.
34 parameter of deflateInit). So deflate() does not always find the longest
68 input less than the length of longest code. It gets that many bits from the
77 be a first level table to cover all the way to the longest code. However,
118 longest symbol is? The reason is that if you do that, you end up spending
161 Table X is two bits long since the longest code starting with 110 is five bits
169 Table Y is three bits long since the longest code starting with 111 is six
|
| /freebsd/contrib/tnftp/src/ |
| H A D | main.c | 756 int nmatches, longest; in getcmd() local
761 longest = 0; in getcmd()
769 if (q - name > longest) { in getcmd()
770 longest = q - name; in getcmd()
773 } else if (q - name == longest) in getcmd()
|
| /freebsd/usr.bin/tftp/ |
| H A D | main.c | 784 ptrdiff_t longest; in getcmd() local
787 longest = 0; in getcmd()
795 if (q - name > longest) { in getcmd()
796 longest = q - name; in getcmd()
799 } else if (q - name == longest) in getcmd()
|
| /freebsd/contrib/less/ |
| H A D | regexp.c | 214 register char *longest;
267 * longest literal string that must appear and make it the
274 longest = NULL;
278 longest = OPERAND(scan);
281 r->regmust = longest;
215 register char *longest; global() local
|
| H A D | line.c | 231 linebuf.print = 6; /* big enough for longest UTF-8 sequence */ in prewind()
1683 * Find the shift necessary to show the end of the longest displayed line.
1690 int longest = 0;
1700 if (end_column > longest)
1701 longest = end_column;
1704 if (longest < sc_width)
1706 return longest - sc_width;
1524 int longest = 0; rrshift() local
|
| /freebsd/contrib/llvm-project/lldb/source/Interpreter/ |
| H A D | CommandObject.cpp | 465 size_t longest = 0; in GetArgumentHelp() local
467 longest = in GetArgumentHelp()
468 std::max(longest, llvm::StringRef(element.string_value).size()); in GetArgumentHelp()
473 element.usage, longest); in GetArgumentHelp()
|
| /freebsd/crypto/heimdal/lib/roken/ |
| H A D | snprintf.c | 114 typedef long long longest; typedef
117 typedef long longest; typedef
448 longest arg; in xyzprintf()
|
| /freebsd/contrib/tzcode/ |
| H A D | zdump.c | 86 static size_t longest; variable
591 longest = 0; in main()
594 if (longest < arglen) in main()
595 longest = min(arglen, INT_MAX); in main()
854 printf("%-*s ", (int)longest, zone); in show()
|
| /freebsd/sys/netgraph/ |
| H A D | ng_pipe.c | 686 int longest = 0; in ngp_rcvdata()
688 /* Find the longest queue */ in ngp_rcvdata()
690 if (ngp_f1->packets > longest) { in ngp_rcvdata()
691 longest = ngp_f1->packets; in ngp_rcvdata()
679 int longest = 0; ngp_rcvdata() local
|
| /freebsd/contrib/llvm-project/lldb/source/Plugins/TraceExporter/docs/ |
| H A D | htr.rst | 35 A “basic super block” is the longest sequence of blocks that always occur in the same order. (The concept is akin to “Basic Block'' in compiler theory, but refers to dynamic occurrences rather than CFG nodes).
|
| /freebsd/usr.sbin/route6d/ |
| H A D | route6d.c | 1985 struct riprt *longest; in rt_del() local
1988 longest = NULL; in rt_del()
1993 if (!longest in rt_del()
1994 || longest->rrt_info.rip6_plen < in rt_del()
1996 longest = rrt; in rt_del()
2000 rrt = longest; in rt_del()
|
| /freebsd/contrib/llvm-project/lldb/source/Host/common/ |
| H A D | Editline.cpp | 941 auto longest = in DisplayCompletions() local
946 const size_t max_len = longest->GetCompletion().size(); in DisplayCompletions()
|