/haiku-fatelf/src/system/kernel/arch/x86/paging/32bit/ |
H A D | X86PagingStructures32Bit.h | 27 page_directory_entry entry);
|
/haiku-fatelf/src/tests/add-ons/kernel/file_systems/consistency_check/ |
H A D | consistency_check.cpp | 120 process_file(const file_entry& entry, int number) argument 123 if (::stat(entry.path.c_str(), &stat) != 0) { 124 fprintf(stderr, "Could not stat file \"%s\": %s\n", entry.path.c_str(), 129 if (stat.st_ino != entry.node) { 131 entry.path.c_str(), entry.node, stat.st_ino); 134 int file = open(entry.path.c_str(), O_RDONLY); 136 fprintf(stderr, "Could not open file \"%s\": %s\n", entry.path.c_str(), 143 fprintf(stderr, "Computing SHA failed \"%s\": %s\n", entry.path.c_str(), 148 if (memcmp(entry 212 file_entry entry; local [all...] |
H A D | generate_hashs.cpp | 128 while (struct dirent* entry = readdir(dir)) { 129 if (!strcmp(entry->d_name, ".") 130 || !strcmp(entry->d_name, "..")) 137 strlcat(fullPath, entry->d_name, sizeof(fullPath)); 177 file_entry entry; local 178 memcpy(entry.hash, gSHA.Digest(), SHA_DIGEST_LENGTH); 179 entry.node = stat.st_ino; 180 entry.path = path; 182 //printf("%s %s\n", entry.HashString().c_str(), path); 184 gFiles.push_back(entry); 216 file_entry& entry = gFiles[i]; local [all...] |
/haiku-fatelf/src/tests/kits/net/preflet/ |
H A D | NetworkSetupProfile.cpp | 32 NetworkSetupProfile::NetworkSetupProfile(BEntry* entry) argument 34 SetTo(entry); 61 NetworkSetupProfile::SetTo(BEntry *entry) argument 65 fRoot = entry;
|
/haiku-fatelf/src/tests/kits/storage/ |
H A D | SymLinkTest.cpp | 150 BEntry entry(dirLink); 151 CPPUNIT_ASSERT( entry.InitCheck() == B_OK ); 152 BSymLink link(&entry); 157 BEntry entry(nonExisting); 158 CPPUNIT_ASSERT( entry.InitCheck() == B_OK ); 159 BSymLink link(&entry); 169 BEntry entry; local 170 BSymLink link(&entry); 175 BEntry entry(existingFile); 176 CPPUNIT_ASSERT( entry 620 BEntry entry; local [all...] |
/haiku-fatelf/src/add-ons/kernel/file_systems/ntfs/libntfs/ |
H A D | list.h | 35 * using the generic single-entry routines. 51 * __list_add - Insert a new entry between two known consecutive entries. 69 * list_add - add a new entry 70 * @new: new entry to be added 73 * Insert a new entry after the specified head. 82 * list_add_tail - add a new entry 83 * @new: new entry to be added 86 * Insert a new entry before the specified head. 99 * Delete a list entry by making the prev/next entries point to each other. 112 * list_del - deletes entry fro 118 list_del(struct list_head *entry) argument 127 list_del_init(struct list_head *entry) argument [all...] |
/haiku-fatelf/src/add-ons/kernel/file_systems/reiserfs/ |
H A D | DirItem.h | 36 \brief Represents the on-disk structure for a directory entry. 40 entry. Note, that the dir ID is note necessarily the object ID of 59 PRINT((" dir entry\n")); 85 DirEntry *entry = NULL; local 87 entry = (DirEntry*)GetData() + index; 88 return entry; 94 if (DirEntry *entry = EntryAt(index)) { 96 uint32 location = entry->GetLocation(); 99 FATAL(("WARNING: bad dir entry %ld in item %ld on node %Ld: " 100 "the entry' [all...] |
/haiku-fatelf/src/system/libroot/posix/glibc/misc/ |
H A D | hsearch_r.c | 37 ENTRY entry; member in struct:_ENTRY 170 && strcmp (item.key, htab->table[idx].entry.key) == 0) 172 *retval = &htab->table[idx].entry; 193 /* If entry is found use it. */ 195 && strcmp (item.key, htab->table[idx].entry.key) == 0) 197 *retval = &htab->table[idx].entry; 208 /* If table is full and another entry should be entered return 218 htab->table[idx].entry = item; 222 *retval = &htab->table[idx].entry;
|
/haiku-fatelf/src/tests/add-ons/kernel/file_systems/userlandfs/r5/src/test/reiserfs/ |
H A D | DirItem.h | 36 \brief Represents the on-disk structure for a directory entry. 40 entry. Note, that the dir ID is note necessarily the object ID of 59 PRINT((" dir entry\n")); 85 DirEntry *entry = NULL; local 87 entry = (DirEntry*)GetData() + index; 88 return entry; 94 if (DirEntry *entry = EntryAt(index)) { 96 uint32 location = entry->GetLocation(); 99 FATAL(("WARNING: bad dir entry %ld in item %ld on node %Ld: " 100 "the entry' [all...] |
/haiku-fatelf/src/kits/tracker/ |
H A D | TemplatesMenu.cpp | 141 BEntry entry; local 143 while (templatesDir.GetNextEntry(&entry) == B_OK) { 144 BNode node(&entry); 147 entry.GetName(fileName); 166 entry.GetRef(&ref); 182 if (templatesDir.GetEntry(&entry) == B_OK) 183 entry.GetRef(&dirRef);
|
/haiku-fatelf/src/kits/print/ |
H A D | FolderWatcher.cpp | 59 BEntry entry; local 61 while (fFolder.GetNextEntry(&entry) == B_OK && entry.GetNodeRef(&node) == B_OK) { 92 bool FolderWatcher::BuildEntryRef(BMessage* msg, const char* dirName, entry_ref* entry) { argument 94 if (msg->FindInt32("device", &entry->device) == B_OK && 95 msg->FindInt64(dirName, &entry->directory) == B_OK && 97 entry->set_name(name); 110 entry_ref entry; local 111 if (BuildEntryRef(msg, dirName, &entry) && 114 fListener->EntryCreated(&node, &entry); [all...] |
/haiku-fatelf/src/tests/kits/interface/bshelf/ |
H A D | ShelfTest.cpp | 55 BEntry *entry; local 61 if ((entry = archive_file())) { 66 stream = new BFile(entry, O_RDWR); 81 delete entry; 99 BEntry *entry = NULL; local 116 entry = new BEntry(path.Path()); 117 if (entry->InitCheck() != B_NO_ERROR) { 118 delete entry; 119 entry = NULL; 121 return entry; [all...] |
/haiku-fatelf/src/add-ons/kernel/file_systems/ramfs/ |
H A D | EntryIterator.cpp | 94 EntryIterator::GetNext(Entry **entry) argument 97 if (!fDone && fDirectory && entry) { 104 *entry = fEntry; 131 EntryIterator::SetCurrent(Entry *entry, bool isNext) argument 134 fEntry = entry;
|
/haiku-fatelf/src/apps/cortex/Persistence/ |
H A D | ExportContext.cpp | 94 // push tag onto element stack, and link to entry for the current object 117 element_entry& entry = m_elementStack.back(); local 129 if(!entry.hasContent) 132 out << "\n" << indentString() << "</" << entry.name.String() << ">"; 149 element_entry& entry = m_elementStack.back(); local 159 entry.hasContent = true; 240 // write entry to object stack 242 object_entry& entry = m_objectStack.back(); local 243 entry.object = object; 253 if(!entry 348 operator ()(const ExportContext::element_entry& entry) argument [all...] |
/haiku-fatelf/src/apps/debugger/dwarf/ |
H A D | AbbreviationTable.cpp | 61 AbbreviationTable::GetAbbreviationEntry(uint32 code, AbbreviationEntry& entry) argument 67 entry.SetTo(code, fData + tableEntry->offset, tableEntry->size); 91 // printf("entry: %lu, tag: %lu, children: %d\n", code, tag, 110 // create the entry 112 AbbreviationTableEntry* entry = new(std::nothrow) local 115 if (entry == NULL) 118 fEntryTable.Insert(entry); 120 fprintf(stderr, "Duplicate abbreviation table entry %" B_PRIu32 "!\n",
|
/haiku-fatelf/src/apps/text_search/ |
H A D | ChangesIterator.cpp | 64 const PathMap::Entry& entry = iterator.Next(); local 65 sprintf(buffer, "%s", entry.key.GetString()); 135 const PathMap::Entry& entry = iterator.Next(); local 137 switch (entry.value) { 151 printf("entry: %s - %s\n", entry.key.GetString(), value);
|
/haiku-fatelf/src/system/boot/arch/m68k/ |
H A D | mmu_030.cpp | 93 long_page_directory_entry entry; local 94 *(uint64 *)&entry = DFL_PAGEENT_VAL; 95 entry.type = DT_ROOT; 96 entry.addr = TA_TO_PREA(((addr_t)pa)); 101 : : "a"((uint64 *)&entry));
|
/haiku-fatelf/src/tests/add-ons/kernel/file_systems/userlandfs/r5/src/test/ramfs/ |
H A D | EntryIterator.cpp | 94 EntryIterator::GetNext(Entry **entry) argument 97 if (!fDone && fDirectory && entry) { 104 *entry = fEntry; 131 EntryIterator::SetCurrent(Entry *entry, bool isNext) argument 134 fEntry = entry;
|
/haiku-fatelf/src/system/kernel/scheduler/ |
H A D | scheduler_tracing.cpp | 154 if (ScheduleThread* entry = dynamic_cast<ScheduleThread*>(_entry)) { 155 if (entry->ThreadID() == threadID) { 157 bigtime_t diffTime = entry->Time() - lastTime; 187 lastTime = entry->Time(); 190 } else if (entry->PreviousThreadID() == threadID) { 192 bigtime_t diffTime = entry->Time() - lastTime; 205 lastTime = entry->Time(); 209 bigtime_t diffTime = entry->Time() - lastTime; 218 lastTime = entry->Time(); 221 } else if (EnqueueThread* entry [all...] |
/haiku-fatelf/src/apps/debugger/user_interface/cli/ |
H A D | CommandLineUserInterface.cpp | 349 CommandEntry* entry = new(std::nothrow) CommandEntry(nextName, local 351 if (entry == NULL || !fCommands.AddItem(entry)) { 352 delete entry; 378 for (int32 i = 0; CommandEntry* entry = fCommands.ItemAt(i); i++) { 379 if (entry->Name() == commandName) { 380 commandEntry = entry; 388 for (int32 i = 0; CommandEntry* entry = fCommands.ItemAt(i); i++) { 389 if (entry->Name().Compare(commandName, commandNameLength) == 0) { 395 commandEntry = entry; [all...] |
/haiku-fatelf/src/add-ons/kernel/network/protocols/unix/ |
H A D | UnixFifo.cpp | 108 while (AncillaryDataEntry* entry = fAncillaryData.RemoveHead()) { 109 gStackModule->delete_ancillary_data_container(entry->data); 110 delete entry; 165 // Adjust ancillary data entry offsets, respectively attach the ones 167 if (AncillaryDataEntry* entry = fAncillaryData.Head()) { 169 while (entry != NULL && offsetDelta > entry->offset) { 170 // entry data have been read -- add ancillary data to request 172 offsetDelta -= entry->offset; 173 request.AddAncillaryData(entry 449 ConditionVariableEntry entry; local 476 ConditionVariableEntry entry; local 507 ConditionVariableEntry entry; local 534 ConditionVariableEntry entry; local [all...] |
/haiku-fatelf/src/bin/bash/lib/readline/ |
H A D | misc.c | 309 /* Set the history pointer back to the last entry in the history. */ 322 _rl_free_history_entry (entry) 323 HIST_ENTRY *entry; 325 if (entry == 0) 328 FREE (entry->line); 329 FREE (entry->timestamp); 331 free (entry); 359 list from a history entry, as in rl_replace_from_history() below. */ 416 rl_replace_from_history (entry, flags) 417 HIST_ENTRY *entry; 445 HIST_ENTRY *entry; local [all...] |
/haiku-fatelf/src/add-ons/kernel/drivers/input/usb_hid/ |
H A D | DeviceList.cpp | 44 device_list_entry *entry = new(std::nothrow) device_list_entry; local 45 if (entry == NULL) 48 entry->name = strdup(name); 49 if (entry->name == NULL) { 50 delete entry; 54 entry->device = device; 55 entry->next = NULL; 58 fDeviceList = entry; 63 current->next = entry;
|
/haiku-fatelf/src/kits/opengl/ |
H A D | GLRendererRoster.cpp | 125 BEntry entry(&directory, fABISubDirectory); 126 if (entry.IsDirectory()) { 127 status = directory.SetTo(&entry); 142 BEntry entry; local 144 entry.SetTo(&ref); 145 if (entry.InitCheck() == B_OK && !entry.IsFile()) 187 BEntry entry(&ref); 189 status_t status = entry.GetNodeRef(&nodeRef);
|
/haiku-fatelf/src/kits/package/ |
H A D | RepositoryConfig.cpp | 35 BRepositoryConfig::BRepositoryConfig(const BEntry& entry) argument 37 SetTo(entry); 59 BRepositoryConfig::Store(const BEntry& entry) const 61 BFile file(&entry, B_WRITE_ONLY | B_CREATE_FILE | B_ERASE_FILE); 87 BRepositoryConfig::SetTo(const BEntry& entry) argument 89 fEntry = entry; 92 BFile file(&entry, B_READ_ONLY); 128 if ((result = entry.GetName(name)) != B_OK) 139 fIsUserSpecific = userSettingsDir.Contains(&entry);
|