/ Check-in [511ac9db]
Login

Many hyperlinks are disabled.
Use anonymous login to enable hyperlinks.

Overview
Comment:Fix opcode name in comments. No changes to code. (CVS 2907)
Downloads: Tarball | ZIP archive | SQL archive
Timelines: family | ancestors | descendants | both | trunk
Files: files | file ages | folders
SHA1: 511ac9db12ad84bb02d84568b75fc65cef661e88
User & Date: drh 2006-01-10 18:44:08
Context
2006-01-10
19:45
More pedantic changes to comments in VDBE. No changes to code. Ticket #1596. (CVS 2908) check-in: 1cf68554 user: drh tags: trunk
18:44
Fix opcode name in comments. No changes to code. (CVS 2907) check-in: 511ac9db user: drh tags: trunk
18:27
Initialize variables in malloc3.test (was causing error in all.test). (CVS 2906) check-in: 16a8172a user: danielk1977 tags: trunk
Changes
Hide Diffs Side-by-Side Diffs Ignore Whitespace Patch

Changes to src/vdbe.c.

    39     39   **
    40     40   ** Various scripts scan this source file in order to generate HTML
    41     41   ** documentation, headers files, or other derived files.  The formatting
    42     42   ** of the code in this file is, therefore, important.  See other comments
    43     43   ** in this file for details.  If in doubt, do not deviate from existing
    44     44   ** commenting and indentation practices when changing or adding code.
    45     45   **
    46         -** $Id: vdbe.c,v 1.520 2006/01/09 16:12:05 danielk1977 Exp $
           46  +** $Id: vdbe.c,v 1.521 2006/01/10 18:44:08 drh Exp $
    47     47   */
    48     48   #include "sqliteInt.h"
    49     49   #include "os.h"
    50     50   #include <ctype.h>
    51     51   #include "vdbeInt.h"
    52     52   
    53     53   /*
................................................................................
  2923   2923     break;
  2924   2924   }
  2925   2925   
  2926   2926   /* Opcode: IsUnique P1 P2 *
  2927   2927   **
  2928   2928   ** The top of the stack is an integer record number.  Call this
  2929   2929   ** record number R.  The next on the stack is an index key created
  2930         -** using MakeIdxKey.  Call it K.  This instruction pops R from the
         2930  +** using MakeIdxRec.  Call it K.  This instruction pops R from the
  2931   2931   ** stack but it leaves K unchanged.
  2932   2932   **
  2933   2933   ** P1 is an index.  So it has no data and its key consists of a
  2934   2934   ** record generated by OP_MakeRecord where the last field is the 
  2935   2935   ** rowid of the entry that the index refers to.
  2936   2936   ** 
  2937   2937   ** This instruction asks if there is an entry in P1 where the
................................................................................
  3650   3650     pC->rowidIsValid = 0;
  3651   3651     break;
  3652   3652   }
  3653   3653   
  3654   3654   /* Opcode: IdxInsert P1 * *
  3655   3655   **
  3656   3656   ** The top of the stack holds a SQL index key made using the
  3657         -** MakeIdxKey instruction.  This opcode writes that key into the
         3657  +** MakeIdxRec instruction.  This opcode writes that key into the
  3658   3658   ** index P1.  Data for the entry is nil.
  3659   3659   **
  3660   3660   ** This instruction only works for indices.  The equivalent instruction
  3661   3661   ** for tables is OP_Insert.
  3662   3662   */
  3663   3663   case OP_IdxInsert: {        /* no-push */
  3664   3664     int i = pOp->p1;
................................................................................
  3680   3680     Release(pTos);
  3681   3681     pTos--;
  3682   3682     break;
  3683   3683   }
  3684   3684   
  3685   3685   /* Opcode: IdxDelete P1 * *
  3686   3686   **
  3687         -** The top of the stack is an index key built using the MakeIdxKey opcode.
         3687  +** The top of the stack is an index key built using the MakeIdxRec opcode.
  3688   3688   ** This opcode removes that entry from the index.
  3689   3689   */
  3690   3690   case OP_IdxDelete: {        /* no-push */
  3691   3691     int i = pOp->p1;
  3692   3692     Cursor *pC;
  3693   3693     BtCursor *pCrsr;
  3694   3694     assert( pTos>=p->aStack );
................................................................................
  3711   3711   
  3712   3712   /* Opcode: IdxRowid P1 * *
  3713   3713   **
  3714   3714   ** Push onto the stack an integer which is the last entry in the record at
  3715   3715   ** the end of the index key pointed to by cursor P1.  This integer should be
  3716   3716   ** the rowid of the table entry to which this index entry points.
  3717   3717   **
  3718         -** See also: Rowid, MakeIdxKey.
         3718  +** See also: Rowid, MakeIdxRec.
  3719   3719   */
  3720   3720   case OP_IdxRowid: {
  3721   3721     int i = pOp->p1;
  3722   3722     BtCursor *pCrsr;
  3723   3723     Cursor *pC;
  3724   3724   
  3725   3725     assert( i>=0 && i<p->nCursor );
................................................................................
  3824   3824     pTos--;
  3825   3825     break;
  3826   3826   }
  3827   3827   
  3828   3828   /* Opcode: IdxIsNull P1 P2 *
  3829   3829   **
  3830   3830   ** The top of the stack contains an index entry such as might be generated
  3831         -** by the MakeIdxKey opcode.  This routine looks at the first P1 fields of
         3831  +** by the MakeIdxRec opcode.  This routine looks at the first P1 fields of
  3832   3832   ** that key.  If any of the first P1 fields are NULL, then a jump is made
  3833   3833   ** to address P2.  Otherwise we fall straight through.
  3834   3834   **
  3835   3835   ** The index entry is always popped from the stack.
  3836   3836   */
  3837   3837   case OP_IdxIsNull: {        /* no-push */
  3838   3838     int i = pOp->p1;