Merge pull request #30 from aselimov/ft--update-boundary-command

Ft  update boundary command
master
aselimov 5 years ago committed by GitHub
commit c800d3261a
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23

@ -1,6 +1,6 @@
FC=ifort FC=ifort
FFLAGS=-mcmodel=large -g -O0 -stand f08 -fpe0 -traceback -check bounds,uninit -warn all -implicitnone -no-wrap-margin -heap-arrays #FFLAGS=-mcmodel=large -g -O0 -stand f08 -fpe0 -traceback -check bounds,uninit -warn all -implicitnone -no-wrap-margin -heap-arrays
#FFLAGS=-mcmodel=large -Ofast -no-wrap-margin -heap-arrays FFLAGS=-mcmodel=large -Ofast -no-wrap-margin -heap-arrays
MODES=mode_create.o mode_merge.o mode_convert.o MODES=mode_create.o mode_merge.o mode_convert.o
OPTIONS=opt_disl.o opt_group.o opt_orient.o opt_delete.o OPTIONS=opt_disl.o opt_group.o opt_orient.o opt_delete.o
OBJECTS=main.o elements.o io.o subroutines.o functions.o atoms.o call_mode.o box.o $(MODES) $(OPTIONS) call_option.o OBJECTS=main.o elements.o io.o subroutines.o functions.o atoms.o call_mode.o box.o $(MODES) $(OPTIONS) call_option.o

@ -6,6 +6,7 @@ module box
real(kind=dp) :: box_bd(6) !Global box boundaries real(kind=dp) :: box_bd(6) !Global box boundaries
character(len=3) :: box_bc !Box boundary conditions (periodic or shrinkwrapped) character(len=3) :: box_bc !Box boundary conditions (periodic or shrinkwrapped)
logical :: bound_called
!The subbox variables contain values for each subbox, being the boxes read in through some !The subbox variables contain values for each subbox, being the boxes read in through some
!command. Currently only mode_merge will require sub_boxes, for mode_create it will always !command. Currently only mode_merge will require sub_boxes, for mode_create it will always
!allocate to only 1 sub_box !allocate to only 1 sub_box
@ -27,6 +28,7 @@ module box
!Initialize some box functions !Initialize some box functions
box_bd(:) = 0.0_dp box_bd(:) = 0.0_dp
box_bc = 'ppp' box_bc = 'ppp'
bound_called=.false.
end subroutine box_init end subroutine box_init
subroutine alloc_sub_box(n) subroutine alloc_sub_box(n)

@ -28,6 +28,7 @@ subroutine call_option(option, arg_pos)
arg_pos=arg_pos+1 arg_pos=arg_pos+1
call get_command_argument(arg_pos, box_bc) call get_command_argument(arg_pos, box_bc)
arg_pos=arg_pos+1 arg_pos=arg_pos+1
bound_called = .true.
case('-delete') case('-delete')
call run_delete(arg_pos) call run_delete(arg_pos)
case default case default

@ -468,8 +468,8 @@ module elements
do i = 1, atom_num do i = 1, atom_num
do j = 1, 3 do j = 1, 3
if (r_atom(j,i) > max_bd(j)) max_bd(j) = r_atom(j,i) + lim_zero if (r_atom(j,i) > max_bd(j)) max_bd(j) = r_atom(j,i) + tol
if (r_atom(j,i) < min_bd(j)) min_bd(j) = r_atom(j,i) - lim_zero if (r_atom(j,i) < min_bd(j)) min_bd(j) = r_atom(j,i) - tol
end do end do
end do end do
@ -477,17 +477,18 @@ module elements
do inod = 1, ng_node(lat_ele(i)) do inod = 1, ng_node(lat_ele(i))
do ibasis = 1, basisnum(lat_ele(i)) do ibasis = 1, basisnum(lat_ele(i))
do j = 1, 3 do j = 1, 3
if (r_node(j,ibasis,inod,i) > max_bd(j)) max_bd(j) = r_node(j,ibasis,inod,i) + lim_zero if (r_node(j,ibasis,inod,i) > max_bd(j)) max_bd(j) = r_node(j,ibasis,inod,i) + tol
if (r_node(j,ibasis,inod,i) < min_bd(j)) min_bd(j) = r_node(j,ibasis,inod,i) -lim_zero if (r_node(j,ibasis,inod,i) < min_bd(j)) min_bd(j) = r_node(j,ibasis,inod,i) - tol
end do end do
end do end do
end do end do
end do end do
do j = 1, 3 do j = 1, 3
if(box_bc(j:j) == 's') then
box_bd(2*j) = max_bd(j) box_bd(2*j) = max_bd(j)
box_bd(2*j-1) = min_bd(j) box_bd(2*j-1) = min_bd(j)
end if
end do end do
end subroutine end subroutine

