Lines Matching refs:entry

1168 ** particular directory entry should be skipped over when searching for
1169 ** the next directory entry that should be returned by the readdir() or
1191 extern INT readdir_r(LPDIR dirp, LPDIRENT entry, LPDIRENT *result);
1330 LPDIRENT entry,
1341 entry->d_ino = dirp->d_first.d_ino;
1342 entry->d_attributes = dirp->d_first.d_attributes;
1343 strncpy(entry->d_name, dirp->d_first.d_name, NAME_MAX);
1344 entry->d_name[NAME_MAX] = '\0';
1346 *result = entry;
1361 entry->d_ino = (ino_t)-1; /* not available */
1362 entry->d_attributes = data.attrib;
1363 strncpy(entry->d_name, data.name, NAME_MAX);
1364 entry->d_name[NAME_MAX] = '\0';
1366 *result = entry;
2184 ** mode: Value of stat.st_mode for directory entry (an integer).
2185 ** mtime: Value of stat.st_mtime for directory entry (an integer).
2672 int iLvl; /* Index of current entry */
2679 char *zPath; /* Path to current entry */
6145 ZipfileEntry *pCurrent; /* Current entry */
6667 ** function creates a ZipfileEntry object based on the zip archive entry
7394 ** Unless it is NULL, entry pOld is currently part of the pTab->pFirstEntry
7417 ZipfileEntry *pNew = 0; /* New in-memory CDS entry */
7419 u32 mode = 0; /* Mode for new entry */
7420 u32 mTime = 0; /* Modification time for new entry */
7422 const char *zPath = 0; /* Path for new entry */
7426 int iMethod = 0; /* Compression method for new entry */
7440 /* If this is a DELETE or UPDATE, find the archive entry to delete. */
7532 /* Check that we're not inserting a duplicate entry -OR- updating an
7533 ** entry with a path, thereby making it into a duplicate. */
7816 ZipfileEntry e; /* New entry to add to zip archive */
7831 const u8 *aData = 0; /* Possibly compressed data for new entry */
7837 char *zName = 0; /* Path (name) of new entry */
7884 /* Now inspect the data. If this is NULL, then the new entry must be a
7917 /* If this is a directory entry, ensure that there is exactly one '/'
7939 /* Assemble the ZipfileEntry object for the new zip archive entry */
8486 ** with each entry. Methods are:
8500 IdxHashEntry *pHashNext; /* Next entry in same hash bucket */
8501 IdxHashEntry *pNext; /* Next entry in hash */
8584 ** nothing. Otherwise, add an entry with key zKey and payload string zVal to
8622 ** hash-entry object.
8639 ** If the hash table contains an entry with a key equal to the string
9698 ** 1) Add an entry to the p->pTable list, and
10412 ** It contains one entry for each b-tree pointer between a parent and
10803 ** Move an sqlite_dbdata or sqlite_dbptr cursor to the next entry.
11995 ** Add a new entry to the EXPLAIN QUERY PLAN data
13739 ** The azCol[0] entry is usually NULL. However, if zTab contains a rowid
13744 ** by an entry with azCol[i]==0.
13796 ** there is a "pk" entry in "PRAGMA index_list". There will be