| /haiku/headers/libs/agg/ |
| H A D | agg_array.h | 927 int stack[80]; local
928 int* top = stack;
1009 if(top > stack)
|
| /haiku/src/system/kernel/ |
| H A D | thread.cpp | 409 // signal stack, if set, shall be unset.
683 // Copy the fork args onto the stack and free them.
750 /*! Prepares the given thread's kernel stack for executing its entry function.
753 thread's kernel stack. A pointer to the copy's data is passed to the entry
757 \param data Pointer to data to be copied to the thread's stack and passed
764 uint8* stack = (uint8*)thread->kernel_stack_base; local
767 // clear (or rather invalidate) the kernel stack contents, if compiled with
771 memset((void*)(stack + KERNEL_STACK_GUARD_PAGES * B_PAGE_SIZE), 0xcc,
774 memset(stack, 0xcc, KERNEL_STACK_SIZE);
778 // copy the data onto the stack, wit
[all...] |
| /haiku/src/add-ons/kernel/busses/usb/ |
| H A D | ohci.cpp | 62 Stack *stack; local
63 if (gUSB->get_stack((void**)&stack) != B_OK)
66 OHCI *ohci = new(std::nothrow) OHCI(&bus->pciinfo, bus->pci, bus->device, stack, node);
269 OHCI::OHCI(pci_info *info, pci_device_module_info* pci, pci_device* device, Stack *stack, argument
271 : BusManager(stack, node),
275 fStack(stack),
|
| H A D | ehci.cpp | 60 Stack *stack; local
61 if (gUSB->get_stack((void**)&stack) != B_OK)
64 EHCI *ehci = new(std::nothrow) EHCI(&bus->pciinfo, bus->pci, bus->device, stack, node);
317 EHCI::EHCI(pci_info *info, pci_device_module_info* pci, pci_device* device, Stack *stack, argument
319 : BusManager(stack, node),
326 fStack(stack),
|
| H A D | xhci.cpp | 66 Stack *stack; local
67 if (gUSB->get_stack((void**)&stack) != B_OK)
70 XHCI *xhci = new(std::nothrow) XHCI(&bus->pciinfo, bus->pci, bus->device, stack, node);
340 XHCI::XHCI(pci_info *info, pci_device_module_info* pci, pci_device* device, Stack *stack, argument
342 : BusManager(stack, node),
348 fStack(stack),
1340 // Due to how the USB stack allocates physical memory, we can't just
|
| /haiku/src/kits/interface/ |
| H A D | ColumnListView.cpp | 4865 } stack[kMaxDepth]; local
4868 stack[stackTop].list = &fRows;
4869 stack[stackTop].isVisible = true;
4870 stack[stackTop].listIndex = 0;
4879 stack_entry* currentEntry = &stack[stackTop];
4904 stack[stackTop].listIndex = 0;
4905 stack[stackTop].list = childList;
4906 stack[stackTop].isVisible = (currentEntry->isVisible && parentRow->fIsExpanded);
4919 currentEntry = &stack[stackTop];
5127 // Put current list on the stack i
[all...] |
| /haiku/src/apps/bootmanager/ |
| H A D | bootman.S | 172 ; Variables on stack
262 mov sp, 0xFFFF - sizeof(Locals) ; Make stack empty
|
| /haiku/src/system/libroot/posix/glibc/regex/ |
| H A D | regex_internal.h | 425 /* The OS usually guarantees only one guard page at the bottom of the stack,
428 of a few compiler-allocated temporary stack slots. */
612 struct re_fail_stack_ent_t *stack; member in struct:re_fail_stack_t
|
| /haiku/src/add-ons/kernel/file_systems/bfs/ |
| H A D | BPlusTree.h | 167 // needed for searching (utilizing a stack)
330 status_t _SeekDown(Stack<node_and_key>& stack,
|
| /haiku/ |
| H A D | configure | 98 --use-stack-protector Build with stack protection enabled
826 --use-stack-protector) HAIKU_USE_STACK_PROTECTOR=1; shift 1;;
|
| /haiku/src/servers/app/drawing/ |
| H A D | DrawingEngine.cpp | 19 #include <stack>
565 // (by using different stack impl inside node)
616 // put all nodes onto a stack that have an "indegree" count of zero
617 std::stack<node*> inDegreeZeroNodes;
623 // pop the rects from the stack, do the actual copy operation
625 // currently on the stack and to which the current rect pointed
627 // stack as well.
|
| /haiku/src/bin/fwcontrol/ |
| H A D | fwcontrol.c | 468 dir = cc.stack[0].dir;
|
| /haiku/src/system/kernel/arch/x86/ |
| H A D | arch_cpu.cpp | 1493 addr_t stack = x86_get_stack_frame();
1494 return (stack - (addr_t)sDoubleFaultStacks) / kDoubleFaultStackSize;
|