regex.cpp 14 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523
  1. /*************************************************************************/
  2. /* regex.cpp */
  3. /*************************************************************************/
  4. /* This file is part of: */
  5. /* GODOT ENGINE */
  6. /* https://godotengine.org */
  7. /*************************************************************************/
  8. /* Copyright (c) 2007-2018 Juan Linietsky, Ariel Manzur. */
  9. /* Copyright (c) 2014-2018 Godot Engine contributors (cf. AUTHORS.md) */
  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. memfree(ptr);
  40. }
  41. int RegExMatch::_find(const Variant &p_name) const {
  42. if (p_name.is_num()) {
  43. int i = (int)p_name;
  44. if (i >= data.size())
  45. return -1;
  46. return i;
  47. } else if (p_name.get_type() == Variant::STRING) {
  48. const Map<String, int>::Element *found = names.find((String)p_name);
  49. if (found)
  50. return found->value();
  51. }
  52. return -1;
  53. }
  54. String RegExMatch::get_subject() const {
  55. return subject;
  56. }
  57. int RegExMatch::get_group_count() const {
  58. if (data.size() == 0)
  59. return 0;
  60. return data.size() - 1;
  61. }
  62. Dictionary RegExMatch::get_names() const {
  63. Dictionary result;
  64. for (const Map<String, int>::Element *i = names.front(); i != NULL; i = i->next()) {
  65. result[i->key()] = i->value();
  66. }
  67. return result;
  68. }
  69. Array RegExMatch::get_strings() const {
  70. Array result;
  71. int size = data.size();
  72. for (int i = 0; i < size; i++) {
  73. int start = data[i].start;
  74. if (start == -1) {
  75. result.append(String());
  76. continue;
  77. }
  78. int length = data[i].end - start;
  79. result.append(subject.substr(start, length));
  80. }
  81. return result;
  82. }
  83. String RegExMatch::get_string(const Variant &p_name) const {
  84. int id = _find(p_name);
  85. if (id < 0)
  86. return String();
  87. int start = data[id].start;
  88. if (start == -1)
  89. return String();
  90. int length = data[id].end - start;
  91. return subject.substr(start, length);
  92. }
  93. int RegExMatch::get_start(const Variant &p_name) const {
  94. int id = _find(p_name);
  95. if (id < 0)
  96. return -1;
  97. return data[id].start;
  98. }
  99. int RegExMatch::get_end(const Variant &p_name) const {
  100. int id = _find(p_name);
  101. if (id < 0)
  102. return -1;
  103. return data[id].end;
  104. }
  105. void RegExMatch::_bind_methods() {
  106. ClassDB::bind_method(D_METHOD("get_subject"), &RegExMatch::get_subject);
  107. ClassDB::bind_method(D_METHOD("get_group_count"), &RegExMatch::get_group_count);
  108. ClassDB::bind_method(D_METHOD("get_names"), &RegExMatch::get_names);
  109. ClassDB::bind_method(D_METHOD("get_strings"), &RegExMatch::get_strings);
  110. ClassDB::bind_method(D_METHOD("get_string", "name"), &RegExMatch::get_string, DEFVAL(0));
  111. ClassDB::bind_method(D_METHOD("get_start", "name"), &RegExMatch::get_start, DEFVAL(0));
  112. ClassDB::bind_method(D_METHOD("get_end", "name"), &RegExMatch::get_end, DEFVAL(0));
  113. ADD_PROPERTY(PropertyInfo(Variant::STRING, "subject"), "", "get_subject");
  114. ADD_PROPERTY(PropertyInfo(Variant::DICTIONARY, "names"), "", "get_names");
  115. ADD_PROPERTY(PropertyInfo(Variant::ARRAY, "strings"), "", "get_strings");
  116. }
  117. void RegEx::_pattern_info(uint32_t what, void *where) const {
  118. if (sizeof(CharType) == 2) {
  119. pcre2_pattern_info_16((pcre2_code_16 *)code, what, where);
  120. } else {
  121. pcre2_pattern_info_32((pcre2_code_32 *)code, what, where);
  122. }
  123. }
  124. void RegEx::clear() {
  125. if (sizeof(CharType) == 2) {
  126. if (code)
  127. pcre2_code_free_16((pcre2_code_16 *)code);
  128. } else {
  129. if (code)
  130. pcre2_code_free_32((pcre2_code_32 *)code);
  131. }
  132. }
  133. Error RegEx::compile(const String &p_pattern) {
  134. pattern = p_pattern;
  135. clear();
  136. int err;
  137. PCRE2_SIZE offset;
  138. uint32_t flags = PCRE2_DUPNAMES;
  139. if (sizeof(CharType) == 2) {
  140. pcre2_general_context_16 *gctx = (pcre2_general_context_16 *)general_ctx;
  141. pcre2_compile_context_16 *cctx = pcre2_compile_context_create_16(gctx);
  142. PCRE2_SPTR16 p = (PCRE2_SPTR16)pattern.c_str();
  143. code = pcre2_compile_16(p, pattern.length(), flags, &err, &offset, cctx);
  144. if (!code) {
  145. PCRE2_UCHAR16 buf[256];
  146. pcre2_get_error_message_16(err, buf, 256);
  147. String message = String::num(offset) + ": " + String((const CharType *)buf);
  148. ERR_PRINT(message.utf8());
  149. return FAILED;
  150. }
  151. } else {
  152. pcre2_general_context_32 *gctx = (pcre2_general_context_32 *)general_ctx;
  153. pcre2_compile_context_32 *cctx = pcre2_compile_context_create_32(gctx);
  154. PCRE2_SPTR32 p = (PCRE2_SPTR32)pattern.c_str();
  155. code = pcre2_compile_32(p, pattern.length(), flags, &err, &offset, cctx);
  156. if (!code) {
  157. PCRE2_UCHAR32 buf[256];
  158. pcre2_get_error_message_32(err, buf, 256);
  159. String message = String::num(offset) + ": " + String((const CharType *)buf);
  160. ERR_PRINT(message.utf8());
  161. return FAILED;
  162. }
  163. }
  164. return OK;
  165. }
  166. Ref<RegExMatch> RegEx::search(const String &p_subject, int p_offset, int p_end) const {
  167. ERR_FAIL_COND_V(!is_valid(), NULL);
  168. Ref<RegExMatch> result = memnew(RegExMatch);
  169. int length = p_subject.length();
  170. if (p_end >= 0 && p_end < length)
  171. length = p_end;
  172. if (sizeof(CharType) == 2) {
  173. pcre2_code_16 *c = (pcre2_code_16 *)code;
  174. pcre2_general_context_16 *gctx = (pcre2_general_context_16 *)general_ctx;
  175. pcre2_match_context_16 *mctx = pcre2_match_context_create_16(gctx);
  176. PCRE2_SPTR16 s = (PCRE2_SPTR16)p_subject.c_str();
  177. pcre2_match_data_16 *match = pcre2_match_data_create_from_pattern_16(c, gctx);
  178. int res = pcre2_match_16(c, s, length, p_offset, 0, match, mctx);
  179. if (res < 0) {
  180. pcre2_match_data_free_16(match);
  181. return NULL;
  182. }
  183. uint32_t size = pcre2_get_ovector_count_16(match);
  184. PCRE2_SIZE *ovector = pcre2_get_ovector_pointer_16(match);
  185. result->data.resize(size);
  186. for (uint32_t i = 0; i < size; i++) {
  187. result->data[i].start = ovector[i * 2];
  188. result->data[i].end = ovector[i * 2 + 1];
  189. }
  190. pcre2_match_data_free_16(match);
  191. pcre2_match_context_free_16(mctx);
  192. } else {
  193. pcre2_code_32 *c = (pcre2_code_32 *)code;
  194. pcre2_general_context_32 *gctx = (pcre2_general_context_32 *)general_ctx;
  195. pcre2_match_context_32 *mctx = pcre2_match_context_create_32(gctx);
  196. PCRE2_SPTR32 s = (PCRE2_SPTR32)p_subject.c_str();
  197. pcre2_match_data_32 *match = pcre2_match_data_create_from_pattern_32(c, gctx);
  198. int res = pcre2_match_32(c, s, length, p_offset, 0, match, mctx);
  199. if (res < 0) {
  200. pcre2_match_data_free_32(match);
  201. return NULL;
  202. }
  203. uint32_t size = pcre2_get_ovector_count_32(match);
  204. PCRE2_SIZE *ovector = pcre2_get_ovector_pointer_32(match);
  205. result->data.resize(size);
  206. for (uint32_t i = 0; i < size; i++) {
  207. result->data[i].start = ovector[i * 2];
  208. result->data[i].end = ovector[i * 2 + 1];
  209. }
  210. pcre2_match_data_free_32(match);
  211. pcre2_match_context_free_32(mctx);
  212. }
  213. result->subject = p_subject;
  214. uint32_t count;
  215. const CharType *table;
  216. uint32_t entry_size;
  217. _pattern_info(PCRE2_INFO_NAMECOUNT, &count);
  218. _pattern_info(PCRE2_INFO_NAMETABLE, &table);
  219. _pattern_info(PCRE2_INFO_NAMEENTRYSIZE, &entry_size);
  220. for (uint32_t i = 0; i < count; i++) {
  221. CharType id = table[i * entry_size];
  222. if (result->data[id].start == -1)
  223. continue;
  224. String name = &table[i * entry_size + 1];
  225. if (result->names.has(name))
  226. continue;
  227. result->names.insert(name, id);
  228. }
  229. return result;
  230. }
  231. Array RegEx::search_all(const String &p_subject, int p_offset, int p_end) const {
  232. int last_end = -1;
  233. Array result;
  234. Ref<RegExMatch> match = search(p_subject, p_offset, p_end);
  235. while (match.is_valid()) {
  236. if (last_end == match->get_end(0))
  237. break;
  238. result.push_back(match);
  239. last_end = match->get_end(0);
  240. match = search(p_subject, match->get_end(0), p_end);
  241. }
  242. return result;
  243. }
  244. String RegEx::sub(const String &p_subject, const String &p_replacement, bool p_all, int p_offset, int p_end) const {
  245. ERR_FAIL_COND_V(!is_valid(), String());
  246. // safety_zone is the number of chars we allocate in addition to the number of chars expected in order to
  247. // guard against the PCRE API writing one additional \0 at the end. PCRE's API docs are unclear on whether
  248. // PCRE understands outlength in pcre2_substitute() as counting an implicit additional terminating char or
  249. // not. always allocating one char more than telling PCRE has us on the safe side.
  250. const int safety_zone = 1;
  251. PCRE2_SIZE olength = p_subject.length() + 1; // space for output string and one terminating \0 character
  252. Vector<CharType> output;
  253. output.resize(olength + safety_zone);
  254. uint32_t flags = PCRE2_SUBSTITUTE_OVERFLOW_LENGTH;
  255. if (p_all)
  256. flags |= PCRE2_SUBSTITUTE_GLOBAL;
  257. PCRE2_SIZE length = p_subject.length();
  258. if (p_end >= 0 && (uint32_t)p_end < length)
  259. length = p_end;
  260. if (sizeof(CharType) == 2) {
  261. pcre2_code_16 *c = (pcre2_code_16 *)code;
  262. pcre2_general_context_16 *gctx = (pcre2_general_context_16 *)general_ctx;
  263. pcre2_match_context_16 *mctx = pcre2_match_context_create_16(gctx);
  264. PCRE2_SPTR16 s = (PCRE2_SPTR16)p_subject.c_str();
  265. PCRE2_SPTR16 r = (PCRE2_SPTR16)p_replacement.c_str();
  266. PCRE2_UCHAR16 *o = (PCRE2_UCHAR16 *)output.ptrw();
  267. pcre2_match_data_16 *match = pcre2_match_data_create_from_pattern_16(c, gctx);
  268. int res = pcre2_substitute_16(c, s, length, p_offset, flags, match, mctx, r, p_replacement.length(), o, &olength);
  269. if (res == PCRE2_ERROR_NOMEMORY) {
  270. output.resize(olength + safety_zone);
  271. o = (PCRE2_UCHAR16 *)output.ptrw();
  272. res = pcre2_substitute_16(c, s, length, p_offset, flags, match, mctx, r, p_replacement.length(), o, &olength);
  273. }
  274. pcre2_match_data_free_16(match);
  275. pcre2_match_context_free_16(mctx);
  276. if (res < 0)
  277. return String();
  278. } else {
  279. pcre2_code_32 *c = (pcre2_code_32 *)code;
  280. pcre2_general_context_32 *gctx = (pcre2_general_context_32 *)general_ctx;
  281. pcre2_match_context_32 *mctx = pcre2_match_context_create_32(gctx);
  282. PCRE2_SPTR32 s = (PCRE2_SPTR32)p_subject.c_str();
  283. PCRE2_SPTR32 r = (PCRE2_SPTR32)p_replacement.c_str();
  284. PCRE2_UCHAR32 *o = (PCRE2_UCHAR32 *)output.ptrw();
  285. pcre2_match_data_32 *match = pcre2_match_data_create_from_pattern_32(c, gctx);
  286. int res = pcre2_substitute_32(c, s, length, p_offset, flags, match, mctx, r, p_replacement.length(), o, &olength);
  287. if (res == PCRE2_ERROR_NOMEMORY) {
  288. output.resize(olength + safety_zone);
  289. o = (PCRE2_UCHAR32 *)output.ptrw();
  290. res = pcre2_substitute_32(c, s, length, p_offset, flags, match, mctx, r, p_replacement.length(), o, &olength);
  291. }
  292. pcre2_match_data_free_32(match);
  293. pcre2_match_context_free_32(mctx);
  294. if (res < 0)
  295. return String();
  296. }
  297. return String(output.ptr(), olength);
  298. }
  299. bool RegEx::is_valid() const {
  300. return (code != NULL);
  301. }
  302. String RegEx::get_pattern() const {
  303. return pattern;
  304. }
  305. int RegEx::get_group_count() const {
  306. ERR_FAIL_COND_V(!is_valid(), 0);
  307. uint32_t count;
  308. _pattern_info(PCRE2_INFO_CAPTURECOUNT, &count);
  309. return count;
  310. }
  311. Array RegEx::get_names() const {
  312. Array result;
  313. ERR_FAIL_COND_V(!is_valid(), result);
  314. uint32_t count;
  315. const CharType *table;
  316. uint32_t entry_size;
  317. _pattern_info(PCRE2_INFO_NAMECOUNT, &count);
  318. _pattern_info(PCRE2_INFO_NAMETABLE, &table);
  319. _pattern_info(PCRE2_INFO_NAMEENTRYSIZE, &entry_size);
  320. for (uint32_t i = 0; i < count; i++) {
  321. String name = &table[i * entry_size + 1];
  322. if (result.find(name) < 0) {
  323. result.append(name);
  324. }
  325. }
  326. return result;
  327. }
  328. RegEx::RegEx() {
  329. if (sizeof(CharType) == 2) {
  330. general_ctx = pcre2_general_context_create_16(&_regex_malloc, &_regex_free, NULL);
  331. } else {
  332. general_ctx = pcre2_general_context_create_32(&_regex_malloc, &_regex_free, NULL);
  333. }
  334. code = NULL;
  335. }
  336. RegEx::RegEx(const String &p_pattern) {
  337. if (sizeof(CharType) == 2) {
  338. general_ctx = pcre2_general_context_create_16(&_regex_malloc, &_regex_free, NULL);
  339. } else {
  340. general_ctx = pcre2_general_context_create_32(&_regex_malloc, &_regex_free, NULL);
  341. }
  342. code = NULL;
  343. compile(p_pattern);
  344. }
  345. RegEx::~RegEx() {
  346. if (sizeof(CharType) == 2) {
  347. if (code)
  348. pcre2_code_free_16((pcre2_code_16 *)code);
  349. pcre2_general_context_free_16((pcre2_general_context_16 *)general_ctx);
  350. } else {
  351. if (code)
  352. pcre2_code_free_32((pcre2_code_32 *)code);
  353. pcre2_general_context_free_32((pcre2_general_context_32 *)general_ctx);
  354. }
  355. }
  356. void RegEx::_bind_methods() {
  357. ClassDB::bind_method(D_METHOD("clear"), &RegEx::clear);
  358. ClassDB::bind_method(D_METHOD("compile", "pattern"), &RegEx::compile);
  359. ClassDB::bind_method(D_METHOD("search", "subject", "offset", "end"), &RegEx::search, DEFVAL(0), DEFVAL(-1));
  360. ClassDB::bind_method(D_METHOD("search_all", "subject", "offset", "end"), &RegEx::search_all, DEFVAL(0), DEFVAL(-1));
  361. ClassDB::bind_method(D_METHOD("sub", "subject", "replacement", "all", "offset", "end"), &RegEx::sub, DEFVAL(false), DEFVAL(0), DEFVAL(-1));
  362. ClassDB::bind_method(D_METHOD("is_valid"), &RegEx::is_valid);
  363. ClassDB::bind_method(D_METHOD("get_pattern"), &RegEx::get_pattern);
  364. ClassDB::bind_method(D_METHOD("get_group_count"), &RegEx::get_group_count);
  365. ClassDB::bind_method(D_METHOD("get_names"), &RegEx::get_names);
  366. }