This file is indexed.

/usr/include/jellyfish/allocators_mmap.hpp is in libjellyfish-2.0-dev 2.2.4-2.

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
/*  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_ALLOCATORS_MMAP_HPP__
#define __JELLYFISH_ALLOCATORS_MMAP_HPP__

#include <sys/types.h>
#include <sys/mman.h>
#include <pthread.h>
#include <stdio.h>
#include <unistd.h>

#include <algorithm>

namespace allocators {
class mmap {
  void   *ptr_;
  size_t  size_;

public:
  mmap() : ptr_(MAP_FAILED), size_(0) {}
  explicit mmap(size_t _size) : ptr_(MAP_FAILED), size_(0) {
    realloc(_size);
  }
  mmap(mmap&& rhs) : ptr_(rhs.ptr_), size_(rhs.size_) {
    rhs.ptr_  = MAP_FAILED;
    rhs.size_ = 0;
  }
  ~mmap() { free(); }

  mmap& operator=(mmap&& rhs) {
    swap(rhs);
    return *this;
  }

  void swap(mmap& rhs) {
    std::swap(ptr_, rhs.ptr_);
    std::swap(size_, rhs.size_);
  }

  void *get_ptr() const { return ptr_ != MAP_FAILED ? ptr_ : NULL; }
  size_t get_size() const { return size_; }
  void free();
  void *realloc(size_t new_size);
  int lock() { return mlock(ptr_, size_); }
  int unlock() { return munlock(ptr_, size_); }

  // Return a a number of bytes which is a number of whole pages at
  // least as large as size.
  static size_t round_to_page(size_t _size);

private:
  static const int nb_threads = 4;
  struct tinfo {
    pthread_t  thid;
    char      *start, *end;
    size_t     pgsize;
  };
  void fast_zero();
  static void * _fast_zero(void *_info);
};
inline void swap(mmap& a, mmap& b) { a.swap(b); }
}

#endif