regex.cpp 12 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413
  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 "regex.compat.inc"
  32. #include "core/os/memory.h"
  33. extern "C" {
  34. #include <pcre2.h>
  35. }
  36. static void *_regex_malloc(PCRE2_SIZE size, void *user) {
  37. return memalloc(size);
  38. }
  39. static void _regex_free(void *ptr, void *user) {
  40. if (ptr) {
  41. memfree(ptr);
  42. }
  43. }
  44. int RegExMatch::_find(const Variant &p_name) const {
  45. if (p_name.is_num()) {
  46. int i = (int)p_name;
  47. if (i >= data.size()) {
  48. return -1;
  49. }
  50. return i;
  51. } else if (p_name.is_string()) {
  52. HashMap<String, int>::ConstIterator found = names.find(p_name);
  53. if (found) {
  54. return found->value;
  55. }
  56. }
  57. return -1;
  58. }
  59. String RegExMatch::get_subject() const {
  60. return subject;
  61. }
  62. int RegExMatch::get_group_count() const {
  63. if (data.size() == 0) {
  64. return 0;
  65. }
  66. return data.size() - 1;
  67. }
  68. Dictionary RegExMatch::get_names() const {
  69. Dictionary result;
  70. for (const KeyValue<String, int> &E : names) {
  71. result[E.key] = E.value;
  72. }
  73. return result;
  74. }
  75. PackedStringArray RegExMatch::get_strings() const {
  76. PackedStringArray result;
  77. int size = data.size();
  78. for (int i = 0; i < size; i++) {
  79. int start = data[i].start;
  80. if (start == -1) {
  81. result.append(String());
  82. continue;
  83. }
  84. int length = data[i].end - start;
  85. result.append(subject.substr(start, length));
  86. }
  87. return result;
  88. }
  89. String RegExMatch::get_string(const Variant &p_name) const {
  90. int id = _find(p_name);
  91. if (id < 0) {
  92. return String();
  93. }
  94. int start = data[id].start;
  95. if (start == -1) {
  96. return String();
  97. }
  98. int length = data[id].end - start;
  99. return subject.substr(start, length);
  100. }
  101. int RegExMatch::get_start(const Variant &p_name) const {
  102. int id = _find(p_name);
  103. if (id < 0) {
  104. return -1;
  105. }
  106. return data[id].start;
  107. }
  108. int RegExMatch::get_end(const Variant &p_name) const {
  109. int id = _find(p_name);
  110. if (id < 0) {
  111. return -1;
  112. }
  113. return data[id].end;
  114. }
  115. void RegExMatch::_bind_methods() {
  116. ClassDB::bind_method(D_METHOD("get_subject"), &RegExMatch::get_subject);
  117. ClassDB::bind_method(D_METHOD("get_group_count"), &RegExMatch::get_group_count);
  118. ClassDB::bind_method(D_METHOD("get_names"), &RegExMatch::get_names);
  119. ClassDB::bind_method(D_METHOD("get_strings"), &RegExMatch::get_strings);
  120. ClassDB::bind_method(D_METHOD("get_string", "name"), &RegExMatch::get_string, DEFVAL(0));
  121. ClassDB::bind_method(D_METHOD("get_start", "name"), &RegExMatch::get_start, DEFVAL(0));
  122. ClassDB::bind_method(D_METHOD("get_end", "name"), &RegExMatch::get_end, DEFVAL(0));
  123. ADD_PROPERTY(PropertyInfo(Variant::STRING, "subject"), "", "get_subject");
  124. ADD_PROPERTY(PropertyInfo(Variant::DICTIONARY, "names"), "", "get_names");
  125. ADD_PROPERTY(PropertyInfo(Variant::ARRAY, "strings"), "", "get_strings");
  126. }
  127. void RegEx::_pattern_info(uint32_t what, void *where) const {
  128. pcre2_pattern_info_32((pcre2_code_32 *)code, what, where);
  129. }
  130. Ref<RegEx> RegEx::create_from_string(const String &p_pattern, bool p_show_error) {
  131. Ref<RegEx> ret;
  132. ret.instantiate();
  133. ret->compile(p_pattern, p_show_error);
  134. return ret;
  135. }
  136. void RegEx::clear() {
  137. if (code) {
  138. pcre2_code_free_32((pcre2_code_32 *)code);
  139. code = nullptr;
  140. }
  141. }
  142. Error RegEx::compile(const String &p_pattern, bool p_show_error) {
  143. pattern = p_pattern;
  144. clear();
  145. int err;
  146. PCRE2_SIZE offset;
  147. uint32_t flags = PCRE2_DUPNAMES;
  148. pcre2_general_context_32 *gctx = (pcre2_general_context_32 *)general_ctx;
  149. pcre2_compile_context_32 *cctx = pcre2_compile_context_create_32(gctx);
  150. PCRE2_SPTR32 p = (PCRE2_SPTR32)pattern.get_data();
  151. code = pcre2_compile_32(p, pattern.length(), flags, &err, &offset, cctx);
  152. pcre2_compile_context_free_32(cctx);
  153. if (!code) {
  154. if (p_show_error) {
  155. PCRE2_UCHAR32 buf[256];
  156. pcre2_get_error_message_32(err, buf, 256);
  157. String message = String::num(offset) + ": " + String((const char32_t *)buf);
  158. ERR_PRINT(message.utf8());
  159. }
  160. return FAILED;
  161. }
  162. return OK;
  163. }
  164. Ref<RegExMatch> RegEx::search(const String &p_subject, int p_offset, int p_end) const {
  165. ERR_FAIL_COND_V(!is_valid(), nullptr);
  166. ERR_FAIL_COND_V_MSG(p_offset < 0, nullptr, "RegEx search offset must be >= 0");
  167. Ref<RegExMatch> result = memnew(RegExMatch);
  168. int length = p_subject.length();
  169. if (p_end >= 0 && p_end < length) {
  170. length = p_end;
  171. }
  172. pcre2_code_32 *c = (pcre2_code_32 *)code;
  173. pcre2_general_context_32 *gctx = (pcre2_general_context_32 *)general_ctx;
  174. pcre2_match_context_32 *mctx = pcre2_match_context_create_32(gctx);
  175. PCRE2_SPTR32 s = (PCRE2_SPTR32)p_subject.get_data();
  176. pcre2_match_data_32 *match = pcre2_match_data_create_from_pattern_32(c, gctx);
  177. int res = pcre2_match_32(c, s, length, p_offset, 0, match, mctx);
  178. if (res < 0) {
  179. pcre2_match_data_free_32(match);
  180. pcre2_match_context_free_32(mctx);
  181. return nullptr;
  182. }
  183. uint32_t size = pcre2_get_ovector_count_32(match);
  184. PCRE2_SIZE *ovector = pcre2_get_ovector_pointer_32(match);
  185. result->data.resize(size);
  186. for (uint32_t i = 0; i < size; i++) {
  187. result->data.write[i].start = ovector[i * 2];
  188. result->data.write[i].end = ovector[i * 2 + 1];
  189. }
  190. pcre2_match_data_free_32(match);
  191. pcre2_match_context_free_32(mctx);
  192. result->subject = p_subject;
  193. uint32_t count;
  194. const char32_t *table;
  195. uint32_t entry_size;
  196. _pattern_info(PCRE2_INFO_NAMECOUNT, &count);
  197. _pattern_info(PCRE2_INFO_NAMETABLE, &table);
  198. _pattern_info(PCRE2_INFO_NAMEENTRYSIZE, &entry_size);
  199. for (uint32_t i = 0; i < count; i++) {
  200. char32_t id = table[i * entry_size];
  201. if (result->data[id].start == -1) {
  202. continue;
  203. }
  204. String name = &table[i * entry_size + 1];
  205. if (result->names.has(name)) {
  206. continue;
  207. }
  208. result->names.insert(name, id);
  209. }
  210. return result;
  211. }
  212. TypedArray<RegExMatch> RegEx::search_all(const String &p_subject, int p_offset, int p_end) const {
  213. ERR_FAIL_COND_V_MSG(p_offset < 0, Array(), "RegEx search offset must be >= 0");
  214. int last_end = 0;
  215. TypedArray<RegExMatch> result;
  216. Ref<RegExMatch> match = search(p_subject, p_offset, p_end);
  217. while (match.is_valid()) {
  218. last_end = match->get_end(0);
  219. if (match->get_start(0) == last_end) {
  220. last_end++;
  221. }
  222. result.push_back(match);
  223. match = search(p_subject, last_end, p_end);
  224. }
  225. return result;
  226. }
  227. String RegEx::sub(const String &p_subject, const String &p_replacement, bool p_all, int p_offset, int p_end) const {
  228. ERR_FAIL_COND_V(!is_valid(), String());
  229. ERR_FAIL_COND_V_MSG(p_offset < 0, String(), "RegEx sub offset must be >= 0");
  230. // safety_zone is the number of chars we allocate in addition to the number of chars expected in order to
  231. // guard against the PCRE API writing one additional \0 at the end. PCRE's API docs are unclear on whether
  232. // PCRE understands outlength in pcre2_substitute() as counting an implicit additional terminating char or
  233. // not. always allocating one char more than telling PCRE has us on the safe side.
  234. const int safety_zone = 1;
  235. PCRE2_SIZE olength = p_subject.length() + 1; // space for output string and one terminating \0 character
  236. Vector<char32_t> output;
  237. output.resize(olength + safety_zone);
  238. uint32_t flags = PCRE2_SUBSTITUTE_OVERFLOW_LENGTH;
  239. if (p_all) {
  240. flags |= PCRE2_SUBSTITUTE_GLOBAL;
  241. }
  242. PCRE2_SIZE length = p_subject.length();
  243. if (p_end >= 0 && (uint32_t)p_end < length) {
  244. length = p_end;
  245. }
  246. pcre2_code_32 *c = (pcre2_code_32 *)code;
  247. pcre2_general_context_32 *gctx = (pcre2_general_context_32 *)general_ctx;
  248. pcre2_match_context_32 *mctx = pcre2_match_context_create_32(gctx);
  249. PCRE2_SPTR32 s = (PCRE2_SPTR32)p_subject.get_data();
  250. PCRE2_SPTR32 r = (PCRE2_SPTR32)p_replacement.get_data();
  251. PCRE2_UCHAR32 *o = (PCRE2_UCHAR32 *)output.ptrw();
  252. pcre2_match_data_32 *match = pcre2_match_data_create_from_pattern_32(c, gctx);
  253. int res = pcre2_substitute_32(c, s, length, p_offset, flags, match, mctx, r, p_replacement.length(), o, &olength);
  254. if (res == PCRE2_ERROR_NOMEMORY) {
  255. output.resize(olength + safety_zone);
  256. o = (PCRE2_UCHAR32 *)output.ptrw();
  257. res = pcre2_substitute_32(c, s, length, p_offset, flags, match, mctx, r, p_replacement.length(), o, &olength);
  258. }
  259. pcre2_match_data_free_32(match);
  260. pcre2_match_context_free_32(mctx);
  261. if (res < 0) {
  262. return String();
  263. }
  264. return String(output.ptr(), olength) + p_subject.substr(length);
  265. }
  266. bool RegEx::is_valid() const {
  267. return (code != nullptr);
  268. }
  269. String RegEx::get_pattern() const {
  270. return pattern;
  271. }
  272. int RegEx::get_group_count() const {
  273. ERR_FAIL_COND_V(!is_valid(), 0);
  274. uint32_t count;
  275. _pattern_info(PCRE2_INFO_CAPTURECOUNT, &count);
  276. return count;
  277. }
  278. PackedStringArray RegEx::get_names() const {
  279. PackedStringArray result;
  280. ERR_FAIL_COND_V(!is_valid(), result);
  281. uint32_t count;
  282. const char32_t *table;
  283. uint32_t entry_size;
  284. _pattern_info(PCRE2_INFO_NAMECOUNT, &count);
  285. _pattern_info(PCRE2_INFO_NAMETABLE, &table);
  286. _pattern_info(PCRE2_INFO_NAMEENTRYSIZE, &entry_size);
  287. for (uint32_t i = 0; i < count; i++) {
  288. String name = &table[i * entry_size + 1];
  289. if (!result.has(name)) {
  290. result.append(name);
  291. }
  292. }
  293. return result;
  294. }
  295. RegEx::RegEx() {
  296. general_ctx = pcre2_general_context_create_32(&_regex_malloc, &_regex_free, nullptr);
  297. }
  298. RegEx::RegEx(const String &p_pattern) {
  299. general_ctx = pcre2_general_context_create_32(&_regex_malloc, &_regex_free, nullptr);
  300. compile(p_pattern);
  301. }
  302. RegEx::~RegEx() {
  303. if (code) {
  304. pcre2_code_free_32((pcre2_code_32 *)code);
  305. }
  306. pcre2_general_context_free_32((pcre2_general_context_32 *)general_ctx);
  307. }
  308. void RegEx::_bind_methods() {
  309. ClassDB::bind_static_method("RegEx", D_METHOD("create_from_string", "pattern", "show_error"), &RegEx::create_from_string, DEFVAL(true));
  310. ClassDB::bind_method(D_METHOD("clear"), &RegEx::clear);
  311. ClassDB::bind_method(D_METHOD("compile", "pattern", "show_error"), &RegEx::compile, DEFVAL(true));
  312. ClassDB::bind_method(D_METHOD("search", "subject", "offset", "end"), &RegEx::search, DEFVAL(0), DEFVAL(-1));
  313. ClassDB::bind_method(D_METHOD("search_all", "subject", "offset", "end"), &RegEx::search_all, DEFVAL(0), DEFVAL(-1));
  314. ClassDB::bind_method(D_METHOD("sub", "subject", "replacement", "all", "offset", "end"), &RegEx::sub, DEFVAL(false), DEFVAL(0), DEFVAL(-1));
  315. ClassDB::bind_method(D_METHOD("is_valid"), &RegEx::is_valid);
  316. ClassDB::bind_method(D_METHOD("get_pattern"), &RegEx::get_pattern);
  317. ClassDB::bind_method(D_METHOD("get_group_count"), &RegEx::get_group_count);
  318. ClassDB::bind_method(D_METHOD("get_names"), &RegEx::get_names);
  319. }