Home
last modified time | relevance | path

Searched refs:hash (Results 1 – 25 of 35) sorted by relevance

12

/sqlite-3.40.0/ext/fts5/
H A Dfts5_buffer.c356 u32 hash = 13; in sqlite3Fts5TermsetAdd() local
364 hash = (hash << 3) ^ hash ^ pTerm[i]; in sqlite3Fts5TermsetAdd()
366 hash = (hash << 3) ^ hash ^ iIdx; in sqlite3Fts5TermsetAdd()
367 hash = hash % ArraySize(p->apHash); in sqlite3Fts5TermsetAdd()
369 for(pEntry=p->apHash[hash]; pEntry; pEntry=pEntry->pNext){ in sqlite3Fts5TermsetAdd()
386 pEntry->pNext = p->apHash[hash]; in sqlite3Fts5TermsetAdd()
387 p->apHash[hash] = pEntry; in sqlite3Fts5TermsetAdd()
/sqlite-3.40.0/ext/fts5/test/
H A Dfts5hash.test25 # Return a list of tokens (a vocabulary) that all share the same hash
26 # key value. This can be used to test hash collisions.
32 set O(-hash) 88
46 if {$O(-hash)==$h} { lappend L $t }
82 set hash [sqlite3_fts5_token_hash 1024 xyz]
83 set vocab [build_vocab1 -prefix xyz -hash $hash]
112 # Add a small and very large token with the same hash value to an
117 set hash [sqlite3_fts5_token_hash 1024 $big]
120 if {[sqlite3_fts5_token_hash 1024 $small]==$hash} break
H A Dfts5fault2.test55 # OOM within a query that accesses the in-memory hash table.
H A Dfts5onepass.test147 # the in-memory hash table to disk.
/sqlite-3.40.0/test/
H A Dwalcrash2.test24 # already added some entries to one of the hash-tables in the wal-index.
26 # hash-table entries would be removed as part of the rollback. However,
28 # the rogue entries remain in the hash table.
31 # between committed and uncommitted entries in the hash table. However,
32 # if it happens often enough that all slots in the hash-table become
33 # non-zero, the next process that attempts to read or write the hash
42 # to the WAL (and 8 entry to the first hash-table in the
46 # to the wal-index hash-table, then crash. Repeat this 1023
H A Dspeedtest1.c146 g.hash.i = 0; in HashInit()
147 g.hash.j = 0; in HashInit()
166 t = g.hash.s[j]; in HashUpdate()
167 g.hash.s[j] = g.hash.s[i]; in HashUpdate()
168 g.hash.s[i] = t; in HashUpdate()
171 g.hash.i = i; in HashUpdate()
172 g.hash.j = j; in HashUpdate()
182 i = g.hash.i; in HashFinal()
183 j = g.hash.j; in HashFinal()
188 g.hash.s[i] = g.hash.s[j]; in HashFinal()
[all …]
H A Dschema6.test32 set hash {}
43 set hash $thishash
45 do_test $basename-$i "set x $thishash" $hash
H A Ddistinct.test55 lappend ret hash
163 3 "a, b, c FROM t1" {hash} {A B C a b c}
166 6 "b FROM t1 ORDER BY +b COLLATE binary" {btree hash} {B b}
H A DjoinE.test186 # supported with merge-joinable or hash-joinable join conditions
205 # supported with merge-joinable or hash-joinable join conditions
H A Dwal2.test1018 # hash table (one that appears to contain a single chain of infinite
1021 # wal2-11.1.*: While reading the hash-table.
1023 # wal2-11.2.*: While writing the hash-table.
1044 # Set all zeroed slots in the first hash table to invalid values.
1059 # Fill up the hash table on the first page of shared memory with 0x55 bytes.
H A Dbitvec.test104 # Attempt to induce hash collisions.
H A Dfts4opt.test171 # Check that 'optimize' works when there is data in the in-memory hash
H A Dfts3cov.test112 # terms in the pending-hash table. Specifically, while creating doclist
144 # If too much data accumulates in the pending-terms hash table, it is
H A Din.test148 # elements. We need to test that collisions in the hash table
158 'collisions','hash','table','are','resolved','properly',
/sqlite-3.40.0/src/
H A Dmem3.c168 u32 size, hash; in memsys3Unlink() local
178 hash = size % N_HASH; in memsys3Unlink()
179 memsys3UnlinkFromList(i, &mem3.aiHash[hash]); in memsys3Unlink()
202 u32 size, hash; in memsys3Link() local
212 hash = size % N_HASH; in memsys3Link()
213 memsys3LinkIntoList(i, &mem3.aiHash[hash]); in memsys3Link()
380 int hash = nBlock % N_HASH; in memsys3MallocUnsafe() local
381 for(i=mem3.aiHash[hash]; i>0; i=mem3.aPool[i].u.list.next){ in memsys3MallocUnsafe()
383 memsys3UnlinkFromList(i, &mem3.aiHash[hash]); in memsys3MallocUnsafe()
H A Dpager.c1243 u32 hash = 0; in pager_datahash() local
1246 hash = (hash*1039) + pData[i]; in pager_datahash()
1248 return hash; in pager_datahash()
/sqlite-3.40.0/ext/misc/
H A Dfossildelta.c72 typedef struct hash hash; typedef
73 struct hash { struct
82 static void hash_init(hash *pHash, const char *z){ in hash_init()
98 static void hash_next(hash *pHash, int c){ in hash_next()
109 static u32 hash_32bit(hash *pHash){ in hash_32bit()
329 hash h; in delta_create()
/sqlite-3.40.0/tool/
H A Dmkkeywordhash.c41 int hash; /* Hash on the keyword */ member
430 p->hash = (charMap(p->zName[0])*HASH_C0) HASH_OP in main()
519 h = aKeywordTable[j].hash % i; in main()
533 h = aKeywordTable[i].hash % bestSize; in main()
H A Dsqldiff.c819 typedef struct hash hash; typedef
820 struct hash { struct
829 static void hash_init(hash *pHash, const char *z){ in hash_init()
845 static void hash_next(hash *pHash, int c){ in hash_next()
856 static u32 hash_32bit(hash *pHash){ in hash_32bit()
995 hash h; in rbuDeltaCreate()
H A Dlemon.c4160 hash = 0; in print_stack_union()
4162 hash = hash*53 + stddt[j]; in print_stack_union()
4164 hash = (hash & 0x7fffffff)%arraysize; in print_stack_union()
4165 while( types[hash] ){ in print_stack_union()
4167 sp->dtnum = hash + 1; in print_stack_union()
4170 hash++; in print_stack_union()
4171 if( hash>=(unsigned)arraysize ) hash = 0; in print_stack_union()
4173 if( types[hash]==0 ){ in print_stack_union()
4174 sp->dtnum = hash + 1; in print_stack_union()
4176 if( types[hash]==0 ){ in print_stack_union()
[all …]
/sqlite-3.40.0/
H A DREADME.md44 tag or hash prefix in place of "release" in the URLs of the previous
165 The manifest.uuid file contains the SHA3 hash of the particular check-in
189 The **keywordhash.h** header file contains the definition of a hash table
310 contains either a SHA3-256 hash (for newer files) or a SHA1 hash (for
313 SHA3-256 hash of the `manifest` file itself, possibly with the
316 The `manifest.uuid` file should contain the SHA3-256 hash of the
317 `manifest` file. If all of the above hash comparisons are correct, then
/sqlite-3.40.0/ext/userauth/
H A Duser-auth.txt163 implementation of sqlite_crypt() that computes a stronger password hash,
164 perhaps using a cryptographic hash function like SHA1.
/sqlite-3.40.0/ext/fts3/
H A Dfts3.c313 Fts3Hash hash; /* Hash table */ member
1181 Fts3Hash *pHash = &((Fts3HashWrapper*)pAux)->hash; in fts3InitVtab()
4019 sqlite3Fts3HashClear(&pHash->hash); in hashDestroy()
4083 sqlite3Fts3HashInit(&pHash->hash, FTS3_HASH_STRING, 1); in sqlite3Fts3Init()
4089 if( sqlite3Fts3HashInsert(&pHash->hash, "simple", 7, (void *)pSimple) in sqlite3Fts3Init()
4090 || sqlite3Fts3HashInsert(&pHash->hash, "porter", 7, (void *)pPorter) in sqlite3Fts3Init()
4093 || sqlite3Fts3HashInsert(&pHash->hash, "unicode61", 10, (void *)pUnicode) in sqlite3Fts3Init()
4096 || (pIcu && sqlite3Fts3HashInsert(&pHash->hash, "icu", 4, (void *)pIcu)) in sqlite3Fts3Init()
4105 rc = sqlite3Fts3ExprInitTestInterface(db, &pHash->hash); in sqlite3Fts3Init()
4114 && SQLITE_OK==(rc=sqlite3Fts3InitHashTable(db,&pHash->hash,"fts3_tokenizer")) in sqlite3Fts3Init()
[all …]
/sqlite-3.40.0/ext/rtree/
H A Drtree8.test73 # table, causing a collision in the hash-table used to store r-tree
/sqlite-3.40.0/ext/session/
H A Dsessionfault.test132 # resizing the session object hash-table from 256 to 512 buckets. This

12