compressed_translation.cpp 8.2 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292
  1. /*************************************************************************/
  2. /* compressed_translation.cpp */
  3. /*************************************************************************/
  4. /* This file is part of: */
  5. /* GODOT ENGINE */
  6. /* https://godotengine.org */
  7. /*************************************************************************/
  8. /* Copyright (c) 2007-2019 Juan Linietsky, Ariel Manzur. */
  9. /* Copyright (c) 2014-2019 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 "compressed_translation.h"
  31. #include "core/pair.h"
  32. extern "C" {
  33. #include "thirdparty/misc/smaz.h"
  34. }
  35. struct _PHashTranslationCmp {
  36. int orig_len;
  37. CharString compressed;
  38. int offset;
  39. };
  40. void PHashTranslation::generate(const Ref<Translation> &p_from) {
  41. #ifdef TOOLS_ENABLED
  42. List<StringName> keys;
  43. p_from->get_message_list(&keys);
  44. int size = Math::larger_prime(keys.size());
  45. Vector<Vector<Pair<int, CharString> > > buckets;
  46. Vector<Map<uint32_t, int> > table;
  47. Vector<uint32_t> hfunc_table;
  48. Vector<_PHashTranslationCmp> compressed;
  49. table.resize(size);
  50. hfunc_table.resize(size);
  51. buckets.resize(size);
  52. compressed.resize(keys.size());
  53. int idx = 0;
  54. int total_compression_size = 0;
  55. int total_string_size = 0;
  56. for (List<StringName>::Element *E = keys.front(); E; E = E->next()) {
  57. //hash string
  58. CharString cs = E->get().operator String().utf8();
  59. uint32_t h = hash(0, cs.get_data());
  60. Pair<int, CharString> p;
  61. p.first = idx;
  62. p.second = cs;
  63. buckets.write[h % size].push_back(p);
  64. //compress string
  65. CharString src_s = p_from->get_message(E->get()).operator String().utf8();
  66. _PHashTranslationCmp ps;
  67. ps.orig_len = src_s.size();
  68. ps.offset = total_compression_size;
  69. if (ps.orig_len != 0) {
  70. CharString dst_s;
  71. dst_s.resize(src_s.size());
  72. int ret = smaz_compress(src_s.get_data(), src_s.size(), dst_s.ptrw(), src_s.size());
  73. if (ret >= src_s.size()) {
  74. //if compressed is larger than original, just use original
  75. ps.orig_len = src_s.size();
  76. ps.compressed = src_s;
  77. } else {
  78. dst_s.resize(ret);
  79. //ps.orig_len=;
  80. ps.compressed = dst_s;
  81. }
  82. } else {
  83. ps.orig_len = 1;
  84. ps.compressed.resize(1);
  85. ps.compressed[0] = 0;
  86. }
  87. compressed.write[idx] = ps;
  88. total_compression_size += ps.compressed.size();
  89. total_string_size += src_s.size();
  90. idx++;
  91. }
  92. int bucket_table_size = 0;
  93. for (int i = 0; i < size; i++) {
  94. const Vector<Pair<int, CharString> > &b = buckets[i];
  95. Map<uint32_t, int> &t = table.write[i];
  96. if (b.size() == 0)
  97. continue;
  98. int d = 1;
  99. int item = 0;
  100. while (item < b.size()) {
  101. uint32_t slot = hash(d, b[item].second.get_data());
  102. if (t.has(slot)) {
  103. item = 0;
  104. d++;
  105. t.clear();
  106. } else {
  107. t[slot] = b[item].first;
  108. item++;
  109. }
  110. }
  111. hfunc_table.write[i] = d;
  112. bucket_table_size += 2 + b.size() * 4;
  113. }
  114. hash_table.resize(size);
  115. bucket_table.resize(bucket_table_size);
  116. PoolVector<int>::Write htwb = hash_table.write();
  117. PoolVector<int>::Write btwb = bucket_table.write();
  118. uint32_t *htw = (uint32_t *)&htwb[0];
  119. uint32_t *btw = (uint32_t *)&btwb[0];
  120. int btindex = 0;
  121. int collisions = 0;
  122. for (int i = 0; i < size; i++) {
  123. const Map<uint32_t, int> &t = table[i];
  124. if (t.size() == 0) {
  125. htw[i] = 0xFFFFFFFF; //nothing
  126. continue;
  127. } else if (t.size() > 1) {
  128. collisions += t.size() - 1;
  129. }
  130. htw[i] = btindex;
  131. btw[btindex++] = t.size();
  132. btw[btindex++] = hfunc_table[i];
  133. for (Map<uint32_t, int>::Element *E = t.front(); E; E = E->next()) {
  134. btw[btindex++] = E->key();
  135. btw[btindex++] = compressed[E->get()].offset;
  136. btw[btindex++] = compressed[E->get()].compressed.size();
  137. btw[btindex++] = compressed[E->get()].orig_len;
  138. }
  139. }
  140. strings.resize(total_compression_size);
  141. PoolVector<uint8_t>::Write cw = strings.write();
  142. for (int i = 0; i < compressed.size(); i++) {
  143. memcpy(&cw[compressed[i].offset], compressed[i].compressed.get_data(), compressed[i].compressed.size());
  144. }
  145. ERR_FAIL_COND(btindex != bucket_table_size);
  146. set_locale(p_from->get_locale());
  147. #endif
  148. }
  149. bool PHashTranslation::_set(const StringName &p_name, const Variant &p_value) {
  150. String name = p_name.operator String();
  151. if (name == "hash_table") {
  152. hash_table = p_value;
  153. } else if (name == "bucket_table") {
  154. bucket_table = p_value;
  155. } else if (name == "strings") {
  156. strings = p_value;
  157. } else if (name == "load_from") {
  158. generate(p_value);
  159. } else
  160. return false;
  161. return true;
  162. }
  163. bool PHashTranslation::_get(const StringName &p_name, Variant &r_ret) const {
  164. String name = p_name.operator String();
  165. if (name == "hash_table")
  166. r_ret = hash_table;
  167. else if (name == "bucket_table")
  168. r_ret = bucket_table;
  169. else if (name == "strings")
  170. r_ret = strings;
  171. else
  172. return false;
  173. return true;
  174. }
  175. StringName PHashTranslation::get_message(const StringName &p_src_text) const {
  176. int htsize = hash_table.size();
  177. if (htsize == 0)
  178. return StringName();
  179. CharString str = p_src_text.operator String().utf8();
  180. uint32_t h = hash(0, str.get_data());
  181. PoolVector<int>::Read htr = hash_table.read();
  182. const uint32_t *htptr = (const uint32_t *)&htr[0];
  183. PoolVector<int>::Read btr = bucket_table.read();
  184. const uint32_t *btptr = (const uint32_t *)&btr[0];
  185. PoolVector<uint8_t>::Read sr = strings.read();
  186. const char *sptr = (const char *)&sr[0];
  187. uint32_t p = htptr[h % htsize];
  188. if (p == 0xFFFFFFFF) {
  189. return StringName(); //nothing
  190. }
  191. const Bucket &bucket = *(const Bucket *)&btptr[p];
  192. h = hash(bucket.func, str.get_data());
  193. int idx = -1;
  194. for (int i = 0; i < bucket.size; i++) {
  195. if (bucket.elem[i].key == h) {
  196. idx = i;
  197. break;
  198. }
  199. }
  200. if (idx == -1) {
  201. return StringName();
  202. }
  203. if (bucket.elem[idx].comp_size == bucket.elem[idx].uncomp_size) {
  204. String rstr;
  205. rstr.parse_utf8(&sptr[bucket.elem[idx].str_offset], bucket.elem[idx].uncomp_size);
  206. return rstr;
  207. } else {
  208. CharString uncomp;
  209. uncomp.resize(bucket.elem[idx].uncomp_size + 1);
  210. smaz_decompress(&sptr[bucket.elem[idx].str_offset], bucket.elem[idx].comp_size, uncomp.ptrw(), bucket.elem[idx].uncomp_size);
  211. String rstr;
  212. rstr.parse_utf8(uncomp.get_data());
  213. return rstr;
  214. }
  215. }
  216. void PHashTranslation::_get_property_list(List<PropertyInfo> *p_list) const {
  217. p_list->push_back(PropertyInfo(Variant::POOL_INT_ARRAY, "hash_table"));
  218. p_list->push_back(PropertyInfo(Variant::POOL_INT_ARRAY, "bucket_table"));
  219. p_list->push_back(PropertyInfo(Variant::POOL_BYTE_ARRAY, "strings"));
  220. p_list->push_back(PropertyInfo(Variant::OBJECT, "load_from", PROPERTY_HINT_RESOURCE_TYPE, "Translation", PROPERTY_USAGE_EDITOR));
  221. }
  222. void PHashTranslation::_bind_methods() {
  223. ClassDB::bind_method(D_METHOD("generate", "from"), &PHashTranslation::generate);
  224. }
  225. PHashTranslation::PHashTranslation() {
  226. }