Searched refs:entry (Results 26 - 50 of 922) sorted by relevance

1234567891011>>

/haiku/src/apps/cortex/ParameterView/
H A DParameterWindowManager.cpp128 window_map_entry *entry = static_cast<window_map_entry *> local
130 if (entry && entry->window) {
131 remove_observer(this, entry->ref);
132 entry->window->Lock();
133 entry->window->Quit();
135 m_windowList->RemoveItem(reinterpret_cast<void *>(entry));
136 delete entry;
141 panel_map_entry *entry = static_cast<panel_map_entry *> local
143 if (entry
318 window_map_entry *entry = new window_map_entry(ref, local
334 window_map_entry *entry = static_cast<window_map_entry *> local
350 window_map_entry *entry = static_cast<window_map_entry *> local
364 panel_map_entry *entry = static_cast<panel_map_entry *> local
388 panel_map_entry *entry = new panel_map_entry(id, local
403 panel_map_entry *entry = static_cast<panel_map_entry *> local
419 panel_map_entry *entry = static_cast<panel_map_entry *> local
[all...]
/haiku/src/add-ons/kernel/file_systems/exfat/
H A DUtility.cpp25 get_volume_name(struct exfat_entry* entry, char* name, size_t length) argument
27 if (entry == NULL || name == NULL)
30 if (entry->type == EXFAT_ENTRY_TYPE_NOT_IN_USE)
32 else if (entry->type == EXFAT_ENTRY_TYPE_LABEL) {
33 ssize_t utf8Length = utf16le_to_utf8(entry->volume_label.name,
34 entry->volume_label.length, name, length);
/haiku/src/tests/system/kernel/unit/
H A DTestContext.cpp70 ThreadEntry** entry = &sGlobalThreads; local
71 while (*entry != NULL) {
72 if ((*entry)->context == this)
73 *entry = (*entry)->globalNext;
75 entry = &(*entry)->globalNext;
87 ThreadEntry* entry = sGlobalThreads; local
88 while (entry != NULL) {
89 if (entry
134 _SetCurrent(ThreadEntry* entry) argument
152 ThreadEntry** entry = &sGlobalThreads; local
[all...]
/haiku/src/add-ons/kernel/file_systems/ramfs/
H A DNameIndex.cpp18 NameIndexPrimaryKey(const Entry *entry, argument
20 : entry(entry), name(name ? name : entry->GetName()) {}
22 : entry(NULL), name(name) {}
24 const Entry *entry; member in class:NameIndexPrimaryKey
50 if (a.entry != NULL && a.entry == b.entry)
83 virtual void EntryRemoved(Entry *entry);
135 Changed(Entry *entry, const char *oldName) argument
155 EntryAdded(Entry *entry) argument
167 EntryRemoved(Entry *entry) argument
222 _UpdateLiveQueries(Entry* entry, const char* oldName, const char* newName) argument
260 Entry *entry = GetCurrent(); local
[all...]
H A DEntryListener.h23 virtual void EntryAdded(Entry *entry);
24 virtual void EntryRemoved(Entry *entry);
/haiku/3rdparty/kallisti5/
H A DlicenseReport.rb27 @licenses.each do |entry|
28 entry.values.first.each do |pattern|
30 license = entry.keys.first
/haiku/headers/private/kernel/
H A DAllocationTracking.h23 void Init(AbstractTraceEntryWithStackTrace* entry) argument
25 traceEntry = entry;
26 traceEntryTimestamp = entry != NULL ? entry->Time() : -1;
28 // got overwritten once, we would access an invalid trace entry
/haiku/src/tools/fs_shell/
H A Dpath_util.h16 char* make_path(const char *dir, const char *entry);
/haiku/src/kits/debugger/dwarf/
H A DTypeUnit.cpp32 TypeUnit::SetUnitEntry(DIETypeUnit* entry) argument
34 fUnitEntry = entry;
46 TypeUnit::SetTypeEntry(DebugInfoEntry* entry) argument
48 fTypeEntry = entry;
H A DAbbreviationTable.cpp24 AbbreviationTableEntry* entry = fEntryTable.Clear(true); local
25 while (entry != NULL) {
26 AbbreviationTableEntry* next = entry->next;
27 delete entry;
28 entry = next;
67 AbbreviationTable::GetAbbreviationEntry(uint32 code, AbbreviationEntry& entry) argument
73 entry.SetTo(code, fData + tableEntry->offset, tableEntry->size);
97 // printf("entry: %" B_PRIu32 ", tag: %" B_PRIu32 ", children: %d\n", code, tag,
119 // create the entry
121 AbbreviationTableEntry* entry local
[all...]
/haiku/src/kits/tracker/
H A DIconCache.cpp136 // clean up a bit to leave the hash table entry in an initialized state
148 const SharedCacheEntry* entry)
150 sharedCache->SetAliasFor(this, entry);
164 IconCacheEntry* entry)
166 if (entry == NULL)
169 return sharedCache->ResolveIfAlias(entry);
349 LazyBitmapAllocator* lazyBitmap, IconCacheEntry* entry)
356 if (entry == NULL) {
357 entry = fSharedCache.FindItem(fileTypeSignature, preferredApp);
358 if (entry !
147 SetAliasFor(const SharedIconCache* sharedCache, const SharedCacheEntry* entry) argument
163 ResolveIfAlias(const SharedIconCache* sharedCache, IconCacheEntry* entry) argument
347 GetIconForPreferredApp(const char* fileTypeSignature, const char* preferredApp, IconDrawMode mode, BSize size, LazyBitmapAllocator* lazyBitmap, IconCacheEntry* entry) argument
404 GetIconFromMetaMime(const char* fileType, IconDrawMode mode, BSize size, LazyBitmapAllocator* lazyBitmap, IconCacheEntry* entry) argument
487 GetIconFromFileTypes(ModelNodeLazyOpener* modelOpener, IconSource &source, IconDrawMode mode, BSize size, LazyBitmapAllocator* lazyBitmap, IconCacheEntry* entry) argument
585 IconCacheEntry* entry = 0; local
690 IconCacheEntry* entry = fSharedCache.FindItem(type.String()); local
784 GetNodeIcon(ModelNodeLazyOpener* modelOpener, AutoLock<SimpleIconCache>* nodeCacheLocker, AutoLock<SimpleIconCache>** resultingOpenCache, Model* model, IconSource& source, IconDrawMode mode, BSize size, LazyBitmapAllocator* lazyBitmap, IconCacheEntry* entry, bool permanent) argument
849 GetGenericIcon(AutoLock<SimpleIconCache>* sharedCacheLocker, AutoLock<SimpleIconCache>** resultingOpenCache, Model* model, IconSource &source, IconDrawMode mode, BSize size, LazyBitmapAllocator* lazyBitmap, IconCacheEntry* entry) argument
881 GetFallbackIcon(AutoLock<SimpleIconCache>* sharedCacheLocker, AutoLock<SimpleIconCache>** resultingOpenCache, Model* model, IconDrawMode mode, BSize size, LazyBitmapAllocator* lazyBitmap, IconCacheEntry* entry) argument
915 IconCacheEntry* entry = NULL; local
1108 IconCacheEntry* entry = Preload(&nodeCacheLocker, &sharedCacheLocker, local
1137 IconCacheEntry* entry = Preload(&nodeCacheLocker, &sharedCacheLocker, local
1244 SharedCacheEntry* entry = fSharedCache.FindItem(mimeType, appSignature); local
1381 IconCacheEntry* entry = Preload(&nodeCacheLocker, &sharedCacheLocker, local
1436 Draw(IconCacheEntry* entry, BView* view, BPoint where, IconDrawMode mode, BSize size, bool async) argument
1444 Draw(IconCacheEntry* entry, BView* view, BPoint where, IconDrawMode mode, BSize size, void (*blitFunc)(BView*, BPoint, BBitmap*, void*), void* passThruState) argument
1473 SharedCacheEntry* entry = new SharedCacheEntry(fileType, appSignature); local
1483 IconChanged(SharedCacheEntry* entry) argument
1498 SharedCacheEntry* entry = it.Next(); local
1506 SetAliasFor(IconCacheEntry* entry, const SharedCacheEntry* original) const argument
1706 Draw(IconCacheEntry* entry, BView* view, BPoint where, IconDrawMode mode, BSize size, bool async) argument
1714 Draw(IconCacheEntry* entry, BView* view, BPoint where, IconDrawMode mode, BSize size, void (*blitFunc)(BView*, BPoint, BBitmap*, void*), void* passThruState) argument
1733 NodeCacheEntry* entry = new NodeCacheEntry(node, permanent); local
1745 NodeCacheEntry* entry = FindItem(node); local
1756 NodeCacheEntry* entry = FindItem(node); local
1786 NodeCacheEntry* entry = it.Next(); local
[all...]
/haiku/src/kits/debugger/debug_managers/
H A DTeamMemoryBlockManager.cpp126 MemoryBlockEntry* entry = fActiveBlocks->Lookup(address); local
127 if (entry != NULL) {
128 if (entry->block->AcquireReference() != 0)
129 return entry->block;
147 entry = new(std::nothrow) MemoryBlockEntry(block);
148 if (entry == NULL)
153 fActiveBlocks->Insert(entry);
155 return entry->block;
163 MemoryBlockEntry* entry = fActiveBlocks->Clear(true); local
165 while (entry !
180 MemoryBlockEntry* entry = fActiveBlocks->Lookup(address); local
193 MemoryBlockEntry* entry = fActiveBlocks->Lookup(address); local
[all...]
/haiku/src/apps/cortex/InfoView/
H A DInfoWindowManager.cpp215 live_node_window *entry = static_cast<live_node_window *> local
217 if (entry && entry->window) {
218 remove_observer(this, entry->ref);
219 BMessenger messenger(0, entry->window);
222 m_liveNodeWindows->RemoveItem(reinterpret_cast<void *>(entry));
223 delete entry;
231 dormant_node_window *entry = static_cast<dormant_node_window *> local
233 if (entry && entry
246 connection_window *entry = static_cast<connection_window *> local
261 input_window *entry = static_cast<input_window *> local
276 output_window *entry = static_cast<output_window *> local
646 live_node_window *entry = new live_node_window(ref, window); local
665 live_node_window *entry = static_cast<live_node_window *> local
685 live_node_window *entry = static_cast<live_node_window *> local
709 dormant_node_window *entry = new dormant_node_window(info, window); local
723 dormant_node_window *entry = static_cast<dormant_node_window *> local
744 dormant_node_window *entry = static_cast<dormant_node_window *> local
768 connection_window *entry = new connection_window(connection.source(), local
785 connection_window *entry = static_cast<connection_window *> local
807 connection_window *entry = static_cast<connection_window *> local
831 input_window *entry = new input_window(input.destination, window); local
845 input_window *entry = static_cast<input_window *> local
865 input_window *entry = static_cast<input_window *> local
888 output_window *entry = new output_window(output.source, window); local
902 output_window *entry = static_cast<output_window *> local
922 output_window *entry = static_cast<output_window *> local
[all...]
/haiku/src/servers/input/
H A DPathList.cpp74 path_entry* entry = new(std::nothrow) path_entry(path); local
75 if (entry == NULL || entry->path == NULL || !fPaths.AddItem(entry)) {
76 delete entry;
108 path_entry* entry = fPaths.ItemAt(index); local
109 if (entry == NULL)
112 return entry->path;
/haiku/src/system/kernel/locks/
H A Duser_mutex.cpp75 static const char* kUserMutexEntryType = "umtx entry";
182 UserMutexEntry* entry = (UserMutexEntry*)variable->Object();
184 const bool physical = (sSharedUserMutexContext.table.Lookup(entry->address) == entry);
185 kprintf("user mutex entry %p\n", entry);
186 kprintf(" address: 0x%" B_PRIxPHYSADDR " (%s)\n", entry->address,
188 kprintf(" refcount: %" B_PRId32 "\n", entry->ref_count);
189 kprintf(" lock: %p\n", &entry->lock);
195 (void*)entry
[all...]
/haiku/src/apps/text_search/
H A DInitialIterator.h36 // Looks for the next entry in the top-level dir.
37 bool GetTopEntry(BEntry& entry);
40 bool FollowSubdir(BEntry& entry) const;
43 // Looks for the next entry.
44 bool _GetNextEntry(BEntry& entry);
46 // Looks for the next entry in a subdir.
47 bool _GetSubEntry(BEntry& entry);
50 void _ExamineSubdir(BEntry& entry);
/haiku/src/bin/package/
H A DPackageWritingUtils.cpp32 while (dirent* entry = readdir(dir.Get())) {
34 if (strcmp(entry->d_name, ".") == 0 || strcmp(entry->d_name, "..") == 0)
39 && strcmp(entry->d_name,
44 status_t error = packageWriter.AddEntry(entry->d_name);
/haiku/src/add-ons/kernel/network/datalink_protocols/arp/
H A Darp.cpp187 get_request_buffer(arp_entry* entry) argument
189 net_buffer* buffer = entry->request_buffer;
193 buffer = atomic_pointer_test_and_set(&entry->request_buffer,
203 put_request_buffer(arp_entry* entry, net_buffer* buffer) argument
206 &entry->request_buffer, buffer, (net_buffer*)NULL);
215 delete_request_buffer(arp_entry* entry) argument
217 net_buffer* buffer = atomic_pointer_get_and_set(&entry->request_buffer,
264 arp_entry *entry = new (std::nothrow) arp_entry; local
265 if (entry == NULL)
268 entry
384 arp_entry *entry = arp_entry::Lookup(protocolAddress); local
462 arp_entry* entry; local
488 arp_entry* entry = arp_entry::Lookup(inetAddress); local
581 arp_entry *entry = arp_entry::Lookup(header.protocol_target); local
686 arp_entry *entry = (arp_entry *)data; local
775 arp_entry *entry = arp_entry::Add(address, NULL, 0); local
870 arp_entry *entry = arp_entry::Lookup(control.address); local
888 arp_entry *entry = NULL; local
909 arp_entry *entry = arp_entry::Lookup(control.address); local
923 arp_entry *entry; local
1035 arp_entry *entry = arp_entry::Lookup( local
[all...]
/haiku/src/kits/storage/
H A DResourceStrings.cpp117 if (_string_id_hash *entry = _FindString(id))
118 result = entry->data;
181 _string_id_hash *entry = NULL; local
183 entry = _AddString(NULL, id, false);
185 entry = _AddString((char*)data, id, false);
186 if (!entry)
255 while (_string_id_hash *entry = fHashTable[i]) {
256 fHashTable[i] = entry->next;
257 delete entry;
284 while (_string_id_hash *entry
314 _string_id_hash *entry = NULL; local
336 _string_id_hash *entry = NULL; local
[all...]
/haiku/src/add-ons/kernel/file_systems/netfs/client/
H A DVirtualDir.cpp168 while (VirtualDirEntry* entry = GetFirstEntry())
169 RemoveEntry(entry->GetName());
207 // create an entry
208 VirtualDirEntry* entry = new(std::nothrow) VirtualDirEntry;
209 if (!entry)
211 ObjectDeleter<VirtualDirEntry> entryDeleter(entry);
212 status_t error = entry->SetTo(name, child);
216 // add the entry
217 error = fEntries.Put(name, entry);
220 fEntryList.Insert(entry);
239 VirtualDirEntry* entry = fEntries.Remove(name); local
[all...]
H A DShareNode.cpp137 ShareNode::AddReferringEntry(ShareDirEntry* entry) argument
139 if (entry)
140 fReferringEntries.Insert(entry);
145 ShareNode::RemoveReferringEntry(ShareDirEntry* entry) argument
147 if (entry)
148 fReferringEntries.Remove(entry);
160 ShareNode::GetNextReferringEntry(ShareDirEntry* entry) const
162 return (entry ? fReferringEntries.GetNext(entry) : NULL);
169 for (ShareDirEntry* entry
356 AddEntry(ShareDirEntry* entry) argument
459 AddEntry(ShareDirEntry* entry) argument
467 RemoveEntry(ShareDirEntry* entry) argument
[all...]
/haiku/src/add-ons/kernel/file_systems/nfs4/
H A DCookie.cpp93 RequestEntry* entry = new RequestEntry; local
94 if (entry == NULL)
98 entry->fRequest = request;
99 entry->fNext = fRequests;
100 fRequests = entry;
112 RequestEntry* entry = fRequests; local
114 while (entry != NULL) {
115 if (entry->fRequest == request) {
117 fRequests = entry->fNext;
119 previous->fNext = entry
138 RequestEntry* entry = fRequests; local
[all...]
/haiku/src/kits/debugger/model/
H A DExpressionValues.cpp110 ValueEntry* entry = it.Next();) {
111 if (SetValue(entry->function, entry->thread, entry->expression,
112 entry->value) != B_OK) {
144 ValueEntry* entry = fValues->Lookup(Key(function, thread, *expression)); local
145 if (entry == NULL)
148 _value = entry->value;
165 ValueEntry* entry = fValues->Lookup(Key(function, thread, expression)); local
166 if (entry
182 ValueEntry* entry = fValues->Clear(true); local
[all...]
/haiku/src/tests/system/kernel/util/
H A DBOpenHashTableTest.cpp52 size_t Hash(Entry* entry) const
54 return entry->fValue;
57 bool Compare(const KeyType& key, Entry* entry) const
59 return key == entry->fValue;
62 Entry*& GetLink(Entry* entry) const
64 return entry->fNext;
130 Entry entry(123);
135 CPPUNIT_ASSERT_EQUAL(table.Insert(&entry), B_OK);
141 Entry entry(123);
146 table.InsertUnchecked(&entry);
170 Entry* entry = new Entry(i); local
179 Entry* entry = iterator.Next(); local
202 Entry* entry = new Entry(i); local
212 Entry* entry = iterator.Next(); local
350 Entry* entry = new Entry(i); local
375 Entry* entry = new Entry(i); local
[all...]
/haiku/src/system/boot/platform/efi/arch/generic/
H A Dgeneric_mmu.cpp23 efi_memory_descriptor* entry = (efi_memory_descriptor *)(addr + i * descriptorSize); local
24 switch (entry->Type) {
30 uint64_t base = entry->PhysicalStart;
31 uint64_t end = entry->PhysicalStart + entry->NumberOfPages * B_PAGE_SIZE;
55 efi_memory_descriptor* entry = (efi_memory_descriptor *)(addr + i * descriptorSize); local
56 switch (entry->Type) {
64 uint64_t base = entry->PhysicalStart;
65 uint64_t size = entry->NumberOfPages * B_PAGE_SIZE;
86 efi_memory_descriptor* entry local
[all...]

Completed in 205 milliseconds

1234567891011>>