Home
last modified time | relevance | path

Searched refs:saved_ob_size (Results 1 – 2 of 2) sorted by relevance

/external/python/cpython3/Objects/
Dlistobject.c2159 Py_ssize_t saved_ob_size, saved_allocated; in list_sort_impl() local
2176 saved_ob_size = Py_SIZE(self); in list_sort_impl()
2189 if (saved_ob_size < MERGESTATE_TEMP_SIZE/2) in list_sort_impl()
2191 keys = &ms.temparray[saved_ob_size+1]; in list_sort_impl()
2193 keys = PyMem_MALLOC(sizeof(PyObject *) * saved_ob_size); in list_sort_impl()
2200 for (i = 0; i < saved_ob_size ; i++) { in list_sort_impl()
2206 if (saved_ob_size >= MERGESTATE_TEMP_SIZE/2) in list_sort_impl()
2221 if (saved_ob_size > 1) { in list_sort_impl()
2235 for (i=0; i < saved_ob_size; i++) { in list_sort_impl()
2303 merge_init(&ms, saved_ob_size, keys != NULL); in list_sort_impl()
[all …]
/external/python/cpython2/Objects/
Dlistobject.c2050 Py_ssize_t saved_ob_size, saved_allocated; in listsort() local
2087 saved_ob_size = Py_SIZE(self); in listsort()
2095 for (i=0 ; i < saved_ob_size ; i++) { in listsort()
2117 if (reverse && saved_ob_size > 1) in listsort()
2118 reverse_slice(saved_ob_item, saved_ob_item + saved_ob_size); in listsort()
2122 nremaining = saved_ob_size; in listsort()
2167 assert(ms.pending[0].len == saved_ob_size); in listsort()
2173 for (i=0 ; i < saved_ob_size ; i++) { in listsort()
2189 if (reverse && saved_ob_size > 1) in listsort()
2190 reverse_slice(saved_ob_item, saved_ob_item + saved_ob_size); in listsort()
[all …]