Reviewed By: skcho Differential Revision: D17528571 fbshipit-source-id: 11bcbcc3bmaster
Dulma Churchill
5 years ago
committed by
Facebook Github Bot
parent
6a738045fd
commit
ef75952223
@ -0,0 +1,47 @@
|
||||
# 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.
|
||||
|
||||
# E2E test involving the test_determinator feature
|
||||
|
||||
TESTS_DIR = ../..
|
||||
include $(TESTS_DIR)/base.make
|
||||
|
||||
A_CPP = A.cpp
|
||||
TEST_DETERMINATOR_RESULT = infer-out-mod2/diff_determinator.json
|
||||
DIFF_OUTPUT = diff.mod2.test
|
||||
INFER_OPTIONS = --test-determinator --process-clang-ast --no-linters --no-capture
|
||||
|
||||
default: $(TEST_DETERMINATOR_RESULT)
|
||||
|
||||
$(DIFF_OUTPUT):
|
||||
$(QUIET)echo -n '$(A_CPP):' > diff.mod1.test
|
||||
$(QUIET)(diff -N --unchanged-line-format="U" --old-line-format="O" --new-line-format="N" \
|
||||
orig-$(A_CPP) mod1-$(A_CPP) || [ $$? = 1 ]) >> diff.mod1.test
|
||||
$(QUIET)echo -n '$(A_CPP):' > diff.mod2.test
|
||||
$(QUIET)(diff -N --unchanged-line-format="U" --old-line-format="O" --new-line-format="N" \
|
||||
orig-$(A_CPP) mod2-$(A_CPP) || [ $$? = 1 ]) >> diff.mod2.test
|
||||
|
||||
$(TEST_DETERMINATOR_RESULT): $(DIFF_OUTPUT)
|
||||
$(QUIET)$(call silent_on_success,Testing clang test-determinator with set of changes in mod1,\
|
||||
cp mod1-$(A_CPP) $(A_CPP);\
|
||||
$(INFER_BIN) -o infer-out-mod1 $(INFER_OPTIONS) --profiler-samples profiler_samples.json --modified-lines diff.mod1.test -- clang -c $(A_CPP))
|
||||
$(QUIET)$(call silent_on_success,Testing test-determinator-clang with set of changes in mod2,\
|
||||
cp mod2-$(A_CPP) $(A_CPP);\
|
||||
$(INFER_BIN) -o infer-out-mod2 $(INFER_OPTIONS) --profiler-samples profiler_samples.json --modified-lines diff.mod2.test -- clang -c $(A_CPP))
|
||||
$(QUIET) rm $(A_CPP)
|
||||
|
||||
.PHONY: test
|
||||
test: $(TEST_DETERMINATOR_RESULT)
|
||||
$(QUIET)$(call check_no_diff,test_determinator.json.mod1.exp,infer-out-mod1/test_determinator.json)
|
||||
$(QUIET)$(call check_no_diff,test_determinator.json.mod2.exp,infer-out-mod2/test_determinator.json)
|
||||
|
||||
.PHONY: replace
|
||||
replace: $(TEST_DETERMINATOR_RESULT)
|
||||
$(COPY) infer-out-mod1/test_determinator.json test_determinator.json.mod1.exp
|
||||
$(COPY) infer-out-mod2/test_determinator.json test_determinator.json.mod2.exp
|
||||
|
||||
.PHONY: clean
|
||||
clean:
|
||||
$(REMOVE_DIR) *.test infer-out-mod* *.o
|
||||
@ -0,0 +1,30 @@
|
||||
/*
|
||||
* 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.
|
||||
*/
|
||||
|
||||
#include <algorithm>
|
||||
|
||||
int example_function1() { return 111; }
|
||||
|
||||
int example_function2() { return 2; }
|
||||
|
||||
namespace Shapes {
|
||||
|
||||
class Cube {
|
||||
int size;
|
||||
|
||||
public:
|
||||
void set_size(int);
|
||||
int area() { return size * size * size; };
|
||||
void sort(Cube*, unsigned);
|
||||
};
|
||||
|
||||
void Cube::set_size(int s) { size = s; }
|
||||
|
||||
void Cube::sort(Cube* xs, unsigned n) {
|
||||
std::sort(xs, xs + n, [](Cube a, Cube b) { return (a.area() > b.area()); });
|
||||
}
|
||||
} // namespace Shapes
|
||||
@ -0,0 +1,31 @@
|
||||
/*
|
||||
* 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.
|
||||
*/
|
||||
|
||||
#include <algorithm>
|
||||
|
||||
int example_function1() { return 1; }
|
||||
|
||||
int example_function2() { return 222; }
|
||||
|
||||
namespace Shapes {
|
||||
|
||||
class Cube {
|
||||
int size;
|
||||
|
||||
public:
|
||||
void set_size(int);
|
||||
int area() { return size * size; };
|
||||
void sort(Cube*, unsigned);
|
||||
};
|
||||
|
||||
void Cube::set_size(int s) { size = s; }
|
||||
|
||||
void Cube::sort(Cube* xs, unsigned n) {
|
||||
// this is a lambda folks
|
||||
std::sort(xs, xs + n, [](Cube a, Cube b) { return (a.area() < b.area()); });
|
||||
}
|
||||
} // namespace Shapes
|
||||
@ -0,0 +1,30 @@
|
||||
/*
|
||||
* 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.
|
||||
*/
|
||||
|
||||
#include <algorithm>
|
||||
|
||||
int example_function1() { return 1; }
|
||||
|
||||
int example_function2() { return 2; }
|
||||
|
||||
namespace Shapes {
|
||||
|
||||
class Cube {
|
||||
int size;
|
||||
|
||||
public:
|
||||
void set_size(int);
|
||||
int area() { return size * size; };
|
||||
void sort(Cube*, unsigned);
|
||||
};
|
||||
|
||||
void Cube::set_size(int s) { size = s; }
|
||||
|
||||
void Cube::sort(Cube* xs, unsigned n) {
|
||||
std::sort(xs, xs + n, [](Cube a, Cube b) { return (a.area() < b.area()); });
|
||||
}
|
||||
} // namespace Shapes
|
||||
@ -0,0 +1,35 @@
|
||||
[
|
||||
{
|
||||
"field1": {},
|
||||
"test": "label1",
|
||||
"field2": {},
|
||||
"native_symbols": [
|
||||
{
|
||||
"name": "example_function1"
|
||||
},
|
||||
{
|
||||
"name": "example_function10",
|
||||
"mangled_name" : "example_function10"
|
||||
}
|
||||
],
|
||||
"field3": {}
|
||||
},
|
||||
{
|
||||
"field1": {},
|
||||
"field2": {},
|
||||
"field3": {},
|
||||
"test": "label2",
|
||||
"field4": {},
|
||||
"native_symbols": [
|
||||
{
|
||||
"name": "example_function2"
|
||||
},
|
||||
{
|
||||
"name": "example_function20",
|
||||
"mangled_name" : "example_function20"
|
||||
}
|
||||
],
|
||||
"field5": {},
|
||||
"field6": {}
|
||||
}
|
||||
]
|
||||
@ -0,0 +1 @@
|
||||
["label1"]
|
||||
@ -0,0 +1 @@
|
||||
["label2"]
|
||||
Loading…
Reference in new issue