/haiku/src/kits/debugger/dwarf/ |
H A D | DwarfUtils.h | 19 static void GetDIEName(const DebugInfoEntry* entry, 21 static void GetDIETypeName(const DebugInfoEntry* entry, 25 static void GetFullDIEName(const DebugInfoEntry* entry, 28 const DebugInfoEntry* entry, 34 const DebugInfoEntry* entry, 40 static EntryType* GetDIEByPredicate(EntryType* entry, 47 DwarfUtils::GetDIEByPredicate(EntryType* entry, const Predicate& predicate) argument 49 if (predicate(entry)) 50 return entry; 54 entry [all...] |
H A D | DwarfUtils.cpp | 17 DwarfUtils::GetDIEName(const DebugInfoEntry* entry, BString& _name) argument 21 const char* name = entry->Name(); 23 if (DebugInfoEntry* abstractOrigin = entry->AbstractOrigin()) { 24 entry = abstractOrigin; 25 name = entry->Name(); 32 if (DebugInfoEntry* specification = entry->Specification()) { 33 entry = specification; 34 name = entry->Name(); 43 DwarfUtils::GetDIETypeName(const DebugInfoEntry* entry, BString& _name, argument 46 const DIEType* type = dynamic_cast<const DIEType*>(entry); 105 GetFullDIEName(const DebugInfoEntry* entry, BString& _name) argument 188 GetFullyQualifiedDIEName(const DebugInfoEntry* entry, BString& _name, const DebugInfoEntry* requestingEntry) argument 238 GetDeclarationLocation(DwarfFile* dwarfFile, const DebugInfoEntry* entry, const char*& _directory, const char*& _file, int32& _line, int32& _column) argument [all...] |
/haiku/src/tools/translation/tiffinfo/ |
H A D | tiffinfo.cpp | 168 print_ifd_value(IFDEntry &entry, BFile &file, swap_action swp) argument 170 switch (entry.tag) { 172 if (entry.count == 1 && entry.fieldType == TIFF_LONG) { 173 if (entry.longval & 1) 175 if (entry.longval & 2) 177 if (entry.longval & 4) 180 printf("(0x%.8lx)", entry.longval); 187 if (entry.count == 1) { 189 ((entry 404 swap_value_field(IFDEntry &entry, swap_action swp) argument 452 IFDEntry entry; local [all...] |
/haiku/src/bin/bfs_tools/lib/ |
H A D | Cache.h | 60 Cacheable *entry = fLeastRecentlyUsed; local 61 while (entry) 63 Cacheable *prev = entry->prev; 64 if (entry->locked <= 0 || force) 66 if (entry->next) 67 entry->next->prev = prev; 69 prev->next = entry->next; 71 if (fLeastRecentlyUsed == entry) 73 if (fMostRecentlyUsed == entry) 76 delete entry; 95 Cacheable *entry = Get(data); local 105 Cacheable *entry = Get(data); local 115 Cacheable *entry = Get(data); local 125 Cacheable *entry = GetFromCache(data); local 177 Cacheable *entry = fMostRecentlyUsed; local [all...] |
H A D | Hashtable.cpp | 65 struct Entry *entry,*next; local 67 for(entry = table[index];entry;entry = next) 69 next = entry->next; 70 delete entry; 103 Entry *entry = GetHashEntry(key); local 105 return entry ? entry->value : NULL; 111 Entry *entry local 133 Entry **table,*entry,*prev; local 201 Entry *entry, *next; local 260 Entry *oldEntry,*entry = NULL; local 279 Entry **table,*entry; local [all...] |
/haiku/src/system/boot/loader/ |
H A D | RootFileSystem.cpp | 22 struct entry *entry = NULL; local 24 while ((entry = fList.RemoveHead()) != NULL) { 25 entry->root->Release(); 26 delete entry; 56 struct entry *entry; local 60 while ((entry = iterator.Next()) != NULL) { 61 if (!strcmp(name, entry->name)) { 62 entry 90 struct entry *entry; local 104 struct entry *entry; local 135 struct entry *entry = new (std::nothrow) RootFileSystem::entry(); local 153 struct entry *entry = new (std::nothrow) RootFileSystem::entry(); local 171 struct entry *entry; local [all...] |
/haiku/src/kits/media/ |
H A D | TimedEventQueuePrivate.cpp | 58 event_queue_entry *entry; local 59 entry = fFirstEntry; 60 while (entry) { 62 deleteme = entry; 63 entry = entry->next; 118 for (event_queue_entry *entry = fLastEntry; entry; entry = entry 227 event_queue_entry *entry; local 287 event_queue_entry *entry; local 420 event_queue_entry *entry; local 507 RemoveEntry(event_queue_entry *entry) argument 587 event_queue_entry *entry; local 603 event_queue_entry *entry; local [all...] |
/haiku/src/system/kernel/fs/ |
H A D | EntryCache.cpp | 56 rw_lock_init(&fLock, "entry cache"); 65 EntryCacheEntry* entry = fEntries.Clear(true); local 66 while (entry != NULL) { 67 EntryCacheEntry* next = entry->hash_link; 68 free(entry); 69 entry = next; 115 EntryCacheEntry* entry = fEntries.Lookup(key); 116 if (entry != NULL) { 117 entry->node_id = nodeID; 118 entry 154 EntryCacheEntry* entry = fEntries.Lookup(key); local 183 EntryCacheEntry* entry = fEntries.Lookup(key); local 247 _AddEntryToCurrentGeneration(EntryCacheEntry* entry) argument [all...] |
/haiku/src/system/kernel/arch/m68k/ |
H A D | arch_030_mmu.cpp | 20 long_page_directory_entry entry; local 21 *(uint64 *)&entry = DFL_PAGEENT_VAL; 22 entry.type = DT_ROOT; 23 entry.addr = TA_TO_PREA(((addr_t)rt)); 28 : : "a"((uint64 *)&entry));
|
/haiku/src/servers/launch/ |
H A D | AbstractEmptyDirectoryJob.cpp | 25 BEntry entry(path); 26 if (!entry.Exists()) { 29 status_t status = entry.SetTo(path); 37 return _EmptyDirectory(entry, false); 46 BEntry entry; local 47 while (directory.GetNextEntry(&entry) == B_OK) { 48 if (entry.IsDirectory()) 49 _EmptyDirectory(entry, true); 51 entry.Remove();
|
/haiku/src/add-ons/kernel/drivers/network/wlan/atheroswifi/dev/ath/ath_hal/ar5416/ |
H A D | ar5416_keycache.c | 38 * Clear the specified key cache entry and any associated MIC entry. 41 ar5416ResetKeyCacheEntry(struct ath_hal *ah, uint16_t entry) argument 45 if (ar5212ResetKeyCacheEntry(ah, entry)) { 46 ahp->ah_keytype[entry] = keyType[HAL_CIPHER_CLR]; 53 * Sets the contents of the specified key cache entry 54 * and any associated MIC entry. 57 ar5416SetKeyCacheEntry(struct ath_hal *ah, uint16_t entry, argument 63 if (ar5212SetKeyCacheEntry(ah, entry, k, mac, xorKey)) { 64 ahp->ah_keytype[entry] [all...] |
/haiku/src/apps/showimage/ |
H A D | ImageCache.cpp | 94 CacheEntry* entry = find->second; local 96 // Requeue cache entry to the end of the by-age list 97 TRACE("requeue trace entry %s\n", ref.name); 98 fCacheEntriesByAge.Remove(entry); 99 fCacheEntriesByAge.Add(entry); 102 _NotifyTarget(entry, target); 107 QueueEntry* entry; local 116 TRACE("ignore entry %s\n", ref.name); 122 // Push new entry to the queue 123 entry 166 QueueEntry* entry = *fQueue.begin(); local 197 QueueEntry* entry = *self->fQueue.begin(); local 223 CacheEntry* entry = new(std::nothrow) CacheEntry(); local 326 _NotifyListeners(CacheEntry* entry, QueueEntry* queueEntry) argument 350 _NotifyTarget(CacheEntry* entry, const BMessenger* target) argument 366 _BuildNotification(CacheEntry* entry, BMessage& message) argument [all...] |
/haiku/src/add-ons/kernel/file_systems/ramfs/ |
H A D | Directory.cpp | 26 while (Entry *entry = fEntries.First()) { 27 if (DeleteEntry(entry) != B_OK) { 36 Directory::Link(Entry *entry) argument 39 return Node::Link(entry); 45 Directory::Unlink(Entry *entry) argument 47 if (entry == fReferrers.First()) 48 return Node::Unlink(entry); 70 Entry *entry = fReferrers.First(); local 71 return (entry ? entry 134 AddEntry(Entry *entry) argument 158 Entry *entry = new(nothrow) Entry(name); local 187 RemoveEntry(Entry *entry) argument 229 DeleteEntry(Entry *entry) argument 271 Entry *entry = NULL; local 282 Entry *entry = NULL; local 334 Entry *entry = NULL; local [all...] |
H A D | Directory.h | 22 virtual status_t Link(Entry *entry); 23 virtual status_t Unlink(Entry *entry); 37 status_t AddEntry(Entry *entry); 38 status_t CreateEntry(Node *node, const char *name, Entry **entry = NULL); 39 status_t RemoveEntry(Entry *entry); 40 status_t DeleteEntry(Entry *entry); 42 status_t FindEntry(const char *name, Entry **entry) const; 45 Entry **entry = NULL) const; 47 status_t GetPreviousEntry(Entry **entry) const; 48 status_t GetNextEntry(Entry **entry) cons [all...] |
/haiku/src/add-ons/kernel/file_systems/xfs/ |
H A D | ShortDirectory.cpp | 26 ShortDirectory::GetFileType(ShortFormEntry* entry) argument 29 return entry->name[entry->namelen]; 61 ShortDirectory::GetEntryIno(ShortFormEntry* entry) argument 64 return GetIno((ShortFormInodeUnion*)(entry->name 65 + entry->namelen + sizeof(uint8))); 67 return GetIno((ShortFormInodeUnion*)(entry->name + entry->namelen)); 97 ShortFormEntry* entry = FirstEntry(); local 98 TRACE("Length of first entry 142 ShortFormEntry* entry = FirstEntry(); local [all...] |
/haiku/src/kits/package/ |
H A D | TempfileManager.cpp | 34 BEntry entry; local 35 while (fBaseDirectory.GetNextEntry(&entry) == B_OK) 36 entry.Remove(); 38 fBaseDirectory.GetEntry(&entry); 39 entry.Remove();
|
/haiku/src/add-ons/kernel/drivers/network/wlan/atheroswifi/dev/ath/ath_hal/ar5211/ |
H A D | ar5211_keycache.c | 46 * Return true if the specific key cache entry is valid. 49 ar5211IsKeyCacheEntryValid(struct ath_hal *ah, uint16_t entry) argument 51 if (entry < AR_KEYTABLE_SIZE) { 52 uint32_t val = OS_REG_READ(ah, AR_KEYTABLE_MAC1(entry)); 60 * Clear the specified key cache entry 63 ar5211ResetKeyCacheEntry(struct ath_hal *ah, uint16_t entry) argument 65 if (entry < AR_KEYTABLE_SIZE) { 66 OS_REG_WRITE(ah, AR_KEYTABLE_KEY0(entry), 0); 67 OS_REG_WRITE(ah, AR_KEYTABLE_KEY1(entry), 0); 68 OS_REG_WRITE(ah, AR_KEYTABLE_KEY2(entry), 83 ar5211SetKeyCacheEntryMac(struct ath_hal *ah, uint16_t entry, const uint8_t *mac) argument 117 ar5211SetKeyCacheEntry(struct ath_hal *ah, uint16_t entry, const HAL_KEYVAL *k, const uint8_t *mac, int xorKey) argument [all...] |
/haiku/src/add-ons/kernel/drivers/network/wlan/atheroswifi/dev/ath/ath_hal/ar5212/ |
H A D | ar5212_keycache.c | 51 * Return true if the specific key cache entry is valid. 54 ar5212IsKeyCacheEntryValid(struct ath_hal *ah, uint16_t entry) argument 56 if (entry < AH_PRIVATE(ah)->ah_caps.halKeyCacheSize) { 57 uint32_t val = OS_REG_READ(ah, AR_KEYTABLE_MAC1(entry)); 65 * Clear the specified key cache entry and any associated MIC entry. 68 ar5212ResetKeyCacheEntry(struct ath_hal *ah, uint16_t entry) argument 72 if (entry >= AH_PRIVATE(ah)->ah_caps.halKeyCacheSize) { 73 HALDEBUG(ah, HAL_DEBUG_ANY, "%s: entry %u out of range\n", 74 __func__, entry); 112 ar5212SetKeyCacheEntryMac(struct ath_hal *ah, uint16_t entry, const uint8_t *mac) argument 156 ar5212SetKeyCacheEntry(struct ath_hal *ah, uint16_t entry, const HAL_KEYVAL *k, const uint8_t *mac, int xorKey) argument [all...] |
/haiku/src/apps/text_search/ |
H A D | InitialIterator.cpp | 64 BEntry entry; local 72 if (!_GetNextEntry(entry)) 75 // If the entry is a subdir, then add it to the 77 // If the entry is a file and we can grep it 79 // here. Otherwise, continue with the next entry. 81 if (entry.GetStat(&fileStat) == B_OK) { 84 _ExamineSubdir(entry); 87 if (_ExamineFile(entry, buffer, fTextOnly)) 103 InitialIterator::GetTopEntry(BEntry& entry) argument 114 entry 152 _GetNextEntry(BEntry& entry) argument 162 _GetSubEntry(BEntry& entry) argument 182 _ExamineSubdir(BEntry& entry) argument [all...] |
/haiku/src/system/kernel/ |
H A D | TeamThreadTables.h | 48 void _SetNext(IteratorEntry* entry) argument 50 while (entry != NULL) { 51 if (entry->id >= 0) { 52 fNext = static_cast<Element*>(entry); 56 entry = entry->GetDoublyLinkedListLink()->next; 106 void InsertIteratorEntry(IteratorEntry* entry) argument 109 entry->id = -1; 110 entry->visible = false; 111 fList.Add(entry, fals 114 RemoveIteratorEntry(IteratorEntry* entry) argument 119 NextElement(IteratorEntry* entry, bool visibleOnly = true) argument [all...] |
/haiku/src/add-ons/kernel/drivers/network/wlan/atheroswifi/dev/ath/ath_hal/ar5210/ |
H A D | ar5210_keycache.c | 45 ar5210IsKeyCacheEntryValid(struct ath_hal *ah, uint16_t entry) argument 47 if (entry < AR_KEYTABLE_SIZE) { 48 uint32_t val = OS_REG_READ(ah, AR_KEYTABLE_MAC1(entry)); 56 * Clear the specified key cache entry. 59 ar5210ResetKeyCacheEntry(struct ath_hal *ah, uint16_t entry) argument 61 if (entry < AR_KEYTABLE_SIZE) { 62 OS_REG_WRITE(ah, AR_KEYTABLE_KEY0(entry), 0); 63 OS_REG_WRITE(ah, AR_KEYTABLE_KEY1(entry), 0); 64 OS_REG_WRITE(ah, AR_KEYTABLE_KEY2(entry), 0); 65 OS_REG_WRITE(ah, AR_KEYTABLE_KEY3(entry), 79 ar5210SetKeyCacheEntryMac(struct ath_hal *ah, uint16_t entry, const uint8_t *mac) argument 111 ar5210SetKeyCacheEntry(struct ath_hal *ah, uint16_t entry, const HAL_KEYVAL *k, const uint8_t *mac, int xorKey) argument [all...] |
/haiku/src/kits/debugger/model/ |
H A D | StackFrameValues.cpp | 102 ValueEntry* entry = it.Next();) { 103 if (SetValue(entry->variable, entry->path, entry->value) != B_OK) 134 ValueEntry* entry = fValues->Lookup( local 136 if (entry == NULL) 139 _value = entry->value; 156 ValueEntry* entry = fValues->Lookup(Key(variable, path)); local 157 if (entry == NULL) { 158 entry 173 ValueEntry* entry = fValues->Clear(true); local [all...] |
/haiku/src/servers/app/font/ |
H A D | FontCache.cpp | 59 BReference<FontCacheEntry> entry = fFontCacheEntries.Get(signature); local 61 if (entry) { 62 // the entry was already there 63 //printf("FontCacheEntryFor(%ld): %p\n", font.GetFamilyAndStyle(), entry); 64 return entry.Detach(); 76 // inserted a cache entry for this font. So we look again if there 77 // is an entry now, and only then create it if it's still not there, 79 entry = fFontCacheEntries.Get(signature); 81 if (!entry) { 84 entry 99 Recycle(FontCacheEntry* entry) argument 137 FontCacheEntry* entry = iterator.Next().value; local [all...] |
/haiku/src/add-ons/kernel/file_systems/btrfs/ |
H A D | AttributeIterator.cpp | 59 btrfs_dir_entry* entry = entries; 62 current += entry->Length(); 65 entry = (btrfs_dir_entry*)((uint8*)entry + entry->Length()); 69 entries_length, entry->NameLength()); 71 memcpy(name, entry + 1, entry->NameLength()); 72 name[entry->NameLength()] = '\0'; 73 *_nameLength = entry [all...] |
/haiku/src/add-ons/tracker/openterminal/ |
H A D | OpenTerminal.cpp | 35 BEntry entry; local 46 if (entry.SetTo(&tracker_ref, true) != B_OK) 49 // If the entry is a file then look for the parent directory. 50 if (!entry.IsDirectory()) { 51 if (entry.GetParent(&entry) != B_OK) 59 if (entries[x] == entry) { 69 // Push entry onto the vector so we can check for duplicates later. 70 entries.push_back(BEntry(entry)); 72 launch_terminal(entry); [all...] |