Counter Strike : Global Offensive Source Code
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.

86 lines
3.2 KiB

  1. //===-- Regex.h - Regular Expression matcher implementation -*- C++ -*-----===//
  2. //
  3. // The LLVM Compiler Infrastructure
  4. //
  5. // This file is distributed under the University of Illinois Open Source
  6. // License. See LICENSE.TXT for details.
  7. //
  8. //===----------------------------------------------------------------------===//
  9. //
  10. // This file implements a POSIX regular expression matcher. Both Basic and
  11. // Extended POSIX regular expressions (ERE) are supported. EREs were extended
  12. // to support backreferences in matches.
  13. // This implementation also supports matching strings with embedded NUL chars.
  14. //
  15. //===----------------------------------------------------------------------===//
  16. #ifndef LLVM_SUPPORT_REGEX_H
  17. #define LLVM_SUPPORT_REGEX_H
  18. #include <string>
  19. struct llvm_regex;
  20. namespace llvm {
  21. class StringRef;
  22. template<typename T> class SmallVectorImpl;
  23. class Regex {
  24. public:
  25. enum {
  26. NoFlags=0,
  27. /// Compile for matching that ignores upper/lower case distinctions.
  28. IgnoreCase=1,
  29. /// Compile for newline-sensitive matching. With this flag '[^' bracket
  30. /// expressions and '.' never match newline. A ^ anchor matches the
  31. /// null string after any newline in the string in addition to its normal
  32. /// function, and the $ anchor matches the null string before any
  33. /// newline in the string in addition to its normal function.
  34. Newline=2,
  35. /// By default, the POSIX extended regular expression (ERE) syntax is
  36. /// assumed. Pass this flag to turn on basic regular expressions (BRE)
  37. /// instead.
  38. BasicRegex=4
  39. };
  40. /// Compiles the given regular expression \p Regex.
  41. Regex(StringRef Regex, unsigned Flags = NoFlags);
  42. ~Regex();
  43. /// isValid - returns the error encountered during regex compilation, or
  44. /// matching, if any.
  45. bool isValid(std::string &Error);
  46. /// getNumMatches - In a valid regex, return the number of parenthesized
  47. /// matches it contains. The number filled in by match will include this
  48. /// many entries plus one for the whole regex (as element 0).
  49. unsigned getNumMatches() const;
  50. /// matches - Match the regex against a given \p String.
  51. ///
  52. /// \param Matches - If given, on a successful match this will be filled in
  53. /// with references to the matched group expressions (inside \p String),
  54. /// the first group is always the entire pattern.
  55. ///
  56. /// This returns true on a successful match.
  57. bool match(StringRef String, SmallVectorImpl<StringRef> *Matches = 0);
  58. /// sub - Return the result of replacing the first match of the regex in
  59. /// \p String with the \p Repl string. Backreferences like "\0" in the
  60. /// replacement string are replaced with the appropriate match substring.
  61. ///
  62. /// Note that the replacement string has backslash escaping performed on
  63. /// it. Invalid backreferences are ignored (replaced by empty strings).
  64. ///
  65. /// \param Error If non-null, any errors in the substitution (invalid
  66. /// backreferences, trailing backslashes) will be recorded as a non-empty
  67. /// string.
  68. std::string sub(StringRef Repl, StringRef String, std::string *Error = 0);
  69. private:
  70. struct llvm_regex *preg;
  71. int error;
  72. };
  73. }
  74. #endif // LLVM_SUPPORT_REGEX_H