/dports/math/planarity/edge-addition-planarity-suite-Version_3.0.1.1/c/ |
H A D | stack.c | 13 stackP theStack; in sp_New() local 131 if (theStack->size >= theStack->capacity) in sp__Push() 134 theStack->S[theStack->size++] = a; in sp__Push() 140 if (theStack->size + 1 >= theStack->capacity) in sp__Push2() 143 theStack->S[theStack->size++] = a; in sp__Push2() 144 theStack->S[theStack->size++] = b; in sp__Push2() 153 *pA = theStack->S[--theStack->size]; in sp__Pop() 171 *pB = theStack->S[--theStack->size]; in sp__Pop2() 172 *pA = theStack->S[--theStack->size]; in sp__Pop2() 186 *pA = theStack->S[--theStack->size]; in sp__Pop2_Discard1() [all …]
|
H A D | stack.h | 33 #define sp_GetCapacity(theStack) (theStack->capacity) argument 70 #define sp_ClearStack(theStack) theStack->size=0 argument 74 #define sp_IsEmpty(theStack) !theStack->size argument 75 #define sp_NonEmpty(theStack) theStack->size argument 77 #define sp_Push(theStack, a) theStack->S[theStack->size++] = a argument 78 #define sp_Push2(theStack, a, b) {sp_Push(theStack, a); sp_Push(theStack, b);} argument 80 #define sp_Pop(theStack, a) a=theStack->S[--theStack->size] argument 83 #define sp_Pop2(theStack, a, b) {sp_Pop(theStack, b);sp_Pop(theStack, a);} argument 84 #define sp_Pop2_Discard1(theStack, a) {sp_Pop_Discard(theStack);sp_Pop(theStack, a);} argument 85 #define sp_Pop2_Discard(theStack) {sp_Pop_Discard(theStack);sp_Pop_Discard(theStack);} argument [all …]
|
H A D | graphDFSUtils.c | 31 stackP theStack; in gp_CreateDFSTree() local 44 theStack = theGraph->theStack; in gp_CreateDFSTree() 54 sp_ClearStack(theStack); in gp_CreateDFSTree() 250 stackP theStack = theGraph->theStack; in gp_LowpointAndLeastAncestor() local 275 sp_ClearStack(theStack); in gp_LowpointAndLeastAncestor() 288 sp_Push(theStack, v); in gp_LowpointAndLeastAncestor() 377 stackP theStack = theGraph->theStack; in gp_LeastAncestor() local 401 sp_ClearStack(theStack); in gp_LeastAncestor() 412 sp_Push(theStack, v); in gp_LeastAncestor() 413 while (sp_NonEmpty(theStack)) in gp_LeastAncestor() [all …]
|
H A D | graphUtils.c | 102 theGraph->theStack = NULL; in gp_New() 455 sp_Free(&theGraph->theStack); in _EnsureArcCapacity() 456 theGraph->theStack = newStack; in _EnsureArcCapacity() 862 sp_Free(&theGraph->theStack); in _ClearGraph() 1009 sp_Copy(dstGraph->theStack, srcGraph->theStack); in gp_CopyGraph() 1890 sp_Pop(theGraph->theStack, e); in _RestoreHiddenEdges() 1933 sp_Push(theGraph->theStack, NIL); in _HideVertex() 1934 sp_Push(theGraph->theStack, NIL); in _HideVertex() 1972 sp_Push(theGraph->theStack, e); in _ContractEdge() 2102 sp_Push(theGraph->theStack, u); in _IdentifyVertices() [all …]
|
H A D | graphEmbed.c | 161 stackP theStack; in _EmbeddingInitialize() local 172 theStack = theGraph->theStack; in _EmbeddingInitialize() 183 sp_ClearStack(theStack); in _EmbeddingInitialize() 198 sp_Push2(theStack, NIL, NIL); in _EmbeddingInitialize() 199 while (sp_NonEmpty(theStack)) in _EmbeddingInitialize() 201 sp_Pop2(theStack, uparent, e); in _EmbeddingInitialize() 248 sp_Push2(theStack, u, e); in _EmbeddingInitialize() 838 sp_ClearStack(theGraph->theStack); in _WalkDown() 891 sp_Push2(theGraph->theStack, R, 0); in _WalkDown() 1016 sp_Push2(theGraph->theStack, R, 0); in _HandleBlockedBicomp() [all …]
|
/dports/games/scummvm/scummvm-2.5.1/engines/glk/alan3/ |
H A D | stack.cpp | 41 return theStack; in createStack() 47 if (theStack == NULL) in deleteStack() 82 if (theStack->stackp == theStack->stackSize) in push() 84 theStack->stack[(theStack->stackp)++] = i; in push() 95 return theStack->stack[--(theStack->stackp)]; in pop() 104 return theStack->stack[theStack->stackp - 1]; in top() 117 push(theStack, theStack->framePointer); in newFrame() 118 theStack->framePointer = theStack->stackp; in newFrame() 120 push(theStack, 0); in newFrame() 170 theStack->stackp = theStack->framePointer; in endFrame() [all …]
|
H A D | stack.h | 48 extern void dumpStack(Stack theStack); 51 extern Aptr top(Stack theStack); 52 extern int stackDepth(Stack theStack); 54 extern void newFrame(Stack theStack, Aint noOfLocals); 55 extern void setLocal(Stack theStack, Aint blocksBelow, Aint variableNumber, Aptr value); 56 extern Aptr getLocal(Stack theStack, Aint level, Aint variable); 57 extern void endFrame(Stack theStack);
|
/dports/games/libretro-scummvm/scummvm-7b1e929/engines/glk/alan3/ |
H A D | stack.cpp | 41 return theStack; in createStack() 47 if (theStack == NULL) in deleteStack() 82 if (theStack->stackp == theStack->stackSize) in push() 84 theStack->stack[(theStack->stackp)++] = i; in push() 95 return theStack->stack[--(theStack->stackp)]; in pop() 104 return theStack->stack[theStack->stackp - 1]; in top() 117 push(theStack, theStack->framePointer); in newFrame() 118 theStack->framePointer = theStack->stackp; in newFrame() 120 push(theStack, 0); in newFrame() 170 theStack->stackp = theStack->framePointer; in endFrame() [all …]
|
H A D | stack.h | 48 extern void dumpStack(Stack theStack); 51 extern Aptr top(Stack theStack); 52 extern int stackDepth(Stack theStack); 54 extern void newFrame(Stack theStack, Aint noOfLocals); 55 extern void setLocal(Stack theStack, Aint blocksBelow, Aint variableNumber, Aptr value); 56 extern Aptr getLocal(Stack theStack, Aint level, Aint variable); 57 extern void endFrame(Stack theStack);
|
/dports/math/gap/gap-4.11.0/pkg/digraphs-1.1.1/extern/edge-addition-planarity-suite-Version_3.0.0.5/c/ |
H A D | stack.c | 13 stackP theStack; in sp_New() local 131 if (theStack->size >= theStack->capacity) in sp__Push() 134 theStack->S[theStack->size++] = a; in sp__Push() 140 if (theStack->size + 1 >= theStack->capacity) in sp__Push2() 143 theStack->S[theStack->size++] = a; in sp__Push2() 144 theStack->S[theStack->size++] = b; in sp__Push2() 153 *pA = theStack->S[--theStack->size]; in sp__Pop() 162 *pB = theStack->S[--theStack->size]; in sp__Pop2() 163 *pA = theStack->S[--theStack->size]; in sp__Pop2() 170 return theStack->size ? theStack->S[theStack->size-1] : NIL; in sp_Top() [all …]
|
H A D | stack.h | 33 #define sp_GetCapacity(theStack) (theStack->capacity) argument 62 #define sp_ClearStack(theStack) theStack->size=0 argument 63 #define sp_GetCurrentSize(theStack) (theStack->size) argument 66 #define sp_IsEmpty(theStack) !theStack->size argument 67 #define sp_NonEmpty(theStack) theStack->size argument 69 #define sp_Push(theStack, a) theStack->S[theStack->size++] = a argument 70 #define sp_Push2(theStack, a, b) {sp_Push(theStack, a); sp_Push(theStack, b);} argument 72 #define sp_Pop(theStack, a) a=theStack->S[--theStack->size] argument 73 #define sp_Pop2(theStack, a, b) {sp_Pop(theStack, b);sp_Pop(theStack, a);} argument 75 #define sp_Top(theStack) (theStack->size ? theStack->S[theStack->size-1] : NIL) argument [all …]
|
H A D | graphDFSUtils.c | 31 stackP theStack; in gp_CreateDFSTree() local 45 theStack = theGraph->theStack; in gp_CreateDFSTree() 55 sp_ClearStack(theStack); in gp_CreateDFSTree() 251 stackP theStack = theGraph->theStack; in gp_LowpointAndLeastAncestor() local 276 sp_ClearStack(theStack); in gp_LowpointAndLeastAncestor() 289 sp_Push(theStack, v); in gp_LowpointAndLeastAncestor() 378 stackP theStack = theGraph->theStack; in gp_LeastAncestor() local 402 sp_ClearStack(theStack); in gp_LeastAncestor() 413 sp_Push(theStack, v); in gp_LeastAncestor() 414 while (sp_NonEmpty(theStack)) in gp_LeastAncestor() [all …]
|
H A D | graphUtils.c | 102 theGraph->theStack = NULL; in gp_New() 455 sp_Free(&theGraph->theStack); in _EnsureArcCapacity() 456 theGraph->theStack = newStack; in _EnsureArcCapacity() 861 sp_Free(&theGraph->theStack); in _ClearGraph() 1008 sp_Copy(dstGraph->theStack, srcGraph->theStack); in gp_CopyGraph() 1889 sp_Pop(theGraph->theStack, e); in _RestoreHiddenEdges() 1932 sp_Push(theGraph->theStack, NIL); in _HideVertex() 1933 sp_Push(theGraph->theStack, NIL); in _HideVertex() 1971 sp_Push(theGraph->theStack, e); in _ContractEdge() 2101 sp_Push(theGraph->theStack, u); in _IdentifyVertices() [all …]
|
H A D | graphEmbed.c | 161 stackP theStack; in _EmbeddingInitialize() local 172 theStack = theGraph->theStack; in _EmbeddingInitialize() 183 sp_ClearStack(theStack); in _EmbeddingInitialize() 198 sp_Push2(theStack, NIL, NIL); in _EmbeddingInitialize() 199 while (sp_NonEmpty(theStack)) in _EmbeddingInitialize() 201 sp_Pop2(theStack, uparent, e); in _EmbeddingInitialize() 248 sp_Push2(theStack, u, e); in _EmbeddingInitialize() 838 sp_ClearStack(theGraph->theStack); in _WalkDown() 891 sp_Push2(theGraph->theStack, R, 0); in _WalkDown() 1016 sp_Push2(theGraph->theStack, R, 0); in _HandleBlockedBicomp() [all …]
|
H A D | graphNonplanar.c | 158 if (sp_NonEmpty(theGraph->theStack)) in _InitializeNonplanarityContext() 161 sp_Pop2(theGraph->theStack, R, dummy); in _InitializeNonplanarityContext() 372 while (sp_GetCurrentSize(theGraph->theStack) > stackBottom) in _PopAndUnmarkVerticesAndEdges() 374 sp_Pop(theGraph->theStack, V); in _PopAndUnmarkVerticesAndEdges() 379 sp_Push(theGraph->theStack, V); in _PopAndUnmarkVerticesAndEdges() 384 sp_Pop(theGraph->theStack, e); in _PopAndUnmarkVerticesAndEdges() 483 stackBottom1 = sp_GetCurrentSize(theGraph->theStack); in _MarkHighestXYPath() 495 stackBottom2 = sp_GetCurrentSize(theGraph->theStack); in _MarkHighestXYPath() 555 sp_Push(theGraph->theStack, e); in _MarkHighestXYPath() 556 sp_Push(theGraph->theStack, Z); in _MarkHighestXYPath() [all …]
|
/dports/graphics/graphviz/graphviz-2.44.1/lib/rbtree/ |
H A D | stack.c | 13 return( theStack ? (intptr_t) theStack->top : 0); in StackNotEmpty() 40 if(!theStack->top) { in StackPush() 44 theStack->top=newNode; in StackPush() 45 theStack->tail=newNode; in StackPush() 50 theStack->top=newNode; in StackPush() 59 if(theStack->top) { in StackPop() 61 oldNode=theStack->top; in StackPop() 62 theStack->top=theStack->top->next; in StackPop() 64 if (!theStack->top) theStack->tail=NULL; in StackPop() 72 if(theStack) { in StackDestroy() [all …]
|
/dports/misc/lifelines/lifelines-3.1.1/src/stdlib/ |
H A D | stack.c | 59 return( theStack ? (int) theStack->top : 0); in StackNotEmpty() 91 if(!theStack->top) { in StackPush() 94 theStack->top=newNode; in StackPush() 95 theStack->tail=newNode; in StackPush() 99 theStack->top=newNode; in StackPush() 109 if(theStack->top) { in StackPop() 111 oldNode=theStack->top; in StackPop() 112 theStack->top=theStack->top->next; in StackPop() 114 if (!theStack->top) theStack->tail=NULL; in StackPop() 126 if(theStack) { in StackDestroy() [all …]
|
/dports/biology/hyphy/hyphy-2.5.33/src/core/ |
H A D | stack.cpp | 50 theStack.Initialize(); in Initialize() 55 theStack.Duplicate(&((_Stack*)s)->theStack); in Duplicate() 66 theStack<<(newObj); in Push() 68 theStack.AppendNewInstance(newObj); in Push() 74 HBLObjectRef r = (HBLObjectRef)theStack.list_data[theStack.lLength-1]; in Pop() 76 theStack.lLength--; in Pop() 83 if (offset < theStack.lLength) { in Peek() 84 return (HBLObjectRef)theStack.list_data[theStack.lLength-1-offset]; in Peek() 91 return theStack.lLength; in StackDepth() 102 theStack.Clear(); in Reset()
|
H A D | operation.cpp | 588 if (theScrap.theStack.lLength<numberOfTerms) { in Execute() 594 …HBLObjectRef arg0 = ((HBLObjectRef)theScrap.theStack.list_data[theScrap.theStack.lLength-numberOfT… in Execute() 603 …arguments.AppendNewInstance ((HBLObjectRef)theScrap.theStack.list_data[theScrap.theStack.lLength -… in Execute() 606 …arguments.AppendNewInstance ((HBLObjectRef)theScrap.theStack.list_data[theScrap.theStack.lLength -… in Execute() 620 theScrap.theStack.lLength -= (numberOfTerms); in Execute() 624 theScrap.theStack.lLength--; in Execute() 630 theScrap.theStack.Place(temp); in Execute() 686 …HBLObjectRef arg0 = ((HBLObjectRef)theScrap.theStack.list_data[theScrap.theStack.lLength-numberOfT… in ExecutePolynomial() 695 …arguments.AppendNewInstance ((HBLObjectRef)theScrap.theStack.list_data[theScrap.theStack.lLength-k… in ExecutePolynomial() 703 theScrap.theStack.lLength--; in ExecutePolynomial() [all …]
|
/dports/textproc/zorba/zorba-2.7.0/src/zorbautils/ |
H A D | stack.h | 33 std::vector<T> theStack; variable 39 theStack.reserve(initSize); 57 theStack.clear(); in clear() 63 return theStack[theTop-1]; in top() 69 return theStack[theTop-1]; in top() 81 if (theTop < theStack.size()) in push() 82 theStack[theTop] = val; in push() 84 theStack.push_back(val); in push() 92 return theStack[i];
|
H A D | SAXParser.cpp | 87 lParser.theStack.push_back(lParser.theResult); in startDocument() 110 if (lParser.theStack.size() > 1) { in startElement() 114 store::Item_t parent = lParser.theStack.back(); in startElement() 153 lParser.theStack.push_back(result); in startElement() 164 if (lParser.theStack.size() > 2) { in endElement() 167 lParser.theStack.pop_back(); in endElement() 186 lParser.theFactory.createTextNode(result, lParser.theStack.back().getp(), s); in cdataBlock() 196 lParser.theFactory.createCommentNode(result, lParser.theStack.back(), data); in comment() 211 lParser.theFactory.createPiNode(result, lParser.theStack.back(), t, data, baseuri); in processingInstruction() 247 theFactory.createTextNode(result, theStack.back().getp(), s); in createTextNodeFromBuffer()
|
/dports/games/libretro-scummvm/scummvm-7b1e929/engines/sludge/ |
H A D | variable.cpp | 49 varData.theStack->timesUsed--; in unlinkVar() 51 while (varData.theStack->first) in unlinkVar() 53 delete varData.theStack; in unlinkVar() 54 varData.theStack = NULL; in unlinkVar() 175 if (!checkNew(varData.theStack)) in copyStack() 177 varData.theStack->first = NULL; in copyStack() 178 varData.theStack->last = NULL; in copyStack() 179 varData.theStack->timesUsed = 1; in copyStack() 185 varData.theStack->last = varData.theStack->first; in copyStack() 227 re = (other.varData.theStack == varData.theStack); in compareVars() [all …]
|
/dports/games/scummvm/scummvm-2.5.1/engines/sludge/ |
H A D | variable.cpp | 48 varData.theStack->timesUsed--; in unlinkVar() 50 while (varData.theStack->first) in unlinkVar() 52 delete varData.theStack; in unlinkVar() 53 varData.theStack = NULL; in unlinkVar() 174 if (!checkNew(varData.theStack)) in copyStack() 176 varData.theStack->first = NULL; in copyStack() 177 varData.theStack->last = NULL; in copyStack() 178 varData.theStack->timesUsed = 1; in copyStack() 184 varData.theStack->last = varData.theStack->first; in copyStack() 226 re = (other.varData.theStack == varData.theStack); in compareVars() [all …]
|
/dports/x11-wm/treewm/treewm-0.4.5/src/ |
H A D | tile.cc | 96 stack<pair<int,int> > theStack; in addRectToTiling() local 125 theStack.push(make_pair(curPosOnFront,noItemsOnFront)); in addRectToTiling() 138 if(theStack.empty()){ in addRectToTiling() 142 assert(!theStack.empty()); in addRectToTiling() 144 curPosOnFront=theStack.top().first+1; in addRectToTiling() 145 noItemsOnFront=theStack.top().second; in addRectToTiling() 149 theStack.pop(); in addRectToTiling() 151 }while(workCyclesLeft>0 && !theStack.empty()); in addRectToTiling()
|
/dports/cad/opencascade/opencascade-7.6.0/src/OSD/ |
H A D | OSD_signal.cxx | 574 THROW_OR_JUMP (OSD_Exception_ACCESS_VIOLATION, aMsg, theStack); in _osd_raise() 580 THROW_OR_JUMP (Standard_ProgramError, aMsg, theStack); in _osd_raise() 586 THROW_OR_JUMP (OSD_Exception_IN_PAGE_ERROR, aMsg, theStack); in _osd_raise() 589 THROW_OR_JUMP (Standard_DivideByZero, aMsg, theStack); in _osd_raise() 592 THROW_OR_JUMP (OSD_Exception_INT_OVERFLOW, aMsg, theStack); in _osd_raise() 601 THROW_OR_JUMP (OSD_Exception_PRIV_INSTRUCTION, aMsg, theStack); in _osd_raise() 604 THROW_OR_JUMP (OSD_Exception_STACK_OVERFLOW, aMsg, theStack); in _osd_raise() 607 THROW_OR_JUMP (Standard_DivideByZero, aMsg, theStack); in _osd_raise() 611 THROW_OR_JUMP (Standard_Overflow, aMsg, theStack); in _osd_raise() 614 THROW_OR_JUMP (Standard_Underflow, aMsg, theStack); in _osd_raise() [all …]
|