This file is indexed.

/usr/include/jellyfish/atomic_gcc.hpp is in libjellyfish-2.0-dev 2.1.4-1.

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
/*  This file is part of Jellyfish.

    Jellyfish 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.

    Jellyfish 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 Jellyfish.  If not, see <http://www.gnu.org/licenses/>.
*/

#ifndef __JELLYFISH_ATOMIC_GCC_HPP__
#define __JELLYFISH_ATOMIC_GCC_HPP__

namespace atomic
{
  class gcc
  {
  public:
    template<typename T>
    static inline T cas(volatile T *ptr, T oval, T nval) {
      return __sync_val_compare_and_swap(ptr, oval, nval);
    }

    template<typename T>
    static inline T set(T *ptr, T nval) {
      return __sync_lock_test_and_set(ptr, nval);
    }

    template<typename T>
    static inline T add_fetch(volatile T *ptr, T x) {
      T ncount = *ptr, count;
      do {
	count = ncount;
	ncount = cas((T *)ptr, count, count + x);
      } while(ncount != count);
      return count + x;
    }

    template<typename T>
    static inline T fetch_add(volatile T *ptr, T x) {
      T ncount = *ptr, count;
      do {
	count = ncount;
	ncount = cas((T *)ptr, count, (T)(count + x));
      } while(ncount != count);
      return count;
    }

    template<typename T>
    static inline T set_to_max(volatile T *ptr, T x) {
      T count = *ptr;
      while(x > count) {
        T ncount = cas(ptr, count, x);
        if(ncount == count)
          return x;
        count = ncount;
      }
      return count;
    }
  };
}
#endif