regex.cpp 14 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518
  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. }
  114. void RegEx::_pattern_info(uint32_t what, void *where) const {
  115. if (sizeof(CharType) == 2) {
  116. pcre2_pattern_info_16((pcre2_code_16 *)code, what, where);
  117. } else {
  118. pcre2_pattern_info_32((pcre2_code_32 *)code, what, where);
  119. }
  120. }
  121. void RegEx::clear() {
  122. if (sizeof(CharType) == 2) {
  123. if (code)
  124. pcre2_code_free_16((pcre2_code_16 *)code);
  125. } else {
  126. if (code)
  127. pcre2_code_free_32((pcre2_code_32 *)code);
  128. }
  129. }
  130. Error RegEx::compile(const String &p_pattern) {
  131. pattern = p_pattern;
  132. clear();
  133. int err;
  134. PCRE2_SIZE offset;
  135. uint32_t flags = PCRE2_DUPNAMES;
  136. if (sizeof(CharType) == 2) {
  137. pcre2_general_context_16 *gctx = (pcre2_general_context_16 *)general_ctx;
  138. pcre2_compile_context_16 *cctx = pcre2_compile_context_create_16(gctx);
  139. PCRE2_SPTR16 p = (PCRE2_SPTR16)pattern.c_str();
  140. code = pcre2_compile_16(p, pattern.length(), flags, &err, &offset, cctx);
  141. if (!code) {
  142. PCRE2_UCHAR16 buf[256];
  143. pcre2_get_error_message_16(err, buf, 256);
  144. String message = String::num(offset) + ": " + String((const CharType *)buf);
  145. ERR_PRINT(message.utf8());
  146. return FAILED;
  147. }
  148. } else {
  149. pcre2_general_context_32 *gctx = (pcre2_general_context_32 *)general_ctx;
  150. pcre2_compile_context_32 *cctx = pcre2_compile_context_create_32(gctx);
  151. PCRE2_SPTR32 p = (PCRE2_SPTR32)pattern.c_str();
  152. code = pcre2_compile_32(p, pattern.length(), flags, &err, &offset, cctx);
  153. if (!code) {
  154. PCRE2_UCHAR32 buf[256];
  155. pcre2_get_error_message_32(err, buf, 256);
  156. String message = String::num(offset) + ": " + String((const CharType *)buf);
  157. ERR_PRINT(message.utf8());
  158. return FAILED;
  159. }
  160. }
  161. return OK;
  162. }
  163. Ref<RegExMatch> RegEx::search(const String &p_subject, int p_offset, int p_end) const {
  164. ERR_FAIL_COND_V(!is_valid(), NULL);
  165. Ref<RegExMatch> result = memnew(RegExMatch);
  166. int length = p_subject.length();
  167. if (p_end >= 0 && p_end < length)
  168. length = p_end;
  169. if (sizeof(CharType) == 2) {
  170. pcre2_code_16 *c = (pcre2_code_16 *)code;
  171. pcre2_general_context_16 *gctx = (pcre2_general_context_16 *)general_ctx;
  172. pcre2_match_context_16 *mctx = pcre2_match_context_create_16(gctx);
  173. PCRE2_SPTR16 s = (PCRE2_SPTR16)p_subject.c_str();
  174. pcre2_match_data_16 *match = pcre2_match_data_create_from_pattern_16(c, gctx);
  175. int res = pcre2_match_16(c, s, length, p_offset, 0, match, mctx);
  176. if (res < 0) {
  177. pcre2_match_data_free_16(match);
  178. return NULL;
  179. }
  180. uint32_t size = pcre2_get_ovector_count_16(match);
  181. PCRE2_SIZE *ovector = pcre2_get_ovector_pointer_16(match);
  182. result->data.resize(size);
  183. for (uint32_t i = 0; i < size; i++) {
  184. result->data[i].start = ovector[i * 2];
  185. result->data[i].end = ovector[i * 2 + 1];
  186. }
  187. pcre2_match_data_free_16(match);
  188. pcre2_match_context_free_16(mctx);
  189. } else {
  190. pcre2_code_32 *c = (pcre2_code_32 *)code;
  191. pcre2_general_context_32 *gctx = (pcre2_general_context_32 *)general_ctx;
  192. pcre2_match_context_32 *mctx = pcre2_match_context_create_32(gctx);
  193. PCRE2_SPTR32 s = (PCRE2_SPTR32)p_subject.c_str();
  194. pcre2_match_data_32 *match = pcre2_match_data_create_from_pattern_32(c, gctx);
  195. int res = pcre2_match_32(c, s, length, p_offset, 0, match, mctx);
  196. if (res < 0) {
  197. pcre2_match_data_free_32(match);
  198. return NULL;
  199. }
  200. uint32_t size = pcre2_get_ovector_count_32(match);
  201. PCRE2_SIZE *ovector = pcre2_get_ovector_pointer_32(match);
  202. result->data.resize(size);
  203. for (uint32_t i = 0; i < size; i++) {
  204. result->data[i].start = ovector[i * 2];
  205. result->data[i].end = ovector[i * 2 + 1];
  206. }
  207. pcre2_match_data_free_32(match);
  208. pcre2_match_context_free_32(mctx);
  209. }
  210. result->subject = p_subject;
  211. uint32_t count;
  212. const CharType *table;
  213. uint32_t entry_size;
  214. _pattern_info(PCRE2_INFO_NAMECOUNT, &count);
  215. _pattern_info(PCRE2_INFO_NAMETABLE, &table);
  216. _pattern_info(PCRE2_INFO_NAMEENTRYSIZE, &entry_size);
  217. for (uint32_t i = 0; i < count; i++) {
  218. CharType id = table[i * entry_size];
  219. if (result->data[id].start == -1)
  220. continue;
  221. String name = &table[i * entry_size + 1];
  222. if (result->names.has(name))
  223. continue;
  224. result->names.insert(name, id);
  225. }
  226. return result;
  227. }
  228. Array RegEx::search_all(const String &p_subject, int p_offset, int p_end) const {
  229. int last_end = -1;
  230. Array result;
  231. Ref<RegExMatch> match = search(p_subject, p_offset, p_end);
  232. while (match.is_valid()) {
  233. if (last_end == match->get_end(0))
  234. break;
  235. result.push_back(match);
  236. last_end = match->get_end(0);
  237. match = search(p_subject, match->get_end(0), p_end);
  238. }
  239. return result;
  240. }
  241. String RegEx::sub(const String &p_subject, const String &p_replacement, bool p_all, int p_offset, int p_end) const {
  242. ERR_FAIL_COND_V(!is_valid(), String());
  243. // safety_zone is the number of chars we allocate in addition to the number of chars expected in order to
  244. // guard against the PCRE API writing one additional \0 at the end. PCRE's API docs are unclear on whether
  245. // PCRE understands outlength in pcre2_substitute() as counting an implicit additional terminating char or
  246. // not. always allocating one char more than telling PCRE has us on the safe side.
  247. const int safety_zone = 1;
  248. PCRE2_SIZE olength = p_subject.length() + 1; // space for output string and one terminating \0 character
  249. Vector<CharType> output;
  250. output.resize(olength + safety_zone);
  251. uint32_t flags = PCRE2_SUBSTITUTE_OVERFLOW_LENGTH;
  252. if (p_all)
  253. flags |= PCRE2_SUBSTITUTE_GLOBAL;
  254. PCRE2_SIZE length = p_subject.length();
  255. if (p_end >= 0 && (uint32_t)p_end < length)
  256. length = p_end;
  257. if (sizeof(CharType) == 2) {
  258. pcre2_code_16 *c = (pcre2_code_16 *)code;
  259. pcre2_general_context_16 *gctx = (pcre2_general_context_16 *)general_ctx;
  260. pcre2_match_context_16 *mctx = pcre2_match_context_create_16(gctx);
  261. PCRE2_SPTR16 s = (PCRE2_SPTR16)p_subject.c_str();
  262. PCRE2_SPTR16 r = (PCRE2_SPTR16)p_replacement.c_str();
  263. PCRE2_UCHAR16 *o = (PCRE2_UCHAR16 *)output.ptrw();
  264. pcre2_match_data_16 *match = pcre2_match_data_create_from_pattern_16(c, gctx);
  265. int res = pcre2_substitute_16(c, s, length, p_offset, flags, match, mctx, r, p_replacement.length(), o, &olength);
  266. if (res == PCRE2_ERROR_NOMEMORY) {
  267. output.resize(olength + safety_zone);
  268. o = (PCRE2_UCHAR16 *)output.ptrw();
  269. res = pcre2_substitute_16(c, s, length, p_offset, flags, match, mctx, r, p_replacement.length(), o, &olength);
  270. }
  271. pcre2_match_data_free_16(match);
  272. pcre2_match_context_free_16(mctx);
  273. if (res < 0)
  274. return String();
  275. } else {
  276. pcre2_code_32 *c = (pcre2_code_32 *)code;
  277. pcre2_general_context_32 *gctx = (pcre2_general_context_32 *)general_ctx;
  278. pcre2_match_context_32 *mctx = pcre2_match_context_create_32(gctx);
  279. PCRE2_SPTR32 s = (PCRE2_SPTR32)p_subject.c_str();
  280. PCRE2_SPTR32 r = (PCRE2_SPTR32)p_replacement.c_str();
  281. PCRE2_UCHAR32 *o = (PCRE2_UCHAR32 *)output.ptrw();
  282. pcre2_match_data_32 *match = pcre2_match_data_create_from_pattern_32(c, gctx);
  283. int res = pcre2_substitute_32(c, s, length, p_offset, flags, match, mctx, r, p_replacement.length(), o, &olength);
  284. if (res == PCRE2_ERROR_NOMEMORY) {
  285. output.resize(olength + safety_zone);
  286. o = (PCRE2_UCHAR32 *)output.ptrw();
  287. res = pcre2_substitute_32(c, s, length, p_offset, flags, match, mctx, r, p_replacement.length(), o, &olength);
  288. }
  289. pcre2_match_data_free_32(match);
  290. pcre2_match_context_free_32(mctx);
  291. if (res < 0)
  292. return String();
  293. }
  294. return String(output.ptr(), olength);
  295. }
  296. bool RegEx::is_valid() const {
  297. return (code != NULL);
  298. }
  299. String RegEx::get_pattern() const {
  300. return pattern;
  301. }
  302. int RegEx::get_group_count() const {
  303. ERR_FAIL_COND_V(!is_valid(), 0);
  304. uint32_t count;
  305. _pattern_info(PCRE2_INFO_CAPTURECOUNT, &count);
  306. return count;
  307. }
  308. Array RegEx::get_names() const {
  309. Array result;
  310. ERR_FAIL_COND_V(!is_valid(), result);
  311. uint32_t count;
  312. const CharType *table;
  313. uint32_t entry_size;
  314. _pattern_info(PCRE2_INFO_NAMECOUNT, &count);
  315. _pattern_info(PCRE2_INFO_NAMETABLE, &table);
  316. _pattern_info(PCRE2_INFO_NAMEENTRYSIZE, &entry_size);
  317. for (uint32_t i = 0; i < count; i++) {
  318. String name = &table[i * entry_size + 1];
  319. if (result.find(name) < 0) {
  320. result.append(name);
  321. }
  322. }
  323. return result;
  324. }
  325. RegEx::RegEx() {
  326. if (sizeof(CharType) == 2) {
  327. general_ctx = pcre2_general_context_create_16(&_regex_malloc, &_regex_free, NULL);
  328. } else {
  329. general_ctx = pcre2_general_context_create_32(&_regex_malloc, &_regex_free, NULL);
  330. }
  331. code = NULL;
  332. }
  333. RegEx::RegEx(const String &p_pattern) {
  334. if (sizeof(CharType) == 2) {
  335. general_ctx = pcre2_general_context_create_16(&_regex_malloc, &_regex_free, NULL);
  336. } else {
  337. general_ctx = pcre2_general_context_create_32(&_regex_malloc, &_regex_free, NULL);
  338. }
  339. code = NULL;
  340. compile(p_pattern);
  341. }
  342. RegEx::~RegEx() {
  343. if (sizeof(CharType) == 2) {
  344. if (code)
  345. pcre2_code_free_16((pcre2_code_16 *)code);
  346. pcre2_general_context_free_16((pcre2_general_context_16 *)general_ctx);
  347. } else {
  348. if (code)
  349. pcre2_code_free_32((pcre2_code_32 *)code);
  350. pcre2_general_context_free_32((pcre2_general_context_32 *)general_ctx);
  351. }
  352. }
  353. void RegEx::_bind_methods() {
  354. ClassDB::bind_method(D_METHOD("clear"), &RegEx::clear);
  355. ClassDB::bind_method(D_METHOD("compile", "pattern"), &RegEx::compile);
  356. ClassDB::bind_method(D_METHOD("search", "subject", "offset", "end"), &RegEx::search, DEFVAL(0), DEFVAL(-1));
  357. ClassDB::bind_method(D_METHOD("search_all", "subject", "offset", "end"), &RegEx::search_all, DEFVAL(0), DEFVAL(-1));
  358. ClassDB::bind_method(D_METHOD("sub", "subject", "replacement", "all", "offset", "end"), &RegEx::sub, DEFVAL(false), DEFVAL(0), DEFVAL(-1));
  359. ClassDB::bind_method(D_METHOD("is_valid"), &RegEx::is_valid);
  360. ClassDB::bind_method(D_METHOD("get_pattern"), &RegEx::get_pattern);
  361. ClassDB::bind_method(D_METHOD("get_group_count"), &RegEx::get_group_count);
  362. ClassDB::bind_method(D_METHOD("get_names"), &RegEx::get_names);
  363. }