regex.cpp 12 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408
  1. /**************************************************************************/
  2. /* regex.cpp */
  3. /**************************************************************************/
  4. /* This file is part of: */
  5. /* GODOT ENGINE */
  6. /* https://godotengine.org */
  7. /**************************************************************************/
  8. /* Copyright (c) 2014-present Godot Engine contributors (see AUTHORS.md). */
  9. /* Copyright (c) 2007-2014 Juan Linietsky, Ariel Manzur. */
  10. /* */
  11. /* Permission is hereby granted, free of charge, to any person obtaining */
  12. /* a copy of this software and associated documentation files (the */
  13. /* "Software"), to deal in the Software without restriction, including */
  14. /* without limitation the rights to use, copy, modify, merge, publish, */
  15. /* distribute, sublicense, and/or sell copies of the Software, and to */
  16. /* permit persons to whom the Software is furnished to do so, subject to */
  17. /* the following conditions: */
  18. /* */
  19. /* The above copyright notice and this permission notice shall be */
  20. /* included in all copies or substantial portions of the Software. */
  21. /* */
  22. /* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, */
  23. /* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF */
  24. /* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. */
  25. /* IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY */
  26. /* CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, */
  27. /* TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE */
  28. /* SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. */
  29. /**************************************************************************/
  30. #include "regex.h"
  31. #include "core/os/memory.h"
  32. extern "C" {
  33. #include <pcre2.h>
  34. }
  35. static void *_regex_malloc(PCRE2_SIZE size, void *user) {
  36. return memalloc(size);
  37. }
  38. static void _regex_free(void *ptr, void *user) {
  39. if (ptr) {
  40. memfree(ptr);
  41. }
  42. }
  43. int RegExMatch::_find(const Variant &p_name) const {
  44. if (p_name.is_num()) {
  45. int i = (int)p_name;
  46. if (i >= data.size()) {
  47. return -1;
  48. }
  49. return i;
  50. } else if (p_name.get_type() == Variant::STRING || p_name.get_type() == Variant::STRING_NAME) {
  51. HashMap<String, int>::ConstIterator found = names.find((String)p_name);
  52. if (found) {
  53. return found->value;
  54. }
  55. }
  56. return -1;
  57. }
  58. String RegExMatch::get_subject() const {
  59. return subject;
  60. }
  61. int RegExMatch::get_group_count() const {
  62. if (data.size() == 0) {
  63. return 0;
  64. }
  65. return data.size() - 1;
  66. }
  67. Dictionary RegExMatch::get_names() const {
  68. Dictionary result;
  69. for (const KeyValue<String, int> &E : names) {
  70. result[E.key] = E.value;
  71. }
  72. return result;
  73. }
  74. PackedStringArray RegExMatch::get_strings() const {
  75. PackedStringArray result;
  76. int size = data.size();
  77. for (int i = 0; i < size; i++) {
  78. int start = data[i].start;
  79. if (start == -1) {
  80. result.append(String());
  81. continue;
  82. }
  83. int length = data[i].end - start;
  84. result.append(subject.substr(start, length));
  85. }
  86. return result;
  87. }
  88. String RegExMatch::get_string(const Variant &p_name) const {
  89. int id = _find(p_name);
  90. if (id < 0) {
  91. return String();
  92. }
  93. int start = data[id].start;
  94. if (start == -1) {
  95. return String();
  96. }
  97. int length = data[id].end - start;
  98. return subject.substr(start, length);
  99. }
  100. int RegExMatch::get_start(const Variant &p_name) const {
  101. int id = _find(p_name);
  102. if (id < 0) {
  103. return -1;
  104. }
  105. return data[id].start;
  106. }
  107. int RegExMatch::get_end(const Variant &p_name) const {
  108. int id = _find(p_name);
  109. if (id < 0) {
  110. return -1;
  111. }
  112. return data[id].end;
  113. }
  114. void RegExMatch::_bind_methods() {
  115. ClassDB::bind_method(D_METHOD("get_subject"), &RegExMatch::get_subject);
  116. ClassDB::bind_method(D_METHOD("get_group_count"), &RegExMatch::get_group_count);
  117. ClassDB::bind_method(D_METHOD("get_names"), &RegExMatch::get_names);
  118. ClassDB::bind_method(D_METHOD("get_strings"), &RegExMatch::get_strings);
  119. ClassDB::bind_method(D_METHOD("get_string", "name"), &RegExMatch::get_string, DEFVAL(0));
  120. ClassDB::bind_method(D_METHOD("get_start", "name"), &RegExMatch::get_start, DEFVAL(0));
  121. ClassDB::bind_method(D_METHOD("get_end", "name"), &RegExMatch::get_end, DEFVAL(0));
  122. ADD_PROPERTY(PropertyInfo(Variant::STRING, "subject"), "", "get_subject");
  123. ADD_PROPERTY(PropertyInfo(Variant::DICTIONARY, "names"), "", "get_names");
  124. ADD_PROPERTY(PropertyInfo(Variant::ARRAY, "strings"), "", "get_strings");
  125. }
  126. void RegEx::_pattern_info(uint32_t what, void *where) const {
  127. pcre2_pattern_info_32((pcre2_code_32 *)code, what, where);
  128. }
  129. Ref<RegEx> RegEx::create_from_string(const String &p_pattern) {
  130. Ref<RegEx> ret;
  131. ret.instantiate();
  132. ret->compile(p_pattern);
  133. return ret;
  134. }
  135. void RegEx::clear() {
  136. if (code) {
  137. pcre2_code_free_32((pcre2_code_32 *)code);
  138. code = nullptr;
  139. }
  140. }
  141. Error RegEx::compile(const String &p_pattern) {
  142. pattern = p_pattern;
  143. clear();
  144. int err;
  145. PCRE2_SIZE offset;
  146. uint32_t flags = PCRE2_DUPNAMES;
  147. pcre2_general_context_32 *gctx = (pcre2_general_context_32 *)general_ctx;
  148. pcre2_compile_context_32 *cctx = pcre2_compile_context_create_32(gctx);
  149. PCRE2_SPTR32 p = (PCRE2_SPTR32)pattern.get_data();
  150. code = pcre2_compile_32(p, pattern.length(), flags, &err, &offset, cctx);
  151. pcre2_compile_context_free_32(cctx);
  152. if (!code) {
  153. PCRE2_UCHAR32 buf[256];
  154. pcre2_get_error_message_32(err, buf, 256);
  155. String message = String::num(offset) + ": " + String((const char32_t *)buf);
  156. ERR_PRINT(message.utf8());
  157. return FAILED;
  158. }
  159. return OK;
  160. }
  161. Ref<RegExMatch> RegEx::search(const String &p_subject, int p_offset, int p_end) const {
  162. ERR_FAIL_COND_V(!is_valid(), nullptr);
  163. ERR_FAIL_COND_V_MSG(p_offset < 0, nullptr, "RegEx search offset must be >= 0");
  164. Ref<RegExMatch> result = memnew(RegExMatch);
  165. int length = p_subject.length();
  166. if (p_end >= 0 && p_end < length) {
  167. length = p_end;
  168. }
  169. pcre2_code_32 *c = (pcre2_code_32 *)code;
  170. pcre2_general_context_32 *gctx = (pcre2_general_context_32 *)general_ctx;
  171. pcre2_match_context_32 *mctx = pcre2_match_context_create_32(gctx);
  172. PCRE2_SPTR32 s = (PCRE2_SPTR32)p_subject.get_data();
  173. pcre2_match_data_32 *match = pcre2_match_data_create_from_pattern_32(c, gctx);
  174. int res = pcre2_match_32(c, s, length, p_offset, 0, match, mctx);
  175. if (res < 0) {
  176. pcre2_match_data_free_32(match);
  177. pcre2_match_context_free_32(mctx);
  178. return nullptr;
  179. }
  180. uint32_t size = pcre2_get_ovector_count_32(match);
  181. PCRE2_SIZE *ovector = pcre2_get_ovector_pointer_32(match);
  182. result->data.resize(size);
  183. for (uint32_t i = 0; i < size; i++) {
  184. result->data.write[i].start = ovector[i * 2];
  185. result->data.write[i].end = ovector[i * 2 + 1];
  186. }
  187. pcre2_match_data_free_32(match);
  188. pcre2_match_context_free_32(mctx);
  189. result->subject = p_subject;
  190. uint32_t count;
  191. const char32_t *table;
  192. uint32_t entry_size;
  193. _pattern_info(PCRE2_INFO_NAMECOUNT, &count);
  194. _pattern_info(PCRE2_INFO_NAMETABLE, &table);
  195. _pattern_info(PCRE2_INFO_NAMEENTRYSIZE, &entry_size);
  196. for (uint32_t i = 0; i < count; i++) {
  197. char32_t id = table[i * entry_size];
  198. if (result->data[id].start == -1) {
  199. continue;
  200. }
  201. String name = &table[i * entry_size + 1];
  202. if (result->names.has(name)) {
  203. continue;
  204. }
  205. result->names.insert(name, id);
  206. }
  207. return result;
  208. }
  209. TypedArray<RegExMatch> RegEx::search_all(const String &p_subject, int p_offset, int p_end) const {
  210. ERR_FAIL_COND_V_MSG(p_offset < 0, Array(), "RegEx search offset must be >= 0");
  211. int last_end = -1;
  212. TypedArray<RegExMatch> result;
  213. Ref<RegExMatch> match = search(p_subject, p_offset, p_end);
  214. while (match.is_valid()) {
  215. if (last_end == match->get_end(0)) {
  216. break;
  217. }
  218. result.push_back(match);
  219. last_end = match->get_end(0);
  220. match = search(p_subject, match->get_end(0), p_end);
  221. }
  222. return result;
  223. }
  224. String RegEx::sub(const String &p_subject, const String &p_replacement, bool p_all, int p_offset, int p_end) const {
  225. ERR_FAIL_COND_V(!is_valid(), String());
  226. ERR_FAIL_COND_V_MSG(p_offset < 0, String(), "RegEx sub offset must be >= 0");
  227. // safety_zone is the number of chars we allocate in addition to the number of chars expected in order to
  228. // guard against the PCRE API writing one additional \0 at the end. PCRE's API docs are unclear on whether
  229. // PCRE understands outlength in pcre2_substitute() as counting an implicit additional terminating char or
  230. // not. always allocating one char more than telling PCRE has us on the safe side.
  231. const int safety_zone = 1;
  232. PCRE2_SIZE olength = p_subject.length() + 1; // space for output string and one terminating \0 character
  233. Vector<char32_t> output;
  234. output.resize(olength + safety_zone);
  235. uint32_t flags = PCRE2_SUBSTITUTE_OVERFLOW_LENGTH;
  236. if (p_all) {
  237. flags |= PCRE2_SUBSTITUTE_GLOBAL;
  238. }
  239. PCRE2_SIZE length = p_subject.length();
  240. if (p_end >= 0 && (uint32_t)p_end < length) {
  241. length = p_end;
  242. }
  243. pcre2_code_32 *c = (pcre2_code_32 *)code;
  244. pcre2_general_context_32 *gctx = (pcre2_general_context_32 *)general_ctx;
  245. pcre2_match_context_32 *mctx = pcre2_match_context_create_32(gctx);
  246. PCRE2_SPTR32 s = (PCRE2_SPTR32)p_subject.get_data();
  247. PCRE2_SPTR32 r = (PCRE2_SPTR32)p_replacement.get_data();
  248. PCRE2_UCHAR32 *o = (PCRE2_UCHAR32 *)output.ptrw();
  249. pcre2_match_data_32 *match = pcre2_match_data_create_from_pattern_32(c, gctx);
  250. int res = pcre2_substitute_32(c, s, length, p_offset, flags, match, mctx, r, p_replacement.length(), o, &olength);
  251. if (res == PCRE2_ERROR_NOMEMORY) {
  252. output.resize(olength + safety_zone);
  253. o = (PCRE2_UCHAR32 *)output.ptrw();
  254. res = pcre2_substitute_32(c, s, length, p_offset, flags, match, mctx, r, p_replacement.length(), o, &olength);
  255. }
  256. pcre2_match_data_free_32(match);
  257. pcre2_match_context_free_32(mctx);
  258. if (res < 0) {
  259. return String();
  260. }
  261. return String(output.ptr(), olength);
  262. }
  263. bool RegEx::is_valid() const {
  264. return (code != nullptr);
  265. }
  266. String RegEx::get_pattern() const {
  267. return pattern;
  268. }
  269. int RegEx::get_group_count() const {
  270. ERR_FAIL_COND_V(!is_valid(), 0);
  271. uint32_t count;
  272. _pattern_info(PCRE2_INFO_CAPTURECOUNT, &count);
  273. return count;
  274. }
  275. PackedStringArray RegEx::get_names() const {
  276. PackedStringArray result;
  277. ERR_FAIL_COND_V(!is_valid(), result);
  278. uint32_t count;
  279. const char32_t *table;
  280. uint32_t entry_size;
  281. _pattern_info(PCRE2_INFO_NAMECOUNT, &count);
  282. _pattern_info(PCRE2_INFO_NAMETABLE, &table);
  283. _pattern_info(PCRE2_INFO_NAMEENTRYSIZE, &entry_size);
  284. for (uint32_t i = 0; i < count; i++) {
  285. String name = &table[i * entry_size + 1];
  286. if (result.find(name) < 0) {
  287. result.append(name);
  288. }
  289. }
  290. return result;
  291. }
  292. RegEx::RegEx() {
  293. general_ctx = pcre2_general_context_create_32(&_regex_malloc, &_regex_free, nullptr);
  294. }
  295. RegEx::RegEx(const String &p_pattern) {
  296. general_ctx = pcre2_general_context_create_32(&_regex_malloc, &_regex_free, nullptr);
  297. compile(p_pattern);
  298. }
  299. RegEx::~RegEx() {
  300. if (code) {
  301. pcre2_code_free_32((pcre2_code_32 *)code);
  302. }
  303. pcre2_general_context_free_32((pcre2_general_context_32 *)general_ctx);
  304. }
  305. void RegEx::_bind_methods() {
  306. ClassDB::bind_static_method("RegEx", D_METHOD("create_from_string", "pattern"), &RegEx::create_from_string);
  307. ClassDB::bind_method(D_METHOD("clear"), &RegEx::clear);
  308. ClassDB::bind_method(D_METHOD("compile", "pattern"), &RegEx::compile);
  309. ClassDB::bind_method(D_METHOD("search", "subject", "offset", "end"), &RegEx::search, DEFVAL(0), DEFVAL(-1));
  310. ClassDB::bind_method(D_METHOD("search_all", "subject", "offset", "end"), &RegEx::search_all, DEFVAL(0), DEFVAL(-1));
  311. ClassDB::bind_method(D_METHOD("sub", "subject", "replacement", "all", "offset", "end"), &RegEx::sub, DEFVAL(false), DEFVAL(0), DEFVAL(-1));
  312. ClassDB::bind_method(D_METHOD("is_valid"), &RegEx::is_valid);
  313. ClassDB::bind_method(D_METHOD("get_pattern"), &RegEx::get_pattern);
  314. ClassDB::bind_method(D_METHOD("get_group_count"), &RegEx::get_group_count);
  315. ClassDB::bind_method(D_METHOD("get_names"), &RegEx::get_names);
  316. }