Many hyperlinks are disabled.
Use anonymous login
to enable hyperlinks.
Overview
Comment: | Bug fix in vdbe.c - variable declarations must come before code in ANSI C. (CVS 1440) |
---|---|
Downloads: | Tarball | ZIP archive |
Timelines: | family | ancestors | descendants | both | trunk |
Files: | files | file ages | folders |
SHA1: |
c36203de22f673691783529e06ce5a58 |
User & Date: | drh 2004-05-22 11:09:30.000 |
Context
2004-05-22
| ||
17:41 | Split up os.c into separate files, one for each platform. (CVS 1441) (check-in: 5c61be1c47 user: drh tags: trunk) | |
11:09 | Bug fix in vdbe.c - variable declarations must come before code in ANSI C. (CVS 1440) (check-in: c36203de22 user: drh tags: trunk) | |
10:33 | Add a couple of tests for UTF-16 databases. (CVS 1439) (check-in: 891be63a92 user: danielk1977 tags: trunk) | |
Changes
Changes to src/vdbe.c.
︙ | ︙ | |||
39 40 41 42 43 44 45 | ** ** Various scripts scan this source file in order to generate HTML ** documentation, headers files, or other derived files. The formatting ** of the code in this file is, therefore, important. See other comments ** in this file for details. If in doubt, do not deviate from existing ** commenting and indentation practices when changing or adding code. ** | | | 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 | ** ** Various scripts scan this source file in order to generate HTML ** documentation, headers files, or other derived files. The formatting ** of the code in this file is, therefore, important. See other comments ** in this file for details. If in doubt, do not deviate from existing ** commenting and indentation practices when changing or adding code. ** ** $Id: vdbe.c,v 1.319 2004/05/22 11:09:30 drh Exp $ */ #include "sqliteInt.h" #include "os.h" #include <ctype.h> #include "vdbeInt.h" /* |
︙ | ︙ | |||
4708 4709 4710 4711 4712 4713 4714 | ** Sort all elements on the sorter. The algorithm is a ** mergesort. The P3 argument is a pointer to a KeyInfo structure ** that describes the keys to be sorted. */ case OP_Sort: { int i; KeyInfo *pKeyInfo = (KeyInfo*)pOp->p3; | < > | 4708 4709 4710 4711 4712 4713 4714 4715 4716 4717 4718 4719 4720 4721 4722 4723 4724 | ** Sort all elements on the sorter. The algorithm is a ** mergesort. The P3 argument is a pointer to a KeyInfo structure ** that describes the keys to be sorted. */ case OP_Sort: { int i; KeyInfo *pKeyInfo = (KeyInfo*)pOp->p3; Sorter *pElem; Sorter *apSorter[NSORT]; pKeyInfo->enc = p->db->enc; for(i=0; i<NSORT; i++){ apSorter[i] = 0; } while( p->pSort ){ pElem = p->pSort; p->pSort = pElem->pNext; pElem->pNext = 0; |
︙ | ︙ |