1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
|
%% The contents of this file are subject to the Mozilla Public License
%% Version 1.1 (the "License"); you may not use this file except in
%% compliance with the License. You may obtain a copy of the License
%% at http://www.mozilla.org/MPL/
%%
%% Software distributed under the License is distributed on an "AS IS"
%% basis, WITHOUT WARRANTY OF ANY KIND, either express or implied. See
%% the License for the specific language governing rights and
%% limitations under the License.
%%
%% The Original Code is RabbitMQ.
%%
%% The Initial Developer of the Original Code is GoPivotal, Inc.
%% Copyright (c) 2007-2014 GoPivotal, Inc. All rights reserved.
%%
-module(truncate).
-export([log_event/2]).
%% exported for testing
-export([term/2]).
log_event({Type, GL, {Pid, Format, Args}}, Size)
when Type =:= error orelse
Type =:= info_msg orelse
Type =:= warning_msg ->
{Type, GL, {Pid, Format, [term(T, Size) || T <- Args]}};
log_event({Type, GL, {Pid, ReportType, Report}}, Size)
when Type =:= error_report orelse
Type =:= info_report orelse
Type =:= warning_report ->
Report2 = case ReportType of
crash_report -> [[{K, term(V, Size)} || {K, V} <- R] ||
R <- Report];
_ -> [{K, term(V, Size)} || {K, V} <- Report]
end,
{Type, GL, {Pid, ReportType, Report2}};
log_event(Event, _Size) ->
Event.
%% TODO: avoid copying
%% TODO: can we get away with using binary:part/3 (OTP vsn requirements)?
%% TODO: reconsider depth limit handling
term(T, 0) -> T;
term(T, N) when is_binary(T) andalso size(T) > N ->
Suffix = N - 3,
Len = case is_bitstring(T) of
true -> byte_size(T);
false -> size(T)
end,
case Len - Suffix of
Sz when Sz >= 1 -> <<Head:Suffix/binary, _/binary>> = T,
<<Head/binary, <<"...">>/binary>>;
_ -> T
end;
term([A|B], N) when not is_list(B) ->
term([A,B], N);
term(T, N) when is_list(T) ->
IsPrintable = io_lib:printable_list(T),
Len = length(T),
case {Len > N, IsPrintable} of
{true, true}
when N > 3 -> lists:append(lists:sublist(T, resize(N-3)), "...");
{true, false} -> lists:append([term(E, resize(N-1, Len)) ||
E <- lists:sublist(T, resize(N-1))],
['...']);
{false, false} -> [term(E, resize(N-1, Len)) || E <- T];
_ -> T
end;
term(T, N) when is_tuple(T) ->
case tuple_size(T) > N of
true -> list_to_tuple(
lists:append([term(E, N-1) ||
E <- lists:sublist(tuple_to_list(T), N-1)],
['...']));
false -> list_to_tuple([term(E, N-1) ||
E <- tuple_to_list(T)])
end;
term(T, _) -> T.
resize(N) -> resize(N, 1).
resize(N, M) -> erlang:max(N, M).
|
