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

  /src/external/gpl3/gcc/dist/gcc/
gcse.cc 1810 routine examines the set of insertions and deletions and if the ratio
1811 of insertions to deletions is too high for a particular expression, then
1828 int *deletions = GCNEWVEC (int, n_elems);
1831 the number of deletions achieved. We will prune these out of the
1844 /* Similarly for deletions, but those occur in blocks rather than on
1849 deletions[j]++;
1857 if (deletions[j]
1858 && (insertions[j] / deletions[j]) > param_max_gcse_insertion_ratio)
1872 free (deletions);
1817 int *deletions = GCNEWVEC (int, n_elems); local
  /src/external/gpl3/gcc.old/dist/gcc/
gcse.cc 1809 routine examines the set of insertions and deletions and if the ratio
1810 of insertions to deletions is too high for a particular expression, then
1827 int *deletions = GCNEWVEC (int, n_elems);
1830 the number of deletions achieved. We will prune these out of the
1843 /* Similarly for deletions, but those occur in blocks rather than on
1848 deletions[j]++;
1856 if (deletions[j]
1857 && (insertions[j] / deletions[j]) > param_max_gcse_insertion_ratio)
1871 free (deletions);
1816 int *deletions = GCNEWVEC (int, n_elems); local
  /src/external/mpl/dhcp/bind/dist/lib/dns/
rbtdb.c 748 dns_rbtnode_t *deletions[DELETION_BATCH_MAX]; member in struct:rbtdb_dbiterator
5828 memset(rbtdbiter->deletions, 0, sizeof(rbtdbiter->deletions));
9480 * That some nodes appear on the deletions list more than
9497 node = rbtdbiter->deletions[i];
9903 rbtdbiter->deletions[rbtdbiter->delcnt++] = node;

Completed in 32 milliseconds