| /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/chromium_org/third_party/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/chromium_org/third_party/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/chromium_org/third_party/re2/patches/ |
| D | rename-posix-option.patch | 24 - POSIX, // POSIX syntax, leftmost-longest match
25 + POSIX_SYNTAX, // POSIX syntax, leftmost-longest match
|
| /external/mesa3d/src/mesa/main/ |
| D | shader_query.cpp | 220 size_t longest = 0; in _mesa_longest_attribute_name_length() local
231 if (len >= longest) in _mesa_longest_attribute_name_length()
232 longest = len + 1; in _mesa_longest_attribute_name_length()
235 return longest; in _mesa_longest_attribute_name_length()
|
| /external/chromium_org/third_party/mesa/src/src/mesa/main/ |
| D | shader_query.cpp | 220 size_t longest = 0; in _mesa_longest_attribute_name_length() local
231 if (len >= longest) in _mesa_longest_attribute_name_length()
232 longest = len + 1; in _mesa_longest_attribute_name_length()
235 return longest; in _mesa_longest_attribute_name_length()
|
| /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()
|
| /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
|
| /external/sepolicy/ |
| D | genfs_contexts | 3 # proc labeling can be further refined (longest matching prefix).
|
| /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/chromium_org/third_party/icu/source/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/chromium/chrome/common/extensions/docs/server/ |
| D | README | 40 view and delete the version which was deployed the longest time ago. Then
|
| /external/chromium_org/chrome/common/extensions/docs/server2/ |
| D | README | 49 view and delete the version which was deployed the longest time ago. Then
|
| /external/chromium_org/chrome/browser/resources/options/chromeos/ |
| D | bluetooth.css | 72 generously to accomodate the longest of the messages. */
|
| /external/chromium_org/chrome/browser/ui/cocoa/autofill/ |
| D | autofill_suggestion_container.mm | 51 // the longest descender, not the font baseline
|
| /external/chromium_org/third_party/zlib/ |
| D | mixed-source.patch | 151 * Set match_start to the longest match starting at the given string and
|
| /external/chromium_org/chrome/browser/ui/cocoa/content_settings/ |
| D | content_setting_bubble_cocoa.mm | 493 // Calculate the longest width of the labels and menus menus to avoid
|
| /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
1957 according to the longest match rule, is replaced with a ``routing policy
1991 a route from these tables according to the classic longest match algorithm.
|