/haiku-fatelf/src/servers/app/ |
H A D | HashTable.cpp | 20 struct HashTable::entry { struct in class:HashTable 21 entry* next; 56 struct entry *entry, *next; local 58 for (entry = fTable[index]; entry != NULL; entry = next) { 59 next = entry->next; 62 delete entry->value; 63 delete entry; 75 struct entry* entry = _GetHashEntry(key); local 84 struct entry *entry = _GetHashEntry(*value); local 113 struct entry* entry; local 166 struct entry* entry; local 192 struct entry* entry; local [all...] |
/haiku-fatelf/src/tools/translation/tiffinfo/ |
H A D | tiffinfo.cpp | 169 print_ifd_value(IFDEntry &entry, BFile &file, swap_action swp) argument 171 switch (entry.tag) { 173 if (entry.count == 1 && entry.fieldType == TIFF_LONG) { 174 if (entry.longval & 1) 176 if (entry.longval & 2) 178 if (entry.longval & 4) 181 printf("(0x%.8lx)", entry.longval); 188 if (entry.count == 1) { 190 ((entry 405 swap_value_field(IFDEntry &entry, swap_action swp) argument 453 IFDEntry entry; local [all...] |
/haiku-fatelf/src/bin/bfs_tools/lib/ |
H A D | Cache.h | 59 Cacheable *entry = fLeastRecentlyUsed; local 60 while (entry) 62 Cacheable *prev = entry->prev; 63 if (entry->locked <= 0 || force) 65 if (entry->next) 66 entry->next->prev = prev; 68 prev->next = entry->next; 70 if (fLeastRecentlyUsed == entry) 72 if (fMostRecentlyUsed == entry) 75 delete entry; 94 Cacheable *entry = Get(data); local 104 Cacheable *entry = Get(data); local 114 Cacheable *entry = Get(data); local 124 Cacheable *entry = GetFromCache(data); local 176 Cacheable *entry = fMostRecentlyUsed; local [all...] |
H A D | Hashtable.cpp | 64 struct Entry *entry,*next; local 66 for(entry = table[index];entry;entry = next) 68 next = entry->next; 69 delete entry; 102 Entry *entry = GetHashEntry(key); local 104 return entry ? entry->value : NULL; 110 Entry *entry local 132 Entry **table,*entry,*prev; local 200 Entry *entry, *next; local 259 Entry *oldEntry,*entry = NULL; local 278 Entry **table,*entry; local [all...] |
/haiku-fatelf/src/system/boot/loader/ |
H A D | RootFileSystem.cpp | 23 struct entry *entry = NULL; local 25 while ((entry = fList.RemoveHead()) != NULL) { 26 entry->root->Release(); 27 delete entry; 57 struct entry *entry; local 61 while ((entry = iterator.Next()) != NULL) { 62 if (!strcmp(name, entry->name)) { 63 entry 91 struct entry *entry; local 105 struct entry *entry; local 136 struct entry *entry = new (std::nothrow) RootFileSystem::entry(); local 154 struct entry *entry = new (std::nothrow) RootFileSystem::entry(); local 172 struct entry *entry; local [all...] |
/haiku-fatelf/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; 120 for (event_queue_entry *entry = fLastEntry; entry; entry = entry 229 event_queue_entry *entry; local 289 event_queue_entry *entry; local 422 event_queue_entry *entry; local 509 RemoveEntry(event_queue_entry *entry) argument 588 event_queue_entry *entry; local 604 event_queue_entry *entry; local [all...] |
/haiku-fatelf/src/apps/debugger/dwarf/ |
H A D | DwarfUtils.h | 18 static void GetDIEName(const DebugInfoEntry* entry, 20 static void GetFullDIEName(const DebugInfoEntry* entry, 23 const DebugInfoEntry* entry, 27 const DebugInfoEntry* entry, 33 static EntryType* GetDIEByPredicate(EntryType* entry, 40 DwarfUtils::GetDIEByPredicate(EntryType* entry, const Predicate& predicate) argument 42 if (predicate(entry)) 43 return entry; 47 entry->AbstractOrigin())) { 48 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::GetFullDIEName(const DebugInfoEntry* entry, BString& _name) argument 48 const char* name = entry 167 GetFullyQualifiedDIEName(const DebugInfoEntry* entry, BString& _name) argument 215 GetDeclarationLocation(DwarfFile* dwarfFile, const DebugInfoEntry* entry, const char*& _directory, const char*& _file, int32& _line, int32& _column) argument [all...] |
/haiku-fatelf/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-fatelf/src/system/kernel/fs/ |
H A D | EntryCache.cpp | 55 rw_lock_init(&fLock, "entry cache"); 64 EntryCacheEntry* entry = fEntries.Clear(true); local 65 while (entry != NULL) { 66 EntryCacheEntry* next = entry->hash_link; 67 free(entry); 68 entry = next; 99 EntryCacheEntry* entry = fEntries.Lookup(key); local 100 if (entry != NULL) { 101 entry->node_id = nodeID; 102 if (entry 136 EntryCacheEntry* entry = fEntries.Lookup(key); local 164 EntryCacheEntry* entry = fEntries.Lookup(key); local 224 _AddEntryToCurrentGeneration(EntryCacheEntry* entry) argument [all...] |
/haiku-fatelf/src/system/kernel/cache/ |
H A D | BlockMap.cpp | 14 * mappings; that value cannot be stored. At the current size, each hash entry can 64 BlockMap::block_entry *entry = (BlockMap::block_entry *)_entry; local 67 return entry->offset - *offset; 74 BlockMap::block_entry *entry = (BlockMap::block_entry *)_entry; local 77 if (entry != NULL) 78 return entry->offset % range; 132 * The offset must have been normalized to the base offset values of a block entry 139 block_entry *entry = (block_entry *)hash_lookup(fHashTable, &baseOffset); local 140 if (entry == NULL) 143 *_entry = entry; 155 block_entry *entry; local 193 block_entry *entry; local 231 block_entry *entry; local [all...] |
/haiku-fatelf/src/add-ons/kernel/drivers/network/wlan/atheroswifi/dev/ath/ath_hal/ar5416/ |
H A D | ar5416_keycache.c | 36 * Clear the specified key cache entry and any associated MIC entry. 39 ar5416ResetKeyCacheEntry(struct ath_hal *ah, uint16_t entry) argument 43 if (ar5212ResetKeyCacheEntry(ah, entry)) { 44 ahp->ah_keytype[entry] = keyType[HAL_CIPHER_CLR]; 51 * Sets the contents of the specified key cache entry 52 * and any associated MIC entry. 55 ar5416SetKeyCacheEntry(struct ath_hal *ah, uint16_t entry, argument 61 if (ar5212SetKeyCacheEntry(ah, entry, k, mac, xorKey)) { 62 ahp->ah_keytype[entry] [all...] |
/haiku-fatelf/src/add-ons/kernel/file_systems/ramfs/ |
H A D | Directory.cpp | 23 while (Entry *entry = fEntries.First()) { 24 if (DeleteEntry(entry) != B_OK) { 33 Directory::Link(Entry *entry) argument 36 return Node::Link(entry); 42 Directory::Unlink(Entry *entry) argument 44 if (entry == fReferrers.First()) 45 return Node::Unlink(entry); 67 Entry *entry = fReferrers.First(); local 68 return (entry ? entry 131 AddEntry(Entry *entry) argument 155 Entry *entry = new(nothrow) Entry(name); local 184 RemoveEntry(Entry *entry) argument 226 DeleteEntry(Entry *entry) argument 268 Entry *entry = NULL; local 279 Entry *entry = NULL; local 331 Entry *entry = NULL; local [all...] |
/haiku-fatelf/src/apps/showimage/ |
H A D | ImageCache.cpp | 97 CacheEntry* entry = find->second; local 99 // Requeue cache entry to the end of the by-age list 100 TRACE("requeue trace entry %s\n", ref.name); 101 fCacheEntriesByAge.Remove(entry); 102 fCacheEntriesByAge.Add(entry); 105 _NotifyTarget(entry, target); 110 QueueEntry* entry; local 119 TRACE("ignore entry %s\n", ref.name); 125 // Push new entry to the queue 126 entry 177 QueueEntry* entry = *self->fQueue.begin(); local 203 CacheEntry* entry = new(std::nothrow) CacheEntry(); local 306 _NotifyListeners(CacheEntry* entry, QueueEntry* queueEntry) argument 330 _NotifyTarget(CacheEntry* entry, const BMessenger* target) argument 346 _BuildNotification(CacheEntry* entry, BMessage& message) argument [all...] |
/haiku-fatelf/src/tests/add-ons/kernel/file_systems/userlandfs/r5/src/test/ramfs/ |
H A D | Directory.cpp | 25 while (Entry *entry = fEntries.First()) { 26 if (DeleteEntry(entry) != B_OK) { 35 Directory::Link(Entry *entry) argument 38 return Node::Link(entry); 44 Directory::Unlink(Entry *entry) argument 46 if (entry == fReferrers.First()) 47 return Node::Unlink(entry); 69 Entry *entry = fReferrers.First(); local 70 return (entry ? entry 133 AddEntry(Entry *entry) argument 157 Entry *entry = new(std::nothrow) Entry(name); local 186 RemoveEntry(Entry *entry) argument 228 DeleteEntry(Entry *entry) argument 270 Entry *entry = NULL; local 281 Entry *entry = NULL; local 333 Entry *entry = NULL; local [all...] |
/haiku-fatelf/src/bin/gdb/gdb/ |
H A D | frame-unwind.c | 66 /* Find the end of the list and insert the new entry there. */ 77 struct frame_unwind_table_entry *entry; local 79 /* Insert the new entry at the start of the list. */ 80 entry = GDBARCH_OBSTACK_ZALLOC (gdbarch, struct frame_unwind_table_entry); 81 entry->unwinder = unwinder; 82 entry->next = (*table->osabi_head); 83 (*table->osabi_head) = entry; 92 struct frame_unwind_table_entry *entry; local 93 for (entry = table->list; entry ! [all...] |
/haiku-fatelf/src/add-ons/kernel/drivers/graphics/common/ |
H A D | log_dump.c | 21 // dump one entry 22 static void log_printentry( FILE *logfile, log_entry *entry ) 27 time = entry->tsc / (sysinfo.cpu_clock_speed / 1000000); 37 if( entry->what < sizeof( log_names ) / sizeof( log_names[0] ) ) 38 fprintf( logfile, log_names[entry->what] ); 40 fprintf( logfile, "unknown %ld", (uint32)entry->what ); 42 if( entry->num_args > 0 ) { 46 for( i = 0; i < entry->num_args; ++i ) { 50 fprintf( logfile, "0x%08lx", entry->args[i] ); 67 log_entry *entry; local [all...] |
/haiku-fatelf/src/servers/app/font/ |
H A D | FontCache.cpp | 61 FontCacheEntry* entry = fFontCacheEntries.Get(signature); local 63 if (entry) { 64 // the entry was already there 65 entry->AcquireReference(); 66 //printf("FontCacheEntryFor(%ld): %p\n", font.GetFamilyAndStyle(), entry); 67 return entry; 79 // inserted a cache entry for this font. So we look again if there 80 // is an entry now, and only then create it if it's still not there, 82 entry = fFontCacheEntries.Get(signature); 84 if (!entry) { 104 Recycle(FontCacheEntry* entry) argument 142 FontCacheEntry* entry = iterator.Next().value; local [all...] |
/haiku-fatelf/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-fatelf/src/add-ons/kernel/drivers/network/wlan/atheroswifi/dev/ath/ath_hal/ar5211/ |
H A D | ar5211_keycache.c | 44 * Return true if the specific key cache entry is valid. 47 ar5211IsKeyCacheEntryValid(struct ath_hal *ah, uint16_t entry) argument 49 if (entry < AR_KEYTABLE_SIZE) { 50 uint32_t val = OS_REG_READ(ah, AR_KEYTABLE_MAC1(entry)); 58 * Clear the specified key cache entry 61 ar5211ResetKeyCacheEntry(struct ath_hal *ah, uint16_t entry) argument 63 if (entry < AR_KEYTABLE_SIZE) { 64 OS_REG_WRITE(ah, AR_KEYTABLE_KEY0(entry), 0); 65 OS_REG_WRITE(ah, AR_KEYTABLE_KEY1(entry), 0); 66 OS_REG_WRITE(ah, AR_KEYTABLE_KEY2(entry), 81 ar5211SetKeyCacheEntryMac(struct ath_hal *ah, uint16_t entry, const uint8_t *mac) argument 115 ar5211SetKeyCacheEntry(struct ath_hal *ah, uint16_t entry, const HAL_KEYVAL *k, const uint8_t *mac, int xorKey) argument [all...] |
/haiku-fatelf/src/tests/add-ons/kernel/file_systems/bfs/r5/ |
H A D | Chain.h | 32 Link *last = NULL,*entry; local 33 for (entry = fFirst;link != entry;entry = entry->fNext) 34 last = entry; 35 if (link == entry) {
|
/haiku-fatelf/src/add-ons/kernel/drivers/network/wlan/atheroswifi/dev/ath/ath_hal/ar5212/ |
H A D | ar5212_keycache.c | 49 * Return true if the specific key cache entry is valid. 52 ar5212IsKeyCacheEntryValid(struct ath_hal *ah, uint16_t entry) argument 54 if (entry < AH_PRIVATE(ah)->ah_caps.halKeyCacheSize) { 55 uint32_t val = OS_REG_READ(ah, AR_KEYTABLE_MAC1(entry)); 63 * Clear the specified key cache entry and any associated MIC entry. 66 ar5212ResetKeyCacheEntry(struct ath_hal *ah, uint16_t entry) argument 70 if (entry >= AH_PRIVATE(ah)->ah_caps.halKeyCacheSize) { 71 HALDEBUG(ah, HAL_DEBUG_ANY, "%s: entry %u out of range\n", 72 __func__, entry); 110 ar5212SetKeyCacheEntryMac(struct ath_hal *ah, uint16_t entry, const uint8_t *mac) argument 154 ar5212SetKeyCacheEntry(struct ath_hal *ah, uint16_t entry, const HAL_KEYVAL *k, const uint8_t *mac, int xorKey) argument [all...] |
/haiku-fatelf/src/apps/text_search/ |
H A D | InitialIterator.cpp | 81 BEntry entry; local 89 if (!_GetNextEntry(entry)) 92 // If the entry is a subdir, then add it to the 94 // If the entry is a file and we can grep it 96 // here. Otherwise, continue with the next entry. 98 if (entry.GetStat(&fileStat) == B_OK) { 101 _ExamineSubdir(entry); 104 if (_ExamineFile(entry, buffer, fTextOnly)) 120 InitialIterator::GetTopEntry(BEntry& entry) argument 131 entry 169 _GetNextEntry(BEntry& entry) argument 179 _GetSubEntry(BEntry& entry) argument 199 _ExamineSubdir(BEntry& entry) argument [all...] |
/haiku-fatelf/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-fatelf/src/add-ons/kernel/drivers/network/wlan/atheroswifi/dev/ath/ath_hal/ar5210/ |
H A D | ar5210_keycache.c | 43 ar5210IsKeyCacheEntryValid(struct ath_hal *ah, uint16_t entry) argument 45 if (entry < AR_KEYTABLE_SIZE) { 46 uint32_t val = OS_REG_READ(ah, AR_KEYTABLE_MAC1(entry)); 54 * Clear the specified key cache entry. 57 ar5210ResetKeyCacheEntry(struct ath_hal *ah, uint16_t entry) argument 59 if (entry < AR_KEYTABLE_SIZE) { 60 OS_REG_WRITE(ah, AR_KEYTABLE_KEY0(entry), 0); 61 OS_REG_WRITE(ah, AR_KEYTABLE_KEY1(entry), 0); 62 OS_REG_WRITE(ah, AR_KEYTABLE_KEY2(entry), 0); 63 OS_REG_WRITE(ah, AR_KEYTABLE_KEY3(entry), 77 ar5210SetKeyCacheEntryMac(struct ath_hal *ah, uint16_t entry, const uint8_t *mac) argument 109 ar5210SetKeyCacheEntry(struct ath_hal *ah, uint16_t entry, const HAL_KEYVAL *k, const uint8_t *mac, int xorKey) argument [all...] |