%% %% %CopyrightBegin% %% %% Copyright Ericsson AB 2010-2014. All Rights Reserved. %% %% The contents of this file are subject to the Erlang Public License, %% Version 1.1, (the "License"); you may not use this file except in %% compliance with the License. You should have received a copy of the %% Erlang Public License along with this software. If not, it can be %% retrieved online at http://www.erlang.org/. %% %% 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. %% %% %CopyrightEnd% %% -module(diameter_codec). -export([encode/2, decode/2, decode/3, collect_avps/1, decode_header/1, sequence_numbers/1, hop_by_hop_id/2, msg_name/2, msg_id/1]). %% Towards generated encoders (from diameter_gen.hrl). -export([pack_avp/1, pack_avp/2]). -include_lib("diameter/include/diameter.hrl"). -include("diameter_internal.hrl"). -define(MASK(N,I), ((I) band (1 bsl (N)))). -type u32() :: 0..16#FFFFFFFF. -type u24() :: 0..16#FFFFFF. -type u1() :: 0..1. %% 0 1 2 3 %% 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 %% +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ %% | Version | Message Length | %% +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ %% | command flags | Command-Code | %% +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ %% | Application-ID | %% +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ %% | Hop-by-Hop Identifier | %% +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ %% | End-to-End Identifier | %% +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ %% | AVPs ... %% +-+-+-+-+-+-+-+-+-+-+-+-+- %%% --------------------------------------------------------------------------- %%% # encode/2 %%% --------------------------------------------------------------------------- -spec encode(module(), Msg :: term()) -> #diameter_packet{} | no_return(). encode(Mod, #diameter_packet{} = Pkt) -> try e(Mod, Pkt) catch exit: {Reason, Stack, #diameter_header{} = H} = T -> %% Exit with a header in the reason to let the caller %% count encode errors. ?LOG(encode_error, {Reason, Stack, H}), exit({?MODULE, encode, T}); error: Reason -> T = {Reason, diameter_lib:get_stacktrace()}, ?LOG(encode_error, T), exit({?MODULE, encode, T}) end; encode(Mod, Msg) -> Seq = diameter_session:sequence(), Hdr = #diameter_header{version = ?DIAMETER_VERSION, end_to_end_id = Seq, hop_by_hop_id = Seq}, encode(Mod, #diameter_packet{header = Hdr, msg = Msg}). e(_, #diameter_packet{msg = [#diameter_header{} = Hdr | As]} = Pkt) -> try encode_avps(reorder(As)) of Avps -> Length = size(Avps) + 20, #diameter_header{version = Vsn, cmd_code = Code, application_id = Aid, hop_by_hop_id = Hid, end_to_end_id = Eid} = Hdr, Flags = make_flags(0, Hdr), Pkt#diameter_packet{header = Hdr, bin = <>} catch error: Reason -> exit({Reason, diameter_lib:get_stacktrace(), Hdr}) end; e(Mod, #diameter_packet{header = Hdr0, msg = Msg} = Pkt) -> #diameter_header{version = Vsn, hop_by_hop_id = Hid, end_to_end_id = Eid} = Hdr0, MsgName = rec2msg(Mod, Msg), {Code, Flags0, Aid} = msg_header(Mod, MsgName, Hdr0), Flags = make_flags(Flags0, Hdr0), Hdr = Hdr0#diameter_header{cmd_code = Code, application_id = Aid, is_request = 0 /= ?MASK(7, Flags), is_proxiable = 0 /= ?MASK(6, Flags), is_error = 0 /= ?MASK(5, Flags), is_retransmitted = 0 /= ?MASK(4, Flags)}, Values = values(Msg), try encode_avps(Mod, MsgName, Values) of Avps -> Length = size(Avps) + 20, Pkt#diameter_packet{header = Hdr#diameter_header{length = Length}, bin = <>} catch error: Reason -> exit({Reason, diameter_lib:get_stacktrace(), Hdr}) end. %% make_flags/2 make_flags(Flags0, #diameter_header{is_request = R, is_proxiable = P, is_error = E, is_retransmitted = T}) -> {Flags, 3} = lists:foldl(fun(B,{F,N}) -> {mf(B,F,N), N-1} end, {Flags0, 7}, [R,P,E,T]), Flags. mf(undefined, F, _) -> F; mf(B, F, N) -> %% reset the affected bit (F bxor (F band (1 bsl N))) bor bit(B, N). bit(true, N) -> 1 bsl N; bit(false, _) -> 0. %% values/1 values([H|T]) when is_atom(H) -> T; values(Avps) -> Avps. %% encode_avps/3 %% Specifying values as a #diameter_avp list bypasses arity and other %% checks: the values are expected to be already encoded and the AVP's %% presented are simply sent. This is needed for relay agents, since %% these have to be able to resend whatever comes. %% Message as a list of #diameter_avp{} ... encode_avps(_, _, [#diameter_avp{} | _] = Avps) -> encode_avps(reorder(Avps)); %% ... or as a tuple list or record. encode_avps(Mod, MsgName, Values) -> Mod:encode_avps(MsgName, Values). %% reorder/1 %% %% Reorder AVPs for the relay case using the index field of %% diameter_avp records. Decode populates this field in collect_avps %% and presents AVPs in reverse order. A relay then sends the reversed %% list with a Route-Record AVP prepended. The goal here is just to do %% lists:reverse/1 in Grouped AVPs and the outer list, but only in the %% case there are indexed AVPs at all, so as not to reverse lists that %% have been explicilty sent (unindexed, in the desired order) as a %% diameter_avp list. The effect is the same as lists:keysort/2, but %% only on the cases we expect, not a general sort. reorder(Avps) -> case reorder(Avps, []) of false -> Avps; Sorted -> Sorted end. %% reorder/3 %% In case someone has reversed the list already. (Not likely.) reorder([#diameter_avp{index = 0} | _] = Avps, Acc) -> Avps ++ Acc; %% Assume indexed AVPs are in reverse order. reorder([#diameter_avp{index = N} = A | Avps], Acc) when is_integer(N) -> lists:reverse(Avps, [A | Acc]); %% An unindexed AVP. reorder([H | T], Acc) -> reorder(T, [H | Acc]); %% No indexed members. reorder([], _) -> false. %% encode_avps/1 encode_avps(Avps) -> list_to_binary(lists:map(fun pack_avp/1, Avps)). %% msg_header/3 msg_header(Mod, 'answer-message' = MsgName, Header) -> 0 = Mod:id(), %% assert #diameter_header{application_id = Aid, cmd_code = Code} = Header, {-1, Flags, ?APP_ID_COMMON} = Mod:msg_header(MsgName), {Code, Flags, Aid}; msg_header(Mod, MsgName, _) -> Mod:msg_header(MsgName). %% rec2msg/2 rec2msg(_, [Name|_]) when is_atom(Name) -> Name; rec2msg(Mod, Rec) -> Mod:rec2msg(element(1, Rec)). %%% --------------------------------------------------------------------------- %%% # decode/2 %%% --------------------------------------------------------------------------- %% Unsuccessfully decoded AVPs will be placed in #diameter_packet.errors. -spec decode(module() | {module(), module()}, #diameter_packet{} | binary()) -> #diameter_packet{}. %% An Answer setting the E-bit. The application dictionary is needed %% for the best-effort decode of Failed-AVP, and the best way to make %% this available to the AVP decode in diameter_gen.hrl, without %% having to rewrite the entire codec generation, is to place it in %% the process dictionary. It's the code in diameter_gen.hrl (that's %% included by every generated codec module) that looks for the entry. %% Not ideal, but it solves the problem relatively simply. decode({Mod, Mod}, Pkt) -> decode(Mod, Pkt); decode({Mod, AppMod}, Pkt) -> Key = {?MODULE, dictionary}, put(Key, AppMod), try decode(Mod, Pkt) after erase(Key) end; %% Or not: a request, or an answer not setting the E-bit. decode(Mod, Pkt) -> decode(Mod:id(), Mod, Pkt). %% decode/3 %% Relay application: just extract the avp's without any decoding of %% their data since we don't know the application in question. decode(?APP_ID_RELAY, _, #diameter_packet{} = Pkt) -> case collect_avps(Pkt) of {E, As} -> Pkt#diameter_packet{avps = As, errors = [E]}; As -> Pkt#diameter_packet{avps = As} end; %% Otherwise decode using the dictionary. decode(_, Mod, #diameter_packet{header = Hdr} = Pkt) -> #diameter_header{cmd_code = CmdCode, is_request = IsRequest, is_error = IsError} = Hdr, MsgName = if IsError andalso not IsRequest -> 'answer-message'; true -> Mod:msg_name(CmdCode, IsRequest) end, decode_avps(MsgName, Mod, Pkt, collect_avps(Pkt)); decode(Id, Mod, Bin) when is_binary(Bin) -> decode(Id, Mod, #diameter_packet{header = decode_header(Bin), bin = Bin}). %% decode_avps/4 decode_avps(MsgName, Mod, Pkt, {E, Avps}) -> ?LOG(invalid_avp_length, Pkt#diameter_packet.header), #diameter_packet{errors = Failed} = P = decode_avps(MsgName, Mod, Pkt, Avps), P#diameter_packet{errors = [E | Failed]}; decode_avps('', _, Pkt, Avps) -> %% unknown message ... ?LOG(unknown_message, Pkt#diameter_packet.header), Pkt#diameter_packet{avps = lists:reverse(Avps), errors = [3001]}; %% DIAMETER_COMMAND_UNSUPPORTED %% msg = undefined identifies this case. decode_avps(MsgName, Mod, Pkt, Avps) -> %% ... or not {Rec, As, Errors} = Mod:decode_avps(MsgName, Avps), ?LOGC([] /= Errors, decode_errors, Pkt#diameter_packet.header), Pkt#diameter_packet{msg = Rec, errors = Errors, avps = As}. %%% --------------------------------------------------------------------------- %%% # decode_header/1 %%% --------------------------------------------------------------------------- -spec decode_header(binary()) -> #diameter_header{} | false. decode_header(<>) -> <> = CmdFlags, %% 3588 (ch 3) says that reserved bits MUST be set to 0 and ignored %% by the receiver. %% The RFC is quite unclear about the order of the bits in this %% case. It writes %% %% 0 1 2 3 4 5 6 7 %% +-+-+-+-+-+-+-+-+ %% |R P E T r r r r| %% +-+-+-+-+-+-+-+-+ %% %% in defining these but the scale refers to the (big endian) %% transmission order, first to last, not the bit order. That is, %% R is the high order bit. It's odd that a standard reserves %% low-order bit rather than high-order ones. #diameter_header{version = Version, length = MsgLength, cmd_code = CmdCode, application_id = ApplicationId, hop_by_hop_id = HopByHopId, end_to_end_id = EndToEndId, is_request = 1 == R, is_proxiable = 1 == P, is_error = 1 == E, is_retransmitted = 1 == T}; decode_header(_) -> false. %%% --------------------------------------------------------------------------- %%% # sequence_numbers/1 %%% --------------------------------------------------------------------------- %% The End-To-End identifier must be unique for at least 4 minutes. We %% maintain a 24-bit wraparound counter, and add an 8-bit persistent %% wraparound counter. The 8-bit counter is incremented each time the %% system is restarted. -spec sequence_numbers(#diameter_packet{} | #diameter_header{} | binary() | Seq) -> Seq when Seq :: {HopByHopId :: u32(), EndToEndId :: u32()}. sequence_numbers({_,_} = T) -> T; sequence_numbers(#diameter_packet{bin = Bin}) when is_binary(Bin) -> sequence_numbers(Bin); sequence_numbers(#diameter_packet{header = #diameter_header{} = H}) -> sequence_numbers(H); sequence_numbers(#diameter_packet{msg = [#diameter_header{} = H | _]}) -> sequence_numbers(H); sequence_numbers(#diameter_header{hop_by_hop_id = H, end_to_end_id = E}) -> {H,E}; sequence_numbers(<<_:12/binary, H:32, E:32, _/binary>>) -> {H,E}. %%% --------------------------------------------------------------------------- %%% # hop_by_hop_id/2 %%% --------------------------------------------------------------------------- -spec hop_by_hop_id(u32(), binary()) -> binary(). hop_by_hop_id(Id, <>) -> <>. %%% --------------------------------------------------------------------------- %%% # msg_name/2 %%% --------------------------------------------------------------------------- -spec msg_name(module(), #diameter_header{}) -> atom() | {ApplicationId :: u32(), CommandCode :: u24(), Rbit :: u1()}. msg_name(Dict0, #diameter_header{application_id = ?APP_ID_COMMON, cmd_code = C, is_request = R}) -> Dict0:msg_name(C,R); msg_name(_, Hdr) -> msg_id(Hdr). %% Note that messages in different applications could have the same %% name. %%% --------------------------------------------------------------------------- %%% # msg_id/1 %%% --------------------------------------------------------------------------- -spec msg_id(#diameter_packet{} | #diameter_header{}) -> {ApplicationId :: u32(), CommandCode :: u24(), Rbit :: u1()}. msg_id(#diameter_packet{msg = [#diameter_header{} = Hdr | _]}) -> msg_id(Hdr); msg_id(#diameter_packet{header = #diameter_header{} = Hdr}) -> msg_id(Hdr); msg_id(#diameter_header{application_id = A, cmd_code = C, is_request = R}) -> {A, C, if R -> 1; true -> 0 end}; msg_id(<<_:32, Rbit:1, _:7, CmdCode:24, ApplId:32, _/binary>>) -> {ApplId, CmdCode, Rbit}. %%% --------------------------------------------------------------------------- %%% # collect_avps/1 %%% --------------------------------------------------------------------------- %% Note that the returned list of AVP's is reversed relative to their %% order in the binary. Note also that grouped avp's aren't unraveled, %% only those at the top level. -spec collect_avps(#diameter_packet{} | binary()) -> [Avp] | {Error, [Avp]} when Avp :: #diameter_avp{}, Error :: {5014, #diameter_avp{}}. collect_avps(#diameter_packet{bin = Bin}) -> <<_:20/binary, Avps/binary>> = Bin, collect_avps(Avps); collect_avps(Bin) when is_binary(Bin) -> collect_avps(Bin, 0, []). collect_avps(<<>>, _, Acc) -> Acc; collect_avps(Bin, N, Acc) -> try split_avp(Bin) of {Rest, AVP} -> collect_avps(Rest, N+1, [AVP#diameter_avp{index = N} | Acc]) catch ?FAILURE(Error) -> {Error, Acc} end. %% 0 1 2 3 %% 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 %% +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ %% | AVP Code | %% +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ %% |V M P r r r r r| AVP Length | %% +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ %% | Vendor-ID (opt) | %% +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ %% | Data ... %% +-+-+-+-+-+-+-+-+ %% split_avp/1 split_avp(Bin) -> {Code, V, M, P, Len, HdrLen} = split_head(Bin), <<_:HdrLen/binary, Rest/binary>> = Bin, {Data, B} = split_data(Rest, Len - HdrLen), {B, #diameter_avp{code = Code, vendor_id = V, is_mandatory = 1 == M, need_encryption = 1 == P, data = Data}}. %% split_head/1 split_head(<>) -> {Code, V, M, P, Len, 12}; split_head(<>) -> {Code, undefined, M, P, Len, 8}; %% Header is truncated. split_head(Bin) -> ?THROW({5014, #diameter_avp{data = Bin}}). %% 3588: %% %% DIAMETER_INVALID_AVP_LENGTH 5014 %% The request contained an AVP with an invalid length. A Diameter %% message indicating this error MUST include the offending AVPs %% within a Failed-AVP AVP. %% 6733: %% %% DIAMETER_INVALID_AVP_LENGTH 5014 %% %% The request contained an AVP with an invalid length. A Diameter %% message indicating this error MUST include the offending AVPs %% within a Failed-AVP AVP. In cases where the erroneous AVP length %% value exceeds the message length or is less than the minimum AVP %% ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ %% header length, it is sufficient to include the offending AVP %% ^^^^^^^^^^^^^ %% header and a zero filled payload of the minimum required length %% for the payloads data type. If the AVP is a Grouped AVP, the %% Grouped AVP header with an empty payload would be sufficient to %% indicate the offending AVP. In the case where the offending AVP %% header cannot be fully decoded when the AVP length is less than %% the minimum AVP header length, it is sufficient to include an %% offending AVP header that is formulated by padding the incomplete %% AVP header with zero up to the minimum AVP header length. %% %% The underlined clause must be in error since (1) a header less than %% the minimum value mean we don't know the identity of the AVP and %% (2) the last sentence covers this case. %% split_data/3 split_data(Bin, Len) -> Pad = (4 - (Len rem 4)) rem 4, %% Len might be negative here, but that ensures the failure of the %% binary match. case Bin of <> -> {Data, Rest}; _ -> %% Header length points past the end of the message, or %% doesn't span the header. As stated in the 6733 text %% above, it's sufficient to return a zero-filled minimal %% payload if this is a request. Do this (in cases that we %% know the type) by inducing a decode failure and letting %% the dictionary's decode (in diameter_gen) deal with it. %% Here we don't know type. If the type isn't known, then %% the decode just strips the extra bit. {<<0:1, Bin/binary>>, <<>>} end. %%% --------------------------------------------------------------------------- %%% # pack_avp/1 %%% --------------------------------------------------------------------------- %% The normal case here is data as an #diameter_avp{} list or an %% iolist, which are the cases that generated codec modules use. The %% other case is as a convenience in the relay case in which the %% dictionary doesn't know about specific AVP's. %% Grouped AVP whose components need packing ... pack_avp([#diameter_avp{} = A | Avps]) -> pack_avp(A#diameter_avp{data = Avps}); pack_avp(#diameter_avp{data = [#diameter_avp{} | _] = Avps} = A) -> pack_avp(A#diameter_avp{data = encode_avps(Avps)}); %% ... data as a type/value tuple ... pack_avp(#diameter_avp{data = {Type, Value}} = A) when is_atom(Type) -> pack_avp(A#diameter_avp{data = diameter_types:Type(encode, Value)}); %% ... with a header in various forms ... pack_avp(#diameter_avp{data = {{_,_,_} = T, {Type, Value}}}) -> pack_avp(T, iolist_to_binary(diameter_types:Type(encode, Value))); pack_avp(#diameter_avp{data = {{_,_,_} = T, Bin}}) when is_binary(Bin) -> pack_avp(T, Bin); pack_avp(#diameter_avp{data = {Dict, Name, Value}} = A) -> {Code, _Flags, Vid} = Hdr = Dict:avp_header(Name), {Name, Type} = Dict:avp_name(Code, Vid), pack_avp(A#diameter_avp{data = {Hdr, {Type, Value}}}); %% ... with a truncated header ... pack_avp(#diameter_avp{code = undefined, data = B}) when is_binary(B) -> %% Reset the AVP Length of an AVP Header resulting from a 5014 %% error. The RFC doesn't explicitly say to do this but the %% receiver can't correctly extract this and following AVP's %% without a correct length. On the downside, the header doesn't %% reveal if the received header has been padded. Pad = 8*header_length(B) - bit_size(B), Len = size(<> = <>), <>; %% ... from a dictionary compiled against old code in diameter_gen ... %% ... when ignoring errors in Failed-AVP ... pack_avp(#diameter_avp{data = <<0:1, B/binary>>} = A) -> pack_avp(A#diameter_avp{data = B}); %% ... or as an iolist. pack_avp(#diameter_avp{code = Code, vendor_id = V, is_mandatory = M, need_encryption = P, data = Data}) -> Flags = lists:foldl(fun flag_avp/2, 0, [{V /= undefined, 2#10000000}, {M, 2#01000000}, {P, 2#00100000}]), pack_avp({Code, Flags, V}, iolist_to_binary(Data)). header_length(<<_:32, 1:1, _/bitstring>>) -> 12; header_length(_) -> 8. flag_avp({true, B}, F) -> F bor B; flag_avp({false, _}, F) -> F. %%% --------------------------------------------------------------------------- %%% # pack_avp/2 %%% --------------------------------------------------------------------------- pack_avp({Code, Flags, VendorId}, Bin) when is_binary(Bin) -> Sz = size(Bin), pack_avp(Code, Flags, VendorId, Sz, pad(Sz rem 4, Bin)). pad(0, Bin) -> Bin; pad(N, Bin) -> P = 8*(4-N), <>. %% Note that padding is not included in the length field as mandated by %% the RFC. %% pack_avp/5 %% %% Prepend the vendor id as required. pack_avp(Code, Flags, Vid, Sz, Bin) when 0 == Flags band 2#10000000 -> undefined = Vid, %% sanity check pack_avp(Code, Flags, Sz, Bin); pack_avp(Code, Flags, Vid, Sz, Bin) -> pack_avp(Code, Flags, Sz+4, <>). %% pack_avp/4 pack_avp(Code, Flags, Sz, Bin) -> Length = Sz + 8, <>.