ListLoopM.H 2.71 KB
Newer Older
1 2 3 4
/*---------------------------------------------------------------------------*\
  =========                 |
  \\      /  F ield         | OpenFOAM: The Open Source CFD Toolbox
   \\    /   O peration     |
5
    \\  /    A nd           | Copyright (C) 2011-2015 OpenFOAM Foundation
6 7 8 9 10
     \\/     M anipulation  |
-------------------------------------------------------------------------------
License
    This file is part of OpenFOAM.

11 12 13 14
    OpenFOAM 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 3 of the License, or
    (at your option) any later version.
15 16 17 18 19 20 21

    OpenFOAM 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
22
    along with OpenFOAM.  If not, see <http://www.gnu.org/licenses/>.
23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39

Description
    List\<T\> is a 1D vector of objects of type T, where the size of the
    vector is known and used for subscript bounds checking, etc.

\*---------------------------------------------------------------------------*/

#ifndef ListLoop_H
#define ListLoop_H

// * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * //

#ifdef vectorMachine

// Element access looping using [] for vector machines

#define List_FOR_ALL(f, i)                      \
40 41
        const label _n##i = (f).size();\
        for (label i=0; i<_n##i; i++)  \
42 43 44 45
        {

#define List_END_FOR_ALL  }

46 47 48 49
// Provide current element
#define List_CELEM(f, fp, i)  (fp[i])

// Provide current element
50 51
#define List_ELEM(f, fp, i)  (fp[i])

52 53 54 55 56
#define List_ACCESS(type, f, fp) \
    type* const __restrict__ fp = (f).begin()

#define List_CONST_ACCESS(type, f, fp) \
    const type* const __restrict__ fp = (f).begin()
57 58 59 60 61 62

#else

// Pointer looping for scalar machines

#define List_FOR_ALL(f, i)                      \
63
        label i = (f).size();          \
64 65 66 67 68
        while (i--)                             \
        {                                       \

#define List_END_FOR_ALL  }

69 70 71 72
// Provide current element without incrementing pointer
#define List_CELEM(f, fp, i)  (*fp)

// Provide current element and increment pointer
73 74
#define List_ELEM(f, fp, i)  (*fp++)

75
#define List_ACCESS(type, f, fp) \
76
    type* __restrict__ fp = (f).begin()
77 78

#define List_CONST_ACCESS(type, f, fp) \
79
    const type* __restrict__ fp = (f).begin()
80 81 82 83 84 85 86 87 88

#endif


// * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * //

#endif

// ************************************************************************* //