HomeSort by: relevance | last modified time | path
    Searched defs:num_sorted (Results 1 - 4 of 4) sorted by relevancy

  /src/external/gpl3/gcc/dist/gcc/
tree-ssa-coalesce.cc 137 int num_sorted; /* Number in the sorted list. */ member in struct:coalesce_list
247 if (cl->num_sorted == 0)
250 node = cl->sorted[--(cl->num_sorted)];
273 list->num_sorted = 0;
289 gcc_assert (cl->num_sorted == 0);
464 cl->num_sorted = num;
520 for (x = cl->num_sorted - 1 ; x >=0; x--)
tree-ssa-coalesce.cc 137 int num_sorted; /* Number in the sorted list. */ member in struct:coalesce_list
247 if (cl->num_sorted == 0)
250 node = cl->sorted[--(cl->num_sorted)];
273 list->num_sorted = 0;
289 gcc_assert (cl->num_sorted == 0);
464 cl->num_sorted = num;
520 for (x = cl->num_sorted - 1 ; x >=0; x--)
  /src/external/gpl3/gcc.old/dist/gcc/
tree-ssa-coalesce.cc 136 int num_sorted; /* Number in the sorted list. */ member in struct:coalesce_list
246 if (cl->num_sorted == 0)
249 node = cl->sorted[--(cl->num_sorted)];
272 list->num_sorted = 0;
288 gcc_assert (cl->num_sorted == 0);
463 cl->num_sorted = num;
519 for (x = cl->num_sorted - 1 ; x >=0; x--)
tree-ssa-coalesce.cc 136 int num_sorted; /* Number in the sorted list. */ member in struct:coalesce_list
246 if (cl->num_sorted == 0)
249 node = cl->sorted[--(cl->num_sorted)];
272 list->num_sorted = 0;
288 gcc_assert (cl->num_sorted == 0);
463 cl->num_sorted = num;
519 for (x = cl->num_sorted - 1 ; x >=0; x--)

Completed in 161 milliseconds