2 * This file is part of the GROMACS molecular simulation package.
4 * Copyright (c) 2009,2010,2011,2012, by the GROMACS development team, led by
5 * David van der Spoel, Berk Hess, Erik Lindahl, and including many
6 * others, as listed in the AUTHORS file in the top-level source
7 * directory and at http://www.gromacs.org.
9 * GROMACS is free software; you can redistribute it and/or
10 * modify it under the terms of the GNU Lesser General Public License
11 * as published by the Free Software Foundation; either version 2.1
12 * of the License, or (at your option) any later version.
14 * GROMACS is distributed in the hope that it will be useful,
15 * but WITHOUT ANY WARRANTY; without even the implied warranty of
16 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
17 * Lesser General Public License for more details.
19 * You should have received a copy of the GNU Lesser General Public
20 * License along with GROMACS; if not, see
21 * http://www.gnu.org/licenses, or write to the Free Software Foundation,
22 * Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
24 * If you want to redistribute modifications to GROMACS, please
25 * consider that scientific software is very special. Version
26 * control is crucial - bugs must be traceable. We will be happy to
27 * consider code for inclusion in the official distribution, but
28 * derived work must not be called official GROMACS. Details are found
29 * in the README & COPYING files - if they are missing, get the
30 * official version at http://www.gromacs.org.
32 * To help us fund GROMACS development, we humbly ask that you cite
33 * the research papers on the package. Check out http://www.gromacs.org.
37 * Implements functions in indexutil.h.
39 * \author Teemu Murtola <teemu.murtola@gmail.com>
40 * \ingroup module_selection
42 #include "gromacs/legacyheaders/index.h"
43 #include "gromacs/legacyheaders/gmx_fatal.h"
44 #include "gromacs/legacyheaders/smalloc.h"
45 #include "gromacs/legacyheaders/string2.h"
46 #include "gromacs/legacyheaders/typedefs.h"
48 #include "gromacs/selection/indexutil.h"
50 /********************************************************************
51 * gmx_ana_indexgrps_t functions
52 ********************************************************************/
55 * Stores a set of index groups.
57 struct gmx_ana_indexgrps_t
59 /** Number of index groups. */
61 /** Array of index groups. */
66 * \param[out] g Index group structure.
67 * \param[in] ngrps Number of groups for which memory is allocated.
70 gmx_ana_indexgrps_alloc(gmx_ana_indexgrps_t **g, int ngrps)
78 * \param[out] g Index group structure.
79 * \param[in] top Topology structure.
80 * \param[in] fnm File name for the index file.
81 * Memory is automatically allocated.
83 * One or both of \p top or \p fnm can be NULL.
84 * If \p top is NULL, an index file is required and the groups are read
85 * from the file (uses Gromacs routine init_index()).
86 * If \p fnm is NULL, default groups are constructed based on the
87 * topology (uses Gromacs routine analyse()).
88 * If both are null, the index group structure is initialized empty.
91 gmx_ana_indexgrps_init(gmx_ana_indexgrps_t **g, t_topology *top,
94 t_blocka *block = NULL;
100 block = init_index(fnm, &names);
104 block = new_blocka();
105 analyse(&top->atoms, block, &names, FALSE, FALSE);
115 gmx_ana_indexgrps_alloc(g, block->nr);
116 for (i = 0; i < block->nr; ++i)
118 gmx_ana_index_t *grp = &(*g)->g[i];
120 grp->isize = block->index[i+1] - block->index[i];
121 snew(grp->index, grp->isize);
122 for (j = 0; j < grp->isize; ++j)
124 grp->index[j] = block->a[block->index[i]+j];
126 grp->name = names[i];
127 grp->nalloc_index = grp->isize;
136 * \param[in] g Index groups structure.
138 * The pointer \p g is invalid after the call.
141 gmx_ana_indexgrps_free(gmx_ana_indexgrps_t *g)
150 for (i = 0; i < g->nr; ++i)
152 gmx_ana_index_deinit(&g->g[i]);
161 * \param[out] dest Destination index groups.
162 * \param[in] src Source index groups.
164 * A deep copy is made for all fields, including the group names.
167 gmx_ana_indexgrps_clone(gmx_ana_indexgrps_t **dest, gmx_ana_indexgrps_t *src)
171 gmx_ana_indexgrps_alloc(dest, src->nr);
172 for (g = 0; g < src->nr; ++g)
174 gmx_ana_index_copy(&(*dest)->g[g], &src->g[g], true);
179 * \param[out] g Index group structure.
180 * \returns true if \p g is empty, i.e., has 0 index groups.
183 gmx_ana_indexgrps_is_empty(gmx_ana_indexgrps_t *g)
189 * \param[in] g Index groups structure.
190 * \param[in] n Index group number to get.
191 * \returns Pointer to the \p n'th index group in \p g.
193 * The returned pointer should not be freed.
196 gmx_ana_indexgrps_get_grp(gmx_ana_indexgrps_t *g, int n)
198 if (n < 0 || n >= g->nr)
206 * \param[out] dest Output structure.
207 * \param[in] src Input index groups.
208 * \param[in] n Number of the group to extract.
209 * \returns true if \p n is a valid group in \p src, false otherwise.
212 gmx_ana_indexgrps_extract(gmx_ana_index_t *dest, gmx_ana_indexgrps_t *src, int n)
214 if (n < 0 || n >= src->nr)
220 gmx_ana_index_copy(dest, &src->g[n], true);
225 * \param[out] dest Output structure.
226 * \param[in] src Input index groups.
227 * \param[in] name Name (or part of the name) of the group to extract.
228 * \returns true if \p name is a valid group in \p src, false otherwise.
230 * Uses the Gromacs routine find_group() to find the actual group;
231 * the comparison is case-insensitive.
234 gmx_ana_indexgrps_find(gmx_ana_index_t *dest, gmx_ana_indexgrps_t *src, char *name)
239 snew(names, src->nr);
240 for (i = 0; i < src->nr; ++i)
242 names[i] = src->g[i].name;
244 i = find_group(name, src->nr, names);
252 return gmx_ana_indexgrps_extract(dest, src, i);
256 * \param[in] fp Where to print the output.
257 * \param[in] g Index groups to print.
258 * \param[in] maxn Maximum number of indices to print
259 * (-1 = print all, 0 = print only names).
262 gmx_ana_indexgrps_print(FILE *fp, gmx_ana_indexgrps_t *g, int maxn)
266 for (i = 0; i < g->nr; ++i)
268 fprintf(fp, " %2d: ", i);
269 gmx_ana_index_dump(fp, &g->g[i], i, maxn);
273 /********************************************************************
274 * gmx_ana_index_t functions
275 ********************************************************************/
278 * \param[in,out] g Index group structure.
279 * \param[in] isize Maximum number of atoms to reserve space for.
282 gmx_ana_index_reserve(gmx_ana_index_t *g, int isize)
284 if (g->nalloc_index < isize)
286 srenew(g->index, isize);
287 g->nalloc_index = isize;
292 * \param[in,out] g Index group structure.
294 * Resizes the memory allocated for holding the indices such that the
295 * current contents fit.
298 gmx_ana_index_squeeze(gmx_ana_index_t *g)
300 srenew(g->index, g->isize);
301 g->nalloc_index = g->isize;
305 * \param[out] g Output structure.
307 * Any contents of \p g are discarded without freeing.
310 gmx_ana_index_clear(gmx_ana_index_t *g)
319 * \param[out] g Output structure.
320 * \param[in] isize Number of atoms in the new group.
321 * \param[in] index Array of \p isize atoms (can be NULL if \p isize is 0).
322 * \param[in] name Name for the new group (can be NULL).
323 * \param[in] nalloc Number of elements allocated for \p index
324 * (if 0, \p index is not freed in gmx_ana_index_deinit())
326 * No copy if \p index is made.
329 gmx_ana_index_set(gmx_ana_index_t *g, int isize, atom_id *index, char *name,
335 g->nalloc_index = nalloc;
339 * \param[out] g Output structure.
340 * \param[in] natoms Number of atoms.
341 * \param[in] name Name for the new group (can be NULL).
344 gmx_ana_index_init_simple(gmx_ana_index_t *g, int natoms, char *name)
349 snew(g->index, natoms);
350 for (i = 0; i < natoms; ++i)
355 g->nalloc_index = natoms;
359 * \param[in] g Index group structure.
361 * The pointer \p g is not freed.
364 gmx_ana_index_deinit(gmx_ana_index_t *g)
366 if (g->nalloc_index > 0)
371 gmx_ana_index_clear(g);
375 * \param[out] dest Destination index group.
376 * \param[in] src Source index group.
377 * \param[in] bAlloc If true, memory is allocated at \p dest; otherwise,
378 * it is assumed that enough memory has been allocated for index.
380 * A deep copy of the name is only made if \p bAlloc is true.
383 gmx_ana_index_copy(gmx_ana_index_t *dest, gmx_ana_index_t *src, bool bAlloc)
385 dest->isize = src->isize;
390 snew(dest->index, dest->isize);
391 dest->nalloc_index = dest->isize;
393 memcpy(dest->index, src->index, dest->isize*sizeof(*dest->index));
395 if (bAlloc && src->name)
397 dest->name = strdup(src->name);
399 else if (bAlloc || src->name)
401 dest->name = src->name;
406 * \param[in] fp Where to print the output.
407 * \param[in] g Index group to print.
408 * \param[in] i Group number to use if the name is NULL.
409 * \param[in] maxn Maximum number of indices to print (-1 = print all).
412 gmx_ana_index_dump(FILE *fp, gmx_ana_index_t *g, int i, int maxn)
418 fprintf(fp, "\"%s\"", g->name);
422 fprintf(fp, "Group %d", i+1);
424 fprintf(fp, " (%d atoms)", g->isize);
429 if (maxn >= 0 && n > maxn)
433 for (j = 0; j < n; ++j)
435 fprintf(fp, " %d", g->index[j]+1);
446 * \param[in] g Input index group.
447 * \param[in] natoms Number of atoms to check against.
449 * If any atom index in the index group is less than zero or >= \p natoms,
450 * gmx_fatal() is called.
453 gmx_ana_index_check(gmx_ana_index_t *g, int natoms)
457 for (j = 0; j < g->isize; ++j)
459 if (g->index[j] >= natoms)
461 gmx_fatal(FARGS, "Atom index (%d) in index group %s (%d atoms) "
462 "larger than number of atoms in trajectory (%d atoms)",
463 g->index[j], g->name, g->isize, natoms);
465 else if (g->index[j] < 0)
467 gmx_fatal(FARGS, "Atom index (%d) in index group %s (%d atoms) "
469 g->index[j], g->name, g->isize);
475 * \param[in] g Index group to check.
476 * \returns true if the index group is sorted and has no duplicates,
480 gmx_ana_index_check_sorted(gmx_ana_index_t *g)
484 for (i = 0; i < g->isize-1; ++i)
486 if (g->index[i+1] <= g->index[i])
494 /********************************************************************
496 ********************************************************************/
498 /** Helper function for gmx_ana_index_sort(). */
500 cmp_atomid(const void *a, const void *b)
502 if (*(atom_id *)a < *(atom_id *)b)
506 if (*(atom_id *)a > *(atom_id *)b)
514 * \param[in,out] g Index group to be sorted.
517 gmx_ana_index_sort(gmx_ana_index_t *g)
519 qsort(g->index, g->isize, sizeof(*g->index), cmp_atomid);
523 * \param[in] a Index group to check.
524 * \param[in] b Index group to check.
525 * \returns true if \p a and \p b are equal, false otherwise.
528 gmx_ana_index_equals(gmx_ana_index_t *a, gmx_ana_index_t *b)
532 if (a->isize != b->isize)
536 for (i = 0; i < a->isize; ++i)
538 if (a->index[i] != b->index[i])
547 * \param[in] a Index group to check against.
548 * \param[in] b Index group to check.
549 * \returns true if \p b is contained in \p a,
552 * If the elements are not in the same order in both groups, the function
553 * fails. However, the groups do not need to be sorted.
556 gmx_ana_index_contains(gmx_ana_index_t *a, gmx_ana_index_t *b)
560 for (i = j = 0; j < b->isize; ++i, ++j)
562 while (i < a->isize && a->index[i] != b->index[j])
575 * \param[out] dest Output index group (the intersection of \p a and \p b).
576 * \param[in] a First index group.
577 * \param[in] b Second index group.
579 * \p dest can be the same as \p a or \p b.
582 gmx_ana_index_intersection(gmx_ana_index_t *dest,
583 gmx_ana_index_t *a, gmx_ana_index_t *b)
587 for (i = j = k = 0; i < a->isize && j < b->isize; ++i)
589 while (j < b->isize && b->index[j] < a->index[i])
593 if (j < b->isize && b->index[j] == a->index[i])
595 dest->index[k++] = b->index[j++];
602 * \param[out] dest Output index group (the difference \p a - \p b).
603 * \param[in] a First index group.
604 * \param[in] b Second index group.
606 * \p dest can equal \p a, but not \p b.
609 gmx_ana_index_difference(gmx_ana_index_t *dest,
610 gmx_ana_index_t *a, gmx_ana_index_t *b)
614 for (i = j = k = 0; i < a->isize; ++i)
616 while (j < b->isize && b->index[j] < a->index[i])
620 if (j == b->isize || b->index[j] != a->index[i])
622 dest->index[k++] = a->index[i];
629 * \param[in] a First index group.
630 * \param[in] b Second index group.
631 * \returns Size of the difference \p a - \p b.
634 gmx_ana_index_difference_size(gmx_ana_index_t *a, gmx_ana_index_t *b)
638 for (i = j = k = 0; i < a->isize; ++i)
640 while (j < b->isize && b->index[j] < a->index[i])
644 if (j == b->isize || b->index[j] != a->index[i])
653 * \param[out] dest1 Output group 1 (will equal \p g).
654 * \param[out] dest2 Output group 2 (will equal \p src - \p g).
655 * \param[in] src Group to be partitioned.
656 * \param[in] g One partition.
658 * \pre \p g is a subset of \p src and both sets are sorted
659 * \pre \p dest1 has allocated storage to store \p src
660 * \post \p dest1 == \p g
661 * \post \p dest2 == \p src - \p g
663 * No storage should be allocated for \p dest2; after the call,
664 * \p dest2->index points to the memory allocated for \p dest1
665 * (to a part that is not used by \p dest1).
667 * The calculation can be performed in-place by setting \p dest1 equal to
671 gmx_ana_index_partition(gmx_ana_index_t *dest1, gmx_ana_index_t *dest2,
672 gmx_ana_index_t *src, gmx_ana_index_t *g)
676 dest2->index = dest1->index + g->isize;
677 dest2->isize = src->isize - g->isize;
678 for (i = g->isize-1, j = src->isize-1, k = dest2->isize-1; i >= 0; --i, --j)
680 while (j >= 0 && src->index[j] != g->index[i])
682 dest2->index[k--] = src->index[j--];
687 dest2->index[k--] = src->index[j--];
689 gmx_ana_index_copy(dest1, g, false);
693 * \param[out] dest Output index group (the union of \p a and \p b).
694 * \param[in] a First index group.
695 * \param[in] b Second index group.
697 * \p a and \p b can have common items.
698 * \p dest can equal \p a or \p b.
700 * \see gmx_ana_index_merge()
703 gmx_ana_index_union(gmx_ana_index_t *dest,
704 gmx_ana_index_t *a, gmx_ana_index_t *b)
709 dsize = gmx_ana_index_difference_size(b, a);
712 dest->isize = a->isize + dsize;
713 for (k = dest->isize - 1; k >= 0; k--)
715 if (i < 0 || (j >= 0 && a->index[i] < b->index[j]))
717 dest->index[k] = b->index[j--];
721 if (j >= 0 && a->index[i] == b->index[j])
725 dest->index[k] = a->index[i--];
731 * \param[out] dest Output index group (the union of \p a and \p b).
732 * \param[in] a First index group.
733 * \param[in] b Second index group.
735 * \p a and \p b should not have common items.
736 * \p dest can equal \p a or \p b.
738 * \see gmx_ana_index_union()
741 gmx_ana_index_merge(gmx_ana_index_t *dest,
742 gmx_ana_index_t *a, gmx_ana_index_t *b)
748 dest->isize = a->isize + b->isize;
749 for (k = dest->isize - 1; k >= 0; k--)
751 if (i < 0 || (j >= 0 && a->index[i] < b->index[j]))
753 dest->index[k] = b->index[j--];
757 dest->index[k] = a->index[i--];
762 /********************************************************************
763 * gmx_ana_indexmap_t and related things
764 ********************************************************************/
767 * \param[in,out] t Output block.
768 * \param[in] top Topology structure
769 * (only used if \p type is \ref INDEX_RES or \ref INDEX_MOL, can be NULL
771 * \param[in] g Index group
772 * (can be NULL if \p type is \ref INDEX_UNKNOWN).
773 * \param[in] type Type of partitioning to make.
774 * \param[in] bComplete
775 * If true, the index group is expanded to include any residue/molecule
776 * (depending on \p type) that is partially contained in the group.
777 * If \p type is not INDEX_RES or INDEX_MOL, this has no effect.
779 * \p m should have been initialized somehow (calloc() is enough) unless
780 * \p type is INDEX_UNKNOWN.
781 * \p g should be sorted.
784 gmx_ana_index_make_block(t_blocka *t, t_topology *top, gmx_ana_index_t *g,
785 e_index_t type, bool bComplete)
790 if (type == INDEX_UNKNOWN)
803 /* bComplete only does something for INDEX_RES or INDEX_MOL, so turn it
805 if (type != INDEX_RES && type != INDEX_MOL)
809 /* Allocate memory for the atom array and fill it unless we are using
814 /* We may allocate some extra memory here because we don't know in
815 * advance how much will be needed. */
816 if (t->nalloc_a < top->atoms.nr)
818 srenew(t->a, top->atoms.nr);
819 t->nalloc_a = top->atoms.nr;
825 if (t->nalloc_a < g->isize)
827 srenew(t->a, g->isize);
828 t->nalloc_a = g->isize;
830 memcpy(t->a, g->index, g->isize*sizeof(*(t->a)));
833 /* Allocate memory for the block index. We don't know in advance
834 * how much will be needed, so we allocate some extra and free it in the
836 if (t->nalloc_index < g->isize + 1)
838 srenew(t->index, g->isize + 1);
839 t->nalloc_index = g->isize + 1;
843 j = 0; /* j is used by residue completion for the first atom not stored */
845 for (i = 0; i < g->isize; ++i)
848 /* Find the ID number of the atom/residue/molecule corresponding to
856 id = top->atoms.atom[ai].resind;
859 while (ai >= top->mols.index[id+1])
864 case INDEX_UNKNOWN: /* Should not occur */
869 /* If this is the first atom in a new block, initialize the block. */
874 /* For completion, we first set the start of the block. */
875 t->index[t->nr++] = t->nra;
876 /* And then we find all the atoms that should be included. */
880 while (top->atoms.atom[j].resind != id)
884 while (j < top->atoms.nr && top->atoms.atom[j].resind == id)
892 for (j = top->mols.index[id]; j < top->mols.index[id+1]; ++j)
898 default: /* Should not be reached */
899 gmx_bug("internal error");
905 /* If not using completion, simply store the start of the block. */
906 t->index[t->nr++] = i;
911 /* Set the end of the last block */
912 t->index[t->nr] = t->nra;
913 /* Free any unnecessary memory */
914 srenew(t->index, t->nr+1);
915 t->nalloc_index = t->nr+1;
918 srenew(t->a, t->nra);
919 t->nalloc_a = t->nra;
924 * \param[in] g Index group to check.
925 * \param[in] b Block data to check against.
926 * \returns true if \p g consists of one or more complete blocks from \p b,
929 * The atoms in \p g are assumed to be sorted.
932 gmx_ana_index_has_full_blocks(gmx_ana_index_t *g, t_block *b)
937 /* Each round in the loop matches one block */
940 /* Find the block that begins with the first unmatched atom */
941 while (bi < b->nr && b->index[bi] != g->index[i])
945 /* If not found, or if too large, return */
946 if (bi == b->nr || i + b->index[bi+1] - b->index[bi] > g->isize)
950 /* Check that the block matches the index */
951 for (j = b->index[bi]; j < b->index[bi+1]; ++j, ++i)
953 if (g->index[i] != j)
958 /* Move the search to the next block */
965 * \param[in] g Index group to check.
966 * \param[in] b Block data to check against.
967 * \returns true if \p g consists of one or more complete blocks from \p b,
970 * The atoms in \p g and \p b->a are assumed to be in the same order.
973 gmx_ana_index_has_full_ablocks(gmx_ana_index_t *g, t_blocka *b)
978 /* Each round in the loop matches one block */
981 /* Find the block that begins with the first unmatched atom */
982 while (bi < b->nr && b->a[b->index[bi]] != g->index[i])
986 /* If not found, or if too large, return */
987 if (bi == b->nr || i + b->index[bi+1] - b->index[bi] > g->isize)
991 /* Check that the block matches the index */
992 for (j = b->index[bi]; j < b->index[bi+1]; ++j, ++i)
994 if (b->a[j] != g->index[i])
999 /* Move the search to the next block */
1006 * \param[in] g Index group to check.
1007 * \param[in] type Block data to check against.
1008 * \param[in] top Topology data.
1009 * \returns true if \p g consists of one or more complete elements of type
1010 * \p type, false otherwise.
1012 * If \p type is \ref INDEX_ATOM, the return value is always true.
1013 * If \p type is \ref INDEX_UNKNOWN or \ref INDEX_ALL, the return value is
1017 gmx_ana_index_has_complete_elems(gmx_ana_index_t *g, e_index_t type,
1035 for (i = 0; i < g->isize; ++i)
1038 id = top->atoms.atom[ai].resind;
1041 if (ai > 0 && top->atoms.atom[ai-1].resind == id)
1045 if (i > 0 && g->index[i-1] < top->atoms.nr - 1
1046 && top->atoms.atom[g->index[i-1]+1].resind == prev)
1053 if (g->index[i-1] < top->atoms.nr - 1
1054 && top->atoms.atom[g->index[i-1]+1].resind == prev)
1062 return gmx_ana_index_has_full_blocks(g, &top->mols);
1068 * \param[out] m Output structure.
1070 * Any contents of \p m are discarded without freeing.
1073 gmx_ana_indexmap_clear(gmx_ana_indexmap_t *m)
1075 m->type = INDEX_UNKNOWN;
1080 m->mapb.index = NULL;
1081 m->mapb.nalloc_index = 0;
1087 m->b.nalloc_index = 0;
1090 m->bMapStatic = true;
1094 * \param[in,out] m Mapping structure.
1095 * \param[in] nr Maximum number of blocks to reserve space for.
1096 * \param[in] isize Maximum number of atoms to reserve space for.
1099 gmx_ana_indexmap_reserve(gmx_ana_indexmap_t *m, int nr, int isize)
1101 if (m->mapb.nalloc_index < nr + 1)
1103 srenew(m->refid, nr);
1104 srenew(m->mapid, nr);
1105 srenew(m->orgid, nr);
1106 srenew(m->mapb.index, nr + 1);
1107 srenew(m->b.index, nr + 1);
1108 m->mapb.nalloc_index = nr + 1;
1109 m->b.nalloc_index = nr + 1;
1111 if (m->b.nalloc_a < isize)
1113 srenew(m->b.a, isize);
1114 m->b.nalloc_a = isize;
1119 * \param[in,out] m Mapping structure to initialize.
1120 * \param[in] g Index group to map
1121 * (can be NULL if \p type is \ref INDEX_UNKNOWN).
1122 * \param[in] top Topology structure
1123 * (can be NULL if \p type is not \ref INDEX_RES or \ref INDEX_MOL).
1124 * \param[in] type Type of mapping to construct.
1126 * Initializes a new index group mapping.
1127 * The index group provided to gmx_ana_indexmap_update() should always be a
1128 * subset of the \p g given here.
1130 * \p m should have been initialized somehow (calloc() is enough).
1133 gmx_ana_indexmap_init(gmx_ana_indexmap_t *m, gmx_ana_index_t *g,
1134 t_topology *top, e_index_t type)
1139 gmx_ana_index_make_block(&m->b, top, g, type, false);
1140 gmx_ana_indexmap_reserve(m, m->b.nr, m->b.nra);
1142 for (i = mi = 0; i < m->nr; ++i)
1144 ii = (type == INDEX_UNKNOWN ? 0 : m->b.a[m->b.index[i]]);
1151 m->orgid[i] = top->atoms.atom[ii].resind;
1154 while (top->mols.index[mi+1] <= ii)
1166 for (i = 0; i < m->nr; ++i)
1169 m->mapid[i] = m->orgid[i];
1172 memcpy(m->mapb.index, m->b.index, (m->nr+1)*sizeof(*(m->mapb.index)));
1174 m->bMapStatic = true;
1178 * \param[in,out] m Mapping structure to initialize.
1179 * \param[in] b Block information to use for data.
1181 * Frees some memory that is not necessary for static index group mappings.
1182 * Internal pointers are set to point to data in \p b; it is the responsibility
1183 * of the caller to ensure that the block information matches the contents of
1185 * After this function has been called, the index group provided to
1186 * gmx_ana_indexmap_update() should always be the same as \p g given here.
1188 * This function breaks modularity of the index group mapping interface in an
1189 * ugly way, but allows reducing memory usage of static selections by a
1190 * significant amount.
1193 gmx_ana_indexmap_set_static(gmx_ana_indexmap_t *m, t_blocka *b)
1196 m->mapid = m->orgid;
1198 m->b.nalloc_index = 0;
1199 m->b.index = b->index;
1200 sfree(m->mapb.index);
1201 m->mapb.nalloc_index = 0;
1202 m->mapb.index = m->b.index;
1209 * \param[in,out] dest Destination data structure.
1210 * \param[in] src Source mapping.
1211 * \param[in] bFirst If true, memory is allocated for \p dest and a full
1212 * copy is made; otherwise, only variable parts are copied, and no memory
1215 * \p dest should have been initialized somehow (calloc() is enough).
1218 gmx_ana_indexmap_copy(gmx_ana_indexmap_t *dest, gmx_ana_indexmap_t *src, bool bFirst)
1222 gmx_ana_indexmap_reserve(dest, src->b.nr, src->b.nra);
1223 dest->type = src->type;
1224 dest->b.nr = src->b.nr;
1225 dest->b.nra = src->b.nra;
1226 memcpy(dest->orgid, src->orgid, dest->b.nr*sizeof(*dest->orgid));
1227 memcpy(dest->b.index, src->b.index, (dest->b.nr+1)*sizeof(*dest->b.index));
1228 memcpy(dest->b.a, src->b.a, dest->b.nra*sizeof(*dest->b.a));
1231 dest->mapb.nr = src->mapb.nr;
1232 memcpy(dest->refid, src->refid, dest->nr*sizeof(*dest->refid));
1233 memcpy(dest->mapid, src->mapid, dest->nr*sizeof(*dest->mapid));
1234 memcpy(dest->mapb.index, src->mapb.index, (dest->mapb.nr+1)*sizeof(*dest->mapb.index));
1235 dest->bStatic = src->bStatic;
1236 dest->bMapStatic = src->bMapStatic;
1240 * \param[in,out] m Mapping structure.
1241 * \param[in] g Current index group.
1242 * \param[in] bMaskOnly true if the unused blocks should be masked with
1243 * -1 instead of removing them.
1245 * Updates the index group mapping with the new index group \p g.
1247 * \see gmx_ana_indexmap_t
1250 gmx_ana_indexmap_update(gmx_ana_indexmap_t *m, gmx_ana_index_t *g,
1256 /* Process the simple cases first */
1257 if (m->type == INDEX_UNKNOWN && m->b.nra == 0)
1261 if (m->type == INDEX_ALL)
1265 m->mapb.index[1] = g->isize;
1269 /* Reset the reference IDs and mapping if necessary */
1270 bStatic = (g->isize == m->b.nra && m->nr == m->b.nr);
1271 if (bStatic || bMaskOnly)
1275 for (bj = 0; bj < m->b.nr; ++bj)
1282 for (bj = 0; bj < m->b.nr; ++bj)
1284 m->mapid[bj] = m->orgid[bj];
1286 for (bj = 0; bj <= m->b.nr; ++bj)
1288 m->mapb.index[bj] = m->b.index[bj];
1290 m->bMapStatic = true;
1293 /* Exit immediately if the group is static */
1303 for (i = j = bj = 0; i < g->isize; ++i, ++j)
1305 /* Find the next atom in the block */
1306 while (m->b.a[j] != g->index[i])
1310 /* Mark blocks that did not contain any atoms */
1311 while (bj < m->b.nr && m->b.index[bj+1] <= j)
1313 m->refid[bj++] = -1;
1315 /* Advance the block index if we have reached the next block */
1316 if (m->b.index[bj] <= j)
1321 /* Mark the last blocks as not accessible */
1322 while (bj < m->b.nr)
1324 m->refid[bj++] = -1;
1329 for (i = j = bi = 0, bj = -1; i < g->isize; ++i)
1331 /* Find the next atom in the block */
1332 while (m->b.a[j] != g->index[i])
1336 /* If we have reached a new block, add it */
1337 if (m->b.index[bj+1] <= j)
1339 /* Skip any blocks in between */
1340 while (bj < m->b.nr && m->b.index[bj+1] <= j)
1345 m->mapid[bi] = m->orgid[bj];
1346 m->mapb.index[bi] = i;
1350 /* Update the number of blocks */
1351 m->mapb.index[bi] = g->isize;
1353 m->bMapStatic = false;
1360 * \param[in,out] m Mapping structure to free.
1362 * All the memory allocated for the mapping structure is freed, and
1363 * the pointers set to NULL.
1364 * The pointer \p m is not freed.
1367 gmx_ana_indexmap_deinit(gmx_ana_indexmap_t *m)
1370 if (m->mapid != m->orgid)
1374 if (m->mapb.nalloc_index > 0)
1376 sfree(m->mapb.index);
1379 if (m->b.nalloc_index > 0)
1383 if (m->b.nalloc_a > 0)
1387 gmx_ana_indexmap_clear(m);