992    Int      stackTop;              // Iterator stack pointer, one past end  member
1301    fm->stackTop = 0;  in stackClear()
1307    assert(fm->stackTop < WFM_STKMAX);  in stackPush()
1309    fm->nodeStack[fm->stackTop] = n;  in stackPush()
1310    fm-> numStack[fm->stackTop] = i;  in stackPush()
1311    fm->stackTop++;  in stackPush()
1317    assert(fm->stackTop <= WFM_STKMAX);  in stackPop()
1319    if (fm->stackTop > 0) {  in stackPop()
1320       fm->stackTop--;  in stackPop()
1321       *n = fm->nodeStack[fm->stackTop];  in stackPop()
1322       *i = fm-> numStack[fm->stackTop];  in stackPop()
1324       fm->nodeStack[fm->stackTop] = NULL;  in stackPop()
1325       fm-> numStack[fm->stackTop] = 0;  in stackPop()
1395    fm->stackTop     = 0;  in initFM()
1544    assert(fm->stackTop == 0);  in dopyFM()
1551    fm->stackTop = 0;  in dopyFM()