This file is indexed.

/usr/include/dolfin/fem/DofMapBuilder.h is in libdolfin-dev 1.4.0+dfsg-4.

This file is owned by root:root, with mode 0o644.

The actual contents of the file can be viewed below.

  1
  2
  3
  4
  5
  6
  7
  8
  9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
// Copyright (C) 2008-2013 Anders Logg, Ola Skavhaug and Garth N. Wells
//
// This file is part of DOLFIN.
//
// DOLFIN is free software: you can redistribute it and/or modify
// it under the terms of the GNU Lesser General Public License as published by
// the Free Software Foundation, either version 3 of the License, or
// (at your option) any later version.
//
// DOLFIN is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
// GNU Lesser General Public License for more details.
//
// You should have received a copy of the GNU Lesser General Public License
// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
//
// Modified by Niclas Jansson 2009.
// Modified by Garth Wells 2009-2012
// Modified by Mikael Mortensen 2012.
//
// First added:  2008-08-12
// Last changed: 2012-11-05

#ifndef __DOF_MAP_BUILDER_H
#define __DOF_MAP_BUILDER_H

#include <map>
#include <set>
#include <boost/array.hpp>
#include <memory>
#include <boost/unordered_map.hpp>
#include <boost/unordered_set.hpp>
#include <dolfin/common/types.h>
#include <dolfin/common/Set.h>

namespace ufc
{
  class dofmap;
}

namespace dolfin
{

  class DofMap;
  class Mesh;
  class SubDomain;
  class UFC;

  /// Documentation of class

  class DofMapBuilder
  {

    // FIXME: Test which 'map' is most efficient
    typedef std::map<dolfin::la_index, dolfin::la_index> map;
    typedef std::map<dolfin::la_index, dolfin::la_index>::const_iterator
      map_iterator;
    //typedef std::set<std::size_t> set;
    //typedef std::set<std::size_t>::const_iterator set_iterator;

    typedef boost::unordered_set<std::size_t> set;
    typedef boost::unordered_set<std::size_t>::const_iterator set_iterator;
    //typedef std::set<std::size_t> set;
    //typedef std::set<std::size_t>::const_iterator set_iterator;

    typedef std::vector<std::size_t>::const_iterator vector_it;
    typedef boost::unordered_map<std::size_t, std::vector<unsigned int> >
      vec_map;

    typedef std::pair<std::size_t, std::size_t> facet_data;
    typedef std::map<std::size_t, std::size_t> periodic_map;
    typedef std::vector<facet_data> vector_of_pairs;
    typedef periodic_map::iterator periodic_map_iterator;
    typedef std::vector<std::pair<facet_data, facet_data> > facet_pair_type;

  public:

    /// Build dofmap. The restriction may be a null pointer, in which
    /// case it is ignored.
    static void build(DofMap& dofmap, const Mesh& dolfin_mesh,
        std::shared_ptr<const std::map<unsigned int, std::map<unsigned int,
          std::pair<unsigned int, unsigned int> > > > slave_master_entities,
        std::shared_ptr<const Restriction> restriction);

    /// Build sub-dofmap
    static void build_sub_map(DofMap& sub_dofmap,
                              const DofMap& parent_dofmap,
                              const std::vector<std::size_t>& component,
                              const Mesh& mesh);

  private:

    // Build UFC-based dofmap
    static void build_ufc_dofmap(DofMap& dofmap, map& restricted_dofs_inverse,
      const Mesh& mesh,
      std::shared_ptr<const std::map<unsigned int, std::map<unsigned int,
        std::pair<unsigned int, unsigned int> > > > slave_master_entities,
      std::shared_ptr<const Restriction> restriction);

    // Build modified global entity indices that account for periodic bcs
    static std::size_t build_constrained_vertex_indices(const Mesh& mesh,
        const std::map<unsigned int, std::pair<unsigned int, unsigned int> >& slave_to_master_vertices,
        std::vector<std::size_t>& modified_global_indices);

    // Re-order local dofmap for dof spatial locality. Re-ordering is
    // optional, but re-ordering can make other algorithms (e.g.,
    // matrix-vector products) significantly faster.
    static void reorder_local(DofMap& dofmap, const Mesh& mesh,
                              std::size_t block_size,
                              const std::set<std::size_t>& global_dofs);

    // Re-order distributed dof map for process locality
    static void
      reorder_distributed(DofMap& dofmap,
                          const Mesh& mesh,
                          std::shared_ptr<const Restriction> restriction,
                          const map& restricted_dofs_inverse,
                          std::size_t block_size,
                          const std::set<std::size_t>& global_dofs);

    // Compute which process 'owns' each node (point at which dofs live)
    //   node_ownership[0] -> all dofs owned by this process (will
    //   intersect dof_ownership[1])
    //   node_ownership[1] -> dofs shared with other processes and
    //   owned by this process
    //   node_ownership[2] -> dofs shared with other processes and
    //   owned by another process
    static void
      compute_node_ownership(boost::array<set, 3>& node_ownership,
                             vec_map& shared_node_processes,
                             DofMap& dofmap,
                             const std::set<std::size_t>& global_dofs,
                             const Mesh& mesh,
                             std::shared_ptr<const Restriction> restriction,
                             const map& restricted_dofs_inverse,
                             std::size_t block_size);

    // Re-order distributed dofmap for process locality based on
    // ownership data
    static void
      parallel_renumber(const boost::array<set, 3>& node_ownership,
                        const vec_map& shared_node_processes,
                        DofMap& dofmap,
                        const std::set<std::size_t>& global_dofs,
                        const Mesh& mesh,
                        std::shared_ptr<const Restriction> restriction,
                        const map& restricted_dofs_inverse,
                        std::size_t block_size);

    // Compute set of global dofs (e.g. Reals associated with global
    // Lagrange multipliers) based on UFC numbering. Global dofs are
    // not associated with any mesh entity.
    static std::set<std::size_t> compute_global_dofs(const DofMap& dofmap);

    // Iterate recursively over all sub-dof maps to find global
    // degrees of freedom
    static void compute_global_dofs(std::set<std::size_t>& global_dofs,
                                    std::size_t& offset,
                            std::shared_ptr<const ufc::dofmap> ufc_dofmap,
                            const DofMap& dofmap);

    // Recursively extract UFC sub-dofmap and compute offset
    static std::shared_ptr<ufc::dofmap>
        extract_ufc_sub_dofmap(const ufc::dofmap& ufc_dofmap,
                               std::size_t& offset,
                               const std::vector<std::size_t>& component,
                               const std::vector<std::size_t>& num_global_mesh_entities);

    // Compute block size, e.g. in 3D elasticity block_size = 3
    static std::size_t compute_blocksize(const ufc::dofmap& ufc_dofmap);

  };
}

#endif