Searched refs:sorted (Results 1 - 25 of 42) sorted by relevance

12

/haiku-buildtools/gcc/gcc/testsuite/gfortran.dg/
H A Dallocatable_function_4.f9010 function unique_A (x, sorted) result (x_unique)
13 logical, intent(in), optional :: sorted local in function:unique_A
25 if(PRESENT(sorted)) then
26 sorted_ = sorted
H A Dwhole_file_27.f9043 logical, private :: triangle, unitd, upper, sorted component in type:base_sparse_mat
/haiku-buildtools/gcc/libstdc++-v3/testsuite/23_containers/forward_list/operations/
H A D6.cc55 std::forward_list<int> sorted(order[0], order[0] + n);
63 VERIFY(head == sorted);
/haiku-buildtools/gcc/libgomp/testsuite/libgomp.c/
H A Dsort-1.c39 printf ("%s: incorrectly sorted\n", name);
338 int *unsorted, *sorted, num_threads; local
343 sorted = malloc (count * sizeof (int));
344 if (unsorted == NULL || sorted == NULL)
361 memcpy (sorted, unsorted, count * sizeof (int));
363 sort1 (sorted, count);
364 verify ("sort1", stime, sorted, count);
366 memcpy (sorted, unsorted, count * sizeof (int));
368 sort2 (sorted, count);
369 verify ("sort2", stime, sorted, coun
[all...]
/haiku-buildtools/gcc/gcc/
H A Dtree-ssa-coalesce.c127 coalesce_pair_p *sorted; /* List when sorted. */ member in struct:coalesce_list_d
128 int num_sorted; /* Number in the sorted list. */
235 if (cl->sorted == NULL)
241 node = cl->sorted[--(cl->num_sorted)];
264 list->sorted = NULL;
279 free (cl->sorted);
316 gcc_assert (cl->sorted == NULL);
346 gcc_assert (cl->sorted == NULL);
402 /* Prepare CL for removal of preferred pairs. When finished they are sorted
[all...]
H A Dgdbhooks.py576 for name in sorted(self.pass_names.names)
/haiku-buildtools/gcc/contrib/
H A Djit-coverage-report.py52 for sym in sorted(api_syms):
H A Ddg-extract-results.py494 for harness in sorted (variation.harnesses.values(),
504 for key in sorted (harness.segments.keys()):
553 self.variations = sorted (self.known_variations)
559 self.tools = sorted (self.runs.keys())
/haiku-buildtools/binutils/ld/
H A Dldgram.y452 $$.sorted = none;
459 $$.sorted = none;
466 $$.sorted = by_name;
473 $$.sorted = by_alignment;
480 $$.sorted = by_none;
487 $$.sorted = by_name_alignment;
494 $$.sorted = by_name;
501 $$.sorted = by_alignment_name;
508 $$.sorted = by_alignment;
515 $$.sorted
[all...]
H A Dmri.c218 tmp->spec.sorted = none;
230 tmp->spec.sorted = none;
H A Dld.h99 sort_type sorted; member in struct:wildcard_spec
H A Dldlang.c495 && (sec == NULL || sec->spec.sorted == none))
506 if (compare_section (sec->spec.sorted, section, (*tree)->section) < 0)
544 /* Convert a sorted sections' BST back to list form. */
2501 && (sec == NULL || sec->spec.sorted == none))
2522 dlltool assumes that files will be sorted by the name of
2570 /* Here either the files are not sorted by name, or we are
2574 && sec->spec.sorted != none
2575 && sec->spec.sorted != by_none)
2576 if (compare_section (sec->spec.sorted, section, ls->section) < 0)
2921 && s->handler_data[0]->spec.sorted
[all...]
/haiku-buildtools/gcc/libgcc/
H A Dunwind-dw2-fde.h53 unsigned long sorted : 1; member in struct:object::__anon2138::__anon2139
H A Dunwind-dw2-fde.c42 its pc_begin and count fields initialized at minimum, and is sorted
194 if ((*p)->s.b.sorted)
544 /* Merge V1 and V2, both sorted, and put the result into V1. */
725 /* Set up a sorted array of pointers to FDEs for a loaded object. We
728 allocate a sorted fde array on a previous occasion. */
793 ob->s.b.sorted = 1;
960 /* If the data hasn't been sorted, try to do this now. We may have
962 if (! ob->s.b.sorted)
973 if (ob->s.b.sorted)
1011 containing the pc. Note that pc_begin is sorted descendin
[all...]
/haiku-buildtools/legacy/binutils/ld/
H A Dldgram.y427 $$.sorted = none;
433 $$.sorted = none;
439 $$.sorted = by_name;
445 $$.sorted = by_alignment;
451 $$.sorted = by_name_alignment;
457 $$.sorted = by_name;
463 $$.sorted = by_alignment_name;
469 $$.sorted = by_alignment;
475 $$.sorted = by_name;
526 tmp.sorted
[all...]
H A Dld.h115 sort_type sorted; member in struct:wildcard_spec
H A Dmri.c216 tmp->spec.sorted = none;
227 tmp->spec.sorted = none;
H A Dldlang.c2056 && (sec == NULL || sec->spec.sorted == none))
2078 dlltool assumes that files will be sorted by the name of
2126 /* Here either the files are not sorted by name, or we are
2129 if (sec != NULL && sec->spec.sorted != none)
2130 if (compare_section (sec->spec.sorted, section, ls->section) < 0)
3068 switch (sec->spec.sorted)
3071 sec->spec.sorted = sort_section;
3075 sec->spec.sorted = by_name_alignment;
3079 sec->spec.sorted = by_alignment_name;
3743 if (sec->spec.sorted)
[all...]
/haiku-buildtools/legacy/binutils/gprof/
H A Dcg_print.c310 Arc *arc, *detached, sorted, *prev;
313 sorted's parents.
315 *detached the rest of the arcs to be sorted.
316 sorted arc list onto which you insertion sort.
318 sorted.next_parent = 0;
324 /* Consider *arc as disconnected; insert it into sorted. */
325 for (prev = &sorted; prev->next_parent; prev = prev->next_parent)
335 /* Reattach sorted arcs to child. */
336 child->cg.parents = sorted.next_parent;
397 Arc *arc, *detached, sorted, *pre
309 Arc *arc, *detached, sorted, *prev; local
396 Arc *arc, *detached, sorted, *prev; local
[all...]
/haiku-buildtools/binutils/gold/
H A Dmerge.h129 // Whether the ENTRIES field is sorted by input_offset.
130 bool sorted; member in struct:gold::Object_merge_map::Input_merge_map
133 : output_data(NULL), entries(), sorted(true)
H A Dmerge.cc116 this->sorted = false;
146 if (!map->sorted)
150 map->sorted = true;
/haiku-buildtools/binutils/gprof/
H A Dcg_print.c314 Arc *arc, *detached, sorted, *prev;
317 sorted's parents.
319 *detached the rest of the arcs to be sorted.
320 sorted arc list onto which you insertion sort.
322 sorted.next_parent = 0;
328 /* Consider *arc as disconnected; insert it into sorted. */
329 for (prev = &sorted; prev->next_parent; prev = prev->next_parent)
339 /* Reattach sorted arcs to child. */
340 child->cg.parents = sorted.next_parent;
401 Arc *arc, *detached, sorted, *pre
313 Arc *arc, *detached, sorted, *prev; local
400 Arc *arc, *detached, sorted, *prev; local
[all...]
/haiku-buildtools/gcc/contrib/testsuite-management/
H A Dvalidate_failures.py116 It is used to keep results for one .exp file sorted
279 # .exp file are kept sorted.
397 for result in sorted(summary):
459 for result in sorted(actual):
482 # Keep the following list sorted by option name.
/haiku-buildtools/legacy/gcc/gcc/cp/
H A Dlex.c990 unsigned *sorted; local
997 sorted = (unsigned *) alloca (sizeof (int) * maxlen);
1000 sorted[i] = i;
1001 qsort (sorted, TOKEN_LENGTH, sizeof (int), token_cmp);
1004 int idx = sorted[i];
1014 sorted[i] = i;
1015 qsort (sorted, REDUCE_LENGTH, sizeof (int), reduce_cmp);
1018 int idx = sorted[i];
/haiku-buildtools/isl/
H A Disl_schedule.c149 * sorted contains a list of node indices sorted according to the
183 int *sorted; member in struct:isl_sched_graph
427 graph->sorted = isl_calloc_array(ctx, int, graph->n);
436 !graph->sorted)
440 graph->sorted[i] = i;
465 free(graph->sorted);
700 /* Sort the elements of graph->sorted according to the corresponding SCCs.
704 return isl_sort(graph->sorted, graph->n, sizeof(int), &cmp_scc, graph);
1335 struct isl_sched_node *node = &graph->node[graph->sorted[
[all...]

Completed in 484 milliseconds

12