Lines Matching defs:entry
475 void* entry; // This could be unused entry so we should check
476 entry = (void*)(fSingleDirBlock + ExtentDataHeader::Size(fInode));
480 entry = (void*)(fSingleDirBlock
482 // This gets us a little faster to the next entry
497 // map entry but is not the first block
502 entry = (void*)(fSingleDirBlock + ExtentDataHeader::Size(fInode));
506 // When the block isn't mapped in the current data map entry
517 entry = (void*)(fSingleDirBlock + ExtentDataHeader::Size(fInode));
522 ExtentUnusedEntry* unusedEntry = (ExtentUnusedEntry*)entry;
525 TRACE("Unused entry found\n");
527 entry = (void*)
528 ((char*)entry + B_BENDIAN_TO_HOST_INT16(unusedEntry->length));
531 ExtentDataEntry* dataEntry = (ExtentDataEntry*) entry;
538 entry = (void*)((char*)entry + EntrySize(dataEntry->namelen));
635 NodeEntry* entry = (NodeEntry*)(fSingleDirBlock + NodeHeader::Size(fInode));
640 if (hashVal <= B_BENDIAN_TO_HOST_INT32(entry[i].hashval))
641 return B_BENDIAN_TO_HOST_INT32(entry[i].before);
723 // We now have the leaf block that might contain the entry we need.
781 ExtentDataEntry* entry
784 int retVal = strncmp(name, (char*)entry->name, entry->namelen);
786 *ino = B_BENDIAN_TO_HOST_INT64(entry->inumber);
793 // Go to forward neighbor. We might find an entry there.