You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.

104 lines
3.1 KiB

  1. % This file is part of Jiffy released under the MIT license.
  2. % See the LICENSE file for more information.
  3. -module(jiffy_utf8).
  4. -export([fix/1]).
  5. fix({Props}) ->
  6. fix_props(Props, []);
  7. fix(Values) when is_list(Values) ->
  8. fix_array(Values, []);
  9. fix(Bin) when is_binary(Bin) ->
  10. fix_bin(Bin);
  11. fix(Val) ->
  12. Val.
  13. fix_props([], Acc) ->
  14. {lists:reverse(Acc)};
  15. fix_props([{K0, V0} | Rest], Acc) ->
  16. K = fix(K0),
  17. V = fix(V0),
  18. fix_props(Rest, [{K, V} | Acc]).
  19. fix_array([], Acc) ->
  20. lists:reverse(Acc);
  21. fix_array([Val | Rest], Acc0) ->
  22. Acc = [fix(Val) | Acc0],
  23. fix_array(Rest, Acc).
  24. fix_bin(Bin) ->
  25. Dec0 = loose_decode(Bin, 0, []),
  26. Dec1 = try_combining(Dec0, []),
  27. Dec2 = replace_garbage(Dec1, []),
  28. list_to_binary(xmerl_ucs:to_utf8(Dec2)).
  29. loose_decode(Bin, O, Acc) ->
  30. case Bin of
  31. <<_:O/binary>> ->
  32. lists:reverse(Acc);
  33. <<_:O/binary, 0:1/integer, V:7/integer, _/binary>> ->
  34. loose_decode(Bin, O+1, [V | Acc]);
  35. <<_:O/binary, 6:3/integer, V0:5/integer,
  36. 2:2/integer, V1:6/integer, _/binary>> ->
  37. B = <<0:5/integer, V0:5/integer, V1:6/integer>>,
  38. <<V:16/integer>> = B,
  39. loose_decode(Bin, O+2, [V | Acc]);
  40. <<_:O/binary, 14:4/integer, V0:4/integer,
  41. 2:2/integer, V1:6/integer,
  42. 2:2/integer, V2:6/integer, _/binary>> ->
  43. B = <<V0:4/integer, V1:6/integer, V2:6/integer>>,
  44. <<V:16/integer>> = B,
  45. loose_decode(Bin, O+3, [V | Acc]);
  46. <<_:O/binary, 30:5/integer, V0:3/integer,
  47. 2:2/integer, V1:6/integer,
  48. 2:2/integer, V2:6/integer,
  49. 2:2/integer, V3:6/integer, _/binary>> ->
  50. B = <<0:11/integer, V0:3/integer, V1:6/integer,
  51. V2:6/integer, V3:6/integer>>,
  52. <<V:32/integer>> = B,
  53. loose_decode(Bin, O+4, [V | Acc]);
  54. <<_:O/binary, _:8/integer, R/binary>> ->
  55. % Broken lead or continuation byte. Discard first
  56. % byte and all broken continuations. Replace the
  57. % whole mess with a replacment code point.
  58. T = 1 + count_continuation_bytes(R, 0),
  59. loose_decode(Bin, O+T, [16#FFFD | Acc])
  60. end.
  61. count_continuation_bytes(R, O) ->
  62. case R of
  63. <<_:O/binary, 2:2/integer, _:6/integer, _/binary>> ->
  64. count_continuation_bytes(R, O+1);
  65. _ ->
  66. O
  67. end.
  68. try_combining([], Acc) ->
  69. lists:reverse(Acc);
  70. try_combining([H, L | Rest], Acc) when H >= 16#D800, H =< 16#DFFF,
  71. L >= 16#D800, L =< 16#DFFF ->
  72. Bin = <<H:16/big-unsigned-integer, L:16/big-unsigned-integer>>,
  73. try
  74. [C] = xmerl_ucs:from_utf16be(Bin),
  75. try_combining(Rest, [C | Acc])
  76. catch _:_ ->
  77. try_combining(Rest, [L, H | Acc])
  78. end;
  79. try_combining([C | Rest], Acc) ->
  80. try_combining(Rest, [C | Acc]).
  81. replace_garbage([], Acc) ->
  82. lists:reverse(Acc);
  83. replace_garbage([C | Rest], Acc) ->
  84. case xmerl_ucs:is_unicode(C) of
  85. true -> replace_garbage(Rest, [C | Acc]);
  86. false -> replace_garbage(Rest, [16#FFFD | Acc])
  87. end.