Searched refs:stack (Results 51 - 75 of 113) sorted by relevance

12345

/haiku/src/add-ons/kernel/bus_managers/usb/
H A DBusManager.cpp13 BusManager::BusManager(Stack *stack, device_node* node) argument
15 fStack(stack),
22 fRootObject = new(std::nothrow) Object(stack, this);
H A Dusb.cpp155 Stack *stack = new(std::nothrow) Stack(); local
156 TRACE_MODULE("usb_module: stack created %p\n", stack);
157 if (!stack)
160 if (stack->InitCheck() != B_OK) {
161 delete stack;
165 gUSBStack = stack;
921 usb_get_stack(void** stack) argument
923 *stack = gUSBStack;
H A DStack.cpp32 TRACE("stack init\n");
34 mutex_init(&fStackLock, "usb stack lock");
130 TRACE_ERROR("the stack has run out of usb_ids\n");
157 // Validate that no children of this object are still in the stack.
206 Stack *stack = (Stack *)data; local
208 while (acquire_sem_etc(stack->fExploreSem, 1, B_RELATIVE_TIMEOUT,
210 stack->Explore();
H A Dusb_private.h64 status_t (*add_to)(Stack *stack);
177 const char * TypeName() const { return "stack"; }
207 BusManager(Stack *stack, device_node* node);
274 Object(Stack *stack, BusManager *bus);
311 * the stack. It creates packets, manages these and performs callbacks.
791 status_t (*get_stack)(void** stack);
/haiku/src/system/libroot/posix/stdlib/
H A Dradixsort.c42 * Program r_sort_a() is unstable but uses O(logN) extra memory for a stack.
60 } stack; typedef in typeref:struct:__anon35
69 #define SIZE 512 /* Default stack size. */
133 stack s[SIZE], *sp, *sp0, *sp1, temp;
137 /* Set up stack. */
159 if (sp + nc > s + SIZE) { /* Get more stack. */
177 * Set top[]; push incompletely sorted bins onto stack.
232 stack s[512], *sp, *sp0, *sp1, temp;
/haiku/src/tools/gensyscalls/
H A Dgensyscallinfos.cpp11 #include <stack>
159 string GetNextToken(stack<string>& skippedTokens)
164 string GetNextToken(stack<string>* skippedTokens)
224 void PutTokens(stack<string>& tokens)
326 stack<string> skippedTokens;
/haiku/src/kits/debugger/arch/x86/
H A DArchitectureX86.cpp380 // stack.
396 // return address on the stack, though.
402 uint32 stack = 0; local
406 // stack frame yet. Get the return address from the stack.
407 stack = cpuState->IntRegisterValue(X86_REGISTER_ESP);
410 stack += 4;
420 stack = cpuState->IntRegisterValue(X86_REGISTER_ESP);
428 // of the stack.
431 stack
[all...]
/haiku/src/kits/debugger/arch/x86_64/
H A DArchitectureX8664.cpp456 // stack.
472 // return address on the stack, though.
478 uint64 stack = 0; local
482 // stack frame yet. Get the return address from the stack.
483 stack = cpuState->IntRegisterValue(X86_64_REGISTER_RSP);
486 stack += 8;
496 stack = cpuState->IntRegisterValue(
505 // of the stack.
508 stack
[all...]
/haiku/src/system/kernel/
H A Dmodule.cpp122 module_path* stack; member in struct:module_iterator
263 status_t _ScanDirectory(Stack<DIR*>& stack, DIR* dir,
837 *_baseLength = iterator->stack[iterator->stack_current - 1].base_length;
839 return iterator->stack[--iterator->stack_current].name;
848 // allocate new space on the stack
849 module_path* stack = (module_path*)realloc(iterator->stack, local
851 if (stack == NULL)
854 iterator->stack = stack;
1488 _ScanDirectory(Stack<DIR*>& stack, DIR* dir, const char* prefix, size_t prefixPosition) argument
[all...]
/haiku/src/bin/fwcontrol/
H A Dfwcrom.c88 #define CROM_END(cc) ((vm_offset_t)(cc)->stack[0].dir + MAX_ROM - 1)
109 cc->stack[0].dir = (struct csrdirectory *)p;
110 cc->stack[0].index = 0;
118 ptr = &cc->stack[cc->depth];
138 ptr = &cc->stack[cc->depth];
144 ptr = &cc->stack[cc->depth];
/haiku/src/add-ons/kernel/generic/bios/
H A Dbios.cpp60 // The stack is dynamically allocated somewhere inside the RAM
271 // Allocate a stack.
272 void* stack = bios_allocate_mem(state, kStackSize); local
273 if (stack == NULL)
275 uint32 stackTop = bios_physical_address(state, stack) + kStackSize;
/haiku/src/apps/icon-o-matic/generic/gui/stateview/
H A DStateView.h70 void SetCommandStack(::CommandStack* stack);
/haiku/src/apps/icon-o-matic/gui/
H A DPathListView.h73 void SetCommandStack(CommandStack* stack);
H A DShapeListView.h76 void SetCommandStack(CommandStack* stack);
H A DStyleListView.h71 void SetCommandStack(CommandStack* stack);
/haiku/src/build/libgnuregex/
H A Dregex.c979 /* Macros for the compile stack. */
997 compile_stack_elt_t *stack;
1009 #define COMPILE_STACK_TOP (compile_stack.stack[compile_stack.avail])
1116 matching close-group on the compile stack, so the same register
1132 /* Initialize the compile stack. */
1133 compile_stack.stack = TALLOC (INIT_COMPILE_STACK_SIZE, compile_stack_elt_t);
1134 if (compile_stack.stack == NULL)
1587 RETALLOC (compile_stack.stack, compile_stack.size << 1,
1589 if (compile_stack.stack == NULL) return REG_ESPACE;
1655 /* Since we just checked for an empty stack abov
989 compile_stack_elt_t *stack; member in struct:__anon3
2260 fail_stack_elt_t *stack; member in struct:__anon4
[all...]
/haiku/src/bin/unzip/
H A Dunshrink.c45 other algorithms: at a minimum, 8K+8K+16K (stack+values+parents) assuming
93 #define stack G.area.shrink.Stack macro
104 uch *stacktop = stack + offset;
/haiku/headers/private/interface/
H A DPictureDataWriter.h19 #include <stack>
142 std::stack<off_t> fStack;
/haiku/src/system/kernel/arch/riscv64/
H A Darch_traps.S42 # switch to kernel stack, SSCRATCH will hold user SP
/haiku/src/add-ons/kernel/busses/usb/
H A Duhci.h32 Queue(Stack *stack);
97 pci_device* device, Stack *stack, device_node* node);
/haiku/src/add-ons/kernel/file_systems/bfs/
H A DQuery.cpp1247 // create index on the stack and delete it afterwards
1276 // put the whole expression on the stack
1278 Stack<Term*> stack;
1279 stack.Push(fExpression->Root());
1282 while (stack.Pop(&term)) {
1287 stack.Push(op->Left());
1288 stack.Push(op->Right());
1293 stack.Push(op->Right());
1295 stack.Push(op->Left());
1299 FATAL(("Unknown term on stack o
[all...]
/haiku/src/apps/haikudepot/build/scripts/
H A Dustache.py619 stack: _TokenizeStack = []
620 stack_append = stack.append
621 stack_pop = stack.pop
757 if stack:
821 # context stack
822 stack: _ProcessStack = []
823 stack_append = stack.append
824 stack_pop = stack.pop
826 # scope stack
/haiku/headers/private/firewire/
H A Diec13213.h213 struct crom_ptr stack[CROM_MAX_DEPTH]; member in struct:crom_context
/haiku/headers/posix/
H A Dsignal.h101 /* for signals using an alternate stack */
181 #define ILL_BADSTK 17 /* internal stack error */
256 /* setting the per-thread signal stack */
257 int sigaltstack(const stack_t* stack, stack_t* oldStack);
/haiku/src/tests/servers/app/newClipping/
H A DMyView.cpp6 #include <stack.h>
207 // (by using different stack impl inside node)
256 // put all nodes onto a stack that have an "indegree" count of zero
257 stack<node*> inDegreeZeroNodes;
263 // pop the rects from the stack, do the actual copy operation
265 // currently on the stack and to which the current rect pointed
267 // stack as well.

Completed in 135 milliseconds

12345