Guido van Rossum | 85a5fbb | 1990-10-14 12:07:46 +0000 | [diff] [blame] | 1 | /* List object implementation */ |
| 2 | |
Guido van Rossum | c0b618a | 1997-05-02 03:12:38 +0000 | [diff] [blame] | 3 | #include "Python.h" |
Eric Snow | 2ebc5ce | 2017-09-07 23:51:28 -0600 | [diff] [blame] | 4 | #include "internal/pystate.h" |
Antoine Pitrou | 0197ff9 | 2012-03-22 14:38:16 +0100 | [diff] [blame] | 5 | #include "accu.h" |
Guido van Rossum | c0b618a | 1997-05-02 03:12:38 +0000 | [diff] [blame] | 6 | |
Guido van Rossum | 6cd2fe0 | 1994-08-29 12:45:32 +0000 | [diff] [blame] | 7 | #ifdef STDC_HEADERS |
| 8 | #include <stddef.h> |
| 9 | #else |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 10 | #include <sys/types.h> /* For size_t */ |
Guido van Rossum | 6cd2fe0 | 1994-08-29 12:45:32 +0000 | [diff] [blame] | 11 | #endif |
Guido van Rossum | 85a5fbb | 1990-10-14 12:07:46 +0000 | [diff] [blame] | 12 | |
Serhiy Storchaka | fdd42c4 | 2017-03-11 09:19:20 +0200 | [diff] [blame] | 13 | /*[clinic input] |
| 14 | class list "PyListObject *" "&PyList_Type" |
| 15 | [clinic start generated code]*/ |
| 16 | /*[clinic end generated code: output=da39a3ee5e6b4b0d input=f9b222678f9f71e0]*/ |
| 17 | |
| 18 | #include "clinic/listobject.c.h" |
| 19 | |
Tim Peters | 8d9eb10 | 2004-07-31 02:24:20 +0000 | [diff] [blame] | 20 | /* Ensure ob_item has room for at least newsize elements, and set |
| 21 | * ob_size to newsize. If newsize > ob_size on entry, the content |
| 22 | * of the new slots at exit is undefined heap trash; it's the caller's |
Ezio Melotti | 1392500 | 2011-03-16 11:05:33 +0200 | [diff] [blame] | 23 | * responsibility to overwrite them with sane values. |
Tim Peters | 8d9eb10 | 2004-07-31 02:24:20 +0000 | [diff] [blame] | 24 | * The number of allocated elements may grow, shrink, or stay the same. |
| 25 | * Failure is impossible if newsize <= self.allocated on entry, although |
| 26 | * that partly relies on an assumption that the system realloc() never |
| 27 | * fails when passed a number of bytes <= the number of bytes last |
| 28 | * allocated (the C standard doesn't guarantee this, but it's hard to |
| 29 | * imagine a realloc implementation where it wouldn't be true). |
| 30 | * Note that self->ob_item may change, and even if newsize is less |
| 31 | * than ob_size on entry. |
| 32 | */ |
Guido van Rossum | a46d51d | 1995-01-26 22:59:43 +0000 | [diff] [blame] | 33 | static int |
Martin v. Löwis | 18e1655 | 2006-02-15 17:27:45 +0000 | [diff] [blame] | 34 | list_resize(PyListObject *self, Py_ssize_t newsize) |
Guido van Rossum | a46d51d | 1995-01-26 22:59:43 +0000 | [diff] [blame] | 35 | { |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 36 | PyObject **items; |
Xiang Zhang | 4cee049 | 2017-02-22 12:32:30 +0800 | [diff] [blame] | 37 | size_t new_allocated, num_allocated_bytes; |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 38 | Py_ssize_t allocated = self->allocated; |
Tim Peters | 65b8b84 | 2001-05-26 05:28:40 +0000 | [diff] [blame] | 39 | |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 40 | /* Bypass realloc() when a previous overallocation is large enough |
| 41 | to accommodate the newsize. If the newsize falls lower than half |
| 42 | the allocated size, then proceed with the realloc() to shrink the list. |
| 43 | */ |
| 44 | if (allocated >= newsize && newsize >= (allocated >> 1)) { |
| 45 | assert(self->ob_item != NULL || newsize == 0); |
| 46 | Py_SIZE(self) = newsize; |
| 47 | return 0; |
| 48 | } |
Raymond Hettinger | 4bb9540 | 2004-02-13 11:36:39 +0000 | [diff] [blame] | 49 | |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 50 | /* This over-allocates proportional to the list size, making room |
| 51 | * for additional growth. The over-allocation is mild, but is |
| 52 | * enough to give linear-time amortized behavior over a long |
| 53 | * sequence of appends() in the presence of a poorly-performing |
| 54 | * system realloc(). |
| 55 | * The growth pattern is: 0, 4, 8, 16, 25, 35, 46, 58, 72, 88, ... |
Xiang Zhang | 4cee049 | 2017-02-22 12:32:30 +0800 | [diff] [blame] | 56 | * Note: new_allocated won't overflow because the largest possible value |
| 57 | * is PY_SSIZE_T_MAX * (9 / 8) + 6 which always fits in a size_t. |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 58 | */ |
Xiang Zhang | 4cee049 | 2017-02-22 12:32:30 +0800 | [diff] [blame] | 59 | new_allocated = (size_t)newsize + (newsize >> 3) + (newsize < 9 ? 3 : 6); |
| 60 | if (new_allocated > (size_t)PY_SSIZE_T_MAX / sizeof(PyObject *)) { |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 61 | PyErr_NoMemory(); |
| 62 | return -1; |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 63 | } |
Amaury Forgeot d'Arc | 9c74b14 | 2008-06-18 00:47:36 +0000 | [diff] [blame] | 64 | |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 65 | if (newsize == 0) |
| 66 | new_allocated = 0; |
Xiang Zhang | 4cee049 | 2017-02-22 12:32:30 +0800 | [diff] [blame] | 67 | num_allocated_bytes = new_allocated * sizeof(PyObject *); |
| 68 | items = (PyObject **)PyMem_Realloc(self->ob_item, num_allocated_bytes); |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 69 | if (items == NULL) { |
| 70 | PyErr_NoMemory(); |
| 71 | return -1; |
| 72 | } |
| 73 | self->ob_item = items; |
| 74 | Py_SIZE(self) = newsize; |
| 75 | self->allocated = new_allocated; |
| 76 | return 0; |
Raymond Hettinger | 4bb9540 | 2004-02-13 11:36:39 +0000 | [diff] [blame] | 77 | } |
Guido van Rossum | a46d51d | 1995-01-26 22:59:43 +0000 | [diff] [blame] | 78 | |
Christian Heimes | 77c02eb | 2008-02-09 02:18:51 +0000 | [diff] [blame] | 79 | /* Debug statistic to compare allocations with reuse through the free list */ |
| 80 | #undef SHOW_ALLOC_COUNT |
| 81 | #ifdef SHOW_ALLOC_COUNT |
| 82 | static size_t count_alloc = 0; |
| 83 | static size_t count_reuse = 0; |
| 84 | |
| 85 | static void |
| 86 | show_alloc(void) |
| 87 | { |
Victor Stinner | 25420fe | 2017-11-20 18:12:22 -0800 | [diff] [blame] | 88 | PyInterpreterState *interp = PyThreadState_GET()->interp; |
Eddie Elizondo | 745dc65 | 2018-02-21 20:55:18 -0800 | [diff] [blame] | 89 | if (!interp->core_config.show_alloc_count) { |
Serhiy Storchaka | 7e160ce | 2016-07-03 21:03:53 +0300 | [diff] [blame] | 90 | return; |
Victor Stinner | 25420fe | 2017-11-20 18:12:22 -0800 | [diff] [blame] | 91 | } |
Serhiy Storchaka | 7e160ce | 2016-07-03 21:03:53 +0300 | [diff] [blame] | 92 | |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 93 | fprintf(stderr, "List allocations: %" PY_FORMAT_SIZE_T "d\n", |
| 94 | count_alloc); |
| 95 | fprintf(stderr, "List reuse through freelist: %" PY_FORMAT_SIZE_T |
| 96 | "d\n", count_reuse); |
| 97 | fprintf(stderr, "%.2f%% reuse rate\n\n", |
| 98 | (100.0*count_reuse/(count_alloc+count_reuse))); |
Christian Heimes | 77c02eb | 2008-02-09 02:18:51 +0000 | [diff] [blame] | 99 | } |
| 100 | #endif |
| 101 | |
Raymond Hettinger | 0468e41 | 2004-05-05 05:37:53 +0000 | [diff] [blame] | 102 | /* Empty list reuse scheme to save calls to malloc and free */ |
Christian Heimes | 2202f87 | 2008-02-06 14:31:34 +0000 | [diff] [blame] | 103 | #ifndef PyList_MAXFREELIST |
| 104 | #define PyList_MAXFREELIST 80 |
| 105 | #endif |
| 106 | static PyListObject *free_list[PyList_MAXFREELIST]; |
| 107 | static int numfree = 0; |
Raymond Hettinger | 0468e41 | 2004-05-05 05:37:53 +0000 | [diff] [blame] | 108 | |
Antoine Pitrou | 9a812cb | 2011-11-15 00:00:12 +0100 | [diff] [blame] | 109 | int |
| 110 | PyList_ClearFreeList(void) |
Raymond Hettinger | fb09f0e | 2004-10-07 03:58:07 +0000 | [diff] [blame] | 111 | { |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 112 | PyListObject *op; |
Antoine Pitrou | 9a812cb | 2011-11-15 00:00:12 +0100 | [diff] [blame] | 113 | int ret = numfree; |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 114 | while (numfree) { |
| 115 | op = free_list[--numfree]; |
| 116 | assert(PyList_CheckExact(op)); |
| 117 | PyObject_GC_Del(op); |
| 118 | } |
Antoine Pitrou | 9a812cb | 2011-11-15 00:00:12 +0100 | [diff] [blame] | 119 | return ret; |
| 120 | } |
| 121 | |
| 122 | void |
| 123 | PyList_Fini(void) |
| 124 | { |
| 125 | PyList_ClearFreeList(); |
Raymond Hettinger | fb09f0e | 2004-10-07 03:58:07 +0000 | [diff] [blame] | 126 | } |
| 127 | |
David Malcolm | 49526f4 | 2012-06-22 14:55:41 -0400 | [diff] [blame] | 128 | /* Print summary info about the state of the optimized allocator */ |
| 129 | void |
| 130 | _PyList_DebugMallocStats(FILE *out) |
| 131 | { |
| 132 | _PyDebugAllocatorStats(out, |
| 133 | "free PyListObject", |
| 134 | numfree, sizeof(PyListObject)); |
| 135 | } |
| 136 | |
Guido van Rossum | c0b618a | 1997-05-02 03:12:38 +0000 | [diff] [blame] | 137 | PyObject * |
Martin v. Löwis | 18e1655 | 2006-02-15 17:27:45 +0000 | [diff] [blame] | 138 | PyList_New(Py_ssize_t size) |
Guido van Rossum | 85a5fbb | 1990-10-14 12:07:46 +0000 | [diff] [blame] | 139 | { |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 140 | PyListObject *op; |
Christian Heimes | 77c02eb | 2008-02-09 02:18:51 +0000 | [diff] [blame] | 141 | #ifdef SHOW_ALLOC_COUNT |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 142 | static int initialized = 0; |
| 143 | if (!initialized) { |
| 144 | Py_AtExit(show_alloc); |
| 145 | initialized = 1; |
| 146 | } |
Christian Heimes | 77c02eb | 2008-02-09 02:18:51 +0000 | [diff] [blame] | 147 | #endif |
Tim Peters | 3986d4e | 2004-07-29 02:28:42 +0000 | [diff] [blame] | 148 | |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 149 | if (size < 0) { |
| 150 | PyErr_BadInternalCall(); |
| 151 | return NULL; |
| 152 | } |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 153 | if (numfree) { |
| 154 | numfree--; |
| 155 | op = free_list[numfree]; |
| 156 | _Py_NewReference((PyObject *)op); |
Christian Heimes | 77c02eb | 2008-02-09 02:18:51 +0000 | [diff] [blame] | 157 | #ifdef SHOW_ALLOC_COUNT |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 158 | count_reuse++; |
Christian Heimes | 77c02eb | 2008-02-09 02:18:51 +0000 | [diff] [blame] | 159 | #endif |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 160 | } else { |
| 161 | op = PyObject_GC_New(PyListObject, &PyList_Type); |
| 162 | if (op == NULL) |
| 163 | return NULL; |
Christian Heimes | 77c02eb | 2008-02-09 02:18:51 +0000 | [diff] [blame] | 164 | #ifdef SHOW_ALLOC_COUNT |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 165 | count_alloc++; |
Christian Heimes | 77c02eb | 2008-02-09 02:18:51 +0000 | [diff] [blame] | 166 | #endif |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 167 | } |
| 168 | if (size <= 0) |
| 169 | op->ob_item = NULL; |
| 170 | else { |
Mark Dickinson | 5d13238 | 2016-08-21 08:55:15 +0100 | [diff] [blame] | 171 | op->ob_item = (PyObject **) PyMem_Calloc(size, sizeof(PyObject *)); |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 172 | if (op->ob_item == NULL) { |
| 173 | Py_DECREF(op); |
| 174 | return PyErr_NoMemory(); |
| 175 | } |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 176 | } |
| 177 | Py_SIZE(op) = size; |
| 178 | op->allocated = size; |
| 179 | _PyObject_GC_TRACK(op); |
| 180 | return (PyObject *) op; |
Guido van Rossum | 85a5fbb | 1990-10-14 12:07:46 +0000 | [diff] [blame] | 181 | } |
| 182 | |
Martin v. Löwis | 18e1655 | 2006-02-15 17:27:45 +0000 | [diff] [blame] | 183 | Py_ssize_t |
Fred Drake | a2f5511 | 2000-07-09 15:16:51 +0000 | [diff] [blame] | 184 | PyList_Size(PyObject *op) |
Guido van Rossum | 85a5fbb | 1990-10-14 12:07:46 +0000 | [diff] [blame] | 185 | { |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 186 | if (!PyList_Check(op)) { |
| 187 | PyErr_BadInternalCall(); |
| 188 | return -1; |
| 189 | } |
| 190 | else |
| 191 | return Py_SIZE(op); |
Guido van Rossum | 85a5fbb | 1990-10-14 12:07:46 +0000 | [diff] [blame] | 192 | } |
| 193 | |
Raymond Hettinger | fdfe618 | 2004-05-05 06:28:16 +0000 | [diff] [blame] | 194 | static PyObject *indexerr = NULL; |
Guido van Rossum | 929f1b8 | 1996-08-09 20:51:27 +0000 | [diff] [blame] | 195 | |
Guido van Rossum | c0b618a | 1997-05-02 03:12:38 +0000 | [diff] [blame] | 196 | PyObject * |
Martin v. Löwis | 18e1655 | 2006-02-15 17:27:45 +0000 | [diff] [blame] | 197 | PyList_GetItem(PyObject *op, Py_ssize_t i) |
Guido van Rossum | 85a5fbb | 1990-10-14 12:07:46 +0000 | [diff] [blame] | 198 | { |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 199 | if (!PyList_Check(op)) { |
| 200 | PyErr_BadInternalCall(); |
| 201 | return NULL; |
| 202 | } |
| 203 | if (i < 0 || i >= Py_SIZE(op)) { |
| 204 | if (indexerr == NULL) { |
| 205 | indexerr = PyUnicode_FromString( |
| 206 | "list index out of range"); |
| 207 | if (indexerr == NULL) |
| 208 | return NULL; |
| 209 | } |
| 210 | PyErr_SetObject(PyExc_IndexError, indexerr); |
| 211 | return NULL; |
| 212 | } |
| 213 | return ((PyListObject *)op) -> ob_item[i]; |
Guido van Rossum | 85a5fbb | 1990-10-14 12:07:46 +0000 | [diff] [blame] | 214 | } |
| 215 | |
| 216 | int |
Antoine Pitrou | 9ed5f27 | 2013-08-13 20:18:52 +0200 | [diff] [blame] | 217 | PyList_SetItem(PyObject *op, Py_ssize_t i, |
| 218 | PyObject *newitem) |
Guido van Rossum | 85a5fbb | 1990-10-14 12:07:46 +0000 | [diff] [blame] | 219 | { |
Antoine Pitrou | 9ed5f27 | 2013-08-13 20:18:52 +0200 | [diff] [blame] | 220 | PyObject **p; |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 221 | if (!PyList_Check(op)) { |
| 222 | Py_XDECREF(newitem); |
| 223 | PyErr_BadInternalCall(); |
| 224 | return -1; |
| 225 | } |
| 226 | if (i < 0 || i >= Py_SIZE(op)) { |
| 227 | Py_XDECREF(newitem); |
| 228 | PyErr_SetString(PyExc_IndexError, |
| 229 | "list assignment index out of range"); |
| 230 | return -1; |
| 231 | } |
| 232 | p = ((PyListObject *)op) -> ob_item + i; |
Serhiy Storchaka | ec39756 | 2016-04-06 09:50:03 +0300 | [diff] [blame] | 233 | Py_XSETREF(*p, newitem); |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 234 | return 0; |
Guido van Rossum | 85a5fbb | 1990-10-14 12:07:46 +0000 | [diff] [blame] | 235 | } |
| 236 | |
| 237 | static int |
Martin v. Löwis | 18e1655 | 2006-02-15 17:27:45 +0000 | [diff] [blame] | 238 | ins1(PyListObject *self, Py_ssize_t where, PyObject *v) |
Guido van Rossum | 85a5fbb | 1990-10-14 12:07:46 +0000 | [diff] [blame] | 239 | { |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 240 | Py_ssize_t i, n = Py_SIZE(self); |
| 241 | PyObject **items; |
| 242 | if (v == NULL) { |
| 243 | PyErr_BadInternalCall(); |
| 244 | return -1; |
| 245 | } |
| 246 | if (n == PY_SSIZE_T_MAX) { |
| 247 | PyErr_SetString(PyExc_OverflowError, |
| 248 | "cannot add more objects to list"); |
| 249 | return -1; |
| 250 | } |
Tim Peters | b38e2b6 | 2004-07-29 02:29:26 +0000 | [diff] [blame] | 251 | |
Raymond Hettinger | 0dceb91 | 2016-01-25 10:33:30 -0800 | [diff] [blame] | 252 | if (list_resize(self, n+1) < 0) |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 253 | return -1; |
Raymond Hettinger | 4bb9540 | 2004-02-13 11:36:39 +0000 | [diff] [blame] | 254 | |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 255 | if (where < 0) { |
| 256 | where += n; |
| 257 | if (where < 0) |
| 258 | where = 0; |
| 259 | } |
| 260 | if (where > n) |
| 261 | where = n; |
| 262 | items = self->ob_item; |
| 263 | for (i = n; --i >= where; ) |
| 264 | items[i+1] = items[i]; |
| 265 | Py_INCREF(v); |
| 266 | items[where] = v; |
| 267 | return 0; |
Guido van Rossum | 85a5fbb | 1990-10-14 12:07:46 +0000 | [diff] [blame] | 268 | } |
| 269 | |
| 270 | int |
Martin v. Löwis | 18e1655 | 2006-02-15 17:27:45 +0000 | [diff] [blame] | 271 | PyList_Insert(PyObject *op, Py_ssize_t where, PyObject *newitem) |
Guido van Rossum | 85a5fbb | 1990-10-14 12:07:46 +0000 | [diff] [blame] | 272 | { |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 273 | if (!PyList_Check(op)) { |
| 274 | PyErr_BadInternalCall(); |
| 275 | return -1; |
| 276 | } |
| 277 | return ins1((PyListObject *)op, where, newitem); |
Guido van Rossum | 85a5fbb | 1990-10-14 12:07:46 +0000 | [diff] [blame] | 278 | } |
| 279 | |
Raymond Hettinger | 40a0382 | 2004-04-12 13:05:09 +0000 | [diff] [blame] | 280 | static int |
| 281 | app1(PyListObject *self, PyObject *v) |
| 282 | { |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 283 | Py_ssize_t n = PyList_GET_SIZE(self); |
Raymond Hettinger | 40a0382 | 2004-04-12 13:05:09 +0000 | [diff] [blame] | 284 | |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 285 | assert (v != NULL); |
| 286 | if (n == PY_SSIZE_T_MAX) { |
| 287 | PyErr_SetString(PyExc_OverflowError, |
| 288 | "cannot add more objects to list"); |
| 289 | return -1; |
| 290 | } |
Raymond Hettinger | 40a0382 | 2004-04-12 13:05:09 +0000 | [diff] [blame] | 291 | |
Raymond Hettinger | 0dceb91 | 2016-01-25 10:33:30 -0800 | [diff] [blame] | 292 | if (list_resize(self, n+1) < 0) |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 293 | return -1; |
Raymond Hettinger | 40a0382 | 2004-04-12 13:05:09 +0000 | [diff] [blame] | 294 | |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 295 | Py_INCREF(v); |
| 296 | PyList_SET_ITEM(self, n, v); |
| 297 | return 0; |
Raymond Hettinger | 40a0382 | 2004-04-12 13:05:09 +0000 | [diff] [blame] | 298 | } |
| 299 | |
Guido van Rossum | 85a5fbb | 1990-10-14 12:07:46 +0000 | [diff] [blame] | 300 | int |
Fred Drake | a2f5511 | 2000-07-09 15:16:51 +0000 | [diff] [blame] | 301 | PyList_Append(PyObject *op, PyObject *newitem) |
Guido van Rossum | 85a5fbb | 1990-10-14 12:07:46 +0000 | [diff] [blame] | 302 | { |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 303 | if (PyList_Check(op) && (newitem != NULL)) |
| 304 | return app1((PyListObject *)op, newitem); |
| 305 | PyErr_BadInternalCall(); |
| 306 | return -1; |
Guido van Rossum | 85a5fbb | 1990-10-14 12:07:46 +0000 | [diff] [blame] | 307 | } |
| 308 | |
| 309 | /* Methods */ |
| 310 | |
| 311 | static void |
Fred Drake | a2f5511 | 2000-07-09 15:16:51 +0000 | [diff] [blame] | 312 | list_dealloc(PyListObject *op) |
Guido van Rossum | 85a5fbb | 1990-10-14 12:07:46 +0000 | [diff] [blame] | 313 | { |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 314 | Py_ssize_t i; |
| 315 | PyObject_GC_UnTrack(op); |
| 316 | Py_TRASHCAN_SAFE_BEGIN(op) |
| 317 | if (op->ob_item != NULL) { |
| 318 | /* Do it backwards, for Christian Tismer. |
| 319 | There's a simple test case where somehow this reduces |
| 320 | thrashing when a *very* large list is created and |
| 321 | immediately deleted. */ |
| 322 | i = Py_SIZE(op); |
| 323 | while (--i >= 0) { |
| 324 | Py_XDECREF(op->ob_item[i]); |
| 325 | } |
| 326 | PyMem_FREE(op->ob_item); |
| 327 | } |
| 328 | if (numfree < PyList_MAXFREELIST && PyList_CheckExact(op)) |
| 329 | free_list[numfree++] = op; |
| 330 | else |
| 331 | Py_TYPE(op)->tp_free((PyObject *)op); |
| 332 | Py_TRASHCAN_SAFE_END(op) |
Guido van Rossum | 85a5fbb | 1990-10-14 12:07:46 +0000 | [diff] [blame] | 333 | } |
| 334 | |
Guido van Rossum | c0b618a | 1997-05-02 03:12:38 +0000 | [diff] [blame] | 335 | static PyObject * |
Fred Drake | a2f5511 | 2000-07-09 15:16:51 +0000 | [diff] [blame] | 336 | list_repr(PyListObject *v) |
Guido van Rossum | 85a5fbb | 1990-10-14 12:07:46 +0000 | [diff] [blame] | 337 | { |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 338 | Py_ssize_t i; |
Victor Stinner | 5c73347 | 2013-11-18 21:11:57 +0100 | [diff] [blame] | 339 | PyObject *s; |
Victor Stinner | 5c73347 | 2013-11-18 21:11:57 +0100 | [diff] [blame] | 340 | _PyUnicodeWriter writer; |
Antoine Pitrou | eeb7eea | 2011-10-06 18:57:27 +0200 | [diff] [blame] | 341 | |
| 342 | if (Py_SIZE(v) == 0) { |
| 343 | return PyUnicode_FromString("[]"); |
| 344 | } |
| 345 | |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 346 | i = Py_ReprEnter((PyObject*)v); |
| 347 | if (i != 0) { |
| 348 | return i > 0 ? PyUnicode_FromString("[...]") : NULL; |
| 349 | } |
Tim Peters | a725959 | 2001-06-16 05:11:17 +0000 | [diff] [blame] | 350 | |
Victor Stinner | 5c73347 | 2013-11-18 21:11:57 +0100 | [diff] [blame] | 351 | _PyUnicodeWriter_Init(&writer); |
| 352 | writer.overallocate = 1; |
Victor Stinner | b8fb197 | 2013-11-18 22:15:44 +0100 | [diff] [blame] | 353 | /* "[" + "1" + ", 2" * (len - 1) + "]" */ |
| 354 | writer.min_length = 1 + 1 + (2 + 1) * (Py_SIZE(v) - 1) + 1; |
Tim Peters | a725959 | 2001-06-16 05:11:17 +0000 | [diff] [blame] | 355 | |
Victor Stinner | 5c73347 | 2013-11-18 21:11:57 +0100 | [diff] [blame] | 356 | if (_PyUnicodeWriter_WriteChar(&writer, '[') < 0) |
Antoine Pitrou | eeb7eea | 2011-10-06 18:57:27 +0200 | [diff] [blame] | 357 | goto error; |
Tim Peters | a725959 | 2001-06-16 05:11:17 +0000 | [diff] [blame] | 358 | |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 359 | /* Do repr() on each element. Note that this may mutate the list, |
| 360 | so must refetch the list size on each iteration. */ |
| 361 | for (i = 0; i < Py_SIZE(v); ++i) { |
Victor Stinner | 5c73347 | 2013-11-18 21:11:57 +0100 | [diff] [blame] | 362 | if (i > 0) { |
Victor Stinner | 4a58707 | 2013-11-19 12:54:53 +0100 | [diff] [blame] | 363 | if (_PyUnicodeWriter_WriteASCIIString(&writer, ", ", 2) < 0) |
Victor Stinner | 5c73347 | 2013-11-18 21:11:57 +0100 | [diff] [blame] | 364 | goto error; |
| 365 | } |
| 366 | |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 367 | s = PyObject_Repr(v->ob_item[i]); |
Victor Stinner | 5c73347 | 2013-11-18 21:11:57 +0100 | [diff] [blame] | 368 | if (s == NULL) |
Antoine Pitrou | eeb7eea | 2011-10-06 18:57:27 +0200 | [diff] [blame] | 369 | goto error; |
Victor Stinner | 5c73347 | 2013-11-18 21:11:57 +0100 | [diff] [blame] | 370 | |
| 371 | if (_PyUnicodeWriter_WriteStr(&writer, s) < 0) { |
| 372 | Py_DECREF(s); |
Antoine Pitrou | eeb7eea | 2011-10-06 18:57:27 +0200 | [diff] [blame] | 373 | goto error; |
Victor Stinner | 5c73347 | 2013-11-18 21:11:57 +0100 | [diff] [blame] | 374 | } |
| 375 | Py_DECREF(s); |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 376 | } |
Victor Stinner | 5c73347 | 2013-11-18 21:11:57 +0100 | [diff] [blame] | 377 | |
Victor Stinner | 4d3f109 | 2013-11-19 12:09:00 +0100 | [diff] [blame] | 378 | writer.overallocate = 0; |
Victor Stinner | 5c73347 | 2013-11-18 21:11:57 +0100 | [diff] [blame] | 379 | if (_PyUnicodeWriter_WriteChar(&writer, ']') < 0) |
Antoine Pitrou | eeb7eea | 2011-10-06 18:57:27 +0200 | [diff] [blame] | 380 | goto error; |
Tim Peters | a725959 | 2001-06-16 05:11:17 +0000 | [diff] [blame] | 381 | |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 382 | Py_ReprLeave((PyObject *)v); |
Victor Stinner | 5c73347 | 2013-11-18 21:11:57 +0100 | [diff] [blame] | 383 | return _PyUnicodeWriter_Finish(&writer); |
Antoine Pitrou | eeb7eea | 2011-10-06 18:57:27 +0200 | [diff] [blame] | 384 | |
| 385 | error: |
Victor Stinner | 5c73347 | 2013-11-18 21:11:57 +0100 | [diff] [blame] | 386 | _PyUnicodeWriter_Dealloc(&writer); |
Antoine Pitrou | eeb7eea | 2011-10-06 18:57:27 +0200 | [diff] [blame] | 387 | Py_ReprLeave((PyObject *)v); |
| 388 | return NULL; |
Guido van Rossum | 85a5fbb | 1990-10-14 12:07:46 +0000 | [diff] [blame] | 389 | } |
| 390 | |
Martin v. Löwis | 18e1655 | 2006-02-15 17:27:45 +0000 | [diff] [blame] | 391 | static Py_ssize_t |
Fred Drake | a2f5511 | 2000-07-09 15:16:51 +0000 | [diff] [blame] | 392 | list_length(PyListObject *a) |
Guido van Rossum | 85a5fbb | 1990-10-14 12:07:46 +0000 | [diff] [blame] | 393 | { |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 394 | return Py_SIZE(a); |
Guido van Rossum | 85a5fbb | 1990-10-14 12:07:46 +0000 | [diff] [blame] | 395 | } |
| 396 | |
Jeremy Hylton | 37b1a26 | 2000-04-27 21:41:03 +0000 | [diff] [blame] | 397 | static int |
Fred Drake | a2f5511 | 2000-07-09 15:16:51 +0000 | [diff] [blame] | 398 | list_contains(PyListObject *a, PyObject *el) |
Jeremy Hylton | 37b1a26 | 2000-04-27 21:41:03 +0000 | [diff] [blame] | 399 | { |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 400 | Py_ssize_t i; |
| 401 | int cmp; |
Jeremy Hylton | 37b1a26 | 2000-04-27 21:41:03 +0000 | [diff] [blame] | 402 | |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 403 | for (i = 0, cmp = 0 ; cmp == 0 && i < Py_SIZE(a); ++i) |
| 404 | cmp = PyObject_RichCompareBool(el, PyList_GET_ITEM(a, i), |
| 405 | Py_EQ); |
| 406 | return cmp; |
Jeremy Hylton | 37b1a26 | 2000-04-27 21:41:03 +0000 | [diff] [blame] | 407 | } |
| 408 | |
Guido van Rossum | c0b618a | 1997-05-02 03:12:38 +0000 | [diff] [blame] | 409 | static PyObject * |
Martin v. Löwis | 18e1655 | 2006-02-15 17:27:45 +0000 | [diff] [blame] | 410 | list_item(PyListObject *a, Py_ssize_t i) |
Guido van Rossum | 85a5fbb | 1990-10-14 12:07:46 +0000 | [diff] [blame] | 411 | { |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 412 | if (i < 0 || i >= Py_SIZE(a)) { |
| 413 | if (indexerr == NULL) { |
| 414 | indexerr = PyUnicode_FromString( |
| 415 | "list index out of range"); |
| 416 | if (indexerr == NULL) |
| 417 | return NULL; |
| 418 | } |
| 419 | PyErr_SetObject(PyExc_IndexError, indexerr); |
| 420 | return NULL; |
| 421 | } |
| 422 | Py_INCREF(a->ob_item[i]); |
| 423 | return a->ob_item[i]; |
Guido van Rossum | 85a5fbb | 1990-10-14 12:07:46 +0000 | [diff] [blame] | 424 | } |
| 425 | |
Guido van Rossum | c0b618a | 1997-05-02 03:12:38 +0000 | [diff] [blame] | 426 | static PyObject * |
Martin v. Löwis | 18e1655 | 2006-02-15 17:27:45 +0000 | [diff] [blame] | 427 | list_slice(PyListObject *a, Py_ssize_t ilow, Py_ssize_t ihigh) |
Guido van Rossum | 85a5fbb | 1990-10-14 12:07:46 +0000 | [diff] [blame] | 428 | { |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 429 | PyListObject *np; |
| 430 | PyObject **src, **dest; |
| 431 | Py_ssize_t i, len; |
| 432 | if (ilow < 0) |
| 433 | ilow = 0; |
| 434 | else if (ilow > Py_SIZE(a)) |
| 435 | ilow = Py_SIZE(a); |
| 436 | if (ihigh < ilow) |
| 437 | ihigh = ilow; |
| 438 | else if (ihigh > Py_SIZE(a)) |
| 439 | ihigh = Py_SIZE(a); |
| 440 | len = ihigh - ilow; |
| 441 | np = (PyListObject *) PyList_New(len); |
| 442 | if (np == NULL) |
| 443 | return NULL; |
Raymond Hettinger | 99842b6 | 2004-03-08 05:56:15 +0000 | [diff] [blame] | 444 | |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 445 | src = a->ob_item + ilow; |
| 446 | dest = np->ob_item; |
| 447 | for (i = 0; i < len; i++) { |
| 448 | PyObject *v = src[i]; |
| 449 | Py_INCREF(v); |
| 450 | dest[i] = v; |
| 451 | } |
| 452 | return (PyObject *)np; |
Guido van Rossum | 85a5fbb | 1990-10-14 12:07:46 +0000 | [diff] [blame] | 453 | } |
| 454 | |
Guido van Rossum | c0b618a | 1997-05-02 03:12:38 +0000 | [diff] [blame] | 455 | PyObject * |
Martin v. Löwis | 18e1655 | 2006-02-15 17:27:45 +0000 | [diff] [blame] | 456 | PyList_GetSlice(PyObject *a, Py_ssize_t ilow, Py_ssize_t ihigh) |
Guido van Rossum | 234f942 | 1993-06-17 12:35:49 +0000 | [diff] [blame] | 457 | { |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 458 | if (!PyList_Check(a)) { |
| 459 | PyErr_BadInternalCall(); |
| 460 | return NULL; |
| 461 | } |
| 462 | return list_slice((PyListObject *)a, ilow, ihigh); |
Guido van Rossum | 234f942 | 1993-06-17 12:35:49 +0000 | [diff] [blame] | 463 | } |
| 464 | |
Guido van Rossum | c0b618a | 1997-05-02 03:12:38 +0000 | [diff] [blame] | 465 | static PyObject * |
Fred Drake | a2f5511 | 2000-07-09 15:16:51 +0000 | [diff] [blame] | 466 | list_concat(PyListObject *a, PyObject *bb) |
Guido van Rossum | 85a5fbb | 1990-10-14 12:07:46 +0000 | [diff] [blame] | 467 | { |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 468 | Py_ssize_t size; |
| 469 | Py_ssize_t i; |
| 470 | PyObject **src, **dest; |
| 471 | PyListObject *np; |
| 472 | if (!PyList_Check(bb)) { |
| 473 | PyErr_Format(PyExc_TypeError, |
| 474 | "can only concatenate list (not \"%.200s\") to list", |
| 475 | bb->ob_type->tp_name); |
| 476 | return NULL; |
| 477 | } |
Guido van Rossum | c0b618a | 1997-05-02 03:12:38 +0000 | [diff] [blame] | 478 | #define b ((PyListObject *)bb) |
Martin Panter | b93d863 | 2016-07-25 02:39:20 +0000 | [diff] [blame] | 479 | if (Py_SIZE(a) > PY_SSIZE_T_MAX - Py_SIZE(b)) |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 480 | return PyErr_NoMemory(); |
Martin Panter | b93d863 | 2016-07-25 02:39:20 +0000 | [diff] [blame] | 481 | size = Py_SIZE(a) + Py_SIZE(b); |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 482 | np = (PyListObject *) PyList_New(size); |
| 483 | if (np == NULL) { |
| 484 | return NULL; |
| 485 | } |
| 486 | src = a->ob_item; |
| 487 | dest = np->ob_item; |
| 488 | for (i = 0; i < Py_SIZE(a); i++) { |
| 489 | PyObject *v = src[i]; |
| 490 | Py_INCREF(v); |
| 491 | dest[i] = v; |
| 492 | } |
| 493 | src = b->ob_item; |
| 494 | dest = np->ob_item + Py_SIZE(a); |
| 495 | for (i = 0; i < Py_SIZE(b); i++) { |
| 496 | PyObject *v = src[i]; |
| 497 | Py_INCREF(v); |
| 498 | dest[i] = v; |
| 499 | } |
| 500 | return (PyObject *)np; |
Guido van Rossum | 85a5fbb | 1990-10-14 12:07:46 +0000 | [diff] [blame] | 501 | #undef b |
| 502 | } |
| 503 | |
Guido van Rossum | c0b618a | 1997-05-02 03:12:38 +0000 | [diff] [blame] | 504 | static PyObject * |
Martin v. Löwis | 18e1655 | 2006-02-15 17:27:45 +0000 | [diff] [blame] | 505 | list_repeat(PyListObject *a, Py_ssize_t n) |
Guido van Rossum | ed98d48 | 1991-03-06 13:07:53 +0000 | [diff] [blame] | 506 | { |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 507 | Py_ssize_t i, j; |
| 508 | Py_ssize_t size; |
| 509 | PyListObject *np; |
| 510 | PyObject **p, **items; |
| 511 | PyObject *elem; |
| 512 | if (n < 0) |
| 513 | n = 0; |
Mark Dickinson | c0420fd | 2011-09-19 19:18:37 +0100 | [diff] [blame] | 514 | if (n > 0 && Py_SIZE(a) > PY_SSIZE_T_MAX / n) |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 515 | return PyErr_NoMemory(); |
Mark Dickinson | c0420fd | 2011-09-19 19:18:37 +0100 | [diff] [blame] | 516 | size = Py_SIZE(a) * n; |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 517 | if (size == 0) |
| 518 | return PyList_New(0); |
| 519 | np = (PyListObject *) PyList_New(size); |
| 520 | if (np == NULL) |
| 521 | return NULL; |
Raymond Hettinger | 6624e68 | 2003-05-21 05:58:46 +0000 | [diff] [blame] | 522 | |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 523 | items = np->ob_item; |
| 524 | if (Py_SIZE(a) == 1) { |
| 525 | elem = a->ob_item[0]; |
| 526 | for (i = 0; i < n; i++) { |
| 527 | items[i] = elem; |
| 528 | Py_INCREF(elem); |
| 529 | } |
| 530 | return (PyObject *) np; |
| 531 | } |
| 532 | p = np->ob_item; |
| 533 | items = a->ob_item; |
| 534 | for (i = 0; i < n; i++) { |
| 535 | for (j = 0; j < Py_SIZE(a); j++) { |
| 536 | *p = items[j]; |
| 537 | Py_INCREF(*p); |
| 538 | p++; |
| 539 | } |
| 540 | } |
| 541 | return (PyObject *) np; |
Guido van Rossum | ed98d48 | 1991-03-06 13:07:53 +0000 | [diff] [blame] | 542 | } |
| 543 | |
Guido van Rossum | 85a5fbb | 1990-10-14 12:07:46 +0000 | [diff] [blame] | 544 | static int |
Serhiy Storchaka | fdd42c4 | 2017-03-11 09:19:20 +0200 | [diff] [blame] | 545 | _list_clear(PyListObject *a) |
Armin Rigo | 93677f0 | 2004-07-29 12:40:23 +0000 | [diff] [blame] | 546 | { |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 547 | Py_ssize_t i; |
| 548 | PyObject **item = a->ob_item; |
| 549 | if (item != NULL) { |
| 550 | /* Because XDECREF can recursively invoke operations on |
| 551 | this list, we make it empty first. */ |
| 552 | i = Py_SIZE(a); |
| 553 | Py_SIZE(a) = 0; |
| 554 | a->ob_item = NULL; |
| 555 | a->allocated = 0; |
| 556 | while (--i >= 0) { |
| 557 | Py_XDECREF(item[i]); |
| 558 | } |
| 559 | PyMem_FREE(item); |
| 560 | } |
| 561 | /* Never fails; the return value can be ignored. |
| 562 | Note that there is no guarantee that the list is actually empty |
| 563 | at this point, because XDECREF may have populated it again! */ |
| 564 | return 0; |
Armin Rigo | 93677f0 | 2004-07-29 12:40:23 +0000 | [diff] [blame] | 565 | } |
| 566 | |
Tim Peters | 8fc4a91 | 2004-07-31 21:53:19 +0000 | [diff] [blame] | 567 | /* a[ilow:ihigh] = v if v != NULL. |
| 568 | * del a[ilow:ihigh] if v == NULL. |
| 569 | * |
| 570 | * Special speed gimmick: when v is NULL and ihigh - ilow <= 8, it's |
| 571 | * guaranteed the call cannot fail. |
| 572 | */ |
Armin Rigo | 93677f0 | 2004-07-29 12:40:23 +0000 | [diff] [blame] | 573 | static int |
Martin v. Löwis | 18e1655 | 2006-02-15 17:27:45 +0000 | [diff] [blame] | 574 | list_ass_slice(PyListObject *a, Py_ssize_t ilow, Py_ssize_t ihigh, PyObject *v) |
Guido van Rossum | 85a5fbb | 1990-10-14 12:07:46 +0000 | [diff] [blame] | 575 | { |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 576 | /* Because [X]DECREF can recursively invoke list operations on |
| 577 | this list, we must postpone all [X]DECREF activity until |
| 578 | after the list is back in its canonical shape. Therefore |
| 579 | we must allocate an additional array, 'recycle', into which |
| 580 | we temporarily copy the items that are deleted from the |
| 581 | list. :-( */ |
| 582 | PyObject *recycle_on_stack[8]; |
| 583 | PyObject **recycle = recycle_on_stack; /* will allocate more if needed */ |
| 584 | PyObject **item; |
| 585 | PyObject **vitem = NULL; |
| 586 | PyObject *v_as_SF = NULL; /* PySequence_Fast(v) */ |
| 587 | Py_ssize_t n; /* # of elements in replacement list */ |
| 588 | Py_ssize_t norig; /* # of elements in list getting replaced */ |
| 589 | Py_ssize_t d; /* Change in size */ |
| 590 | Py_ssize_t k; |
| 591 | size_t s; |
| 592 | int result = -1; /* guilty until proved innocent */ |
Guido van Rossum | c0b618a | 1997-05-02 03:12:38 +0000 | [diff] [blame] | 593 | #define b ((PyListObject *)v) |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 594 | if (v == NULL) |
| 595 | n = 0; |
| 596 | else { |
| 597 | if (a == b) { |
| 598 | /* Special case "a[i:j] = a" -- copy b first */ |
| 599 | v = list_slice(b, 0, Py_SIZE(b)); |
| 600 | if (v == NULL) |
| 601 | return result; |
| 602 | result = list_ass_slice(a, ilow, ihigh, v); |
| 603 | Py_DECREF(v); |
| 604 | return result; |
| 605 | } |
| 606 | v_as_SF = PySequence_Fast(v, "can only assign an iterable"); |
| 607 | if(v_as_SF == NULL) |
| 608 | goto Error; |
| 609 | n = PySequence_Fast_GET_SIZE(v_as_SF); |
| 610 | vitem = PySequence_Fast_ITEMS(v_as_SF); |
| 611 | } |
| 612 | if (ilow < 0) |
| 613 | ilow = 0; |
| 614 | else if (ilow > Py_SIZE(a)) |
| 615 | ilow = Py_SIZE(a); |
Tim Peters | 8d9eb10 | 2004-07-31 02:24:20 +0000 | [diff] [blame] | 616 | |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 617 | if (ihigh < ilow) |
| 618 | ihigh = ilow; |
| 619 | else if (ihigh > Py_SIZE(a)) |
| 620 | ihigh = Py_SIZE(a); |
Armin Rigo | 93677f0 | 2004-07-29 12:40:23 +0000 | [diff] [blame] | 621 | |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 622 | norig = ihigh - ilow; |
| 623 | assert(norig >= 0); |
| 624 | d = n - norig; |
| 625 | if (Py_SIZE(a) + d == 0) { |
| 626 | Py_XDECREF(v_as_SF); |
Serhiy Storchaka | fdd42c4 | 2017-03-11 09:19:20 +0200 | [diff] [blame] | 627 | return _list_clear(a); |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 628 | } |
| 629 | item = a->ob_item; |
| 630 | /* recycle the items that we are about to remove */ |
| 631 | s = norig * sizeof(PyObject *); |
Benjamin Peterson | 5a7d923 | 2016-09-06 17:58:25 -0700 | [diff] [blame] | 632 | /* If norig == 0, item might be NULL, in which case we may not memcpy from it. */ |
| 633 | if (s) { |
| 634 | if (s > sizeof(recycle_on_stack)) { |
| 635 | recycle = (PyObject **)PyMem_MALLOC(s); |
| 636 | if (recycle == NULL) { |
| 637 | PyErr_NoMemory(); |
| 638 | goto Error; |
| 639 | } |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 640 | } |
Benjamin Peterson | 5a7d923 | 2016-09-06 17:58:25 -0700 | [diff] [blame] | 641 | memcpy(recycle, &item[ilow], s); |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 642 | } |
Tim Peters | 8d9eb10 | 2004-07-31 02:24:20 +0000 | [diff] [blame] | 643 | |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 644 | if (d < 0) { /* Delete -d items */ |
Victor Stinner | 2c40f64 | 2013-07-19 23:06:21 +0200 | [diff] [blame] | 645 | Py_ssize_t tail; |
| 646 | tail = (Py_SIZE(a) - ihigh) * sizeof(PyObject *); |
| 647 | memmove(&item[ihigh+d], &item[ihigh], tail); |
| 648 | if (list_resize(a, Py_SIZE(a) + d) < 0) { |
| 649 | memmove(&item[ihigh], &item[ihigh+d], tail); |
| 650 | memcpy(&item[ilow], recycle, s); |
| 651 | goto Error; |
| 652 | } |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 653 | item = a->ob_item; |
| 654 | } |
| 655 | else if (d > 0) { /* Insert d items */ |
| 656 | k = Py_SIZE(a); |
| 657 | if (list_resize(a, k+d) < 0) |
| 658 | goto Error; |
| 659 | item = a->ob_item; |
| 660 | memmove(&item[ihigh+d], &item[ihigh], |
| 661 | (k - ihigh)*sizeof(PyObject *)); |
| 662 | } |
| 663 | for (k = 0; k < n; k++, ilow++) { |
| 664 | PyObject *w = vitem[k]; |
| 665 | Py_XINCREF(w); |
| 666 | item[ilow] = w; |
| 667 | } |
| 668 | for (k = norig - 1; k >= 0; --k) |
| 669 | Py_XDECREF(recycle[k]); |
| 670 | result = 0; |
Tim Peters | 8d9eb10 | 2004-07-31 02:24:20 +0000 | [diff] [blame] | 671 | Error: |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 672 | if (recycle != recycle_on_stack) |
| 673 | PyMem_FREE(recycle); |
| 674 | Py_XDECREF(v_as_SF); |
| 675 | return result; |
Guido van Rossum | 85a5fbb | 1990-10-14 12:07:46 +0000 | [diff] [blame] | 676 | #undef b |
| 677 | } |
| 678 | |
Guido van Rossum | 234f942 | 1993-06-17 12:35:49 +0000 | [diff] [blame] | 679 | int |
Martin v. Löwis | 18e1655 | 2006-02-15 17:27:45 +0000 | [diff] [blame] | 680 | PyList_SetSlice(PyObject *a, Py_ssize_t ilow, Py_ssize_t ihigh, PyObject *v) |
Guido van Rossum | 234f942 | 1993-06-17 12:35:49 +0000 | [diff] [blame] | 681 | { |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 682 | if (!PyList_Check(a)) { |
| 683 | PyErr_BadInternalCall(); |
| 684 | return -1; |
| 685 | } |
| 686 | return list_ass_slice((PyListObject *)a, ilow, ihigh, v); |
Guido van Rossum | 234f942 | 1993-06-17 12:35:49 +0000 | [diff] [blame] | 687 | } |
| 688 | |
Thomas Wouters | e289e0b | 2000-08-24 20:08:19 +0000 | [diff] [blame] | 689 | static PyObject * |
Martin v. Löwis | 18e1655 | 2006-02-15 17:27:45 +0000 | [diff] [blame] | 690 | list_inplace_repeat(PyListObject *self, Py_ssize_t n) |
Thomas Wouters | e289e0b | 2000-08-24 20:08:19 +0000 | [diff] [blame] | 691 | { |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 692 | PyObject **items; |
| 693 | Py_ssize_t size, i, j, p; |
Thomas Wouters | e289e0b | 2000-08-24 20:08:19 +0000 | [diff] [blame] | 694 | |
| 695 | |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 696 | size = PyList_GET_SIZE(self); |
| 697 | if (size == 0 || n == 1) { |
| 698 | Py_INCREF(self); |
| 699 | return (PyObject *)self; |
| 700 | } |
Thomas Wouters | e289e0b | 2000-08-24 20:08:19 +0000 | [diff] [blame] | 701 | |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 702 | if (n < 1) { |
Serhiy Storchaka | fdd42c4 | 2017-03-11 09:19:20 +0200 | [diff] [blame] | 703 | (void)_list_clear(self); |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 704 | Py_INCREF(self); |
| 705 | return (PyObject *)self; |
| 706 | } |
Thomas Wouters | e289e0b | 2000-08-24 20:08:19 +0000 | [diff] [blame] | 707 | |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 708 | if (size > PY_SSIZE_T_MAX / n) { |
| 709 | return PyErr_NoMemory(); |
| 710 | } |
Christian Heimes | af98da1 | 2008-01-27 15:18:18 +0000 | [diff] [blame] | 711 | |
Raymond Hettinger | 0dceb91 | 2016-01-25 10:33:30 -0800 | [diff] [blame] | 712 | if (list_resize(self, size*n) < 0) |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 713 | return NULL; |
Raymond Hettinger | 4bb9540 | 2004-02-13 11:36:39 +0000 | [diff] [blame] | 714 | |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 715 | p = size; |
| 716 | items = self->ob_item; |
| 717 | for (i = 1; i < n; i++) { /* Start counting at 1, not 0 */ |
| 718 | for (j = 0; j < size; j++) { |
| 719 | PyObject *o = items[j]; |
| 720 | Py_INCREF(o); |
| 721 | items[p++] = o; |
| 722 | } |
| 723 | } |
| 724 | Py_INCREF(self); |
| 725 | return (PyObject *)self; |
Thomas Wouters | e289e0b | 2000-08-24 20:08:19 +0000 | [diff] [blame] | 726 | } |
| 727 | |
Guido van Rossum | 4a450d0 | 1991-04-03 19:05:18 +0000 | [diff] [blame] | 728 | static int |
Martin v. Löwis | 18e1655 | 2006-02-15 17:27:45 +0000 | [diff] [blame] | 729 | list_ass_item(PyListObject *a, Py_ssize_t i, PyObject *v) |
Guido van Rossum | 4a450d0 | 1991-04-03 19:05:18 +0000 | [diff] [blame] | 730 | { |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 731 | if (i < 0 || i >= Py_SIZE(a)) { |
| 732 | PyErr_SetString(PyExc_IndexError, |
| 733 | "list assignment index out of range"); |
| 734 | return -1; |
| 735 | } |
| 736 | if (v == NULL) |
| 737 | return list_ass_slice(a, i, i+1, v); |
| 738 | Py_INCREF(v); |
Serhiy Storchaka | f01e408 | 2016-04-10 18:12:01 +0300 | [diff] [blame] | 739 | Py_SETREF(a->ob_item[i], v); |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 740 | return 0; |
Guido van Rossum | 4a450d0 | 1991-04-03 19:05:18 +0000 | [diff] [blame] | 741 | } |
| 742 | |
Serhiy Storchaka | fdd42c4 | 2017-03-11 09:19:20 +0200 | [diff] [blame] | 743 | /*[clinic input] |
| 744 | list.insert |
| 745 | |
| 746 | index: Py_ssize_t |
| 747 | object: object |
| 748 | / |
| 749 | |
| 750 | Insert object before index. |
| 751 | [clinic start generated code]*/ |
| 752 | |
Guido van Rossum | c0b618a | 1997-05-02 03:12:38 +0000 | [diff] [blame] | 753 | static PyObject * |
Serhiy Storchaka | fdd42c4 | 2017-03-11 09:19:20 +0200 | [diff] [blame] | 754 | list_insert_impl(PyListObject *self, Py_ssize_t index, PyObject *object) |
| 755 | /*[clinic end generated code: output=7f35e32f60c8cb78 input=858514cf894c7eab]*/ |
Guido van Rossum | 85a5fbb | 1990-10-14 12:07:46 +0000 | [diff] [blame] | 756 | { |
Serhiy Storchaka | fdd42c4 | 2017-03-11 09:19:20 +0200 | [diff] [blame] | 757 | if (ins1(self, index, object) == 0) |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 758 | Py_RETURN_NONE; |
| 759 | return NULL; |
Guido van Rossum | 85a5fbb | 1990-10-14 12:07:46 +0000 | [diff] [blame] | 760 | } |
| 761 | |
Serhiy Storchaka | fdd42c4 | 2017-03-11 09:19:20 +0200 | [diff] [blame] | 762 | /*[clinic input] |
| 763 | list.clear |
| 764 | |
| 765 | Remove all items from list. |
| 766 | [clinic start generated code]*/ |
| 767 | |
Guido van Rossum | c0b618a | 1997-05-02 03:12:38 +0000 | [diff] [blame] | 768 | static PyObject * |
Serhiy Storchaka | fdd42c4 | 2017-03-11 09:19:20 +0200 | [diff] [blame] | 769 | list_clear_impl(PyListObject *self) |
| 770 | /*[clinic end generated code: output=67a1896c01f74362 input=ca3c1646856742f6]*/ |
Eli Bendersky | cbbaa96 | 2011-02-25 05:47:53 +0000 | [diff] [blame] | 771 | { |
Serhiy Storchaka | fdd42c4 | 2017-03-11 09:19:20 +0200 | [diff] [blame] | 772 | _list_clear(self); |
Eli Bendersky | cbbaa96 | 2011-02-25 05:47:53 +0000 | [diff] [blame] | 773 | Py_RETURN_NONE; |
| 774 | } |
| 775 | |
Serhiy Storchaka | fdd42c4 | 2017-03-11 09:19:20 +0200 | [diff] [blame] | 776 | /*[clinic input] |
| 777 | list.copy |
| 778 | |
| 779 | Return a shallow copy of the list. |
| 780 | [clinic start generated code]*/ |
| 781 | |
Eli Bendersky | cbbaa96 | 2011-02-25 05:47:53 +0000 | [diff] [blame] | 782 | static PyObject * |
Serhiy Storchaka | fdd42c4 | 2017-03-11 09:19:20 +0200 | [diff] [blame] | 783 | list_copy_impl(PyListObject *self) |
| 784 | /*[clinic end generated code: output=ec6b72d6209d418e input=6453ab159e84771f]*/ |
Eli Bendersky | cbbaa96 | 2011-02-25 05:47:53 +0000 | [diff] [blame] | 785 | { |
| 786 | return list_slice(self, 0, Py_SIZE(self)); |
| 787 | } |
| 788 | |
Serhiy Storchaka | fdd42c4 | 2017-03-11 09:19:20 +0200 | [diff] [blame] | 789 | /*[clinic input] |
| 790 | list.append |
| 791 | |
| 792 | object: object |
| 793 | / |
| 794 | |
| 795 | Append object to the end of the list. |
| 796 | [clinic start generated code]*/ |
| 797 | |
Eli Bendersky | cbbaa96 | 2011-02-25 05:47:53 +0000 | [diff] [blame] | 798 | static PyObject * |
Serhiy Storchaka | fdd42c4 | 2017-03-11 09:19:20 +0200 | [diff] [blame] | 799 | list_append(PyListObject *self, PyObject *object) |
| 800 | /*[clinic end generated code: output=7c096003a29c0eae input=43a3fe48a7066e91]*/ |
Guido van Rossum | 85a5fbb | 1990-10-14 12:07:46 +0000 | [diff] [blame] | 801 | { |
Serhiy Storchaka | fdd42c4 | 2017-03-11 09:19:20 +0200 | [diff] [blame] | 802 | if (app1(self, object) == 0) |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 803 | Py_RETURN_NONE; |
| 804 | return NULL; |
Guido van Rossum | 85a5fbb | 1990-10-14 12:07:46 +0000 | [diff] [blame] | 805 | } |
| 806 | |
Serhiy Storchaka | fdd42c4 | 2017-03-11 09:19:20 +0200 | [diff] [blame] | 807 | /*[clinic input] |
| 808 | list.extend |
| 809 | |
| 810 | iterable: object |
| 811 | / |
| 812 | |
| 813 | Extend list by appending elements from the iterable. |
| 814 | [clinic start generated code]*/ |
| 815 | |
Barry Warsaw | dedf6d6 | 1998-10-09 16:37:25 +0000 | [diff] [blame] | 816 | static PyObject * |
Serhiy Storchaka | fdd42c4 | 2017-03-11 09:19:20 +0200 | [diff] [blame] | 817 | list_extend(PyListObject *self, PyObject *iterable) |
| 818 | /*[clinic end generated code: output=630fb3bca0c8e789 input=9ec5ba3a81be3a4d]*/ |
Thomas Wouters | e289e0b | 2000-08-24 20:08:19 +0000 | [diff] [blame] | 819 | { |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 820 | PyObject *it; /* iter(v) */ |
| 821 | Py_ssize_t m; /* size of self */ |
Serhiy Storchaka | fdd42c4 | 2017-03-11 09:19:20 +0200 | [diff] [blame] | 822 | Py_ssize_t n; /* guess for size of iterable */ |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 823 | Py_ssize_t mn; /* m + n */ |
| 824 | Py_ssize_t i; |
| 825 | PyObject *(*iternext)(PyObject *); |
Thomas Wouters | e289e0b | 2000-08-24 20:08:19 +0000 | [diff] [blame] | 826 | |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 827 | /* Special cases: |
| 828 | 1) lists and tuples which can use PySequence_Fast ops |
| 829 | 2) extending self to self requires making a copy first |
| 830 | */ |
Serhiy Storchaka | fdd42c4 | 2017-03-11 09:19:20 +0200 | [diff] [blame] | 831 | if (PyList_CheckExact(iterable) || PyTuple_CheckExact(iterable) || |
| 832 | (PyObject *)self == iterable) { |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 833 | PyObject **src, **dest; |
Serhiy Storchaka | fdd42c4 | 2017-03-11 09:19:20 +0200 | [diff] [blame] | 834 | iterable = PySequence_Fast(iterable, "argument must be iterable"); |
| 835 | if (!iterable) |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 836 | return NULL; |
Serhiy Storchaka | fdd42c4 | 2017-03-11 09:19:20 +0200 | [diff] [blame] | 837 | n = PySequence_Fast_GET_SIZE(iterable); |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 838 | if (n == 0) { |
Serhiy Storchaka | fdd42c4 | 2017-03-11 09:19:20 +0200 | [diff] [blame] | 839 | /* short circuit when iterable is empty */ |
| 840 | Py_DECREF(iterable); |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 841 | Py_RETURN_NONE; |
| 842 | } |
| 843 | m = Py_SIZE(self); |
Martin Panter | 94b39ce | 2017-01-14 06:30:37 +0000 | [diff] [blame] | 844 | /* It should not be possible to allocate a list large enough to cause |
| 845 | an overflow on any relevant platform */ |
| 846 | assert(m < PY_SSIZE_T_MAX - n); |
Raymond Hettinger | 0dceb91 | 2016-01-25 10:33:30 -0800 | [diff] [blame] | 847 | if (list_resize(self, m + n) < 0) { |
Serhiy Storchaka | fdd42c4 | 2017-03-11 09:19:20 +0200 | [diff] [blame] | 848 | Py_DECREF(iterable); |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 849 | return NULL; |
| 850 | } |
Serhiy Storchaka | fdd42c4 | 2017-03-11 09:19:20 +0200 | [diff] [blame] | 851 | /* note that we may still have self == iterable here for the |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 852 | * situation a.extend(a), but the following code works |
| 853 | * in that case too. Just make sure to resize self |
| 854 | * before calling PySequence_Fast_ITEMS. |
| 855 | */ |
Serhiy Storchaka | fdd42c4 | 2017-03-11 09:19:20 +0200 | [diff] [blame] | 856 | /* populate the end of self with iterable's items */ |
| 857 | src = PySequence_Fast_ITEMS(iterable); |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 858 | dest = self->ob_item + m; |
| 859 | for (i = 0; i < n; i++) { |
| 860 | PyObject *o = src[i]; |
| 861 | Py_INCREF(o); |
| 862 | dest[i] = o; |
| 863 | } |
Serhiy Storchaka | fdd42c4 | 2017-03-11 09:19:20 +0200 | [diff] [blame] | 864 | Py_DECREF(iterable); |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 865 | Py_RETURN_NONE; |
| 866 | } |
Raymond Hettinger | 90a39bf | 2004-02-15 03:57:00 +0000 | [diff] [blame] | 867 | |
Serhiy Storchaka | fdd42c4 | 2017-03-11 09:19:20 +0200 | [diff] [blame] | 868 | it = PyObject_GetIter(iterable); |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 869 | if (it == NULL) |
| 870 | return NULL; |
| 871 | iternext = *it->ob_type->tp_iternext; |
Thomas Wouters | e289e0b | 2000-08-24 20:08:19 +0000 | [diff] [blame] | 872 | |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 873 | /* Guess a result list size. */ |
Serhiy Storchaka | fdd42c4 | 2017-03-11 09:19:20 +0200 | [diff] [blame] | 874 | n = PyObject_LengthHint(iterable, 8); |
Raymond Hettinger | 0dceb91 | 2016-01-25 10:33:30 -0800 | [diff] [blame] | 875 | if (n < 0) { |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 876 | Py_DECREF(it); |
| 877 | return NULL; |
| 878 | } |
| 879 | m = Py_SIZE(self); |
Martin Panter | b93d863 | 2016-07-25 02:39:20 +0000 | [diff] [blame] | 880 | if (m > PY_SSIZE_T_MAX - n) { |
| 881 | /* m + n overflowed; on the chance that n lied, and there really |
| 882 | * is enough room, ignore it. If n was telling the truth, we'll |
| 883 | * eventually run out of memory during the loop. |
| 884 | */ |
| 885 | } |
| 886 | else { |
| 887 | mn = m + n; |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 888 | /* Make room. */ |
Raymond Hettinger | 0dceb91 | 2016-01-25 10:33:30 -0800 | [diff] [blame] | 889 | if (list_resize(self, mn) < 0) |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 890 | goto error; |
| 891 | /* Make the list sane again. */ |
| 892 | Py_SIZE(self) = m; |
| 893 | } |
Thomas Wouters | e289e0b | 2000-08-24 20:08:19 +0000 | [diff] [blame] | 894 | |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 895 | /* Run iterator to exhaustion. */ |
| 896 | for (;;) { |
| 897 | PyObject *item = iternext(it); |
| 898 | if (item == NULL) { |
| 899 | if (PyErr_Occurred()) { |
| 900 | if (PyErr_ExceptionMatches(PyExc_StopIteration)) |
| 901 | PyErr_Clear(); |
| 902 | else |
| 903 | goto error; |
| 904 | } |
| 905 | break; |
| 906 | } |
| 907 | if (Py_SIZE(self) < self->allocated) { |
| 908 | /* steals ref */ |
| 909 | PyList_SET_ITEM(self, Py_SIZE(self), item); |
| 910 | ++Py_SIZE(self); |
| 911 | } |
| 912 | else { |
| 913 | int status = app1(self, item); |
| 914 | Py_DECREF(item); /* append creates a new ref */ |
| 915 | if (status < 0) |
| 916 | goto error; |
| 917 | } |
| 918 | } |
Raymond Hettinger | 90a39bf | 2004-02-15 03:57:00 +0000 | [diff] [blame] | 919 | |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 920 | /* Cut back result list if initial guess was too large. */ |
Victor Stinner | 32fd6ea | 2013-07-16 21:45:58 +0200 | [diff] [blame] | 921 | if (Py_SIZE(self) < self->allocated) { |
| 922 | if (list_resize(self, Py_SIZE(self)) < 0) |
| 923 | goto error; |
| 924 | } |
Raymond Hettinger | aa241e0 | 2004-09-26 19:24:20 +0000 | [diff] [blame] | 925 | |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 926 | Py_DECREF(it); |
| 927 | Py_RETURN_NONE; |
Raymond Hettinger | 90a39bf | 2004-02-15 03:57:00 +0000 | [diff] [blame] | 928 | |
| 929 | error: |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 930 | Py_DECREF(it); |
| 931 | return NULL; |
Thomas Wouters | e289e0b | 2000-08-24 20:08:19 +0000 | [diff] [blame] | 932 | } |
| 933 | |
Raymond Hettinger | 8ca92ae | 2004-03-11 09:13:12 +0000 | [diff] [blame] | 934 | PyObject * |
Serhiy Storchaka | fdd42c4 | 2017-03-11 09:19:20 +0200 | [diff] [blame] | 935 | _PyList_Extend(PyListObject *self, PyObject *iterable) |
Raymond Hettinger | 8ca92ae | 2004-03-11 09:13:12 +0000 | [diff] [blame] | 936 | { |
Serhiy Storchaka | fdd42c4 | 2017-03-11 09:19:20 +0200 | [diff] [blame] | 937 | return list_extend(self, iterable); |
Raymond Hettinger | 8ca92ae | 2004-03-11 09:13:12 +0000 | [diff] [blame] | 938 | } |
| 939 | |
Thomas Wouters | e289e0b | 2000-08-24 20:08:19 +0000 | [diff] [blame] | 940 | static PyObject * |
Raymond Hettinger | 97bc618 | 2004-03-11 07:34:19 +0000 | [diff] [blame] | 941 | list_inplace_concat(PyListObject *self, PyObject *other) |
| 942 | { |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 943 | PyObject *result; |
Raymond Hettinger | 97bc618 | 2004-03-11 07:34:19 +0000 | [diff] [blame] | 944 | |
Serhiy Storchaka | fdd42c4 | 2017-03-11 09:19:20 +0200 | [diff] [blame] | 945 | result = list_extend(self, other); |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 946 | if (result == NULL) |
| 947 | return result; |
| 948 | Py_DECREF(result); |
| 949 | Py_INCREF(self); |
| 950 | return (PyObject *)self; |
Raymond Hettinger | 97bc618 | 2004-03-11 07:34:19 +0000 | [diff] [blame] | 951 | } |
| 952 | |
Serhiy Storchaka | fdd42c4 | 2017-03-11 09:19:20 +0200 | [diff] [blame] | 953 | /*[clinic input] |
| 954 | list.pop |
| 955 | |
| 956 | index: Py_ssize_t = -1 |
| 957 | / |
| 958 | |
| 959 | Remove and return item at index (default last). |
| 960 | |
| 961 | Raises IndexError if list is empty or index is out of range. |
| 962 | [clinic start generated code]*/ |
| 963 | |
Raymond Hettinger | 97bc618 | 2004-03-11 07:34:19 +0000 | [diff] [blame] | 964 | static PyObject * |
Serhiy Storchaka | fdd42c4 | 2017-03-11 09:19:20 +0200 | [diff] [blame] | 965 | list_pop_impl(PyListObject *self, Py_ssize_t index) |
| 966 | /*[clinic end generated code: output=6bd69dcb3f17eca8 input=b83675976f329e6f]*/ |
Guido van Rossum | 3dd7f3f | 1998-06-30 15:36:32 +0000 | [diff] [blame] | 967 | { |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 968 | PyObject *v; |
| 969 | int status; |
Raymond Hettinger | 9eb86b3 | 2004-02-17 11:36:16 +0000 | [diff] [blame] | 970 | |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 971 | if (Py_SIZE(self) == 0) { |
| 972 | /* Special-case most common failure cause */ |
| 973 | PyErr_SetString(PyExc_IndexError, "pop from empty list"); |
| 974 | return NULL; |
| 975 | } |
Serhiy Storchaka | fdd42c4 | 2017-03-11 09:19:20 +0200 | [diff] [blame] | 976 | if (index < 0) |
| 977 | index += Py_SIZE(self); |
| 978 | if (index < 0 || index >= Py_SIZE(self)) { |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 979 | PyErr_SetString(PyExc_IndexError, "pop index out of range"); |
| 980 | return NULL; |
| 981 | } |
Serhiy Storchaka | fdd42c4 | 2017-03-11 09:19:20 +0200 | [diff] [blame] | 982 | v = self->ob_item[index]; |
| 983 | if (index == Py_SIZE(self) - 1) { |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 984 | status = list_resize(self, Py_SIZE(self) - 1); |
Victor Stinner | b27cd3e | 2013-07-08 22:20:44 +0200 | [diff] [blame] | 985 | if (status >= 0) |
| 986 | return v; /* and v now owns the reference the list had */ |
| 987 | else |
| 988 | return NULL; |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 989 | } |
| 990 | Py_INCREF(v); |
Serhiy Storchaka | fdd42c4 | 2017-03-11 09:19:20 +0200 | [diff] [blame] | 991 | status = list_ass_slice(self, index, index+1, (PyObject *)NULL); |
Victor Stinner | 095d99f | 2013-07-17 21:58:01 +0200 | [diff] [blame] | 992 | if (status < 0) { |
| 993 | Py_DECREF(v); |
| 994 | return NULL; |
| 995 | } |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 996 | return v; |
Guido van Rossum | 3dd7f3f | 1998-06-30 15:36:32 +0000 | [diff] [blame] | 997 | } |
| 998 | |
Tim Peters | 8e2e7ca | 2002-07-19 02:33:08 +0000 | [diff] [blame] | 999 | /* Reverse a slice of a list in place, from lo up to (exclusive) hi. */ |
| 1000 | static void |
| 1001 | reverse_slice(PyObject **lo, PyObject **hi) |
| 1002 | { |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 1003 | assert(lo && hi); |
Tim Peters | 8e2e7ca | 2002-07-19 02:33:08 +0000 | [diff] [blame] | 1004 | |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 1005 | --hi; |
| 1006 | while (lo < hi) { |
| 1007 | PyObject *t = *lo; |
| 1008 | *lo = *hi; |
| 1009 | *hi = t; |
| 1010 | ++lo; |
| 1011 | --hi; |
| 1012 | } |
Tim Peters | 8e2e7ca | 2002-07-19 02:33:08 +0000 | [diff] [blame] | 1013 | } |
| 1014 | |
Tim Peters | a64dc24 | 2002-08-01 02:13:36 +0000 | [diff] [blame] | 1015 | /* Lots of code for an adaptive, stable, natural mergesort. There are many |
| 1016 | * pieces to this algorithm; read listsort.txt for overviews and details. |
| 1017 | */ |
Guido van Rossum | 3f236de | 1996-12-10 23:55:39 +0000 | [diff] [blame] | 1018 | |
Daniel Stutzbach | 9833822 | 2010-12-02 21:55:33 +0000 | [diff] [blame] | 1019 | /* A sortslice contains a pointer to an array of keys and a pointer to |
| 1020 | * an array of corresponding values. In other words, keys[i] |
| 1021 | * corresponds with values[i]. If values == NULL, then the keys are |
| 1022 | * also the values. |
| 1023 | * |
| 1024 | * Several convenience routines are provided here, so that keys and |
| 1025 | * values are always moved in sync. |
| 1026 | */ |
| 1027 | |
| 1028 | typedef struct { |
| 1029 | PyObject **keys; |
| 1030 | PyObject **values; |
| 1031 | } sortslice; |
| 1032 | |
| 1033 | Py_LOCAL_INLINE(void) |
| 1034 | sortslice_copy(sortslice *s1, Py_ssize_t i, sortslice *s2, Py_ssize_t j) |
| 1035 | { |
| 1036 | s1->keys[i] = s2->keys[j]; |
| 1037 | if (s1->values != NULL) |
| 1038 | s1->values[i] = s2->values[j]; |
| 1039 | } |
| 1040 | |
| 1041 | Py_LOCAL_INLINE(void) |
Benjamin Peterson | 9efdcca | 2010-12-03 01:44:10 +0000 | [diff] [blame] | 1042 | sortslice_copy_incr(sortslice *dst, sortslice *src) |
| 1043 | { |
Daniel Stutzbach | 9833822 | 2010-12-02 21:55:33 +0000 | [diff] [blame] | 1044 | *dst->keys++ = *src->keys++; |
| 1045 | if (dst->values != NULL) |
| 1046 | *dst->values++ = *src->values++; |
| 1047 | } |
| 1048 | |
| 1049 | Py_LOCAL_INLINE(void) |
Benjamin Peterson | 9efdcca | 2010-12-03 01:44:10 +0000 | [diff] [blame] | 1050 | sortslice_copy_decr(sortslice *dst, sortslice *src) |
| 1051 | { |
Daniel Stutzbach | 9833822 | 2010-12-02 21:55:33 +0000 | [diff] [blame] | 1052 | *dst->keys-- = *src->keys--; |
| 1053 | if (dst->values != NULL) |
| 1054 | *dst->values-- = *src->values--; |
| 1055 | } |
| 1056 | |
| 1057 | |
| 1058 | Py_LOCAL_INLINE(void) |
| 1059 | sortslice_memcpy(sortslice *s1, Py_ssize_t i, sortslice *s2, Py_ssize_t j, |
Benjamin Peterson | 9efdcca | 2010-12-03 01:44:10 +0000 | [diff] [blame] | 1060 | Py_ssize_t n) |
| 1061 | { |
Daniel Stutzbach | 9833822 | 2010-12-02 21:55:33 +0000 | [diff] [blame] | 1062 | memcpy(&s1->keys[i], &s2->keys[j], sizeof(PyObject *) * n); |
| 1063 | if (s1->values != NULL) |
| 1064 | memcpy(&s1->values[i], &s2->values[j], sizeof(PyObject *) * n); |
| 1065 | } |
| 1066 | |
| 1067 | Py_LOCAL_INLINE(void) |
| 1068 | sortslice_memmove(sortslice *s1, Py_ssize_t i, sortslice *s2, Py_ssize_t j, |
Benjamin Peterson | 9efdcca | 2010-12-03 01:44:10 +0000 | [diff] [blame] | 1069 | Py_ssize_t n) |
| 1070 | { |
Daniel Stutzbach | 9833822 | 2010-12-02 21:55:33 +0000 | [diff] [blame] | 1071 | memmove(&s1->keys[i], &s2->keys[j], sizeof(PyObject *) * n); |
| 1072 | if (s1->values != NULL) |
| 1073 | memmove(&s1->values[i], &s2->values[j], sizeof(PyObject *) * n); |
| 1074 | } |
| 1075 | |
| 1076 | Py_LOCAL_INLINE(void) |
Benjamin Peterson | 9efdcca | 2010-12-03 01:44:10 +0000 | [diff] [blame] | 1077 | sortslice_advance(sortslice *slice, Py_ssize_t n) |
| 1078 | { |
Daniel Stutzbach | 9833822 | 2010-12-02 21:55:33 +0000 | [diff] [blame] | 1079 | slice->keys += n; |
| 1080 | if (slice->values != NULL) |
| 1081 | slice->values += n; |
| 1082 | } |
| 1083 | |
embg | 1e34da4 | 2018-01-28 20:03:23 -0700 | [diff] [blame] | 1084 | /* Comparison function: ms->key_compare, which is set at run-time in |
| 1085 | * listsort_impl to optimize for various special cases. |
Tim Peters | a64dc24 | 2002-08-01 02:13:36 +0000 | [diff] [blame] | 1086 | * Returns -1 on error, 1 if x < y, 0 if x >= y. |
| 1087 | */ |
Guido van Rossum | 3f236de | 1996-12-10 23:55:39 +0000 | [diff] [blame] | 1088 | |
embg | 1e34da4 | 2018-01-28 20:03:23 -0700 | [diff] [blame] | 1089 | #define ISLT(X, Y) (*(ms->key_compare))(X, Y, ms) |
Tim Peters | 66860f6 | 2002-08-04 17:47:26 +0000 | [diff] [blame] | 1090 | |
| 1091 | /* Compare X to Y via "<". Goto "fail" if the comparison raises an |
Tim Peters | a8c974c | 2002-07-19 03:30:57 +0000 | [diff] [blame] | 1092 | error. Else "k" is set to true iff X<Y, and an "if (k)" block is |
| 1093 | started. It makes more sense in context <wink>. X and Y are PyObject*s. |
| 1094 | */ |
Raymond Hettinger | 70b64fc | 2008-01-30 20:15:17 +0000 | [diff] [blame] | 1095 | #define IFLT(X, Y) if ((k = ISLT(X, Y)) < 0) goto fail; \ |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 1096 | if (k) |
Guido van Rossum | 4c4e7df | 1998-06-16 15:18:28 +0000 | [diff] [blame] | 1097 | |
embg | 1e34da4 | 2018-01-28 20:03:23 -0700 | [diff] [blame] | 1098 | /* The maximum number of entries in a MergeState's pending-runs stack. |
| 1099 | * This is enough to sort arrays of size up to about |
| 1100 | * 32 * phi ** MAX_MERGE_PENDING |
| 1101 | * where phi ~= 1.618. 85 is ridiculouslylarge enough, good for an array |
| 1102 | * with 2**64 elements. |
| 1103 | */ |
| 1104 | #define MAX_MERGE_PENDING 85 |
| 1105 | |
| 1106 | /* When we get into galloping mode, we stay there until both runs win less |
| 1107 | * often than MIN_GALLOP consecutive times. See listsort.txt for more info. |
| 1108 | */ |
| 1109 | #define MIN_GALLOP 7 |
| 1110 | |
| 1111 | /* Avoid malloc for small temp arrays. */ |
| 1112 | #define MERGESTATE_TEMP_SIZE 256 |
| 1113 | |
| 1114 | /* One MergeState exists on the stack per invocation of mergesort. It's just |
| 1115 | * a convenient way to pass state around among the helper functions. |
| 1116 | */ |
| 1117 | struct s_slice { |
| 1118 | sortslice base; |
| 1119 | Py_ssize_t len; |
| 1120 | }; |
| 1121 | |
| 1122 | typedef struct s_MergeState MergeState; |
| 1123 | struct s_MergeState { |
| 1124 | /* This controls when we get *into* galloping mode. It's initialized |
| 1125 | * to MIN_GALLOP. merge_lo and merge_hi tend to nudge it higher for |
| 1126 | * random data, and lower for highly structured data. |
| 1127 | */ |
| 1128 | Py_ssize_t min_gallop; |
| 1129 | |
| 1130 | /* 'a' is temp storage to help with merges. It contains room for |
| 1131 | * alloced entries. |
| 1132 | */ |
| 1133 | sortslice a; /* may point to temparray below */ |
| 1134 | Py_ssize_t alloced; |
| 1135 | |
| 1136 | /* A stack of n pending runs yet to be merged. Run #i starts at |
| 1137 | * address base[i] and extends for len[i] elements. It's always |
| 1138 | * true (so long as the indices are in bounds) that |
| 1139 | * |
| 1140 | * pending[i].base + pending[i].len == pending[i+1].base |
| 1141 | * |
| 1142 | * so we could cut the storage for this, but it's a minor amount, |
| 1143 | * and keeping all the info explicit simplifies the code. |
| 1144 | */ |
| 1145 | int n; |
| 1146 | struct s_slice pending[MAX_MERGE_PENDING]; |
| 1147 | |
| 1148 | /* 'a' points to this when possible, rather than muck with malloc. */ |
| 1149 | PyObject *temparray[MERGESTATE_TEMP_SIZE]; |
| 1150 | |
| 1151 | /* This is the function we will use to compare two keys, |
| 1152 | * even when none of our special cases apply and we have to use |
| 1153 | * safe_object_compare. */ |
| 1154 | int (*key_compare)(PyObject *, PyObject *, MergeState *); |
| 1155 | |
| 1156 | /* This function is used by unsafe_object_compare to optimize comparisons |
| 1157 | * when we know our list is type-homogeneous but we can't assume anything else. |
| 1158 | * In the pre-sort check it is set equal to key->ob_type->tp_richcompare */ |
| 1159 | PyObject *(*key_richcompare)(PyObject *, PyObject *, int); |
| 1160 | |
| 1161 | /* This function is used by unsafe_tuple_compare to compare the first elements |
| 1162 | * of tuples. It may be set to safe_object_compare, but the idea is that hopefully |
| 1163 | * we can assume more, and use one of the special-case compares. */ |
| 1164 | int (*tuple_elem_compare)(PyObject *, PyObject *, MergeState *); |
| 1165 | }; |
| 1166 | |
Guido van Rossum | 4c4e7df | 1998-06-16 15:18:28 +0000 | [diff] [blame] | 1167 | /* binarysort is the best method for sorting small arrays: it does |
| 1168 | few compares, but can do data movement quadratic in the number of |
| 1169 | elements. |
Guido van Rossum | 4281258 | 1998-06-17 14:15:44 +0000 | [diff] [blame] | 1170 | [lo, hi) is a contiguous slice of a list, and is sorted via |
Tim Peters | a8c974c | 2002-07-19 03:30:57 +0000 | [diff] [blame] | 1171 | binary insertion. This sort is stable. |
Guido van Rossum | 4c4e7df | 1998-06-16 15:18:28 +0000 | [diff] [blame] | 1172 | On entry, must have lo <= start <= hi, and that [lo, start) is already |
| 1173 | sorted (pass start == lo if you don't know!). |
Tim Peters | a8c974c | 2002-07-19 03:30:57 +0000 | [diff] [blame] | 1174 | If islt() complains return -1, else 0. |
Guido van Rossum | 4c4e7df | 1998-06-16 15:18:28 +0000 | [diff] [blame] | 1175 | Even in case of error, the output slice will be some permutation of |
| 1176 | the input (nothing is lost or duplicated). |
| 1177 | */ |
Guido van Rossum | 3f236de | 1996-12-10 23:55:39 +0000 | [diff] [blame] | 1178 | static int |
embg | 1e34da4 | 2018-01-28 20:03:23 -0700 | [diff] [blame] | 1179 | binarysort(MergeState *ms, sortslice lo, PyObject **hi, PyObject **start) |
Guido van Rossum | 3f236de | 1996-12-10 23:55:39 +0000 | [diff] [blame] | 1180 | { |
Antoine Pitrou | 9ed5f27 | 2013-08-13 20:18:52 +0200 | [diff] [blame] | 1181 | Py_ssize_t k; |
| 1182 | PyObject **l, **p, **r; |
| 1183 | PyObject *pivot; |
Guido van Rossum | 3f236de | 1996-12-10 23:55:39 +0000 | [diff] [blame] | 1184 | |
Daniel Stutzbach | 9833822 | 2010-12-02 21:55:33 +0000 | [diff] [blame] | 1185 | assert(lo.keys <= start && start <= hi); |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 1186 | /* assert [lo, start) is sorted */ |
Daniel Stutzbach | 9833822 | 2010-12-02 21:55:33 +0000 | [diff] [blame] | 1187 | if (lo.keys == start) |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 1188 | ++start; |
| 1189 | for (; start < hi; ++start) { |
| 1190 | /* set l to where *start belongs */ |
Daniel Stutzbach | 9833822 | 2010-12-02 21:55:33 +0000 | [diff] [blame] | 1191 | l = lo.keys; |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 1192 | r = start; |
| 1193 | pivot = *r; |
| 1194 | /* Invariants: |
| 1195 | * pivot >= all in [lo, l). |
| 1196 | * pivot < all in [r, start). |
| 1197 | * The second is vacuously true at the start. |
| 1198 | */ |
| 1199 | assert(l < r); |
| 1200 | do { |
| 1201 | p = l + ((r - l) >> 1); |
| 1202 | IFLT(pivot, *p) |
| 1203 | r = p; |
| 1204 | else |
| 1205 | l = p+1; |
| 1206 | } while (l < r); |
| 1207 | assert(l == r); |
| 1208 | /* The invariants still hold, so pivot >= all in [lo, l) and |
| 1209 | pivot < all in [l, start), so pivot belongs at l. Note |
| 1210 | that if there are elements equal to pivot, l points to the |
| 1211 | first slot after them -- that's why this sort is stable. |
| 1212 | Slide over to make room. |
| 1213 | Caution: using memmove is much slower under MSVC 5; |
| 1214 | we're not usually moving many slots. */ |
| 1215 | for (p = start; p > l; --p) |
| 1216 | *p = *(p-1); |
| 1217 | *l = pivot; |
Daniel Stutzbach | 9833822 | 2010-12-02 21:55:33 +0000 | [diff] [blame] | 1218 | if (lo.values != NULL) { |
| 1219 | Py_ssize_t offset = lo.values - lo.keys; |
| 1220 | p = start + offset; |
| 1221 | pivot = *p; |
| 1222 | l += offset; |
| 1223 | for (p = start + offset; p > l; --p) |
| 1224 | *p = *(p-1); |
| 1225 | *l = pivot; |
| 1226 | } |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 1227 | } |
| 1228 | return 0; |
Guido van Rossum | a119c0d | 1998-05-29 17:56:32 +0000 | [diff] [blame] | 1229 | |
| 1230 | fail: |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 1231 | return -1; |
Guido van Rossum | 4c4e7df | 1998-06-16 15:18:28 +0000 | [diff] [blame] | 1232 | } |
| 1233 | |
Tim Peters | a64dc24 | 2002-08-01 02:13:36 +0000 | [diff] [blame] | 1234 | /* |
| 1235 | Return the length of the run beginning at lo, in the slice [lo, hi). lo < hi |
| 1236 | is required on entry. "A run" is the longest ascending sequence, with |
Guido van Rossum | 4c4e7df | 1998-06-16 15:18:28 +0000 | [diff] [blame] | 1237 | |
Tim Peters | a64dc24 | 2002-08-01 02:13:36 +0000 | [diff] [blame] | 1238 | lo[0] <= lo[1] <= lo[2] <= ... |
Guido van Rossum | 4c4e7df | 1998-06-16 15:18:28 +0000 | [diff] [blame] | 1239 | |
Tim Peters | a64dc24 | 2002-08-01 02:13:36 +0000 | [diff] [blame] | 1240 | or the longest descending sequence, with |
Guido van Rossum | 4c4e7df | 1998-06-16 15:18:28 +0000 | [diff] [blame] | 1241 | |
Tim Peters | a64dc24 | 2002-08-01 02:13:36 +0000 | [diff] [blame] | 1242 | lo[0] > lo[1] > lo[2] > ... |
Tim Peters | 3b01a12 | 2002-07-19 02:35:45 +0000 | [diff] [blame] | 1243 | |
Tim Peters | a64dc24 | 2002-08-01 02:13:36 +0000 | [diff] [blame] | 1244 | Boolean *descending is set to 0 in the former case, or to 1 in the latter. |
| 1245 | For its intended use in a stable mergesort, the strictness of the defn of |
| 1246 | "descending" is needed so that the caller can safely reverse a descending |
| 1247 | sequence without violating stability (strict > ensures there are no equal |
| 1248 | elements to get out of order). |
| 1249 | |
| 1250 | Returns -1 in case of error. |
Guido van Rossum | 4c4e7df | 1998-06-16 15:18:28 +0000 | [diff] [blame] | 1251 | */ |
Martin v. Löwis | 18e1655 | 2006-02-15 17:27:45 +0000 | [diff] [blame] | 1252 | static Py_ssize_t |
embg | 1e34da4 | 2018-01-28 20:03:23 -0700 | [diff] [blame] | 1253 | count_run(MergeState *ms, PyObject **lo, PyObject **hi, int *descending) |
Guido van Rossum | 4c4e7df | 1998-06-16 15:18:28 +0000 | [diff] [blame] | 1254 | { |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 1255 | Py_ssize_t k; |
| 1256 | Py_ssize_t n; |
Guido van Rossum | 4c4e7df | 1998-06-16 15:18:28 +0000 | [diff] [blame] | 1257 | |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 1258 | assert(lo < hi); |
| 1259 | *descending = 0; |
| 1260 | ++lo; |
| 1261 | if (lo == hi) |
| 1262 | return 1; |
Guido van Rossum | 4c4e7df | 1998-06-16 15:18:28 +0000 | [diff] [blame] | 1263 | |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 1264 | n = 2; |
| 1265 | IFLT(*lo, *(lo-1)) { |
| 1266 | *descending = 1; |
| 1267 | for (lo = lo+1; lo < hi; ++lo, ++n) { |
| 1268 | IFLT(*lo, *(lo-1)) |
| 1269 | ; |
| 1270 | else |
| 1271 | break; |
| 1272 | } |
| 1273 | } |
| 1274 | else { |
| 1275 | for (lo = lo+1; lo < hi; ++lo, ++n) { |
| 1276 | IFLT(*lo, *(lo-1)) |
| 1277 | break; |
| 1278 | } |
| 1279 | } |
Guido van Rossum | 4c4e7df | 1998-06-16 15:18:28 +0000 | [diff] [blame] | 1280 | |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 1281 | return n; |
Tim Peters | a64dc24 | 2002-08-01 02:13:36 +0000 | [diff] [blame] | 1282 | fail: |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 1283 | return -1; |
Tim Peters | a64dc24 | 2002-08-01 02:13:36 +0000 | [diff] [blame] | 1284 | } |
Guido van Rossum | 4c4e7df | 1998-06-16 15:18:28 +0000 | [diff] [blame] | 1285 | |
Tim Peters | a64dc24 | 2002-08-01 02:13:36 +0000 | [diff] [blame] | 1286 | /* |
| 1287 | Locate the proper position of key in a sorted vector; if the vector contains |
| 1288 | an element equal to key, return the position immediately to the left of |
| 1289 | the leftmost equal element. [gallop_right() does the same except returns |
| 1290 | the position to the right of the rightmost equal element (if any).] |
Guido van Rossum | 4c4e7df | 1998-06-16 15:18:28 +0000 | [diff] [blame] | 1291 | |
Tim Peters | a64dc24 | 2002-08-01 02:13:36 +0000 | [diff] [blame] | 1292 | "a" is a sorted vector with n elements, starting at a[0]. n must be > 0. |
Guido van Rossum | 4c4e7df | 1998-06-16 15:18:28 +0000 | [diff] [blame] | 1293 | |
Tim Peters | a64dc24 | 2002-08-01 02:13:36 +0000 | [diff] [blame] | 1294 | "hint" is an index at which to begin the search, 0 <= hint < n. The closer |
| 1295 | hint is to the final result, the faster this runs. |
| 1296 | |
| 1297 | The return value is the int k in 0..n such that |
| 1298 | |
| 1299 | a[k-1] < key <= a[k] |
| 1300 | |
| 1301 | pretending that *(a-1) is minus infinity and a[n] is plus infinity. IOW, |
| 1302 | key belongs at index k; or, IOW, the first k elements of a should precede |
| 1303 | key, and the last n-k should follow key. |
| 1304 | |
| 1305 | Returns -1 on error. See listsort.txt for info on the method. |
| 1306 | */ |
Martin v. Löwis | 18e1655 | 2006-02-15 17:27:45 +0000 | [diff] [blame] | 1307 | static Py_ssize_t |
embg | 1e34da4 | 2018-01-28 20:03:23 -0700 | [diff] [blame] | 1308 | gallop_left(MergeState *ms, PyObject *key, PyObject **a, Py_ssize_t n, Py_ssize_t hint) |
Tim Peters | a64dc24 | 2002-08-01 02:13:36 +0000 | [diff] [blame] | 1309 | { |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 1310 | Py_ssize_t ofs; |
| 1311 | Py_ssize_t lastofs; |
| 1312 | Py_ssize_t k; |
Tim Peters | a64dc24 | 2002-08-01 02:13:36 +0000 | [diff] [blame] | 1313 | |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 1314 | assert(key && a && n > 0 && hint >= 0 && hint < n); |
Tim Peters | a64dc24 | 2002-08-01 02:13:36 +0000 | [diff] [blame] | 1315 | |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 1316 | a += hint; |
| 1317 | lastofs = 0; |
| 1318 | ofs = 1; |
| 1319 | IFLT(*a, key) { |
| 1320 | /* a[hint] < key -- gallop right, until |
| 1321 | * a[hint + lastofs] < key <= a[hint + ofs] |
| 1322 | */ |
| 1323 | const Py_ssize_t maxofs = n - hint; /* &a[n-1] is highest */ |
| 1324 | while (ofs < maxofs) { |
| 1325 | IFLT(a[ofs], key) { |
| 1326 | lastofs = ofs; |
| 1327 | ofs = (ofs << 1) + 1; |
| 1328 | if (ofs <= 0) /* int overflow */ |
| 1329 | ofs = maxofs; |
| 1330 | } |
| 1331 | else /* key <= a[hint + ofs] */ |
| 1332 | break; |
| 1333 | } |
| 1334 | if (ofs > maxofs) |
| 1335 | ofs = maxofs; |
| 1336 | /* Translate back to offsets relative to &a[0]. */ |
| 1337 | lastofs += hint; |
| 1338 | ofs += hint; |
| 1339 | } |
| 1340 | else { |
| 1341 | /* key <= a[hint] -- gallop left, until |
| 1342 | * a[hint - ofs] < key <= a[hint - lastofs] |
| 1343 | */ |
| 1344 | const Py_ssize_t maxofs = hint + 1; /* &a[0] is lowest */ |
| 1345 | while (ofs < maxofs) { |
| 1346 | IFLT(*(a-ofs), key) |
| 1347 | break; |
| 1348 | /* key <= a[hint - ofs] */ |
| 1349 | lastofs = ofs; |
| 1350 | ofs = (ofs << 1) + 1; |
| 1351 | if (ofs <= 0) /* int overflow */ |
| 1352 | ofs = maxofs; |
| 1353 | } |
| 1354 | if (ofs > maxofs) |
| 1355 | ofs = maxofs; |
| 1356 | /* Translate back to positive offsets relative to &a[0]. */ |
| 1357 | k = lastofs; |
| 1358 | lastofs = hint - ofs; |
| 1359 | ofs = hint - k; |
| 1360 | } |
| 1361 | a -= hint; |
Tim Peters | a64dc24 | 2002-08-01 02:13:36 +0000 | [diff] [blame] | 1362 | |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 1363 | assert(-1 <= lastofs && lastofs < ofs && ofs <= n); |
| 1364 | /* Now a[lastofs] < key <= a[ofs], so key belongs somewhere to the |
| 1365 | * right of lastofs but no farther right than ofs. Do a binary |
| 1366 | * search, with invariant a[lastofs-1] < key <= a[ofs]. |
| 1367 | */ |
| 1368 | ++lastofs; |
| 1369 | while (lastofs < ofs) { |
| 1370 | Py_ssize_t m = lastofs + ((ofs - lastofs) >> 1); |
Tim Peters | a64dc24 | 2002-08-01 02:13:36 +0000 | [diff] [blame] | 1371 | |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 1372 | IFLT(a[m], key) |
| 1373 | lastofs = m+1; /* a[m] < key */ |
| 1374 | else |
| 1375 | ofs = m; /* key <= a[m] */ |
| 1376 | } |
| 1377 | assert(lastofs == ofs); /* so a[ofs-1] < key <= a[ofs] */ |
| 1378 | return ofs; |
Tim Peters | a64dc24 | 2002-08-01 02:13:36 +0000 | [diff] [blame] | 1379 | |
| 1380 | fail: |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 1381 | return -1; |
Tim Peters | a64dc24 | 2002-08-01 02:13:36 +0000 | [diff] [blame] | 1382 | } |
| 1383 | |
| 1384 | /* |
| 1385 | Exactly like gallop_left(), except that if key already exists in a[0:n], |
| 1386 | finds the position immediately to the right of the rightmost equal value. |
| 1387 | |
| 1388 | The return value is the int k in 0..n such that |
| 1389 | |
| 1390 | a[k-1] <= key < a[k] |
| 1391 | |
| 1392 | or -1 if error. |
| 1393 | |
| 1394 | The code duplication is massive, but this is enough different given that |
| 1395 | we're sticking to "<" comparisons that it's much harder to follow if |
| 1396 | written as one routine with yet another "left or right?" flag. |
| 1397 | */ |
Martin v. Löwis | 18e1655 | 2006-02-15 17:27:45 +0000 | [diff] [blame] | 1398 | static Py_ssize_t |
embg | 1e34da4 | 2018-01-28 20:03:23 -0700 | [diff] [blame] | 1399 | gallop_right(MergeState *ms, PyObject *key, PyObject **a, Py_ssize_t n, Py_ssize_t hint) |
Tim Peters | a64dc24 | 2002-08-01 02:13:36 +0000 | [diff] [blame] | 1400 | { |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 1401 | Py_ssize_t ofs; |
| 1402 | Py_ssize_t lastofs; |
| 1403 | Py_ssize_t k; |
Tim Peters | a64dc24 | 2002-08-01 02:13:36 +0000 | [diff] [blame] | 1404 | |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 1405 | assert(key && a && n > 0 && hint >= 0 && hint < n); |
Tim Peters | a64dc24 | 2002-08-01 02:13:36 +0000 | [diff] [blame] | 1406 | |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 1407 | a += hint; |
| 1408 | lastofs = 0; |
| 1409 | ofs = 1; |
| 1410 | IFLT(key, *a) { |
| 1411 | /* key < a[hint] -- gallop left, until |
| 1412 | * a[hint - ofs] <= key < a[hint - lastofs] |
| 1413 | */ |
| 1414 | const Py_ssize_t maxofs = hint + 1; /* &a[0] is lowest */ |
| 1415 | while (ofs < maxofs) { |
| 1416 | IFLT(key, *(a-ofs)) { |
| 1417 | lastofs = ofs; |
| 1418 | ofs = (ofs << 1) + 1; |
| 1419 | if (ofs <= 0) /* int overflow */ |
| 1420 | ofs = maxofs; |
| 1421 | } |
| 1422 | else /* a[hint - ofs] <= key */ |
| 1423 | break; |
| 1424 | } |
| 1425 | if (ofs > maxofs) |
| 1426 | ofs = maxofs; |
| 1427 | /* Translate back to positive offsets relative to &a[0]. */ |
| 1428 | k = lastofs; |
| 1429 | lastofs = hint - ofs; |
| 1430 | ofs = hint - k; |
| 1431 | } |
| 1432 | else { |
| 1433 | /* a[hint] <= key -- gallop right, until |
| 1434 | * a[hint + lastofs] <= key < a[hint + ofs] |
| 1435 | */ |
| 1436 | const Py_ssize_t maxofs = n - hint; /* &a[n-1] is highest */ |
| 1437 | while (ofs < maxofs) { |
| 1438 | IFLT(key, a[ofs]) |
| 1439 | break; |
| 1440 | /* a[hint + ofs] <= key */ |
| 1441 | lastofs = ofs; |
| 1442 | ofs = (ofs << 1) + 1; |
| 1443 | if (ofs <= 0) /* int overflow */ |
| 1444 | ofs = maxofs; |
| 1445 | } |
| 1446 | if (ofs > maxofs) |
| 1447 | ofs = maxofs; |
| 1448 | /* Translate back to offsets relative to &a[0]. */ |
| 1449 | lastofs += hint; |
| 1450 | ofs += hint; |
| 1451 | } |
| 1452 | a -= hint; |
Tim Peters | a64dc24 | 2002-08-01 02:13:36 +0000 | [diff] [blame] | 1453 | |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 1454 | assert(-1 <= lastofs && lastofs < ofs && ofs <= n); |
| 1455 | /* Now a[lastofs] <= key < a[ofs], so key belongs somewhere to the |
| 1456 | * right of lastofs but no farther right than ofs. Do a binary |
| 1457 | * search, with invariant a[lastofs-1] <= key < a[ofs]. |
| 1458 | */ |
| 1459 | ++lastofs; |
| 1460 | while (lastofs < ofs) { |
| 1461 | Py_ssize_t m = lastofs + ((ofs - lastofs) >> 1); |
Tim Peters | a64dc24 | 2002-08-01 02:13:36 +0000 | [diff] [blame] | 1462 | |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 1463 | IFLT(key, a[m]) |
| 1464 | ofs = m; /* key < a[m] */ |
| 1465 | else |
| 1466 | lastofs = m+1; /* a[m] <= key */ |
| 1467 | } |
| 1468 | assert(lastofs == ofs); /* so a[ofs-1] <= key < a[ofs] */ |
| 1469 | return ofs; |
Tim Peters | a64dc24 | 2002-08-01 02:13:36 +0000 | [diff] [blame] | 1470 | |
| 1471 | fail: |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 1472 | return -1; |
Tim Peters | a64dc24 | 2002-08-01 02:13:36 +0000 | [diff] [blame] | 1473 | } |
| 1474 | |
Tim Peters | a64dc24 | 2002-08-01 02:13:36 +0000 | [diff] [blame] | 1475 | /* Conceptually a MergeState's constructor. */ |
| 1476 | static void |
Victor Stinner | 0fcab4a | 2011-01-04 12:59:15 +0000 | [diff] [blame] | 1477 | merge_init(MergeState *ms, Py_ssize_t list_size, int has_keyfunc) |
Tim Peters | a64dc24 | 2002-08-01 02:13:36 +0000 | [diff] [blame] | 1478 | { |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 1479 | assert(ms != NULL); |
Daniel Stutzbach | 9833822 | 2010-12-02 21:55:33 +0000 | [diff] [blame] | 1480 | if (has_keyfunc) { |
| 1481 | /* The temporary space for merging will need at most half the list |
| 1482 | * size rounded up. Use the minimum possible space so we can use the |
| 1483 | * rest of temparray for other things. In particular, if there is |
| 1484 | * enough extra space, listsort() will use it to store the keys. |
| 1485 | */ |
| 1486 | ms->alloced = (list_size + 1) / 2; |
| 1487 | |
| 1488 | /* ms->alloced describes how many keys will be stored at |
| 1489 | ms->temparray, but we also need to store the values. Hence, |
| 1490 | ms->alloced is capped at half of MERGESTATE_TEMP_SIZE. */ |
| 1491 | if (MERGESTATE_TEMP_SIZE / 2 < ms->alloced) |
| 1492 | ms->alloced = MERGESTATE_TEMP_SIZE / 2; |
| 1493 | ms->a.values = &ms->temparray[ms->alloced]; |
| 1494 | } |
| 1495 | else { |
| 1496 | ms->alloced = MERGESTATE_TEMP_SIZE; |
| 1497 | ms->a.values = NULL; |
| 1498 | } |
| 1499 | ms->a.keys = ms->temparray; |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 1500 | ms->n = 0; |
| 1501 | ms->min_gallop = MIN_GALLOP; |
Tim Peters | a64dc24 | 2002-08-01 02:13:36 +0000 | [diff] [blame] | 1502 | } |
| 1503 | |
| 1504 | /* Free all the temp memory owned by the MergeState. This must be called |
| 1505 | * when you're done with a MergeState, and may be called before then if |
| 1506 | * you want to free the temp memory early. |
| 1507 | */ |
| 1508 | static void |
| 1509 | merge_freemem(MergeState *ms) |
| 1510 | { |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 1511 | assert(ms != NULL); |
Daniel Stutzbach | 9833822 | 2010-12-02 21:55:33 +0000 | [diff] [blame] | 1512 | if (ms->a.keys != ms->temparray) |
| 1513 | PyMem_Free(ms->a.keys); |
Tim Peters | a64dc24 | 2002-08-01 02:13:36 +0000 | [diff] [blame] | 1514 | } |
| 1515 | |
| 1516 | /* Ensure enough temp memory for 'need' array slots is available. |
| 1517 | * Returns 0 on success and -1 if the memory can't be gotten. |
| 1518 | */ |
| 1519 | static int |
Martin v. Löwis | 18e1655 | 2006-02-15 17:27:45 +0000 | [diff] [blame] | 1520 | merge_getmem(MergeState *ms, Py_ssize_t need) |
Tim Peters | a64dc24 | 2002-08-01 02:13:36 +0000 | [diff] [blame] | 1521 | { |
Daniel Stutzbach | 9833822 | 2010-12-02 21:55:33 +0000 | [diff] [blame] | 1522 | int multiplier; |
| 1523 | |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 1524 | assert(ms != NULL); |
| 1525 | if (need <= ms->alloced) |
| 1526 | return 0; |
Daniel Stutzbach | 9833822 | 2010-12-02 21:55:33 +0000 | [diff] [blame] | 1527 | |
| 1528 | multiplier = ms->a.values != NULL ? 2 : 1; |
| 1529 | |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 1530 | /* Don't realloc! That can cost cycles to copy the old data, but |
| 1531 | * we don't care what's in the block. |
| 1532 | */ |
| 1533 | merge_freemem(ms); |
embg | 1e34da4 | 2018-01-28 20:03:23 -0700 | [diff] [blame] | 1534 | if ((size_t)need > PY_SSIZE_T_MAX / sizeof(PyObject *) / multiplier) { |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 1535 | PyErr_NoMemory(); |
| 1536 | return -1; |
| 1537 | } |
embg | 1e34da4 | 2018-01-28 20:03:23 -0700 | [diff] [blame] | 1538 | ms->a.keys = (PyObject **)PyMem_Malloc(multiplier * need |
Daniel Stutzbach | 9833822 | 2010-12-02 21:55:33 +0000 | [diff] [blame] | 1539 | * sizeof(PyObject *)); |
| 1540 | if (ms->a.keys != NULL) { |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 1541 | ms->alloced = need; |
Daniel Stutzbach | 9833822 | 2010-12-02 21:55:33 +0000 | [diff] [blame] | 1542 | if (ms->a.values != NULL) |
| 1543 | ms->a.values = &ms->a.keys[need]; |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 1544 | return 0; |
| 1545 | } |
| 1546 | PyErr_NoMemory(); |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 1547 | return -1; |
Tim Peters | a64dc24 | 2002-08-01 02:13:36 +0000 | [diff] [blame] | 1548 | } |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 1549 | #define MERGE_GETMEM(MS, NEED) ((NEED) <= (MS)->alloced ? 0 : \ |
| 1550 | merge_getmem(MS, NEED)) |
Tim Peters | a64dc24 | 2002-08-01 02:13:36 +0000 | [diff] [blame] | 1551 | |
Daniel Stutzbach | 9833822 | 2010-12-02 21:55:33 +0000 | [diff] [blame] | 1552 | /* Merge the na elements starting at ssa with the nb elements starting at |
| 1553 | * ssb.keys = ssa.keys + na in a stable way, in-place. na and nb must be > 0. |
| 1554 | * Must also have that ssa.keys[na-1] belongs at the end of the merge, and |
| 1555 | * should have na <= nb. See listsort.txt for more info. Return 0 if |
| 1556 | * successful, -1 if error. |
Tim Peters | a64dc24 | 2002-08-01 02:13:36 +0000 | [diff] [blame] | 1557 | */ |
Martin v. Löwis | 18e1655 | 2006-02-15 17:27:45 +0000 | [diff] [blame] | 1558 | static Py_ssize_t |
Daniel Stutzbach | 9833822 | 2010-12-02 21:55:33 +0000 | [diff] [blame] | 1559 | merge_lo(MergeState *ms, sortslice ssa, Py_ssize_t na, |
| 1560 | sortslice ssb, Py_ssize_t nb) |
Tim Peters | a64dc24 | 2002-08-01 02:13:36 +0000 | [diff] [blame] | 1561 | { |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 1562 | Py_ssize_t k; |
Daniel Stutzbach | 9833822 | 2010-12-02 21:55:33 +0000 | [diff] [blame] | 1563 | sortslice dest; |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 1564 | int result = -1; /* guilty until proved innocent */ |
| 1565 | Py_ssize_t min_gallop; |
Tim Peters | a64dc24 | 2002-08-01 02:13:36 +0000 | [diff] [blame] | 1566 | |
Daniel Stutzbach | 9833822 | 2010-12-02 21:55:33 +0000 | [diff] [blame] | 1567 | assert(ms && ssa.keys && ssb.keys && na > 0 && nb > 0); |
| 1568 | assert(ssa.keys + na == ssb.keys); |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 1569 | if (MERGE_GETMEM(ms, na) < 0) |
| 1570 | return -1; |
Daniel Stutzbach | 9833822 | 2010-12-02 21:55:33 +0000 | [diff] [blame] | 1571 | sortslice_memcpy(&ms->a, 0, &ssa, 0, na); |
| 1572 | dest = ssa; |
| 1573 | ssa = ms->a; |
Tim Peters | a64dc24 | 2002-08-01 02:13:36 +0000 | [diff] [blame] | 1574 | |
Daniel Stutzbach | 9833822 | 2010-12-02 21:55:33 +0000 | [diff] [blame] | 1575 | sortslice_copy_incr(&dest, &ssb); |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 1576 | --nb; |
| 1577 | if (nb == 0) |
| 1578 | goto Succeed; |
| 1579 | if (na == 1) |
| 1580 | goto CopyB; |
Tim Peters | a64dc24 | 2002-08-01 02:13:36 +0000 | [diff] [blame] | 1581 | |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 1582 | min_gallop = ms->min_gallop; |
| 1583 | for (;;) { |
| 1584 | Py_ssize_t acount = 0; /* # of times A won in a row */ |
| 1585 | Py_ssize_t bcount = 0; /* # of times B won in a row */ |
Tim Peters | a64dc24 | 2002-08-01 02:13:36 +0000 | [diff] [blame] | 1586 | |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 1587 | /* Do the straightforward thing until (if ever) one run |
| 1588 | * appears to win consistently. |
| 1589 | */ |
| 1590 | for (;;) { |
| 1591 | assert(na > 1 && nb > 0); |
Daniel Stutzbach | 9833822 | 2010-12-02 21:55:33 +0000 | [diff] [blame] | 1592 | k = ISLT(ssb.keys[0], ssa.keys[0]); |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 1593 | if (k) { |
| 1594 | if (k < 0) |
| 1595 | goto Fail; |
Daniel Stutzbach | 9833822 | 2010-12-02 21:55:33 +0000 | [diff] [blame] | 1596 | sortslice_copy_incr(&dest, &ssb); |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 1597 | ++bcount; |
| 1598 | acount = 0; |
| 1599 | --nb; |
| 1600 | if (nb == 0) |
| 1601 | goto Succeed; |
| 1602 | if (bcount >= min_gallop) |
| 1603 | break; |
| 1604 | } |
| 1605 | else { |
Daniel Stutzbach | 9833822 | 2010-12-02 21:55:33 +0000 | [diff] [blame] | 1606 | sortslice_copy_incr(&dest, &ssa); |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 1607 | ++acount; |
| 1608 | bcount = 0; |
| 1609 | --na; |
| 1610 | if (na == 1) |
| 1611 | goto CopyB; |
| 1612 | if (acount >= min_gallop) |
| 1613 | break; |
| 1614 | } |
| 1615 | } |
Guido van Rossum | 4c4e7df | 1998-06-16 15:18:28 +0000 | [diff] [blame] | 1616 | |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 1617 | /* One run is winning so consistently that galloping may |
| 1618 | * be a huge win. So try that, and continue galloping until |
| 1619 | * (if ever) neither run appears to be winning consistently |
| 1620 | * anymore. |
| 1621 | */ |
| 1622 | ++min_gallop; |
| 1623 | do { |
| 1624 | assert(na > 1 && nb > 0); |
| 1625 | min_gallop -= min_gallop > 1; |
| 1626 | ms->min_gallop = min_gallop; |
embg | 1e34da4 | 2018-01-28 20:03:23 -0700 | [diff] [blame] | 1627 | k = gallop_right(ms, ssb.keys[0], ssa.keys, na, 0); |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 1628 | acount = k; |
| 1629 | if (k) { |
| 1630 | if (k < 0) |
| 1631 | goto Fail; |
Daniel Stutzbach | 9833822 | 2010-12-02 21:55:33 +0000 | [diff] [blame] | 1632 | sortslice_memcpy(&dest, 0, &ssa, 0, k); |
| 1633 | sortslice_advance(&dest, k); |
| 1634 | sortslice_advance(&ssa, k); |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 1635 | na -= k; |
| 1636 | if (na == 1) |
| 1637 | goto CopyB; |
| 1638 | /* na==0 is impossible now if the comparison |
| 1639 | * function is consistent, but we can't assume |
| 1640 | * that it is. |
| 1641 | */ |
| 1642 | if (na == 0) |
| 1643 | goto Succeed; |
| 1644 | } |
Daniel Stutzbach | 9833822 | 2010-12-02 21:55:33 +0000 | [diff] [blame] | 1645 | sortslice_copy_incr(&dest, &ssb); |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 1646 | --nb; |
| 1647 | if (nb == 0) |
| 1648 | goto Succeed; |
Guido van Rossum | 4c4e7df | 1998-06-16 15:18:28 +0000 | [diff] [blame] | 1649 | |
embg | 1e34da4 | 2018-01-28 20:03:23 -0700 | [diff] [blame] | 1650 | k = gallop_left(ms, ssa.keys[0], ssb.keys, nb, 0); |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 1651 | bcount = k; |
| 1652 | if (k) { |
| 1653 | if (k < 0) |
| 1654 | goto Fail; |
Daniel Stutzbach | 9833822 | 2010-12-02 21:55:33 +0000 | [diff] [blame] | 1655 | sortslice_memmove(&dest, 0, &ssb, 0, k); |
| 1656 | sortslice_advance(&dest, k); |
| 1657 | sortslice_advance(&ssb, k); |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 1658 | nb -= k; |
| 1659 | if (nb == 0) |
| 1660 | goto Succeed; |
| 1661 | } |
Daniel Stutzbach | 9833822 | 2010-12-02 21:55:33 +0000 | [diff] [blame] | 1662 | sortslice_copy_incr(&dest, &ssa); |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 1663 | --na; |
| 1664 | if (na == 1) |
| 1665 | goto CopyB; |
| 1666 | } while (acount >= MIN_GALLOP || bcount >= MIN_GALLOP); |
| 1667 | ++min_gallop; /* penalize it for leaving galloping mode */ |
| 1668 | ms->min_gallop = min_gallop; |
| 1669 | } |
Tim Peters | a64dc24 | 2002-08-01 02:13:36 +0000 | [diff] [blame] | 1670 | Succeed: |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 1671 | result = 0; |
Tim Peters | a64dc24 | 2002-08-01 02:13:36 +0000 | [diff] [blame] | 1672 | Fail: |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 1673 | if (na) |
Daniel Stutzbach | 9833822 | 2010-12-02 21:55:33 +0000 | [diff] [blame] | 1674 | sortslice_memcpy(&dest, 0, &ssa, 0, na); |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 1675 | return result; |
Tim Peters | a64dc24 | 2002-08-01 02:13:36 +0000 | [diff] [blame] | 1676 | CopyB: |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 1677 | assert(na == 1 && nb > 0); |
Daniel Stutzbach | 9833822 | 2010-12-02 21:55:33 +0000 | [diff] [blame] | 1678 | /* The last element of ssa belongs at the end of the merge. */ |
| 1679 | sortslice_memmove(&dest, 0, &ssb, 0, nb); |
| 1680 | sortslice_copy(&dest, nb, &ssa, 0); |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 1681 | return 0; |
Tim Peters | a64dc24 | 2002-08-01 02:13:36 +0000 | [diff] [blame] | 1682 | } |
Guido van Rossum | 4c4e7df | 1998-06-16 15:18:28 +0000 | [diff] [blame] | 1683 | |
Daniel Stutzbach | 9833822 | 2010-12-02 21:55:33 +0000 | [diff] [blame] | 1684 | /* Merge the na elements starting at pa with the nb elements starting at |
| 1685 | * ssb.keys = ssa.keys + na in a stable way, in-place. na and nb must be > 0. |
| 1686 | * Must also have that ssa.keys[na-1] belongs at the end of the merge, and |
| 1687 | * should have na >= nb. See listsort.txt for more info. Return 0 if |
| 1688 | * successful, -1 if error. |
Tim Peters | a64dc24 | 2002-08-01 02:13:36 +0000 | [diff] [blame] | 1689 | */ |
Martin v. Löwis | 18e1655 | 2006-02-15 17:27:45 +0000 | [diff] [blame] | 1690 | static Py_ssize_t |
Daniel Stutzbach | 9833822 | 2010-12-02 21:55:33 +0000 | [diff] [blame] | 1691 | merge_hi(MergeState *ms, sortslice ssa, Py_ssize_t na, |
| 1692 | sortslice ssb, Py_ssize_t nb) |
Tim Peters | a64dc24 | 2002-08-01 02:13:36 +0000 | [diff] [blame] | 1693 | { |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 1694 | Py_ssize_t k; |
Daniel Stutzbach | 9833822 | 2010-12-02 21:55:33 +0000 | [diff] [blame] | 1695 | sortslice dest, basea, baseb; |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 1696 | int result = -1; /* guilty until proved innocent */ |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 1697 | Py_ssize_t min_gallop; |
Tim Peters | a64dc24 | 2002-08-01 02:13:36 +0000 | [diff] [blame] | 1698 | |
Daniel Stutzbach | 9833822 | 2010-12-02 21:55:33 +0000 | [diff] [blame] | 1699 | assert(ms && ssa.keys && ssb.keys && na > 0 && nb > 0); |
| 1700 | assert(ssa.keys + na == ssb.keys); |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 1701 | if (MERGE_GETMEM(ms, nb) < 0) |
| 1702 | return -1; |
Daniel Stutzbach | 9833822 | 2010-12-02 21:55:33 +0000 | [diff] [blame] | 1703 | dest = ssb; |
| 1704 | sortslice_advance(&dest, nb-1); |
| 1705 | sortslice_memcpy(&ms->a, 0, &ssb, 0, nb); |
| 1706 | basea = ssa; |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 1707 | baseb = ms->a; |
Daniel Stutzbach | 9833822 | 2010-12-02 21:55:33 +0000 | [diff] [blame] | 1708 | ssb.keys = ms->a.keys + nb - 1; |
| 1709 | if (ssb.values != NULL) |
| 1710 | ssb.values = ms->a.values + nb - 1; |
| 1711 | sortslice_advance(&ssa, na - 1); |
Tim Peters | a64dc24 | 2002-08-01 02:13:36 +0000 | [diff] [blame] | 1712 | |
Daniel Stutzbach | 9833822 | 2010-12-02 21:55:33 +0000 | [diff] [blame] | 1713 | sortslice_copy_decr(&dest, &ssa); |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 1714 | --na; |
| 1715 | if (na == 0) |
| 1716 | goto Succeed; |
| 1717 | if (nb == 1) |
| 1718 | goto CopyA; |
Tim Peters | a64dc24 | 2002-08-01 02:13:36 +0000 | [diff] [blame] | 1719 | |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 1720 | min_gallop = ms->min_gallop; |
| 1721 | for (;;) { |
| 1722 | Py_ssize_t acount = 0; /* # of times A won in a row */ |
| 1723 | Py_ssize_t bcount = 0; /* # of times B won in a row */ |
Tim Peters | a64dc24 | 2002-08-01 02:13:36 +0000 | [diff] [blame] | 1724 | |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 1725 | /* Do the straightforward thing until (if ever) one run |
| 1726 | * appears to win consistently. |
| 1727 | */ |
| 1728 | for (;;) { |
| 1729 | assert(na > 0 && nb > 1); |
Daniel Stutzbach | 9833822 | 2010-12-02 21:55:33 +0000 | [diff] [blame] | 1730 | k = ISLT(ssb.keys[0], ssa.keys[0]); |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 1731 | if (k) { |
| 1732 | if (k < 0) |
| 1733 | goto Fail; |
Daniel Stutzbach | 9833822 | 2010-12-02 21:55:33 +0000 | [diff] [blame] | 1734 | sortslice_copy_decr(&dest, &ssa); |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 1735 | ++acount; |
| 1736 | bcount = 0; |
| 1737 | --na; |
| 1738 | if (na == 0) |
| 1739 | goto Succeed; |
| 1740 | if (acount >= min_gallop) |
| 1741 | break; |
| 1742 | } |
| 1743 | else { |
Daniel Stutzbach | 9833822 | 2010-12-02 21:55:33 +0000 | [diff] [blame] | 1744 | sortslice_copy_decr(&dest, &ssb); |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 1745 | ++bcount; |
| 1746 | acount = 0; |
| 1747 | --nb; |
| 1748 | if (nb == 1) |
| 1749 | goto CopyA; |
| 1750 | if (bcount >= min_gallop) |
| 1751 | break; |
| 1752 | } |
| 1753 | } |
Tim Peters | a64dc24 | 2002-08-01 02:13:36 +0000 | [diff] [blame] | 1754 | |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 1755 | /* One run is winning so consistently that galloping may |
| 1756 | * be a huge win. So try that, and continue galloping until |
| 1757 | * (if ever) neither run appears to be winning consistently |
| 1758 | * anymore. |
| 1759 | */ |
| 1760 | ++min_gallop; |
| 1761 | do { |
| 1762 | assert(na > 0 && nb > 1); |
| 1763 | min_gallop -= min_gallop > 1; |
| 1764 | ms->min_gallop = min_gallop; |
embg | 1e34da4 | 2018-01-28 20:03:23 -0700 | [diff] [blame] | 1765 | k = gallop_right(ms, ssb.keys[0], basea.keys, na, na-1); |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 1766 | if (k < 0) |
| 1767 | goto Fail; |
| 1768 | k = na - k; |
| 1769 | acount = k; |
| 1770 | if (k) { |
Daniel Stutzbach | 9833822 | 2010-12-02 21:55:33 +0000 | [diff] [blame] | 1771 | sortslice_advance(&dest, -k); |
| 1772 | sortslice_advance(&ssa, -k); |
| 1773 | sortslice_memmove(&dest, 1, &ssa, 1, k); |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 1774 | na -= k; |
| 1775 | if (na == 0) |
| 1776 | goto Succeed; |
| 1777 | } |
Daniel Stutzbach | 9833822 | 2010-12-02 21:55:33 +0000 | [diff] [blame] | 1778 | sortslice_copy_decr(&dest, &ssb); |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 1779 | --nb; |
| 1780 | if (nb == 1) |
| 1781 | goto CopyA; |
Tim Peters | a64dc24 | 2002-08-01 02:13:36 +0000 | [diff] [blame] | 1782 | |
embg | 1e34da4 | 2018-01-28 20:03:23 -0700 | [diff] [blame] | 1783 | k = gallop_left(ms, ssa.keys[0], baseb.keys, nb, nb-1); |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 1784 | if (k < 0) |
| 1785 | goto Fail; |
| 1786 | k = nb - k; |
| 1787 | bcount = k; |
| 1788 | if (k) { |
Daniel Stutzbach | 9833822 | 2010-12-02 21:55:33 +0000 | [diff] [blame] | 1789 | sortslice_advance(&dest, -k); |
| 1790 | sortslice_advance(&ssb, -k); |
| 1791 | sortslice_memcpy(&dest, 1, &ssb, 1, k); |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 1792 | nb -= k; |
| 1793 | if (nb == 1) |
| 1794 | goto CopyA; |
| 1795 | /* nb==0 is impossible now if the comparison |
| 1796 | * function is consistent, but we can't assume |
| 1797 | * that it is. |
| 1798 | */ |
| 1799 | if (nb == 0) |
| 1800 | goto Succeed; |
| 1801 | } |
Daniel Stutzbach | 9833822 | 2010-12-02 21:55:33 +0000 | [diff] [blame] | 1802 | sortslice_copy_decr(&dest, &ssa); |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 1803 | --na; |
| 1804 | if (na == 0) |
| 1805 | goto Succeed; |
| 1806 | } while (acount >= MIN_GALLOP || bcount >= MIN_GALLOP); |
| 1807 | ++min_gallop; /* penalize it for leaving galloping mode */ |
| 1808 | ms->min_gallop = min_gallop; |
| 1809 | } |
Tim Peters | a64dc24 | 2002-08-01 02:13:36 +0000 | [diff] [blame] | 1810 | Succeed: |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 1811 | result = 0; |
Tim Peters | a64dc24 | 2002-08-01 02:13:36 +0000 | [diff] [blame] | 1812 | Fail: |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 1813 | if (nb) |
Daniel Stutzbach | 9833822 | 2010-12-02 21:55:33 +0000 | [diff] [blame] | 1814 | sortslice_memcpy(&dest, -(nb-1), &baseb, 0, nb); |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 1815 | return result; |
Tim Peters | a64dc24 | 2002-08-01 02:13:36 +0000 | [diff] [blame] | 1816 | CopyA: |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 1817 | assert(nb == 1 && na > 0); |
Daniel Stutzbach | 9833822 | 2010-12-02 21:55:33 +0000 | [diff] [blame] | 1818 | /* The first element of ssb belongs at the front of the merge. */ |
| 1819 | sortslice_memmove(&dest, 1-na, &ssa, 1-na, na); |
| 1820 | sortslice_advance(&dest, -na); |
| 1821 | sortslice_advance(&ssa, -na); |
| 1822 | sortslice_copy(&dest, 0, &ssb, 0); |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 1823 | return 0; |
Tim Peters | a64dc24 | 2002-08-01 02:13:36 +0000 | [diff] [blame] | 1824 | } |
| 1825 | |
| 1826 | /* Merge the two runs at stack indices i and i+1. |
| 1827 | * Returns 0 on success, -1 on error. |
| 1828 | */ |
Martin v. Löwis | 18e1655 | 2006-02-15 17:27:45 +0000 | [diff] [blame] | 1829 | static Py_ssize_t |
| 1830 | merge_at(MergeState *ms, Py_ssize_t i) |
Tim Peters | a64dc24 | 2002-08-01 02:13:36 +0000 | [diff] [blame] | 1831 | { |
Daniel Stutzbach | 9833822 | 2010-12-02 21:55:33 +0000 | [diff] [blame] | 1832 | sortslice ssa, ssb; |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 1833 | Py_ssize_t na, nb; |
| 1834 | Py_ssize_t k; |
Tim Peters | a64dc24 | 2002-08-01 02:13:36 +0000 | [diff] [blame] | 1835 | |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 1836 | assert(ms != NULL); |
| 1837 | assert(ms->n >= 2); |
| 1838 | assert(i >= 0); |
| 1839 | assert(i == ms->n - 2 || i == ms->n - 3); |
Tim Peters | a64dc24 | 2002-08-01 02:13:36 +0000 | [diff] [blame] | 1840 | |
Daniel Stutzbach | 9833822 | 2010-12-02 21:55:33 +0000 | [diff] [blame] | 1841 | ssa = ms->pending[i].base; |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 1842 | na = ms->pending[i].len; |
Daniel Stutzbach | 9833822 | 2010-12-02 21:55:33 +0000 | [diff] [blame] | 1843 | ssb = ms->pending[i+1].base; |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 1844 | nb = ms->pending[i+1].len; |
| 1845 | assert(na > 0 && nb > 0); |
Daniel Stutzbach | 9833822 | 2010-12-02 21:55:33 +0000 | [diff] [blame] | 1846 | assert(ssa.keys + na == ssb.keys); |
Tim Peters | a64dc24 | 2002-08-01 02:13:36 +0000 | [diff] [blame] | 1847 | |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 1848 | /* Record the length of the combined runs; if i is the 3rd-last |
| 1849 | * run now, also slide over the last run (which isn't involved |
| 1850 | * in this merge). The current run i+1 goes away in any case. |
| 1851 | */ |
| 1852 | ms->pending[i].len = na + nb; |
| 1853 | if (i == ms->n - 3) |
| 1854 | ms->pending[i+1] = ms->pending[i+2]; |
| 1855 | --ms->n; |
Tim Peters | a64dc24 | 2002-08-01 02:13:36 +0000 | [diff] [blame] | 1856 | |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 1857 | /* Where does b start in a? Elements in a before that can be |
| 1858 | * ignored (already in place). |
| 1859 | */ |
embg | 1e34da4 | 2018-01-28 20:03:23 -0700 | [diff] [blame] | 1860 | k = gallop_right(ms, *ssb.keys, ssa.keys, na, 0); |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 1861 | if (k < 0) |
| 1862 | return -1; |
Daniel Stutzbach | 9833822 | 2010-12-02 21:55:33 +0000 | [diff] [blame] | 1863 | sortslice_advance(&ssa, k); |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 1864 | na -= k; |
| 1865 | if (na == 0) |
| 1866 | return 0; |
Tim Peters | a64dc24 | 2002-08-01 02:13:36 +0000 | [diff] [blame] | 1867 | |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 1868 | /* Where does a end in b? Elements in b after that can be |
| 1869 | * ignored (already in place). |
| 1870 | */ |
embg | 1e34da4 | 2018-01-28 20:03:23 -0700 | [diff] [blame] | 1871 | nb = gallop_left(ms, ssa.keys[na-1], ssb.keys, nb, nb-1); |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 1872 | if (nb <= 0) |
| 1873 | return nb; |
Tim Peters | a64dc24 | 2002-08-01 02:13:36 +0000 | [diff] [blame] | 1874 | |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 1875 | /* Merge what remains of the runs, using a temp array with |
| 1876 | * min(na, nb) elements. |
| 1877 | */ |
| 1878 | if (na <= nb) |
Daniel Stutzbach | 9833822 | 2010-12-02 21:55:33 +0000 | [diff] [blame] | 1879 | return merge_lo(ms, ssa, na, ssb, nb); |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 1880 | else |
Daniel Stutzbach | 9833822 | 2010-12-02 21:55:33 +0000 | [diff] [blame] | 1881 | return merge_hi(ms, ssa, na, ssb, nb); |
Tim Peters | a64dc24 | 2002-08-01 02:13:36 +0000 | [diff] [blame] | 1882 | } |
| 1883 | |
| 1884 | /* Examine the stack of runs waiting to be merged, merging adjacent runs |
| 1885 | * until the stack invariants are re-established: |
| 1886 | * |
| 1887 | * 1. len[-3] > len[-2] + len[-1] |
| 1888 | * 2. len[-2] > len[-1] |
| 1889 | * |
| 1890 | * See listsort.txt for more info. |
| 1891 | * |
| 1892 | * Returns 0 on success, -1 on error. |
| 1893 | */ |
| 1894 | static int |
| 1895 | merge_collapse(MergeState *ms) |
| 1896 | { |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 1897 | struct s_slice *p = ms->pending; |
Tim Peters | a64dc24 | 2002-08-01 02:13:36 +0000 | [diff] [blame] | 1898 | |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 1899 | assert(ms); |
| 1900 | while (ms->n > 1) { |
| 1901 | Py_ssize_t n = ms->n - 2; |
Benjamin Peterson | b808d59 | 2015-02-25 10:12:26 -0500 | [diff] [blame] | 1902 | if ((n > 0 && p[n-1].len <= p[n].len + p[n+1].len) || |
| 1903 | (n > 1 && p[n-2].len <= p[n-1].len + p[n].len)) { |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 1904 | if (p[n-1].len < p[n+1].len) |
| 1905 | --n; |
| 1906 | if (merge_at(ms, n) < 0) |
| 1907 | return -1; |
| 1908 | } |
| 1909 | else if (p[n].len <= p[n+1].len) { |
embg | 1e34da4 | 2018-01-28 20:03:23 -0700 | [diff] [blame] | 1910 | if (merge_at(ms, n) < 0) |
| 1911 | return -1; |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 1912 | } |
| 1913 | else |
| 1914 | break; |
| 1915 | } |
| 1916 | return 0; |
Tim Peters | a64dc24 | 2002-08-01 02:13:36 +0000 | [diff] [blame] | 1917 | } |
| 1918 | |
| 1919 | /* Regardless of invariants, merge all runs on the stack until only one |
| 1920 | * remains. This is used at the end of the mergesort. |
| 1921 | * |
| 1922 | * Returns 0 on success, -1 on error. |
| 1923 | */ |
| 1924 | static int |
| 1925 | merge_force_collapse(MergeState *ms) |
| 1926 | { |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 1927 | struct s_slice *p = ms->pending; |
Tim Peters | a64dc24 | 2002-08-01 02:13:36 +0000 | [diff] [blame] | 1928 | |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 1929 | assert(ms); |
| 1930 | while (ms->n > 1) { |
| 1931 | Py_ssize_t n = ms->n - 2; |
| 1932 | if (n > 0 && p[n-1].len < p[n+1].len) |
| 1933 | --n; |
| 1934 | if (merge_at(ms, n) < 0) |
| 1935 | return -1; |
| 1936 | } |
| 1937 | return 0; |
Tim Peters | a64dc24 | 2002-08-01 02:13:36 +0000 | [diff] [blame] | 1938 | } |
| 1939 | |
| 1940 | /* Compute a good value for the minimum run length; natural runs shorter |
| 1941 | * than this are boosted artificially via binary insertion. |
| 1942 | * |
| 1943 | * If n < 64, return n (it's too small to bother with fancy stuff). |
| 1944 | * Else if n is an exact power of 2, return 32. |
| 1945 | * Else return an int k, 32 <= k <= 64, such that n/k is close to, but |
| 1946 | * strictly less than, an exact power of 2. |
| 1947 | * |
| 1948 | * See listsort.txt for more info. |
| 1949 | */ |
Martin v. Löwis | 18e1655 | 2006-02-15 17:27:45 +0000 | [diff] [blame] | 1950 | static Py_ssize_t |
| 1951 | merge_compute_minrun(Py_ssize_t n) |
Tim Peters | a64dc24 | 2002-08-01 02:13:36 +0000 | [diff] [blame] | 1952 | { |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 1953 | Py_ssize_t r = 0; /* becomes 1 if any 1 bits are shifted off */ |
Tim Peters | a64dc24 | 2002-08-01 02:13:36 +0000 | [diff] [blame] | 1954 | |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 1955 | assert(n >= 0); |
| 1956 | while (n >= 64) { |
| 1957 | r |= n & 1; |
| 1958 | n >>= 1; |
| 1959 | } |
| 1960 | return n + r; |
Guido van Rossum | 4c4e7df | 1998-06-16 15:18:28 +0000 | [diff] [blame] | 1961 | } |
Guido van Rossum | a119c0d | 1998-05-29 17:56:32 +0000 | [diff] [blame] | 1962 | |
Thomas Wouters | 49fd7fa | 2006-04-21 10:40:58 +0000 | [diff] [blame] | 1963 | static void |
Daniel Stutzbach | 9833822 | 2010-12-02 21:55:33 +0000 | [diff] [blame] | 1964 | reverse_sortslice(sortslice *s, Py_ssize_t n) |
Thomas Wouters | 49fd7fa | 2006-04-21 10:40:58 +0000 | [diff] [blame] | 1965 | { |
Daniel Stutzbach | 9833822 | 2010-12-02 21:55:33 +0000 | [diff] [blame] | 1966 | reverse_slice(s->keys, &s->keys[n]); |
| 1967 | if (s->values != NULL) |
| 1968 | reverse_slice(s->values, &s->values[n]); |
Raymond Hettinger | 42b1ba3 | 2003-10-16 03:41:09 +0000 | [diff] [blame] | 1969 | } |
| 1970 | |
embg | 1e34da4 | 2018-01-28 20:03:23 -0700 | [diff] [blame] | 1971 | /* Here we define custom comparison functions to optimize for the cases one commonly |
| 1972 | * encounters in practice: homogeneous lists, often of one of the basic types. */ |
| 1973 | |
| 1974 | /* This struct holds the comparison function and helper functions |
| 1975 | * selected in the pre-sort check. */ |
| 1976 | |
| 1977 | /* These are the special case compare functions. |
| 1978 | * ms->key_compare will always point to one of these: */ |
| 1979 | |
| 1980 | /* Heterogeneous compare: default, always safe to fall back on. */ |
| 1981 | static int |
| 1982 | safe_object_compare(PyObject *v, PyObject *w, MergeState *ms) |
| 1983 | { |
| 1984 | /* No assumptions necessary! */ |
| 1985 | return PyObject_RichCompareBool(v, w, Py_LT); |
| 1986 | } |
| 1987 | |
| 1988 | /* Homogeneous compare: safe for any two compareable objects of the same type. |
| 1989 | * (ms->key_richcompare is set to ob_type->tp_richcompare in the |
| 1990 | * pre-sort check.) |
| 1991 | */ |
| 1992 | static int |
| 1993 | unsafe_object_compare(PyObject *v, PyObject *w, MergeState *ms) |
| 1994 | { |
| 1995 | PyObject *res_obj; int res; |
| 1996 | |
| 1997 | /* No assumptions, because we check first: */ |
| 1998 | if (v->ob_type->tp_richcompare != ms->key_richcompare) |
| 1999 | return PyObject_RichCompareBool(v, w, Py_LT); |
| 2000 | |
| 2001 | assert(ms->key_richcompare != NULL); |
| 2002 | res_obj = (*(ms->key_richcompare))(v, w, Py_LT); |
| 2003 | |
| 2004 | if (res_obj == Py_NotImplemented) { |
| 2005 | Py_DECREF(res_obj); |
| 2006 | return PyObject_RichCompareBool(v, w, Py_LT); |
| 2007 | } |
| 2008 | if (res_obj == NULL) |
| 2009 | return -1; |
| 2010 | |
| 2011 | if (PyBool_Check(res_obj)) { |
| 2012 | res = (res_obj == Py_True); |
| 2013 | } |
| 2014 | else { |
| 2015 | res = PyObject_IsTrue(res_obj); |
| 2016 | } |
| 2017 | Py_DECREF(res_obj); |
| 2018 | |
| 2019 | /* Note that we can't assert |
| 2020 | * res == PyObject_RichCompareBool(v, w, Py_LT); |
| 2021 | * because of evil compare functions like this: |
| 2022 | * lambda a, b: int(random.random() * 3) - 1) |
| 2023 | * (which is actually in test_sort.py) */ |
| 2024 | return res; |
| 2025 | } |
| 2026 | |
| 2027 | /* Latin string compare: safe for any two latin (one byte per char) strings. */ |
| 2028 | static int |
| 2029 | unsafe_latin_compare(PyObject *v, PyObject *w, MergeState *ms) |
| 2030 | { |
Victor Stinner | 8017b80 | 2018-01-29 13:47:06 +0100 | [diff] [blame] | 2031 | Py_ssize_t len; |
| 2032 | int res; |
embg | 1e34da4 | 2018-01-28 20:03:23 -0700 | [diff] [blame] | 2033 | |
| 2034 | /* Modified from Objects/unicodeobject.c:unicode_compare, assuming: */ |
| 2035 | assert(v->ob_type == w->ob_type); |
| 2036 | assert(v->ob_type == &PyUnicode_Type); |
| 2037 | assert(PyUnicode_KIND(v) == PyUnicode_KIND(w)); |
| 2038 | assert(PyUnicode_KIND(v) == PyUnicode_1BYTE_KIND); |
| 2039 | |
| 2040 | len = Py_MIN(PyUnicode_GET_LENGTH(v), PyUnicode_GET_LENGTH(w)); |
| 2041 | res = memcmp(PyUnicode_DATA(v), PyUnicode_DATA(w), len); |
| 2042 | |
| 2043 | res = (res != 0 ? |
| 2044 | res < 0 : |
| 2045 | PyUnicode_GET_LENGTH(v) < PyUnicode_GET_LENGTH(w)); |
| 2046 | |
| 2047 | assert(res == PyObject_RichCompareBool(v, w, Py_LT));; |
| 2048 | return res; |
| 2049 | } |
| 2050 | |
| 2051 | /* Bounded int compare: compare any two longs that fit in a single machine word. */ |
| 2052 | static int |
| 2053 | unsafe_long_compare(PyObject *v, PyObject *w, MergeState *ms) |
| 2054 | { |
| 2055 | PyLongObject *vl, *wl; sdigit v0, w0; int res; |
| 2056 | |
| 2057 | /* Modified from Objects/longobject.c:long_compare, assuming: */ |
| 2058 | assert(v->ob_type == w->ob_type); |
| 2059 | assert(v->ob_type == &PyLong_Type); |
| 2060 | assert(Py_ABS(Py_SIZE(v)) <= 1); |
| 2061 | assert(Py_ABS(Py_SIZE(w)) <= 1); |
| 2062 | |
| 2063 | vl = (PyLongObject*)v; |
| 2064 | wl = (PyLongObject*)w; |
| 2065 | |
| 2066 | v0 = Py_SIZE(vl) == 0 ? 0 : (sdigit)vl->ob_digit[0]; |
| 2067 | w0 = Py_SIZE(wl) == 0 ? 0 : (sdigit)wl->ob_digit[0]; |
| 2068 | |
| 2069 | if (Py_SIZE(vl) < 0) |
| 2070 | v0 = -v0; |
| 2071 | if (Py_SIZE(wl) < 0) |
| 2072 | w0 = -w0; |
| 2073 | |
| 2074 | res = v0 < w0; |
| 2075 | assert(res == PyObject_RichCompareBool(v, w, Py_LT)); |
| 2076 | return res; |
| 2077 | } |
| 2078 | |
| 2079 | /* Float compare: compare any two floats. */ |
| 2080 | static int |
| 2081 | unsafe_float_compare(PyObject *v, PyObject *w, MergeState *ms) |
| 2082 | { |
| 2083 | int res; |
| 2084 | |
| 2085 | /* Modified from Objects/floatobject.c:float_richcompare, assuming: */ |
| 2086 | assert(v->ob_type == w->ob_type); |
| 2087 | assert(v->ob_type == &PyFloat_Type); |
| 2088 | |
| 2089 | res = PyFloat_AS_DOUBLE(v) < PyFloat_AS_DOUBLE(w); |
| 2090 | assert(res == PyObject_RichCompareBool(v, w, Py_LT)); |
| 2091 | return res; |
| 2092 | } |
| 2093 | |
| 2094 | /* Tuple compare: compare *any* two tuples, using |
| 2095 | * ms->tuple_elem_compare to compare the first elements, which is set |
| 2096 | * using the same pre-sort check as we use for ms->key_compare, |
| 2097 | * but run on the list [x[0] for x in L]. This allows us to optimize compares |
| 2098 | * on two levels (as long as [x[0] for x in L] is type-homogeneous.) The idea is |
| 2099 | * that most tuple compares don't involve x[1:]. */ |
| 2100 | static int |
| 2101 | unsafe_tuple_compare(PyObject *v, PyObject *w, MergeState *ms) |
| 2102 | { |
| 2103 | PyTupleObject *vt, *wt; |
| 2104 | Py_ssize_t i, vlen, wlen; |
| 2105 | int k; |
| 2106 | |
| 2107 | /* Modified from Objects/tupleobject.c:tuplerichcompare, assuming: */ |
| 2108 | assert(v->ob_type == w->ob_type); |
| 2109 | assert(v->ob_type == &PyTuple_Type); |
| 2110 | assert(Py_SIZE(v) > 0); |
| 2111 | assert(Py_SIZE(w) > 0); |
| 2112 | |
| 2113 | vt = (PyTupleObject *)v; |
| 2114 | wt = (PyTupleObject *)w; |
| 2115 | |
| 2116 | vlen = Py_SIZE(vt); |
| 2117 | wlen = Py_SIZE(wt); |
| 2118 | |
| 2119 | for (i = 0; i < vlen && i < wlen; i++) { |
| 2120 | k = PyObject_RichCompareBool(vt->ob_item[i], wt->ob_item[i], Py_EQ); |
| 2121 | if (k < 0) |
| 2122 | return -1; |
| 2123 | if (!k) |
| 2124 | break; |
| 2125 | } |
| 2126 | |
| 2127 | if (i >= vlen || i >= wlen) |
| 2128 | return vlen < wlen; |
| 2129 | |
| 2130 | if (i == 0) |
| 2131 | return ms->tuple_elem_compare(vt->ob_item[i], wt->ob_item[i], ms); |
| 2132 | else |
| 2133 | return PyObject_RichCompareBool(vt->ob_item[i], wt->ob_item[i], Py_LT); |
| 2134 | } |
| 2135 | |
Tim Peters | a64dc24 | 2002-08-01 02:13:36 +0000 | [diff] [blame] | 2136 | /* An adaptive, stable, natural mergesort. See listsort.txt. |
| 2137 | * Returns Py_None on success, NULL on error. Even in case of error, the |
| 2138 | * list will be some permutation of its input state (nothing is lost or |
| 2139 | * duplicated). |
| 2140 | */ |
Serhiy Storchaka | fdd42c4 | 2017-03-11 09:19:20 +0200 | [diff] [blame] | 2141 | /*[clinic input] |
| 2142 | list.sort |
| 2143 | |
| 2144 | * |
| 2145 | key as keyfunc: object = None |
Serhiy Storchaka | 202fda5 | 2017-03-12 10:10:47 +0200 | [diff] [blame] | 2146 | reverse: bool(accept={int}) = False |
Serhiy Storchaka | fdd42c4 | 2017-03-11 09:19:20 +0200 | [diff] [blame] | 2147 | |
| 2148 | Stable sort *IN PLACE*. |
| 2149 | [clinic start generated code]*/ |
| 2150 | |
Guido van Rossum | c0b618a | 1997-05-02 03:12:38 +0000 | [diff] [blame] | 2151 | static PyObject * |
Serhiy Storchaka | fdd42c4 | 2017-03-11 09:19:20 +0200 | [diff] [blame] | 2152 | list_sort_impl(PyListObject *self, PyObject *keyfunc, int reverse) |
Serhiy Storchaka | 202fda5 | 2017-03-12 10:10:47 +0200 | [diff] [blame] | 2153 | /*[clinic end generated code: output=57b9f9c5e23fbe42 input=b0fcf743982c5b90]*/ |
Guido van Rossum | 3f236de | 1996-12-10 23:55:39 +0000 | [diff] [blame] | 2154 | { |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 2155 | MergeState ms; |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 2156 | Py_ssize_t nremaining; |
| 2157 | Py_ssize_t minrun; |
Daniel Stutzbach | 9833822 | 2010-12-02 21:55:33 +0000 | [diff] [blame] | 2158 | sortslice lo; |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 2159 | Py_ssize_t saved_ob_size, saved_allocated; |
| 2160 | PyObject **saved_ob_item; |
| 2161 | PyObject **final_ob_item; |
| 2162 | PyObject *result = NULL; /* guilty until proved innocent */ |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 2163 | Py_ssize_t i; |
Daniel Stutzbach | 9833822 | 2010-12-02 21:55:33 +0000 | [diff] [blame] | 2164 | PyObject **keys; |
Guido van Rossum | 4c4e7df | 1998-06-16 15:18:28 +0000 | [diff] [blame] | 2165 | |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 2166 | assert(self != NULL); |
Serhiy Storchaka | fdd42c4 | 2017-03-11 09:19:20 +0200 | [diff] [blame] | 2167 | assert(PyList_Check(self)); |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 2168 | if (keyfunc == Py_None) |
| 2169 | keyfunc = NULL; |
Raymond Hettinger | 42b1ba3 | 2003-10-16 03:41:09 +0000 | [diff] [blame] | 2170 | |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 2171 | /* The list is temporarily made empty, so that mutations performed |
| 2172 | * by comparison functions can't affect the slice of memory we're |
| 2173 | * sorting (allowing mutations during sorting is a core-dump |
| 2174 | * factory, since ob_item may change). |
| 2175 | */ |
| 2176 | saved_ob_size = Py_SIZE(self); |
| 2177 | saved_ob_item = self->ob_item; |
| 2178 | saved_allocated = self->allocated; |
| 2179 | Py_SIZE(self) = 0; |
| 2180 | self->ob_item = NULL; |
| 2181 | self->allocated = -1; /* any operation will reset it to >= 0 */ |
Tim Peters | 330f9e9 | 2002-07-19 07:05:44 +0000 | [diff] [blame] | 2182 | |
Daniel Stutzbach | 9833822 | 2010-12-02 21:55:33 +0000 | [diff] [blame] | 2183 | if (keyfunc == NULL) { |
| 2184 | keys = NULL; |
| 2185 | lo.keys = saved_ob_item; |
| 2186 | lo.values = NULL; |
| 2187 | } |
| 2188 | else { |
| 2189 | if (saved_ob_size < MERGESTATE_TEMP_SIZE/2) |
| 2190 | /* Leverage stack space we allocated but won't otherwise use */ |
| 2191 | keys = &ms.temparray[saved_ob_size+1]; |
| 2192 | else { |
| 2193 | keys = PyMem_MALLOC(sizeof(PyObject *) * saved_ob_size); |
Benjamin Peterson | 0823ffb | 2015-04-23 17:04:36 -0400 | [diff] [blame] | 2194 | if (keys == NULL) { |
| 2195 | PyErr_NoMemory(); |
| 2196 | goto keyfunc_fail; |
| 2197 | } |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 2198 | } |
Daniel Stutzbach | 9833822 | 2010-12-02 21:55:33 +0000 | [diff] [blame] | 2199 | |
| 2200 | for (i = 0; i < saved_ob_size ; i++) { |
Victor Stinner | de4ae3d | 2016-12-04 22:59:09 +0100 | [diff] [blame] | 2201 | keys[i] = PyObject_CallFunctionObjArgs(keyfunc, saved_ob_item[i], |
| 2202 | NULL); |
Daniel Stutzbach | 9833822 | 2010-12-02 21:55:33 +0000 | [diff] [blame] | 2203 | if (keys[i] == NULL) { |
| 2204 | for (i=i-1 ; i>=0 ; i--) |
| 2205 | Py_DECREF(keys[i]); |
Benjamin Peterson | 4a42cd4 | 2014-03-15 12:21:28 -0500 | [diff] [blame] | 2206 | if (saved_ob_size >= MERGESTATE_TEMP_SIZE/2) |
Daniel Stutzbach | 8eda5f7 | 2011-03-02 23:37:50 +0000 | [diff] [blame] | 2207 | PyMem_FREE(keys); |
Daniel Stutzbach | 9833822 | 2010-12-02 21:55:33 +0000 | [diff] [blame] | 2208 | goto keyfunc_fail; |
| 2209 | } |
| 2210 | } |
| 2211 | |
| 2212 | lo.keys = keys; |
| 2213 | lo.values = saved_ob_item; |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 2214 | } |
Michael W. Hudson | 1df0f65 | 2003-12-04 11:25:46 +0000 | [diff] [blame] | 2215 | |
embg | 1e34da4 | 2018-01-28 20:03:23 -0700 | [diff] [blame] | 2216 | |
| 2217 | /* The pre-sort check: here's where we decide which compare function to use. |
| 2218 | * How much optimization is safe? We test for homogeneity with respect to |
| 2219 | * several properties that are expensive to check at compare-time, and |
| 2220 | * set ms appropriately. */ |
| 2221 | if (saved_ob_size > 1) { |
| 2222 | /* Assume the first element is representative of the whole list. */ |
| 2223 | int keys_are_in_tuples = (lo.keys[0]->ob_type == &PyTuple_Type && |
| 2224 | Py_SIZE(lo.keys[0]) > 0); |
| 2225 | |
| 2226 | PyTypeObject* key_type = (keys_are_in_tuples ? |
| 2227 | PyTuple_GET_ITEM(lo.keys[0], 0)->ob_type : |
| 2228 | lo.keys[0]->ob_type); |
| 2229 | |
| 2230 | int keys_are_all_same_type = 1; |
| 2231 | int strings_are_latin = 1; |
| 2232 | int ints_are_bounded = 1; |
| 2233 | |
| 2234 | /* Prove that assumption by checking every key. */ |
| 2235 | int i; |
| 2236 | for (i=0; i < saved_ob_size; i++) { |
| 2237 | |
| 2238 | if (keys_are_in_tuples && |
| 2239 | !(lo.keys[i]->ob_type == &PyTuple_Type && Py_SIZE(lo.keys[i]) != 0)) { |
| 2240 | keys_are_in_tuples = 0; |
| 2241 | keys_are_all_same_type = 0; |
| 2242 | break; |
| 2243 | } |
| 2244 | |
| 2245 | /* Note: for lists of tuples, key is the first element of the tuple |
| 2246 | * lo.keys[i], not lo.keys[i] itself! We verify type-homogeneity |
| 2247 | * for lists of tuples in the if-statement directly above. */ |
| 2248 | PyObject *key = (keys_are_in_tuples ? |
| 2249 | PyTuple_GET_ITEM(lo.keys[i], 0) : |
| 2250 | lo.keys[i]); |
| 2251 | |
| 2252 | if (key->ob_type != key_type) { |
| 2253 | keys_are_all_same_type = 0; |
| 2254 | break; |
| 2255 | } |
| 2256 | |
| 2257 | if (key_type == &PyLong_Type) { |
| 2258 | if (ints_are_bounded && Py_ABS(Py_SIZE(key)) > 1) |
| 2259 | ints_are_bounded = 0; |
| 2260 | } |
| 2261 | else if (key_type == &PyUnicode_Type){ |
| 2262 | if (strings_are_latin && |
| 2263 | PyUnicode_KIND(key) != PyUnicode_1BYTE_KIND) |
| 2264 | strings_are_latin = 0; |
| 2265 | } |
| 2266 | } |
| 2267 | |
| 2268 | /* Choose the best compare, given what we now know about the keys. */ |
| 2269 | if (keys_are_all_same_type) { |
| 2270 | |
| 2271 | if (key_type == &PyUnicode_Type && strings_are_latin) { |
| 2272 | ms.key_compare = unsafe_latin_compare; |
| 2273 | } |
| 2274 | else if (key_type == &PyLong_Type && ints_are_bounded) { |
| 2275 | ms.key_compare = unsafe_long_compare; |
| 2276 | } |
| 2277 | else if (key_type == &PyFloat_Type) { |
| 2278 | ms.key_compare = unsafe_float_compare; |
| 2279 | } |
| 2280 | else if ((ms.key_richcompare = key_type->tp_richcompare) != NULL) { |
| 2281 | ms.key_compare = unsafe_object_compare; |
| 2282 | } |
| 2283 | } |
| 2284 | else { |
| 2285 | ms.key_compare = safe_object_compare; |
| 2286 | } |
| 2287 | |
| 2288 | if (keys_are_in_tuples) { |
| 2289 | /* Make sure we're not dealing with tuples of tuples |
| 2290 | * (remember: here, key_type refers list [key[0] for key in keys]) */ |
| 2291 | if (key_type == &PyTuple_Type) |
| 2292 | ms.tuple_elem_compare = safe_object_compare; |
| 2293 | else |
| 2294 | ms.tuple_elem_compare = ms.key_compare; |
| 2295 | |
| 2296 | ms.key_compare = unsafe_tuple_compare; |
| 2297 | } |
| 2298 | } |
| 2299 | /* End of pre-sort check: ms is now set properly! */ |
| 2300 | |
Daniel Stutzbach | 9833822 | 2010-12-02 21:55:33 +0000 | [diff] [blame] | 2301 | merge_init(&ms, saved_ob_size, keys != NULL); |
Michael W. Hudson | 1df0f65 | 2003-12-04 11:25:46 +0000 | [diff] [blame] | 2302 | |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 2303 | nremaining = saved_ob_size; |
| 2304 | if (nremaining < 2) |
| 2305 | goto succeed; |
Tim Peters | 330f9e9 | 2002-07-19 07:05:44 +0000 | [diff] [blame] | 2306 | |
Benjamin Peterson | 0538064 | 2010-08-23 19:35:39 +0000 | [diff] [blame] | 2307 | /* Reverse sort stability achieved by initially reversing the list, |
| 2308 | applying a stable forward sort, then reversing the final result. */ |
Daniel Stutzbach | 9833822 | 2010-12-02 21:55:33 +0000 | [diff] [blame] | 2309 | if (reverse) { |
| 2310 | if (keys != NULL) |
| 2311 | reverse_slice(&keys[0], &keys[saved_ob_size]); |
| 2312 | reverse_slice(&saved_ob_item[0], &saved_ob_item[saved_ob_size]); |
| 2313 | } |
Benjamin Peterson | 0538064 | 2010-08-23 19:35:39 +0000 | [diff] [blame] | 2314 | |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 2315 | /* March over the array once, left to right, finding natural runs, |
| 2316 | * and extending short natural runs to minrun elements. |
| 2317 | */ |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 2318 | minrun = merge_compute_minrun(nremaining); |
| 2319 | do { |
| 2320 | int descending; |
| 2321 | Py_ssize_t n; |
Tim Peters | 330f9e9 | 2002-07-19 07:05:44 +0000 | [diff] [blame] | 2322 | |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 2323 | /* Identify next run. */ |
embg | 1e34da4 | 2018-01-28 20:03:23 -0700 | [diff] [blame] | 2324 | n = count_run(&ms, lo.keys, lo.keys + nremaining, &descending); |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 2325 | if (n < 0) |
| 2326 | goto fail; |
| 2327 | if (descending) |
Daniel Stutzbach | 9833822 | 2010-12-02 21:55:33 +0000 | [diff] [blame] | 2328 | reverse_sortslice(&lo, n); |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 2329 | /* If short, extend to min(minrun, nremaining). */ |
| 2330 | if (n < minrun) { |
| 2331 | const Py_ssize_t force = nremaining <= minrun ? |
| 2332 | nremaining : minrun; |
embg | 1e34da4 | 2018-01-28 20:03:23 -0700 | [diff] [blame] | 2333 | if (binarysort(&ms, lo, lo.keys + force, lo.keys + n) < 0) |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 2334 | goto fail; |
| 2335 | n = force; |
| 2336 | } |
| 2337 | /* Push run onto pending-runs stack, and maybe merge. */ |
| 2338 | assert(ms.n < MAX_MERGE_PENDING); |
| 2339 | ms.pending[ms.n].base = lo; |
| 2340 | ms.pending[ms.n].len = n; |
| 2341 | ++ms.n; |
| 2342 | if (merge_collapse(&ms) < 0) |
| 2343 | goto fail; |
| 2344 | /* Advance to find next run. */ |
Daniel Stutzbach | 9833822 | 2010-12-02 21:55:33 +0000 | [diff] [blame] | 2345 | sortslice_advance(&lo, n); |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 2346 | nremaining -= n; |
| 2347 | } while (nremaining); |
Tim Peters | 330f9e9 | 2002-07-19 07:05:44 +0000 | [diff] [blame] | 2348 | |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 2349 | if (merge_force_collapse(&ms) < 0) |
| 2350 | goto fail; |
| 2351 | assert(ms.n == 1); |
Daniel Stutzbach | 9833822 | 2010-12-02 21:55:33 +0000 | [diff] [blame] | 2352 | assert(keys == NULL |
| 2353 | ? ms.pending[0].base.keys == saved_ob_item |
| 2354 | : ms.pending[0].base.keys == &keys[0]); |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 2355 | assert(ms.pending[0].len == saved_ob_size); |
Daniel Stutzbach | 9833822 | 2010-12-02 21:55:33 +0000 | [diff] [blame] | 2356 | lo = ms.pending[0].base; |
Tim Peters | a64dc24 | 2002-08-01 02:13:36 +0000 | [diff] [blame] | 2357 | |
| 2358 | succeed: |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 2359 | result = Py_None; |
Tim Peters | 330f9e9 | 2002-07-19 07:05:44 +0000 | [diff] [blame] | 2360 | fail: |
Daniel Stutzbach | 9833822 | 2010-12-02 21:55:33 +0000 | [diff] [blame] | 2361 | if (keys != NULL) { |
| 2362 | for (i = 0; i < saved_ob_size; i++) |
| 2363 | Py_DECREF(keys[i]); |
Benjamin Peterson | ef87f8c | 2014-03-14 21:54:31 -0500 | [diff] [blame] | 2364 | if (saved_ob_size >= MERGESTATE_TEMP_SIZE/2) |
Daniel Stutzbach | 9833822 | 2010-12-02 21:55:33 +0000 | [diff] [blame] | 2365 | PyMem_FREE(keys); |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 2366 | } |
Michael W. Hudson | 1df0f65 | 2003-12-04 11:25:46 +0000 | [diff] [blame] | 2367 | |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 2368 | if (self->allocated != -1 && result != NULL) { |
| 2369 | /* The user mucked with the list during the sort, |
| 2370 | * and we don't already have another error to report. |
| 2371 | */ |
| 2372 | PyErr_SetString(PyExc_ValueError, "list modified during sort"); |
| 2373 | result = NULL; |
| 2374 | } |
Michael W. Hudson | 1df0f65 | 2003-12-04 11:25:46 +0000 | [diff] [blame] | 2375 | |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 2376 | if (reverse && saved_ob_size > 1) |
| 2377 | reverse_slice(saved_ob_item, saved_ob_item + saved_ob_size); |
Michael W. Hudson | 1df0f65 | 2003-12-04 11:25:46 +0000 | [diff] [blame] | 2378 | |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 2379 | merge_freemem(&ms); |
Michael W. Hudson | 1df0f65 | 2003-12-04 11:25:46 +0000 | [diff] [blame] | 2380 | |
Daniel Stutzbach | 9833822 | 2010-12-02 21:55:33 +0000 | [diff] [blame] | 2381 | keyfunc_fail: |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 2382 | final_ob_item = self->ob_item; |
| 2383 | i = Py_SIZE(self); |
| 2384 | Py_SIZE(self) = saved_ob_size; |
| 2385 | self->ob_item = saved_ob_item; |
| 2386 | self->allocated = saved_allocated; |
| 2387 | if (final_ob_item != NULL) { |
Serhiy Storchaka | fdd42c4 | 2017-03-11 09:19:20 +0200 | [diff] [blame] | 2388 | /* we cannot use _list_clear() for this because it does not |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 2389 | guarantee that the list is really empty when it returns */ |
| 2390 | while (--i >= 0) { |
| 2391 | Py_XDECREF(final_ob_item[i]); |
| 2392 | } |
| 2393 | PyMem_FREE(final_ob_item); |
| 2394 | } |
| 2395 | Py_XINCREF(result); |
| 2396 | return result; |
Guido van Rossum | 3f236de | 1996-12-10 23:55:39 +0000 | [diff] [blame] | 2397 | } |
Tim Peters | 330f9e9 | 2002-07-19 07:05:44 +0000 | [diff] [blame] | 2398 | #undef IFLT |
Tim Peters | 66860f6 | 2002-08-04 17:47:26 +0000 | [diff] [blame] | 2399 | #undef ISLT |
Tim Peters | 330f9e9 | 2002-07-19 07:05:44 +0000 | [diff] [blame] | 2400 | |
Guido van Rossum | 4c4e7df | 1998-06-16 15:18:28 +0000 | [diff] [blame] | 2401 | int |
Fred Drake | a2f5511 | 2000-07-09 15:16:51 +0000 | [diff] [blame] | 2402 | PyList_Sort(PyObject *v) |
Guido van Rossum | 4c4e7df | 1998-06-16 15:18:28 +0000 | [diff] [blame] | 2403 | { |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 2404 | if (v == NULL || !PyList_Check(v)) { |
| 2405 | PyErr_BadInternalCall(); |
| 2406 | return -1; |
| 2407 | } |
Serhiy Storchaka | fdd42c4 | 2017-03-11 09:19:20 +0200 | [diff] [blame] | 2408 | v = list_sort_impl((PyListObject *)v, NULL, 0); |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 2409 | if (v == NULL) |
| 2410 | return -1; |
| 2411 | Py_DECREF(v); |
| 2412 | return 0; |
Guido van Rossum | 4c4e7df | 1998-06-16 15:18:28 +0000 | [diff] [blame] | 2413 | } |
| 2414 | |
Serhiy Storchaka | fdd42c4 | 2017-03-11 09:19:20 +0200 | [diff] [blame] | 2415 | /*[clinic input] |
| 2416 | list.reverse |
| 2417 | |
| 2418 | Reverse *IN PLACE*. |
| 2419 | [clinic start generated code]*/ |
| 2420 | |
Guido van Rossum | b86c549 | 2001-02-12 22:06:02 +0000 | [diff] [blame] | 2421 | static PyObject * |
Serhiy Storchaka | fdd42c4 | 2017-03-11 09:19:20 +0200 | [diff] [blame] | 2422 | list_reverse_impl(PyListObject *self) |
| 2423 | /*[clinic end generated code: output=482544fc451abea9 input=eefd4c3ae1bc9887]*/ |
Guido van Rossum | b86c549 | 2001-02-12 22:06:02 +0000 | [diff] [blame] | 2424 | { |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 2425 | if (Py_SIZE(self) > 1) |
| 2426 | reverse_slice(self->ob_item, self->ob_item + Py_SIZE(self)); |
| 2427 | Py_RETURN_NONE; |
Guido van Rossum | ed98d48 | 1991-03-06 13:07:53 +0000 | [diff] [blame] | 2428 | } |
| 2429 | |
Guido van Rossum | 84c76f5 | 1990-10-30 13:32:20 +0000 | [diff] [blame] | 2430 | int |
Fred Drake | a2f5511 | 2000-07-09 15:16:51 +0000 | [diff] [blame] | 2431 | PyList_Reverse(PyObject *v) |
Guido van Rossum | b0fe3a9 | 1995-01-17 16:34:45 +0000 | [diff] [blame] | 2432 | { |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 2433 | PyListObject *self = (PyListObject *)v; |
Tim Peters | 6063e26 | 2002-08-08 01:06:39 +0000 | [diff] [blame] | 2434 | |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 2435 | if (v == NULL || !PyList_Check(v)) { |
| 2436 | PyErr_BadInternalCall(); |
| 2437 | return -1; |
| 2438 | } |
| 2439 | if (Py_SIZE(self) > 1) |
| 2440 | reverse_slice(self->ob_item, self->ob_item + Py_SIZE(self)); |
| 2441 | return 0; |
Guido van Rossum | b0fe3a9 | 1995-01-17 16:34:45 +0000 | [diff] [blame] | 2442 | } |
| 2443 | |
Guido van Rossum | c0b618a | 1997-05-02 03:12:38 +0000 | [diff] [blame] | 2444 | PyObject * |
Fred Drake | a2f5511 | 2000-07-09 15:16:51 +0000 | [diff] [blame] | 2445 | PyList_AsTuple(PyObject *v) |
Guido van Rossum | 6cd2fe0 | 1994-08-29 12:45:32 +0000 | [diff] [blame] | 2446 | { |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 2447 | PyObject *w; |
| 2448 | PyObject **p, **q; |
| 2449 | Py_ssize_t n; |
| 2450 | if (v == NULL || !PyList_Check(v)) { |
| 2451 | PyErr_BadInternalCall(); |
| 2452 | return NULL; |
| 2453 | } |
| 2454 | n = Py_SIZE(v); |
| 2455 | w = PyTuple_New(n); |
| 2456 | if (w == NULL) |
| 2457 | return NULL; |
| 2458 | p = ((PyTupleObject *)w)->ob_item; |
| 2459 | q = ((PyListObject *)v)->ob_item; |
| 2460 | while (--n >= 0) { |
| 2461 | Py_INCREF(*q); |
| 2462 | *p = *q; |
| 2463 | p++; |
| 2464 | q++; |
| 2465 | } |
| 2466 | return w; |
Guido van Rossum | 6cd2fe0 | 1994-08-29 12:45:32 +0000 | [diff] [blame] | 2467 | } |
| 2468 | |
Serhiy Storchaka | fdd42c4 | 2017-03-11 09:19:20 +0200 | [diff] [blame] | 2469 | /*[clinic input] |
| 2470 | list.index |
Guido van Rossum | 4aa24f9 | 2000-02-24 15:23:03 +0000 | [diff] [blame] | 2471 | |
Serhiy Storchaka | fdd42c4 | 2017-03-11 09:19:20 +0200 | [diff] [blame] | 2472 | value: object |
Serhiy Storchaka | 80ec836 | 2017-03-19 19:37:40 +0200 | [diff] [blame] | 2473 | start: slice_index(accept={int}) = 0 |
| 2474 | stop: slice_index(accept={int}, c_default="PY_SSIZE_T_MAX") = sys.maxsize |
Serhiy Storchaka | fdd42c4 | 2017-03-11 09:19:20 +0200 | [diff] [blame] | 2475 | / |
| 2476 | |
| 2477 | Return first index of value. |
| 2478 | |
| 2479 | Raises ValueError if the value is not present. |
| 2480 | [clinic start generated code]*/ |
| 2481 | |
| 2482 | static PyObject * |
| 2483 | list_index_impl(PyListObject *self, PyObject *value, Py_ssize_t start, |
| 2484 | Py_ssize_t stop) |
Serhiy Storchaka | 80ec836 | 2017-03-19 19:37:40 +0200 | [diff] [blame] | 2485 | /*[clinic end generated code: output=ec51b88787e4e481 input=40ec5826303a0eb1]*/ |
Serhiy Storchaka | fdd42c4 | 2017-03-11 09:19:20 +0200 | [diff] [blame] | 2486 | { |
| 2487 | Py_ssize_t i; |
| 2488 | |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 2489 | if (start < 0) { |
| 2490 | start += Py_SIZE(self); |
| 2491 | if (start < 0) |
| 2492 | start = 0; |
| 2493 | } |
| 2494 | if (stop < 0) { |
| 2495 | stop += Py_SIZE(self); |
| 2496 | if (stop < 0) |
| 2497 | stop = 0; |
| 2498 | } |
| 2499 | for (i = start; i < stop && i < Py_SIZE(self); i++) { |
Serhiy Storchaka | fdd42c4 | 2017-03-11 09:19:20 +0200 | [diff] [blame] | 2500 | int cmp = PyObject_RichCompareBool(self->ob_item[i], value, Py_EQ); |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 2501 | if (cmp > 0) |
| 2502 | return PyLong_FromSsize_t(i); |
| 2503 | else if (cmp < 0) |
| 2504 | return NULL; |
| 2505 | } |
Serhiy Storchaka | fdd42c4 | 2017-03-11 09:19:20 +0200 | [diff] [blame] | 2506 | PyErr_Format(PyExc_ValueError, "%R is not in list", value); |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 2507 | return NULL; |
Guido van Rossum | ed98d48 | 1991-03-06 13:07:53 +0000 | [diff] [blame] | 2508 | } |
| 2509 | |
Serhiy Storchaka | fdd42c4 | 2017-03-11 09:19:20 +0200 | [diff] [blame] | 2510 | /*[clinic input] |
| 2511 | list.count |
| 2512 | |
| 2513 | value: object |
| 2514 | / |
| 2515 | |
| 2516 | Return number of occurrences of value. |
| 2517 | [clinic start generated code]*/ |
| 2518 | |
Guido van Rossum | c0b618a | 1997-05-02 03:12:38 +0000 | [diff] [blame] | 2519 | static PyObject * |
Serhiy Storchaka | fdd42c4 | 2017-03-11 09:19:20 +0200 | [diff] [blame] | 2520 | list_count(PyListObject *self, PyObject *value) |
| 2521 | /*[clinic end generated code: output=b1f5d284205ae714 input=3bdc3a5e6f749565]*/ |
Guido van Rossum | e6f7d18 | 1991-10-20 20:20:40 +0000 | [diff] [blame] | 2522 | { |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 2523 | Py_ssize_t count = 0; |
| 2524 | Py_ssize_t i; |
Guido van Rossum | 4aa24f9 | 2000-02-24 15:23:03 +0000 | [diff] [blame] | 2525 | |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 2526 | for (i = 0; i < Py_SIZE(self); i++) { |
Serhiy Storchaka | fdd42c4 | 2017-03-11 09:19:20 +0200 | [diff] [blame] | 2527 | int cmp = PyObject_RichCompareBool(self->ob_item[i], value, Py_EQ); |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 2528 | if (cmp > 0) |
| 2529 | count++; |
| 2530 | else if (cmp < 0) |
| 2531 | return NULL; |
| 2532 | } |
| 2533 | return PyLong_FromSsize_t(count); |
Guido van Rossum | e6f7d18 | 1991-10-20 20:20:40 +0000 | [diff] [blame] | 2534 | } |
| 2535 | |
Serhiy Storchaka | fdd42c4 | 2017-03-11 09:19:20 +0200 | [diff] [blame] | 2536 | /*[clinic input] |
| 2537 | list.remove |
| 2538 | |
| 2539 | value: object |
| 2540 | / |
| 2541 | |
| 2542 | Remove first occurrence of value. |
| 2543 | |
| 2544 | Raises ValueError if the value is not present. |
| 2545 | [clinic start generated code]*/ |
| 2546 | |
Guido van Rossum | c0b618a | 1997-05-02 03:12:38 +0000 | [diff] [blame] | 2547 | static PyObject * |
Serhiy Storchaka | fdd42c4 | 2017-03-11 09:19:20 +0200 | [diff] [blame] | 2548 | list_remove(PyListObject *self, PyObject *value) |
| 2549 | /*[clinic end generated code: output=f087e1951a5e30d1 input=2dc2ba5bb2fb1f82]*/ |
Guido van Rossum | ed98d48 | 1991-03-06 13:07:53 +0000 | [diff] [blame] | 2550 | { |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 2551 | Py_ssize_t i; |
Guido van Rossum | 4aa24f9 | 2000-02-24 15:23:03 +0000 | [diff] [blame] | 2552 | |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 2553 | for (i = 0; i < Py_SIZE(self); i++) { |
Serhiy Storchaka | fdd42c4 | 2017-03-11 09:19:20 +0200 | [diff] [blame] | 2554 | int cmp = PyObject_RichCompareBool(self->ob_item[i], value, Py_EQ); |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 2555 | if (cmp > 0) { |
| 2556 | if (list_ass_slice(self, i, i+1, |
| 2557 | (PyObject *)NULL) == 0) |
| 2558 | Py_RETURN_NONE; |
| 2559 | return NULL; |
| 2560 | } |
| 2561 | else if (cmp < 0) |
| 2562 | return NULL; |
| 2563 | } |
| 2564 | PyErr_SetString(PyExc_ValueError, "list.remove(x): x not in list"); |
| 2565 | return NULL; |
Guido van Rossum | ed98d48 | 1991-03-06 13:07:53 +0000 | [diff] [blame] | 2566 | } |
| 2567 | |
Jeremy Hylton | 8caad49 | 2000-06-23 14:18:11 +0000 | [diff] [blame] | 2568 | static int |
| 2569 | list_traverse(PyListObject *o, visitproc visit, void *arg) |
| 2570 | { |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 2571 | Py_ssize_t i; |
Jeremy Hylton | 8caad49 | 2000-06-23 14:18:11 +0000 | [diff] [blame] | 2572 | |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 2573 | for (i = Py_SIZE(o); --i >= 0; ) |
| 2574 | Py_VISIT(o->ob_item[i]); |
| 2575 | return 0; |
Jeremy Hylton | 8caad49 | 2000-06-23 14:18:11 +0000 | [diff] [blame] | 2576 | } |
| 2577 | |
Guido van Rossum | 65e1cea | 2001-01-17 22:11:59 +0000 | [diff] [blame] | 2578 | static PyObject * |
| 2579 | list_richcompare(PyObject *v, PyObject *w, int op) |
| 2580 | { |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 2581 | PyListObject *vl, *wl; |
| 2582 | Py_ssize_t i; |
Guido van Rossum | 65e1cea | 2001-01-17 22:11:59 +0000 | [diff] [blame] | 2583 | |
Brian Curtin | dfc80e3 | 2011-08-10 20:28:54 -0500 | [diff] [blame] | 2584 | if (!PyList_Check(v) || !PyList_Check(w)) |
| 2585 | Py_RETURN_NOTIMPLEMENTED; |
Guido van Rossum | 65e1cea | 2001-01-17 22:11:59 +0000 | [diff] [blame] | 2586 | |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 2587 | vl = (PyListObject *)v; |
| 2588 | wl = (PyListObject *)w; |
Guido van Rossum | 65e1cea | 2001-01-17 22:11:59 +0000 | [diff] [blame] | 2589 | |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 2590 | if (Py_SIZE(vl) != Py_SIZE(wl) && (op == Py_EQ || op == Py_NE)) { |
| 2591 | /* Shortcut: if the lengths differ, the lists differ */ |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 2592 | if (op == Py_EQ) |
stratakis | e8b1965 | 2017-11-02 11:32:54 +0100 | [diff] [blame] | 2593 | Py_RETURN_FALSE; |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 2594 | else |
stratakis | e8b1965 | 2017-11-02 11:32:54 +0100 | [diff] [blame] | 2595 | Py_RETURN_TRUE; |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 2596 | } |
Guido van Rossum | 65e1cea | 2001-01-17 22:11:59 +0000 | [diff] [blame] | 2597 | |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 2598 | /* Search for the first index where items are different */ |
| 2599 | for (i = 0; i < Py_SIZE(vl) && i < Py_SIZE(wl); i++) { |
| 2600 | int k = PyObject_RichCompareBool(vl->ob_item[i], |
| 2601 | wl->ob_item[i], Py_EQ); |
| 2602 | if (k < 0) |
| 2603 | return NULL; |
| 2604 | if (!k) |
| 2605 | break; |
| 2606 | } |
Guido van Rossum | 65e1cea | 2001-01-17 22:11:59 +0000 | [diff] [blame] | 2607 | |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 2608 | if (i >= Py_SIZE(vl) || i >= Py_SIZE(wl)) { |
| 2609 | /* No more items to compare -- compare sizes */ |
stratakis | e8b1965 | 2017-11-02 11:32:54 +0100 | [diff] [blame] | 2610 | Py_RETURN_RICHCOMPARE(Py_SIZE(vl), Py_SIZE(wl), op); |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 2611 | } |
Guido van Rossum | 65e1cea | 2001-01-17 22:11:59 +0000 | [diff] [blame] | 2612 | |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 2613 | /* We have an item that differs -- shortcuts for EQ/NE */ |
| 2614 | if (op == Py_EQ) { |
Serhiy Storchaka | 228b12e | 2017-01-23 09:47:21 +0200 | [diff] [blame] | 2615 | Py_RETURN_FALSE; |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 2616 | } |
| 2617 | if (op == Py_NE) { |
Serhiy Storchaka | 228b12e | 2017-01-23 09:47:21 +0200 | [diff] [blame] | 2618 | Py_RETURN_TRUE; |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 2619 | } |
Guido van Rossum | 65e1cea | 2001-01-17 22:11:59 +0000 | [diff] [blame] | 2620 | |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 2621 | /* Compare the final item again using the proper operator */ |
| 2622 | return PyObject_RichCompare(vl->ob_item[i], wl->ob_item[i], op); |
Guido van Rossum | 65e1cea | 2001-01-17 22:11:59 +0000 | [diff] [blame] | 2623 | } |
| 2624 | |
Serhiy Storchaka | fdd42c4 | 2017-03-11 09:19:20 +0200 | [diff] [blame] | 2625 | /*[clinic input] |
| 2626 | list.__init__ |
| 2627 | |
| 2628 | iterable: object(c_default="NULL") = () |
| 2629 | / |
| 2630 | |
| 2631 | Built-in mutable sequence. |
| 2632 | |
| 2633 | If no argument is given, the constructor creates a new empty list. |
| 2634 | The argument must be an iterable if specified. |
| 2635 | [clinic start generated code]*/ |
| 2636 | |
Tim Peters | 6d6c1a3 | 2001-08-02 04:15:00 +0000 | [diff] [blame] | 2637 | static int |
Serhiy Storchaka | fdd42c4 | 2017-03-11 09:19:20 +0200 | [diff] [blame] | 2638 | list___init___impl(PyListObject *self, PyObject *iterable) |
| 2639 | /*[clinic end generated code: output=0f3c21379d01de48 input=b3f3fe7206af8f6b]*/ |
Tim Peters | 6d6c1a3 | 2001-08-02 04:15:00 +0000 | [diff] [blame] | 2640 | { |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 2641 | /* Verify list invariants established by PyType_GenericAlloc() */ |
| 2642 | assert(0 <= Py_SIZE(self)); |
| 2643 | assert(Py_SIZE(self) <= self->allocated || self->allocated == -1); |
| 2644 | assert(self->ob_item != NULL || |
| 2645 | self->allocated == 0 || self->allocated == -1); |
Raymond Hettinger | c0aaa2d | 2004-07-29 23:31:29 +0000 | [diff] [blame] | 2646 | |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 2647 | /* Empty previous contents */ |
| 2648 | if (self->ob_item != NULL) { |
Serhiy Storchaka | fdd42c4 | 2017-03-11 09:19:20 +0200 | [diff] [blame] | 2649 | (void)_list_clear(self); |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 2650 | } |
Serhiy Storchaka | fdd42c4 | 2017-03-11 09:19:20 +0200 | [diff] [blame] | 2651 | if (iterable != NULL) { |
| 2652 | PyObject *rv = list_extend(self, iterable); |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 2653 | if (rv == NULL) |
| 2654 | return -1; |
| 2655 | Py_DECREF(rv); |
| 2656 | } |
| 2657 | return 0; |
Tim Peters | 6d6c1a3 | 2001-08-02 04:15:00 +0000 | [diff] [blame] | 2658 | } |
| 2659 | |
Serhiy Storchaka | fdd42c4 | 2017-03-11 09:19:20 +0200 | [diff] [blame] | 2660 | /*[clinic input] |
| 2661 | list.__sizeof__ |
| 2662 | |
| 2663 | Return the size of the list in memory, in bytes. |
| 2664 | [clinic start generated code]*/ |
| 2665 | |
Martin v. Löwis | 00709aa | 2008-06-04 14:18:43 +0000 | [diff] [blame] | 2666 | static PyObject * |
Serhiy Storchaka | fdd42c4 | 2017-03-11 09:19:20 +0200 | [diff] [blame] | 2667 | list___sizeof___impl(PyListObject *self) |
| 2668 | /*[clinic end generated code: output=3417541f95f9a53e input=b8030a5d5ce8a187]*/ |
Martin v. Löwis | 00709aa | 2008-06-04 14:18:43 +0000 | [diff] [blame] | 2669 | { |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 2670 | Py_ssize_t res; |
Martin v. Löwis | 00709aa | 2008-06-04 14:18:43 +0000 | [diff] [blame] | 2671 | |
Serhiy Storchaka | 5c4064e | 2015-12-19 20:05:25 +0200 | [diff] [blame] | 2672 | res = _PyObject_SIZE(Py_TYPE(self)) + self->allocated * sizeof(void*); |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 2673 | return PyLong_FromSsize_t(res); |
Martin v. Löwis | 00709aa | 2008-06-04 14:18:43 +0000 | [diff] [blame] | 2674 | } |
| 2675 | |
Raymond Hettinger | 1021c44 | 2003-11-07 15:38:09 +0000 | [diff] [blame] | 2676 | static PyObject *list_iter(PyObject *seq); |
Raymond Hettinger | 8f5cdaa | 2003-12-13 11:26:12 +0000 | [diff] [blame] | 2677 | static PyObject *list_subscript(PyListObject*, PyObject*); |
| 2678 | |
Guido van Rossum | c0b618a | 1997-05-02 03:12:38 +0000 | [diff] [blame] | 2679 | static PyMethodDef list_methods[] = { |
Serhiy Storchaka | fdd42c4 | 2017-03-11 09:19:20 +0200 | [diff] [blame] | 2680 | {"__getitem__", (PyCFunction)list_subscript, METH_O|METH_COEXIST, "x.__getitem__(y) <==> x[y]"}, |
| 2681 | LIST___REVERSED___METHODDEF |
| 2682 | LIST___SIZEOF___METHODDEF |
| 2683 | LIST_CLEAR_METHODDEF |
| 2684 | LIST_COPY_METHODDEF |
| 2685 | LIST_APPEND_METHODDEF |
| 2686 | LIST_INSERT_METHODDEF |
| 2687 | LIST_EXTEND_METHODDEF |
| 2688 | LIST_POP_METHODDEF |
| 2689 | LIST_REMOVE_METHODDEF |
| 2690 | LIST_INDEX_METHODDEF |
| 2691 | LIST_COUNT_METHODDEF |
| 2692 | LIST_REVERSE_METHODDEF |
| 2693 | LIST_SORT_METHODDEF |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 2694 | {NULL, NULL} /* sentinel */ |
Guido van Rossum | 85a5fbb | 1990-10-14 12:07:46 +0000 | [diff] [blame] | 2695 | }; |
| 2696 | |
Guido van Rossum | c0b618a | 1997-05-02 03:12:38 +0000 | [diff] [blame] | 2697 | static PySequenceMethods list_as_sequence = { |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 2698 | (lenfunc)list_length, /* sq_length */ |
| 2699 | (binaryfunc)list_concat, /* sq_concat */ |
| 2700 | (ssizeargfunc)list_repeat, /* sq_repeat */ |
| 2701 | (ssizeargfunc)list_item, /* sq_item */ |
| 2702 | 0, /* sq_slice */ |
| 2703 | (ssizeobjargproc)list_ass_item, /* sq_ass_item */ |
| 2704 | 0, /* sq_ass_slice */ |
| 2705 | (objobjproc)list_contains, /* sq_contains */ |
| 2706 | (binaryfunc)list_inplace_concat, /* sq_inplace_concat */ |
| 2707 | (ssizeargfunc)list_inplace_repeat, /* sq_inplace_repeat */ |
Guido van Rossum | 85a5fbb | 1990-10-14 12:07:46 +0000 | [diff] [blame] | 2708 | }; |
| 2709 | |
Jeremy Hylton | a4b4c3b | 2002-07-13 03:51:17 +0000 | [diff] [blame] | 2710 | static PyObject * |
Michael W. Hudson | 5efaf7e | 2002-06-11 10:55:12 +0000 | [diff] [blame] | 2711 | list_subscript(PyListObject* self, PyObject* item) |
| 2712 | { |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 2713 | if (PyIndex_Check(item)) { |
| 2714 | Py_ssize_t i; |
| 2715 | i = PyNumber_AsSsize_t(item, PyExc_IndexError); |
| 2716 | if (i == -1 && PyErr_Occurred()) |
| 2717 | return NULL; |
| 2718 | if (i < 0) |
| 2719 | i += PyList_GET_SIZE(self); |
| 2720 | return list_item(self, i); |
| 2721 | } |
| 2722 | else if (PySlice_Check(item)) { |
| 2723 | Py_ssize_t start, stop, step, slicelength, cur, i; |
| 2724 | PyObject* result; |
| 2725 | PyObject* it; |
| 2726 | PyObject **src, **dest; |
Michael W. Hudson | 5efaf7e | 2002-06-11 10:55:12 +0000 | [diff] [blame] | 2727 | |
Serhiy Storchaka | b879fe8 | 2017-04-08 09:53:51 +0300 | [diff] [blame] | 2728 | if (PySlice_Unpack(item, &start, &stop, &step) < 0) { |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 2729 | return NULL; |
| 2730 | } |
Serhiy Storchaka | b879fe8 | 2017-04-08 09:53:51 +0300 | [diff] [blame] | 2731 | slicelength = PySlice_AdjustIndices(Py_SIZE(self), &start, &stop, |
| 2732 | step); |
Michael W. Hudson | 5efaf7e | 2002-06-11 10:55:12 +0000 | [diff] [blame] | 2733 | |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 2734 | if (slicelength <= 0) { |
| 2735 | return PyList_New(0); |
| 2736 | } |
| 2737 | else if (step == 1) { |
| 2738 | return list_slice(self, start, stop); |
| 2739 | } |
| 2740 | else { |
| 2741 | result = PyList_New(slicelength); |
| 2742 | if (!result) return NULL; |
Michael W. Hudson | 5efaf7e | 2002-06-11 10:55:12 +0000 | [diff] [blame] | 2743 | |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 2744 | src = self->ob_item; |
| 2745 | dest = ((PyListObject *)result)->ob_item; |
| 2746 | for (cur = start, i = 0; i < slicelength; |
Mark Dickinson | c7d93b7 | 2011-09-25 15:34:32 +0100 | [diff] [blame] | 2747 | cur += (size_t)step, i++) { |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 2748 | it = src[cur]; |
| 2749 | Py_INCREF(it); |
| 2750 | dest[i] = it; |
| 2751 | } |
Tim Peters | 3b01a12 | 2002-07-19 02:35:45 +0000 | [diff] [blame] | 2752 | |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 2753 | return result; |
| 2754 | } |
| 2755 | } |
| 2756 | else { |
| 2757 | PyErr_Format(PyExc_TypeError, |
Terry Jan Reedy | ffff144 | 2014-08-02 01:30:37 -0400 | [diff] [blame] | 2758 | "list indices must be integers or slices, not %.200s", |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 2759 | item->ob_type->tp_name); |
| 2760 | return NULL; |
| 2761 | } |
Michael W. Hudson | 5efaf7e | 2002-06-11 10:55:12 +0000 | [diff] [blame] | 2762 | } |
| 2763 | |
Tim Peters | 3b01a12 | 2002-07-19 02:35:45 +0000 | [diff] [blame] | 2764 | static int |
Michael W. Hudson | 5efaf7e | 2002-06-11 10:55:12 +0000 | [diff] [blame] | 2765 | list_ass_subscript(PyListObject* self, PyObject* item, PyObject* value) |
| 2766 | { |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 2767 | if (PyIndex_Check(item)) { |
| 2768 | Py_ssize_t i = PyNumber_AsSsize_t(item, PyExc_IndexError); |
| 2769 | if (i == -1 && PyErr_Occurred()) |
| 2770 | return -1; |
| 2771 | if (i < 0) |
| 2772 | i += PyList_GET_SIZE(self); |
| 2773 | return list_ass_item(self, i, value); |
| 2774 | } |
| 2775 | else if (PySlice_Check(item)) { |
| 2776 | Py_ssize_t start, stop, step, slicelength; |
Michael W. Hudson | 5efaf7e | 2002-06-11 10:55:12 +0000 | [diff] [blame] | 2777 | |
Serhiy Storchaka | b879fe8 | 2017-04-08 09:53:51 +0300 | [diff] [blame] | 2778 | if (PySlice_Unpack(item, &start, &stop, &step) < 0) { |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 2779 | return -1; |
| 2780 | } |
Serhiy Storchaka | b879fe8 | 2017-04-08 09:53:51 +0300 | [diff] [blame] | 2781 | slicelength = PySlice_AdjustIndices(Py_SIZE(self), &start, &stop, |
| 2782 | step); |
Michael W. Hudson | 5efaf7e | 2002-06-11 10:55:12 +0000 | [diff] [blame] | 2783 | |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 2784 | if (step == 1) |
| 2785 | return list_ass_slice(self, start, stop, value); |
Michael W. Hudson | 9c14bad | 2002-06-19 15:44:15 +0000 | [diff] [blame] | 2786 | |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 2787 | /* Make sure s[5:2] = [..] inserts at the right place: |
| 2788 | before 5, not before 2. */ |
| 2789 | if ((step < 0 && start < stop) || |
| 2790 | (step > 0 && start > stop)) |
| 2791 | stop = start; |
Thomas Wouters | ed03b41 | 2007-08-28 21:37:11 +0000 | [diff] [blame] | 2792 | |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 2793 | if (value == NULL) { |
| 2794 | /* delete slice */ |
| 2795 | PyObject **garbage; |
| 2796 | size_t cur; |
| 2797 | Py_ssize_t i; |
Victor Stinner | 35f2803 | 2013-11-21 12:16:35 +0100 | [diff] [blame] | 2798 | int res; |
Tim Peters | 3b01a12 | 2002-07-19 02:35:45 +0000 | [diff] [blame] | 2799 | |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 2800 | if (slicelength <= 0) |
| 2801 | return 0; |
Michael W. Hudson | 5efaf7e | 2002-06-11 10:55:12 +0000 | [diff] [blame] | 2802 | |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 2803 | if (step < 0) { |
| 2804 | stop = start + 1; |
| 2805 | start = stop + step*(slicelength - 1) - 1; |
| 2806 | step = -step; |
| 2807 | } |
Michael W. Hudson | 5efaf7e | 2002-06-11 10:55:12 +0000 | [diff] [blame] | 2808 | |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 2809 | garbage = (PyObject**) |
| 2810 | PyMem_MALLOC(slicelength*sizeof(PyObject*)); |
| 2811 | if (!garbage) { |
| 2812 | PyErr_NoMemory(); |
| 2813 | return -1; |
| 2814 | } |
Tim Peters | 3b01a12 | 2002-07-19 02:35:45 +0000 | [diff] [blame] | 2815 | |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 2816 | /* drawing pictures might help understand these for |
| 2817 | loops. Basically, we memmove the parts of the |
| 2818 | list that are *not* part of the slice: step-1 |
| 2819 | items for each item that is part of the slice, |
| 2820 | and then tail end of the list that was not |
| 2821 | covered by the slice */ |
| 2822 | for (cur = start, i = 0; |
| 2823 | cur < (size_t)stop; |
| 2824 | cur += step, i++) { |
| 2825 | Py_ssize_t lim = step - 1; |
Michael W. Hudson | 56796f6 | 2002-07-29 14:35:04 +0000 | [diff] [blame] | 2826 | |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 2827 | garbage[i] = PyList_GET_ITEM(self, cur); |
Michael W. Hudson | 5efaf7e | 2002-06-11 10:55:12 +0000 | [diff] [blame] | 2828 | |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 2829 | if (cur + step >= (size_t)Py_SIZE(self)) { |
| 2830 | lim = Py_SIZE(self) - cur - 1; |
| 2831 | } |
Michael W. Hudson | 56796f6 | 2002-07-29 14:35:04 +0000 | [diff] [blame] | 2832 | |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 2833 | memmove(self->ob_item + cur - i, |
| 2834 | self->ob_item + cur + 1, |
| 2835 | lim * sizeof(PyObject *)); |
| 2836 | } |
Mark Dickinson | c7d93b7 | 2011-09-25 15:34:32 +0100 | [diff] [blame] | 2837 | cur = start + (size_t)slicelength * step; |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 2838 | if (cur < (size_t)Py_SIZE(self)) { |
| 2839 | memmove(self->ob_item + cur - slicelength, |
| 2840 | self->ob_item + cur, |
| 2841 | (Py_SIZE(self) - cur) * |
| 2842 | sizeof(PyObject *)); |
| 2843 | } |
Raymond Hettinger | a6366fe | 2004-03-09 13:05:22 +0000 | [diff] [blame] | 2844 | |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 2845 | Py_SIZE(self) -= slicelength; |
Victor Stinner | 35f2803 | 2013-11-21 12:16:35 +0100 | [diff] [blame] | 2846 | res = list_resize(self, Py_SIZE(self)); |
Michael W. Hudson | 5efaf7e | 2002-06-11 10:55:12 +0000 | [diff] [blame] | 2847 | |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 2848 | for (i = 0; i < slicelength; i++) { |
| 2849 | Py_DECREF(garbage[i]); |
| 2850 | } |
| 2851 | PyMem_FREE(garbage); |
Michael W. Hudson | 5efaf7e | 2002-06-11 10:55:12 +0000 | [diff] [blame] | 2852 | |
Victor Stinner | 35f2803 | 2013-11-21 12:16:35 +0100 | [diff] [blame] | 2853 | return res; |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 2854 | } |
| 2855 | else { |
| 2856 | /* assign slice */ |
| 2857 | PyObject *ins, *seq; |
| 2858 | PyObject **garbage, **seqitems, **selfitems; |
| 2859 | Py_ssize_t cur, i; |
Michael W. Hudson | 5efaf7e | 2002-06-11 10:55:12 +0000 | [diff] [blame] | 2860 | |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 2861 | /* protect against a[::-1] = a */ |
| 2862 | if (self == (PyListObject*)value) { |
| 2863 | seq = list_slice((PyListObject*)value, 0, |
| 2864 | PyList_GET_SIZE(value)); |
| 2865 | } |
| 2866 | else { |
| 2867 | seq = PySequence_Fast(value, |
| 2868 | "must assign iterable " |
| 2869 | "to extended slice"); |
| 2870 | } |
| 2871 | if (!seq) |
| 2872 | return -1; |
Michael W. Hudson | a69c030 | 2002-12-05 21:32:32 +0000 | [diff] [blame] | 2873 | |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 2874 | if (PySequence_Fast_GET_SIZE(seq) != slicelength) { |
| 2875 | PyErr_Format(PyExc_ValueError, |
| 2876 | "attempt to assign sequence of " |
| 2877 | "size %zd to extended slice of " |
| 2878 | "size %zd", |
| 2879 | PySequence_Fast_GET_SIZE(seq), |
| 2880 | slicelength); |
| 2881 | Py_DECREF(seq); |
| 2882 | return -1; |
| 2883 | } |
Michael W. Hudson | a69c030 | 2002-12-05 21:32:32 +0000 | [diff] [blame] | 2884 | |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 2885 | if (!slicelength) { |
| 2886 | Py_DECREF(seq); |
| 2887 | return 0; |
| 2888 | } |
Michael W. Hudson | 5efaf7e | 2002-06-11 10:55:12 +0000 | [diff] [blame] | 2889 | |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 2890 | garbage = (PyObject**) |
| 2891 | PyMem_MALLOC(slicelength*sizeof(PyObject*)); |
| 2892 | if (!garbage) { |
| 2893 | Py_DECREF(seq); |
| 2894 | PyErr_NoMemory(); |
| 2895 | return -1; |
| 2896 | } |
Tim Peters | 3b01a12 | 2002-07-19 02:35:45 +0000 | [diff] [blame] | 2897 | |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 2898 | selfitems = self->ob_item; |
| 2899 | seqitems = PySequence_Fast_ITEMS(seq); |
| 2900 | for (cur = start, i = 0; i < slicelength; |
Mark Dickinson | c7d93b7 | 2011-09-25 15:34:32 +0100 | [diff] [blame] | 2901 | cur += (size_t)step, i++) { |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 2902 | garbage[i] = selfitems[cur]; |
| 2903 | ins = seqitems[i]; |
| 2904 | Py_INCREF(ins); |
| 2905 | selfitems[cur] = ins; |
| 2906 | } |
Michael W. Hudson | 5efaf7e | 2002-06-11 10:55:12 +0000 | [diff] [blame] | 2907 | |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 2908 | for (i = 0; i < slicelength; i++) { |
| 2909 | Py_DECREF(garbage[i]); |
| 2910 | } |
Tim Peters | 3b01a12 | 2002-07-19 02:35:45 +0000 | [diff] [blame] | 2911 | |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 2912 | PyMem_FREE(garbage); |
| 2913 | Py_DECREF(seq); |
Tim Peters | 3b01a12 | 2002-07-19 02:35:45 +0000 | [diff] [blame] | 2914 | |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 2915 | return 0; |
| 2916 | } |
| 2917 | } |
| 2918 | else { |
| 2919 | PyErr_Format(PyExc_TypeError, |
Terry Jan Reedy | ffff144 | 2014-08-02 01:30:37 -0400 | [diff] [blame] | 2920 | "list indices must be integers or slices, not %.200s", |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 2921 | item->ob_type->tp_name); |
| 2922 | return -1; |
| 2923 | } |
Michael W. Hudson | 5efaf7e | 2002-06-11 10:55:12 +0000 | [diff] [blame] | 2924 | } |
| 2925 | |
| 2926 | static PyMappingMethods list_as_mapping = { |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 2927 | (lenfunc)list_length, |
| 2928 | (binaryfunc)list_subscript, |
| 2929 | (objobjargproc)list_ass_subscript |
Michael W. Hudson | 5efaf7e | 2002-06-11 10:55:12 +0000 | [diff] [blame] | 2930 | }; |
| 2931 | |
Guido van Rossum | c0b618a | 1997-05-02 03:12:38 +0000 | [diff] [blame] | 2932 | PyTypeObject PyList_Type = { |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 2933 | PyVarObject_HEAD_INIT(&PyType_Type, 0) |
| 2934 | "list", |
| 2935 | sizeof(PyListObject), |
| 2936 | 0, |
| 2937 | (destructor)list_dealloc, /* tp_dealloc */ |
| 2938 | 0, /* tp_print */ |
| 2939 | 0, /* tp_getattr */ |
| 2940 | 0, /* tp_setattr */ |
| 2941 | 0, /* tp_reserved */ |
| 2942 | (reprfunc)list_repr, /* tp_repr */ |
| 2943 | 0, /* tp_as_number */ |
| 2944 | &list_as_sequence, /* tp_as_sequence */ |
| 2945 | &list_as_mapping, /* tp_as_mapping */ |
Georg Brandl | 00da4e0 | 2010-10-18 07:32:48 +0000 | [diff] [blame] | 2946 | PyObject_HashNotImplemented, /* tp_hash */ |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 2947 | 0, /* tp_call */ |
| 2948 | 0, /* tp_str */ |
| 2949 | PyObject_GenericGetAttr, /* tp_getattro */ |
| 2950 | 0, /* tp_setattro */ |
| 2951 | 0, /* tp_as_buffer */ |
| 2952 | Py_TPFLAGS_DEFAULT | Py_TPFLAGS_HAVE_GC | |
Serhiy Storchaka | fdd42c4 | 2017-03-11 09:19:20 +0200 | [diff] [blame] | 2953 | Py_TPFLAGS_BASETYPE | Py_TPFLAGS_LIST_SUBCLASS, /* tp_flags */ |
| 2954 | list___init____doc__, /* tp_doc */ |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 2955 | (traverseproc)list_traverse, /* tp_traverse */ |
Serhiy Storchaka | fdd42c4 | 2017-03-11 09:19:20 +0200 | [diff] [blame] | 2956 | (inquiry)_list_clear, /* tp_clear */ |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 2957 | list_richcompare, /* tp_richcompare */ |
| 2958 | 0, /* tp_weaklistoffset */ |
| 2959 | list_iter, /* tp_iter */ |
| 2960 | 0, /* tp_iternext */ |
| 2961 | list_methods, /* tp_methods */ |
| 2962 | 0, /* tp_members */ |
| 2963 | 0, /* tp_getset */ |
| 2964 | 0, /* tp_base */ |
| 2965 | 0, /* tp_dict */ |
| 2966 | 0, /* tp_descr_get */ |
| 2967 | 0, /* tp_descr_set */ |
| 2968 | 0, /* tp_dictoffset */ |
Serhiy Storchaka | fdd42c4 | 2017-03-11 09:19:20 +0200 | [diff] [blame] | 2969 | (initproc)list___init__, /* tp_init */ |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 2970 | PyType_GenericAlloc, /* tp_alloc */ |
| 2971 | PyType_GenericNew, /* tp_new */ |
| 2972 | PyObject_GC_Del, /* tp_free */ |
Guido van Rossum | 85a5fbb | 1990-10-14 12:07:46 +0000 | [diff] [blame] | 2973 | }; |
Guido van Rossum | 4c4e7df | 1998-06-16 15:18:28 +0000 | [diff] [blame] | 2974 | |
Raymond Hettinger | 14bd6de | 2002-05-31 21:40:38 +0000 | [diff] [blame] | 2975 | /*********************** List Iterator **************************/ |
| 2976 | |
| 2977 | typedef struct { |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 2978 | PyObject_HEAD |
Victor Stinner | 7660b88 | 2013-06-24 23:59:24 +0200 | [diff] [blame] | 2979 | Py_ssize_t it_index; |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 2980 | PyListObject *it_seq; /* Set to NULL when iterator is exhausted */ |
Raymond Hettinger | 14bd6de | 2002-05-31 21:40:38 +0000 | [diff] [blame] | 2981 | } listiterobject; |
| 2982 | |
Thomas Wouters | 49fd7fa | 2006-04-21 10:40:58 +0000 | [diff] [blame] | 2983 | static void listiter_dealloc(listiterobject *); |
| 2984 | static int listiter_traverse(listiterobject *, visitproc, void *); |
| 2985 | static PyObject *listiter_next(listiterobject *); |
Siddhesh Poyarekar | 55edd0c | 2018-04-30 00:29:33 +0530 | [diff] [blame^] | 2986 | static PyObject *listiter_len(listiterobject *, PyObject *); |
Kristján Valur Jónsson | 31668b8 | 2012-04-03 10:49:41 +0000 | [diff] [blame] | 2987 | static PyObject *listiter_reduce_general(void *_it, int forward); |
Siddhesh Poyarekar | 55edd0c | 2018-04-30 00:29:33 +0530 | [diff] [blame^] | 2988 | static PyObject *listiter_reduce(listiterobject *, PyObject *); |
Kristján Valur Jónsson | 31668b8 | 2012-04-03 10:49:41 +0000 | [diff] [blame] | 2989 | static PyObject *listiter_setstate(listiterobject *, PyObject *state); |
Raymond Hettinger | 435bf58 | 2004-03-18 22:43:10 +0000 | [diff] [blame] | 2990 | |
Armin Rigo | f5b3e36 | 2006-02-11 21:32:43 +0000 | [diff] [blame] | 2991 | PyDoc_STRVAR(length_hint_doc, "Private method returning an estimate of len(list(it))."); |
Kristján Valur Jónsson | 31668b8 | 2012-04-03 10:49:41 +0000 | [diff] [blame] | 2992 | PyDoc_STRVAR(reduce_doc, "Return state information for pickling."); |
| 2993 | PyDoc_STRVAR(setstate_doc, "Set state information for unpickling."); |
Raymond Hettinger | 6b27cda | 2005-09-24 21:23:05 +0000 | [diff] [blame] | 2994 | |
| 2995 | static PyMethodDef listiter_methods[] = { |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 2996 | {"__length_hint__", (PyCFunction)listiter_len, METH_NOARGS, length_hint_doc}, |
Kristján Valur Jónsson | 31668b8 | 2012-04-03 10:49:41 +0000 | [diff] [blame] | 2997 | {"__reduce__", (PyCFunction)listiter_reduce, METH_NOARGS, reduce_doc}, |
| 2998 | {"__setstate__", (PyCFunction)listiter_setstate, METH_O, setstate_doc}, |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 2999 | {NULL, NULL} /* sentinel */ |
Raymond Hettinger | 435bf58 | 2004-03-18 22:43:10 +0000 | [diff] [blame] | 3000 | }; |
| 3001 | |
Raymond Hettinger | 14bd6de | 2002-05-31 21:40:38 +0000 | [diff] [blame] | 3002 | PyTypeObject PyListIter_Type = { |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 3003 | PyVarObject_HEAD_INIT(&PyType_Type, 0) |
| 3004 | "list_iterator", /* tp_name */ |
| 3005 | sizeof(listiterobject), /* tp_basicsize */ |
| 3006 | 0, /* tp_itemsize */ |
| 3007 | /* methods */ |
| 3008 | (destructor)listiter_dealloc, /* tp_dealloc */ |
| 3009 | 0, /* tp_print */ |
| 3010 | 0, /* tp_getattr */ |
| 3011 | 0, /* tp_setattr */ |
| 3012 | 0, /* tp_reserved */ |
| 3013 | 0, /* tp_repr */ |
| 3014 | 0, /* tp_as_number */ |
| 3015 | 0, /* tp_as_sequence */ |
| 3016 | 0, /* tp_as_mapping */ |
| 3017 | 0, /* tp_hash */ |
| 3018 | 0, /* tp_call */ |
| 3019 | 0, /* tp_str */ |
| 3020 | PyObject_GenericGetAttr, /* tp_getattro */ |
| 3021 | 0, /* tp_setattro */ |
| 3022 | 0, /* tp_as_buffer */ |
| 3023 | Py_TPFLAGS_DEFAULT | Py_TPFLAGS_HAVE_GC,/* tp_flags */ |
| 3024 | 0, /* tp_doc */ |
| 3025 | (traverseproc)listiter_traverse, /* tp_traverse */ |
| 3026 | 0, /* tp_clear */ |
| 3027 | 0, /* tp_richcompare */ |
| 3028 | 0, /* tp_weaklistoffset */ |
| 3029 | PyObject_SelfIter, /* tp_iter */ |
| 3030 | (iternextfunc)listiter_next, /* tp_iternext */ |
| 3031 | listiter_methods, /* tp_methods */ |
| 3032 | 0, /* tp_members */ |
Raymond Hettinger | 14bd6de | 2002-05-31 21:40:38 +0000 | [diff] [blame] | 3033 | }; |
Raymond Hettinger | 1021c44 | 2003-11-07 15:38:09 +0000 | [diff] [blame] | 3034 | |
Thomas Wouters | 49fd7fa | 2006-04-21 10:40:58 +0000 | [diff] [blame] | 3035 | |
| 3036 | static PyObject * |
| 3037 | list_iter(PyObject *seq) |
| 3038 | { |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 3039 | listiterobject *it; |
Thomas Wouters | 49fd7fa | 2006-04-21 10:40:58 +0000 | [diff] [blame] | 3040 | |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 3041 | if (!PyList_Check(seq)) { |
| 3042 | PyErr_BadInternalCall(); |
| 3043 | return NULL; |
| 3044 | } |
| 3045 | it = PyObject_GC_New(listiterobject, &PyListIter_Type); |
| 3046 | if (it == NULL) |
| 3047 | return NULL; |
| 3048 | it->it_index = 0; |
| 3049 | Py_INCREF(seq); |
| 3050 | it->it_seq = (PyListObject *)seq; |
| 3051 | _PyObject_GC_TRACK(it); |
| 3052 | return (PyObject *)it; |
Thomas Wouters | 49fd7fa | 2006-04-21 10:40:58 +0000 | [diff] [blame] | 3053 | } |
| 3054 | |
| 3055 | static void |
| 3056 | listiter_dealloc(listiterobject *it) |
| 3057 | { |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 3058 | _PyObject_GC_UNTRACK(it); |
| 3059 | Py_XDECREF(it->it_seq); |
| 3060 | PyObject_GC_Del(it); |
Thomas Wouters | 49fd7fa | 2006-04-21 10:40:58 +0000 | [diff] [blame] | 3061 | } |
| 3062 | |
| 3063 | static int |
| 3064 | listiter_traverse(listiterobject *it, visitproc visit, void *arg) |
| 3065 | { |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 3066 | Py_VISIT(it->it_seq); |
| 3067 | return 0; |
Thomas Wouters | 49fd7fa | 2006-04-21 10:40:58 +0000 | [diff] [blame] | 3068 | } |
| 3069 | |
| 3070 | static PyObject * |
| 3071 | listiter_next(listiterobject *it) |
| 3072 | { |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 3073 | PyListObject *seq; |
| 3074 | PyObject *item; |
Thomas Wouters | 49fd7fa | 2006-04-21 10:40:58 +0000 | [diff] [blame] | 3075 | |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 3076 | assert(it != NULL); |
| 3077 | seq = it->it_seq; |
| 3078 | if (seq == NULL) |
| 3079 | return NULL; |
| 3080 | assert(PyList_Check(seq)); |
Thomas Wouters | 49fd7fa | 2006-04-21 10:40:58 +0000 | [diff] [blame] | 3081 | |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 3082 | if (it->it_index < PyList_GET_SIZE(seq)) { |
| 3083 | item = PyList_GET_ITEM(seq, it->it_index); |
| 3084 | ++it->it_index; |
| 3085 | Py_INCREF(item); |
| 3086 | return item; |
| 3087 | } |
Thomas Wouters | 49fd7fa | 2006-04-21 10:40:58 +0000 | [diff] [blame] | 3088 | |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 3089 | it->it_seq = NULL; |
Serhiy Storchaka | fbb1c5e | 2016-03-30 20:40:02 +0300 | [diff] [blame] | 3090 | Py_DECREF(seq); |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 3091 | return NULL; |
Thomas Wouters | 49fd7fa | 2006-04-21 10:40:58 +0000 | [diff] [blame] | 3092 | } |
| 3093 | |
| 3094 | static PyObject * |
Siddhesh Poyarekar | 55edd0c | 2018-04-30 00:29:33 +0530 | [diff] [blame^] | 3095 | listiter_len(listiterobject *it, PyObject *Py_UNUSED(ignored)) |
Thomas Wouters | 49fd7fa | 2006-04-21 10:40:58 +0000 | [diff] [blame] | 3096 | { |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 3097 | Py_ssize_t len; |
| 3098 | if (it->it_seq) { |
| 3099 | len = PyList_GET_SIZE(it->it_seq) - it->it_index; |
| 3100 | if (len >= 0) |
| 3101 | return PyLong_FromSsize_t(len); |
| 3102 | } |
| 3103 | return PyLong_FromLong(0); |
Thomas Wouters | 49fd7fa | 2006-04-21 10:40:58 +0000 | [diff] [blame] | 3104 | } |
Kristján Valur Jónsson | 31668b8 | 2012-04-03 10:49:41 +0000 | [diff] [blame] | 3105 | |
| 3106 | static PyObject * |
Siddhesh Poyarekar | 55edd0c | 2018-04-30 00:29:33 +0530 | [diff] [blame^] | 3107 | listiter_reduce(listiterobject *it, PyObject *Py_UNUSED(ignored)) |
Kristján Valur Jónsson | 31668b8 | 2012-04-03 10:49:41 +0000 | [diff] [blame] | 3108 | { |
| 3109 | return listiter_reduce_general(it, 1); |
| 3110 | } |
| 3111 | |
| 3112 | static PyObject * |
| 3113 | listiter_setstate(listiterobject *it, PyObject *state) |
| 3114 | { |
Victor Stinner | 7660b88 | 2013-06-24 23:59:24 +0200 | [diff] [blame] | 3115 | Py_ssize_t index = PyLong_AsSsize_t(state); |
Kristján Valur Jónsson | 31668b8 | 2012-04-03 10:49:41 +0000 | [diff] [blame] | 3116 | if (index == -1 && PyErr_Occurred()) |
| 3117 | return NULL; |
| 3118 | if (it->it_seq != NULL) { |
| 3119 | if (index < 0) |
| 3120 | index = 0; |
Kristján Valur Jónsson | 25dded0 | 2014-03-05 13:47:57 +0000 | [diff] [blame] | 3121 | else if (index > PyList_GET_SIZE(it->it_seq)) |
| 3122 | index = PyList_GET_SIZE(it->it_seq); /* iterator exhausted */ |
Kristján Valur Jónsson | 31668b8 | 2012-04-03 10:49:41 +0000 | [diff] [blame] | 3123 | it->it_index = index; |
| 3124 | } |
| 3125 | Py_RETURN_NONE; |
| 3126 | } |
| 3127 | |
Raymond Hettinger | 1021c44 | 2003-11-07 15:38:09 +0000 | [diff] [blame] | 3128 | /*********************** List Reverse Iterator **************************/ |
| 3129 | |
| 3130 | typedef struct { |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 3131 | PyObject_HEAD |
| 3132 | Py_ssize_t it_index; |
| 3133 | PyListObject *it_seq; /* Set to NULL when iterator is exhausted */ |
Raymond Hettinger | 1021c44 | 2003-11-07 15:38:09 +0000 | [diff] [blame] | 3134 | } listreviterobject; |
| 3135 | |
Thomas Wouters | 49fd7fa | 2006-04-21 10:40:58 +0000 | [diff] [blame] | 3136 | static void listreviter_dealloc(listreviterobject *); |
| 3137 | static int listreviter_traverse(listreviterobject *, visitproc, void *); |
| 3138 | static PyObject *listreviter_next(listreviterobject *); |
Siddhesh Poyarekar | 55edd0c | 2018-04-30 00:29:33 +0530 | [diff] [blame^] | 3139 | static PyObject *listreviter_len(listreviterobject *, PyObject *); |
| 3140 | static PyObject *listreviter_reduce(listreviterobject *, PyObject *); |
Kristján Valur Jónsson | 31668b8 | 2012-04-03 10:49:41 +0000 | [diff] [blame] | 3141 | static PyObject *listreviter_setstate(listreviterobject *, PyObject *); |
Raymond Hettinger | ef9bf40 | 2004-03-10 10:10:42 +0000 | [diff] [blame] | 3142 | |
Raymond Hettinger | f5b6411 | 2008-12-02 21:33:45 +0000 | [diff] [blame] | 3143 | static PyMethodDef listreviter_methods[] = { |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 3144 | {"__length_hint__", (PyCFunction)listreviter_len, METH_NOARGS, length_hint_doc}, |
Kristján Valur Jónsson | 31668b8 | 2012-04-03 10:49:41 +0000 | [diff] [blame] | 3145 | {"__reduce__", (PyCFunction)listreviter_reduce, METH_NOARGS, reduce_doc}, |
| 3146 | {"__setstate__", (PyCFunction)listreviter_setstate, METH_O, setstate_doc}, |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 3147 | {NULL, NULL} /* sentinel */ |
Raymond Hettinger | ef9bf40 | 2004-03-10 10:10:42 +0000 | [diff] [blame] | 3148 | }; |
| 3149 | |
Raymond Hettinger | 1021c44 | 2003-11-07 15:38:09 +0000 | [diff] [blame] | 3150 | PyTypeObject PyListRevIter_Type = { |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 3151 | PyVarObject_HEAD_INIT(&PyType_Type, 0) |
| 3152 | "list_reverseiterator", /* tp_name */ |
| 3153 | sizeof(listreviterobject), /* tp_basicsize */ |
| 3154 | 0, /* tp_itemsize */ |
| 3155 | /* methods */ |
| 3156 | (destructor)listreviter_dealloc, /* tp_dealloc */ |
| 3157 | 0, /* tp_print */ |
| 3158 | 0, /* tp_getattr */ |
| 3159 | 0, /* tp_setattr */ |
| 3160 | 0, /* tp_reserved */ |
| 3161 | 0, /* tp_repr */ |
| 3162 | 0, /* tp_as_number */ |
| 3163 | 0, /* tp_as_sequence */ |
| 3164 | 0, /* tp_as_mapping */ |
| 3165 | 0, /* tp_hash */ |
| 3166 | 0, /* tp_call */ |
| 3167 | 0, /* tp_str */ |
| 3168 | PyObject_GenericGetAttr, /* tp_getattro */ |
| 3169 | 0, /* tp_setattro */ |
| 3170 | 0, /* tp_as_buffer */ |
| 3171 | Py_TPFLAGS_DEFAULT | Py_TPFLAGS_HAVE_GC,/* tp_flags */ |
| 3172 | 0, /* tp_doc */ |
| 3173 | (traverseproc)listreviter_traverse, /* tp_traverse */ |
| 3174 | 0, /* tp_clear */ |
| 3175 | 0, /* tp_richcompare */ |
| 3176 | 0, /* tp_weaklistoffset */ |
| 3177 | PyObject_SelfIter, /* tp_iter */ |
| 3178 | (iternextfunc)listreviter_next, /* tp_iternext */ |
| 3179 | listreviter_methods, /* tp_methods */ |
| 3180 | 0, |
Raymond Hettinger | 1021c44 | 2003-11-07 15:38:09 +0000 | [diff] [blame] | 3181 | }; |
Thomas Wouters | 49fd7fa | 2006-04-21 10:40:58 +0000 | [diff] [blame] | 3182 | |
Serhiy Storchaka | fdd42c4 | 2017-03-11 09:19:20 +0200 | [diff] [blame] | 3183 | /*[clinic input] |
| 3184 | list.__reversed__ |
| 3185 | |
| 3186 | Return a reverse iterator over the list. |
| 3187 | [clinic start generated code]*/ |
| 3188 | |
Thomas Wouters | 49fd7fa | 2006-04-21 10:40:58 +0000 | [diff] [blame] | 3189 | static PyObject * |
Serhiy Storchaka | fdd42c4 | 2017-03-11 09:19:20 +0200 | [diff] [blame] | 3190 | list___reversed___impl(PyListObject *self) |
| 3191 | /*[clinic end generated code: output=b166f073208c888c input=eadb6e17f8a6a280]*/ |
Thomas Wouters | 49fd7fa | 2006-04-21 10:40:58 +0000 | [diff] [blame] | 3192 | { |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 3193 | listreviterobject *it; |
Thomas Wouters | 49fd7fa | 2006-04-21 10:40:58 +0000 | [diff] [blame] | 3194 | |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 3195 | it = PyObject_GC_New(listreviterobject, &PyListRevIter_Type); |
| 3196 | if (it == NULL) |
| 3197 | return NULL; |
Serhiy Storchaka | fdd42c4 | 2017-03-11 09:19:20 +0200 | [diff] [blame] | 3198 | assert(PyList_Check(self)); |
| 3199 | it->it_index = PyList_GET_SIZE(self) - 1; |
| 3200 | Py_INCREF(self); |
| 3201 | it->it_seq = self; |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 3202 | PyObject_GC_Track(it); |
| 3203 | return (PyObject *)it; |
Thomas Wouters | 49fd7fa | 2006-04-21 10:40:58 +0000 | [diff] [blame] | 3204 | } |
| 3205 | |
| 3206 | static void |
| 3207 | listreviter_dealloc(listreviterobject *it) |
| 3208 | { |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 3209 | PyObject_GC_UnTrack(it); |
| 3210 | Py_XDECREF(it->it_seq); |
| 3211 | PyObject_GC_Del(it); |
Thomas Wouters | 49fd7fa | 2006-04-21 10:40:58 +0000 | [diff] [blame] | 3212 | } |
| 3213 | |
| 3214 | static int |
| 3215 | listreviter_traverse(listreviterobject *it, visitproc visit, void *arg) |
| 3216 | { |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 3217 | Py_VISIT(it->it_seq); |
| 3218 | return 0; |
Thomas Wouters | 49fd7fa | 2006-04-21 10:40:58 +0000 | [diff] [blame] | 3219 | } |
| 3220 | |
| 3221 | static PyObject * |
| 3222 | listreviter_next(listreviterobject *it) |
| 3223 | { |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 3224 | PyObject *item; |
Serhiy Storchaka | fbb1c5e | 2016-03-30 20:40:02 +0300 | [diff] [blame] | 3225 | Py_ssize_t index; |
| 3226 | PyListObject *seq; |
Thomas Wouters | 49fd7fa | 2006-04-21 10:40:58 +0000 | [diff] [blame] | 3227 | |
Serhiy Storchaka | fbb1c5e | 2016-03-30 20:40:02 +0300 | [diff] [blame] | 3228 | assert(it != NULL); |
| 3229 | seq = it->it_seq; |
| 3230 | if (seq == NULL) { |
| 3231 | return NULL; |
| 3232 | } |
| 3233 | assert(PyList_Check(seq)); |
| 3234 | |
| 3235 | index = it->it_index; |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 3236 | if (index>=0 && index < PyList_GET_SIZE(seq)) { |
| 3237 | item = PyList_GET_ITEM(seq, index); |
| 3238 | it->it_index--; |
| 3239 | Py_INCREF(item); |
| 3240 | return item; |
| 3241 | } |
| 3242 | it->it_index = -1; |
Serhiy Storchaka | fbb1c5e | 2016-03-30 20:40:02 +0300 | [diff] [blame] | 3243 | it->it_seq = NULL; |
| 3244 | Py_DECREF(seq); |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 3245 | return NULL; |
Thomas Wouters | 49fd7fa | 2006-04-21 10:40:58 +0000 | [diff] [blame] | 3246 | } |
| 3247 | |
Raymond Hettinger | f5b6411 | 2008-12-02 21:33:45 +0000 | [diff] [blame] | 3248 | static PyObject * |
Siddhesh Poyarekar | 55edd0c | 2018-04-30 00:29:33 +0530 | [diff] [blame^] | 3249 | listreviter_len(listreviterobject *it, PyObject *Py_UNUSED(ignored)) |
Thomas Wouters | 49fd7fa | 2006-04-21 10:40:58 +0000 | [diff] [blame] | 3250 | { |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 3251 | Py_ssize_t len = it->it_index + 1; |
| 3252 | if (it->it_seq == NULL || PyList_GET_SIZE(it->it_seq) < len) |
| 3253 | len = 0; |
| 3254 | return PyLong_FromSsize_t(len); |
Thomas Wouters | 49fd7fa | 2006-04-21 10:40:58 +0000 | [diff] [blame] | 3255 | } |
Kristján Valur Jónsson | 31668b8 | 2012-04-03 10:49:41 +0000 | [diff] [blame] | 3256 | |
| 3257 | static PyObject * |
Siddhesh Poyarekar | 55edd0c | 2018-04-30 00:29:33 +0530 | [diff] [blame^] | 3258 | listreviter_reduce(listreviterobject *it, PyObject *Py_UNUSED(ignored)) |
Kristján Valur Jónsson | 31668b8 | 2012-04-03 10:49:41 +0000 | [diff] [blame] | 3259 | { |
| 3260 | return listiter_reduce_general(it, 0); |
| 3261 | } |
| 3262 | |
| 3263 | static PyObject * |
| 3264 | listreviter_setstate(listreviterobject *it, PyObject *state) |
| 3265 | { |
| 3266 | Py_ssize_t index = PyLong_AsSsize_t(state); |
| 3267 | if (index == -1 && PyErr_Occurred()) |
| 3268 | return NULL; |
| 3269 | if (it->it_seq != NULL) { |
| 3270 | if (index < -1) |
| 3271 | index = -1; |
| 3272 | else if (index > PyList_GET_SIZE(it->it_seq) - 1) |
| 3273 | index = PyList_GET_SIZE(it->it_seq) - 1; |
| 3274 | it->it_index = index; |
| 3275 | } |
| 3276 | Py_RETURN_NONE; |
| 3277 | } |
| 3278 | |
| 3279 | /* common pickling support */ |
| 3280 | |
| 3281 | static PyObject * |
| 3282 | listiter_reduce_general(void *_it, int forward) |
| 3283 | { |
| 3284 | PyObject *list; |
| 3285 | |
| 3286 | /* the objects are not the same, index is of different types! */ |
| 3287 | if (forward) { |
| 3288 | listiterobject *it = (listiterobject *)_it; |
| 3289 | if (it->it_seq) |
Victor Stinner | 7660b88 | 2013-06-24 23:59:24 +0200 | [diff] [blame] | 3290 | return Py_BuildValue("N(O)n", _PyObject_GetBuiltin("iter"), |
Kristján Valur Jónsson | 31668b8 | 2012-04-03 10:49:41 +0000 | [diff] [blame] | 3291 | it->it_seq, it->it_index); |
| 3292 | } else { |
| 3293 | listreviterobject *it = (listreviterobject *)_it; |
| 3294 | if (it->it_seq) |
Antoine Pitrou | a701388 | 2012-04-05 00:04:20 +0200 | [diff] [blame] | 3295 | return Py_BuildValue("N(O)n", _PyObject_GetBuiltin("reversed"), |
Kristján Valur Jónsson | 31668b8 | 2012-04-03 10:49:41 +0000 | [diff] [blame] | 3296 | it->it_seq, it->it_index); |
| 3297 | } |
| 3298 | /* empty iterator, create an empty list */ |
| 3299 | list = PyList_New(0); |
| 3300 | if (list == NULL) |
| 3301 | return NULL; |
Antoine Pitrou | a701388 | 2012-04-05 00:04:20 +0200 | [diff] [blame] | 3302 | return Py_BuildValue("N(N)", _PyObject_GetBuiltin("iter"), list); |
Kristján Valur Jónsson | 31668b8 | 2012-04-03 10:49:41 +0000 | [diff] [blame] | 3303 | } |