2 * Copyright 2013 Facebook, Inc.
4 * Licensed under the Apache License, Version 2.0 (the "License");
5 * you may not use this file except in compliance with the License.
6 * You may obtain a copy of the License at
8 * http://www.apache.org/licenses/LICENSE-2.0
10 * Unless required by applicable law or agreed to in writing, software
11 * distributed under the License is distributed on an "AS IS" BASIS,
12 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
13 * See the License for the specific language governing permissions and
14 * limitations under the License.
17 #include "folly/PackedSyncPtr.h"
20 #include <gtest/gtest.h>
22 #include <unordered_map>
25 using folly::PackedSyncPtr;
29 // Compile time check for packability. This requires that
30 // PackedSyncPtr is a POD struct on gcc.
31 struct ignore { PackedSyncPtr<int> foo; char c; } __attribute__((packed));
32 static_assert(sizeof(ignore) == 9, "PackedSyncPtr wasn't packable");
36 TEST(PackedSyncPtr, Basic) {
37 PackedSyncPtr<std::pair<int,int>> sp;
38 sp.init(new std::pair<int,int>[2]);
39 EXPECT_EQ(sizeof(sp), 8);
41 EXPECT_EQ(sp[0].first, 5);
43 EXPECT_EQ(sp[1].second, 7);
45 EXPECT_EQ(sp[1].second, 7);
47 EXPECT_EQ(sp->first, 9);
49 EXPECT_EQ((sp.get() + 1)->second, 7);
52 EXPECT_EQ(sp.extra(), 0);
54 EXPECT_EQ(sp.extra(), 0x13);
55 EXPECT_EQ((sp.get() + 1)->second, 7);
57 auto newP = new std::pair<int,int>();
59 EXPECT_EQ(sp.extra(), 0x13);
60 EXPECT_EQ(sp.get(), newP);
64 // Here we use the PackedSyncPtr to lock the whole SyncVec (base, *base, and sz)
67 PackedSyncPtr<T> base;
68 SyncVec() { base.init(); }
69 void push_back(const T& t) {
70 base.set((T*) realloc(base.get(),
71 (base.extra() + 1) * sizeof(T)));
72 base[base.extra()] = t;
73 base.setExtra(base.extra() + 1);
82 T* begin() const { return base.get(); }
83 T* end() const { return base.get() + base.extra(); }
85 typedef SyncVec<intptr_t> VecT;
86 typedef std::unordered_map<int64_t, VecT> Map;
87 const int mapCap = 1317;
88 const int nthrs = 297;
89 static Map map(mapCap);
91 // Each app thread inserts it's ID into every vec in map
92 // map is read only, so doesn't need any additional locking
93 void appThread(intptr_t id) {
94 for (auto& kv : map) {
96 kv.second.push_back(id);
101 TEST(PackedSyncPtr, Application) {
102 for (int64_t i = 0; i < mapCap / 2; ++i) {
103 map.insert(std::make_pair(i, VecT()));
105 std::vector<std::thread> thrs;
106 for (intptr_t i = 0; i < nthrs; i++) {
107 thrs.push_back(std::thread(appThread, i));
109 for (auto& t : thrs) {
113 for (auto& kv : map) {
114 // Make sure every thread successfully inserted it's ID into every vec
115 std::set<intptr_t> idsFound;
116 for (auto& elem : kv.second) {
117 EXPECT_TRUE(idsFound.insert(elem).second); // check for dups
119 EXPECT_EQ(idsFound.size(), nthrs); // check they are all there
123 TEST(PackedSyncPtr, extraData) {
124 PackedSyncPtr<int> p;
126 int* unaligned = reinterpret_cast<int*>(0xf003);
129 uintptr_t* bytes = reinterpret_cast<uintptr_t*>(&p);
130 LOG(INFO) << "Bytes integer is: 0x" << std::hex << *bytes;
131 EXPECT_EQ(p.get(), unaligned);