Searched refs:fEntries (Results 1 - 25 of 62) sorted by relevance

123

/haiku/src/kits/debugger/dwarf/
H A DBaseUnit.cpp32 for (int32 i = 0; i < fEntries.Count(); i++)
33 delete fEntries[i];
47 if (!fEntries.Add(entry))
50 fEntries.Remove(fEntries.Count() - 1);
75 return fEntries.Count();
83 entry = fEntries[index];
91 if (fEntries.IsEmpty())
96 int upper = fEntries.Count() - 1;
105 return fEntryOffsets[lower] == offset ? fEntries[lowe
[all...]
/haiku/headers/private/debugger/files/
H A DLocatableDirectory.h29 const LocatableEntryList& Entries() const { return fEntries; }
34 LocatableEntryList fEntries; member in class:LocatableDirectory
/haiku/src/add-ons/kernel/file_systems/nfs4/
H A DDirectoryCache.cpp54 NameCacheEntry* entry = snapshot.fEntries.Head();
61 fEntries.Add(new_entry);
63 entry = snapshot.fEntries.GetNext(entry);
70 while (!fEntries.IsEmpty()) {
71 NameCacheEntry* current = fEntries.RemoveHead();
149 fDirectoryCache->fEntries.Add(entry);
183 iterator = fDirectoryCache->fEntries.GetIterator();
188 fDirectoryCache->fEntries.Remove(previous, current);
281 = oldSnapshot->fEntries.GetIterator();
285 = newSnapshot->fEntries
[all...]
/haiku/src/add-ons/kernel/file_systems/packagefs/indices/
H A DNameIndex.cpp95 return index->fEntries;
116 fEntries(NULL)
126 delete fEntries;
143 fEntries = new(std::nothrow) EntryTree;
144 if (fEntries == NULL)
154 return fEntries->CountItems();
161 fEntries->Insert(node);
171 fEntries->Remove(node, node);
/haiku/src/kits/debugger/files/
H A DLocatableDirectory.cpp73 fEntries.Add(entry);
80 fEntries.Remove(entry);
/haiku/src/tests/add-ons/kernel/kernelland_emu/
H A Dcondition_variable.cpp73 fVariable->fEntries.Add(this);
102 fVariable->fEntries.Remove(this);
126 fVariable->fEntries.Add(this);
140 new(&fEntries) EntryList;
151 new(&fEntries) EntryList;
172 if (!fEntries.IsEmpty())
199 if (!fEntries.IsEmpty()) {
218 while (ConditionVariableEntry* entry = fEntries.RemoveHead()) {
/haiku/src/apps/mail/
H A DWIndex.cpp180 fEntries = head.entries;
183 fBlocks = fEntries / fEntriesPerBlock + 1;;
190 if (fEntries)
200 if (fEntries && !fIsSorted)
204 head.entries = fEntries;
209 if (fEntries)
219 if (!fEntries)
227 Ub = fEntries - 1;
247 memcpy(((WIndexEntry *)(fEntryList + (fEntries * fEntrySize))), entry,
249 fEntries
[all...]
/haiku/src/add-ons/kernel/file_systems/netfs/server/
H A DVolume.cpp94 fEntries(NULL)
102 if (fEntries) {
103 for (EntryMap::Iterator it = fEntries->GetIterator(); it.HasNext();) {
107 delete fEntries;
141 fEntries = new(std::nothrow) EntryMap;
142 if (!fEntries)
144 if (fEntries->InitCheck() != B_OK)
145 return fEntries->InitCheck();
256 return fEntries->Put(EntryKey(entry), entry);
264 fEntries
[all...]
/haiku/src/add-ons/kernel/file_systems/ramfs/
H A DNameIndex.cpp103 fEntries(new(nothrow) EntryTree)
105 if (fInitStatus == B_OK && !fEntries)
118 if (fEntries)
119 delete fEntries;
130 return fEntries->CountItems();
141 = fEntries->Find(NameIndexPrimaryKey(entry, oldName), entry, &it);
144 error = fEntries->Insert(entry);
158 fEntries->Insert(entry);
170 fEntries->Remove(entry, entry);
335 fIndex->fEntries
[all...]
H A DDirectory.h35 bool IsEmpty() const { return fEntries.IsEmpty(); }
57 DoublyLinkedList<Entry> fEntries; member in class:Directory
H A DDirectory.cpp18 fEntries()
26 while (Entry *entry = fEntries.First()) {
138 fEntries.Insert(entry);
144 fEntries.Remove(entry);
195 Entry *nextEntry = fEntries.GetNext(entry);
218 fEntries.Remove(entry);
299 *entry = fEntries.Last();
301 *entry = fEntries.GetPrevious(*entry);
317 *entry = fEntries.First();
319 *entry = fEntries
[all...]
/haiku/src/system/libroot/os/
H A Dimage.cpp30 fEntries(NULL),
41 delete[] fEntries;
72 && fEntries[fNextEntryIndex].index == index) {
73 env = fEntries[fNextEntryIndex].replacement;
83 size_t envSize = _FillSlot(fEntries[i].replacement, buffer);
128 fEntries = new(std::nothrow) Entry[entryCount];
129 if (fEntries == NULL)
141 fEntries[fEntryCount].replacement = out;
142 fEntries[fEntryCount].index = _FindEnvEntry(env, envCount, out,
144 if (fEntries[fEntryCoun
195 Entry* fEntries; member in struct:EnvironmentFilter
[all...]
/haiku/src/kits/device/
H A DUSBRoster.cpp39 WatchedEntry * fEntries; member in class:WatchedEntry
65 fEntries(NULL),
84 child->fLink = fEntries;
85 fEntries = child;
112 WatchedEntry *child = fEntries;
134 WatchedEntry *child = fEntries;
149 child->fLink = fEntries;
150 fEntries = child;
161 WatchedEntry *child = fEntries;
168 fEntries
[all...]
/haiku/src/system/kernel/fs/
H A DEntryCache.cpp57 new(&fEntries) EntryTable;
64 EntryCacheEntry* entry = fEntries.Clear(true);
78 status_t error = fEntries.Init();
99 EntryCacheEntry* entry = fEntries.Lookup(key);
123 fEntries.Insert(entry);
138 EntryCacheEntry* entry = fEntries.Lookup(key);
142 fEntries.Remove(entry);
167 EntryCacheEntry* entry = fEntries.Lookup(key);
217 for (EntryTable::Iterator it = fEntries.GetIterator();
250 fEntries
[all...]
/haiku/src/system/kernel/
H A Dcondition_variable.cpp126 fVariable->fEntries.Add(this);
165 if (fVariable->fEntries.Contains(this)) {
166 fVariable->fEntries.Remove(this);
169 // The variable's fEntries did not contain us, but we currently
205 new(&fEntries) EntryList;
221 new(&fEntries) EntryList;
260 if (!fEntries.IsEmpty())
313 if (!fEntries.IsEmpty()) {
333 while (ConditionVariableEntry* entry = fEntries.RemoveHead()) {
369 int count = variable->fEntries
[all...]
/haiku/src/add-ons/kernel/file_systems/netfs/client/
H A DVirtualDir.cpp159 fEntries(),
176 return fEntries.InitCheck();
204 if (!name || !child || fEntries.ContainsKey(name))
217 error = fEntries.Put(name, entry);
239 VirtualDirEntry* entry = fEntries.Remove(name);
268 return fEntries.Get(name);
H A DShareNode.cpp295 return (!fRewind && fIndex < fCount ? fEntries[fIndex] : NULL);
347 fEntries[i]->ReleaseReference();
361 fEntries[fCount++] = entry;
400 fEntries(),
462 fEntries.Insert(entry);
478 fEntries.Remove(entry);
486 return fEntries.First();
496 return fEntries.GetNext(entry);
/haiku/src/system/boot/loader/file_systems/packagefs/
H A DPackageSettingsItem.cpp24 fEntries(),
32 Entry* entry = fEntries.Clear(true);
86 if (fEntries.Init() != B_OK)
107 fEntries.Insert(entry);
154 return fEntries.Lookup(EntryKey(parent, name));
162 return fEntries.Lookup(EntryKey(parent, name, nameLength));
/haiku/src/add-ons/kernel/partitioning_systems/gpt/
H A DHeader.cpp54 fEntries(NULL),
100 fEntries = new (std::nothrow) uint8[_EntryArraySize()];
101 if (fEntries == NULL) {
109 fEntries, _EntryArraySize());
113 fEntries, _EntryArraySize());
140 fEntries(NULL),
162 fEntries = new (std::nothrow) uint8[arraySize];
163 if (fEntries == NULL) {
168 memset(fEntries, 0, arraySize);
189 delete[] fEntries;
[all...]
H A DHeader.h40 { return *(efi_partition_entry*)(fEntries
77 uint8* fEntries; member in class:EFI::Header
/haiku/src/add-ons/media/media-add-ons/multi_audio/
H A DTimeComputer.cpp78 Entry& entry = fEntries[fFirstEntry];
88 Entry& entry = fEntries[fLastEntry];
/haiku/src/system/boot/loader/net/
H A DARP.cpp30 fEntries[i].ip = INADDR_ANY;
191 if (ip == fEntries[i].ip)
192 return fEntries + i;
203 MapEntry *entry = fEntries;
205 if (fEntries[i].ip == INADDR_ANY) {
206 entry = fEntries + i;
210 if (fAge - fEntries[i].age > fAge - entry->age)
211 entry = fEntries + i;
/haiku/src/bin/
H A Ddiff_zip.cpp137 fEntries()
143 fEntries[name] = node;
173 fEntries[entry->d_name] = node;
188 for (EntryMap::iterator it = fEntries.begin(); it != fEntries.end();
228 EntryMap::const_iterator it = fEntries.find(entry->d_name);
229 if (it == fEntries.end()) {
262 for (EntryMap::const_iterator it = fEntries.begin();
263 it != fEntries.end(); ++it) {
272 EntryMap fEntries; member in class:Directory
[all...]
/haiku/src/apps/showimage/
H A DImageFileNavigator.cpp94 BObjectList<entry_ref> fEntries; member in class:FolderNavigator
249 fEntries(true)
282 index = next ? fEntries.CountItems() : 0;
285 index = fEntries.BinarySearchIndex(currentRef,
293 while (index < fEntries.CountItems() && index >= 0) {
294 const entry_ref& ref = *fEntries.ItemAt(index);
300 delete fEntries.RemoveItemAt(index);
320 fEntries.MakeEmpty();
331 fEntries.AddItem(ref);
334 fEntries
[all...]
/haiku/headers/private/kernel/boot/net/
H A DARP.h46 MapEntry fEntries[MAP_ENTRY_COUNT]; member in class:ARPService

Completed in 395 milliseconds

123