Lines Matching defs:node

243 				Inode *node = Inode::Factory(&disk, &inode);
244 if (node != NULL) {
246 printf(" node: %Ld \"%s\"\n", position, node->Name());
249 set->insert(node->BlockRun());
251 hashTable->Insert(node);
253 if (node->IsDirectory()) {
255 directorySize += node->Size();
256 } else if (node->IsFile()) {
258 fileSize += node->Size();
259 } else if (node->IsSymlink()) {
323 Inode* node = getter.Node();
325 return dynamic_cast<Directory *>(node);
333 Inode* node = getter.Node();
335 if (!node->IsIndex() || node->Name() == NULL)
337 if (!strcmp(node->Name(), "name") && node->Mode() & S_STR_INDEX)
338 return dynamic_cast<Directory *>(node);
361 fprintf(stderr, "setting name of missing node to "
365 printf("Set name of missing node (%ld, %d) to \"%s\" (%s)\n",
371 // if (node->Mode() & S_INDEX_DIR)
373 // if (node->Mode() & S_STR_INDEX)
374 // 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);
376 // 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);
381 printf("directory \"%s\" (%ld, %d): node \"%s\" is "
420 Inode *node;
427 Inode* node = getter.Node();
433 if (node->IsDirectory() && !node->IsIndex()) {
435 checkDirectoryContents(disk, (Directory*)node);
440 block_run run = node->Parent();
445 if (dir || parentNode && (node->Mode() & S_ATTR_DIR)) {
447 disk.BlockBitmap()->BackupSet(node, true);
448 } else if (node->Mode() & S_ATTR) {
451 node->Name(), node->BlockRun().allocation_group,
452 node->BlockRun().start);
455 } else /*if ((node->Flags() & INODE_DELETED) == 0)*/ {
463 node->IsFile() ? "file" : "node", node->Name(),
464 node->BlockRun().allocation_group, node->BlockRun().start,
465 node->Mode(),run.allocation_group, run.start, run.length);
519 node->IsFile() ? "file" : "node", node->Name(),
520 node->BlockRun().allocation_group, node->BlockRun().start,
521 node->Mode(),run.allocation_group, run.start, run.length);
525 node->IsFile() ? "file" : "node", node->Name(),
526 node->BlockRun().allocation_group, node->BlockRun().start,
527 node->Mode(),run.allocation_group, run.start, run.length);
531 dir->AddEntry(node);
537 // printf("node %s\n",node->Name());
538 // status_t status = dir->Contains(node);
540 // printf("node \"%s\": parent directory \"%s\" contains no link to this node!\n",node->Name(),dir->Name());
542 // printf("node \"%s\": parent directory \"%s\" error: %s\n",node->Name(),dir->Name(),strerror(status));
547 run = node->Attributes();
549 //printf("node \"%s\" (%ld, %d, mode = %010lo): has attribute dir!\n",node->Name(),node->BlockRun().allocation_group,node->BlockRun().start,node->Mode());
553 printf("node \"%s\": attributes are missing (%ld, %d, %d)\n",
554 node->Name(), run.allocation_group, run.start, run.length);
561 dir->SetParent(node->BlockRun());
570 empty->SetParent(node->BlockRun());
599 if ((node = gMissing.Get(run)) == NULL)
606 if (node->Name() == NULL || strcmp(node->Name(), name)) {
609 node->Name(), name);
611 node->SetName(name);
628 while (gMissing.GetNextEntry(&node) == B_OK) {
630 dump_inode(node, node->InodeBuffer());
632 Directory *dir = dynamic_cast<Directory *>(node);
635 node->Name(), node->BlockRun().allocation_group,
636 node->BlockRun().start);
667 gMissing.Release(node);
679 Inode *node;
686 Inode* node = getter.Node();
688 if (!node->IsIndex() && !node->IsAttributeDirectory())
689 node->CopyTo(copyTo, &source);
696 while (gMissing.GetNextEntry(&node) == B_OK) {
697 if (!node->IsIndex() && !node->IsAttributeDirectory())
698 node->CopyTo(copyTo, &source);
700 gMissing.Release(node);