Home | History | Annotate | Download | only in dist

Lines Matching refs:existing

1588 ** Existing configuration options might be discontinued.  Applications
1795 ** Existing configuration options might be discontinued. Applications
3647 ** of existing SQL functions or aggregates. The only difference between the
3691 ** and xFinal and NULL should be passed for xFunc. ^To delete an existing
4163 ** ^A call to either function replaces the existing collation-needed callback.
4426 ** Existing database connections continue use the sharing mode
5024 ** incremental blob I/O routines can only read or overwriting existing
5107 ** New VFSes can be registered and existing VFSes can be unregistered.
5119 ** ^To make an existing VFS into the default VFS, register it again
5617 ** New verbs may be added in future releases of SQLite. Existing verbs
5814 ** existing cache entries with page numbers (keys) greater than or equal
6085 ** called with a NULL pointer as its second argument, then any existing
7776 /* Increment the reference count of an existing page */
7970 ** any one time. Existing SHARED locks may persist, but no new
8871 #define OE_Replace 5 /* Delete existing record, then do INSERT or UPDATE */
12983 ** Change the size of an existing memory allocation.
13640 ** Change the size of an existing memory allocation
14193 ** Change the size of an existing memory allocation.
16077 ** Change the size of an existing memory allocation
17196 ** to modify an existing string. For example:
17722 ** Clear any existing type flags from a Mem and replace them with f
19615 HashElem *elem, *next_elem; /* For looping over existing elements */
20959 OSTRACE1( "OPEN open existing\n" );
22039 struct vxworksFileId *pCandidate; /* For looping over existing file IDs */
22050 /* Search for an existing entry that matching the canonical name.
22052 ** the existing file ID.
22128 ** and check for locks already existing on that inode. When locks are
22780 ** obtained, but existing SHARED locks are allowed to persist. A process
26684 /* nothing to do if the path is NULL, :auto: or matches the existing path */
28681 /* Open existing file, or create if it doesn't exist */
30761 /* Search the hash table for an existing entry. */
32858 PgHdr *pPg; /* An existing page in the cache */
34288 ** coming in while we wait for existing readers to clear.
35180 ** choose not to allocate a new page object and may reuse an existing
37840 ** This routine has no effect on existing database connections.
38088 /* First search the list for an existing lock on this table. */
39507 ** existing BtShared object that we can share with
44257 ** cursor pCur is pointing at the existing copy of a row that is to be
44379 ** larger than the largest existing key, it is possible to insert the
44547 /* Creating a new table may probably require moving an existing database
45638 ** parameters that attempt to write past the end of the existing data,
46513 ** Existing representations MEM_Int and MEM_Real are *not* invalidated.
46951 ** Transfer the contents of pFrom to pTo. Any existing value in pTo is
46973 ** string is copied into a (possibly existing) buffer managed by the
46974 ** Mem structure. Otherwise, any existing buffer is freed and the
51980 ** in this file for details. If in doubt, do not deviate from existing
54956 ** existing savepoint, P1==1, or to rollback an existing savepoint P1==2.
56117 ** First we attempt to find the largest existing rowid and add one
56118 ** to that. But if the largest existing rowid is already the maximum
56228 ** created if it doesn't already exist or the data for an existing
61897 ** An existing b-tree may only be used if the SELECT is of the simple
61945 /* Check to see if an existing table or index can be used to
62022 /* Could not found an existing table or index to use as the RHS b-tree.
62480 /* First replace any existing entry.
65002 ** prefix, we insure that the name will not collide with an existing
66034 ** statement only). For DETACH, set it to false (expire all existing
67273 /* Make sure the new table name does not collide with an existing
69351 ** This routine will drop an existing named index. This routine
69571 /* Move existing slots that come after the newly inserted slots
72837 ** time a statement is executed that removes an existing violation from
75139 int rowidChng, /* True if the rowid might collide with existing entry */
78153 ** is created. If an existing main database file is opened, then the
78154 ** default text encoding for the existing database is used.
79468 ** is ANDed with the existing WHERE clause, is of the form:
84638 /* If an existing TriggerPrg could not be located, create a new one. */
95873 /* Free any existing lookaside buffer for this handle before
96050 ** Close an existing SQLite database
96437 /* Check if an existing function is being overridden or deleted. If so,
96719 ** open on an existing shared pager-cache, do not change the pager-cache
96857 /* Check if this call is removing or replacing an existing collation
96964 ** A new lower limit does not shrink existing constructs.
97707 ** as it existing before this routine was called.
98547 ** Destroy an existing tokenizer. The fts3 module calls this method
98564 ** Destroy an existing tokenizer cursor. The fts3 module calls this
100234 ** existing output. This can only happen with prefix-searches (as
101700 ** of pNew and the existing nodes of the tree. This may result in the head
102322 Fts3HashElem *elem, *next_elem; /* For looping over existing elements */
106046 ** call may merge all existing level 0 segments into a single level 1
110070 rtreeConnect, /* xConnect - connect to an existing table */