/external/linux-tools-perf/perf-3.12.0/tools/perf/util/ |
H A D | help.c | 74 static void pretty_print_string_list(struct cmdnames *cmds, int longest) argument 77 int space = longest + 1; /* min 1 SP between words */ 196 unsigned int i, longest = 0; local 199 if (longest < main_cmds->names[i]->len) 200 longest = main_cmds->names[i]->len; 202 if (longest < other_cmds->names[i]->len) 203 longest = other_cmds->names[i]->len; 211 pretty_print_string_list(main_cmds, longest); 220 pretty_print_string_list(other_cmds, longest);
|
H A D | parse-events.c | 300 int n, longest = -1; local 305 if (n > longest && !strncasecmp(str, names[i][j], n)) 306 longest = n; 308 if (longest > 0)
|
/external/chromium_org/third_party/re2/re2/ |
H A D | bitstate.cc | 39 bool anchored, bool longest, 53 bool longest_; // whether search wants leftmost-longest match 294 bool anchored, bool longest, 306 longest_ = longest || prog_->anchor_end(); 355 // If full match, we ask for an anchored longest match 370 bool longest = kind != kFirstMatch; local 371 if (!b.Search(text, context, anchored, longest, match, nmatch)) 293 Search(const StringPiece& text, const StringPiece& context, bool anchored, bool longest, StringPiece* submatch, int nsubmatch) argument
|
H A D | nfa.cc | 42 // * If longest is true, returns the longest match starting 51 bool anchored, bool longest, 112 bool longest_; // whether searching for longest match 346 // Leftmost-longest mode: save this match only if 401 bool anchored, bool longest, 425 longest = true; 437 longest_ = longest; 441 // longest match (if longest i 400 Search(const StringPiece& text, const StringPiece& const_context, bool anchored, bool longest, StringPiece* submatch, int nsubmatch) argument [all...] |
/external/chromium_org/third_party/re2/re2/testing/ |
H A D | backtrack.cc | 54 bool anchored, bool longest, 67 bool longest_; // whether search wants leftmost-longest match 95 bool anchored, bool longest, 106 longest_ = longest | prog_->anchor_end(); 231 // If full match, we ask for an anchored longest match 246 bool longest = kind != kFirstMatch; local 247 if (!b.Search(text, context, anchored, longest, match, nmatch)) 94 Search(const StringPiece& text, const StringPiece& context, bool anchored, bool longest, StringPiece* submatch, int nsubmatch) argument
|
H A D | exhaustive_tester.cc | 103 RE2::Options longest; local 104 longest.set_longest_match(true); 105 RE2 relongest(regexp, longest);
|
/external/regex-re2/re2/ |
H A D | bitstate.cc | 39 bool anchored, bool longest, 53 bool longest_; // whether search wants leftmost-longest match 294 bool anchored, bool longest, 306 longest_ = longest || prog_->anchor_end(); 355 // If full match, we ask for an anchored longest match 370 bool longest = kind != kFirstMatch; local 371 if (!b.Search(text, context, anchored, longest, match, nmatch)) 293 Search(const StringPiece& text, const StringPiece& context, bool anchored, bool longest, StringPiece* submatch, int nsubmatch) argument
|
H A D | nfa.cc | 42 // * If longest is true, returns the longest match starting 51 bool anchored, bool longest, 112 bool longest_; // whether searching for longest match 346 // Leftmost-longest mode: save this match only if 401 bool anchored, bool longest, 425 longest = true; 437 longest_ = longest; 441 // longest match (if longest i 400 Search(const StringPiece& text, const StringPiece& const_context, bool anchored, bool longest, StringPiece* submatch, int nsubmatch) argument [all...] |
/external/regex-re2/re2/testing/ |
H A D | backtrack.cc | 54 bool anchored, bool longest, 67 bool longest_; // whether search wants leftmost-longest match 95 bool anchored, bool longest, 106 longest_ = longest | prog_->anchor_end(); 231 // If full match, we ask for an anchored longest match 246 bool longest = kind != kFirstMatch; local 247 if (!b.Search(text, context, anchored, longest, match, nmatch)) 94 Search(const StringPiece& text, const StringPiece& context, bool anchored, bool longest, StringPiece* submatch, int nsubmatch) argument
|
H A D | exhaustive_tester.cc | 103 RE2::Options longest; local 104 longest.set_longest_match(true); 105 RE2 relongest(regexp, longest);
|
/external/chromium_org/third_party/mesa/src/src/mesa/main/ |
H A D | shader_query.cpp | 220 size_t longest = 0; local 231 if (len >= longest) 232 longest = len + 1; 235 return longest;
|
/external/mesa3d/src/mesa/main/ |
H A D | shader_query.cpp | 220 size_t longest = 0; local 231 if (len >= longest) 232 longest = len + 1; 235 return longest;
|
/external/linux-tools-perf/perf-3.12.0/tools/perf/ |
H A D | builtin-help.c | 270 unsigned int i, longest = 0; local 273 if (longest < strlen(common_cmds[i].name)) 274 longest = strlen(common_cmds[i].name); 279 printf(" %-*s ", longest, common_cmds[i].name);
|
/external/zopfli/src/zopfli/ |
H A D | blocksplitter.c | 202 size_t longest = 0; local 208 if (!done[start] && end - start > longest) { 212 longest = end - start;
|
/external/chromium_org/third_party/icu/source/tools/tzcode/ |
H A 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);
|
/external/icu/icu4c/source/tools/tzcode/ |
H A 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);
|
/external/chromium_org/third_party/skia/src/pathops/ |
H A D | SkOpAngle.cpp | 377 // OPTIMIZATION: longest can all be either lazily computed here or precomputed in setup 379 double longest = 0; local 391 longest = SkTMax(longest, lenSq); 394 return sqrt(longest) / dist;
|
/external/skia/src/pathops/ |
H A D | SkOpAngle.cpp | 380 // OPTIMIZATION: longest can all be either lazily computed here or precomputed in setup 382 double longest = 0; local 394 longest = SkTMax(longest, lenSq); 397 return sqrt(longest) / dist;
|
/external/chromium_org/third_party/skia/tests/ |
H A D | PathOpsAngleIdeas.cpp | 123 double longest = SkTMax(v[0].length(), SkTMax(v[1].length(), v[2].length())); local 124 return longest / dist;
|
/external/skia/tests/ |
H A D | PathOpsAngleIdeas.cpp | 123 double longest = SkTMax(v[0].length(), SkTMax(v[1].length(), v[2].length())); local 124 return longest / dist;
|
/external/iproute2/doc/ |
H A 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.
|