Home
last modified time | relevance | path

Searched refs:min_gallop (Results 1 – 5 of 5) sorted by relevance

/external/python/cpython2/Objects/
Dlistobject.c1372 Py_ssize_t min_gallop; member
1405 ms->min_gallop = MIN_GALLOP; in merge_init()
1465 Py_ssize_t min_gallop; in merge_lo() local
1481 min_gallop = ms->min_gallop; in merge_lo()
1502 if (bcount >= min_gallop) in merge_lo()
1512 if (acount >= min_gallop) in merge_lo()
1522 ++min_gallop; in merge_lo()
1525 min_gallop -= min_gallop > 1; in merge_lo()
1526 ms->min_gallop = min_gallop; in merge_lo()
1567 ++min_gallop; /* penalize it for leaving galloping mode */ in merge_lo()
[all …]
Dlistsort.txt445 A refinement: The MergeState struct contains the value of min_gallop that
560 "should be" then. So the MergeState struct keeps a min_gallop variable
562 the smaller min_gallop gets, making it easier to transition back to
565 min_gallop is increased by one, making it harder to transition back
567 random data, this all but eliminates the gallop penalty: min_gallop grows
569 like ~sort, min_gallop can fall to as low as 1. This seems to work well,
/external/python/cpython3/Objects/
Dlistobject.c1128 Py_ssize_t min_gallop; member
1501 ms->min_gallop = MIN_GALLOP; in merge_init()
1565 Py_ssize_t min_gallop; in merge_lo() local
1582 min_gallop = ms->min_gallop; in merge_lo()
1602 if (bcount >= min_gallop) in merge_lo()
1612 if (acount >= min_gallop) in merge_lo()
1622 ++min_gallop; in merge_lo()
1625 min_gallop -= min_gallop > 1; in merge_lo()
1626 ms->min_gallop = min_gallop; in merge_lo()
1667 ++min_gallop; /* penalize it for leaving galloping mode */ in merge_lo()
[all …]
Dlistsort.txt445 A refinement: The MergeState struct contains the value of min_gallop that
560 "should be" then. So the MergeState struct keeps a min_gallop variable
562 the smaller min_gallop gets, making it easier to transition back to
565 min_gallop is increased by one, making it harder to transition back
567 random data, this all but eliminates the gallop penalty: min_gallop grows
569 like ~sort, min_gallop can fall to as low as 1. This seems to work well,
/external/v8/third_party/v8/builtins/
Darray-sort.tq1204 let min_gallop: Smi = unsafe_cast<Smi>(sortState[kMinGallopIdx]);
1238 if (nof_wins_b >= min_gallop) break;
1252 if (nof_wins_a >= min_gallop) break;
1259 ++min_gallop;
1266 min_gallop = SmiMax(1, min_gallop - 1);
1267 sortState[kMinGallopIdx] = min_gallop;
1320 ++min_gallop; // Penalize it for leaving galloping mode
1321 sortState[kMinGallopIdx] = min_gallop;
1380 let min_gallop: Smi = unsafe_cast<Smi>(sortState[kMinGallopIdx]);
1414 if (nof_wins_a >= min_gallop) break;
[all …]