Lines Matching defs:entry
207 NodeEntry* entry = (NodeEntry*)(void*)(fLeafBuffer + NodeHeader::Size(fInode));
211 < &entry[count]) {
216 if (hashVal <= B_BENDIAN_TO_HOST_INT32(entry[i].hashval)) {
217 *rightMapOffset = B_BENDIAN_TO_HOST_INT32(entry[i].before);
269 void* entry; // This could be unused entry so we should check
271 entry = (void*)(fDataBuffer + ExtentDataHeader::Size(fInode));
275 entry = (void*)(fDataBuffer
277 // This gets us a little faster to the next entry
292 // map entry but is not the first block
297 entry = (void*)(fDataBuffer + ExtentDataHeader::Size(fInode));
301 // When the block isn't mapped in the current data map entry
307 entry = (void*)(fDataBuffer + ExtentDataHeader::Size(fInode));
312 ExtentUnusedEntry* unusedEntry = (ExtentUnusedEntry*)entry;
315 TRACE("Unused entry found\n");
317 entry = (void*)
318 ((char*)entry + B_BENDIAN_TO_HOST_INT16(unusedEntry->length));
321 ExtentDataEntry* dataEntry = (ExtentDataEntry*) entry;
328 entry = (void*)((char*)entry + EntrySize(dataEntry->namelen));
431 ExtentDataEntry* entry = (ExtentDataEntry*)(fDataBuffer + offset);
433 int retVal = strncmp(name, (char*)entry->name, entry->namelen);
435 *ino = B_BENDIAN_TO_HOST_INT64(entry->inumber);