Searched refs:previous (Results 51 - 75 of 165) sorted by relevance

1234567

/haiku-fatelf/src/bin/findutils/lib/
H A Dregexprops.c174 " or more occurrences of the previous atom or regexp. ");
177 " or one occurrence of the previous atom or regexp. ");
185 " or more occurrences of the previous atom or regexp. ");
188 " or one occurrence of the previous atom or regexp. ");
269 literal("A backslash followed by a digit acts as a back-reference and matches the same thing as the previous grouped expression indicated by that number. For example @samp{\\2} matches the second group expression. The order of group expressions is determined by the position of their opening parenthesis ");
461 const char *name, *next, *previous; local
467 previous = "";
477 begin_subsection(name, next, previous, up);
489 previous = name;
/haiku-fatelf/src/system/kernel/arch/arm/
H A Darch_debug.cpp23 struct stack_frame *previous; member in struct:stack_frame
79 *next = (addr_t)((struct stack_frame *)framePointer)->previous;
/haiku-fatelf/src/system/kernel/arch/mipsel/
H A Darch_debug.cpp23 struct stack_frame *previous; member in struct:stack_frame
/haiku-fatelf/src/bin/gdb/gdb/
H A Dm68k-stub.c165 struct FrameStruct *previous;
255 movel a0@+,_lastFrame /* link in previous frame */
276 /* if the previous interrupt level was 7 then we're already servicing */
967 if (frame == frame->previous)
972 frame = frame->previous;
988 * invoke the previous handler.
1021 frame->previous = lastFrame;
1045 lastFrame->previous = lastFrame;
164 struct FrameStruct *previous; member in struct:FrameStruct
/haiku-fatelf/headers/private/kernel/util/
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);
H A DOpenHashTable.h194 ValueType* previous = NULL; local
201 if (previous)
202 _Link(previous) = next;
208 previous = slot;
/haiku-fatelf/src/system/kernel/debug/
H A Ddebug_paranoia.cpp153 ParanoiaCheck* previous = fChecks; local
154 while (previous != NULL && previous->fNext != check)
155 previous = previous->fNext;
157 // if previous is NULL (which it shouldn't be), just crash here
158 previous->fNext = check->fNext;
/haiku-fatelf/src/system/kernel/util/
H A DAVLTreeBase.cpp92 // The previous node cannot be in the right subtree.
101 AVLTreeNode* previous; local
103 previous = node;
105 } while (node && previous == node->left);
126 AVLTreeNode* previous; local
128 previous = node;
130 } while (node && previous == node->right);
/haiku-fatelf/src/tests/system/kernel/device_manager/playground/
H A Ddevice_manager.cpp158 device_node* previous = NULL);
160 status_t _RegisterDynamic(device_node* previous = NULL);
1382 float& bestSupport, device_node* previous)
1385 bestSupport = previous != NULL ? previous->fSupportsParent : 0.0f;
1390 if (previous != NULL && driver == previous->DriverModule()) {
1452 device_node::_RegisterDynamic(device_node* previous) argument
1469 _FindBestDriver(path.Path(), bestDriver, bestSupport, previous);
1482 if (previous !
1381 _FindBestDriver(const char* path, driver_module_info*& bestDriver, float& bestSupport, device_node* previous) argument
1581 device_node* previous = NULL; local
[all...]
/haiku-fatelf/src/add-ons/kernel/bluetooth/btCoreData/
H A DConnectionInterface.cpp90 || conn->GetDoublyLinkedListLink()->previous != NULL
117 || conn->GetDoublyLinkedListLink()->previous != NULL
/haiku-fatelf/src/add-ons/kernel/file_systems/ramfs/
H A DBlockAllocatorArea.h63 Block *previous, size_t size, bool hasNext, TFreeBlock *previousFree,
68 Block *previous, size_t size, bool hasNext);
/haiku-fatelf/src/apps/icon-o-matic/gui/
H A DIconObjectListView.cpp91 IconObjectListView::PropertyChanged(const Property* previous, argument
99 oldObject->AddProperty(previous->Clone());
/haiku-fatelf/src/system/libroot/os/
H A Ddebug.c198 bool previous = _rtDebugFlag; local
200 return previous;
/haiku-fatelf/src/system/libroot/posix/glibc/include/arch/ppc/
H A Dsysdep.h125 .previous; \
137 .previous; \
/haiku-fatelf/src/tests/add-ons/kernel/file_systems/userlandfs/r5/src/test/ramfs/
H A DBlockAllocatorArea.h63 Block *previous, size_t size, bool hasNext, TFreeBlock *previousFree,
68 Block *previous, size_t size, bool hasNext);
/haiku-fatelf/src/apps/icon-o-matic/generic/property/view/
H A DPropertyListView.h61 virtual void PropertyChanged(const Property* previous,
/haiku-fatelf/src/bin/consoled/
H A Dconsoled.cpp224 open_keyboards(int target, const char* start, struct keyboard* previous) argument
239 struct keyboard* keyboard = previous;
279 if (previous != NULL)
280 previous->next = keyboard;
/haiku-fatelf/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-fatelf/src/add-ons/kernel/network/ppp/shared/libkernelppp/
H A DKPPPInterface.cpp713 KPPPProtocol *current = fFirstProtocol, *previous = NULL;
719 previous = current;
724 if (!previous)
727 previous->SetNextProtocol(protocol);
737 if (!previous)
740 previous->SetNextProtocol(protocol);
777 KPPPProtocol *current = fFirstProtocol, *previous = NULL;
784 if (previous) {
785 previous->SetNextProtocol(current->NextProtocol());
788 if (!previous
[all...]
/haiku-fatelf/src/system/kernel/arch/m68k/
H A Darch_debug.cpp23 struct stack_frame *previous; member in struct:stack_frame
75 *next = (addr_t)frame.previous;
239 // switch back to the previous page directory to no cause any troubles
280 return (void *)frame->previous->return_address;
/haiku-fatelf/src/tests/add-ons/kernel/file_systems/userlandfs/r5/src/test/netfs/server/
H A DAttributeDirectory.cpp266 Attribute* previous = NULL; local
275 previous = attribute;
285 fAttributes.InsertAfter(previous, attribute);
/haiku-fatelf/src/kits/tracker/
H A DGroupedMenu.cpp262 TMenuItemGroup* previous = GroupAt(groupIndex - 1); local
263 group->fFirstItemIndex = previous->fFirstItemIndex
264 + previous->fItemsTotal;
/haiku-fatelf/src/kits/media/
H A DRealtimeAlloc.cpp47 FreeChunk* previous = NULL);
156 FreeChunk::Remove(rtm_pool* pool, FreeChunk* previous) argument
158 if (previous == NULL) {
159 // find the previous chunk in the list
163 previous = chunk;
171 previous->fNext = fNext;
/haiku-fatelf/src/add-ons/kernel/network/protocols/ipv4/
H A Dipv4.cpp279 net_buffer* previous = NULL; local
281 while ((previous = iterator.Next()) != NULL) {
282 if (previous->fragment.start <= start) {
287 next = previous;
292 if (previous != NULL && previous->fragment.start <= start
293 && previous->fragment.end >= end) {
302 TRACE(" previous: %p, next: %p", previous, next);
306 if (previous !
[all...]
/haiku-fatelf/src/add-ons/kernel/network/protocols/ipv6/
H A Dipv6.cpp320 net_buffer* previous = NULL; local
322 while ((previous = iterator.Next()) != NULL) {
323 if (previous->fragment.start <= start) {
328 next = previous;
333 if (previous != NULL && previous->fragment.start <= start
334 && previous->fragment.end >= end) {
343 TRACE(" previous: %p, next: %p", previous, next);
347 if (previous !
[all...]

Completed in 357 milliseconds

1234567