Searched refs:previous (Results 26 - 50 of 165) sorted by relevance

1234567

/haiku-fatelf/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-fatelf/headers/private/net/
H A Dr5_compatibility.h59 struct stack_frame* previous;
/haiku-fatelf/src/apps/diskprobe/
H A DFindWindow.h26 FindWindow(BRect rect, BMessage &previous, BMessenger &target,
/haiku-fatelf/src/apps/icon-o-matic/document/
H A DSetPropertiesCommand.h21 PropertyObject* previous,
H A DSetPropertiesCommand.cpp29 PropertyObject* previous,
35 fOldProperties(previous),
27 SetPropertiesCommand(IconObject** objects, int32 objectCount, PropertyObject* previous, PropertyObject* current) argument
/haiku-fatelf/src/apps/icon-o-matic/gui/
H A DIconObjectListView.h29 virtual void PropertyChanged(const Property* previous,
/haiku-fatelf/src/tests/add-ons/kernel/file_systems/beserved/server-1.2.6/
H A DreaderWriter.c9 int32 previous = atomic_add(atomic, 1); local
10 if (previous >= 1)
16 int32 previous = atomic_add(atomic, -1); local
17 if (previous > 1)
/haiku-fatelf/src/add-ons/kernel/file_systems/ramfs/
H A DSLList.h161 inline void _SetTo(SL_LIST_CLASS_NAME *list, Node *previous, Node *node) argument
164 fPrevious = previous;
238 Node *previous = iterator._GetPreviousNode(); local
239 iterator._SetTo(this, previous, node->next);
240 if (previous)
241 previous->next = node->next;
267 Node *previous = NULL; local
269 previous = node;
273 iterator->_SetTo(const_cast<SL_LIST_CLASS_NAME*>(this), previous, local
/haiku-fatelf/src/tests/add-ons/kernel/file_systems/userlandfs/r5/src/test/ramfs/
H A DSLList.h161 inline void _SetTo(SL_LIST_CLASS_NAME *list, Node *previous, Node *node) argument
164 fPrevious = previous;
238 Node *previous = iterator._GetPreviousNode(); local
239 iterator._SetTo(this, previous, node->next);
240 if (previous)
241 previous->next = node->next;
267 Node *previous = NULL; local
269 previous = node;
273 iterator->_SetTo(const_cast<SL_LIST_CLASS_NAME*>(this), previous, local
/haiku-fatelf/src/add-ons/translators/icns/openjpeg/
H A Devent.c67 opj_event_mgr_t *previous = cinfo->event_mgr; local
70 return previous;
/haiku-fatelf/src/apps/icon-o-matic/style/
H A DSetColorCommand.cpp59 rgb_color previous = fStyle->Color(); local
61 fColor = previous;
/haiku-fatelf/src/system/kernel/
H A Dsyscalls.cpp70 generic_syscall* previous; member in struct:generic_syscall
169 syscall = syscall->previous;
248 generic_syscall* previous = find_generic_syscall(subsystem); local
249 if (previous != NULL) {
251 || version < previous->version) {
254 if ((previous->flags & B_SYSCALL_NOT_REPLACEABLE) != 0)
268 syscall->previous = previous;
273 if (previous != NULL)
274 sGenericSyscalls.Remove(previous);
[all...]
/haiku-fatelf/src/tests/system/kernel/slab/
H A DSlab.cpp235 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...]
/haiku-fatelf/src/add-ons/kernel/drivers/input/usb_hid/
H A DDeviceList.cpp82 device_list_entry *previous = NULL;
87 if (previous == NULL)
90 previous->next = current->next;
98 previous = current;
/haiku-fatelf/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-fatelf/src/preferences/screensaver/
H A DScreenCornerSelector.h41 screen_corner _ScreenCorner(BPoint point, screen_corner previous) const;
/haiku-fatelf/src/servers/app/
H A DHashTable.cpp112 struct entry* previous = NULL; local
128 if (previous)
129 previous->next = entry->next;
139 previous = entry;
H A DWindowList.h58 Window* previous; member in struct:window_anchor
/haiku-fatelf/src/tests/add-ons/kernel/file_systems/beserved/bt_fs/
H A DreaderWriter.c9 int32 previous = atomic_add(atomic, 1); local
10 if (previous >= 1)
16 int32 previous = atomic_add(atomic, -1); local
17 if (previous > 1)
/haiku-fatelf/src/tests/add-ons/kernel/file_systems/userlandfs/r5/src/private/
H A DRequestPort.cpp15 AllocatorNode(Port* port) : allocator(port), previous(NULL) {}
18 AllocatorNode* previous; member in struct:RequestPort::AllocatorNode
141 node->previous = fCurrentAllocatorNode;
199 AllocatorNode* node = fCurrentAllocatorNode->previous;
/haiku-fatelf/src/system/boot/loader/
H A Dheap.cpp58 void Remove(FreeChunk* previous = NULL);
153 FreeChunk::Remove(FreeChunk* previous) argument
155 if (previous == NULL) {
156 // find the previous chunk in the list
160 previous = chunk;
168 previous->fNext = fNext;
/haiku-fatelf/src/system/kernel/arch/ppc/
H A Darch_debug.cpp22 struct stack_frame *previous; member in struct:stack_frame
74 *next = (addr_t)frame.previous;
246 // switch back to the previous page directory to no cause any troubles
264 registers->r1 = (addr_t)frame->previous;
286 struct stack_frame *frame = get_current_stack_frame()->previous;
287 return (void *)frame->previous->return_address;
/haiku-fatelf/src/system/runtime_loader/
H A Dheap.cpp45 void Remove(free_chunk *previous = NULL);
124 free_chunk::Remove(free_chunk *previous) argument
126 if (previous == NULL) {
127 // find the previous chunk in the list
131 previous = chunk;
141 previous->next = this->next;
248 // just malloc(), if no previous allocation
/haiku-fatelf/src/add-ons/kernel/bus_managers/usb/
H A DBeOSCompatibility.h191 int32 previous = atomic_add(value, setValue); local
192 if (previous != 0)
193 result = previous;
/haiku-fatelf/headers/private/kernel/util/
H A DSinglyLinkedList.h146 inline void Remove(Element* previous, Element* element);
223 SINGLY_LINKED_LIST_CLASS_NAME::Remove(Element* previous, Element* element) argument
225 // ASSERT(previous == NULL
226 // ? fFirst == element : sGetLink(previous)->next == element);
229 if (previous == NULL)
232 sGetLink(previous)->next = elementLink->next;

Completed in 338 milliseconds

1234567