/haiku/src/kits/debugger/dwarf/ |
H A D | BaseUnit.cpp | 33 for (int32 i = 0; i < fEntries.Count(); i++) 34 delete fEntries[i]; 48 if (!fEntries.Add(entry)) 51 fEntries.Remove(fEntries.Count() - 1); 76 return fEntries.Count(); 84 entry = fEntries[index]; 92 if (fEntries.IsEmpty()) 97 int upper = fEntries.Count() - 1; 106 return fEntryOffsets[lower] == offset ? fEntries[lowe [all...] |
/haiku/headers/private/debugger/files/ |
H A D | LocatableDirectory.h | 29 const LocatableEntryList& Entries() const { return fEntries; } 34 LocatableEntryList fEntries; member in class:LocatableDirectory
|
/haiku/src/add-ons/kernel/file_systems/nfs4/ |
H A D | DirectoryCache.cpp | 54 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 D | NameIndex.cpp | 95 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 D | LocatableDirectory.cpp | 73 fEntries.Add(entry); 80 fEntries.Remove(entry);
|
/haiku/src/tests/add-ons/kernel/kernelland_emu/ |
H A D | condition_variable.cpp | 86 fVariable->fEntries.Add(this); 132 fVariable->fEntries.Add(this); 141 fVariable->fEntries.Remove(this); 157 new(&fEntries) EntryList; 168 new(&fEntries) EntryList; 189 if (!fEntries.IsEmpty()) 216 if (!fEntries.IsEmpty()) { 238 while (ConditionVariableEntry* entry = fEntries.RemoveHead()) {
|
/haiku/src/apps/mail/ |
H A D | WIndex.cpp | 181 fEntries = head.entries; 184 fBlocks = fEntries / fEntriesPerBlock + 1;; 191 if (fEntries) 201 if (fEntries && !fIsSorted) 205 head.entries = fEntries; 210 if (fEntries) 220 if (!fEntries) 228 Ub = fEntries - 1; 248 memcpy(((WIndexEntry *)(fEntryList + (fEntries * fEntrySize))), entry, 250 fEntries [all...] |
/haiku/src/add-ons/kernel/file_systems/netfs/server/ |
H A D | Volume.cpp | 94 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...] |
H A D | Directory.h | 39 EntryList fEntries; member in class:Directory
|
/haiku/src/add-ons/kernel/file_systems/ramfs/ |
H A D | NameIndex.cpp | 103 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 D | Directory.h | 35 bool IsEmpty() const { return fEntries.IsEmpty(); } 57 DoublyLinkedList<Entry> fEntries; member in class:Directory
|
H A D | Directory.cpp | 18 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 D | image.cpp | 30 fEntries(NULL), 41 delete[] fEntries; 71 && fEntries[fNextEntryIndex].index == index) { 72 env = fEntries[fNextEntryIndex].replacement; 82 size_t envSize = _FillSlot(fEntries[i].replacement, buffer); 127 fEntries = new(std::nothrow) Entry[entryCount]; 128 if (fEntries == NULL) 140 fEntries[fEntryCount].replacement = out; 141 fEntries[fEntryCount].index = _FindEnvEntry(env, envCount, out, 143 if (fEntries[fEntryCoun 194 Entry* fEntries; member in struct:EnvironmentFilter [all...] |
/haiku/src/kits/device/ |
H A D | USBRoster.cpp | 39 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 D | EntryCache.cpp | 58 new(&fEntries) EntryTable; 65 EntryCacheEntry* entry = fEntries.Clear(true); 80 status_t error = fEntries.Init(); 115 EntryCacheEntry* entry = fEntries.Lookup(key); 139 fEntries.Insert(entry); 154 EntryCacheEntry* entry = fEntries.Lookup(key); 158 fEntries.Remove(entry); 183 EntryCacheEntry* entry = fEntries.Lookup(key); 233 for (EntryTable::Iterator it = fEntries.GetIterator(); 268 fEntries [all...] |
/haiku/src/add-ons/kernel/file_systems/netfs/client/ |
H A D | VirtualDir.cpp | 159 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 D | ShareNode.cpp | 295 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 D | PackageSettingsItem.cpp | 24 fEntries(), 32 Entry* entry = fEntries.Clear(true); 84 if (fEntries.Init() != B_OK) 105 fEntries.Insert(entry); 152 return fEntries.Lookup(EntryKey(parent, name)); 160 return fEntries.Lookup(EntryKey(parent, name, nameLength));
|
/haiku/src/add-ons/kernel/partitioning_systems/gpt/ |
H A D | Header.cpp | 54 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 D | Header.h | 40 { return *(gpt_partition_entry*)(fEntries 77 uint8* fEntries; member in class:EFI::Header
|
/haiku/src/system/boot/loader/net/ |
H A D | ARP.cpp | 30 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/add-ons/media/media-add-ons/multi_audio/ |
H A D | TimeComputer.cpp | 79 Entry& entry = fEntries[fFirstEntry]; 89 Entry& entry = fEntries[fLastEntry];
|
/haiku/src/apps/showimage/ |
H A D | ImageFileNavigator.cpp | 94 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/src/bin/ |
H A D | diff_zip.cpp | 137 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/headers/private/kernel/boot/net/ |
H A D | ARP.h | 46 MapEntry fEntries[MAP_ENTRY_COUNT]; member in class:ARPService
|