Searched refs:entry (Results 101 - 125 of 1061) sorted by relevance

1234567891011>>

/haiku-fatelf/src/system/kernel/debug/
H A Dtracing.cpp100 trace_entry* NextEntry(trace_entry* entry);
101 trace_entry* PreviousEntry(trace_entry* entry);
244 TracingMetaData::NextEntry(trace_entry* entry) argument
246 entry += entry->size;
247 if ((entry->flags & WRAP_ENTRY) != 0)
248 entry = fBuffer;
250 if (entry == fAfterLastEntry)
253 return entry;
258 TracingMetaData::PreviousEntry(trace_entry* entry) argument
586 trace_entry* entry = fFirstEntry; local
802 trace_entry* entry = sTracingMetaData->AllocateEntry( local
971 Filter(const TraceEntry* entry, LazyTraceOutput& out) argument
982 const AbstractTraceEntry* entry local
993 const AbstractTraceEntry* entry local
1002 Filter(const TraceEntry* entry, LazyTraceOutput& out) argument
1011 Filter(const TraceEntry* entry, LazyTraceOutput& out) argument
1022 Filter(const TraceEntry* entry, LazyTraceOutput& out) argument
1033 Filter(const TraceEntry* entry, LazyTraceOutput& out) argument
1047 Filter(const TraceEntry* entry, LazyTraceOutput& out) argument
1056 Filter(const TraceEntry* entry, LazyTraceOutput& out) argument
1066 Filter(const TraceEntry* entry, LazyTraceOutput& out) argument
[all...]
/haiku-fatelf/src/add-ons/kernel/file_systems/netfs/server/
H A DVolumeManager.cpp28 // with one event of each kind for each entry/node.
227 // entry created events
234 // entry removed events
241 // entry moved events
283 // entry created event map
288 // entry removed event map
293 // entry moved event map
493 while (Entry* entry = directory->GetFirstEntry()) {
494 RemoveEntry(entry);
495 delete entry;
633 AddEntry(Entry* entry) argument
659 RemoveEntry(Entry* entry) argument
679 DeleteEntry(Entry* entry, bool keepNode) argument
719 Entry* entry = GetEntry(volumeID, directoryID, name); local
908 GetPath(Entry* entry, Path* path) argument
945 DirectoryContains(Directory* directory, Entry* entry) argument
1088 Entry* entry; local
1467 Entry* entry = rootDir->GetFirstReferringEntry(); local
1632 Entry* entry; local
1663 _GenerateEntryRemovedEvent(Entry* entry, bigtime_t time, EntryRemovedEvent** _event) argument
1705 BEntry entry; local
[all...]
H A DDirectory.h20 void AddEntry(Entry* entry);
21 void RemoveEntry(Entry* entry);
23 Entry* GetNextEntry(Entry* entry) const;
H A DNode.cpp67 Node::AddReferringEntry(Entry* entry) argument
69 if (!entry)
71 fReferringEntries.Insert(entry);
76 Node::RemoveReferringEntry(Entry* entry) argument
78 if (entry)
79 fReferringEntries.Remove(entry);
91 Node::GetNextReferringEntry(Entry* entry) const
93 return (entry ? fReferringEntries.GetNext(entry) : NULL);
111 for (Entry* entry
251 Entry* entry = GetActualReferringEntry(); local
[all...]
/haiku-fatelf/src/tests/add-ons/kernel/file_systems/userlandfs/r5/src/test/netfs/server/
H A DVolumeManager.cpp27 // with one event of each kind for each entry/node.
225 // entry created events
232 // entry removed events
239 // entry moved events
281 // entry created event map
286 // entry removed event map
291 // entry moved event map
491 while (Entry* entry = directory->GetFirstEntry()) {
492 RemoveEntry(entry);
493 delete entry;
631 AddEntry(Entry* entry) argument
657 RemoveEntry(Entry* entry) argument
677 DeleteEntry(Entry* entry, bool keepNode) argument
717 Entry* entry = GetEntry(volumeID, directoryID, name); local
904 GetPath(Entry* entry, Path* path) argument
941 DirectoryContains(Directory* directory, Entry* entry) argument
1084 Entry* entry; local
1463 Entry* entry = rootDir->GetFirstReferringEntry(); local
1628 Entry* entry; local
1659 _GenerateEntryRemovedEvent(Entry* entry, bigtime_t time, EntryRemovedEvent** _event) argument
1701 BEntry entry; local
[all...]
H A DDirectory.h23 void AddEntry(Entry* entry);
24 void RemoveEntry(Entry* entry);
26 Entry* GetNextEntry(Entry* entry) const;
/haiku-fatelf/src/tests/add-ons/kernel/file_systems/bfs/queries/
H A Dtest.cpp124 BEntry *entry = getEntry(2); local
125 if (entry->InitCheck() < B_OK) {
126 fprintf(stderr, "Could not get entry for file 2\n");
130 entry->Rename("_some_other_name_");
133 entry->Rename("_some_other_");
136 entry->Rename("_query_test_2");
140 entry->Rename("_query_test_2_and_more");
148 entry->Remove();
149 delete entry;
152 entry
[all...]
/haiku-fatelf/src/tools/docbook/libxml2/
H A Dhash.c35 * A single entry in the hash table
227 a new entry needs to allocated and data copied into it from
247 * put back the entry in the new table
374 * by using the @name. Existing entry for this @name will be removed
394 * by using the (@name, @name2) tuple. Existing entry for this tuple will
490 xmlHashEntryPtr entry; local
554 entry = &(table->table[key]);
556 entry = xmlMalloc(sizeof(xmlHashEntry));
557 if (entry == NULL)
562 entry
606 xmlHashEntryPtr entry; local
727 xmlHashEntryPtr entry; local
773 xmlHashEntryPtr entry; local
1032 xmlHashEntryPtr entry; local
[all...]
/haiku-fatelf/src/tests/kits/storage/testapps/
H A DNodeMonitorTest.cpp62 BEntry entry("/tmp", true);
64 if (entry.GetNodeRef(&nodeRef) != B_OK) {
76 entry.SetTo("/tmp/_watch_test_");
79 status_t status = file.SetTo(&entry, B_CREATE_FILE | B_READ_WRITE);
85 if (entry.Remove() != B_OK)
/haiku-fatelf/src/tests/kits/storage/
H A DEntryTest.cpp128 static TestEntry *resolve_link(TestEntry *entry);
129 static string get_shortest_relative_path(TestEntry *dir, TestEntry *entry);
291 examine_entry(BEntry &entry, TestEntry *testEntry, bool traverse) argument
296 CPPUNIT_ASSERT( entry.Exists() == testEntry->isConcrete() );
299 CPPUNIT_ASSERT( entry.GetPath(&path) == B_OK );
303 CPPUNIT_ASSERT( entry.GetName(name) == B_OK );
307 CPPUNIT_ASSERT( entry.GetParent(&parentEntry) == B_OK );
315 CPPUNIT_ASSERT( entry.GetParent(&parentDir) == B_OK );
322 CPPUNIT_ASSERT( entry.GetRef(&ref) == B_OK );
323 // We can't get a ref of an entry wit
447 BEntry entry; local
813 BEntry entry; local
848 BEntry entry; local
869 BEntry entry; local
927 BEntry entry; local
1296 BEntry entry; local
1414 BEntry entry; local
1532 BEntry entry; local
1635 BEntry entry; local
1776 BEntry entry; local
1913 BEntry entry; local
1958 compareEntries(const BEntry &entry, const BEntry &entry2, const TestEntry *testEntry, const TestEntry *testEntry2, bool traversed, bool traversed2) argument
1981 BEntry entry; local
1999 BEntry entry; local
2050 BEntry entry; local
2085 BEntry entry; local
2095 BEntry entry; local
[all...]
H A DDirectoryTest.cpp162 BEntry entry(existing);
163 CPPUNIT_ASSERT( entry.InitCheck() == B_OK );
164 BDirectory dir(&entry);
169 BEntry entry(nonExisting);
170 CPPUNIT_ASSERT( entry.InitCheck() == B_OK );
171 BDirectory dir(&entry);
181 BEntry entry; local
182 BDirectory dir(&entry);
187 BEntry entry(existingFile);
188 CPPUNIT_ASSERT( entry
575 BEntry entry; local
654 BEntry entry; local
1066 BEntry entry; local
1167 BEntry entry; local
[all...]
/haiku-fatelf/headers/os/package/
H A DPackageInfoContentHandler.h30 virtual status_t HandleEntry(BHPKG::BPackageEntry* entry);
32 BHPKG::BPackageEntry* entry,
34 virtual status_t HandleEntryDone(BHPKG::BPackageEntry* entry);
H A DRepositoryConfig.h21 BRepositoryConfig(const BEntry& entry);
24 status_t Store(const BEntry& entry) const;
26 status_t SetTo(const BEntry& entry);
/haiku-fatelf/src/apps/text_search/
H A DFileIterator.cpp29 FileIterator::_ExamineFile(BEntry& entry, char* buffer, bool textFilesOnly) argument
32 if (entry.GetPath(&path) != B_OK)
41 BNode node(&entry);
/haiku-fatelf/src/servers/app/
H A DHashTable.h38 struct entry;
41 entry *_GetHashEntry(Hashable& key) const;
43 entry** fTable;
/haiku-fatelf/src/tests/add-ons/kernel/file_systems/fs_shell/
H A Dpath_util.cpp48 make_path(const char *dir, const char *entry) argument
52 int entryLen = strlen(entry);
65 strcat(path + dirLen, entry);
/haiku-fatelf/src/tests/kits/midi/midi_player/
H A DMidiPlayer.cpp47 BEntry entry(argv[1],true);
48 if(!entry.Exists()) {
59 entry.GetRef(&e_ref);
/haiku-fatelf/src/tests/kits/midi/
H A Dtest1.cpp13 BEntry entry(argv[1],true);
14 if(!entry.Exists()) {
19 entry.GetRef(&e_ref);
/haiku-fatelf/src/tools/fs_shell/
H A Dpath_util.cpp52 make_path(const char *dir, const char *entry) argument
56 int entryLen = strlen(entry);
69 strcat(path + dirLen, entry);
/haiku-fatelf/src/bin/pcmcia-cs/
H A Ddump_cis.c279 static void print_cftable_entry(cistpl_cftable_entry_t *entry) argument
283 printf("%scftable_entry 0x%2.2x%s\n", indent, entry->index,
284 (entry->flags & CISTPL_CFTABLE_DEFAULT) ? " [default]" : "");
286 if (entry->flags & ~CISTPL_CFTABLE_DEFAULT) {
288 if (entry->flags & CISTPL_CFTABLE_BVDS)
290 if (entry->flags & CISTPL_CFTABLE_WP)
292 if (entry->flags & CISTPL_CFTABLE_RDYBSY)
294 if (entry->flags & CISTPL_CFTABLE_MWAIT)
296 if (entry->flags & CISTPL_CFTABLE_AUDIO)
298 if (entry
376 print_cftable_entry_cb(cistpl_cftable_entry_cb_t *entry) argument
[all...]
/haiku-fatelf/src/add-ons/kernel/drivers/graphics/common/
H A Dlog_coll.c31 // write one log entry
36 log_entry *entry; local
48 entry = (log_entry *)&li->log_buffer[pos];
50 entry->tsc = system_time();
51 entry->what = what;
52 entry->num_args = num_args;
56 entry->args[i] = va_arg( vl, uint32 );
/haiku-fatelf/src/bin/gdb/bfd/
H A Delf-strtab.c28 /* An entry in the strtab hash table. */
33 /* Length of this entry. This includes the zero terminator. */
59 /* Routine to create an entry in a section merge hashtab. */
62 elf_strtab_hash_newfunc (struct bfd_hash_entry *entry, argument
68 if (entry == NULL)
69 entry = bfd_hash_allocate (table, sizeof (struct elf_strtab_hash_entry));
70 if (entry == NULL)
74 entry = bfd_hash_newfunc (entry, table, string);
76 if (entry)
142 register struct elf_strtab_hash_entry *entry; local
216 struct elf_strtab_hash_entry *entry; local
[all...]
/haiku-fatelf/src/bin/gdb/gdb/
H A Dframe-base.c106 struct frame_base_table_entry *entry; local
108 for (entry = table->head; entry != NULL; entry = entry->next)
111 desc = entry->sniffer (next_frame);
/haiku-fatelf/src/bin/network/atftpd/
H A Doptions.c41 char *entry = NULL; local
47 entry = argz_next(tftp_data->th_stuff, size, entry);
48 if (!entry)
51 opt_set_options(options, "filename", entry);
53 entry = argz_next(tftp_data->th_stuff, size, entry);
54 if (!entry)
57 opt_set_options(options, "mode", entry);
60 while ((entry
77 char *entry = NULL; local
[all...]
/haiku-fatelf/src/tests/servers/app/statusbar/
H A Dmain.cpp37 BEntry entry; local
38 while (fHomeFolder.GetNextEntry(&entry) == B_OK)
54 BEntry entry; local
55 if (fHomeFolder.GetNextEntry(&entry) < B_OK) {
59 if (fHomeFolder.GetNextEntry(&entry) < B_OK)
64 if (entry.GetName(name) < B_OK)

Completed in 282 milliseconds

1234567891011>>