Lines Matching full:constraints
1939 ** the count does not include changes used to implement [REPLACE] constraints,
4714 ** ^(The aConstraint[] array records WHERE clause constraints of the form:
4762 } *aConstraint; /* Table of WHERE clause constraints */
4943 ** key for writing. ^If [foreign key constraints] are enabled, it is
8396 i64 nDeferredCons; /* Net deferred constraints this transaction. */
8439 #define SQLITE_IgnoreChecks 0x00040000 /* Do not enforce check constraints */
8447 #define SQLITE_ForeignKeys 0x04000000 /* Enforce foreign key constraints */
8765 Expr *pCheck; /* The AND of all CHECK constraints */
9360 u32 nEq; /* Number of == constraints */
9649 int ckBase; /* Base register of data during check constraints */
10513 ** provided (enforcement of FK constraints requires the triggers sub-system).
17838 i64 nFkConstraint; /* Number of imm. FK constraints this VM */
17839 i64 nStmtDefCons; /* Number of def. constraints when stmt started */
49520 ** key constraints to hold up the transaction. This means a commit
53530 /* If this statement has violated immediate foreign key constraints, do
57475 ** (deferred foreign key constraints). Otherwise, if P1 is zero, the
57476 ** statement counter is incremented (immediate foreign key constraints).
59895 sqlite3ErrorMsg(pParse,"subqueries prohibited in CHECK constraints");
59909 sqlite3ErrorMsg(pParse,"parameters prohibited in CHECK constraints");
62820 /* This only happens when coding check constraints */
64340 ** of any foreign key constraints that use the table being renamed as the
64523 ** tables that have foreign key constraints that refer to table pTab (i.e.
64524 ** constraints for which pTab is the parent table) from the sqlite_master
64729 ** statements corresponding to all child tables of foreign key constraints
69146 ** Two UNIQUE or PRIMARY KEY constraints are considered equivalent
69151 ** the constraint occur in different orders, then the constraints are
69966 ** rollback the whole transaction. For operations where all constraints
71168 /* Do FK processing. This call checks that any FK constraints that
71169 ** refer to this table (i.e. constraints attached to other tables)
72833 ** Deferred constraints are implemented using a simple counter associated
72877 ** for FK constraints for which the affected columns are actually
72883 ** For the purposes of immediate FK constraints, the OR REPLACE conflict
72889 ** Immediate constraints are usually handled similarly. The only difference
73134 ** outstanding constraints to resolve. If there are not, there is no need
73351 ** each row found. Otherwise, for deferred constraints, increment the
73371 ** constraints for which table pTab is the parent table. For example,
73380 ** NULL pointer (as there are no FK constraints for which t2 is the parent
73435 ** the entire DELETE if there are no outstanding deferred constraints
73508 /* Loop through all the foreign key constraints for which pTab is the
73578 /* Loop through all the foreign key constraints that refer to this table */
73869 ** tables do not have foreign key constraints. Hence, pTab->dbMem
74960 /* Generate code to check constraints and generate index keys and
74972 int isReplace; /* Set to true if constraints may cause a replace */
75088 ** This routine also generates code to check constraints. NOT NULL,
75089 ** CHECK, and UNIQUE constraints are all checked. If a constraint fails,
75163 /* Test all NOT NULL constraints.
75208 /* Test all CHECK constraints
75290 /* Test all UNIQUE constraints by creating entries for each UNIQUE
75564 ** same indices and constraints
75715 return 0; /* Tables have different CHECK constraints. Ticket #2252 */
85263 /* Fire any BEFORE UPDATE triggers. This happens before constraints are
85598 ** disable CHECK and foreign key constraints. */
86981 ** the "op" parameter to findTerm when we are resolving equality constraints.
86982 ** ISNULL constraints will then not be used on the right table of a left
87371 ** can be optimized using inequality constraints. Return TRUE if it is
87981 /* Add constraints to reduce the search space on a LIKE or GLOB
87984 ** A like pattern of the form "x LIKE 'abc%'" is changed into constraints
88110 ** constraints. Any of these columns may be missing from the ORDER BY
88125 int nEqCol, /* Number of index columns with == constraints */
88205 ** equality constraints are all either DESC or ASC. */
88414 /* Count the number of possible WHERE clause constraints referring
88611 ** aConstraint[].usable is true for constraints where the right-hand
88621 ** The aConstraints[] array contains entries for all constraints
88833 ** range constraint. Or, equivalently, the number of equality constraints
88849 ** constraints (if any). A return value of 100 indicates that it is expected
88851 ** constraints.
88983 ** use an index to satisfy IS NULL constraints on that table. This is
89074 ** value of 100 means the entire table is searched. Range constraints
89079 ** nBound to 33. Two constraints (x>? AND x<?) reduce nBound to 11.
89206 ** that are excluded by range constraints.
89393 ** result is left on the stack. For constraints of the form X IN (...)
89451 ** Generate code that will evaluate all == and IN constraints for an
89456 ** The index has as many as three equality constraints, but in this
89458 ** constraints are coded. This routine will generate code to evaluate
89477 ** with equality constraints that use NONE affinity are set to
89497 int nEq = pLevel->plan.nEq; /* The number of == or IN constraints to code */
89522 /* Evaluate the equality constraints
89602 ** there are no IN operators in the constraints, the "addrNxt" label
89758 ** inequality constraints (>, <, >= or <=) on the indexed
89776 ** N may be zero if there are inequality constraints.
89777 ** If there are no inequality constraints, then N is at
89781 ** constraints but an index is selected anyway, in order
89817 k = pIdx->aiColumn[nEq]; /* Column for inequality constraints */
89824 ** the first one after the nEq equality constraints in the index,
89947 /* If there are inequality constraints, check that the value
90442 ** pWInfo->a[].nEq The number of == and IN constraints
90586 ** The one-pass algorithm only works if the WHERE clause constraints
99457 ** so search through the constraints to see if a more efficient
107697 RtreeConstraint *aConstraint; /* Search constraints. */
108283 ** (excluded) by the constraints in the pCursor->aConstraint[]
108315 ** would be filtered (excluded) by the constraints in the
108350 ** configured constraints.
108447 /* Move to the next entry that matches the configured constraints. */
108561 ** with the configured constraints.
110076 rtreeFilter, /* xFilter - configure scan constraints */
