Searched refs:entry (Results 1 - 25 of 898) sorted by relevance

1234567891011>>

/haiku/src/servers/app/
H A DHashTable.cpp20 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/src/kits/debugger/dwarf/
H A DDwarfUtils.h19 static void GetDIEName(const DebugInfoEntry* entry,
21 static void GetDIETypeName(const DebugInfoEntry* entry,
23 static void GetFullDIEName(const DebugInfoEntry* entry,
26 const DebugInfoEntry* entry,
30 const DebugInfoEntry* entry,
36 static EntryType* GetDIEByPredicate(EntryType* entry,
43 DwarfUtils::GetDIEByPredicate(EntryType* entry, const Predicate& predicate) argument
45 if (predicate(entry))
46 return entry;
50 entry
[all...]
H A DDwarfUtils.cpp17 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
45 const DIEType* type = dynamic_cast<const DIEType*>(entry);
104 GetFullDIEName(const DebugInfoEntry* entry, BString& _name) argument
187 GetFullyQualifiedDIEName(const DebugInfoEntry* entry, BString& _name) argument
235 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 Dtiffinfo.cpp169 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/src/bin/bfs_tools/lib/
H A DCache.h60 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 DHashtable.cpp65 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 DRootFileSystem.cpp22 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 DTimedEventQueuePrivate.cpp58 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 DEntryCache.cpp55 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 entry
138 EntryCacheEntry* entry = fEntries.Lookup(key); local
167 EntryCacheEntry* entry = fEntries.Lookup(key); local
231 _AddEntryToCurrentGeneration(EntryCacheEntry* entry) argument
[all...]
/haiku/src/system/kernel/arch/m68k/
H A Darch_030_mmu.cpp20 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 DAbstractEmptyDirectoryJob.cpp25 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 Dar5416_keycache.c38 * 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 DImageCache.cpp94 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 DDirectory.cpp26 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 DDirectory.h22 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/servers/app/font/
H A DFontCache.cpp62 FontCacheEntry* entry = fFontCacheEntries.Get(signature); local
64 if (entry) {
65 // the entry was already there
66 entry->AcquireReference();
67 //printf("FontCacheEntryFor(%ld): %p\n", font.GetFamilyAndStyle(), entry);
68 return entry;
80 // inserted a cache entry for this font. So we look again if there
81 // is an entry now, and only then create it if it's still not there,
83 entry = fFontCacheEntries.Get(signature);
85 if (!entry) {
105 Recycle(FontCacheEntry* entry) argument
143 FontCacheEntry* entry = iterator.Next().value; local
[all...]
/haiku/src/kits/package/
H A DTempfileManager.cpp34 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 Dar5211_keycache.c46 * 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 Dar5212_keycache.c51 * 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 DInitialIterator.cpp64 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 DTeamThreadTables.h48 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 Dar5210_keycache.c45 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 DStackFrameValues.cpp102 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/add-ons/kernel/file_systems/btrfs/
H A DAttributeIterator.cpp59 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/system/kernel/arch/arm/paging/32bit/
H A DARMPagingMethod32Bit.h52 page_directory_entry* entry,
56 page_table_entry* entry,
60 static page_table_entry SetPageTableEntry(page_table_entry* entry,
62 static page_table_entry SetPageTableEntryFlags(page_table_entry* entry,
65 page_table_entry* entry,
68 static page_table_entry ClearPageTableEntry(page_table_entry* entry);
70 page_table_entry* entry, uint32 flags);
105 ARMPagingMethod32Bit::SetPageTableEntry(page_table_entry* entry, argument
108 return atomic_get_and_set((int32*)entry, newEntry);
113 ARMPagingMethod32Bit::SetPageTableEntryFlags(page_table_entry* entry, argument
121 TestAndSetPageTableEntry(page_table_entry* entry, page_table_entry newEntry, page_table_entry oldEntry) argument
129 ClearPageTableEntry(page_table_entry* entry) argument
136 ClearPageTableEntryFlags(page_table_entry* entry, uint32 flags) argument
[all...]

Completed in 125 milliseconds

1234567891011>>