Many hyperlinks are disabled.
Use anonymous login
to enable hyperlinks.
Overview
| Comment: | Instead of allocating a single large buffer at the beginning of each sort operation, start with a small buffer and extend it using realloc() as required. |
|---|---|
| Downloads: | Tarball | ZIP archive | SQL archive |
| Timelines: | family | ancestors | descendants | both | orderby-planning |
| Files: | files | file ages | folders |
| SHA1: |
81987c8ceb64f051528a6ca42673821d |
| User & Date: | dan 2014-03-27 19:25:02 |
Context
|
2014-03-28
| ||
| 18:35 | Merge the latest changes from trunk. check-in: 3047a25f user: drh tags: orderby-planning | |
|
2014-03-27
| ||
| 19:25 | Instead of allocating a single large buffer at the beginning of each sort operation, start with a small buffer and extend it using realloc() as required. check-in: 81987c8c user: dan tags: orderby-planning | |
| 17:23 | Use xFetch() to access temporary files in vdbesort.c. Use a single large allocation instead of many small allocations when accumulating records in vdbesort.c. This is an interim commit - it allocates a buffer the size of the page-cache every time data is sorted. check-in: f4ac1bf2 user: dan tags: orderby-planning | |
Changes
Changes to src/vdbesort.c.