Searched refs:entry (Results 276 - 300 of 922) sorted by relevance

<<11121314151617181920>>

/haiku/src/apps/diskprobe/
H A DFileWindow.cpp34 BEntry entry(ref);
36 if (entry.GetStat(&stat) == B_OK && (S_ISBLK(stat.st_mode)
40 } else if (entry.IsDirectory()) {
41 BDirectory directory(&entry);
/haiku/src/apps/mail/
H A DMailSupport.cpp137 BEntry entry; local
138 while (query.GetNextEntry(&entry) == B_OK) {
139 BFile file(&entry, B_READ_ONLY);
144 entry.GetRef(&ref);
/haiku/src/kits/package/
H A DRepositoryConfig.cpp66 BRepositoryConfig::BRepositoryConfig(const BEntry& entry) argument
68 SetTo(entry);
90 BRepositoryConfig::Store(const BEntry& entry) const
92 BFile file(&entry, B_WRITE_ONLY | B_CREATE_FILE | B_ERASE_FILE);
150 BRepositoryConfig::SetTo(const BEntry& entry) argument
152 fEntry = entry;
156 status_t result = entry.GetRef(&ref);
199 fName = entry.Name();
208 fIsUserSpecific = userSettingsDir.Contains(&entry);
/haiku/src/servers/registrar/mime/
H A DCreateAppMetaMimeThread.h34 virtual status_t DoMimeUpdate(const entry_ref* entry,
H A DUpdateMimeInfoThread.h34 virtual status_t DoMimeUpdate(const entry_ref* entry,
/haiku/src/add-ons/kernel/file_systems/udf/
H A DIcb.cpp43 file_id_descriptor *entry = (file_id_descriptor *)data; local
52 status = Parent()->Read(offset, entry, &entryLength, &block);
54 && entry->tag().init_check(block) == B_OK) {
55 PDUMP(entry);
56 offset += entry->total_length();
58 if (entry->is_parent()) {
63 UdfString string(entry->id(), entry->id_length());
67 DUMP(entry->icb());
71 *id = to_vnode_id(entry
131 file_icb_entry *entry = (file_icb_entry *)header; local
135 extended_file_icb_entry *entry local
[all...]
/haiku/headers/private/fs_shell/
H A Dfssh_dirent.h18 char d_name[0]; /* name of the entry (null byte terminated) */
20 char d_name[]; /* name of the entry (null byte terminated) */
35 int fssh_readdir_r(fssh_DIR *dir, struct fssh_dirent *entry,
/haiku/src/kits/tracker/
H A DNodeWalker.cpp309 TNodeWalker::GetNextEntry(BEntry* entry, bool traverse) argument
312 *entry = *fJustFile;
325 return fTopDir->GetEntry(entry);
328 // Get the next entry.
329 status_t result = fTopDir->GetNextEntry(entry, traverse);
335 return GetNextEntry(entry, traverse);
337 // See if this entry is a directory. If it is then push it onto the
340 result = entry->GetRef(&ref);
366 BEntry entry; local
367 status_t err = fTopDir->GetEntry(&entry);
450 BEntry entry; local
566 GetNextEntry(BEntry* entry, bool traverse) argument
654 GetNextEntry(BEntry* entry, bool traverse) argument
[all...]
/haiku/src/apps/webpositive/
H A DBookmarkBar.h38 void _AddItem(ino_t inode, BEntry* entry);
H A DDownloadProgressView.cpp66 IconView(const BEntry& entry) argument
73 SetTo(entry);
95 void SetTo(const BEntry& entry) argument
97 BNode node(&entry);
236 BEntry entry(fPath.Path());
239 if (!entry.Exists())
242 fIconView = new IconView(entry);
246 if (!fDownload && (fStatusBar->CurrentValue() < 100 || !entry.Exists())) {
327 BEntry entry(fPath.Path());
328 if (entry
831 _StartNodeMonitor(const BEntry& entry) argument
[all...]
/haiku/headers/private/system/
H A Dthread_defs.h44 int32 (*entry)(void*, void*); member in struct:thread_creation_attributes
/haiku/src/add-ons/kernel/file_systems/fat/
H A Ddir.cpp45 //! Scans dir for the next entry, using the state stored in a struct diri.
76 dprintf("lfn entry (%" B_PRIu32 ") with no alias\n", lfn_count);
82 dprintf("lfn entry (%" B_PRIu32 ") with intervening erased "
86 DPRINTF(2, ("entry erased, skipping...\n"));
98 dprintf("bad lfn start entry in directory\n");
123 dprintf("bad lfn entry in directory\n");
131 dprintf("bad lfn entry in directory\n");
440 // first pass: check if the entry is still valid
453 dprintf("erase_dir_entry: directory entry doesn't match\n");
457 // second pass: actually erase the entry
918 vnode *entry; local
1121 dosfs_readdir(fs_volume *_vol, fs_vnode *_dir, void *_cookie, struct dirent *entry, size_t bufsize, uint32 *num) argument
[all...]
/haiku/src/add-ons/kernel/file_systems/ext2/
H A DDirectoryIterator.cpp106 const ext2_dir_entry* entry = (const ext2_dir_entry*)&block[fDisplacement]; local
108 if (entry->Length() == 0 || entry->InodeID() == 0)
111 if (entry->NameLength() != 0) {
112 size_t length = entry->NameLength();
114 TRACE("block %" B_PRIu32 ", displacement %" B_PRIu32 ": entry ino %"
116 fLogicalBlock, fDisplacement, entry->InodeID(), entry->Length(),
117 length, entry->FileType());
123 memcpy(name, entry
164 ext2_dir_entry* entry; local
633 HashedEntry entry; local
[all...]
/haiku/src/system/kernel/arch/x86/paging/32bit/
H A DX86VMTranslationMap32Bit.cpp143 TRACE("map_tmap: entry pa 0x%lx va 0x%lx\n", pa, va);
204 // the entry was not present and the TLB doesn't cache those entries.
254 // accessed flags was set, since only then the entry could have
308 // accessed flags was set, since only then the entry could
359 // accessed flags was set, since only then the entry could have been
364 // NOTE: Between clearing the page table entry and Flush() other
367 // entry. We can obviously lose a modified flag in this case, with the
432 // accessed flags was set, since only then the entry could have
546 "has no page dir entry", page, area, address);
563 "has no page table entry", pag
629 page_table_entry entry = pt[VADDR_TO_PTENT(va)]; local
671 page_table_entry entry = pt[VADDR_TO_PTENT(va)]; local
730 page_table_entry entry = pt[index]; local
[all...]
/haiku/src/servers/mail/
H A DMailDaemonApplication.cpp390 BEntry entry(&ref);
392 if (!_IsEntryInTrash(entry)) {
525 BEntry entry; local
526 while (query.GetNextEntry(&entry) == B_OK) {
527 if (_IsEntryInTrash(entry))
531 while (node.SetTo(&entry) == B_BUSY)
540 _AddMessage(messages[account], entry, node);
549 BEntry entry(path);
550 _AddMessage(messages[account], entry, BNode(&entry));
722 const entry_ref& entry = settings.InboundAddOnRef(); local
744 const entry_ref& entry = settings.OutboundAddOnRef(); local
811 BEntry entry; local
863 _AddMessage(send_mails_info& info, const BEntry& entry, const BNode& node) argument
890 _IsEntryInTrash(BEntry& entry) argument
[all...]
/haiku/src/kits/debugger/elf/
H A DCoreFile.cpp267 // get the symbol table entry size
269 // entry size may differ (cf. DT_SYMENT in the dynamic segment).
438 WARNING("Team note: too short or invalid entry size (%" B_PRIu32 ")\n",
483 // check entry size and area count
486 WARNING("Areas note: too short or invalid entry size (%" B_PRIu32 ")\n",
500 // get entry values
501 Entry entry = {}; local
502 _ReadEntry(data, dataSize, entry, entrySize);
504 int32 id = Get(entry.na_id);
505 uint64 baseAddress = Get(entry
581 Entry entry = {}; local
734 Entry entry = {}; local
832 _ReadEntry(const void*& data, uint32& dataSize, Entry& entry, size_t entrySize) argument
[all...]
/haiku/src/add-ons/kernel/file_systems/ntfs/libntfs/
H A Dobject_id.c125 struct OBJECT_ID_INDEX { /* index entry in $Extend/$ObjId */
227 struct OBJECT_ID_INDEX *entry; local
238 entry = (struct OBJECT_ID_INDEX*)xo->entry;
240 if (entry
241 && (MREF(le64_to_cpu(entry->data.file_id))
244 &entry->data.birth_volume_id,
247 &entry->data.birth_object_id,
250 &entry->data.domain_id,
264 * Remove an object id index entry i
275 struct OBJECT_ID_INDEX *entry; local
[all...]
/haiku/src/apps/diskusage/
H A DScanner.cpp232 BEntry entry; local
233 dir->GetEntry(&entry);
234 entry.GetRef(&thisDir->ref);
244 if (dir->GetNextEntry(&entry) == B_ENTRY_NOT_FOUND)
246 if (entry.IsSymLink())
250 if (entry.IsFile()) {
252 if ((entry.GetRef(&ref) == B_OK) && (ref.device != Device()))
255 entry.GetRef(&child->ref);
256 entry.GetSize(&child->size);
269 else if (entry
[all...]
/haiku/src/apps/debuganalyzer/gui/
H A DHeaderView.cpp756 for (int32 i = 0; HeaderEntry* entry = fHeaderEntries.ItemAt(i); i++) {
762 BRect frame(entry->position, 0, entry->position + entry->width - 1,
767 left = entry->position + entry->width;
864 for (int32 i = 0; HeaderEntry* entry = fHeaderEntries.ItemAt(i); i++)
865 entry->header->RemoveListener(this);
881 HeaderEntry* entry = new(std::nothrow) HeaderEntry( local
883 if (entry
945 HeaderEntry* entry = new(std::nothrow) HeaderEntry( local
1053 HeaderEntry* entry = fHeaderEntries.ItemAt(i); local
[all...]
/haiku/src/add-ons/kernel/partitioning_systems/gpt/
H A Dgpt.cpp118 const gpt_partition_entry& entry = header->EntryAt(i); local
120 if (entry.partition_type == kEmptyGUID)
123 if (entry.EndBlock() * partition->block_size
126 "block %" B_PRIu64 ")\n", entry.EndBlock()));
130 if (entry.StartBlock() * partition->block_size == 0) {
131 TRACE(("efi_gpt: child partition starts at 0 (recursive entry)\n"));
136 partition->offset + entry.StartBlock() * partition->block_size,
137 entry.BlockCount() * partition->block_size, -1);
145 to_utf8(entry.name, EFI_PARTITION_NAME_LENGTH, name, sizeof(name));
147 child->type = strdup(get_partition_type(entry
381 const gpt_partition_entry& entry = header->EntryAt(i); local
527 gpt_partition_entry& entry = header->EntryAt(entryIndex); local
592 gpt_partition_entry& entry = header->EntryAt(entryIndex); local
642 gpt_partition_entry& entry = header->EntryAt(entryIndex); local
692 gpt_partition_entry& entry = header->EntryAt(entryIndex); local
[all...]
/haiku/src/tests/add-ons/kernel/file_systems/random_file_actions/
H A Drandom_file_actions.cpp46 struct entry { struct
52 typedef std::vector<entry> EntryVector;
293 generate_block(char* buffer, const struct entry& entry, off_t offset) argument
297 block->identifier = entry.identifier;
309 write_blocks(int fd, struct entry& entry, bool append = false) argument
328 entry.size += size;
336 generate_block(block, entry, offset - blockOffset);
390 check_file(const struct entry
[all...]
/haiku/src/apps/mediaplayer/playlist/
H A DFilePlaylistItem.cpp115 BEntry entry(&fRefs[0], false);
116 return entry.Rename(string.String(), false);
365 BEntry entry(&fRefs[0], true);
368 entry.GetName(originalName);
375 entry.GetPath(&path);
378 while (directory.GetNextEntry(&entry) == B_OK) {
380 if (entry.GetName(name) != B_OK)
388 BFile file(&entry, B_READ_ONLY);
465 BEntry entry(&fRefs[0], true);
466 BNode node(&entry);
[all...]
/haiku/src/add-ons/kernel/file_systems/layers/write_overlay/
H A Dwrite_overlay.cpp189 status_t AddEntry(overlay_dirent *entry,
192 overlay_dirent **entry, bool attribute = false);
1076 OverlayInode::AddEntry(overlay_dirent *entry, bool attribute) argument
1084 status_t result = RemoveEntry(entry->name, NULL, attribute);
1097 fAttributeDirents[fAttributeDirentCount++] = entry;
1100 fDirents[fDirentCount++] = entry;
1123 overlay_dirent *entry = dirents[i]; local
1124 if (strcmp(entry->name, name) == 0) {
1127 // to dispose the entry
1129 status_t result = get_vnode(Volume(), entry
1322 overlay_dirent *entry = (overlay_dirent *)malloc( local
1400 overlay_dirent *entry = (overlay_dirent *)malloc( local
1452 overlay_dirent *entry = (overlay_dirent *)malloc(sizeof(overlay_dirent)); local
1822 overlay_dirent *entry = NULL; local
2135 overlay_dirent *entry = NULL; local
[all...]
/haiku/headers/private/kernel/
H A Dtracing.h40 // print the difference time to the previously printed entry instead of the
93 static TraceEntry* FromTraceEntry(trace_entry* entry) argument
95 return (TraceEntry*)(entry + 1);
179 const char* DumpEntry(const TraceEntry* entry) argument
182 const_cast<TraceEntry*>(entry)->Dump(*this);
195 virtual bool Filter(const TraceEntry* entry, LazyTraceOutput& out);
247 trace_entry* _NextNonBufferEntry(trace_entry* entry);
248 trace_entry* _PreviousNonBufferEntry(trace_entry* entry);
268 bool tracing_is_entry_valid(AbstractTraceEntry* entry,
/haiku/headers/private/print/
H A DPrinter.h28 BPrinter(const BEntry& entry);
35 status_t SetTo(const BEntry& entry);

Completed in 114 milliseconds

<<11121314151617181920>>