Simplify Boolean expressions
This patch simplifies boolean expressions acorss LLDB. It was generated
using clang-tidy with the following command:
run-clang-tidy.py -checks='-*,readability-simplify-boolean-expr' -format -fix $PWD
Differential revision: https://reviews.llvm.org/D55584
llvm-svn: 349215
diff --git a/lldb/source/Symbol/CompactUnwindInfo.cpp b/lldb/source/Symbol/CompactUnwindInfo.cpp
index 8710470..1baf444 100644
--- a/lldb/source/Symbol/CompactUnwindInfo.cpp
+++ b/lldb/source/Symbol/CompactUnwindInfo.cpp
@@ -259,7 +259,7 @@
m_objfile.GetModule()->LogMessage(
log, "Reading compact unwind first-level indexes");
- if (m_unwindinfo_data_computed == false) {
+ if (!m_unwindinfo_data_computed) {
if (m_section_sp->IsEncrypted()) {
// Can't get section contents of a protected/encrypted section until we
// have a live process and can read them out of memory.
@@ -529,7 +529,7 @@
--it;
}
- if (it->sentinal_entry == true) {
+ if (it->sentinal_entry) {
return false;
}
@@ -925,7 +925,7 @@
for (uint32_t i = 0; i < register_count; i++) {
int renum = 0;
for (int j = 1; j < 7; j++) {
- if (used[j] == false) {
+ if (!used[j]) {
if (renum == permunreg[i]) {
registers[i] = j;
used[j] = true;
@@ -1187,7 +1187,7 @@
for (uint32_t i = 0; i < register_count; i++) {
int renum = 0;
for (int j = 1; j < 7; j++) {
- if (used[j] == false) {
+ if (!used[j]) {
if (renum == permunreg[i]) {
registers[i] = j;
used[j] = true;