/haiku/src/tests/system/kernel/slab/ |
H A D | Slab.cpp | 235 fStores[i].loaded = fStores[i].previous = NULL; 268 // if it's not empty, or from the previous magazine if it's full 278 if (store->previous && (_IsMagazineFull(store->previous) 279 || _ExchangeWithFull(store->previous))) 280 std::swap(store->previous, store->loaded); 293 // and it's not full, or to the previous one if it is empty. If 301 if ((store->previous && _IsMagazineEmpty(store->previous)) 302 || _ExchangeWithEmpty(store->previous)) [all...] |
H A D | Slab.h | 488 Magazine *loaded, *previous; member in struct:BaseDepot::CPUStore
|
/haiku/src/servers/app/ |
H A D | WindowList.cpp | 20 previous(NULL), 64 windowAnchor.previous = beforeAnchor.previous; 65 if (windowAnchor.previous != NULL) 66 windowAnchor.previous->Anchor(fIndex).next = window; 68 beforeAnchor.previous = window; 75 windowAnchor.previous = fLastWindow; 78 windowAnchor.previous = NULL; 99 // it must have a previous sibling, then 100 windowAnchor.previous [all...] |
H A D | WindowList.h | 58 Window* previous; member in struct:window_anchor
|
/haiku/src/system/kernel/slab/ |
H A D | ObjectDepot.cpp | 44 DepotMagazine* previous; member in struct:depot_cpu_store 224 depot->stores[i].previous = NULL; 257 // if it's not empty, or from the previous magazine if it's full 267 if (store->previous 268 && (store->previous->IsFull() 269 || exchange_with_full(depot, store->previous))) { 270 std::swap(store->previous, store->loaded); 286 // and it's not full, or to the previous one if it is empty. If 295 if ((store->previous != NULL && store->previous [all...] |
/haiku/src/kits/debug/arch/m68k/ |
H A D | arch_debug_support.cpp | 13 struct stack_frame *previous; member in struct:stack_frame
|
/haiku/src/kits/debug/arch/x86/ |
H A D | arch_debug_support.cpp | 13 struct stack_frame *previous; member in struct:stack_frame 48 stackFrameInfo->parent_frame = stackFrame.previous;
|
/haiku/src/kits/debug/arch/x86_64/ |
H A D | arch_debug_support.cpp | 14 struct stack_frame *previous; member in struct:stack_frame 49 stackFrameInfo->parent_frame = stackFrame.previous;
|
/haiku/src/bin/unzip/ |
H A D | unzip.c | 77 struct _sign_info *previous; member in struct:_sign_info 1001 oldsighandlers = thissigsav->previous; 1044 savsig->previous = *p_savedhandler_chain;
|
/haiku/src/apps/icon-o-matic/document/ |
H A D | SetPropertiesCommand.h | 21 PropertyObject* previous,
|
/haiku/src/apps/icon-o-matic/gui/ |
H A D | IconObjectListView.h | 29 virtual void PropertyChanged(const Property* previous,
|
/haiku/src/apps/mediaplayer/interface/ |
H A D | SubtitleBitmap.cpp | 177 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 D | Command.cpp | 63 Command::UndoesPrevious(const Command* previous) argument 77 Command::CombineWithPrevious(const Command* previous) argument
|
H A D | Command.h | 30 virtual bool UndoesPrevious(const Command* previous); 32 virtual bool CombineWithPrevious(const Command* previous);
|
/haiku/src/add-ons/kernel/file_systems/netfs/headers/shared/ |
H A D | SLList.h | 173 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/ntfs/libntfs/ |
H A D | cache.c | 107 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 D | cache.h | 29 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
|
/haiku/headers/cpp/ |
H A D | stl_slist.h | 449 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 D | MultiHashTable.h | 138 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;
|