49     Long *Parent, *Child, *Childp, *W, *Rj, *Rp, *Super, *Stair, *Fmap, *Sleft,  in spqr_analyze()  local
635     Stair = W ;             // size n+1 [  in spqr_analyze()
636     Fmap = Stair + (n+1) ;  // size n+1 [  in spqr_analyze()
702             Stair [j] = Sleft [col+1] - Sleft [col] ;  in spqr_analyze()
715             Stair [j] = 0 ;  in spqr_analyze()
758                 Stair [j]++ ;               // add row ci to jth Stair  in spqr_analyze()
785             fm += Stair [j] ;  in spqr_analyze()
786             Stair [j] = fm ;  in spqr_analyze()
787             PR (("j %ld Stair %ld\n", j, Stair [j])) ;  in spqr_analyze()
893             t = MAX (j+1, Stair [j]) ;      // assume diagonal is present  in spqr_analyze()
895             PR (("   j %ld Stair %ld t %ld\n", j, Stair [j], t)) ;  in spqr_analyze()