2 * This file is part of the GROMACS molecular simulation package.
4 * Copyright (c) 1991-2000, University of Groningen, The Netherlands.
5 * Copyright (c) 2001-2004, The GROMACS development team.
6 * Copyright (c) 2013,2014,2015, by the GROMACS development team, led by
7 * Mark Abraham, David van der Spoel, Berk Hess, and Erik Lindahl,
8 * and including many others, as listed in the AUTHORS file in the
9 * top-level source directory and at http://www.gromacs.org.
11 * GROMACS is free software; you can redistribute it and/or
12 * modify it under the terms of the GNU Lesser General Public License
13 * as published by the Free Software Foundation; either version 2.1
14 * of the License, or (at your option) any later version.
16 * GROMACS is distributed in the hope that it will be useful,
17 * but WITHOUT ANY WARRANTY; without even the implied warranty of
18 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
19 * Lesser General Public License for more details.
21 * You should have received a copy of the GNU Lesser General Public
22 * License along with GROMACS; if not, see
23 * http://www.gnu.org/licenses, or write to the Free Software Foundation,
24 * Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
26 * If you want to redistribute modifications to GROMACS, please
27 * consider that scientific software is very special. Version
28 * control is crucial - bugs must be traceable. We will be happy to
29 * consider code for inclusion in the official distribution, but
30 * derived work must not be called official GROMACS. Details are found
31 * in the README & COPYING files - if they are missing, get the
32 * official version at http://www.gromacs.org.
34 * To help us fund GROMACS development, we humbly ask that you cite
35 * the research papers on the package. Check out http://www.gromacs.org.
37 /* This file is completely threadsafe - keep it that way! */
50 #include "gromacs/fileio/confio.h"
51 #include "gromacs/gmxpreprocess/gpp_nextnb.h"
52 #include "gromacs/gmxpreprocess/pgutil.h"
53 #include "gromacs/gmxpreprocess/resall.h"
54 #include "gromacs/gmxpreprocess/topio.h"
55 #include "gromacs/gmxpreprocess/toputil.h"
56 #include "gromacs/legacyheaders/types/ifunc.h"
57 #include "gromacs/math/vec.h"
58 #include "gromacs/utility/cstringutil.h"
59 #include "gromacs/utility/fatalerror.h"
60 #include "gromacs/utility/smalloc.h"
62 #define DIHEDRAL_WAS_SET_IN_RTP 0
63 static gmx_bool
was_dihedral_set_in_rtp(t_param
*dih
)
65 return dih
->c
[MAXFORCEPARAM
-1] == DIHEDRAL_WAS_SET_IN_RTP
;
68 typedef gmx_bool (*peq
)(t_param
*p1
, t_param
*p2
);
70 static int acomp(const void *a1
, const void *a2
)
77 if ((ac
= (p1
->aj()-p2
->aj())) != 0)
81 else if ((ac
= (p1
->ai()-p2
->ai())) != 0)
87 return (p1
->ak()-p2
->ak());
91 static int pcomp(const void *a1
, const void *a2
)
98 if ((pc
= (p1
->ai()-p2
->ai())) != 0)
104 return (p1
->aj()-p2
->aj());
108 static int dcomp(const void *d1
, const void *d2
)
115 /* First sort by J & K (the two central) atoms */
116 if ((dc
= (p1
->aj()-p2
->aj())) != 0)
120 else if ((dc
= (p1
->ak()-p2
->ak())) != 0)
124 /* Then make sure to put rtp dihedrals before generated ones */
125 else if (was_dihedral_set_in_rtp(p1
) &&
126 !was_dihedral_set_in_rtp(p2
))
130 else if (!was_dihedral_set_in_rtp(p1
) &&
131 was_dihedral_set_in_rtp(p2
))
135 /* Finally, sort by I and J (two outer) atoms */
136 else if ((dc
= (p1
->ai()-p2
->ai())) != 0)
142 return (p1
->al()-p2
->al());
147 static gmx_bool
is_dihedral_on_same_bond(t_param
*p1
, t_param
*p2
)
149 if (((p1
->aj() == p2
->aj()) && (p1
->ak() == p2
->ak())) ||
150 ((p1
->aj() == p2
->ak()) && (p1
->ak() == p2
->aj())))
161 static gmx_bool
preq(t_param
*p1
, t_param
*p2
)
163 if ((p1
->ai() == p2
->ai()) && (p1
->aj() == p2
->aj()))
173 static void rm2par(t_param p
[], int *np
, peq eq
)
186 for (i
= 1; (i
< (*np
)); i
++)
188 if (!eq(&p
[i
], &p
[i
-1]))
193 /* Index now holds pointers to all the non-equal params,
194 * this only works when p is sorted of course
196 for (i
= 0; (i
< nind
); i
++)
198 for (j
= 0; (j
< MAXATOMLIST
); j
++)
200 p
[i
].a
[j
] = p
[index
[i
]].a
[j
];
202 for (j
= 0; (j
< MAXFORCEPARAM
); j
++)
204 p
[i
].c
[j
] = p
[index
[i
]].c
[j
];
206 if (p
[index
[i
]].a
[0] == p
[index
[i
]].a
[1])
211 "Something VERY strange is going on in rm2par (gen_ad.c)\n"
212 "a[0] %d a[1] %d a[2] %d a[3] %d\n",
213 p
[i
].a
[0], p
[i
].a
[1], p
[i
].a
[2], p
[i
].a
[3]);
217 else if (index
[i
] > i
)
219 /* Copy the string only if it comes from somewhere else
220 * otherwise we will end up copying a random (newly freed) pointer.
221 * Since the index is sorted we only have to test for index[i] > i.
223 strcpy(p
[i
].s
, p
[index
[i
]].s
);
231 static void cppar(t_param p
[], int np
, t_params plist
[], int ftype
)
233 int i
, j
, nral
, nrfp
;
242 for (i
= 0; (i
< np
); i
++)
244 for (j
= 0; (j
< nral
); j
++)
246 ps
->param
[ps
->nr
].a
[j
] = p
[i
].a
[j
];
248 for (j
= 0; (j
< nrfp
); j
++)
250 ps
->param
[ps
->nr
].c
[j
] = p
[i
].c
[j
];
252 for (j
= 0; (j
< MAXSLEN
); j
++)
254 ps
->param
[ps
->nr
].s
[j
] = p
[i
].s
[j
];
260 static void cpparam(t_param
*dest
, t_param
*src
)
264 for (j
= 0; (j
< MAXATOMLIST
); j
++)
266 dest
->a
[j
] = src
->a
[j
];
268 for (j
= 0; (j
< MAXFORCEPARAM
); j
++)
270 dest
->c
[j
] = src
->c
[j
];
272 for (j
= 0; (j
< MAXSLEN
); j
++)
274 dest
->s
[j
] = src
->s
[j
];
278 static void set_p(t_param
*p
, atom_id ai
[4], real
*c
, char *s
)
282 for (j
= 0; (j
< 4); j
++)
286 for (j
= 0; (j
< MAXFORCEPARAM
); j
++)
301 static int int_comp(const void *a
, const void *b
)
303 return (*(int *)a
) - (*(int *)b
);
306 static int atom_id_comp(const void *a
, const void *b
)
308 return (*(atom_id
*)a
) - (*(atom_id
*)b
);
311 static int eq_imp(atom_id a1
[], atom_id a2
[])
316 for (j
= 0; (j
< 4); j
++)
321 qsort(b1
, 4, (size_t)sizeof(b1
[0]), int_comp
);
322 qsort(b2
, 4, (size_t)sizeof(b2
[0]), int_comp
);
324 for (j
= 0; (j
< 4); j
++)
335 static int idcomp(const void *a
, const void *b
)
342 if ((d
= (pa
->a
[0]-pb
->a
[0])) != 0)
346 else if ((d
= (pa
->a
[3]-pb
->a
[3])) != 0)
350 else if ((d
= (pa
->a
[1]-pb
->a
[1])) != 0)
356 return (int) (pa
->a
[2]-pb
->a
[2]);
360 static void sort_id(int nr
, t_param ps
[])
364 /* First swap order of atoms around if necessary */
365 for (i
= 0; (i
< nr
); i
++)
367 if (ps
[i
].a
[3] < ps
[i
].a
[0])
369 tmp
= ps
[i
].a
[3]; ps
[i
].a
[3] = ps
[i
].a
[0]; ps
[i
].a
[0] = tmp
;
370 tmp
= ps
[i
].a
[2]; ps
[i
].a
[2] = ps
[i
].a
[1]; ps
[i
].a
[1] = tmp
;
376 qsort(ps
, nr
, (size_t)sizeof(ps
[0]), idcomp
);
380 static int n_hydro(atom_id a
[], char ***atomname
)
385 for (i
= 0; (i
< 4); i
+= 3)
387 aname
= *atomname
[a
[i
]];
388 c0
= toupper(aname
[0]);
393 else if (((int)strlen(aname
) > 1) && (c0
>= '0') && (c0
<= '9'))
395 c1
= toupper(aname
[1]);
405 /* Clean up the dihedrals (both generated and read from the .rtp
407 static void clean_dih(t_param
*dih
, int *ndih
, t_param improper
[], int nimproper
,
408 t_atoms
*atoms
, gmx_bool bKeepAllGeneratedDihedrals
,
409 gmx_bool bRemoveDihedralIfWithImproper
)
414 /* Construct the list of the indices of the dihedrals
415 * (i.e. generated or read) that might be kept. */
416 snew(index
, *ndih
+1);
417 if (bKeepAllGeneratedDihedrals
)
419 fprintf(stderr
, "Keeping all generated dihedrals\n");
421 for (i
= 0; i
< nind
; i
++)
430 /* Check if generated dihedral i should be removed. The
431 * dihedrals have been sorted by dcomp() above, so all those
432 * on the same two central atoms are together, with those from
433 * the .rtp file preceding those that were automatically
434 * generated. We remove the latter if the former exist. */
435 for (i
= 0; i
< *ndih
; i
++)
437 /* Keep the dihedrals that were defined in the .rtp file,
438 * and the dihedrals that were generated and different
439 * from the last one (whether it was generated or not). */
440 if (was_dihedral_set_in_rtp(&dih
[i
]) ||
442 !is_dihedral_on_same_bond(&dih
[i
], &dih
[i
-1]))
451 for (i
= 0; i
< nind
; i
++)
453 gmx_bool bWasSetInRTP
= was_dihedral_set_in_rtp(&dih
[index
[i
]]);
454 gmx_bool bKeep
= TRUE
;
455 if (!bWasSetInRTP
&& bRemoveDihedralIfWithImproper
)
457 /* Remove the dihedral if there is an improper on the same
459 for (j
= 0; j
< nimproper
&& bKeep
; j
++)
461 bKeep
= !is_dihedral_on_same_bond(&dih
[index
[i
]], &improper
[j
]);
467 /* If we don't want all dihedrals, we want to select the
468 * ones with the fewest hydrogens. Note that any generated
469 * dihedrals on the same bond as an .rtp dihedral may have
470 * been already pruned above in the construction of
471 * index[]. However, their parameters are still present,
472 * and l is looping over this dihedral and all of its
473 * pruned siblings. */
474 int bestl
= index
[i
];
475 if (!bKeepAllGeneratedDihedrals
&& !bWasSetInRTP
)
477 /* Minimum number of hydrogens for i and l atoms */
481 is_dihedral_on_same_bond(&dih
[index
[i
]], &dih
[l
]));
484 int nh
= n_hydro(dih
[l
].a
, atoms
->atomname
);
498 cpparam(&dih
[k
], &dih
[bestl
]);
504 for (i
= k
; i
< *ndih
; i
++)
506 strcpy(dih
[i
].s
, "");
513 static int get_impropers(t_atoms
*atoms
, t_hackblock hb
[], t_param
**improper
,
514 gmx_bool bAllowMissing
)
516 t_rbondeds
*impropers
;
517 int nimproper
, i
, j
, k
, start
, ninc
, nalloc
;
518 atom_id ai
[MAXATOMLIST
];
523 snew(*improper
, nalloc
);
525 /* Add all the impropers from the residue database to the list. */
530 for (i
= 0; (i
< atoms
->nres
); i
++)
532 impropers
= &hb
[i
].rb
[ebtsIDIHS
];
533 for (j
= 0; (j
< impropers
->nb
); j
++)
536 for (k
= 0; (k
< 4) && !bStop
; k
++)
538 ai
[k
] = search_atom(impropers
->b
[j
].a
[k
], start
,
540 "improper", bAllowMissing
);
541 if (ai
[k
] == NO_ATID
)
548 if (nimproper
== nalloc
)
551 srenew(*improper
, nalloc
);
554 set_p(&((*improper
)[nimproper
]), ai
, NULL
, impropers
->b
[j
].s
);
558 while ((start
< atoms
->nr
) && (atoms
->atom
[start
].resind
== i
))
568 static int nb_dist(t_nextnb
*nnb
, int ai
, int aj
)
580 nrexcl
= nnb
->nrexcl
[ai
];
581 for (nre
= 1; (nre
< nnb
->nrex
); nre
++)
584 for (nrx
= 0; (nrx
< nrexcl
[nre
]); nrx
++)
586 if ((aj
== a
[nrx
]) && (NRE
== -1))
595 gmx_bool
is_hydro(t_atoms
*atoms
, int ai
)
597 return ((*(atoms
->atomname
[ai
]))[0] == 'H');
600 static void get_atomnames_min(int n
, char **anm
,
601 int resind
, t_atoms
*atoms
, atom_id
*a
)
605 /* Assume ascending residue numbering */
606 for (m
= 0; m
< n
; m
++)
608 if (atoms
->atom
[a
[m
]].resind
< resind
)
612 else if (atoms
->atom
[a
[m
]].resind
> resind
)
620 strcat(anm
[m
], *(atoms
->atomname
[a
[m
]]));
624 static void gen_excls(t_atoms
*atoms
, t_excls
*excls
, t_hackblock hb
[],
625 gmx_bool bAllowMissing
)
628 atom_id a
, astart
, i1
, i2
, itmp
;
634 for (a
= 0; a
< atoms
->nr
; a
++)
636 r
= atoms
->atom
[a
].resind
;
637 if (a
== atoms
->nr
-1 || atoms
->atom
[a
+1].resind
!= r
)
639 hbexcl
= &hb
[r
].rb
[ebtsEXCLS
];
641 for (e
= 0; e
< hbexcl
->nb
; e
++)
643 anm
= hbexcl
->b
[e
].a
[0];
644 i1
= search_atom(anm
, astart
, atoms
,
645 "exclusion", bAllowMissing
);
646 anm
= hbexcl
->b
[e
].a
[1];
647 i2
= search_atom(anm
, astart
, atoms
,
648 "exclusion", bAllowMissing
);
649 if (i1
!= NO_ATID
&& i2
!= NO_ATID
)
657 srenew(excls
[i1
].e
, excls
[i1
].nr
+1);
658 excls
[i1
].e
[excls
[i1
].nr
] = i2
;
667 for (a
= 0; a
< atoms
->nr
; a
++)
671 qsort(excls
[a
].e
, excls
[a
].nr
, (size_t)sizeof(atom_id
), atom_id_comp
);
676 static void remove_excl(t_excls
*excls
, int remove
)
680 for (i
= remove
+1; i
< excls
->nr
; i
++)
682 excls
->e
[i
-1] = excls
->e
[i
];
688 void clean_excls(t_nextnb
*nnb
, int nrexcl
, t_excls excls
[])
690 int i
, j
, j1
, k
, k1
, l
, l1
, e
;
695 /* extract all i-j-k-l neighbours from nnb struct */
696 for (i
= 0; (i
< nnb
->nr
); i
++)
698 /* For all particles */
701 for (j
= 0; (j
< nnb
->nrexcl
[i
][1]); j
++)
703 /* For all first neighbours */
704 j1
= nnb
->a
[i
][1][j
];
706 for (e
= 0; e
< excl
->nr
; e
++)
708 if (excl
->e
[e
] == j1
)
710 remove_excl(excl
, e
);
716 for (k
= 0; (k
< nnb
->nrexcl
[j1
][1]); k
++)
718 /* For all first neighbours of j1 */
719 k1
= nnb
->a
[j1
][1][k
];
721 for (e
= 0; e
< excl
->nr
; e
++)
723 if (excl
->e
[e
] == k1
)
725 remove_excl(excl
, e
);
731 for (l
= 0; (l
< nnb
->nrexcl
[k1
][1]); l
++)
733 /* For all first neighbours of k1 */
734 l1
= nnb
->a
[k1
][1][l
];
736 for (e
= 0; e
< excl
->nr
; e
++)
738 if (excl
->e
[e
] == l1
)
740 remove_excl(excl
, e
);
752 void generate_excls(t_nextnb
*nnb
, int nrexcl
, t_excls excls
[])
757 for (N
= 1; (N
< std::min(nrexcl
, nnb
->nrex
)); N
++)
759 /* extract all i-j-k-l neighbours from nnb struct */
760 for (i
= 0; (i
< nnb
->nr
); i
++)
762 /* For all particles */
765 excl
->nr
+= nnb
->nrexcl
[i
][N
];
766 srenew(excl
->e
, excl
->nr
);
767 for (j
= 0; (j
< nnb
->nrexcl
[i
][N
]); j
++)
769 /* For all first neighbours */
770 if (nnb
->a
[i
][N
][j
] != i
)
772 excl
->e
[n
++] = nnb
->a
[i
][N
][j
];
779 /* Generate pairs, angles and dihedrals from .rtp settings */
780 void gen_pad(t_nextnb
*nnb
, t_atoms
*atoms
, t_restp rtp
[],
781 t_params plist
[], t_excls excls
[], t_hackblock hb
[],
782 gmx_bool bAllowMissing
)
784 t_param
*ang
, *dih
, *pai
, *improper
;
785 t_rbondeds
*hbang
, *hbdih
;
788 int res
, minres
, maxres
;
789 int i
, j
, j1
, k
, k1
, l
, l1
, m
, n
, i1
, i2
;
790 int ninc
, maxang
, maxdih
, maxpai
;
791 int nang
, ndih
, npai
, nimproper
, nbd
;
793 gmx_bool bFound
, bExcl
;
795 /* These are the angles, dihedrals and pairs that we generate
796 * from the bonds. The ones that are already there from the rtp file
803 maxang
= maxdih
= maxpai
= ninc
;
809 for (i
= 0; i
< 4; i
++)
816 gen_excls(atoms
, excls
, hb
, bAllowMissing
);
817 /* mark all entries as not matched yet */
818 for (i
= 0; i
< atoms
->nres
; i
++)
820 for (j
= 0; j
< ebtsNR
; j
++)
822 for (k
= 0; k
< hb
[i
].rb
[j
].nb
; k
++)
824 hb
[i
].rb
[j
].b
[k
].match
= FALSE
;
830 /* Extract all i-j-k-l neighbours from nnb struct to generate all
831 * angles and dihedrals. */
832 for (i
= 0; (i
< nnb
->nr
); i
++)
834 /* For all particles */
835 for (j
= 0; (j
< nnb
->nrexcl
[i
][1]); j
++)
837 /* For all first neighbours */
838 j1
= nnb
->a
[i
][1][j
];
839 for (k
= 0; (k
< nnb
->nrexcl
[j1
][1]); k
++)
841 /* For all first neighbours of j1 */
842 k1
= nnb
->a
[j1
][1][k
];
845 /* Generate every angle only once */
856 ang
[nang
].c0() = NOTSET
;
857 ang
[nang
].c1() = NOTSET
;
858 set_p_string(&(ang
[nang
]), "");
861 minres
= atoms
->atom
[ang
[nang
].a
[0]].resind
;
863 for (m
= 1; m
< 3; m
++)
865 minres
= std::min(minres
, atoms
->atom
[ang
[nang
].a
[m
]].resind
);
866 maxres
= std::max(maxres
, atoms
->atom
[ang
[nang
].a
[m
]].resind
);
868 res
= 2*minres
-maxres
;
871 res
+= maxres
-minres
;
872 get_atomnames_min(3, anm
, res
, atoms
, ang
[nang
].a
);
873 hbang
= &hb
[res
].rb
[ebtsANGLES
];
874 for (l
= 0; (l
< hbang
->nb
); l
++)
876 if (strcmp(anm
[1], hbang
->b
[l
].aj()) == 0)
879 for (m
= 0; m
< 3; m
+= 2)
882 ((strcmp(anm
[m
], hbang
->b
[l
].ai()) == 0) &&
883 (strcmp(anm
[2-m
], hbang
->b
[l
].ak()) == 0)));
887 set_p_string(&(ang
[nang
]), hbang
->b
[l
].s
);
888 /* Mark that we found a match for this entry */
889 hbang
->b
[l
].match
= TRUE
;
894 while (res
< maxres
);
898 /* Generate every dihedral, 1-4 exclusion and 1-4 interaction
902 for (l
= 0; (l
< nnb
->nrexcl
[k1
][1]); l
++)
904 /* For all first neighbours of k1 */
905 l1
= nnb
->a
[k1
][1][l
];
906 if ((l1
!= i
) && (l1
!= j1
))
917 for (m
= 0; m
< MAXFORCEPARAM
; m
++)
919 dih
[ndih
].c
[m
] = NOTSET
;
921 set_p_string(&(dih
[ndih
]), "");
925 minres
= atoms
->atom
[dih
[ndih
].a
[0]].resind
;
927 for (m
= 1; m
< 4; m
++)
929 minres
= std::min(minres
, atoms
->atom
[dih
[ndih
].a
[m
]].resind
);
930 maxres
= std::max(maxres
, atoms
->atom
[dih
[ndih
].a
[m
]].resind
);
932 res
= 2*minres
-maxres
;
935 res
+= maxres
-minres
;
936 get_atomnames_min(4, anm
, res
, atoms
, dih
[ndih
].a
);
937 hbdih
= &hb
[res
].rb
[ebtsPDIHS
];
938 for (n
= 0; (n
< hbdih
->nb
); n
++)
941 for (m
= 0; m
< 2; m
++)
944 ((strcmp(anm
[3*m
], hbdih
->b
[n
].ai()) == 0) &&
945 (strcmp(anm
[1+m
], hbdih
->b
[n
].aj()) == 0) &&
946 (strcmp(anm
[2-m
], hbdih
->b
[n
].ak()) == 0) &&
947 (strcmp(anm
[3-3*m
], hbdih
->b
[n
].al()) == 0)));
951 set_p_string(&dih
[ndih
], hbdih
->b
[n
].s
);
952 /* Mark that we found a match for this entry */
953 hbdih
->b
[n
].match
= TRUE
;
955 /* Set the last parameter to be able to see
956 if the dihedral was in the rtp list.
958 dih
[ndih
].c
[MAXFORCEPARAM
-1] = DIHEDRAL_WAS_SET_IN_RTP
;
961 /* Set the next direct in case the rtp contains
962 multiple entries for this dihedral.
973 for (m
= 0; m
< MAXFORCEPARAM
; m
++)
975 dih
[ndih
].c
[m
] = NOTSET
;
980 while (res
< maxres
);
993 for (m
= 0; m
< MAXFORCEPARAM
; m
++)
995 dih
[ndih
].c
[m
] = NOTSET
;
997 set_p_string(&(dih
[ndih
]), "");
1001 nbd
= nb_dist(nnb
, i
, l1
);
1004 fprintf(debug
, "Distance (%d-%d) = %d\n", i
+1, l1
+1, nbd
);
1008 i1
= std::min(i
, l1
);
1009 i2
= std::max(i
, l1
);
1011 for (m
= 0; m
< excls
[i1
].nr
; m
++)
1013 bExcl
= bExcl
|| excls
[i1
].e
[m
] == i2
;
1017 if (rtp
[0].bGenerateHH14Interactions
||
1018 !(is_hydro(atoms
, i1
) && is_hydro(atoms
, i2
)))
1023 srenew(pai
, maxpai
);
1025 pai
[npai
].ai() = i1
;
1026 pai
[npai
].aj() = i2
;
1027 pai
[npai
].c0() = NOTSET
;
1028 pai
[npai
].c1() = NOTSET
;
1029 set_p_string(&(pai
[npai
]), "");
1044 /* The above approach is great in that we double-check that e.g. an angle
1045 * really corresponds to three atoms connected by bonds, but this is not
1046 * generally true. Go through the angle and dihedral hackblocks to add
1047 * entries that we have not yet marked as matched when going through bonds.
1049 for (i
= 0; i
< atoms
->nres
; i
++)
1051 /* Add remaining angles from hackblock */
1052 hbang
= &hb
[i
].rb
[ebtsANGLES
];
1053 for (j
= 0; j
< hbang
->nb
; j
++)
1055 if (hbang
->b
[j
].match
== TRUE
)
1057 /* We already used this entry, continue to the next */
1060 /* Hm - entry not used, let's see if we can find all atoms */
1064 srenew(ang
, maxang
);
1067 for (k
= 0; k
< 3 && bFound
; k
++)
1069 p
= hbang
->b
[j
].a
[k
];
1076 else if (p
[0] == '+')
1081 ang
[nang
].a
[k
] = search_res_atom(p
, res
, atoms
, "angle", TRUE
);
1082 bFound
= (ang
[nang
].a
[k
] != NO_ATID
);
1084 ang
[nang
].c0() = NOTSET
;
1085 ang
[nang
].c1() = NOTSET
;
1089 set_p_string(&(ang
[nang
]), hbang
->b
[j
].s
);
1090 hbang
->b
[j
].match
= TRUE
;
1091 /* Incrementing nang means we save this angle */
1096 /* Add remaining dihedrals from hackblock */
1097 hbdih
= &hb
[i
].rb
[ebtsPDIHS
];
1098 for (j
= 0; j
< hbdih
->nb
; j
++)
1100 if (hbdih
->b
[j
].match
== TRUE
)
1102 /* We already used this entry, continue to the next */
1105 /* Hm - entry not used, let's see if we can find all atoms */
1109 srenew(dih
, maxdih
);
1112 for (k
= 0; k
< 4 && bFound
; k
++)
1114 p
= hbdih
->b
[j
].a
[k
];
1121 else if (p
[0] == '+')
1126 dih
[ndih
].a
[k
] = search_res_atom(p
, res
, atoms
, "dihedral", TRUE
);
1127 bFound
= (dih
[ndih
].a
[k
] != NO_ATID
);
1129 for (m
= 0; m
< MAXFORCEPARAM
; m
++)
1131 dih
[ndih
].c
[m
] = NOTSET
;
1136 set_p_string(&(dih
[ndih
]), hbdih
->b
[j
].s
);
1137 hbdih
->b
[j
].match
= TRUE
;
1138 /* Incrementing ndih means we save this dihedral */
1145 /* Sort angles with respect to j-i-k (middle atom first) */
1148 qsort(ang
, nang
, (size_t)sizeof(ang
[0]), acomp
);
1151 /* Sort dihedrals with respect to j-k-i-l (middle atoms first) */
1154 qsort(dih
, ndih
, (size_t)sizeof(dih
[0]), dcomp
);
1157 /* Sort the pairs */
1160 qsort(pai
, npai
, (size_t)sizeof(pai
[0]), pcomp
);
1164 /* Remove doubles, could occur in 6-rings, such as phenyls,
1165 maybe one does not want this when fudgeQQ < 1.
1167 fprintf(stderr
, "Before cleaning: %d pairs\n", npai
);
1168 rm2par(pai
, &npai
, preq
);
1171 /* Get the impropers from the database */
1172 nimproper
= get_impropers(atoms
, hb
, &improper
, bAllowMissing
);
1174 /* Sort the impropers */
1175 sort_id(nimproper
, improper
);
1179 fprintf(stderr
, "Before cleaning: %d dihedrals\n", ndih
);
1180 clean_dih(dih
, &ndih
, improper
, nimproper
, atoms
,
1181 rtp
[0].bKeepAllGeneratedDihedrals
,
1182 rtp
[0].bRemoveDihedralIfWithImproper
);
1185 /* Now we have unique lists of angles and dihedrals
1186 * Copy them into the destination struct
1188 cppar(ang
, nang
, plist
, F_ANGLES
);
1189 cppar(dih
, ndih
, plist
, F_PDIHS
);
1190 cppar(improper
, nimproper
, plist
, F_IDIHS
);
1191 cppar(pai
, npai
, plist
, F_LJ14
);
1193 /* Remove all exclusions which are within nrexcl */
1194 clean_excls(nnb
, rtp
[0].nrexcl
, excls
);