Searched refs:fFirstEntry (Results 1 - 8 of 8) sorted by relevance

/haiku-fatelf/src/add-ons/media/media-add-ons/multi_audio/
H A DTimeComputer.cpp20 fFirstEntry(0),
45 fFirstEntry = 0;
78 Entry& entry = fEntries[fFirstEntry];
92 if (fLastEntry == fFirstEntry)
93 fFirstEntry = (fFirstEntry + 1) % kEntryCount;
H A DTimeComputer.h47 int32 fFirstEntry; member in struct:TimeComputer
/haiku-fatelf/src/kits/media/
H A DTimedEventQueuePrivate.cpp48 fFirstEntry(NULL),
59 entry = fFirstEntry;
84 if (fFirstEntry == NULL) {
87 fFirstEntry = fLastEntry = new event_queue_entry;
88 fFirstEntry->event = event;
89 fFirstEntry->prev = NULL;
90 fFirstEntry->next = NULL;
96 if (fFirstEntry->event.event_time >= event.event_time) {
100 newentry->next = fFirstEntry;
101 fFirstEntry
[all...]
H A DTimedEventQueuePrivate.h73 event_queue_entry *fFirstEntry; member in struct:_event_queue_imp
/haiku-fatelf/src/add-ons/kernel/file_systems/ext2/
H A DHTreeEntryIterator.cpp40 fFirstEntry = offset % fBlockSize / sizeof(HTreeEntry);
41 fCurrentEntry = fFirstEntry;
56 fFirstEntry(1),
75 (uint32)fFirstEntry);
89 &((HTreeEntry*)block)[fFirstEntry]);
101 if (fLimit != fBlockSize / sizeof(HTreeEntry) - fFirstEntry) {
104 - fFirstEntry, fBlockNum);
149 HTreeEntry* end = (HTreeEntry*)block + fCount + fFirstEntry - 1;
220 bool endOfBlock = fCurrentEntry >= (fCount + fFirstEntry);
241 fFirstEntry
[all...]
H A DHTreeEntryIterator.h52 uint16 fFirstEntry; member in class:HTreeEntryIterator
/haiku-fatelf/src/system/kernel/debug/
H A Dtracing.cpp119 trace_entry* fFirstEntry; member in class:TracingMetaData
201 return fFirstEntry;
260 if (entry == fFirstEntry)
286 fFirstEntry, fAfterLastEntry, fBuffer));
301 fAfterLastEntry, fFirstEntry, fEntries));
319 if (fFirstEntry > fAfterLastEntry)
320 return start >= (addr_t)fFirstEntry || end <= (addr_t)fAfterLastEntry;
322 return start >= (addr_t)fFirstEntry && end <= (addr_t)fAfterLastEntry;
329 TRACE((" skip start %p, %lu*4 bytes\n", fFirstEntry, fFirstEntry
[all...]
/haiku-fatelf/src/add-ons/kernel/file_systems/cdda/
H A Dkernel_interface.cpp102 Inode* FirstEntry() const { return fFirstEntry; }
134 Inode* fFirstEntry; member in class:Volume
570 fFirstEntry(NULL)
594 for (inode = fFirstEntry; inode != NULL; inode = next) {
784 for (Inode* inode = fFirstEntry; inode != NULL; inode = inode->Next()) {
800 for (Inode* inode = fFirstEntry; inode != NULL; inode = inode->Next()) {
864 Inode* current = fFirstEntry;
874 fFirstEntry = inode;
917 for (Inode* inode = fFirstEntry; inode != NULL; inode = inode->Next()) {
925 for (Inode* inode = fFirstEntry; inod
[all...]

Completed in 120 milliseconds