| /PHP_5_3/ext/sqlite/libsqlite/src/ |
| H A D | attach.c | 26 void sqliteAttach(Parse *pParse, Token *pFilename, Token *pDbname, Token *pKey){ argument 99 if( pKey && pKey->z && pKey->n ){ 100 sqliteSetNString(&zKey, pKey->z, pKey->n, 0);
|
| H A D | btree.c | 1307 ** The external key is pKey and is nKey bytes long. The last nIgnore bytes 1314 ** *pRes<0 This means pCur<pKey 1316 ** *pRes==0 This means pCur==pKey for all nKey bytes 1318 ** *pRes>0 This means pCur>pKey 1327 const void *pKey, /* Key to compare against entry that pCur points to */ 1328 int nKey, /* Number of bytes in pKey */ 1336 const char *zKey = (const char*)pKey; 1561 /* Move the cursor so that it points to an entry near pKey. 1575 ** is smaller than pKey or if the table is empty 1579 ** exactly matches pKey 1325 fileBtreeKeyCompare( BtCursor *pCur, const void *pKey, int nKey, int nIgnore, int *pResult ) argument 1585 fileBtreeMoveto(BtCursor *pCur, const void *pKey, int nKey, int *pRes) argument 1909 fillInCell( Btree *pBt, Cell *pCell, const void *pKey, int nKey, const void *pData,int nData ) argument 2619 fileBtreeInsert( BtCursor *pCur, const void *pKey, int nKey, const void *pData, int nData ) argument [all...] |
| H A D | btree.h | 71 int (*Moveto)(BtCursor*, const void *pKey, int nKey, int *pRes); 73 int (*Insert)(BtCursor*, const void *pKey, int nKey, 81 int (*KeyCompare)(BtCursor*, const void *pKey, int nKey, 121 #define sqliteBtreeMoveto(pCur, pKey, nKey, pRes)\ 122 (btCOps(pCur)->Moveto(pCur, pKey, nKey, pRes)) 124 #define sqliteBtreeInsert(pCur, pKey, nKey, pData, nData) \ 125 (btCOps(pCur)->Insert(pCur, pKey, nKey, pData, nData)) 133 #define sqliteBtreeKeyCompare(pCur, pKey, nKey, nIgnore, pRes)\ 134 (btCOps(pCur)->KeyCompare(pCur, pKey, nKey, nIgnore, pRes))
|
| H A D | btree_rb.c | 50 * ROLLBACK_INSERT -> Need to insert (pKey, pData) into table iTab. 51 * ROLLBACK_DELETE -> Need to delete the record (pKey) into table iTab. 59 void *pKey; member in struct:BtRollbackOp 122 void *pKey; member in struct:BtRbNode 136 const void *pKey, 690 static int memRbtreeKeyCompare(RbtCursor* pCur, const void *pKey, int nKey, argument 701 *pRes = key_compare(pCur->pNode->pKey, pCur->pNode->nKey-nIgnore, 702 pKey, nKey); 738 * Insert a new record into the Rbtree. The key is given by (pKey,nKey) 747 const void *pKey, 745 memRbtreeInsert( RbtCursor* pCur, const void *pKey, int nKey, const void *pDataInput, int nData ) argument 871 memRbtreeMoveto( RbtCursor* pCur, const void *pKey, int nKey, int *pRes ) argument [all...] |
| H A D | hash.c | 59 if( pH->copyKey && elem->pKey ){ 60 sqliteFree(elem->pKey); 71 static int intHash(const void *pKey, int nKey){ argument 82 static int ptrHash(const void *pKey, int nKey){ 83 uptr x = Addr(pKey); 96 static int strHash(const void *pKey, int nKey){ argument 97 return sqliteHashNoCase((const char*)pKey, nKey); 107 static int binHash(const void *pKey, int nKey){ argument 109 const char *z = (const char *)pKey; 179 int h = (*xHash)(elem->pKey, ele 203 findElementGivenHash( const Hash *pH, const void *pKey, int nKey, int h ) argument 261 sqliteHashFind(const Hash *pH, const void *pKey, int nKey) argument 290 sqliteHashInsert(Hash *pH, const void *pKey, int nKey, void *data) argument [all...] |
| H A D | hash.h | 53 void *pKey; int nKey; /* Key associated with this element */ member in struct:HashElem 59 ** SQLITE_HASH_INT nKey is used as the key and pKey is ignored. 61 ** SQLITE_HASH_POINTER pKey is used as the key and nKey is ignored. 63 ** SQLITE_HASH_STRING pKey points to a string that is nKey bytes long 67 ** SQLITE_HASH_BINARY pKey points to binary data nKey bytes long. 82 void *sqliteHashInsert(Hash*, const void *pKey, int nKey, void *pData); 83 void *sqliteHashFind(const Hash*, const void *pKey, int nKey); 101 #define sqliteHashKey(E) ((E)->pKey)
|
| H A D | sqlite.h.in | 821 ** Open an encrypted SQLite database. If pKey==0 or nKey==0, this routine 829 const void *pKey, /* Pointer to the key */ 845 const void *pKey, int nKey /* The new key */
|
| /PHP_5_3/ext/sqlite3/libsqlite/ |
| H A D | sqlite3.c | 4751 const void *pKey, int nKey /* The key */ 4764 const void *pKey, int nKey /* The new key */ 7345 const char *pKey; int nKey; /* Key associated with this element */ member in struct:HashElem 7352 SQLITE_PRIVATE void *sqlite3HashInsert(Hash*, const char *pKey, int nKey, void *pData); 7353 SQLITE_PRIVATE void *sqlite3HashFind(const Hash*, const char *pKey, int nKey); 7371 /* #define sqliteHashKey(E) ((E)->pKey) // NOT USED */ 8046 SQLITE_PRIVATE int sqlite3BtreeInsert(BtCursor*, const void *pKey, i64 nKey, 21828 unsigned int h = strHash(elem->pKey, elem->nKey) % new_size; 21841 const char *pKey, /* The key we are searching for */ 21857 if( elem->nKey==nKey && sqlite3StrNICmp(elem->pKey,pKe 21839 findElementGivenHash( const Hash *pH, const char *pKey, int nKey, unsigned int h ) argument 21903 sqlite3HashFind(const Hash *pH, const char *pKey, int nKey) argument 21933 sqlite3HashInsert(Hash *pH, const char *pKey, int nKey, void *data) argument 47091 void *pKey; /* Saved key that was cursor's last known position */ member in struct:BtCursor 48100 void *pKey = sqlite3Malloc( (int)pCur->nKey ); local 48164 btreeMoveto( BtCursor *pCur, const void *pKey, i64 nKey, int bias, int *pRes ) argument 52751 fillInCell( MemPage *pPage, unsigned char *pCell, const void *pKey, i64 nKey, const void *pData,int nData, int nZero, int *pnSize ) argument 54182 sqlite3BtreeInsert( BtCursor *pCur, const void *pKey, i64 nKey, const void *pData, int nData, int nZero, int appendBias, int seekResult ) argument 60387 sqlite3VdbeRecordUnpack( KeyInfo *pKeyInfo, int nKey, const void *pKey, char *pSpace, int szSpace ) argument 63128 Mem *pKey; /* MEM cell holding key for the record */ member in struct:vdbeExecUnion::OP_InsertInt_stack_vars 72714 char *pKey; local 75976 KeyInfo *pKey; local 76928 sqlite3Attach(Parse *pParse, Expr *p, Expr *pDbname, Expr *pKey) argument 79654 KeyInfo *pKey; /* KeyInfo for index */ local 81074 KeyInfo *pKey = (KeyInfo *)sqlite3DbMallocZero(db, nBytes); local 84191 KeyInfo *pKey = sqlite3IndexKeyinfo(pParse, pIdx); local 86517 KeyInfo *pKey = sqlite3IndexKeyinfo(pParse, pIdx); local 86641 KeyInfo *pKey; /* Key information for an index */ local 96606 KeyInfo *pKey = sqlite3IndexKeyinfo(pParse, pIdx); local 103103 KeyInfo *pKey = sqlite3IndexKeyinfo(pParse, pIx); local 111738 void *pKey; int nKey; /* Key associated with this element */ member in struct:Fts3HashElem 117294 const struct Fts3Keyword *pKey = &aKeyword[ii]; local 117969 fts3StrHash(const void *pKey, int nKey) argument 117987 fts3BinHash(const void *pKey, int nKey) argument 118092 fts3FindElementByHash( const Fts3Hash *pH, const void *pKey, int nKey, int h ) argument 118154 sqlite3Fts3HashFindElem( const Fts3Hash *pH, const void *pKey, int nKey ) argument 118175 sqlite3Fts3HashFind(const Fts3Hash *pH, const void *pKey, int nKey) argument 118197 sqlite3Fts3HashInsert( Fts3Hash *pH, const void *pKey, int nKey, void *data ) argument [all...] |
| H A D | sqlite3.h | 4204 const void *pKey, int nKey /* The key */ 4217 const void *pKey, int nKey /* The new key */
|
| /PHP_5_3/sapi/litespeed/ |
| H A D | lsapi_main.c | 200 static int add_variable( const char * pKey, int keyLen, const char * pValue, int valLen, 203 php_register_variable_safe((char *)pKey, (char *)pValue, valLen, (zval *)arg TSRMLS_CC); 208 static int add_variable( const char * pKey, int keyLen, const char * pValue, int valLen, argument 213 register char * pKey1 = (char *)pKey; 229 static int add_variable_magic_quote( const char * pKey, int keyLen, const char * pValue, int valLen, argument 234 register char * pKey1 = (char *)pKey; 529 static int alter_ini( const char * pKey, int keyLen, const char * pValue, int valLen, argument 533 if ( '\001' == *pKey ) { 534 ++pKey; 535 if ( *pKey 1040 add_associate_array( const char * pKey, int keyLen, const char * pValue, int valLen, void * arg ) argument [all...] |
| H A D | lsapilib.c | 385 pEnvList->pKey = *pBegin; 1119 char *pKey; local 1126 pKey = pReq->m_pHttpHeader + pCur->nameOff; 1128 pKeyEnd = pKey + keyLen; 1131 while(( pKey < pKeyEnd )&&( *p )) { 1132 char ch = toupper( *pKey ); 1136 ++p; ++pKey; 1138 if (( pKey == pKeyEnd )&& (!*p )) { 1159 if ( strcmp( name, pBegin->pKey ) == 0 ) { 1192 char *pKey; local 1243 char *pKey; local [all...] |
| H A D | lsapilib.h | 69 char * pKey; member in struct:LSAPI_key_value_pair 136 typedef int (*LSAPI_CB_EnvHandler )( const char * pKey, int keyLen,
|
| /PHP_5_3/sapi/pi3web/ |
| H A D | pi3web_sapi.c | 85 PCHAR pKey; local 86 PIDBIterator_current( pIter, &pKey ); 87 if ( !pKey ) { /* sanity */ continue; }; 90 if (lpCB->GetServerVariable(lpCB->ConnID, pKey, variable_buf, &variable_len) 92 php_info_print_table_row(2, pKey, variable_buf); 97 if (lpCB->GetServerVariable(lpCB->ConnID, pKey, tmp_variable_buf, &variable_len) 99 php_info_print_table_row(2, pKey, tmp_variable_buf); 292 PCHAR pKey; local 293 PIDBIterator_current( pIter, &pKey ); 294 if ( !pKey ) { /* sanit [all...] |