Searched refs:previous (Results 1 - 25 of 119) sorted by path

12345

/haiku/headers/cpp/
H A Dstl_slist.h449 iterator previous(const_iterator __pos) { function in class:slist
452 const_iterator previous(const_iterator __pos) const { function in class:slist
/haiku/headers/private/kernel/util/
H A DMultiHashTable.h138 ValueType *previous; local
141 for (previous = table[index]; previous
142 && !HashTable::fDefinition.CompareValues(previous, value);
143 previous = HashTable::_Link(previous));
145 if (previous) {
146 HashTable::_Link(value) = HashTable::_Link(previous);
147 HashTable::_Link(previous) = value;
H A DSinglyLinkedList.h149 inline void Remove(Element* previous, Element* element);
226 SINGLY_LINKED_LIST_CLASS_NAME::Remove(Element* previous, Element* element) argument
228 // ASSERT(previous == NULL
229 // ? fFirst == element : sGetLink(previous)->next == element);
232 if (previous == NULL)
235 sGetLink(previous)->next = elementLink->next;
H A DSplayTree.h503 if (Node* previous = fTree.PreviousDontSplay(Definition::GetKey(node)))
504 previousNext = Definition::GetListLink(previous);
521 if (Node* previous = fTree.PreviousDontSplay(key))
522 previousNext = Definition::GetListLink(previous);
537 if (Node* previous = fTree.PreviousDontSplay(Definition::GetKey(node)))
538 previousNext = Definition::GetListLink(previous);
/haiku/headers/private/net/
H A Dr5_compatibility.h57 struct stack_frame* previous;
/haiku/src/add-ons/kernel/bluetooth/hci/
H A Dbluetooth.cpp288 || device->GetDoublyLinkedListLink()->previous != NULL
/haiku/src/add-ons/kernel/file_systems/netfs/headers/shared/
H A DSLList.h173 inline void InsertAfter(Element *previous, Element *element);
198 inline void _Remove(Element *previous, Element *element);
226 SL_LIST_CLASS_NAME::InsertAfter(Element *previous, Element *element) argument
230 if (previous) {
231 // insert after previous element
232 Link *prevLink = fGetLink(previous);
236 // no previous element given: prepend
242 if (fLast == previous)
307 SL_LIST_CLASS_NAME::_Remove(Element *previous, Element *element) argument
310 if (previous)
[all...]
/haiku/src/add-ons/kernel/file_systems/netfs/server/
H A DAttributeDirectory.cpp267 Attribute* previous = NULL; local
276 previous = attribute;
286 fAttributes.InsertAfter(previous, attribute);
/haiku/src/add-ons/kernel/file_systems/nfs4/
H A DCookie.cpp113 RequestEntry* previous = NULL; local
116 if (previous == NULL)
119 previous->fNext = entry->fNext;
124 previous = entry;
174 OpenFileCookie::RemoveLock(LockInfo* lock, LockInfo* previous) argument
176 if (previous != NULL)
177 previous->fCookieNext = lock->fCookieNext;
179 ASSERT(previous == NULL && fLocks == lock);
H A DDirectoryCache.cpp168 NameCacheEntry* previous = NULL; local
172 fNameCache.Remove(previous, current);
177 previous = current;
184 previous = NULL;
188 fDirectoryCache->fEntries.Remove(previous, current);
193 previous = current;
H A DFileInfo.cpp73 InodeName* previous = NULL; local
77 fNames.Remove(previous, current);
82 previous = current;
H A DRPCServer.cpp446 ServerNode* previous = NULL; local
455 previous = current;
458 previous = current;
466 if (previous == NULL)
469 if (previous->fID < node->fID)
470 previous->fRight = NULL;
472 previous->fLeft = NULL;
474 if (previous->fID < node->fID)
475 previous->fRight = current->fLeft;
477 previous
508 ServerNode* previous = NULL; local
[all...]
/haiku/src/add-ons/kernel/file_systems/ntfs/libntfs/
H A Dcache.c107 struct HASH_ENTRY *previous; local
113 previous = (struct HASH_ENTRY*)NULL;
115 previous = link;
119 if (previous)
120 previous->next = link->next;
151 struct CACHED_GENERIC *previous; local
181 previous = current->previous;
183 if (previous) {
188 previous
338 struct CACHED_GENERIC *previous; local
[all...]
H A Dcache.h29 struct CACHED_GENERIC *previous; member in struct:CACHED_GENERIC
37 struct CACHED_INODE *previous; member in struct:CACHED_INODE
47 struct CACHED_NIDATA *previous; member in struct:CACHED_NIDATA
58 struct CACHED_LOOKUP *previous; member in struct:CACHED_LOOKUP
H A Dsecurity.h74 struct CACHED_PERMISSIONS_LEGACY *previous; member in struct:CACHED_PERMISSIONS_LEGACY
89 struct CACHED_SECURID *previous; member in struct:CACHED_SECURID
/haiku/src/add-ons/kernel/file_systems/userlandfs/private/
H A DRequestPort.cpp17 AllocatorNode(Port* port) : allocator(port), previous(NULL) {}
20 AllocatorNode* previous; member in struct:RequestPort::AllocatorNode
146 node->previous = fCurrentAllocatorNode;
204 AllocatorNode* node = fCurrentAllocatorNode->previous;
/haiku/src/apps/diskprobe/
H A DFindWindow.h27 FindWindow(BRect rect, BMessage& previous,
/haiku/src/apps/haikudepot/edits_generic/
H A DUndoableEdit.h27 virtual bool UndoesPrevious(const UndoableEdit* previous);
30 const UndoableEdit* previous);
/haiku/src/apps/icon-o-matic/document/
H A DSetPropertiesCommand.h21 PropertyObject* previous,
/haiku/src/apps/icon-o-matic/gui/
H A DIconObjectListView.h29 virtual void PropertyChanged(const Property* previous,
/haiku/src/apps/mediaplayer/interface/
H A DSubtitleBitmap.cpp177 previous(NULL)
181 ParseState(ParseState* previous) argument
183 color(previous->color),
184 bold(previous->bold),
185 italic(previous->italic),
186 underlined(previous->underlined),
188 previous(previous)
197 ParseState* previous; member in struct:ParseState
258 if (state->previous !
[all...]
/haiku/src/apps/mediaplayer/support/
H A DCommand.cpp63 Command::UndoesPrevious(const Command* previous) argument
77 Command::CombineWithPrevious(const Command* previous) argument
H A DCommand.h30 virtual bool UndoesPrevious(const Command* previous);
32 virtual bool CombineWithPrevious(const Command* previous);
/haiku/src/bin/consoled/
H A Dconsoled.cpp225 open_keyboards(int target, const char* start, struct keyboard* previous) argument
240 struct keyboard* keyboard = previous;
280 if (previous != NULL)
281 previous->next = keyboard;
/haiku/src/bin/unzip/
H A Dunzip.c77 struct _sign_info *previous; member in struct:_sign_info
1001 oldsighandlers = thissigsav->previous;
1044 savsig->previous = *p_savedhandler_chain;

Completed in 363 milliseconds

12345