aboutsummaryrefslogtreecommitdiff
path: root/llvm/lib/Bitcode/Reader/BitcodeReader.cpp
diff options
context:
space:
mode:
authorDmitri Gribenko <gribozavr@gmail.com>2022-07-26 14:05:53 +0200
committerDmitri Gribenko <gribozavr@gmail.com>2022-07-26 14:19:22 +0200
commitb5e3dac33d42cdf8a3b19b1f64b726e700363ded (patch)
tree84ac69fbc99c29aef83ad1971cd8d20b6b542894 /llvm/lib/Bitcode/Reader/BitcodeReader.cpp
parentba198e35fd380350ff7bf5b47d8cf5fa9a43d3e6 (diff)
downloadllvm-b5e3dac33d42cdf8a3b19b1f64b726e700363ded.zip
llvm-b5e3dac33d42cdf8a3b19b1f64b726e700363ded.tar.gz
llvm-b5e3dac33d42cdf8a3b19b1f64b726e700363ded.tar.bz2
[clang][dataflow] Add explicit "AST" nodes for implications and iff
Previously we used to desugar implications and biconditionals into equivalent CNF/DNF as soon as possible. However, this desugaring makes debug output (Environment::dump()) less readable than it could be. Therefore, it makes sense to keep the sugared representation of a boolean formula, and desugar it in the solver. Reviewed By: sgatev, xazax.hun, wyt Differential Revision: https://reviews.llvm.org/D130519
Diffstat (limited to 'llvm/lib/Bitcode/Reader/BitcodeReader.cpp')
0 files changed, 0 insertions, 0 deletions