Lines Matching defs:directory
380 // printf("index directory (%ld, %d): \"%s\" is missing (%ld, %d, %d)\n",node->BlockRun().allocation_group,node->BlockRun().start,name,run.allocation_group,run.start,run.length);
382 // printf("index directory (%ld, %d): key is missing (%ld, %d, %d)\n",node->BlockRun().allocation_group,node->BlockRun().start,run.allocation_group,run.start,run.length);
387 printf("directory \"%s\" (%" B_PRId32 ", %d): node \"%s\" is "
444 Directory* directory = dynamic_cast<Directory*>(node);
445 if (directory != NULL)
446 checkDirectoryContents(disk, directory);
449 ",%d looks like a directory, but isn't.\n",
455 // check for the parent directory
463 // entry has a valid parent directory, so it's assumed to be a valid entry
479 "): parent directory is missing (%" B_PRId32
491 printf("found directory \"%s\" in log:\n", dir->Name());
538 "): parent directory found in missing list (%" B_PRId32
545 "): parent directory found in missing list (%" B_PRId32
562 // printf("node \"%s\": parent directory \"%s\" contains no link to this node!\n",node->Name(),dir->Name());
564 // printf("node \"%s\": parent directory \"%s\" error: %s\n",node->Name(),dir->Name(),strerror(status));
612 Directory *directory = getNameIndex(disk);
613 if (directory != NULL) {
617 if (directory->GetTree(&tree) == B_OK && tree->Validate(gVerbose) == B_OK) {
620 directory->Rewind();
621 while (directory->GetNextEntry(name, &run) >= B_OK) {
640 directory->ReleaseBuffer();