Lines Matching defs:name

89 DirectoryIterator::Get(char* name, size_t* _nameLength, ino_t* _id)
115 B_PRIu32 ", length %u, name length %" B_PRIuSIZE ", type %u\n",
123 memcpy(name, entry->name, length);
124 name[length] = '\0';
138 DirectoryIterator::GetNext(char* name, size_t* _nameLength, ino_t* _id)
141 while ((status = Get(name, _nameLength, _id)) == B_BAD_DATA) {
225 TRACE("DirectoryIterator::Next() entry->Length() %d entry->name %*s\n",
226 entry->Length(), entry->NameLength(), entry->name);
258 DirectoryIterator::AddEntry(Transaction& transaction, const char* name,
261 TRACE("DirectoryIterator::AddEntry(%s, ...)\n", name);
273 return _AddEntry(transaction, name, nameLength, id, type, newLength,
307 return _SplitIndexedBlock(transaction, name, nameLength, id, type,
316 return _AddEntry(transaction, name, nameLength, id, type, fBlockSize, 0,
322 DirectoryIterator::FindEntry(const char* name, ino_t* _id)
324 TRACE("DirectoryIterator::FindEntry(): %p %p\n", this, name);
329 size_t length = strlen(name);
335 && strncmp(name, buffer, nameLength) == 0) {
398 memcpy(buffer, dirEntry->name, (uint32)dirEntry->name_length);
401 status_t status = FindEntry(dirEntry->name);
505 DirectoryIterator::_AddEntry(Transaction& transaction, const char* name,
510 "%c)\n", name, nameLength, id, type, newLength, pos,
532 memcpy(dirEntry->name, name, nameLength);
546 const char* name, uint8 nameLength, ino_t id, uint8 type,
551 B_PRIu32 ", %c)\n", name, nameLength, id, newBlocksPos,
640 TRACE("DirectoryIterator::_SplitIndexedBlock(): pos: %p, name "
646 memcpy(cbuffer, dirEntry->name, dirEntry->name_length);
648 entry.hash = htree.Hash(dirEntry->name, dirEntry->name_length);
668 memcpy(newEntry.name, name, nameLength);
671 entry.hash = htree.Hash(name, nameLength);
673 name, entry.hash);
843 errmsg = "Length is too short for the name";