92   StackElement *container;  member
102   PetscInt *container;  member
167   if (stack->top < stack->stacksize - 1 && stack->container[stack->top + 1]) {  in ElementCreate()
168     *e = stack->container[stack->top + 1];  in ElementCreate()
241   for (i = 0; i < stack->stacksize; i++) newcontainer[i] = stack->container[i];  in StackResize()
242   PetscCall(PetscFree(stack->container));  in StackResize()
243   stack->container = newcontainer;  in StackResize()
252   stack->container[++stack->top] = e;  in StackPush()
261   *e = stack->container[stack->top--];  in StackPop()
268   *e = stack->container[stack->top];  in StackTop()
278   if (!stack->container) PetscCall(PetscCalloc1(size, &stack->container));  in StackInit()
287   if (!stack->container) PetscFunctionReturn(PETSC_SUCCESS);  in StackDestroy()
289   for (PetscInt i = 0; i < n; i++) PetscCall(ElementDestroy(stack, stack->container[i]));  in StackDestroy()
290   PetscCall(PetscFree(stack->container));  in StackDestroy()
299   *e = stack->container[index];  in StackFind()
359     e          = stack->container[i];  in StackDumpAll()
592 … if (tjsch->stype == TWO_LEVEL_TWO_REVOLVE) diskstack->container[++diskstack->top] = stridenum + 1;  in TopLevelStore()
598 … if (tjsch->stype == TWO_LEVEL_TWO_REVOLVE) diskstack->container[++diskstack->top] = stridenum + 1;  in TopLevelStore()
606 …     if (tjsch->stype == TWO_LEVEL_TWO_REVOLVE) diskstack->container[++diskstack->top] = stridenum;  in TopLevelStore()
612 … if (tjsch->stype == TWO_LEVEL_TWO_REVOLVE) diskstack->container[++diskstack->top] = stridenum + 1;  in TopLevelStore()
1358     restoredstridenum            = diskstack->container[diskstack->top];  in TSTrajectoryMemoryGet_TLTR()
2144       PetscCall(PetscMalloc1(diskstack->stacksize, &diskstack->container));  in TSTrajectorySetUp_Memory()
2215       PetscCall(PetscFree(tjsch->diskstack.container));  in TSTrajectoryReset_Memory()