@ -101,6 +101,9 @@ program main
!If wrap flag was passed then call the wrap atoms command !If wrap flag was passed then call the wrap atoms command
if(wrap_flag) call wrap_atoms if(wrap_flag) call wrap_atoms
!If we called the boundary command then we adjust the box bounds
if(bound_called) call def_new_box
!Check to make sure a file was passed to be written out and then write out !Check to make sure a file was passed to be written out and then write out
! Before building do a check on the file ! Before building do a check on the file
if (outfilenum == 0) then if (outfilenum == 0) then

@ -22,6 +22,7 @@ module opt_orient
integer :: i, ibasis, inod integer :: i, ibasis, inod
logical :: isortho, isrighthanded logical :: isortho, isrighthanded
real(kind=dp) :: inv_sub_box_ori(3,3,sub_box_num) real(kind=dp) :: inv_sub_box_ori(3,3,sub_box_num)
character(len=3) :: old_box_bc
!First parse the orient command !First parse the orient command
call parse_orient(arg_pos) call parse_orient(arg_pos)
@ -31,7 +32,7 @@ module opt_orient
!Find all inverse orientation matrices for all sub_boxes !Find all inverse orientation matrices for all sub_boxes
do i = 1, sub_box_num do i = 1, sub_box_num
call matrix_inverse(sub_box_ori, 3, inv_sub_box_ori) call matrix_inverse(sub_box_ori(:,:,i), 3, inv_sub_box_ori(:,:,i))
end do end do
!Now transform all atoms !Now transform all atoms
@ -62,8 +63,11 @@ module opt_orient
!Save original box boundaries !Save original box boundaries
orig_box_bd = box_bd orig_box_bd = box_bd
!Now find new box boundaries !Now find new box boundaries, have to temporarily define the box as shrink wrapped for def new box to work
old_box_bc = box_Bc
box_bc = 'sss'
call def_new_box call def_new_box
box_bc = old_box_bc
end subroutine orient end subroutine orient
subroutine parse_orient(arg_pos) subroutine parse_orient(arg_pos)

@ -6,7 +6,8 @@ module parameters
integer, parameter :: dp= selected_real_kind(15,307) integer, parameter :: dp= selected_real_kind(15,307)
!Parameters for floating point tolerance !Parameters for floating point tolerance
real(kind=dp), parameter :: lim_zero = epsilon(1.0_dp), & real(kind=dp), parameter :: lim_zero = epsilon(1.0_dp), &
lim_large = huge(1.0_dp) lim_large = huge(1.0_dp), &
tol = 10.0_dp**(-6.0_dp)
logical, save :: lmpcac logical, save :: lmpcac
!Numeric constants !Numeric constants

@ -230,12 +230,14 @@ module subroutines
integer :: j integer :: j
real(kind=dp) ::box_len real(kind=dp) ::box_len
do j = 1, 3 do j = 1, 3
if(box_bc(j:j) == 'p') then
box_len = box_bd(2*j) - box_bd(2*j-1) box_len = box_bd(2*j) - box_bd(2*j-1)
if (r(j) > box_bd(2*j)) then if (r(j) > box_bd(2*j)) then
r(j) = r(j) - box_len r(j) = r(j) - box_len
else if (r(j) < box_bd(2*j-1)) then else if (r(j) < box_bd(2*j-1)) then
r(j) = r(j) + box_len r(j) = r(j) + box_len
end if end if
end if
end do end do
end subroutine end subroutine

Loading…
Cancel
Save