Lines Matching defs:entry
1191 ** particular directory entry should be skipped over when searching for
1192 ** the next directory entry that should be returned by the readdir() or
1214 extern INT readdir_r(LPDIR dirp, LPDIRENT entry, LPDIRENT *result);
1353 LPDIRENT entry,
1364 entry->d_ino = dirp->d_first.d_ino;
1365 entry->d_attributes = dirp->d_first.d_attributes;
1366 strncpy(entry->d_name, dirp->d_first.d_name, NAME_MAX);
1367 entry->d_name[NAME_MAX] = '\0';
1369 *result = entry;
1384 entry->d_ino = (ino_t)-1; /* not available */
1385 entry->d_attributes = data.attrib;
1386 strncpy(entry->d_name, data.name, NAME_MAX);
1387 entry->d_name[NAME_MAX] = '\0';
1389 *result = entry;
4694 ** mode: Value of stat.st_mode for directory entry (an integer).
4695 ** mtime: Value of stat.st_mtime for directory entry (an integer).
5204 int iLvl; /* Index of current entry */
5211 char *zPath; /* Path to current entry */
7123 ZipfileEntry *pCurrent; /* Current entry */
7636 ** function creates a ZipfileEntry object based on the zip archive entry
8369 ** Unless it is NULL, entry pOld is currently part of the pTab->pFirstEntry
8392 ZipfileEntry *pNew = 0; /* New in-memory CDS entry */
8394 u32 mode = 0; /* Mode for new entry */
8395 u32 mTime = 0; /* Modification time for new entry */
8397 const char *zPath = 0; /* Path for new entry */
8401 int iMethod = 0; /* Compression method for new entry */
8415 /* If this is a DELETE or UPDATE, find the archive entry to delete. */
8507 /* Check that we're not inserting a duplicate entry -OR- updating an
8508 ** entry with a path, thereby making it into a duplicate. */
8791 ZipfileEntry e; /* New entry to add to zip archive */
8806 const u8 *aData = 0; /* Possibly compressed data for new entry */
8812 char *zName = 0; /* Path (name) of new entry */
8859 /* Now inspect the data. If this is NULL, then the new entry must be a
8892 /* If this is a directory entry, ensure that there is exactly one '/'
8914 /* Assemble the ZipfileEntry object for the new zip archive entry */
9486 ** with each entry. Methods are:
9500 IdxHashEntry *pHashNext; /* Next entry in same hash bucket */
9501 IdxHashEntry *pNext; /* Next entry in hash */
9584 ** nothing. Otherwise, add an entry with key zKey and payload string zVal to
9622 ** hash-entry object.
9639 ** If the hash table contains an entry with a key equal to the string
10758 ** 1) Add an entry to the p->pTable list, and
11486 ** It contains one entry for each b-tree pointer between a parent and
11910 ** Move an sqlite_dbdata or sqlite_dbptr cursor to the next entry.
16415 ** Add a new entry to the EXPLAIN QUERY PLAN data
18444 ** The azCol[0] entry is usually NULL. However, if zTab contains a rowid
18449 ** by an entry with azCol[i]==0.
18503 ** there is a "pk" entry in "PRAGMA index_list". There will be