• Home
  • History
  • Annotate
  • Raw
  • Download
  • only in /netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/minidlna/sqlite-3.6.22/

Lines Matching refs:To

10 ** This file is all you need to compile SQLite.  To use SQLite in other
677 ** CAPI3REF: Test To See If The Library Is Threadsafe
823 ** To avoid memory leaks, the application should invoke [sqlite3_free()]
2036 ** CAPI3REF: Register A Callback To Handle SQLITE_BUSY Errors
2738 ** interfaces always report the most recent result. To avoid
2880 ** To execute an SQL query, it must first be compiled into a byte-code
3048 ** CAPI3REF: Binding Values To Prepared Statements
3086 ** number of bytes in the parameter. To be clear: the value is the
3694 ** and xFinal and NULL should be passed for xFunc. ^To delete an existing
3763 ** the use of these functions. To help encourage people to avoid
4157 ** ^To avoid having to register all collation sequences before a database
4444 ** CAPI3REF: Attempt To Free Heap Memory
4919 ** CAPI3REF: A Handle To An Open BLOB
4985 ** To avoid a resource leak, every open [BLOB handle] should eventually
5122 ** ^To make an existing VFS into the default VFS, register it again
5873 ** ^(To perform a backup operation:
6128 ** To avoid this scenario, the sqlite3_unlock_notify() performs deadlock
6260 ** Access routines. To delete, insert a NULL pointer.
7996 ** and all locking correctly. To do so would require that samba (or whatever
9081 ** Expr objects can use a lot of memory space in database schema. To
17305 ** to know. To minimize the risk of problems due to bad lrand48()
18499 ** To clear the most recent error for sqlite handle "db", sqlite3Error
20115 ** To compile without implementing sqlite3Hwtime() for your platform,
21640 ** To compile without implementing sqlite3Hwtime() for your platform,
22097 ** To work around the problem, SQLite has to manage file locks internally
22130 ** released. To work around this problem, each unixFile structure contains
22466 ** incorrectly for zero-size files. See ticket #3260. To work
22742 ** To obtain a SHARED lock, a read-lock is obtained on the 'pending
23400 /* To downgrade to shared, simply update our internal notion of the
23408 /* To fully unlock the database, delete the lock file */
24227 ** To avoid stomping the errno value on a failed read the lastErrno value
24301 ** To avoid stomping the errno value on a failed write the lastErrno value
24408 ** Others do no. To be safe, we will stick with the (slower) fsync().
25329 ** file handle closed. To achieve the same effect using this new
25861 ** To simulate a F_RDLCK on the shared range, on AFP a randomly selected
25880 ** To address the performance and cache coherency issues, proxy file locking
27089 ** To compile without implementing sqlite3Hwtime() for your platform,
28568 ** file open, we will be unable to delete it. To work around this
29937 /* To get here, there need to be 2^(N_SORT_BUCKET) elements in
32137 ** are within range. To be 'in range', both values need to be a power
33956 ** To work around this, if the journal file does appear to contain
37263 ** To avoid deadlocks, multiple Btrees are locked in the same order
37309 /* To avoid deadlock, first release all locks with a larger
37668 ** as this module treats each table as a separate structure. To determine
38962 /* To many cells for a single page. The page must be corrupt */
43059 ** To find the largest key value on pPage, first find the right-most
44086 ** doing any work. To avoid thwarting these optimizations, it is important
49351 ** To look at it another way, this routine resets the state of the
49445 ** are always destroyed. To destroy all auxdata entries, call this
49653 ** byte swapping becomes very complicated. To avoid problems,
50881 ** that a Mem structure is located on an 8-byte boundary. To prevent
52158 ** To compile without implementing sqlite3Hwtime() for your platform,
53633 ** To force any register to be an integer, just add 0.
54651 ** on the value of P1. To open a new savepoint, P1==0. To release (commit) an
60132 ** To resolve table columns references we look for nodes (or subtrees) of the
60151 ** To resolve result-set references, look for expression nodes of the
69260 ** To append 3 new entries onto the end, do this:
69266 ** would have been: A, nil, nil, nil, B. To prepend the new slots,
71404 ** number of you get the same value back again. To do this
71531 ** "[a-z]" matches any single lower-case letter. To match a '-', make
73347 ** deferred trigger. That's what RESTRICT means. To defer checking
76430 /* Ticket #1863. To avoid a creating security problems for older
81462 ** To understand the concept of flattening, consider the following
83519 ** To state it another way: This routine returns a list of all triggers
84278 /* Allocate the TriggerPrg and SubProgram objects. To ensure that they
87213 ** API. To workaround them, add a dummy OP_Variable here.
87766 ** inequality. To avoid this, make sure to also run the full
98078 ** To amortize update costs, segments are grouped into levels and
98213 ** To tokenize an input buffer, the sqlite3_tokenizer_module.xOpen()
98400 ** Access routines. To delete, insert a NULL pointer.
103247 ** To run the tests, evaluate the fts3_tokenizer_internal_test() scalar
110412 ** To utilise "general" case mapping, the upper() or lower() scalar
110418 ** To access ICU "language specific" case mapping, upper() or lower()