| /external/linux-tools-perf/util/ |
| D | help.c | 73 static void pretty_print_string_list(struct cmdnames *cmds, int longest) in pretty_print_string_list() argument
76 int space = longest + 1; /* min 1 SP between words */ in pretty_print_string_list()
201 unsigned int i, longest = 0; in list_commands() local
204 if (longest < main_cmds->names[i]->len) in list_commands()
205 longest = main_cmds->names[i]->len; in list_commands()
207 if (longest < other_cmds->names[i]->len) in list_commands()
208 longest = other_cmds->names[i]->len; in list_commands()
216 pretty_print_string_list(main_cmds, longest); in list_commands()
225 pretty_print_string_list(other_cmds, longest); in list_commands()
|
| D | parse-events.c | 363 int n, longest = -1; in parse_aliases() local
368 if (n > longest && !strncasecmp(*str, names[i][j], n)) in parse_aliases()
369 longest = n; in parse_aliases()
371 if (longest > 0) { in parse_aliases()
372 *str += longest; in parse_aliases()
|
| /external/regex-re2/re2/testing/ |
| D | backtrack.cc | 54 bool anchored, bool longest,
95 bool anchored, bool longest, in Search() argument
106 longest_ = longest | prog_->anchor_end(); in Search()
246 bool longest = kind != kFirstMatch; in UnsafeSearchBacktrack() local
247 if (!b.Search(text, context, anchored, longest, match, nmatch)) in UnsafeSearchBacktrack()
|
| D | exhaustive_tester.cc | 103 RE2::Options longest; in HandleRegexp() local
104 longest.set_longest_match(true); in HandleRegexp()
105 RE2 relongest(regexp, longest); in HandleRegexp()
|
| /external/regex-re2/re2/ |
| D | bitstate.cc | 39 bool anchored, bool longest,
294 bool anchored, bool longest, in Search() argument
306 longest_ = longest || prog_->anchor_end(); in Search()
370 bool longest = kind != kFirstMatch; in SearchBitState() local
371 if (!b.Search(text, context, anchored, longest, match, nmatch)) in SearchBitState()
|
| D | nfa.cc | 51 bool anchored, bool longest,
401 bool anchored, bool longest, in Search() argument
425 longest = true; in Search()
437 longest_ = longest; in Search()
456 longest); in Search()
|
| /external/linux-tools-perf/ |
| D | builtin-help.c | 280 unsigned int i, longest = 0; in list_common_cmds_help() local
283 if (longest < strlen(common_cmds[i].name)) in list_common_cmds_help()
284 longest = strlen(common_cmds[i].name); in list_common_cmds_help()
289 printf(" %-*s ", longest, common_cmds[i].name); in list_common_cmds_help()
|
| D | android.patch | 818 int space = longest + 1; /* min 1 SP between words */
|
| /external/zlib/src/doc/ |
| 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
|
| D | rfc1951.txt | 808 sequence starting at the current point, and selects the longest
|
| /external/icu4c/tools/tzcode/ |
| D | zdump.c | 160 static size_t longest; variable
427 longest = 0;
429 if (strlen(argv[i]) > longest)
430 longest = strlen(argv[i]);
440 (fakeenv[0] = (char *) malloc(longest + 4)) == NULL) {
747 (void) printf("%-*s ", (int) longest, zone); in show()
|
| /external/sepolicy/ |
| D | genfs_contexts | 3 # proc labeling can be further refined (longest matching prefix).
|
| /external/chromium/chrome/common/extensions/docs/server/ |
| D | README | 40 view and delete the version which was deployed the longest time ago. Then
|
| /external/iproute2/doc/ |
| D | ip-cref.tex | 1090 \item The longest matching prefix is selected. All shorter ones
1093 \item If the TOS of some route with the longest prefix is equal to the TOS
1233 the longest match is understood as: First, compare the TOS
1922 according to the longest match rule, is replaced with a ``routing policy
1956 a route from these tables according to the classic longest match algorithm.
|
| /external/zlib/src/ |
| D | ChangeLog | 425 - Add AMD64 assembler code for longest match to contrib [Teterin]
|
| /external/qemu/distrib/jpeg-6b/ |
| D | libjpeg.doc | 1650 longest standard marker in the file. Standard JPEG markers should normally
1651 not exceed a few hundred bytes each (DHT tables are typically the longest).
|
| /external/jpeg/ |
| D | libjpeg.doc | 1650 longest standard marker in the file. Standard JPEG markers should normally
1651 not exceed a few hundred bytes each (DHT tables are typically the longest).
|
| /external/webkit/Tools/android/flex-2.5.4a/MISC/ |
| D | flex.man | 413 whether this rule is the "longest match",
|
| /external/webkit/Tools/android/flex-2.5.4a/MISC/texinfo/ |
| D | flex.info | 445 included when determining whether this rule is the "longest
|
| D | flex.texi | 534 the @dfn{longest match}, but is then returned to the input before
|
| /external/svox/pico_resources/tools/LingwareBuilding/PicoLingware_source_files/textana/en-US/ |
| D | en-US_lexpos.utf | 786 ADJ^N "longest" :G2P
|
| /external/svox/pico_resources/tools/LingwareBuilding/PicoLingware_source_files/textana/en-GB/ |
| D | en-GB_lexpos.utf | 950 ADJ^N "longest" :G2P
|
| /external/mksh/src/ |
| D | check.t | 1725 longest...)
|
| /external/webkit/Source/JavaScriptCore/ |
| D | ChangeLog-2008-08-10 | 10583 - renamed a few opcodes and fixed assembly formatting to accomodate the longest opcode
18522 …- JSC part of fix for "SVG multichar glyph matching matches longest instead of first (affects Acid…
28546 the longest collision chain is not any longer.
|
| /external/bison/doc/ |
| D | bison.texi | 7274 To prefer the longest @code{words}, the conflict between the token
|