Searched refs:stack_ptr (Results 1 - 5 of 5) sorted by relevance

/netgear-R7000-V1.0.7.12_1.2.5/components/opensource/linux/linux-2.6.36/drivers/acpi/acpica/
H A Dexresop.c117 * stack_ptr - Pointer to the operand stack to be
135 union acpi_operand_object ** stack_ptr,
173 if (!stack_ptr || !*stack_ptr) {
175 stack_ptr));
182 obj_desc = *stack_ptr;
204 *stack_ptr = obj_desc;
338 ((*stack_ptr)->common.type ==
340 && ((*stack_ptr)->reference.class == ACPI_REFCLASS_INDEX)) {
353 status = acpi_ex_resolve_to_value(stack_ptr, walk_stat
134 acpi_ex_resolve_operands(u16 opcode, union acpi_operand_object ** stack_ptr, struct acpi_walk_state * walk_state) argument
[all...]
H A Dexresolv.c57 acpi_ex_resolve_object_to_value(union acpi_operand_object **stack_ptr,
64 * PARAMETERS: **stack_ptr - Points to entry on obj_stack, which can
76 acpi_ex_resolve_to_value(union acpi_operand_object **stack_ptr, argument
81 ACPI_FUNCTION_TRACE_PTR(ex_resolve_to_value, stack_ptr);
83 if (!stack_ptr || !*stack_ptr) {
89 * The entity pointed to by the stack_ptr can be either
93 if (ACPI_GET_DESCRIPTOR_TYPE(*stack_ptr) == ACPI_DESC_TYPE_OPERAND) {
94 status = acpi_ex_resolve_object_to_value(stack_ptr, walk_state);
99 if (!*stack_ptr) {
138 acpi_ex_resolve_object_to_value(union acpi_operand_object **stack_ptr, struct acpi_walk_state *walk_state) argument
[all...]
H A Dacinterp.h342 acpi_ex_resolve_to_value(union acpi_operand_object **stack_ptr,
355 acpi_ex_resolve_node_to_value(struct acpi_namespace_node **stack_ptr,
363 union acpi_operand_object **stack_ptr,
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/minidlna/ffmpeg-2.3.4/libavcodec/
H A Dwebvttenc.c38 int stack_ptr; member in struct:__anon3284
54 if (s->stack_ptr >= WEBVTT_STACK_SIZE)
56 s->stack[s->stack_ptr++] = c;
62 if (s->stack_ptr <= 0)
64 return s->stack[--s->stack_ptr];
70 for (i = s->stack_ptr-1; i >= 0; i--)
87 while (s->stack_ptr != i)
H A Dsrtenc.c39 int stack_ptr; member in struct:__anon3226
57 if (s->stack_ptr >= SRT_STACK_SIZE)
59 s->stack[s->stack_ptr++] = c;
65 if (s->stack_ptr <= 0)
67 return s->stack[--s->stack_ptr];
73 for (i = s->stack_ptr-1; i >= 0; i--)
90 while (s->stack_ptr != i)

Completed in 183 milliseconds