*** This commit represents a complete reformatting of the LLDB source code

*** to conform to clang-format’s LLVM style.  This kind of mass change has
*** two obvious implications:

Firstly, merging this particular commit into a downstream fork may be a huge
effort.  Alternatively, it may be worth merging all changes up to this commit,
performing the same reformatting operation locally, and then discarding the
merge for this particular commit.  The commands used to accomplish this
reformatting were as follows (with current working directory as the root of
the repository):

    find . \( -iname "*.c" -or -iname "*.cpp" -or -iname "*.h" -or -iname "*.mm" \) -exec clang-format -i {} +
    find . -iname "*.py" -exec autopep8 --in-place --aggressive --aggressive {} + ;

The version of clang-format used was 3.9.0, and autopep8 was 1.2.4.

Secondly, “blame” style tools will generally point to this commit instead of
a meaningful prior commit.  There are alternatives available that will attempt
to look through this change and find the appropriate prior commit.  YMMV.

llvm-svn: 280751

1 files changed, 32 insertions, 33 deletions

diff --git a/lldb/tools/lldb-mi/MIUtilParse.cpp b/lldb/tools/lldb-mi/MIUtilParse.cpp
index 27e25b8..7b039e3 100644
--- a/lldb/tools/lldb-mi/MIUtilParse.cpp
+++ b/lldb/tools/lldb-mi/MIUtilParse.cpp
@@ -6,14 +6,15 @@
 // License. See LICENSE.TXT for details.
 //
 //===----------------------------------------------------------------------===//
- 
+
 // Third party headers:
 #include <memory>
 
 // In-house headers:
 #include "MIUtilParse.h"
- 
-//++ ------------------------------------------------------------------------------------
+
+//++
+//------------------------------------------------------------------------------------
 // Details: CRegexParser constructor.
 // Type:    Method.
 // Args:    regexStr - Pointer to the regular expression to compile.
@@ -21,25 +22,24 @@
 // Throws:  None.
 //--
 MIUtilParse::CRegexParser::CRegexParser(const char *regexStr)
-    : m_isValid(llvm_regcomp(&m_emma, regexStr, REG_EXTENDED) == 0)
-{
-}
- 
-//++ ------------------------------------------------------------------------------------
+    : m_isValid(llvm_regcomp(&m_emma, regexStr, REG_EXTENDED) == 0) {}
+
+//++
+//------------------------------------------------------------------------------------
 // Details: CRegexParser destructor.
 // Type:    Method.
 // Args:    None.
 // Return:  None.
 // Throws:  None.
 //--
-MIUtilParse::CRegexParser::~CRegexParser()
-{
-    // Free up memory held within regex.
-    if (m_isValid)
-        llvm_regfree(&m_emma);
+MIUtilParse::CRegexParser::~CRegexParser() {
+  // Free up memory held within regex.
+  if (m_isValid)
+    llvm_regfree(&m_emma);
 }
- 
-//++ ------------------------------------------------------------------------------------
+
+//++
+//------------------------------------------------------------------------------------
 // Details: CRegexParser regex executer.
 //          Match the input against the regular expression.  Return an error
 //          if the number of matches is less than minMatches.  If the default
@@ -54,22 +54,21 @@ MIUtilParse::CRegexParser::~CRegexParser()
 //                 false = minimum matches were not met or regex failed.
 // Throws:  None.
 //--
-bool
-MIUtilParse::CRegexParser::Execute(const char *input, Match& match, size_t minMatches)
-{
-    if (!m_isValid)
-        return false;
- 
-    std::unique_ptr<llvm_regmatch_t[]> matches(new llvm_regmatch_t[match.m_maxMatches]); // Array of matches
-   
-    if (llvm_regexec(&m_emma, input, match.m_maxMatches, matches.get(), 0) != 0)
-        return false;
- 
-    size_t i;
-    for (i = 0; i < match.m_maxMatches && matches[i].rm_so >= 0; i++)
-    {
-        const int n = matches[i].rm_eo - matches[i].rm_so;
-        match.m_matchStrs[i].assign(input + matches[i].rm_so, n);
-    }
-    return i >= minMatches;
+bool MIUtilParse::CRegexParser::Execute(const char *input, Match &match,
+                                        size_t minMatches) {
+  if (!m_isValid)
+    return false;
+
+  std::unique_ptr<llvm_regmatch_t[]> matches(
+      new llvm_regmatch_t[match.m_maxMatches]); // Array of matches
+
+  if (llvm_regexec(&m_emma, input, match.m_maxMatches, matches.get(), 0) != 0)
+    return false;
+
+  size_t i;
+  for (i = 0; i < match.m_maxMatches && matches[i].rm_so >= 0; i++) {
+    const int n = matches[i].rm_eo - matches[i].rm_so;
+    match.m_matchStrs[i].assign(input + matches[i].rm_so, n);
+  }
+  return i >= minMatches;
 }