/home/uke/oil/mycpp/gc_slab.h
Line | Count | Source |
1 | | #ifndef GC_SLAB_H |
2 | | #define GC_SLAB_H |
3 | | |
4 | | #include <utility> // std::is_pointer |
5 | | |
6 | | #include "mycpp/common.h" // DISALLOW_COPY_AND_ASSIGN |
7 | | #include "mycpp/gc_obj.h" |
8 | | |
9 | | // Return the size of a resizeable allocation. Just round up to the nearest |
10 | | // power of 2. (CPython has an interesting policy in listobject.c.) |
11 | | // |
12 | | // https://stackoverflow.com/questions/466204/rounding-up-to-next-power-of-2 |
13 | | // |
14 | | // Used by List<T> and Dict<K, V>. |
15 | | |
16 | 91 | inline int RoundUp(int n) { |
17 | | // TODO: what if int isn't 32 bits? |
18 | 91 | n--; |
19 | 91 | n |= n >> 1; |
20 | 91 | n |= n >> 2; |
21 | 91 | n |= n >> 4; |
22 | 91 | n |= n >> 8; |
23 | 91 | n |= n >> 16; |
24 | 91 | n++; |
25 | 91 | return n; |
26 | 91 | } |
27 | | |
28 | | template <typename T> |
29 | | class Slab { |
30 | | // Slabs of pointers are scanned; slabs of ints/bools are opaque. |
31 | | public: |
32 | 513 | explicit Slab(unsigned num_items) { |
33 | 513 | } Line | Count | Source | 32 | 435 | explicit Slab(unsigned num_items) { | 33 | 435 | } |
Line | Count | Source | 32 | 72 | explicit Slab(unsigned num_items) { | 33 | 72 | } |
_ZN4SlabIP6Tuple2IiiEEC2Ej Line | Count | Source | 32 | 3 | explicit Slab(unsigned num_items) { | 33 | 3 | } |
_ZN4SlabIP6Tuple2IP6BigStriEEC2Ej Line | Count | Source | 32 | 1 | explicit Slab(unsigned num_items) { | 33 | 1 | } |
Line | Count | Source | 32 | 1 | explicit Slab(unsigned num_items) { | 33 | 1 | } |
Line | Count | Source | 32 | 1 | explicit Slab(unsigned num_items) { | 33 | 1 | } |
|
34 | | |
35 | 513 | static constexpr ObjHeader obj_header(unsigned num_items) { |
36 | 513 | return ObjHeader::Slab( |
37 | 513 | std::is_pointer<T>() ? HeapTag::Scanned : HeapTag::Opaque, num_items); |
38 | 513 | } _ZN4SlabIiE10obj_headerEj Line | Count | Source | 35 | 435 | static constexpr ObjHeader obj_header(unsigned num_items) { | 36 | 435 | return ObjHeader::Slab( | 37 | 435 | std::is_pointer<T>() ? HeapTag::Scanned : HeapTag::Opaque, num_items); | 38 | 435 | } |
_ZN4SlabIP6BigStrE10obj_headerEj Line | Count | Source | 35 | 72 | static constexpr ObjHeader obj_header(unsigned num_items) { | 36 | 72 | return ObjHeader::Slab( | 37 | 72 | std::is_pointer<T>() ? HeapTag::Scanned : HeapTag::Opaque, num_items); | 38 | 72 | } |
_ZN4SlabIP6Tuple2IiiEE10obj_headerEj Line | Count | Source | 35 | 3 | static constexpr ObjHeader obj_header(unsigned num_items) { | 36 | 3 | return ObjHeader::Slab( | 37 | 3 | std::is_pointer<T>() ? HeapTag::Scanned : HeapTag::Opaque, num_items); | 38 | 3 | } |
_ZN4SlabIP6Tuple2IP6BigStriEE10obj_headerEj Line | Count | Source | 35 | 1 | static constexpr ObjHeader obj_header(unsigned num_items) { | 36 | 1 | return ObjHeader::Slab( | 37 | 1 | std::is_pointer<T>() ? HeapTag::Scanned : HeapTag::Opaque, num_items); | 38 | 1 | } |
_ZN4SlabIbE10obj_headerEj Line | Count | Source | 35 | 1 | static constexpr ObjHeader obj_header(unsigned num_items) { | 36 | 1 | return ObjHeader::Slab( | 37 | 1 | std::is_pointer<T>() ? HeapTag::Scanned : HeapTag::Opaque, num_items); | 38 | 1 | } |
_ZN4SlabIdE10obj_headerEj Line | Count | Source | 35 | 1 | static constexpr ObjHeader obj_header(unsigned num_items) { | 36 | 1 | return ObjHeader::Slab( | 37 | 1 | std::is_pointer<T>() ? HeapTag::Scanned : HeapTag::Opaque, num_items); | 38 | 1 | } |
|
39 | | |
40 | | T items_[1]; // variable length |
41 | | |
42 | | DISALLOW_COPY_AND_ASSIGN(Slab); |
43 | | }; |
44 | | |
45 | | template <typename T, int N> |
46 | | class GlobalSlab { |
47 | | // A template type with the same layout as Slab of length N. For |
48 | | // initializing global constant List. |
49 | | public: |
50 | | T items_[N]; |
51 | | |
52 | | DISALLOW_COPY_AND_ASSIGN(GlobalSlab) |
53 | | }; |
54 | | |
55 | | // XXX(watk): Does this make sense? |
56 | | const int kSlabHeaderSize = sizeof(ObjHeader); |
57 | | |
58 | | #endif // GC_SLAB_H |