38       integer                                   :: i,j,k,m,n,p,q  local
189       j = 1
192              amg_paramap(level2)%p(j) = amg_paramap(level1)%p(i)
193              amg_paraext(level2)%p(j) = amg_paraext(level1)%p(i)
194              j = j + 1
236             j = amg_A_rowp(level1)%p(k)
237          if (cfilter.eq.amg_paramap(level1)%p(j)) then
239             if ( (amg_F(j).eq.1) .and. (mod(amg_S(k),2).eq.1) ) then
244             amg_Fn(n) = j
246             aLoc(j) = n
253           j = amg_A_rowp(level1)%p(k)
254           if ( (amg_F(j).eq.2) .and. (mod(amg_S(k),2).eq.1)) then
255              rtp = amg_A_lhs(level1)%p(amg_A_colm(level1)%p(j),1)
257              rtp = amg_la(aLoc(j))/rtp
259            do kj=amg_A_colm(level1)%p(j),amg_A_colm(level1)%p(j+1)-1
383          do j=1,amg_I_colm%p(i)
384             I_cf_rowp(level1)%p(mnnz+j)=amg_I_rowp%pp(i)%p(j)
385             I_cf(level1)%p(mnnz+j)=amg_I%pp(i)%p(j)
439          j = I_fc_colm(level1)%p(i)
441          mnnz = mnnz + j
447             j = I_cf_rowp(level1)%p(k)
448             kj = I_fc_colm(level1)%p(j)
449             I_fc_colm(level1)%p(j) = I_fc_colm(level1)%p(j) + 1
473       integer :: i,j,k,t  local
481          j = ishft(k-1,-1)
482          do while ( ( k.gt.0 ).and.(wght(heap(k)).gt.wght(heap(j))) )
483             t = heap(j)
484             heap(j) = heap(k)
486             k = j
487             j = ishft(j-1,-1)
504       integer i,j,k  local
519       integer i,j,k,t  local
522       j = ishft(i-1,-1);
523       do while ( (i.gt.0).and.(wght(heap(j)).lt.wght(heap(i))))
525         heap(i) = heap(j)
526         heap(j) = t
528         invmap(heap(j)) = j
529         i = j
530         j = ishft(i-1,-1)
535          j = 2*i+1
536       if ((j.lt.(nheaps-1)).and.(wght(heap(j)).lt.wght(heap(j+1)))) 
538          j = j + 1
540       if (wght(heap(i)).gt.wght(heap(j))) then 
544       heap(i) = heap(j)
545       heap(j) = t
547       invmap(heap(j)) = j
548       i = j
589       integer       :: i,j,k,n,m  local
616          do j=acolm(i)+1,acolm(i+1)-1
617             k = arowp(j)
618           if ((cfilter.eq.afmap(k)).and.(alhs(j).lt.rowmax(i))) then
619                 rowmax(i) = alhs(j)
621           if ((cfilter.eq.afmap(k)).and.(alhs(j).gt.prowmax(i))) then
622                 prowmax(i) = alhs(j)
635          do j=acolm(i)+1,acolm(i+1)-1
636             k = arowp(j)
638                 if (alhs(j).lt.0) then ! negative entries
639             if (alhs(j) .lt. rowmax(i)) then
640                 amg_S(j) = amg_S(j) + 1
642             if (alhs(j) .lt. rowmax(k)) then
643                 amg_S(j) = amg_S(j) + 2
647             if (alhs(j) .gt. prowmax(i)) then
648                 amg_S(j) = amg_S(j) + 1
650             if (alhs(j) .gt. prowmax(k)) then
651                 amg_S(j) = amg_S(j) + 2
664          do j=acolm(i),acolm(i+1)-1
665             k = arowp(j)
666             if ((amg_S(j).ne.0).and.(afmap(k).eq.cfilter)) then
700          do j=acolm(i),acolm(i+1)-1
701             k = arowp(j)
702             if ((afmap(k).eq.cfilter).and.(amg_S(j).ge.2)) then ! in S^T
709                 if (alhs(j).gt.0) deltal=-deltal
760          do j=acolm(m),acolm(m+1)-1
761             k = arowp(j)
763              if (amg_S(j).ge.2) then ! in m's S^T if !B
787              if (mod(amg_S(j),2).eq.1) then !if B2
789                     if (alhs(j).le.0) then
814       j = 0
821              j = j+1
830              do j=acolm(i)+1,acolm(i+1)-1
831                 m = arowp(j)
833                 if (amg_S(j).ge.1) then
855       integer :: i,j,p  local
859       j = 1
862              revmap(j) = i
863              j = j+1
866       do i=1,j-1
878       integer :: i,j,p  local
880       j = 1
883              amg_CF(j) = 2 ! fine
884              j = j + 1
886              amg_CF(j) = 1 ! coarse
887              j = j + 1