This file is indexed.

/usr/include/rheolef/mpi_scatter_begin.h is in librheolef-dev 6.7-6.

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
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
#ifndef _RHEO_MPI_SCATTER_BEGIN_H
#define _RHEO_MPI_SCATTER_BEGIN_H
///
/// This file is part of Rheolef.
///
/// Copyright (C) 2000-2009 Pierre Saramito <Pierre.Saramito@imag.fr>
///
/// Rheolef is free software; you can redistribute it and/or modify
/// it under the terms of the GNU General Public License as published by
/// the Free Software Foundation; either version 2 of the License, or
/// (at your option) any later version.
///
/// Rheolef 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 General Public License for more details.
///
/// You should have received a copy of the GNU General Public License
/// along with Rheolef; if not, write to the Free Software
/// Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
/// 
/// =========================================================================

# include "rheolef/msg_right_permutation_apply.h"
# include "rheolef/msg_both_permutation_apply.h"

namespace rheolef {
/*F:
NAME: mpi_scatter_begin -- gather/scatter initialize (@PACKAGE@ @VERSION@)
DESCRIPTION:
  Begin communication
  for distributed to sequential scatter context.
COMPLEXITY:
IMPLEMENTATION:
  Even though the next routines are written with distributed 
  vectors, either x or y (but not both) may be sequential
  vectors, one for each processor.
  
     from indices indicate where arriving stuff is stashed
     to   indices indicate where departing stuff came from. 
     the naming can be a little confusing.

 Reverse scatter is obtained by swapping (to,from)
 in calls to scatter_begin and scatter_end.
 Reverse scatter is usefull for transpose matrix-vector multiply.

 Scatter general operation is handled by a template "SetOp" type.
 The special case "SetOp=set_op" of an affectation is treated
 separatly, tacking care of local scatter affectation.
 Thus, the "mpi_scatter_begin" routine is splitted into
 "msg_scatter_begin_global" and "msg_scatter_begin_local"
 parts.
AUTHORS:
    LMC-IMAG, 38041 Grenoble cedex 9, France
    | Pierre.Saramito@imag.fr
DATE:   23 march 1999
END:
*/

//<mpi_scatter_begin:
template <
    class InputIterator, 
    class Message, 
    class Tag,
    class Comm>
void
mpi_scatter_begin_global (
    InputIterator           		x,
    Message&                            from,
    Message&                            to,
    Tag                     		tag,
    Comm                    		comm)
{
    typedef typename Message::size_type        size_type;
    // ----------------------------------------------------------
    // 1) post receives
    // ----------------------------------------------------------
    from.requests.clear();
    {
      size_type n_receive = from.starts().size() - 1;
      size_type i_start = 0;
      for (size_type i = 0; i < n_receive; i++) {
        size_type i_size = from.starts() [i+1] - from.starts() [i];
	mpi::request i_req = comm.irecv(
            from.procs() [i],
	    tag,
    	    from.values().begin().operator->() + i_start,
	    i_size); 
        i_start += i_size;
        from.requests.push_back (std::make_pair(i, i_req));
      }
    } // end block
    // ----------------------------------------------------------
    // 2) apply right permutation
    // ----------------------------------------------------------
    to.load_values (x);

    // ----------------------------------------------------------
    // 3) do sends
    // ----------------------------------------------------------
    to.requests.clear();
    {
      size_type n_send = to.starts().size() - 1;
      size_type i_start = 0;
      for (size_type i = 0; i < n_send; i++) {
        size_type i_size = to.starts() [i+1] - to.starts() [i];
	mpi::request i_req = comm.isend(
            to.procs() [i],
	    tag,
    	    to.values().begin().operator->() + i_start,
	    i_size); 
        i_start += i_size;
        to.requests.push_back (std::make_pair(i, i_req));
      }
    } // end block
}
template <
    class InputIterator, 
    class OutputIterator, 
    class SetOp, 
    class Message>
void
mpi_scatter_begin_local (
    InputIterator           		x,
    OutputIterator          		y,
    Message&                            from,
    Message&                            to,
    SetOp		    		op)
{
#ifdef TO_CLEAN
    msg_both_permutation_apply (
	to.local_slots.begin(),
	to.local_slots.end(),
	x,
	op,
	from.local_slots.begin(),
	y);
#endif // TO_CLEAN
}
// take care of local insert: template specialisation
template <
    class InputIterator, 
    class OutputIterator, 
    class Message>
void
mpi_scatter_begin_local (
    InputIterator           		x,
    OutputIterator          		y,
    Message&                            from,
    Message&                            to,
    set_op<typename Message::value_type, typename Message::value_type> op)
{
#ifdef TO_CLEAN
    // used when x & y have distinct pointer types (multi-valued) 
    if (y == x && ! to.local_nonmatching_computed) {
        // scatter_local_optimize(to,from);
	fatal_macro ("y == x: adress matches in scatter: not yet -- sorry");
    } 
    if (to.local_is_copy) {

        std::copy(x + to.local_copy_start,
                  x + to.local_copy_start + to.local_copy_length,
                  y + from.local_copy_start);

    } else if (y != x || ! to.local_nonmatching_computed) {

        msg_both_permutation_apply (
	    to.local_slots.begin(),
	    to.local_slots.end(),
	    x,
	    op,
	    from.local_slots.begin(),
	    y);

    } else { // !to.local_is_copy && y == x && to.local_nonmatching_computed

	msg_both_permutation_apply (
	    to.local_slots_nonmatching.begin(),
	    to.local_slots_nonmatching.end(),
	    x,
	    op,
	    from.local_slots_nonmatching.begin(),
	    y);
    }
#endif // TO_CLEAN
}
template <
    class InputIterator, 
    class OutputIterator, 
    class Message,
    class SetOp, 
    class Tag,
    class Comm>
inline
void
mpi_scatter_begin(
    InputIterator      		     	x,
    OutputIterator     		     	y,
    Message&                            from,
    Message&                            to,
    SetOp			    	op,
    Tag                		     	tag,
    Comm               		     	comm)
{
    mpi_scatter_begin_global (x, from, to, tag, comm);
    if (to.n_local() == 0) {
	return;
    }
    error_macro ("local messages: no more supported");
    mpi_scatter_begin_local  (x, y, from, to, op);
}
//>mpi_scatter_begin:
} // namespace rheolef
#endif // _RHEO_MPI_SCATTER_BEGIN_H