/external/linux-tools-perf/perf-3.12.0/tools/perf/util/ |
help.c | 74 static void pretty_print_string_list(struct cmdnames *cmds, int longest) 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);
|
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/ |
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))
|
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 is true) and also to tel [all...] |
/external/chromium_org/third_party/re2/re2/testing/ |
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))
|
exhaustive_tester.cc | 103 RE2::Options longest; local 104 longest.set_longest_match(true); 105 RE2 relongest(regexp, longest);
|
/external/regex-re2/re2/ |
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))
|
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 is true) and also to tel [all...] |
/external/regex-re2/re2/testing/ |
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))
|
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/ |
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/ |
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/ |
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/ |
blocksplitter.c | 202 size_t longest = 0; local 208 if (!done[start] && end - start > longest) { 212 longest = end - start;
|
/developers/build/prebuilts/gradle/DisplayingBitmaps/Application/src/main/java/com/example/android/displayingbitmaps/ui/ |
ImageDetailActivity.java | 68 // For this sample we'll use half of the longest width to resize our images. As the 73 final int longest = (height > width ? height : width) / 2; local 80 mImageFetcher = new ImageFetcher(this, longest);
|
/developers/samples/android/ui/graphics/DisplayingBitmaps/Application/src/main/java/com/example/android/displayingbitmaps/ui/ |
ImageDetailActivity.java | 68 // For this sample we'll use half of the longest width to resize our images. As the 73 final int longest = (height > width ? height : width) / 2; local 80 mImageFetcher = new ImageFetcher(this, longest);
|
/development/samples/browseable/DisplayingBitmaps/src/com.example.android.displayingbitmaps/ui/ |
ImageDetailActivity.java | 68 // For this sample we'll use half of the longest width to resize our images. As the 73 final int longest = (height > width ? height : width) / 2; local 80 mImageFetcher = new ImageFetcher(this, longest);
|
/external/chromium_org/chrome/common/extensions/docs/server2/ |
content_providers.py | 89 where content_provider is the ContentProvider with the longest "serveFrom"
|
/external/chromium_org/third_party/icu/source/tools/tzcode/ |
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/ |
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);
|
/prebuilts/python/darwin-x86/2.7.5/lib/python2.7/ |
trace.py | 198 # looking in sys.path for the longest matching prefix. We'll 202 longest = "" 206 if len(dir) > len(longest): 207 longest = dir 209 if longest: 210 base = path[len(longest) + 1:]
|
/prebuilts/python/linux-x86/2.7.5/lib/python2.7/ |
trace.py | 198 # looking in sys.path for the longest matching prefix. We'll 202 longest = "" 206 if len(dir) > len(longest): 207 longest = dir 209 if longest: 210 base = path[len(longest) + 1:]
|
/external/chromium_org/third_party/skia/src/pathops/ |
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; [all...] |
/external/skia/src/pathops/ |
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; [all...] |
/external/chromium_org/chrome/browser/resources/chromeos/chromevox/host/chrome/ |
braille_input_handler.js | 506 * Returns the length of the longest common prefix of two strings. 509 * @return {number} The longest common prefix, which may be 0 for an
|