Lines Matching refs:keys
9554 ** existing cache entries with page numbers (keys) greater than or equal
15241 #define BTREE_INTKEY 1 /* Table has only 64-bit signed integer keys */
15242 #define BTREE_BLOBKEY 2 /* Table has keys only - no data */
15337 ** * to read values that will be used to create keys that other
16779 Hash fkeyHash; /* All foreign keys by referenced table name */
17658 FKey *pFKey; /* Linked list of all foreign keys in this table */
17817 ** RESTRICT, SETNULL, SETDFLT, and CASCADE actions apply only to foreign keys.
17818 ** RESTRICT is the same as ABORT for IMMEDIATE foreign keys and the
17819 ** same as ROLLBACK for DEFERRED keys. SETNULL means that the foreign
17848 ** comparison of the two index keys.
17909 i8 default_rc; /* Comparison result if keys are equal */
17981 tRowcnt *aAvgEq; /* Average nEq values for keys not in aSample */
18019 tRowcnt *anDLt; /* Est. number of distinct keys less than this sample */
18760 #define SRT_Union 1 /* Store result as keys in an index */
18779 #define SRT_Set 11 /* Store results as keys in an index */
20460 ** this case foreign keys are parsed, but no other functionality is
21101 KeyInfo *pKeyInfo; /* Info about index keys needed by index cursors */
30549 ** to generate random integer keys for tables or random filenames.
61399 const u32 *aContent, /* Pages in wal - keys for the sort */
61440 ** Remove elements with duplicate keys, preferring to keep the
62348 /* Check the salt keys at the start of the wal file still match. */
63956 ** All of the keys on the page that Ptr(0) points to have values less
63957 ** than Key(0). All of the keys on page Ptr(1) and its subpages have
63958 ** values greater than Key(0) and less than Key(1). All of the keys
64068 ** only keys and no data. The intkey flag means that the key is an integer
70471 xRecordCompare = 0; /* All keys are integers */
72697 ** leafData: 1 if pPage holds key+data and pParent holds only keys.
72880 ** on the left side (siblings with smaller keys). The left siblings are
73668 ** keys with no associated data. If the cursor was opened expecting an
73669 ** intkey table, the caller should be inserting integer keys with a
73677 ** keys, the VDBE layer invokes sqlite3BtreeLast() to figure out the
74225 ** BTREE_INTKEY|BTREE_LEAFDATA Used for SQL tables with rowid keys
74982 ** 2. Make sure integer cell keys are in order.
76872 ** keys are strings. In the former case a NULL pointer is returned the
78175 ** structures intended to be compared against sample index keys stored
82435 ** This function compares two index or table record keys in the same way
82529 /* rc==0 here means that one of the keys ran out of fields and
82845 ** determined that the first fields of the keys are equal.
82848 ** fields that appear in both keys are equal, then pPKey2->default_rc is
82872 ** two elements in the keys are equal. Fix the various stack variables so
83043 /* rc==0 here means that one or both of the keys ran out of fields and
83144 /* The first fields of the two keys are equal. Compare the trailing
83148 /* The first fields of the two keys are equal and there are no trailing
83356 ** of the keys prior to the final rowid, not the entire key.
89875 ** that defines the format of keys in the index.
90083 ** If cursor P1 refers to an SQL table (B-Tree that uses integer keys),
90110 ** If cursor P1 refers to an SQL table (B-Tree that uses integer keys),
90128 ** If cursor P1 refers to an SQL table (B-Tree that uses integer keys),
90146 ** If cursor P1 refers to an SQL table (B-Tree that uses integer keys),
90732 ** keys). If register P3 does not contain an integer or if P1 does not
90744 ** (with arbitrary multi-value keys).
90756 ** keys). P3 is an integer rowid. If P1 does not contain a record with
90767 ** (with arbitrary multi-value keys).
94760 ** a VdbeCursor to sort large numbers of keys for CREATE INDEX statements
94858 ** incrementally as keys are retreived from the sorter by the VDBE. The
94865 ** begins reading keys from that PMA while the background thread proceeds
94957 ** pairs of PMA keys together. Element i contains the result of
94962 ** other key value. If the keys are equal (only possible with two EOF
95140 ** keys from pMerger by the calling thread whenever the PmaReader runs out
95664 ** statement. In this case, keys are always delivered to the sorter in
96289 ** * One or more records packed end-to-end in order of ascending keys.
96620 ** Read keys from pIncr->pMerger and populate pIncr->aFile[1]. The format
96690 ** keys from pIncr->pMerger and repopulating aFile[0].
96772 ** Recompute pMerger->aTree[iOut] by comparing the next keys on the
103508 ** column is used to build the index keys. If both 'x' and the
103630 ** that columns affinity when building index keys. If <expr> is not
108839 ** about the distribution of keys within an index. The index is identified by
110412 ** once the trailing PK fields are considered all index keys are
112262 ** memory structures of the indices and foreign keys associated with
112304 /* Delete any foreign keys attached to this table. */
112332 ** table structure with all its indices and foreign keys.
114208 ** keeping track of autoincrement keys.
115092 ** with DESC primary keys, since those indexes have there keys in
117900 ** hold all primary keys for rows to be deleted. */
117999 /* Set up a loop over the rowids/primary-keys that were found in the
118046 /* End of the loop over all rowids/primary-keys. */
120736 ** Foreign keys in SQLite come in two flavours: deferred and immediate.
120919 ** Non-composite foreign keys do not require the aiCol array.
120968 if( iCol<0 ) break; /* No foreign keys against expression indexes */
121601 /* If foreign-keys are disabled, this function is a no-op. */
121643 ** FK counter for each row of the current table with non-NULL keys.
121831 ** * the UPDATE modifies one or more parent keys for which the action is
122125 ** table pTab. Remove the deleted foreign keys from the Schema.fkeyHash
123406 /* Generate code to check constraints and generate index keys and
125171 ** index will be populated by inserting keys in strictly sorted
125180 ** a VACUUM command. In that case keys may not be written in strictly
128949 int addrTop; /* Top of a loop checking foreign keys */
132118 ** composite primary keys in the SortCtx.aDefer[] array. */
132390 ** pSO->nExpr columns, then make sure all keys are unique by adding a
134119 ** keys.
140096 ** table iEph as index keys, using OP_IdxInsert.
140100 ** with automatically assigned integer keys.
140104 ** records with automatically assigned integer keys For intkey tables, the
140632 ** there are any triggers or foreign keys to process, or rows may
143724 #define SQLITE_BLDF1_UNIQUE 0x0002 /* All keys of a UNIQUE index used */
144560 ** calls this routine will use that memory range to store keys for
145963 ** keys of the rows we have already seen.
146013 ** capable of holding primary keys in the case of a WITHOUT ROWID.
149423 ** Estimate the location of a particular key among all keys in an
152392 ** Return the cost of sorting nRow rows, assuming that the keys have
155334 ** regApp+1: integer value used to ensure keys are unique
169635 ** memcmp() is used to compare keys.
178011 ** true if the hash table should make its own private copy of keys and
179469 ** been initialized to use string keys, and to take a private copy
184099 /* If the current node of layer iLayer contains zero keys, or if adding
184991 ** so that it contains no keys smaller than zTerm/nTerm. */
199105 ** keys mapped to values as follows:
200847 ** The SELECT statement iterating through the keys for the current object
201354 /* Create the SELECT statement to read keys in sorted order */
201499 /* Create the SELECT statement to read keys from data_xxx */
202233 ** The SELECT statement iterating through the keys for the current object
204335 ** so the pages to the left have smaller keys than the pages to the right.)
205683 ** The keys of the SessionTable.aChange[] hash table are all rows that have
206161 ** hash key. Assume the has table has nBucket buckets. The hash keys
207235 /* Ignore tables with no primary keys */
223947 /* All keys from this input segment have been transfered to the output.