Chromium Code Reviews| OLD | NEW |
|---|---|
| (Empty) | |
| 1 // Copyright (c) 2015 The Chromium Authors. All rights reserved. | |
| 2 // Use of this source code is governed by a BSD-style license that can be | |
| 3 // found in the LICENSE file. | |
| 4 | |
| 5 #ifndef BASE_MEMORY_SHARED_MEMORY_ALLOCATOR_H_ | |
| 6 #define BASE_MEMORY_SHARED_MEMORY_ALLOCATOR_H_ | |
| 7 | |
| 8 #include <stdint.h> | |
| 9 | |
| 10 #include "base/atomicops.h" | |
| 11 #include "base/base_export.h" | |
| 12 #include "base/macros.h" | |
| 13 | |
| 14 namespace base { | |
| 15 | |
| 16 // Simple allocator for pieces of a memory block that may be shared across | |
| 17 // multiple processes. | |
| 18 // | |
| 19 // This class provides for thread-secure (i.e. safe against other threads | |
| 20 // or processes that may be compromised and thus have malicious intent) | |
| 21 // allocation of memory within a designated block and also a mechanism by | |
| 22 // which other threads can learn of the allocations with any additional | |
| 23 // shared information. | |
| 24 // | |
| 25 // There is (currently) no way to release an allocated block of data because | |
| 26 // doing so would risk invalidating pointers held by other processes and | |
| 27 // greatly complicate the allocation algorithm. | |
| 28 // | |
| 29 // Construction of this object can accept new, clean (i.e. zeroed) memory | |
| 30 // or previously initialized memory. In the first case, construction must | |
|
Alexander Potapenko
2015/11/03 08:12:54
Please run clang-format in order to fix the extra
bcwhite
2015/11/03 16:28:20
It's on my to-do list.
| |
| 31 // be allowed to complete before letting other allocators attach to the same | |
| 32 // segment. In other words, don't share the segment until at least one | |
| 33 // allocator has been attached to it. | |
| 34 // | |
| 35 // It should be noted that memory doesn't need to actually have zeros written | |
| 36 // throughout; it just needs to read as zero until something diffferent is | |
| 37 // written to a location. This is an important distinction as it supports the | |
|
Dmitry Vyukov
2015/11/03 14:06:46
Is it really important? Looks more confusing than
bcwhite
2015/11/03 16:28:20
It's important because the histogram data is likel
| |
| 38 // use-case of non-pinned memory, such as from a demand-allocated region by | |
| 39 // the OS or a memory-mapped file that auto-grows from a starting size of zero. | |
| 40 class BASE_EXPORT SharedMemoryAllocator { | |
| 41 public: | |
| 42 struct Iterator { | |
| 43 int32_t last; | |
| 44 int32_t loop_detector; | |
| 45 }; | |
| 46 | |
| 47 struct MemoryInfo { | |
| 48 int32_t total; | |
| 49 int32_t free; | |
| 50 }; | |
| 51 | |
| 52 // The allocator operates on any arbitrary block of memory. Creation and | |
| 53 // sharing of that block with another process is the responsibility of the | |
| 54 // caller. The allocator needs to know only the block's |base| address, the | |
| 55 // total |size| of the block, and any internal |page| size (zero if not | |
| 56 // paged) across which allocations should not span. | |
| 57 // | |
| 58 // SharedMemoryAllocator does NOT take ownership of this memory block. The | |
| 59 // caller must manage it and ensure it stays available throughout the lifetime | |
| 60 // of this object. | |
| 61 SharedMemoryAllocator(void* base, int32_t size, int32_t page_size); | |
| 62 ~SharedMemoryAllocator(); | |
| 63 | |
| 64 // Get an object referenced by an |offset|. For safety reasons, the |type| | |
| 65 // code and size-of |unused| are compared to ensure the reference is valid | |
|
Dmitry Vyukov
2015/11/03 14:06:46
I guess it is s/unused/T/
bcwhite
2015/11/03 16:28:20
Done.
| |
| 66 // and cannot return an object outside of the memory segment. A |type| of | |
| 67 // zero will match any though the size is still checked. NULL is returned | |
| 68 // if any problem is detected, such as corrupted storage or incorrect | |
| 69 // parameters. Callers MUST check that the returned value is not-null EVERY | |
| 70 // TIME before accessing it or risk crashing! Once dereferenced, the pointer | |
| 71 // is safe to reuse forever. | |
| 72 // | |
| 73 // NOTE: Though this method will guarantee that an object of the specified | |
| 74 // type can be accessed without going outside the bounds of the memory | |
| 75 // segment, it makes not guarantees of the validity of the data within the | |
| 76 // object itself. If it is expected that the contents of the segment could | |
| 77 // be compromised with malicious intent, the object must be hardened as well. | |
| 78 template<typename T> T* GetType(int32_t offset, int32_t type) { | |
| 79 return static_cast<T*>(GetBlockData(offset, type, sizeof(T), false)); | |
| 80 } | |
| 81 | |
| 82 // Reserve space in the memory segment of the desired |size| and |type|. | |
| 83 // A return value of zero indicates the allocation failed, otherwise the | |
| 84 // returned offset can be used by any process to get a real pointer via | |
| 85 // the GetObject() call. | |
|
Dmitry Vyukov
2015/11/03 14:06:46
s/GetObject/GetType/
bcwhite
2015/11/03 16:28:20
Done.
| |
| 86 int32_t Allocate(int32_t size, int32_t type); | |
| 87 | |
| 88 // Get the information about the amount of free space in the allocator. The | |
| 89 // amount of free space should be treated as approximate due to extras from | |
| 90 // alignment and metadata, but will never return less than could actually | |
| 91 // be allocated. | |
| 92 void GetMemoryInfo(MemoryInfo* meminfo); | |
| 93 | |
| 94 // Allocated objects can be added to an internal list that can then be | |
| 95 // iterated over by other processes. | |
| 96 void MakeIterable(int32_t offset); | |
| 97 | |
| 98 // Iterating uses a |state| structure (initialized by CreateIterator) and | |
| 99 // returns both the offset reference to the object as well as the |type| of | |
| 100 // that object. A zero return value indicates there are currently no more | |
| 101 // objects to be found but future attempts can be made without having to | |
| 102 // reset the iterator to "first". | |
| 103 void CreateIterator(Iterator* state); | |
| 104 int32_t GetNextIterable(Iterator* state, int32_t* type); | |
| 105 | |
| 106 // If there is some indication that the shared memory has become corrupted, | |
| 107 // calling this will attempt to prevent further damage by indicating to | |
| 108 // all processes that something is not as expected. | |
| 109 void SetCorrupted(); | |
|
Alexander Potapenko
2015/11/03 08:12:54
Shall we move these two to the private section?
bcwhite
2015/11/03 16:28:20
IsCorrupted definitely needs to be public. SetCor
| |
| 110 bool IsCorrupted(); | |
| 111 | |
| 112 // Flag set if an allocation has failed because memory was full. | |
| 113 bool IsFull(); | |
| 114 | |
| 115 private: | |
| 116 struct SharedMetadata; | |
| 117 struct BlockHeader; | |
| 118 | |
| 119 BlockHeader* GetBlock(int32_t offset, int32_t type, int32_t size, | |
| 120 bool special); | |
| 121 void* GetBlockData(int32_t offset, int32_t type, int32_t size, bool special); | |
| 122 | |
| 123 SharedMetadata* shared_meta_; | |
| 124 char* mem_base_; // char because sizeof guaranteed 1 -- easy offset calc | |
| 125 int32_t mem_size_; | |
| 126 int32_t mem_page_; | |
| 127 int32_t last_seen_; | |
| 128 subtle::Atomic32 corrupted_; // TODO(bcwhite): Use std::atomic<char> when ok. | |
| 129 | |
| 130 DISALLOW_COPY_AND_ASSIGN(SharedMemoryAllocator); | |
| 131 }; | |
| 132 | |
| 133 } // namespace base | |
| 134 | |
| 135 #endif // BASE_MEMORY_SHARED_MEMORY_ALLOCATOR_H_ | |
| OLD | NEW |