You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
49 lines
1.0 KiB
49 lines
1.0 KiB
/*
|
|
* Copyright (c) Facebook, Inc. and its affiliates.
|
|
*
|
|
* This source code is licensed under the MIT license found in the
|
|
* LICENSE file in the root directory of this source tree.
|
|
*/
|
|
struct B {
|
|
B(int v) : f(v){};
|
|
int f;
|
|
};
|
|
|
|
struct WrapsB {
|
|
WrapsB(int f) { b = new B(f); }
|
|
B* b;
|
|
B* getb() { return b; };
|
|
~WrapsB() { delete b; }
|
|
};
|
|
|
|
struct ReferenceWrapperHeap {
|
|
ReferenceWrapperHeap(WrapsB& a) : b(a.getb()){};
|
|
B* b;
|
|
};
|
|
|
|
ReferenceWrapperHeap getwrapperHeap() {
|
|
WrapsB a(1);
|
|
return a; // We store a.b in ReferenceWrapper, but we delete a.b in the
|
|
// destructor of WrapsB
|
|
}
|
|
|
|
int reference_wrapper_heap_bad() {
|
|
ReferenceWrapperHeap rw = getwrapperHeap();
|
|
return rw.b->f; // we want to report use after lifetime bug here
|
|
}
|
|
|
|
struct ReferenceWrapperStack {
|
|
ReferenceWrapperStack(B& bref) : b(&bref){};
|
|
B* b;
|
|
};
|
|
|
|
ReferenceWrapperStack getwrapperStack() {
|
|
B b(1);
|
|
return b;
|
|
}
|
|
|
|
int reference_wrapper_stack_bad() {
|
|
ReferenceWrapperStack rw = getwrapperStack();
|
|
return rw.b->f; // we want to report use after lifetime bug here
|
|
}
|