/external/oprofile/libpp/ |
symbol_sort.h | 21 enum sort_order { enum in struct:sort_options 36 void add_sort_option(sort_order order); 50 std::vector<sort_order> options;
|
symbol_sort.cpp | 43 int compare_by(sort_options::sort_order order, 95 symbol_compare(vector<sort_options::sort_order> const & order, 108 vector<sort_options::sort_order> const & compare_order; 136 vector<sort_order> sort_option(options); 137 for (sort_order cur = first; cur != last; cur = sort_order(cur + 1)) { 153 vector<sort_order> sort_option(options); 154 for (sort_order cur = first; cur != last; cur = sort_order(cur + 1)) { 187 void sort_options::add_sort_option(sort_options::sort_order order [all...] |
/external/chromium_org/chrome/browser/history/ |
history_backend_android.cc | 29 const std::string& sort_order) { 36 projections, selection, selection_args, sort_order); 171 const std::string& sort_order) { 178 selection, selection_args, sort_order);
|
history_backend.h | 338 const std::string& sort_order); 382 const std::string& sort_order); [all...] |
/external/valgrind/main/cachegrind/ |
cg_annotate.in | 74 # but we have to use @sort_order and @show_order below to handle the --sort and 116 my @sort_order; 372 push(@sort_order, $events{$sort_event}); 379 foreach my $e (@sort_order) { 496 foreach my $i (@sort_order) { 606 (scalar @sort_order == scalar @thresholds) or 607 die("sort_order length != thresholds length:\n", 608 " @sort_order\n @thresholds\n"); 611 # @curr_totals has the same shape as @sort_order and @thresholds 625 my $prop = safe_div(abs($fn_CC->[$sort_order[$i]] * 100) [all...] |
/external/chromium_org/chrome/browser/history/android/ |
android_history_provider_service.h | 68 // |sort_order| is the SQL ORDER clause. 73 const std::string& sort_order, 165 // |sort_order| the SQL ORDER clause. 170 const std::string& sort_order,
|
android_history_provider_service.cc | 26 const std::string& sort_order, 36 projections, selection, selection_args, sort_order); 219 const std::string& sort_order, 229 selection, selection_args, sort_order);
|
android_provider_backend.h | 64 // |sort_order| is the SQL ORDER clause. 69 const std::string& sort_order); 112 // |sort_order| the SQL ORDER clause. 117 const std::string& sort_order); 306 const std::string& sort_order);
|
android_provider_backend.cc | 141 const std::string& sort_order) { 153 selection_args, sort_order); 498 const std::string& sort_order) { 515 if (!sort_order.empty()) { 517 sql.append(sort_order); [all...] |
/external/valgrind/main/callgrind/ |
callgrind_annotate.in | 77 # but we have to use @sort_order and @show_order below to handle the --sort and 131 my @sort_order; 484 push(@sort_order, $events{$sort_event}); 491 foreach my $e (@sort_order) { 764 foreach my $i (@sort_order) { 874 (scalar @sort_order == scalar @thresholds) or 875 die("sort_order length != thresholds length:\n", 876 " @sort_order\n @thresholds\n"); 879 # @curr_totals has the same shape as @sort_order and @thresholds 892 if ($summary_CC->[$sort_order[$i]] >0) [all...] |
/external/chromium_org/chrome/browser/android/provider/ |
chrome_browser_provider.h | 85 jstring sort_order); 121 jstring sort_order);
|
chrome_browser_provider.cc | 756 const std::string& sort_order) { 760 selection_args, sort_order, cancelable_consumer(), [all...] |
/external/linux-tools-perf/util/ |
sort.h | 36 extern const char *sort_order;
|
sort.c | 8 const char *sort_order = default_sort_order; variable 323 char *tmp, *tok, *str = strdup(sort_order);
|
/external/linux-tools-perf/ |
builtin-diff.c | 193 OPT_STRING('s', "sort", &sort_order, "key[,key2...]", 205 sort_order = diff__default_sort_order;
|
builtin-report.c | 242 if (sort_order == default_sort_order && 439 OPT_STRING('s', "sort", &sort_order, "key[,key2...]",
|
builtin-sched.c | 35 static const char *sort_order = default_sort_order; variable [all...] |