21 using namespace folly;
26 auto iter =
set.insert(1).first;
35 for (
int i = 0;
i < 1000; ++
i) {
36 auto iter =
set.find(10);
47 auto& ref = *
set.insert(1).first;
56 for (
int i = 0;
i < 1000; ++
i) {
57 auto& ref = *
set.find(10);
67 for (
int i = 0;
i < 32; ++
i) {
76 repeat(func), testing::ExitedWithCode(1),
".*heap-use-after-free.*");
80 TEST(F14AsanSupportTest, F14ValueIterInsertSmall) {
83 TEST(F14AsanSupportTest, F14NodeIterInsertSmall) {
86 TEST(F14AsanSupportTest, F14VectorIterInsertSmall) {
89 TEST(F14AsanSupportTest, F14FastIterInsertSmall) {
93 TEST(F14AsanSupportTest, F14ValueIterInsertLarge) {
96 TEST(F14AsanSupportTest, F14NodeIterInsertLarge) {
99 TEST(F14AsanSupportTest, F14VectorIterInsertLarge) {
102 TEST(F14AsanSupportTest, F14FastIterInsertLarge) {
106 TEST(F14AsanSupportTest, F14ValueRefInsertSmall) {
109 TEST(F14AsanSupportTest, F14VectorRefInsertSmall) {
112 TEST(F14AsanSupportTest, F14FastRefInsertSmall) {
116 TEST(F14AsanSupportTest, F14ValueRefInsertLarge) {
119 TEST(F14AsanSupportTest, F14VectorRefInsertLarge) {
122 TEST(F14AsanSupportTest, F14FastRefInsertLarge) {
126 TEST(F14AsanSupportTest, F14VectorErase) {
131 auto&
v = *
set.begin();
void useIteratorAfterInsertSmall()
#define EXPECT_EQ(val1, val2)
constexpr bool kIsSanitizeAddress
—— Concurrent Priority Queue Implementation ——
void expectAsanFailure(F const &func)
void repeat(F const &func)
void useIteratorAfterInsertLarge()
#define EXPECT_NE(val1, val2)
void useReferenceAfterInsertLarge()
TEST(SequencedExecutor, CPUThreadPoolExecutor)
void useReferenceAfterInsertSmall()