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.

Jules Villard 3332dc1a42 [AI] improve disjunctive domain ... Summary: Replace horrible hack with ok hack. The main difficulty in implementing the disjunctive domain is to avoid the quadratic time complexity of executing the same disjuncts over and over again when going around loops: First time around a loop, assuming for example a single disjunct `d`: ``` [d] loop body [d1' \/ d2'] ``` Second time around the same loop: the new pre will be the join of the posts of predecessor nodes, so `old_pre \/ post(loop,old_pre)`, i.e. `d \/ d1' \/ d2'`. Now we need to execute `loop body` again *without running the symbolic execution of `d` again* (and the time after that we'll want to not execute `d`, `d1'`, or `d2'`). Horrible hack (before): Disjuncts have a boolean "visited" attached that does its best to keep track of whether a given disjunct is old or new. When executing a single *instruction* look at the flag and skip the state if it's old. Of course we have no way to know for sure so it turns out it was often wrongly re-executing old disjuncts. This was also producing the wrong results over even simple loops: only the last iteration would make it outside the loop for some reason. Overall, the semantics were pretty untractable and shady at best. New hack (this diff): only run instructions of a given *node* on disjuncts that are not physically equal to the "pre" ones already in the invariant map for the current node. This gives the correct result over simple loops and a nice performance improvement in general (probably the old heuristic was hitting the quadratic bad case more often). Reviewed By: skcho Differential Revision: D21154063 fbshipit-source-id: 5ee38c68c		5 years ago
..
Makefile	[pulse] run tests against C++17	5 years ago
basic_string.cpp	[pulse] model some of `std::basic_string`	5 years ago
basics.cpp	[clang] rewrite scope computations	6 years ago
closures.cpp	[pulse] support modelling destructors	5 years ago
conditionals.cpp	[pudge] it's alive!	5 years ago
deduplication.cpp	[copyright] Remove years	6 years ago
exit_test.cpp	[pulse] Distinguish exit state at top level	5 years ago
fbstring.cpp	[pulse] intervals!	5 years ago
folly_DestructorGuard.cpp	[copyright] Remove years	6 years ago
frontend.cpp	[clang] NamespaceAliasDecl is just a no-op	5 years ago
interprocedural.cpp	[pulse] interprocedural histories and traces	5 years ago
issues.exp	[AI] improve disjunctive domain	5 years ago
join.cpp	[copyright] Remove years	6 years ago
memory_leak.cpp	[pulse] add a cache of constants to equate them	5 years ago
nullptr.cpp	[pulse] model std::integral_constant	5 years ago
reference_wrapper.cpp	[copyright] Remove years	6 years ago
returns.cpp	[pulse] C++ temporaries bound to globals do not "escape"	5 years ago
std_atomics.cpp	[pulse] model some of `std::atomic`	5 years ago
std_visit.cpp	[clang] fix translation of `initListExpr` again	5 years ago
temporaries.cpp	[clang] fix destructor placement for temporaries in conditionals	5 years ago
throw_test.cpp	[pulse] Distinguish exit state at top level	5 years ago
trace.cpp	[pulse] interprocedural histories and traces	5 years ago
unknown_functions.cpp	[pulse] Do not havoc arguments of unknown functions that are pointers to const	5 years ago
use_after_delete.cpp	[copyright] Remove years	6 years ago
use_after_destructor.cpp	[clang] destroy C++ temporaries	6 years ago
use_after_free.cpp	[pulse] model the fact `free(0)` is a no-op	5 years ago
use_after_scope.cpp	[pulse] Handle stack refs escaping their scope via pointer	5 years ago
values.cpp	[pulse] add a cache of constants to equate them	5 years ago
vector.cpp	[pulse] add model for std::vector<>::at()	5 years ago
vector_iterator.cpp	[pulse] Vector iterator model	5 years ago