Index: findmask.f
===================================================================
RCS file: /thr/loyd/case/cvsroot/amber10/src/sander/findmask.f,v
retrieving revision 9.0
retrieving revision 9.2
diff -c -r9.0 -r9.2
*** findmask.f	3 Apr 2006 23:35:55 -0000	9.0
--- findmask.f	25 Jul 2006 16:43:37 -0000	9.2
***************
*** 89,95 ****
  !   one (C,N,O) or, less frequently, two character (Na,Cl,Mg,etc.) names
  !   effectively represent atomic elements when followed by '='
  ! - some static buffers during processing of 'maskstr' are set up 
! !   and this limits the length of selection string to 80 chars
  !
  ! VH; Dec 30, 2003
  ! 
--- 89,95 ----
  !   one (C,N,O) or, less frequently, two character (Na,Cl,Mg,etc.) names
  !   effectively represent atomic elements when followed by '='
  ! - some static buffers during processing of 'maskstr' are set up 
! !   and this limits the length of selection string to 256 chars
  !
  ! VH; Dec 30, 2003
  ! 
***************
*** 132,138 ****
     _REAL_ crd(*)
  
     integer i
!    character(80) infix, postfix
     logical error
  
     ! check for null input:
--- 132,138 ----
     _REAL_ crd(*)
  
     integer i
!    character(256) infix, postfix
     logical error
  
     ! check for null input:
***************
*** 176,182 ****
  ! expressions, such as [@CA], [:LYS,ARG], [:1-10@CB]
     implicit none
     
!    integer, parameter :: BUFLEN=80
     character(*) input, infix
     character(BUFLEN) buffer
     character(1) symbol
--- 176,182 ----
  ! expressions, such as [@CA], [:LYS,ARG], [:1-10@CB]
     implicit none
     
!    integer, parameter :: BUFLEN=256
     character(*) input, infix
     character(BUFLEN) buffer
     character(1) symbol
***************
*** 258,266 ****
  
     character(*) infix, postfix
     character(1) symbol, topop
!    ! maxstack=40 should be big enough for even very complex expressions
!    ! this only takes 40 chars, so memory is no issue here 
!    integer, parameter :: maxstack=40
     character(1) stack(maxstack)
     integer top, i, p, inplen
     logical error, done
--- 258,266 ----
  
     character(*) infix, postfix
     character(1) symbol, topop
!    ! maxstack=256 should be big enough for even very complex expressions
!    ! this only takes 256 chars, so memory is no issue here 
!    integer, parameter :: maxstack=256
     character(1) stack(maxstack)
     integer top, i, p, inplen
     logical error, done
***************
*** 397,407 ****
     character(len=4) igraph(*), isymbl(*), lbres(*)
     _REAL_ crd(*)
     character(*) postfix
!    integer, parameter :: maxstack=20
     
     integer i, j, p, inplen, top, astat, nselatom
     integer prnlev
!    character(80) buffer, diststr
     character(1) symbol
     integer, dimension(:,:), allocatable :: stack
     integer, dimension(:), allocatable :: mask1, mask2
--- 397,407 ----
     character(len=4) igraph(*), isymbl(*), lbres(*)
     _REAL_ crd(*)
     character(*) postfix
!    integer, parameter :: maxstack=256
     
     integer i, j, p, inplen, top, astat, nselatom
     integer prnlev
!    character(256) buffer, diststr
     character(1) symbol
     integer, dimension(:,:), allocatable :: stack
     integer, dimension(:), allocatable :: mask1, mask2
***************
*** 795,801 ****
     
     character(*) numlist
     integer nres, ipres(*), mask(*)
!    character(80) buffer
     character(1)  symbol
     integer p, i, inplen, res1, res2, ios
     logical dash
--- 795,801 ----
     
     character(*) numlist
     integer nres, ipres(*), mask(*)
!    character(256) buffer
     character(1)  symbol
     integer p, i, inplen, res1, res2, ios
     logical dash
***************
*** 901,907 ****
     
     character(*) numlist
     integer natom, mask(*)
!    character(80) buffer
     character(1)  symbol
     integer p, i, inplen, at1, at2, ios
     logical dash
--- 901,907 ----
     
     character(*) numlist
     integer natom, mask(*)
!    character(256) buffer
     character(1)  symbol
     integer p, i, inplen, at1, at2, ios
     logical dash