Remove the unused run-time modules

8 files changed, 0 insertions, 5976 deletions

diff --git a/lib/asn1/src/Makefile b/lib/asn1/src/Makefile
index 398b4f6f9d..b1500d9ea6 100644
--- a/lib/asn1/src/Makefile
+++ b/lib/asn1/src/Makefile
@@ -69,20 +69,7 @@ CT_MODULES= \
 
 RT_MODULES= \
 	asn1rt \
-	asn1rt_ber_bin \
-	asn1rt_ber_bin_v2 \
-	asn1rt_per_bin_rt2ct \
-	asn1rt_uper_bin \
-	asn1rt_check \
 	asn1rt_nif
-#	asn1_sup \
-#	asn1_app \
-#	asn1_server
-
-
-# the rt module to use is defined in asn1_records.hrl
-# and must be updated when an incompatible change is done in the rt modules
-
 
 MODULES= $(CT_MODULES) $(RT_MODULES) 
 
diff --git a/lib/asn1/src/asn1.app.src b/lib/asn1/src/asn1.app.src
index 64b33a8a30..f2ee8deb75 100644
--- a/lib/asn1/src/asn1.app.src
+++ b/lib/asn1/src/asn1.app.src
@@ -3,11 +3,6 @@
   {vsn, "%VSN%"},
   {modules, [
 	asn1rt,
-	asn1rt_per_bin_rt2ct,
-	asn1rt_uper_bin,
-	asn1rt_ber_bin,
-	asn1rt_ber_bin_v2,
-	asn1rt_check,
         asn1rt_nif
              ]},
   {registered, [
diff --git a/lib/asn1/src/asn1_records.hrl b/lib/asn1/src/asn1_records.hrl
index 59a9acb7e7..c229aa0759 100644
--- a/lib/asn1/src/asn1_records.hrl
+++ b/lib/asn1/src/asn1_records.hrl
@@ -24,12 +24,6 @@
 -define(dbg(Fmt, Args), no_debug).
 -endif.
 
--define('RT_BER_BIN',"asn1rt_ber_bin").
--define('RT_PER_BIN',"asn1rt_per_bin").
-
-%% Some encoding are common for BER and PER. Shared code are in RT_COMMON
--define('RT_COMMON',asn1rt_ber_bin).
-
 -define('COMPLETE_ENCODE',1).
 -define('TLV_DECODE',2).
 
diff --git a/lib/asn1/src/asn1rt_ber_bin.erl b/lib/asn1/src/asn1rt_ber_bin.erl
deleted file mode 100644
index ec1549804b..0000000000
--- a/lib/asn1/src/asn1rt_ber_bin.erl
+++ /dev/null
@@ -1,525 +0,0 @@
-%%
-%% %CopyrightBegin%
-%%
-%% Copyright Ericsson AB 2000-2010. 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(asn1rt_ber_bin).
-
--export([decode_length/1,
-	 encode_real/2, encode_real/3,
-	 decode_real/2, decode_real/4,
-	 decode_tag/1]).
-
--include("asn1_records.hrl").
-
-%% the encoding of class of tag bits 8 and 7
--define(UNIVERSAL,   0).
-
-%%% primitive or constructed encoding % bit 6
--define(PRIMITIVE,   0).
--define(CONSTRUCTED, 2#00100000).
-
-%%% The tag-number for universal types
--define(N_REAL, 9).
-
-encode_tag_val({Class, Form, TagNo}) when (TagNo =< 30) ->
-    <<(Class bsr 6):2,(Form bsr 5):1,TagNo:5>>;
-
-encode_tag_val({Class, Form, TagNo}) ->
-    {Octets,_Len} = mk_object_val(TagNo),
-    BinOct = list_to_binary(Octets),
-    <<(Class bsr 6):2, (Form bsr 5):1, 31:5,BinOct/binary>>.
-
-%%===============================================================================
-%% Decode a tag
-%%
-%% decode_tag(OctetListBuffer) -> {{Class, Form, TagNo}, RestOfBuffer, RemovedBytes}
-%%===============================================================================
-
-%% multiple octet tag
-decode_tag(<<Class:2, Form:1, 31:5, Buffer/binary>>) ->
-    {TagNo, Buffer1, RemovedBytes} = decode_tag(Buffer, 0, 1),
-    {{(Class bsl 6), (Form bsl 5), TagNo}, Buffer1, RemovedBytes};
-
-%% single tag (< 31 tags)
-decode_tag(<<Class:2,Form:1,TagNo:5, Buffer/binary>>) ->
-    {{(Class bsl 6), (Form bsl 5), TagNo}, Buffer, 1}.
-
-%% last partial tag
-decode_tag(<<0:1,PartialTag:7, Buffer/binary>>, TagAck, RemovedBytes) ->
-    TagNo = (TagAck bsl 7) bor PartialTag,
-    %%<<TagNo>> = <<TagAck:1, PartialTag:7>>,
-    {TagNo, Buffer, RemovedBytes+1};
-% more tags
-decode_tag(<<_:1,PartialTag:7, Buffer/binary>>, TagAck, RemovedBytes) ->
-    TagAck1 = (TagAck bsl 7) bor PartialTag,
-    %%<<TagAck1:16>> = <<TagAck:1, PartialTag:7,0:8>>,
-    decode_tag(Buffer, TagAck1, RemovedBytes+1).
-
-%%------------------------------------------------------------------
-%% check_tags_i is the same as check_tags except that it stops and
-%% returns the remaining tags not checked when it encounters an
-%% indefinite length field
-%% only called internally within this module
-
-check_tags_i([Tag], Buffer, OptOrMand) -> % optimized very usual case
-    {[],check_one_tag(Tag, Buffer, OptOrMand)};
-check_tags_i(Tags, Buffer, OptOrMand) ->
-    check_tags_i(Tags, Buffer, 0, OptOrMand).
-
-check_tags_i([Tag1,Tag2|TagRest], Buffer, Rb, OptOrMand)
-  when Tag1#tag.type == 'IMPLICIT' ->
-    check_tags_i([Tag1#tag{type=Tag2#tag.type}|TagRest], Buffer, Rb, OptOrMand);
-
-check_tags_i([Tag1|TagRest], Buffer, Rb, OptOrMand) ->
-    {Form_Length,Buffer2,Rb1} = check_one_tag(Tag1, Buffer, OptOrMand),
-    case TagRest of
-	[] -> {TagRest, {Form_Length, Buffer2, Rb + Rb1}};
-	_ ->
-	    case Form_Length of
-		{?CONSTRUCTED,_} ->
-		    {TagRest, {Form_Length, Buffer2, Rb + Rb1}};
-		_ ->
-		    check_tags_i(TagRest, Buffer2, Rb + Rb1, mandatory)
-	    end
-    end.
-
-%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
-%% This function is called from generated code
-
-check_one_tag(Tag=#tag{class=ExpectedClass,number=ExpectedNumber}, Buffer, OptOrMand) ->
-    case catch decode_tag(Buffer) of
-	{'EXIT',_Reason} ->
-	    tag_error(no_data,Tag,Buffer,OptOrMand);
-	{{ExpectedClass,Form,ExpectedNumber},Buffer2,Rb} ->
-	    {{L,Buffer3},RemBytes2} = decode_length(Buffer2),
-	    {{Form,L}, Buffer3, RemBytes2+Rb};
-	{ErrorTag,_,_} ->
-	    tag_error(ErrorTag, Tag, Buffer, OptOrMand)
-    end.
-
-tag_error(ErrorTag, Tag, Buffer, OptOrMand) ->
-    case OptOrMand of
-	mandatory ->
-	    exit({error,{asn1, {invalid_tag,
-				{ErrorTag, Tag, Buffer}}}});
-	_ ->
-	    exit({error,{asn1, {no_optional_tag,
-				{ErrorTag, Tag, Buffer}}}})
-    end.
-%%=======================================================================
-%%
-%% Encode all tags in the list Tags and return a possibly deep list of
-%% bytes with tag and length encoded
-%%
-%% prepend_tags(Tags, BytesSoFar, LenSoFar) -> {Bytes, Len}
-encode_tags(Tags, BytesSoFar, LenSoFar) ->
-    NewTags = encode_tags1(Tags, []),
-    %% NewTags contains the resulting tags in reverse order
-    encode_tags2(NewTags, BytesSoFar, LenSoFar).
-
-%encode_tags2([#tag{class=?UNIVERSAL,number=No}|Trest], BytesSoFar, LenSoFar) ->
-%    {Bytes2,L2} = encode_length(LenSoFar),
-%    encode_tags2(Trest,[[No|Bytes2],BytesSoFar], LenSoFar + 1 + L2);
-encode_tags2([Tag|Trest], BytesSoFar, LenSoFar) ->
-    {Bytes1,L1} = encode_one_tag(Tag),
-    {Bytes2,L2} = encode_length(LenSoFar),
-    encode_tags2(Trest, [Bytes1,Bytes2|BytesSoFar],
-		 LenSoFar + L1 + L2);
-encode_tags2([], BytesSoFar, LenSoFar) ->
-    {BytesSoFar,LenSoFar}.
-
-encode_tags1([Tag1, Tag2| Trest], Acc) when Tag1#tag.type =:= 'IMPLICIT' ->
-    encode_tags1([Tag1#tag{type=Tag2#tag.type,form=Tag2#tag.form}|Trest],Acc);
-encode_tags1([Tag1 | Trest], Acc) ->
-    encode_tags1(Trest, [Tag1|Acc]);
-encode_tags1([], Acc) ->
-    Acc. % the resulting tags are returned in reverse order
-
-encode_one_tag(Bin) when is_binary(Bin) ->
-    {Bin,byte_size(Bin)};
-encode_one_tag(#tag{class=Class,number=No,type=Type, form = Form}) ->
-    NewForm = case Type of
-	       'EXPLICIT' ->
-		   ?CONSTRUCTED;
-	       _ ->
-		   Form
-	   end,
-    Bytes = encode_tag_val({Class,NewForm,No}),
-    {Bytes,size(Bytes)}.
-
-%%============================================================================
-%%
-%% Real value, ITU_T X.690 Chapter 8.5
-%%============================================================================
-%%
-%% encode real value
-%%============================================================================
-
-%% only base 2 internally so far!!
-encode_real(_C,0, DoTag) ->
-    dotag(DoTag, ?N_REAL, {[],0});
-encode_real(_C,'PLUS-INFINITY', DoTag) ->
-    dotag(DoTag, ?N_REAL, {[64],1});
-encode_real(_C,'MINUS-INFINITY', DoTag) ->
-    dotag(DoTag, ?N_REAL, {[65],1});
-encode_real(C,Val, DoTag) when is_tuple(Val); is_list(Val) ->
-    dotag(DoTag, ?N_REAL, encode_real(C,Val)).
-
-%%%%%%%%%%%%%%
-%% only base 2 encoding!
-%% binary encoding:
-%% +------------+ +------------+  +-+-+-+-+---+---+
-%% | (tag)9     | |  n + p + 1 |  |1|S|BB |FF |EE |
-%% +------------+ +------------+  +-+-+-+-+---+---+
-%%
-%%	 +------------+	   +------------+
-%%	 |            |	   |            |
-%%	 +------------+	...+------------+
-%%	     n octets for exponent
-%%
-%%	 +------------+	   +------------+
-%%	 |            |	   |            |
-%%	 +------------+	...+------------+
-%%	     p octets for pos mantissa
-%%
-%% S is 0 for positive sign
-%%      1 for negative sign
-%% BB: encoding base, 00 = 2, (01 = 8, 10 = 16)
-%%                             01 and 10 not used
-%% FF: scale factor 00 = 0 (used in base 2 encoding)
-%% EE: encoding of the exponent:
-%%     00 - on the following octet
-%%     01 - on the 2 following octets
-%%     10 - on the 3 following octets
-%%     11 - encoding of the length of the two's-complement encoding of
-%%          exponent on the following octet, and two's-complement 
-%%          encoding of exponent on the other octets.
-%%
-%% In DER and base 2 encoding the mantissa is encoded as value 0 or
-%% bit shifted until it is an odd number. Thus, do this for BER as
-%% well.
-%% This interface also used by RT_COMMON
-encode_real(_C,{Mantissa, Base, Exponent}) when Base =:= 2 ->
-%%    io:format("Mantissa: ~w Base: ~w, Exp: ~w~n",[Man, Base, Exp]),
-    {Man,ExpAdd} = truncate_zeros(Mantissa), %% DER adjustment
-    Exp = Exponent + ExpAdd,
-    OctExp = if Exp >= 0 -> list_to_binary(encode_integer_pos(Exp, []));
-		true     -> list_to_binary(encode_integer_neg(Exp, []))
-	     end,
-%%    ok = io:format("OctExp: ~w~n",[OctExp]),
-    SignBit = if  Man > 0 -> 0;  % bit 7 is pos or neg, no Zeroval
-		  true -> 1
-	      end,
-%%    ok = io:format("SignBitMask: ~w~n",[SignBitMask]),
-    SFactor = 0,
-    OctExpLen = size(OctExp),
-    if OctExpLen > 255 ->
-	    exit({error,{asn1, {to_big_exp_in_encode_real, OctExpLen}}});
-       true  -> true %% make real assert later..
-    end,
-    {LenCode, EOctets} = case OctExpLen of   % bit 2,1
-			     1 -> {0, OctExp};
-			     2 -> {1, OctExp};
-			     3 -> {2, OctExp};
-			     _ -> {3, <<OctExpLen, OctExp/binary>>}
-			 end,
-    BB = 0, %% 00 for base 2
-    FirstOctet = <<1:1,SignBit:1,BB:2,SFactor:2,LenCode:2>>,
-    OctMantissa = if Man > 0 -> list_to_binary(minimum_octets(Man));
-		     true    -> list_to_binary(minimum_octets(-(Man))) % signbit keeps track of sign
-		  end,
-    %%    ok = io:format("LenMask: ~w EOctets: ~w~nFirstOctet: ~w OctMantissa: ~w OctExpLen: ~w~n", [LenMask, EOctets, FirstOctet, OctMantissa, OctExpLen]),
-    Bin = <<FirstOctet/binary, EOctets/binary, OctMantissa/binary>>,
-    {Bin, size(Bin)};
-encode_real(C,{Mantissa,Base,Exponent}) 
-  when Base =:= 10, is_integer(Mantissa), is_integer(Exponent) ->
-    %% always encode as NR3 due to DER on the format
-    %% mmmm.Eseeee where
-    %% m := digit
-    %% s := '-' | '+' | []
-    %% '+' only allowed in +0
-    %% e := digit
-    %% ex: 1234.E-5679
-%%    {Man,AddExp} = truncate_zeros(Mantissa,0),
-%%    ManNum = trunc(Mantissa),
-%%    {TruncatedMan,NumZeros} = truncate_zeros10(Mantissa),
-    ManStr = integer_to_list(Mantissa),
-    
-    encode_real_as_string(C,ManStr,Exponent);
-encode_real(_C,{_,Base,_}) ->
-    exit({error,{asn1, {encode_real_non_supported_encodeing, Base}}});
-%% base 10
-encode_real(C,Real) when is_list(Real) ->
-    %% The Real string may come in as a NR1, NR2 or NR3 string.
-    {Mantissa, Exponent} =
-	case string:tokens(Real,"Ee") of
-	    [NR2] ->
-		{NR2,0};
-	    [NR3MB,NR3E] ->
-		%% remove beginning zeros
-		{NR3MB,list_to_integer(NR3E)}
-	end,
-    
-    %% .Decimal | Number | Number.Decimal
-    ZeroDecimal =
-	fun("0") -> "";
-	   (L) -> L
-	end,
-    {NewMantissa,LenDecimal} =
-	case Mantissa of
-	    [$.|Dec] ->
-		NewMan = remove_trailing_zeros(Dec),
-		{NewMan,length(ZeroDecimal(NewMan))};
-	    _ ->
-		case string:tokens(Mantissa,",.") of
-		    [Num] -> %% No decimal-mark
-			{integer_to_list(list_to_integer(Num)),0};
-		    [Num,Dec] ->
-			NewDec = ZeroDecimal(remove_trailing_zeros(Dec)),
-			NewMan = integer_to_list(list_to_integer(Num)) ++ NewDec,
-			{integer_to_list(list_to_integer(NewMan)),
-			 length(NewDec)}
-		end
-	end,
-    
-%    DER_Exponent = integer_to_list(Exponent - ExpReduce),
-    encode_real_as_string(C,NewMantissa,Exponent - LenDecimal).
-	
-encode_real_as_string(_C,Mantissa,Exponent)
-  when is_list(Mantissa), is_integer(Exponent) ->
-    %% Remove trailing zeros in Mantissa and add this to Exponent
-    TruncMant = remove_trailing_zeros(Mantissa),
-
-    ExpIncr = length(Mantissa) - length(TruncMant),
-
-    ExpStr = integer_to_list(Exponent + ExpIncr),
-
-    ExpBin =
-	case ExpStr of
-	    "0" ->
-		<<"E+0">>;
-	    _ -> 
-		ExpB = list_to_binary(ExpStr),
-		<<$E,ExpB/binary>>
-	end,
-    ManBin = list_to_binary(TruncMant),
-    NR3 = 3,
-    {<<NR3,ManBin/binary,$.,ExpBin/binary>>,2 + size(ManBin) + size(ExpBin)}.
-    
-remove_trailing_zeros(IntStr) ->
-    case lists:dropwhile(fun($0)-> true;
-			    (_) -> false
-			 end, lists:reverse(IntStr)) of
-	[] ->
-	    "0";
-	ReversedIntStr ->
-	    lists:reverse(ReversedIntStr)
-    end.
-
-truncate_zeros(Num) ->
-    truncate_zeros(Num,0).
-truncate_zeros(0,Sum) ->
-    {0,Sum};
-truncate_zeros(M,Sum) ->
-    case M band 16#f =:= M band 16#e of
-	true -> truncate_zeros(M bsr 1,Sum+1);
-	_ -> {M,Sum}
-    end.
-
-	    
-%%============================================================================
-%% decode real value
-%%
-%% decode_real([OctetBufferList], tuple|value, tag|notag) ->
-%%  {{Mantissa, Base, Exp} | realval | PLUS-INFINITY | MINUS-INFINITY | 0,
-%%     RestBuff}
-%%
-%% only for base 2 decoding sofar!!
-%%============================================================================
-
-decode_real(Buffer, C, Tags, OptOrMand) ->
-    NewTags = new_tags(Tags,#tag{class=?UNIVERSAL,number=?N_REAL}),
-    decode_real_notag(Buffer, C, NewTags, OptOrMand).
-
-%% This interface used by RT_COMMON
-decode_real(Buffer,Len) ->
-    decode_real2(Buffer,[],Len,0).
-
-decode_real_notag(Buffer, C, Tags, OptOrMand) ->
-    {_RestTags, {{_,Len}, Buffer0, Rb0}} =
-	check_tags_i(Tags, Buffer, OptOrMand),
-    decode_real2(Buffer0, C, Len, Rb0).
-
-decode_real2(Buffer, _C, 0, _RemBytes) ->
-    {0,Buffer};
-decode_real2(Buffer0, _C, Len, RemBytes1) ->
-    <<First, Buffer2/binary>> = Buffer0,
-    if
-	First =:= 2#01000000 -> {'PLUS-INFINITY', Buffer2};
-	First =:= 2#01000001 -> {'MINUS-INFINITY', Buffer2};
-%%	First =:= 2#00000000 -> {0, Buffer2};
-	First =:= 1 orelse First =:= 2 orelse First =:= 3 ->
-	    %% charcter string encoding of base 10
-	    {NRx,Rest} = split_binary(Buffer2,Len-1),
-	    {binary_to_list(NRx),Rest,Len};
-	true ->
-	    %% have some check here to verify only supported bases (2)
-	    %% not base 8 or 16
-	    <<_B7:1,Sign:1,BB:2,_FF:2,EE:2>> = <<First>>,
-	    Base =
-		case BB of
-		    0 -> 2;  % base 2, only one so far
-		    _ -> exit({error,{asn1, {non_supported_base, BB}}})
-		end,
-	    {FirstLen, {Exp, Buffer3,_Rb2}, RemBytes2} =
-		case EE of
-		    0 -> {2, decode_integer2(1, Buffer2, RemBytes1), RemBytes1+1};
-		    1 -> {3, decode_integer2(2, Buffer2, RemBytes1), RemBytes1+2};
-		    2 -> {4, decode_integer2(3, Buffer2, RemBytes1), RemBytes1+3};
-		    3 ->
-			<<ExpLen1,RestBuffer/binary>> = Buffer2,
-			{ ExpLen1 + 2,
-			  decode_integer2(ExpLen1, RestBuffer, RemBytes1),
-			  RemBytes1+ExpLen1}
-		end,
-	    %%	    io:format("FirstLen: ~w, Exp: ~w, Buffer3: ~w ~n",
-
-	    Length = Len - FirstLen,
-	    <<LongInt:Length/unit:8,RestBuff/binary>> = Buffer3,
-	    {{Mantissa, Buffer4}, RemBytes3} =
-		if Sign =:= 0 ->
-			%%			io:format("sign plus~n"),
-			{{LongInt, RestBuff}, 1 + Length};
-		   true ->
-			%%			io:format("sign minus~n"),
-			{{-LongInt, RestBuff}, 1 + Length}
-		end,
-	    {{Mantissa, Base, Exp}, Buffer4, RemBytes2+RemBytes3}
-    end.
-
-encode_integer_pos(0, L=[B|_Acc]) when B < 128 ->
-    L;
-encode_integer_pos(N, Acc) ->
-    encode_integer_pos((N bsr 8), [N band 16#ff| Acc]).
-
-encode_integer_neg(-1, L=[B1|_T]) when B1 > 127 ->
-    L;
-encode_integer_neg(N, Acc) ->
-    encode_integer_neg(N bsr 8, [N band 16#ff|Acc]).
-
-
-%%%%%%%%%%%
-%% mk_object_val(Value) -> {OctetList, Len}
-%% returns a Val as a list of octets, the 8 bit is allways set to one except
-%% for the last octet, where its 0
-%%
-
-
-mk_object_val(Val) when Val =< 127 ->
-    {[255 band Val], 1};
-mk_object_val(Val) ->
-    mk_object_val(Val bsr 7, [Val band 127], 1).
-mk_object_val(0, Ack, Len) ->
-    {Ack, Len};
-mk_object_val(Val, Ack, Len) ->
-    mk_object_val(Val bsr 7, [((Val band 127) bor 128) | Ack], Len + 1).
-
-
-%%============================================================================
-%% Length handling
-%%
-%% Encode length
-%%
-%% encode_length(Int | indefinite) ->
-%%          [<127]| [128 + Int (<127),OctetList] | [16#80]
-%%============================================================================
-
-encode_length(L) when L =< 16#7F ->
-    {[L],1};
-encode_length(L) ->
-    Oct = minimum_octets(L),
-    Len = length(Oct),
-    if
-	Len =< 126 ->
-	    {[ (16#80+Len) | Oct ],Len+1};
-	true ->
-	    exit({error,{asn1, to_long_length_oct, Len}})
-    end.
-
-
-%% Val must be >= 0
-minimum_octets(Val) ->
-    minimum_octets(Val,[]).
-
-minimum_octets(0,Acc) ->
-    Acc;
-minimum_octets(Val, Acc) ->
-    minimum_octets((Val bsr 8),[Val band 16#FF | Acc]).
-
-
-%%===========================================================================
-%% Decode length
-%%
-%% decode_length(OctetList) -> {{indefinite, RestOctetsL}, NoRemovedBytes} |
-%%                             {{Length, RestOctetsL}, NoRemovedBytes}
-%%===========================================================================
-
-decode_length(<<1:1,0:7,T/binary>>) ->
-    {{indefinite, T}, 1};
-decode_length(<<0:1,Length:7,T/binary>>) ->
-    {{Length,T},1};
-decode_length(<<1:1,LL:7,T/binary>>) ->
-    <<Length:LL/unit:8,Rest/binary>> = T,
-    {{Length,Rest}, LL+1}.
-
-
-dotag([], Tag, {Bytes,Len}) ->
-    dotag_universal(Tag,Bytes,Len);
-dotag(Tags, Tag, {Bytes,Len}) ->
-    encode_tags(Tags ++ [#tag{class=?UNIVERSAL,number=Tag,form=?PRIMITIVE}],
-		Bytes, Len).
-
-dotag_universal(UniversalTag,Bytes,Len) when Len =< 16#7F->
-    {[UniversalTag,Len,Bytes],2+Len};
-dotag_universal(UniversalTag,Bytes,Len) ->
-    {EncLen,LenLen}=encode_length(Len),
-    {[UniversalTag,EncLen,Bytes],1+LenLen+Len}.
-
-%% decoding postitive integer values.
-decode_integer2(Len,Bin = <<0:1,_:7,_Bs/binary>>,RemovedBytes) ->
-    <<Int:Len/unit:8,Buffer2/binary>> = Bin,
-    {Int,Buffer2,RemovedBytes};
-%% decoding negative integer values.
-decode_integer2(Len,<<1:1,B2:7,Bs/binary>>,RemovedBytes)  ->
-    <<N:Len/unit:8,Buffer2/binary>> = <<B2,Bs/binary>>,
-    Int = N - (1 bsl (8 * Len - 1)),
-    {Int,Buffer2,RemovedBytes}.
-
-new_tags([],LastTag) ->
-    [LastTag];
-new_tags(Tags = [#tag{type='IMPLICIT'}],_LastTag) ->
-    Tags;
-new_tags([T1 = #tag{type='IMPLICIT'},#tag{type=T2Type}|Rest],LastTag) ->
-    new_tags([T1#tag{type=T2Type}|Rest],LastTag);
-new_tags(Tags,LastTag) ->
-    case lists:last(Tags) of
-	#tag{type='IMPLICIT'} ->
-	    Tags;
-	_ ->
-	    Tags ++ [LastTag]
-    end.
diff --git a/lib/asn1/src/asn1rt_ber_bin_v2.erl b/lib/asn1/src/asn1rt_ber_bin_v2.erl
deleted file mode 100644
index 10deecee6e..0000000000
--- a/lib/asn1/src/asn1rt_ber_bin_v2.erl
+++ /dev/null
@@ -1,1993 +0,0 @@
-%%
-%% %CopyrightBegin%
-%% 
-%% Copyright Ericsson AB 2002-2012. 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(asn1rt_ber_bin_v2).
- 
-%% encoding / decoding of BER  
-
--export([decode/1, decode/2, match_tags/2, encode/1, encode/2]). 
--export([fixoptionals/2,
-	 encode_tag_val/1,
-	 encode_tags/2,
-	 encode_tags/3,
-	 skip_ExtensionAdditions/2]).
--export([encode_boolean/2,decode_boolean/2,
-	 encode_integer/3,encode_integer/4,
-	 decode_integer/3, decode_integer/4,
-	 encode_enumerated/2,
-	 encode_enumerated/4,decode_enumerated/4,
-	 encode_real/3,decode_real/2,
-	 encode_bit_string/4,decode_bit_string/4,
-	 decode_compact_bit_string/4,
-	 encode_octet_string/3,decode_octet_string/3,
-	 encode_null/2,decode_null/2,
-	 encode_relative_oid/2,decode_relative_oid/2,
-	 encode_object_identifier/2,decode_object_identifier/2,
-	 encode_restricted_string/4,decode_restricted_string/4,
-	 encode_universal_string/3,decode_universal_string/3,
-	 encode_UTF8_string/3,decode_UTF8_string/2,
-	 encode_BMP_string/3,decode_BMP_string/3,
-	 encode_generalized_time/3,decode_generalized_time/3,
-	 encode_utc_time/3,decode_utc_time/3,
-	 encode_length/1,decode_length/1,
-	 decode_tag_and_length/1]).
-
--export([encode_open_type/1,encode_open_type/2, 
-	 decode_open_type/2,decode_open_type/3,
-	 decode_open_type_as_binary/2,
-	 decode_open_type_as_binary/3]).
-
--export([decode_primitive_incomplete/2,decode_selective/2]).
- 
-% the encoding of class of tag bits 8 and 7 
--define(UNIVERSAL,   0). 
--define(APPLICATION, 16#40). 
--define(CONTEXT,     16#80). 
--define(PRIVATE,     16#C0). 
- 
-%%% primitive or constructed encoding % bit 6 
--define(PRIMITIVE,   0). 
--define(CONSTRUCTED, 2#00100000). 
-
-%%% The tag-number for universal types
--define(N_BOOLEAN, 1). 
--define(N_INTEGER, 2). 
--define(N_BIT_STRING, 3).
--define(N_OCTET_STRING, 4).
--define(N_NULL, 5). 
--define(N_OBJECT_IDENTIFIER, 6). 
--define(N_OBJECT_DESCRIPTOR, 7). 
--define(N_EXTERNAL, 8). 
--define(N_REAL, 9). 
--define(N_ENUMERATED, 10). 
--define(N_EMBEDDED_PDV, 11). 
--define(N_SEQUENCE, 16). 
--define(N_SET, 17). 
--define(N_NumericString, 18).
--define(N_PrintableString, 19).
--define(N_TeletexString, 20).
--define(N_VideotexString, 21).
--define(N_IA5String, 22).
--define(N_UTCTime, 23). 
--define(N_GeneralizedTime, 24). 
--define(N_GraphicString, 25).
--define(N_VisibleString, 26).
--define(N_GeneralString, 27).
--define(N_UniversalString, 28).
--define(N_BMPString, 30).
-
- 
-% the complete tag-word of built-in types 
--define(T_BOOLEAN,          ?UNIVERSAL bor ?PRIMITIVE bor 1). 
--define(T_INTEGER,          ?UNIVERSAL bor ?PRIMITIVE bor 2). 
--define(T_BIT_STRING,       ?UNIVERSAL bor ?PRIMITIVE bor 3). % can be CONSTRUCTED 
--define(T_OCTET_STRING,     ?UNIVERSAL bor ?PRIMITIVE bor 4). % can be CONSTRUCTED 
--define(T_NULL,             ?UNIVERSAL bor ?PRIMITIVE bor 5). 
--define(T_OBJECT_IDENTIFIER,?UNIVERSAL bor ?PRIMITIVE bor 6). 
--define(T_OBJECT_DESCRIPTOR,?UNIVERSAL bor ?PRIMITIVE bor 7). 
--define(T_EXTERNAL,         ?UNIVERSAL bor ?PRIMITIVE bor 8). 
--define(T_REAL,             ?UNIVERSAL bor ?PRIMITIVE bor 9). 
--define(T_ENUMERATED,       ?UNIVERSAL bor ?PRIMITIVE bor 10). 
--define(T_EMBEDDED_PDV,     ?UNIVERSAL bor ?PRIMITIVE bor 11). 
--define(T_SEQUENCE,         ?UNIVERSAL bor ?CONSTRUCTED bor 16). 
--define(T_SET,              ?UNIVERSAL bor ?CONSTRUCTED bor 17). 
--define(T_NumericString,    ?UNIVERSAL bor ?PRIMITIVE bor 18). %can be constructed 
--define(T_PrintableString,  ?UNIVERSAL bor ?PRIMITIVE bor 19). %can be constructed 
--define(T_TeletexString,    ?UNIVERSAL bor ?PRIMITIVE bor 20). %can be constructed 
--define(T_VideotexString,   ?UNIVERSAL bor ?PRIMITIVE bor 21). %can be constructed 
--define(T_IA5String,        ?UNIVERSAL bor ?PRIMITIVE bor 22). %can be constructed 
--define(T_UTCTime,          ?UNIVERSAL bor ?PRIMITIVE bor 23). 
--define(T_GeneralizedTime,  ?UNIVERSAL bor ?PRIMITIVE bor 24). 
--define(T_GraphicString,    ?UNIVERSAL bor ?PRIMITIVE bor 25). %can be constructed 
--define(T_VisibleString,    ?UNIVERSAL bor ?PRIMITIVE bor 26). %can be constructed 
--define(T_GeneralString,    ?UNIVERSAL bor ?PRIMITIVE bor 27). %can be constructed 
--define(T_UniversalString,  ?UNIVERSAL bor ?PRIMITIVE bor 28). %can be constructed 
--define(T_BMPString,        ?UNIVERSAL bor ?PRIMITIVE bor 30). %can be constructed 
- 
-% encode(Tlv={_Tag={?PRIMITIVE,_},_VList}) ->
-%     encode_primitive(Tlv);
-% encode(Tlv) ->
-%     encode_constructed(Tlv).
-
-encode(Tlv) ->
-    encode(Tlv,erlang).
-
-encode(Tlv,_) when is_binary(Tlv) ->
-    Tlv;
-encode([Tlv],Method) ->
-    encode(Tlv,Method);
-encode(Tlv, nif) ->
-    asn1rt_nif:encode_ber_tlv(Tlv);
-encode(Tlv, _) ->
-    encode_erl(Tlv).
-
-encode_erl({TlvTag,TlvVal}) when is_list(TlvVal) ->
-    %% constructed form of value
-    encode_tlv(TlvTag,TlvVal,?CONSTRUCTED);
-encode_erl({TlvTag,TlvVal}) ->
-    encode_tlv(TlvTag,TlvVal,?PRIMITIVE).
-
-encode_tlv(TlvTag,TlvVal,Form) ->
-    Tag = encode_tlv_tag(TlvTag,Form),
-    {Val,VLen} = encode_tlv_val(TlvVal),
-    {Len,_LLen} = encode_length(VLen),
-    BinLen = list_to_binary(Len),
-    <<Tag/binary,BinLen/binary,Val/binary>>.
-
-encode_tlv_tag(ClassTagNo,Form) ->
-    Class = ClassTagNo bsr 16,
-    encode_tag_val({Class bsl 6,Form,(ClassTagNo - (Class bsl 16))}).
-
-encode_tlv_val(TlvL) when is_list(TlvL) ->
-    encode_tlv_list(TlvL,[]);
-encode_tlv_val(Bin) ->
-    {Bin,size(Bin)}.
-
-encode_tlv_list([Tlv|Tlvs],Acc) ->
-    EncTlv = encode_erl(Tlv),
-    encode_tlv_list(Tlvs,[EncTlv|Acc]);
-encode_tlv_list([],Acc) ->
-    Bin=list_to_binary(lists:reverse(Acc)),
-    {Bin,size(Bin)}.
-
-decode(B) ->
-    decode(B, erlang).
-
-%% asn1-1.7
-decode(B, nif) ->
-    case asn1rt_nif:decode_ber_tlv(B) of
-	{error, Reason} -> handle_error(Reason, B);
-	Else -> Else
-    end;
-decode(B,erlang) when is_binary(B) ->
-    decode_primitive(B);
-decode(Tlv,erlang) ->
-    {Tlv,<<>>}.
-
-handle_error([],_)->
-    exit({error,{asn1,{"memory allocation problem"}}});
-handle_error({$1,_},L) -> % error in nif
-    exit({error,{asn1,L}});
-handle_error({$2,T},L) -> % error in nif due to wrong tag
-    exit({error,{asn1,{"bad tag after byte:",error_pos(T),L}}});
-handle_error({$3,T},L) -> % error in driver due to length error
-    exit({error,{asn1,{"bad length field after byte:",
-			     error_pos(T),L}}});
-handle_error({$4,T},L) -> % error in driver due to indefinite length error
-    exit({error,{asn1,
-		 {"indefinite length without end bytes after byte:",
-		  error_pos(T),L}}});
-handle_error({$5,T},L) -> % error in driver due to indefinite length error
-    exit({error,{asn1,{"bad encoded value after byte:",
-			     error_pos(T),L}}});
-handle_error(ErrL,L) ->
-    exit({error,{asn1,ErrL,L}}).
-
-error_pos([]) ->
-    "unknown position";
-error_pos([B])->
-    B;
-error_pos([B|Bs]) ->
-    BS = 8 * length(Bs),
-    B bsl BS + error_pos(Bs).
-
-decode_primitive(Bin) ->
-    {Form,TagNo,V,Rest} = decode_tag_and_length(Bin),
-    case Form of 
-	1 -> % constructed
-	    {{TagNo,decode_constructed(V)},Rest};
-	0 -> % primitive
-	    {{TagNo,V},Rest};
-	2 -> % constructed indefinite
-	    {Vlist,Rest2} = decode_constructed_indefinite(V,[]),
-	    {{TagNo,Vlist},Rest2}
-    end.
-
-decode_constructed(Bin) when byte_size(Bin) =:= 0 ->
-    [];
-decode_constructed(Bin) ->
-    {Tlv,Rest} = decode_primitive(Bin),
-    [Tlv|decode_constructed(Rest)].
-
-decode_constructed_indefinite(<<0,0,Rest/binary>>,Acc) ->
-    {lists:reverse(Acc),Rest};
-decode_constructed_indefinite(Bin,Acc) ->
-    {Tlv,Rest} = decode_primitive(Bin),
-    decode_constructed_indefinite(Rest, [Tlv|Acc]). 
-    
-%% decode_primitive_incomplete/2 decodes an encoded message incomplete
-%% by help of the pattern attribute (first argument).
-decode_primitive_incomplete([[default,TagNo]],Bin) -> %default
-    case decode_tag_and_length(Bin) of
-	{Form,TagNo,V,Rest} ->
-	    decode_incomplete2(Form,TagNo,V,[],Rest);
-	_ ->
-	    %{asn1_DEFAULT,Bin}
-	    asn1_NOVALUE
-    end;
-decode_primitive_incomplete([[default,TagNo,Directives]],Bin) -> %default, constructed type, Directives points into this type
-    case decode_tag_and_length(Bin) of
-	{Form,TagNo,V,Rest} ->	    
-	    decode_incomplete2(Form,TagNo,V,Directives,Rest);
-	_ ->
-	    %{asn1_DEFAULT,Bin}
-	    asn1_NOVALUE
-    end;
-decode_primitive_incomplete([[opt,TagNo]],Bin) -> %optional
-    case decode_tag_and_length(Bin) of
-	{Form,TagNo,V,Rest} ->
-	    decode_incomplete2(Form,TagNo,V,[],Rest);
-	_ ->
-	    %{{TagNo,asn1_NOVALUE},Bin}
-	    asn1_NOVALUE
-    end;
-decode_primitive_incomplete([[opt,TagNo,Directives]],Bin) -> %optional
-    case decode_tag_and_length(Bin) of
-	{Form,TagNo,V,Rest} ->
-	    decode_incomplete2(Form,TagNo,V,Directives,Rest);
-	_ ->
-	    %{{TagNo,asn1_NOVALUE},Bin}
-	    asn1_NOVALUE
-    end;
-%% An optional that shall be undecoded
-decode_primitive_incomplete([[opt_undec,Tag]],Bin) ->
-    case decode_tag_and_length(Bin) of
-	{_,Tag,_,_} ->
-	    decode_incomplete_bin(Bin);
-	_ ->
-	    asn1_NOVALUE
-    end;
-%% A choice alternative that shall be undecoded
-decode_primitive_incomplete([[alt_undec,TagNo]|RestAlts],Bin) ->
-%    decode_incomplete_bin(Bin);
-%    case decode_tlv(Bin) of
-    case decode_tag_and_length(Bin) of
-%	{{_Form,TagNo,_Len,_V},_R} ->
-	{_,TagNo,_,_} ->
-	    decode_incomplete_bin(Bin);
-	_ ->
-	    decode_primitive_incomplete(RestAlts,Bin)
-    end;
-decode_primitive_incomplete([[alt,TagNo]|RestAlts],Bin) ->
-    case decode_tag_and_length(Bin) of
-	{_Form,TagNo,V,Rest} ->
-	    {{TagNo,V},Rest};
-	_ ->
-	    decode_primitive_incomplete(RestAlts,Bin)
-    end;
-decode_primitive_incomplete([[alt,TagNo,Directives]|RestAlts],Bin) ->
-    case decode_tag_and_length(Bin) of
-	{Form,TagNo,V,Rest} ->
-	    decode_incomplete2(Form,TagNo,V,Directives,Rest);
-	_ ->
-	    decode_primitive_incomplete(RestAlts,Bin)
-    end;
-decode_primitive_incomplete([[alt_parts,TagNo]],Bin) ->
-    case decode_tag_and_length(Bin) of
-	{_Form,TagNo,V,Rest} ->
-	    {{TagNo,V},Rest};
-	_ ->
-	    asn1_NOVALUE
-    end;
-decode_primitive_incomplete([[alt_parts,TagNo]|RestAlts],Bin) ->
-    case decode_tag_and_length(Bin) of
-	{_Form,TagNo,V,Rest} ->
-	    {{TagNo,decode_parts_incomplete(V)},Rest};
-	_ ->
-	    decode_primitive_incomplete(RestAlts,Bin)
-    end;
-decode_primitive_incomplete([[undec,_TagNo]|_RestTag],Bin) -> %incomlete decode
-    decode_incomplete_bin(Bin); 
-decode_primitive_incomplete([[parts,TagNo]|_RestTag],Bin) ->
-    case decode_tag_and_length(Bin) of
-	{_Form,TagNo,V,Rest} ->
-	    {{TagNo,decode_parts_incomplete(V)},Rest};
-	Err ->
-	    {error,{asn1,"tag failure",TagNo,Err}}
-    end;
-decode_primitive_incomplete([mandatory|RestTag],Bin) ->
-    {Form,TagNo,V,Rest} = decode_tag_and_length(Bin),
-    decode_incomplete2(Form,TagNo,V,RestTag,Rest);
-%% A choice that is a toptype or a mandatory component of a
-%% SEQUENCE or SET.
-decode_primitive_incomplete([[mandatory|Directives]],Bin) ->
-    {Form,TagNo,V,Rest} = decode_tag_and_length(Bin),
-    decode_incomplete2(Form,TagNo,V,Directives,Rest);
-decode_primitive_incomplete([],Bin) ->
-    decode_primitive(Bin).
-
-%% decode_parts_incomplete/1 receives a number of values encoded in
-%% sequence and returns the parts as unencoded binaries
-decode_parts_incomplete(<<>>) ->
-    [];
-decode_parts_incomplete(Bin) ->
-    {ok,Rest} = skip_tag(Bin),
-    {ok,Rest2} = skip_length_and_value(Rest),
-    LenPart = size(Bin) - size(Rest2),
-    <<Part:LenPart/binary,RestBin/binary>> = Bin,
-    [Part|decode_parts_incomplete(RestBin)].
-	    
-    
-%% decode_incomplete2 checks if V is a value of a constructed or
-%% primitive type, and continues the decode propeerly.
-decode_incomplete2(_Form=2,TagNo,V,TagMatch,_) ->
-    %% constructed indefinite length
-    {Vlist,Rest2} = decode_constr_indef_incomplete(TagMatch,V,[]),
-    {{TagNo,Vlist},Rest2};
-decode_incomplete2(1,TagNo,V,[TagMatch],Rest) when is_list(TagMatch) ->
-    {{TagNo,decode_constructed_incomplete(TagMatch,V)},Rest};
-decode_incomplete2(1,TagNo,V,TagMatch,Rest) ->
-    {{TagNo,decode_constructed_incomplete(TagMatch,V)},Rest};
-decode_incomplete2(0,TagNo,V,_TagMatch,Rest) ->
-    {{TagNo,V},Rest}.
-
-decode_constructed_incomplete([Tags=[Ts]],Bin) when is_list(Ts) ->
-    decode_constructed_incomplete(Tags,Bin);
-decode_constructed_incomplete(_TagMatch,<<>>) ->
-    [];
-decode_constructed_incomplete([mandatory|RestTag],Bin) ->
-    {Tlv,Rest} = decode_primitive(Bin),
-    [Tlv|decode_constructed_incomplete(RestTag,Rest)];
-decode_constructed_incomplete(Directives=[[Alt,_]|_],Bin) 
-  when Alt == alt_undec; Alt == alt; Alt == alt_parts ->
-    {_Form,TagNo,V,Rest} = decode_tag_and_length(Bin),
-    case incomplete_choice_alt(TagNo,Directives) of
-	{alt_undec,_} ->
-	    LenA = size(Bin)-size(Rest),
-	    <<A:LenA/binary,Rest/binary>> = Bin,
-	    A;
-	{alt,InnerDirectives} ->
-	    {Tlv,Rest} = decode_primitive_incomplete(InnerDirectives,V),
-	    {TagNo,Tlv};
-	{alt_parts,_} ->
-	    [{TagNo,decode_parts_incomplete(V)}];
-	no_match -> %% if a choice alternative was encoded that
-	    %% was not specified in the config file,
-	    %% thus decode component anonomous.
-	    {Tlv,_}=decode_primitive(Bin),
-	    Tlv
-    end;
-decode_constructed_incomplete([TagNo|RestTag],Bin) ->
-%%    {Tlv,Rest} = decode_primitive_incomplete([TagNo],Bin),
-    case decode_primitive_incomplete([TagNo],Bin) of
-	{Tlv,Rest} ->
-	    [Tlv|decode_constructed_incomplete(RestTag,Rest)];
-	asn1_NOVALUE ->
-	    decode_constructed_incomplete(RestTag,Bin)
-    end;
-decode_constructed_incomplete([],Bin) ->
-    {Tlv,Rest}=decode_primitive(Bin),
-    [Tlv|decode_constructed_incomplete([],Rest)].
-
-decode_constr_indef_incomplete(_TagMatch,<<0,0,Rest/binary>>,Acc) ->
-    {lists:reverse(Acc),Rest};
-decode_constr_indef_incomplete([Tag|RestTags],Bin,Acc) ->
-%    {Tlv,Rest} = decode_primitive_incomplete([Tag],Bin),
-    case decode_primitive_incomplete([Tag],Bin) of
-	{Tlv,Rest} ->
-	    decode_constr_indef_incomplete(RestTags,Rest,[Tlv|Acc]);
-	asn1_NOVALUE ->
-	    decode_constr_indef_incomplete(RestTags,Bin,Acc)
-    end.
-
-
-decode_incomplete_bin(Bin) ->
-    {ok,Rest} = skip_tag(Bin),
-    {ok,Rest2} = skip_length_and_value(Rest),
-    IncLen = size(Bin) - size(Rest2),
-    <<IncBin:IncLen/binary,Ret/binary>> = Bin,
-    {IncBin,Ret}.
-	    
-incomplete_choice_alt(TagNo,[[Alt,TagNo]|Directives]) ->
-    {Alt,Directives};
-incomplete_choice_alt(TagNo,[D]) when is_list(D) ->
-    incomplete_choice_alt(TagNo,D);
-incomplete_choice_alt(TagNo,[_H|Directives]) ->
-    incomplete_choice_alt(TagNo,Directives);
-incomplete_choice_alt(_,[]) ->
-    no_match.
-
-
-
-
-%% decode_selective(Pattern, Binary) the first argument is a pattern that tells
-%% what to do with the next element the second is the BER encoded
-%% message as a binary
-%% Returns {ok,Value} or {error,Reason}
-%% Value is a binary that in turn must be decoded to get the decoded
-%% value.
-decode_selective([],Binary) ->
-    {ok,Binary};
-decode_selective([skip|RestPattern],Binary)->
-    {ok,RestBinary}=skip_tag(Binary),
-    {ok,RestBinary2}=skip_length_and_value(RestBinary),
-    decode_selective(RestPattern,RestBinary2);
-decode_selective([[skip_optional,Tag]|RestPattern],Binary) ->
-    case skip_optional_tag(Tag,Binary) of
-	{ok,RestBinary} ->
-	    {ok,RestBinary2}=skip_length_and_value(RestBinary),
-	    decode_selective(RestPattern,RestBinary2);
-	missing ->
-	    decode_selective(RestPattern,Binary)
-    end;
-decode_selective([[choosen,Tag]],Binary) ->
-    return_value(Tag,Binary);
-%     case skip_optional_tag(Tag,Binary) of %may be optional/default
-% 	{ok,RestBinary} ->
-% 	    {ok,Value} = get_value(RestBinary);
-% 	missing ->
-% 	    {ok,<<>>}
-%     end;
-decode_selective([[choosen,Tag]|RestPattern],Binary) ->
-    case skip_optional_tag(Tag,Binary) of
-	{ok,RestBinary} ->
-	    {ok,Value} = get_value(RestBinary),
-	    decode_selective(RestPattern,Value);
-	missing ->
-	    {ok,<<>>}
-    end;
-decode_selective(P,_) ->
-    {error,{asn1,{partial_decode,"bad pattern",P}}}.
-
-return_value(Tag,Binary) ->
-    {ok,{Tag,RestBinary}}=get_tag(Binary),
-    {ok,{LenVal,_RestBinary2}} = get_length_and_value(RestBinary),
-    {ok,<<Tag/binary,LenVal/binary>>}.
-
-
-%% skip_tag and skip_length_and_value are rutines used both by
-%% decode_partial_incomplete and decode_selective (decode/2).
-
-skip_tag(<<_:3,31:5,Rest/binary>>)->
-    skip_long_tag(Rest);
-skip_tag(<<_:3,_Tag:5,Rest/binary>>) ->
-    {ok,Rest}.
-
-skip_long_tag(<<1:1,_:7,Rest/binary>>) ->
-    skip_long_tag(Rest);
-skip_long_tag(<<0:1,_:7,Rest/binary>>) ->
-    {ok,Rest}.
-
-skip_optional_tag(<<>>,Binary) ->
-    {ok,Binary};
-skip_optional_tag(<<Tag,RestTag/binary>>,<<Tag,Rest/binary>>) ->
-    skip_optional_tag(RestTag,Rest);
-skip_optional_tag(_,_) ->
-    missing.
-
-
-
-
-skip_length_and_value(Binary) ->
-    case decode_length(Binary) of
-	{indefinite,RestBinary} ->
-	    skip_indefinite_value(RestBinary);
-	{Length,RestBinary} ->
-	    <<_:Length/unit:8,Rest/binary>> = RestBinary,
-	    {ok,Rest}
-    end.
-
-skip_indefinite_value(<<0,0,Rest/binary>>) ->
-    {ok,Rest};
-skip_indefinite_value(Binary) ->
-    {ok,RestBinary}=skip_tag(Binary),
-    {ok,RestBinary2} = skip_length_and_value(RestBinary),
-    skip_indefinite_value(RestBinary2).
-
-get_value(Binary) ->
-    case decode_length(Binary) of
-	{indefinite,RestBinary} ->
-	    get_indefinite_value(RestBinary,[]);
-	{Length,RestBinary} ->
-	    <<Value:Length/binary,_Rest/binary>> = RestBinary,
-	    {ok,Value}
-    end.
-
-get_indefinite_value(<<0,0,_Rest/binary>>,Acc) ->
-    {ok,list_to_binary(lists:reverse(Acc))};
-get_indefinite_value(Binary,Acc) ->
-    {ok,{Tag,RestBinary}}=get_tag(Binary),
-    {ok,{LenVal,RestBinary2}} = get_length_and_value(RestBinary),
-    get_indefinite_value(RestBinary2,[LenVal,Tag|Acc]).
-
-get_tag(<<H:1/binary,Rest/binary>>) ->
-    case H of
-	<<_:3,31:5>> ->
-	    get_long_tag(Rest,[H]);
-	_ -> {ok,{H,Rest}}
-    end.
-get_long_tag(<<H:1/binary,Rest/binary>>,Acc) ->
-    case H of
-	<<0:1,_:7>> ->
-	    {ok,{list_to_binary(lists:reverse([H|Acc])),Rest}};
-	_ ->
-	    get_long_tag(Rest,[H|Acc])
-    end.
-
-get_length_and_value(Bin = <<0:1,Length:7,_T/binary>>) ->
-    <<Len,Val:Length/binary,Rest/binary>> = Bin,
-    {ok,{<<Len,Val/binary>>, Rest}};
-get_length_and_value(Bin = <<1:1,0:7,_T/binary>>) ->
-    get_indefinite_length_and_value(Bin);
-get_length_and_value(<<1:1,LL:7,T/binary>>) ->
-    <<Length:LL/unit:8,Rest/binary>> = T,
-    <<Value:Length/binary,Rest2/binary>> = Rest,
-    {ok,{<<1:1,LL:7,Length:LL/unit:8,Value/binary>>,Rest2}}.
-
-get_indefinite_length_and_value(<<H,T/binary>>) ->
-    get_indefinite_length_and_value(T,[H]).
-
-get_indefinite_length_and_value(<<0,0,Rest/binary>>,Acc) ->
-    {ok,{list_to_binary(lists:reverse(Acc)),Rest}};
-get_indefinite_length_and_value(Binary,Acc) ->
-    {ok,{Tag,RestBinary}}=get_tag(Binary),
-    {ok,{LenVal,RestBinary2}}=get_length_and_value(RestBinary),
-    get_indefinite_length_and_value(RestBinary2,[LenVal,Tag|Acc]).
-    
-
-
-    
-%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
-%% match_tags takes a Tlv (Tag, Length, Value) structure and matches
-%% it with the tags in TagList. If the tags does not match the function
-%% crashes otherwise it returns the remaining Tlv after that the tags have
-%% been removed.
-%%
-%% match_tags(Tlv, TagList)
-%%
-
-match_tags({T,V},[T]) ->
-    V;
-match_tags({T,V}, [T|Tt]) ->
-    match_tags(V,Tt);
-match_tags([{T,V}],[T|Tt]) ->
-    match_tags(V, Tt);
-match_tags(Vlist = [{T,_V}|_], [T]) ->
-    Vlist;
-match_tags(Tlv, []) ->
-    Tlv;
-match_tags(Tlv = {Tag,_V},[T|_Tt]) ->
-    exit({error,{asn1,{wrong_tag,{{expected,T},{got,Tag,Tlv}}}}}).
- 
-%%%
-%% skips components that do not match a tag in Tags
-skip_ExtensionAdditions([],_Tags) ->
-    [];
-skip_ExtensionAdditions(TLV=[{Tag,_}|Rest],Tags) ->
-    case [X||X=T<-Tags,T==Tag] of
-	[] ->
-	    %% skip this TLV and continue with next
-	    skip_ExtensionAdditions(Rest,Tags);
-	_ ->
-	    TLV
-    end.
-    
-
-%%=============================================================================== 
-%%=============================================================================== 
-%%=============================================================================== 
-%% Optionals, preset not filled optionals with asn1_NOVALUE 
-%%=============================================================================== 
-%%=============================================================================== 
-%%=============================================================================== 
- 
-fixoptionals(OptList,Val) when is_list(Val) -> 
-    fixoptionals(OptList,Val,1,[],[]). 
- 
-fixoptionals([{Name,Pos}|Ot],[{Name,Val}|Vt],_Opt,Acc1,Acc2) -> 
-    fixoptionals(Ot,Vt,Pos+1,[1|Acc1],[{Name,Val}|Acc2]); 
-fixoptionals([{_Name,Pos}|Ot],V,Pos,Acc1,Acc2) -> 
-    fixoptionals(Ot,V,Pos+1,[0|Acc1],[asn1_NOVALUE|Acc2]); 
-fixoptionals(O,[Vh|Vt],Pos,Acc1,Acc2) -> 
-    fixoptionals(O,Vt,Pos+1,Acc1,[Vh|Acc2]); 
-fixoptionals([],[Vh|Vt],Pos,Acc1,Acc2) -> 
-    fixoptionals([],Vt,Pos+1,Acc1,[Vh|Acc2]); 
-fixoptionals([],[],_,_Acc1,Acc2) -> 
-    % return Val as a record 
-    list_to_tuple([asn1_RECORDNAME|lists:reverse(Acc2)]).
- 
- 
-%%encode_tag(TagClass(?UNI, APP etc), Form (?PRIM etx), TagInteger) ->  
-%%     8bit Int | binary 
-encode_tag_val({Class, Form, TagNo}) when (TagNo =< 30) -> 
-    <<(Class bsr 6):2,(Form bsr 5):1,TagNo:5>>;
-
-encode_tag_val({Class, Form, TagNo}) -> 
-    {Octets,_Len} = mk_object_val(TagNo),
-    BinOct = list_to_binary(Octets),
-    <<(Class bsr 6):2, (Form bsr 5):1, 31:5,BinOct/binary>>.
- 
-
-%%=============================================================================== 
-%% Decode a tag 
-%% 
-%% decode_tag(OctetListBuffer) -> {{Form, (Class bsl 16)+ TagNo}, RestOfBuffer, RemovedBytes} 
-%%=============================================================================== 
-
-decode_tag_and_length(<<Class:2, Form:1, TagNo:5, 0:1, Length:7, V:Length/binary, RestBuffer/binary>>) when TagNo < 31 -> 
-    {Form, (Class bsl 16) + TagNo, V, RestBuffer};
-decode_tag_and_length(<<Class:2, 1:1, TagNo:5, 1:1, 0:7, T/binary>>) when TagNo < 31 ->
-    {2, (Class bsl 16) + TagNo, T, <<>>};
-decode_tag_and_length(<<Class:2, Form:1, TagNo:5, 1:1, LL:7, Length:LL/unit:8,V:Length/binary, T/binary>>) when TagNo < 31 ->
-    {Form, (Class bsl 16) + TagNo, V, T};
-decode_tag_and_length(<<Class:2, Form:1, 31:5, 0:1, TagNo:7, 0:1, Length:7, V:Length/binary, RestBuffer/binary>>) -> 
-    {Form, (Class bsl 16) + TagNo, V, RestBuffer};
-decode_tag_and_length(<<Class:2, 1:1, 31:5, 0:1, TagNo:7, 1:1, 0:7, T/binary>>)  ->
-    {2, (Class bsl 16) + TagNo, T, <<>>};
-decode_tag_and_length(<<Class:2, Form:1, 31:5, 0:1, TagNo:7, 1:1, LL:7, Length:LL/unit:8, V:Length/binary, T/binary>>)  ->
-    {Form, (Class bsl 16) + TagNo, V, T};
-decode_tag_and_length(<<Class:2, Form:1, 31:5, 1:1, TagPart1:7, 0:1, TagPartLast, Buffer/binary>>) ->
-    TagNo = (TagPart1 bsl 7) bor TagPartLast,
-    {Length, RestBuffer} = decode_length(Buffer),
-    << V:Length/binary, RestBuffer2/binary>> = RestBuffer,
-    {Form, (Class bsl 16) + TagNo, V, RestBuffer2};
-decode_tag_and_length(<<Class:2, Form:1, 31:5, Buffer/binary>>) ->
-    {TagNo, Buffer1} = decode_tag(Buffer, 0),
-    {Length, RestBuffer} = decode_length(Buffer1),
-    << V:Length/binary, RestBuffer2/binary>> = RestBuffer,
-    {Form, (Class bsl 16) + TagNo, V, RestBuffer2}.
-
-
-     
-%% last partial tag 
-decode_tag(<<0:1,PartialTag:7, Buffer/binary>>, TagAck) ->
-    TagNo = (TagAck bsl 7) bor PartialTag,
-    %%<<TagNo>> = <<TagAck:1, PartialTag:7>>,
-    {TagNo, Buffer}; 
-% more tags 
-decode_tag(<<_:1,PartialTag:7, Buffer/binary>>, TagAck) -> 
-    TagAck1 = (TagAck bsl 7) bor PartialTag, 
-    %%<<TagAck1:16>> = <<TagAck:1, PartialTag:7,0:8>>,
-    decode_tag(Buffer, TagAck1). 
- 
-
-%%=======================================================================
-%%
-%% Encode all tags in the list Tags and return a possibly deep list of
-%% bytes with tag and length encoded
-%% The taglist must be in reverse order (fixed by the asn1 compiler)
-%% e.g [T1,T2] will result in 
-%% {[EncodedT2,EncodedT1|BytesSoFar],LenSoFar+LenT2+LenT1}
-%% 
-
-encode_tags([Tag|Trest], BytesSoFar, LenSoFar) ->
-% remove    {Bytes1,L1} = encode_one_tag(Tag),
-    {Bytes2,L2} = encode_length(LenSoFar),
-    encode_tags(Trest, [Tag,Bytes2|BytesSoFar], 
-		 LenSoFar + size(Tag) + L2);
-encode_tags([], BytesSoFar, LenSoFar) ->
-    {BytesSoFar,LenSoFar}.
-
-encode_tags(TagIn, {BytesSoFar,LenSoFar}) ->
-    encode_tags(TagIn, BytesSoFar, LenSoFar).
-
-% encode_one_tag(#tag{class=Class,number=No,type=Type, form = Form}) ->			  
-%     NewForm = case Type of
-% 	       'EXPLICIT' ->
-% 		   ?CONSTRUCTED;
-% 	       _ ->
-% 		   Form
-% 	   end,
-%     Bytes = encode_tag_val({Class,NewForm,No}),
-%     {Bytes,size(Bytes)}.
-
- 
-%%=============================================================================== 
-%% 
-%% This comment is valid for all the encode/decode functions 
-%% 
-%% C = Constraint -> typically {'ValueRange',LowerBound,UpperBound} 
-%%     used for PER-coding but not for BER-coding. 
-%% 
-%% Val = Value.  If Val is an atom then it is a symbolic integer value  
-%%       (i.e the atom must be one of the names in the NamedNumberList). 
-%%       The NamedNumberList is used to translate the atom to an integer value 
-%%       before encoding. 
-%% 
-%%=============================================================================== 
- 
-%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
-%% encode_open_type(Value) -> io_list (i.e nested list with integers, binaries)
-%% Value = list of bytes of an already encoded value (the list must be flat)
-%%         | binary
-
-%%
-encode_open_type(Val) when is_list(Val) -> 
-%    {Val,length(Val)};
-    encode_open_type(list_to_binary(Val));
-encode_open_type(Val) ->
-    {Val, size(Val)}. 
-
-%% 
-encode_open_type(Val, T) when is_list(Val) -> 
-    encode_open_type(list_to_binary(Val),T);
-encode_open_type(Val,[]) ->
-    {Val, size(Val)};
-encode_open_type(Val,Tag) ->
-    encode_tags(Tag,Val, size(Val)). 
-
-
-%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
-%% decode_open_type(Tlv, TagIn) -> Value
-%% Tlv = {Tag,V} | V where V -> binary()
-%% TagIn = [TagVal] where TagVal -> int()
-%% Value = binary with decoded data (which must be decoded again as some type)
-%%
-decode_open_type(Tlv, TagIn) ->
-    decode_open_type(Tlv, TagIn, erlang).
-decode_open_type(Tlv, TagIn, Method) ->
-    case match_tags(Tlv,TagIn) of
-	Bin when is_binary(Bin) ->
-	    {InnerTlv,_} = decode(Bin,Method),
-	    InnerTlv;
-	TlvBytes -> TlvBytes
-    end.
-
- 
-decode_open_type_as_binary(Tlv, TagIn) ->
-    decode_open_type_as_binary(Tlv, TagIn, erlang).
-decode_open_type_as_binary(Tlv,TagIn, Method)->
-    case match_tags(Tlv,TagIn) of
-	V when is_binary(V) ->
-	    V;
-	[Tlv2] -> encode(Tlv2, Method);
-	Tlv2 -> encode(Tlv2, Method)
-    end.
- 
-%%=============================================================================== 
-%%=============================================================================== 
-%%=============================================================================== 
-%% Boolean, ITU_T X.690 Chapter 8.2 
-%%=============================================================================== 
-%%=============================================================================== 
-%%=============================================================================== 
- 
-%%=============================================================================== 
-%% encode_boolean(Integer, ReversedTagList) -> {[Octet],Len} 
-%%=============================================================================== 
- 
-encode_boolean({Name, Val}, TagIn) when is_atom(Name) -> 
-    encode_boolean(Val, TagIn); 
-encode_boolean(true, TagIn) -> 
-    encode_tags(TagIn, [16#FF],1);
-encode_boolean(false, TagIn) -> 
-    encode_tags(TagIn, [0],1);
-encode_boolean(X,_) ->
-    exit({error,{asn1, {encode_boolean, X}}}). 
- 
- 
-%%=============================================================================== 
-%% decode_boolean(BuffList, HasTag, TotalLen) -> {true, Remain, RemovedBytes} |  
-%%                                               {false, Remain, RemovedBytes} 
-%%=============================================================================== 
-decode_boolean(Tlv,TagIn) ->
-    Val = match_tags(Tlv, TagIn),
-    case Val of
-	<<0:8>> ->
-	    false;
-	<<_:8>> ->
-	    true;
-	_ ->
-	    exit({error,{asn1, {decode_boolean, Val}}})
-    end.
-
- 
-%%=========================================================================== 
-%% Integer, ITU_T X.690 Chapter 8.3 
-
-%% encode_integer(Constraint, Value, Tag) -> [octet list] 
-%% encode_integer(Constraint, Name, NamedNumberList, Tag) -> [octet list] 
-%%    Value = INTEGER | {Name,INTEGER}  
-%%    Tag = tag | notag 
-%%=========================================================================== 
- 
-encode_integer(C, Val, Tag) when is_integer(Val) -> 
-    encode_tags(Tag, encode_integer(C, Val));
-encode_integer(C,{Name,Val},Tag) when is_atom(Name) ->
-    encode_integer(C,Val,Tag);
-encode_integer(_C, Val, _Tag) -> 
-    exit({error,{asn1, {encode_integer, Val}}}). 
- 
- 
- 
-encode_integer(C, Val, NamedNumberList, Tag) when is_atom(Val) -> 
-    case lists:keysearch(Val, 1, NamedNumberList) of 
-	{value,{_, NewVal}} ->  
-	    encode_tags(Tag, encode_integer(C, NewVal)); 
-	_ ->  
-	    exit({error,{asn1, {encode_integer_namednumber, Val}}}) 
-    end; 
-encode_integer(C,{_Name,Val},NamedNumberList,Tag) ->
-    encode_integer(C,Val,NamedNumberList,Tag); 
-encode_integer(C, Val, _NamedNumberList, Tag) -> 
-    encode_tags(Tag, encode_integer(C, Val)). 
- 
- 
-encode_integer(_, Val) -> 
-    Bytes =  
-	if  
-	    Val >= 0 -> 
-		encode_integer_pos(Val, []); 
-	    true -> 
-		encode_integer_neg(Val, []) 
-	end, 
-    {Bytes,length(Bytes)}. 
- 
-encode_integer_pos(0, L=[B|_Acc]) when B < 128 ->
-    L;
-encode_integer_pos(N, Acc) ->
-    encode_integer_pos((N bsr 8), [N band 16#ff| Acc]).
-
-encode_integer_neg(-1, L=[B1|_T]) when B1 > 127 ->
-    L;
-encode_integer_neg(N, Acc) ->
-    encode_integer_neg(N bsr 8, [N band 16#ff|Acc]).
-
-%%=============================================================================== 
-%% decode integer  
-%%    (Buffer, Range, HasTag, TotalLen) -> {Integer, Remain, RemovedBytes}  
-%%    (Buffer, Range, NamedNumberList, HasTag, TotalLen) -> {Integer, Remain, RemovedBytes}  
-%%=============================================================================== 
-
-decode_integer(Tlv,Range,NamedNumberList,TagIn) ->
-    V = match_tags(Tlv,TagIn),
-    Int = decode_integer(V),
-    range_check_integer(Int,Range),
-    number2name(Int,NamedNumberList).
-
-decode_integer(Tlv,Range,TagIn) ->
-    V = match_tags(Tlv, TagIn),
-    Int = decode_integer(V),
-    range_check_integer(Int,Range),
-    Int.
-
-%% decoding postitive integer values. 
-decode_integer(Bin = <<0:1,_:7,_/binary>>) ->
-    Len = size(Bin),
-%    <<Int:Len/unit:8,Buffer2/binary>> = Bin,
-    <<Int:Len/unit:8>> = Bin,
-    Int;
-%% decoding negative integer values.
-decode_integer(Bin = <<1:1,B2:7,Bs/binary>>)  ->
-    Len = size(Bin),
-%    <<N:Len/unit:8,Buffer2/binary>> = <<B2,Bs/binary>>,
-    <<N:Len/unit:8>> = <<B2,Bs/binary>>,
-    Int = N - (1 bsl (8 * Len - 1)),
-    Int.
-
-range_check_integer(Int,Range) ->
-    case Range of
-	[] -> % No length constraint
-	    Int;
-	{Lb,Ub} when Int >= Lb, Ub >= Int -> % variable length constraint
-	    Int;
-	Int -> % fixed value constraint
-	    Int;
-	{_,_} -> 
-	    exit({error,{asn1,{integer_range,Range,Int}}});
-	SingleValue when is_integer(SingleValue) ->
-	    exit({error,{asn1,{integer_range,Range,Int}}});
-	_ -> % some strange constraint that we don't support yet
-	    Int
-    end.
-
-number2name(Int,[]) ->
-    Int;
-number2name(Int,NamedNumberList) ->
-    case lists:keysearch(Int, 2, NamedNumberList) of 
-	{value,{NamedVal, _}} -> 
-	    NamedVal; 
-	_ -> 
-	    Int 
-    end. 
-
- 
-%%============================================================================ 
-%% Enumerated value, ITU_T X.690 Chapter 8.4 
-
-%% encode enumerated value 
-%%============================================================================ 
-encode_enumerated(Val, TagIn) when is_integer(Val)->
-    encode_tags(TagIn, encode_integer(false,Val));
-encode_enumerated({Name,Val}, TagIn) when is_atom(Name) ->
-    encode_enumerated(Val, TagIn).
-
-%% The encode_enumerated functions below this line can be removed when the
-%% new code generation is stable. (the functions might have to be kept here
-%% a while longer for compatibility reasons)
-
-encode_enumerated(C, Val, {NamedNumberList,ExtList}, TagIn) when is_atom(Val) ->
-    case catch encode_enumerated(C, Val, NamedNumberList, TagIn) of
-	{'EXIT',_} -> encode_enumerated(C, Val, ExtList, TagIn);
-	Result -> Result
-    end;
- 
-encode_enumerated(C, Val, NamedNumberList, TagIn) when is_atom(Val) -> 
-    case lists:keysearch(Val, 1, NamedNumberList) of 
-	{value, {_, NewVal}} -> 
-	    encode_tags(TagIn, encode_integer(C, NewVal)); 
-	_ -> 
-	    exit({error,{asn1, {enumerated_not_in_range, Val}}}) 
-    end; 
-
-encode_enumerated(C, {asn1_enum, Val}, {_,_}, TagIn) when is_integer(Val) ->
-    encode_tags(TagIn, encode_integer(C,Val));
-
-encode_enumerated(C, {Name,Val}, NamedNumberList, TagIn) when is_atom(Name) -> 
-    encode_enumerated(C, Val, NamedNumberList, TagIn);
-
-encode_enumerated(_C, Val, _NamedNumberList, _TagIn) -> 
-    exit({error,{asn1, {enumerated_not_namednumber, Val}}}). 
- 
- 
- 
-%%============================================================================ 
-%% decode enumerated value 
-%%   (Buffer, Range, NamedNumberList, HasTag, TotalLen) ->  Value 
-%%===========================================================================
-decode_enumerated(Tlv, Range, NamedNumberList, Tags) ->
-    Buffer = match_tags(Tlv,Tags),
-    decode_enumerated_notag(Buffer, Range, NamedNumberList, Tags).
-
-decode_enumerated_notag(Buffer, _Range, {NamedNumberList,ExtList}, _Tags) ->
-
-    IVal = decode_integer2(size(Buffer), Buffer),
-    case decode_enumerated1(IVal, NamedNumberList) of
-	{asn1_enum,IVal} ->
-	    decode_enumerated1(IVal,ExtList);
-	EVal ->
-	    EVal
-    end;
-decode_enumerated_notag(Buffer, _Range, NNList, _Tags) ->
-    IVal = decode_integer2(size(Buffer), Buffer), 
-    case decode_enumerated1(IVal, NNList) of
-	{asn1_enum,_} ->
-	    exit({error,{asn1, {illegal_enumerated, IVal}}});
-	EVal ->
-	    EVal
-    end.
-
-decode_enumerated1(Val, NamedNumberList) ->     
-    %% it must be a named integer 
-    case lists:keysearch(Val, 2, NamedNumberList) of 
-	{value,{NamedVal, _}} -> 
-	    NamedVal; 
-	_ -> 
-	    {asn1_enum,Val}
-    end.
- 
-
-%%============================================================================ 
-%%
-%% Real value, ITU_T X.690 Chapter 8.5 
-%%============================================================================ 
-%%
-%% encode real value 
-%%============================================================================ 
- 
-%% only base 2 internally so far!! 
-encode_real(_C,0, TagIn) ->
-    encode_tags(TagIn, {[],0}); 
-encode_real(_C,'PLUS-INFINITY', TagIn) ->
-    encode_tags(TagIn, {[64],1}); 
-encode_real(_C,'MINUS-INFINITY', TagIn) -> 
-    encode_tags(TagIn, {[65],1}); 
-encode_real(C,Val, TagIn) when is_tuple(Val); is_list(Val) -> 
-    encode_tags(TagIn, encode_real(C,Val)). 
- 
-
-
-encode_real(C,Val) ->
-    asn1rt_ber_bin:encode_real(C,Val). 
- 
- 
-%%============================================================================ 
-%% decode real value 
-%% 
-%% decode_real([OctetBufferList], tuple|value, tag|notag) -> 
-%%  {{Mantissa, Base, Exp} | realval | PLUS-INFINITY | MINUS-INFINITY | 0, 
-%%     RestBuff} 
-%%  
-%% only for base 2 and 10 decoding sofar!! 
-%%============================================================================ 
- 
-decode_real(Tlv, Tags) ->
-    Buffer = match_tags(Tlv,Tags),
-    decode_real_notag(Buffer).
-
-decode_real_notag(Buffer) ->
-    Len =
-	case Buffer of
-	    Bin when is_binary(Bin) ->
-		size(Bin);
-	    {_T,_V} ->
-		exit({error,{asn1,{real_not_in_primitive_form,Buffer}}})
-	end,
-    {Val,_Rest,Len} = asn1rt_ber_bin:decode_real(Buffer,Len),
-    Val.
-%%    exit({error,{asn1, {unimplemented,real}}}).
-%%  decode_real2(Buffer, Form, size(Buffer)).
-
-% decode_real2(Buffer, Form, Len) ->
-%     <<First, Buffer2/binary>> = Buffer,
-%     if
-% 	First =:= 2#01000000 -> {'PLUS-INFINITY', Buffer2}; 
-% 	First =:= 2#01000001 -> {'MINUS-INFINITY', Buffer2}; 
-% 	First =:= 2#00000000 -> {0, Buffer2}; 
-% 	true -> 
-% 	    %% have some check here to verify only supported bases (2) 
-% 	    <<B7:1,B6:1,B5_4:2,B3_2:2,B1_0:2>> = <<First>>,
-% 		Sign = B6,
-% 	    Base = 
-% 		case B5_4 of
-% 		    0 -> 2;  % base 2, only one so far 
-% 		    _ -> exit({error,{asn1, {non_supported_base, First}}}) 
-% 		end, 
-% 	    ScalingFactor = 
-% 		case B3_2 of
-% 		    0 -> 0;  % no scaling so far  
-% 		    _ -> exit({error,{asn1, {non_supported_scaling, First}}}) 
-% 		end, 
-						
-% 	    {FirstLen,Exp,Buffer3} =
-% 		case B1_0 of
-% 		    0 ->
-% 			<<_:1/unit:8,Buffer21/binary>> = Buffer2,
-% 			{2, decode_integer2(1, Buffer2),Buffer21}; 
-% 		    1 ->
-% 			<<_:2/unit:8,Buffer21/binary>> = Buffer2,
-% 			{3, decode_integer2(2, Buffer2)}; 
-% 		    2 ->
-% 			<<_:3/unit:8,Buffer21/binary>> = Buffer2,
-% 			{4, decode_integer2(3, Buffer2)}; 
-% 		    3 -> 
-% 			<<ExpLen1,RestBuffer/binary>> = Buffer2,
-% 			<<_:ExpLen1/unit:8,RestBuffer2/binary>> = RestBuffer,
-% 			{ ExpLen1 + 2, 
-% 			  decode_integer2(ExpLen1, RestBuffer, RemBytes1),
-% 			  RestBuffer2} 
-% 		end, 
-% 	    Length = Len - FirstLen,
-% 	    <<LongInt:Length/unit:8,RestBuff/binary>> = Buffer3,
-% 	    {Mantissa, Buffer4} = 
-% 		if Sign =:= 0 -> 
-			
-% 			{LongInt, RestBuff};%  sign plus, 
-% 		   true -> 
-			
-% 			{-LongInt, RestBuff}%  sign minus 
-% 		end, 
-% 	    case Form of 
-% 		tuple -> 
-% 		    {Val,Buf,RemB} = Exp, 
-% 		    {{Mantissa, Base, {Val,Buf}}, Buffer4, RemBytes2+RemBytes3};  
-% 		_value -> 
-% 		    comming 
-% 	    end 
-%     end. 
- 
- 
-%%============================================================================ 
-%% Bitstring value, ITU_T X.690 Chapter 8.6 
-%%
-%% encode bitstring value 
-%% 
-%% bitstring NamedBitList 
-%% Val can be  of: 
-%% - [identifiers] where only named identifers are set to one,  
-%%   the Constraint must then have some information of the  
-%%   bitlength. 
-%% - [list of ones and zeroes] all bits  
-%% - integer value representing the bitlist 
-%% C is constrint Len, only valid when identifiers 
-%%============================================================================ 
- 
-encode_bit_string(C,Bin={Unused,BinBits},NamedBitList,TagIn) when is_integer(Unused), is_binary(BinBits) ->
-    encode_bin_bit_string(C,Bin,NamedBitList,TagIn);
-encode_bit_string(C, [FirstVal | RestVal], NamedBitList, TagIn) when is_atom(FirstVal) -> 
-    encode_bit_string_named(C, [FirstVal | RestVal], NamedBitList, TagIn); 
-
-encode_bit_string(C, [{bit,X} | RestVal], NamedBitList, TagIn) -> 
-    encode_bit_string_named(C, [{bit,X} | RestVal], NamedBitList, TagIn); 
- 
-encode_bit_string(C, [FirstVal| RestVal], NamedBitList, TagIn) when is_integer(FirstVal) -> 
-    encode_bit_string_bits(C, [FirstVal | RestVal], NamedBitList, TagIn); 
- 
-encode_bit_string(_C, 0, _NamedBitList, TagIn) -> 
-    encode_tags(TagIn, <<0>>,1); 
-
-encode_bit_string(_C, [], _NamedBitList, TagIn) -> 
-    encode_tags(TagIn, <<0>>,1); 
-
-encode_bit_string(C, IntegerVal, NamedBitList, TagIn) when is_integer(IntegerVal) -> 
-    BitListVal = int_to_bitlist(IntegerVal),
-    encode_bit_string_bits(C, BitListVal, NamedBitList, TagIn);
-
-encode_bit_string(C, {Name,BitList}, NamedBitList, TagIn) when is_atom(Name) ->
-    encode_bit_string(C, BitList, NamedBitList, TagIn).
-  
- 
- 
-int_to_bitlist(0) ->
-    [];
-int_to_bitlist(Int) when is_integer(Int), Int >= 0 ->
-    [Int band 1 | int_to_bitlist(Int bsr 1)].
-
-
-%%================================================================= 
-%% Encode BIT STRING of the form {Unused,BinBits}. 
-%% Unused is the number of unused bits in the last byte in BinBits 
-%% and BinBits is a binary representing the BIT STRING.
-%%================================================================= 
-encode_bin_bit_string(C,{Unused,BinBits},_NamedBitList,TagIn)->
-    case get_constraint(C,'SizeConstraint') of
-	no ->
-	    remove_unused_then_dotag(TagIn, Unused, BinBits);
-	{_Min,Max} ->
-	    BBLen = (size(BinBits)*8)-Unused,
-	    if
-		BBLen > Max ->
-		    exit({error,{asn1, 
-				 {bitstring_length, 
-				  {{was,BBLen},{maximum,Max}}}}}); 
-		true ->
-		    remove_unused_then_dotag(TagIn, Unused, BinBits)
-	    end;
-	Size ->
-	    case ((size(BinBits)*8)-Unused) of
-		BBSize when BBSize =< Size ->
-		    remove_unused_then_dotag(TagIn, Unused, BinBits);
-		BBSize  ->
-		    exit({error,{asn1,  
-				 {bitstring_length, 
-				  {{was,BBSize},{should_be,Size}}}}})
-	    end
-    end.
-
-remove_unused_then_dotag(TagIn,Unused,BinBits) ->
-    case Unused of
-	0 when (size(BinBits) == 0) ->
-	    encode_tags(TagIn,<<0>>,1);
-	0 ->
-	    Bin = <<Unused,BinBits/binary>>,
-	    encode_tags(TagIn,Bin,size(Bin));
-	Num ->
-	    N = (size(BinBits)-1),
-	    <<BBits:N/binary,LastByte>> = BinBits,
-	    encode_tags(TagIn,
-			[Unused,binary_to_list(BBits) ++[(LastByte bsr Num) bsl Num]],
-			1+size(BinBits))
-    end.
-
-
-%%================================================================= 
-%% Encode named bits 
-%%================================================================= 
- 
-encode_bit_string_named(C, [FirstVal | RestVal], NamedBitList, TagIn) -> 
-    ToSetPos = get_all_bitposes([FirstVal | RestVal], NamedBitList, []), 
-    Size = 
-	case get_constraint(C,'SizeConstraint') of 
-	    no -> 
-		lists:max(ToSetPos)+1;
-	    {_Min,Max} ->
-		Max;
-	    TSize ->
-		TSize
-	end,
-    BitList = make_and_set_list(Size, ToSetPos, 0), 
-    {Len, Unused, OctetList} = encode_bitstring(BitList),  
-    encode_tags(TagIn, [Unused|OctetList],Len+1). 
-
-	 
-%%---------------------------------------- 
-%% get_all_bitposes([list of named bits to set], named_bit_db, []) -> 
-%%   [sorted_list_of_bitpositions_to_set] 
-%%---------------------------------------- 
-
-get_all_bitposes([{bit,ValPos}|Rest], NamedBitList, Ack) ->
-    get_all_bitposes(Rest, NamedBitList, [ValPos | Ack ]);
-get_all_bitposes([Val | Rest], NamedBitList, Ack) when is_atom(Val) -> 
-    case lists:keysearch(Val, 1, NamedBitList) of 
-	{value, {_ValName, ValPos}} -> 
-	    get_all_bitposes(Rest, NamedBitList, [ValPos | Ack]); 
-	_ -> 
-	    exit({error,{asn1, {bitstring_namedbit, Val}}}) 
-    end; 
-get_all_bitposes([], _NamedBitList, Ack) -> 
-    lists:sort(Ack). 
- 
- 
-%%---------------------------------------- 
-%% make_and_set_list(Len of list to return, [list of positions to set to 1])-> 
-%% returns list of Len length, with all in SetPos set. 
-%% in positioning in list the first element is 0, the second 1 etc.., but 
-%% Len will make a list of length Len, not Len + 1. 
-%%    BitList = make_and_set_list(C, ToSetPos, 0), 
-%%---------------------------------------- 
- 
-make_and_set_list(0, [], _) -> []; 
-make_and_set_list(0, _, _) ->  
-    exit({error,{asn1,bitstring_sizeconstraint}}); 
-make_and_set_list(Len, [XPos|SetPos], XPos) -> 
-    [1 | make_and_set_list(Len - 1, SetPos, XPos + 1)]; 
-make_and_set_list(Len, [Pos|SetPos], XPos) -> 
-    [0 | make_and_set_list(Len - 1, [Pos | SetPos], XPos + 1)]; 
-make_and_set_list(Len, [], XPos) -> 
-    [0 | make_and_set_list(Len - 1, [], XPos + 1)]. 
- 
- 
- 
- 
- 
- 
-%%================================================================= 
-%% Encode bit string for lists of ones and zeroes 
-%%================================================================= 
-encode_bit_string_bits(C, BitListVal, _NamedBitList, TagIn) when is_list(BitListVal) -> 
-    case get_constraint(C,'SizeConstraint') of 
-	no -> 
-	    {Len, Unused, OctetList} = encode_bitstring(BitListVal),  
-	    %%add unused byte to the Len 
-	    encode_tags(TagIn, [Unused | OctetList], Len+1);
-	Constr={Min,_Max} when is_integer(Min) ->
-	    %% Max may be an integer or 'MAX'
-	    encode_constr_bit_str_bits(Constr,BitListVal,TagIn);
-	{Constr={_,_},[]} ->%Constr={Min,Max}
-	    %% constraint with extension mark
-	    encode_constr_bit_str_bits(Constr,BitListVal,TagIn);
-	Constr={{_,_},{_,_}} ->%{{Min1,Max1},{Min2,Max2}}
-	    %% constraint with extension mark
-	    encode_constr_bit_str_bits(Constr,BitListVal,TagIn);
-	Size ->
-	    case length(BitListVal) of
-		BitSize when BitSize == Size ->
-		    {Len, Unused, OctetList} = encode_bitstring(BitListVal),  
-		    %%add unused byte to the Len 
-		    encode_tags(TagIn, [Unused | OctetList], Len+1);  
-		BitSize when BitSize < Size ->
-		    PaddedList = pad_bit_list(Size-BitSize,BitListVal),
-		    {Len, Unused, OctetList} = encode_bitstring(PaddedList),  
-		    %%add unused byte to the Len 
-		    encode_tags(TagIn, [Unused | OctetList], Len+1);
-		BitSize -> 
-		    exit({error,{asn1,  
-			  {bitstring_length, {{was,BitSize},{should_be,Size}}}}}) 
-	    end 
- 
-    end. 
- 
-encode_constr_bit_str_bits({{_Min1,Max1},{Min2,Max2}},BitListVal,TagIn) ->
-    BitLen = length(BitListVal),
-    case BitLen of
-	Len when Len > Max2 -> 
-	    exit({error,{asn1,{bitstring_length,{{was,BitLen},
-						 {maximum,Max2}}}}}); 
-	Len when Len > Max1, Len < Min2  ->
-	    exit({error,{asn1,{bitstring_length,{{was,BitLen},
-						 {not_allowed_interval,
-						  Max1,Min2}}}}});
-	_ ->
-	    {Len, Unused, OctetList} = encode_bitstring(BitListVal),  
-	    %%add unused byte to the Len 
-	    encode_tags(TagIn, [Unused, OctetList], Len+1)  
-    end;
-encode_constr_bit_str_bits({Min,Max},BitListVal,TagIn) ->
-    BitLen = length(BitListVal), 
-    if  
-	BitLen > Max -> 
-	    exit({error,{asn1,{bitstring_length,{{was,BitLen},
-						 {maximum,Max}}}}}); 
-	BitLen < Min ->
-	    exit({error,{asn1,{bitstring_length,{{was,BitLen},
-						 {minimum,Max}}}}});
-	true -> 
-	    {Len, Unused, OctetList} = encode_bitstring(BitListVal),  
-	    %%add unused byte to the Len 
-	    encode_tags(TagIn, [Unused, OctetList], Len+1)  
-    end.
-
-
-%% returns a list of length Size + length(BitListVal), with BitListVal 
-%% as the most significant elements followed by padded zero elements
-pad_bit_list(Size,BitListVal) ->
-    Tail = lists:duplicate(Size,0),
-    lists:append(BitListVal,Tail).
- 
-%%================================================================= 
-%% Do the actual encoding 
-%%     ([bitlist]) -> {ListLen, UnusedBits, OctetList} 
-%%================================================================= 
- 
-encode_bitstring([B8, B7, B6, B5, B4, B3, B2, B1 | Rest]) -> 
-    Val = (B8 bsl 7) bor (B7 bsl 6) bor (B6 bsl 5) bor (B5 bsl 4) bor 
-	(B4 bsl 3) bor (B3 bsl 2) bor (B2 bsl 1) bor B1, 
-    encode_bitstring(Rest, [Val], 1); 
-encode_bitstring(Val) -> 
-    {Unused, Octet} = unused_bitlist(Val, 7, 0), 
-    {1, Unused, [Octet]}. 
- 
-encode_bitstring([B8, B7, B6, B5, B4, B3, B2, B1 | Rest], Ack, Len) -> 
-    Val = (B8 bsl 7) bor (B7 bsl 6) bor (B6 bsl 5) bor (B5 bsl 4) bor 
-	(B4 bsl 3) bor (B3 bsl 2) bor (B2 bsl 1) bor B1, 
-    encode_bitstring(Rest, [Ack | [Val]], Len + 1); 
-%%even multiple of 8 bits.. 
-encode_bitstring([], Ack, Len) -> 
-    {Len, 0, Ack}; 
-%% unused bits in last octet 
-encode_bitstring(Rest, Ack, Len) -> 
-%    io:format("uneven ~w ~w ~w~n",[Rest, Ack, Len]), 
-    {Unused, Val} = unused_bitlist(Rest, 7, 0), 
-    {Len + 1, Unused, [Ack | [Val]]}. 
- 
-%%%%%%%%%%%%%%%%%% 
-%% unused_bitlist([list of ones and zeros <= 7], 7, []) -> 
-%%  {Unused bits, Last octet with bits moved to right} 
-unused_bitlist([], Trail, Ack) -> 
-    {Trail + 1, Ack}; 
-unused_bitlist([Bit | Rest], Trail, Ack) -> 
-%%    io:format("trail Bit: ~w Rest: ~w Trail: ~w Ack:~w~n",[Bit, Rest, Trail, Ack]), 
-    unused_bitlist(Rest, Trail - 1, (Bit bsl Trail) bor Ack). 
- 
- 
-%%============================================================================ 
-%% decode bitstring value 
-%%    (Buffer, Range, NamedNumberList, HasTag, TotalLen) -> {Integer, Remain, RemovedBytes}  
-%%============================================================================ 
-
-decode_compact_bit_string(Buffer, Range, NamedNumberList, Tags) ->
-%    NewTags = new_tags(HasTag,#tag{class=?UNIVERSAL,number=?N_BIT_STRING}),
-     decode_restricted_string(Buffer, Range, ?N_BIT_STRING, Tags, 
-			     NamedNumberList,bin).
-
-decode_bit_string(Buffer, Range, NamedNumberList, Tags) -> 
-%    NewTags = new_tags(HasTag,#tag{class=?UNIVERSAL,number=?N_BIT_STRING}),
-    decode_restricted_string(Buffer, Range, ?N_BIT_STRING, Tags, 
-			     NamedNumberList,old). 
- 
-
-decode_bit_string2(<<0>>,_NamedNumberList,BinOrOld) -> 
-    case BinOrOld of
-	bin ->
-	    {0,<<>>};
-	_ ->
-	    []
-    end;
-decode_bit_string2(<<Unused,Bits/binary>>,NamedNumberList,BinOrOld) -> 
-    case NamedNumberList of 
-	[] -> 
-	    case BinOrOld of
-		bin ->
-		    {Unused,Bits};
-		_ ->
-		    decode_bitstring2(size(Bits), Unused, Bits)
-	    end;
-	_ -> 
-	    BitString = decode_bitstring2(size(Bits), Unused, Bits),
-	    decode_bitstring_NNL(BitString,NamedNumberList) 
-    end. 
- 
-%%---------------------------------------- 
-%% Decode the in buffer to bits 
-%%---------------------------------------- 
-decode_bitstring2(1,Unused,<<B7:1,B6:1,B5:1,B4:1,B3:1,B2:1,B1:1,B0:1,_/binary>>) -> 
-    lists:sublist([B7,B6,B5,B4,B3,B2,B1,B0],8-Unused); 
-decode_bitstring2(Len, Unused,
-		  <<B7:1,B6:1,B5:1,B4:1,B3:1,B2:1,B1:1,B0:1,Buffer/binary>>) -> 
-    [B7, B6, B5, B4, B3, B2, B1, B0 | 
-     decode_bitstring2(Len - 1, Unused, Buffer)]. 
- 
-%%decode_bitstring2(1, Unused, Buffer) -> 
-%%    make_bits_of_int(hd(Buffer), 128, 8-Unused); 
-%%decode_bitstring2(Len, Unused, [BitVal | Buffer]) -> 
-%%    [B7, B6, B5, B4, B3, B2, B1, B0] = make_bits_of_int(BitVal, 128, 8), 
-%%    [B7, B6, B5, B4, B3, B2, B1, B0 | 
-%%     decode_bitstring2(Len - 1, Unused, Buffer)]. 
- 
- 
-%%make_bits_of_int(_, _, 0) -> 
-%%    []; 
-%%make_bits_of_int(BitVal, MaskVal, Unused) when Unused > 0 -> 
-%%    X = case MaskVal band BitVal of 
-%%	    0 -> 0 ; 
-%%	    _ -> 1 
-%%	end, 
-%%    [X | make_bits_of_int(BitVal, MaskVal bsr 1, Unused - 1)]. 
- 
- 
- 
-%%---------------------------------------- 
-%% Decode the bitlist to names 
-%%---------------------------------------- 
-
- 
-decode_bitstring_NNL(BitList,NamedNumberList) -> 
-    decode_bitstring_NNL(BitList,NamedNumberList,0,[]). 
- 
- 
-decode_bitstring_NNL([],_,_No,Result) -> 
-    lists:reverse(Result); 
-
-decode_bitstring_NNL([B|BitList],[{Name,No}|NamedNumberList],No,Result) -> 
-    if 
-	B == 0 -> 
-	    decode_bitstring_NNL(BitList,NamedNumberList,No+1,Result); 
-	true -> 
-	    decode_bitstring_NNL(BitList,NamedNumberList,No+1,[Name|Result]) 
-    end; 
-decode_bitstring_NNL([1|BitList],NamedNumberList,No,Result) -> 
-	    decode_bitstring_NNL(BitList,NamedNumberList,No+1,[{bit,No}|Result]); 
-decode_bitstring_NNL([0|BitList],NamedNumberList,No,Result) ->
-	    decode_bitstring_NNL(BitList,NamedNumberList,No+1,Result). 
- 
- 
-%%============================================================================ 
-%% Octet string, ITU_T X.690 Chapter 8.7 
-%%
-%% encode octet string 
-%% The OctetList must be a flat list of integers in the range 0..255
-%% the function does not check this because it takes to much time
-%%============================================================================ 
-encode_octet_string(_C, OctetList, TagIn) when is_binary(OctetList) -> 
-    encode_tags(TagIn, OctetList, size(OctetList));
-encode_octet_string(_C, OctetList, TagIn) when is_list(OctetList) -> 
-    encode_tags(TagIn, OctetList, length(OctetList));
-encode_octet_string(C, {Name,OctetList}, TagIn) when is_atom(Name) -> 
-    encode_octet_string(C, OctetList, TagIn).
- 
-
-%%============================================================================ 
-%% decode octet string  
-%%    (Buffer, Range, HasTag, TotalLen) -> {String, Remain, RemovedBytes}  
-%% 
-%% Octet string is decoded as a restricted string 
-%%============================================================================ 
-decode_octet_string(Buffer, Range, Tags) -> 
-%    NewTags = new_tags(HasTag,#tag{class=?UNIVERSAL,number=?N_OCTET_STRING}),
-    decode_restricted_string(Buffer, Range, ?N_OCTET_STRING, 
-			     Tags, [], old). 
-
-%%============================================================================ 
-%% Null value, ITU_T X.690 Chapter 8.8 
-%%
-%% encode NULL value 
-%%============================================================================ 
- 
-encode_null({Name, _Val}, TagIn) when is_atom(Name) -> 
-    encode_tags(TagIn, [], 0);
-encode_null(_Val, TagIn) -> 
-    encode_tags(TagIn, [], 0). 
- 
-%%============================================================================ 
-%% decode NULL value 
-%%    (Buffer, HasTag, TotalLen) -> {NULL, Remain, RemovedBytes}  
-%%============================================================================ 
-
-decode_null(Tlv, Tags) ->
-    Val = match_tags(Tlv, Tags),
-    case Val of
-	<<>> ->
-	    'NULL';
-	_ ->
-	    exit({error,{asn1,{decode_null,Val}}})
-	end. 
- 
-%%============================================================================ 
-%% Object identifier, ITU_T X.690 Chapter 8.19 
-%%
-%% encode Object Identifier value 
-%%============================================================================ 
- 
-encode_object_identifier({Name,Val}, TagIn) when is_atom(Name) -> 
-    encode_object_identifier(Val, TagIn);
-encode_object_identifier(Val, TagIn) -> 
-    encode_tags(TagIn, e_object_identifier(Val)).
- 
-e_object_identifier({'OBJECT IDENTIFIER', V}) -> 
-    e_object_identifier(V); 
-e_object_identifier({Cname, V}) when is_atom(Cname), is_tuple(V) -> 
-    e_object_identifier(tuple_to_list(V)); 
-e_object_identifier({Cname, V}) when is_atom(Cname), is_list(V) -> 
-    e_object_identifier(V); 
-e_object_identifier(V) when is_tuple(V) -> 
-    e_object_identifier(tuple_to_list(V)); 
- 
-%%%%%%%%%%%%%%% 
-%% e_object_identifier([List of Obect Identifiers]) -> 
-%% {[Encoded Octetlist of ObjIds], IntLength} 
-%% 
-e_object_identifier([E1, E2 | Tail]) -> 
-    Head = 40*E1 + E2,  % wow! 
-    {H,Lh} = mk_object_val(Head),
-    {R,Lr} = lists:mapfoldl(fun enc_obj_id_tail/2,0,Tail),
-    {[H|R], Lh+Lr}.
-
-enc_obj_id_tail(H, Len) ->
-    {B, L} = mk_object_val(H),
-    {B,Len+L}.
-
-
-%%%%%%%%%%% 
-%% mk_object_val(Value) -> {OctetList, Len} 
-%% returns a Val as a list of octets, the 8 bit is allways set to one except 
-%% for the last octet, where its 0 
-%% 
-
- 
-mk_object_val(Val) when Val =< 127 -> 
-    {[255 band Val], 1}; 
-mk_object_val(Val) -> 
-    mk_object_val(Val bsr 7, [Val band 127], 1).  
-mk_object_val(0, Ack, Len) -> 
-    {Ack, Len}; 
-mk_object_val(Val, Ack, Len) -> 
-    mk_object_val(Val bsr 7, [((Val band 127) bor 128) | Ack], Len + 1). 
- 
- 
- 
-%%============================================================================ 
-%% decode Object Identifier value   
-%%    (Buffer, HasTag, TotalLen) -> {{ObjId}, Remain, RemovedBytes}  
-%%============================================================================ 
- 
-decode_object_identifier(Tlv, Tags) -> 
-    Val = match_tags(Tlv, Tags),
-    [AddedObjVal|ObjVals] = dec_subidentifiers(Val,0,[]), 
-    {Val1, Val2} = if 
-		       AddedObjVal < 40 -> 
-			   {0, AddedObjVal}; 
-		       AddedObjVal < 80 -> 
-			   {1, AddedObjVal - 40}; 
-		       true -> 
-			   {2, AddedObjVal - 80} 
-		   end, 
-    list_to_tuple([Val1, Val2 | ObjVals]).
-
-dec_subidentifiers(<<>>,_Av,Al) -> 
-    lists:reverse(Al); 
-dec_subidentifiers(<<1:1,H:7,T/binary>>,Av,Al) -> 
-    dec_subidentifiers(T,(Av bsl 7) + H,Al); 
-dec_subidentifiers(<<H,T/binary>>,Av,Al) -> 
-    dec_subidentifiers(T,0,[((Av bsl 7) + H)|Al]). 
-
-%%============================================================================ 
-%% RELATIVE-OID, ITU_T X.690 Chapter 8.20 
-%%
-%% encode Relative Object Identifier 
-%%============================================================================ 
-encode_relative_oid({Name,Val},TagIn) when is_atom(Name) ->
-    encode_relative_oid(Val,TagIn);
-encode_relative_oid(Val,TagIn) when is_tuple(Val) ->
-    encode_relative_oid(tuple_to_list(Val),TagIn);
-encode_relative_oid(Val,TagIn) ->
-    encode_tags(TagIn, enc_relative_oid(Val)).
-
-enc_relative_oid(Tuple) when is_tuple(Tuple) ->
-    enc_relative_oid(tuple_to_list(Tuple));
-enc_relative_oid(Val) ->
-    lists:mapfoldl(fun(X,AccIn) ->
-			   {SO,L}=mk_object_val(X),
-			   {SO,L+AccIn}
-		   end
-		   ,0,Val).
-
-%%============================================================================ 
-%% decode Relative Object Identifier value   
-%%    (Buffer, HasTag, TotalLen) -> {{ObjId}, Remain, RemovedBytes}  
-%%============================================================================ 
-decode_relative_oid(Tlv, Tags) ->
-    Val = match_tags(Tlv, Tags),
-    ObjVals = dec_subidentifiers(Val,0,[]), 
-    list_to_tuple(ObjVals).
-
-%%============================================================================ 
-%% Restricted character string types, ITU_T X.690 Chapter 8.20 
-%%
-%% encode Numeric Printable Teletex Videotex Visible IA5 Graphic General strings 
-%%============================================================================ 
-%% The StringType arg is kept for future use but might be removed 
-encode_restricted_string(_C, OctetList, _StringType, TagIn) 
-  when is_binary(OctetList) -> 
-    encode_tags(TagIn, OctetList, size(OctetList)); 
-encode_restricted_string(_C, OctetList, _StringType, TagIn) 
-  when is_list(OctetList) -> 
-    encode_tags(TagIn, OctetList, length(OctetList)); 
-encode_restricted_string(C,{Name,OctetL}, StringType, TagIn) when is_atom(Name)-> 
-    encode_restricted_string(C, OctetL, StringType, TagIn).
-
-%%============================================================================ 
-%% decode Numeric Printable Teletex Videotex Visible IA5 Graphic General strings 
-%%    (Buffer, Range, StringType, HasTag, TotalLen) -> 
-%%                                  {String, Remain, RemovedBytes}  
-%%============================================================================ 
-
-decode_restricted_string(Buffer, Range, StringType, Tags) -> 
-	decode_restricted_string(Buffer, Range, StringType, Tags, [], old).
-
-
-decode_restricted_string(Tlv, Range, StringType, TagsIn, 
-			 NamedNumberList, BinOrOld) -> 
-    Val = match_tags(Tlv, TagsIn),
-    Val2 = 
-	case Val of
-	    PartList = [_H|_T] -> % constructed val
-		Bin = collect_parts(PartList),
-		decode_restricted(Bin, StringType, 
-				      NamedNumberList, BinOrOld);
-	    Bin ->
-		decode_restricted(Bin, StringType, 
-				      NamedNumberList, BinOrOld)
-	end,
-    check_and_convert_restricted_string(Val2,StringType,Range,NamedNumberList,BinOrOld).
-     
-
-
-% 	case StringType of
-% 	    ?N_BIT_STRING when BinOrOld == bin ->
-% 		{concat_bit_binaries(AccVal, Val), AccRb+Rb};
-% 	    _ when is_binary(Val),is_binary(AccVal) ->
-% 		{<<AccVal/binary,Val/binary>>,AccRb+Rb};
-% 	    _ when is_binary(Val), AccVal==[] ->
-% 		{Val,AccRb+Rb};				      
-% 	    _ ->	
-% 		{AccVal++Val, AccRb+Rb}
-% 	end,
-
-    
- 
-decode_restricted(Bin, StringType, NamedNumberList,BinOrOld) -> 
-	case StringType of 
-	    ?N_BIT_STRING -> 
-		decode_bit_string2(Bin, NamedNumberList, BinOrOld); 
-	    ?N_UniversalString ->
-		mk_universal_string(binary_to_list(Bin)); 
-	    ?N_BMPString ->  
-		mk_BMP_string(binary_to_list(Bin)); 
-	    _ ->  
-		Bin
-	end. 
-     
-
-check_and_convert_restricted_string(Val,StringType,Range,NamedNumberList,_BinOrOld) ->
-    {StrLen,NewVal} = case StringType of
-			  ?N_BIT_STRING when NamedNumberList /= [] ->
-			      {no_check,Val};
-			  ?N_BIT_STRING when is_list(Val) ->
-			      {length(Val),Val};
-			  ?N_BIT_STRING when is_tuple(Val) -> 
-			      {(size(element(2,Val))*8) - element(1,Val),Val};
-			  _ when is_binary(Val) ->
-			      {size(Val),binary_to_list(Val)};
-			  _ when is_list(Val) ->
-			      {length(Val), Val}
-		      end,
-    case Range of
-	_ when StrLen == no_check ->
-	    NewVal;
-	[] -> % No length constraint
-	    NewVal;
-	{Lb,Ub} when StrLen >= Lb, Ub >= StrLen -> % variable length constraint
-	    NewVal;
-	{{Lb,_Ub},[]} when StrLen >= Lb ->
-	    NewVal;
-	{{Lb,_Ub},_Ext=[Min|_]} when StrLen >= Lb; StrLen >= Min ->
-	    NewVal;
-	{{Lb1,Ub1},{Lb2,Ub2}} when StrLen >= Lb1, StrLen =< Ub1; 
-				   StrLen =< Ub2, StrLen >= Lb2 ->
-	    NewVal;
-	StrLen -> % fixed length constraint
-	    NewVal;
-	{_,_} -> 
-	    exit({error,{asn1,{length,Range,Val}}});
-	_Len when is_integer(_Len) ->
-	    exit({error,{asn1,{length,Range,Val}}});
-	_ -> % some strange constraint that we don't support yet
-	    NewVal
-    end.
-
-
-%%============================================================================ 
-%% encode Universal string 
-%%============================================================================ 
-
-encode_universal_string(C, {Name, Universal}, TagIn) when is_atom(Name) -> 
-    encode_universal_string(C, Universal, TagIn);
-encode_universal_string(_C, Universal, TagIn) -> 
-    OctetList = mk_uni_list(Universal), 
-    encode_tags(TagIn, OctetList, length(OctetList)). 
- 
-mk_uni_list(In) ->  
-    mk_uni_list(In,[]). 
- 
-mk_uni_list([],List) ->  
-    lists:reverse(List); 
-mk_uni_list([{A,B,C,D}|T],List) ->  
-    mk_uni_list(T,[D,C,B,A|List]); 
-mk_uni_list([H|T],List) ->  
-    mk_uni_list(T,[H,0,0,0|List]). 
- 
-%%=========================================================================== 
-%% decode Universal strings  
-%%    (Buffer, Range, StringType, HasTag, LenIn) -> 
-%%                           {String, Remain, RemovedBytes}  
-%%=========================================================================== 
-
-decode_universal_string(Buffer, Range, Tags) ->
-    decode_restricted_string(Buffer, Range, ?N_UniversalString, 
-			     Tags, [], old).
-  
- 
-mk_universal_string(In) -> 
-    mk_universal_string(In,[]). 
- 
-mk_universal_string([],Acc) -> 
-    lists:reverse(Acc); 
-mk_universal_string([0,0,0,D|T],Acc) -> 
-    mk_universal_string(T,[D|Acc]); 
-mk_universal_string([A,B,C,D|T],Acc) -> 
-    mk_universal_string(T,[{A,B,C,D}|Acc]). 
- 
-
-%%============================================================================
-%% encode UTF8 string 
-%%============================================================================
-
-encode_UTF8_string(_C,UTF8String,TagIn) when is_binary(UTF8String) ->
-    encode_tags(TagIn, UTF8String, size(UTF8String));
-encode_UTF8_string(_C,UTF8String,TagIn) ->
-    encode_tags(TagIn, UTF8String, length(UTF8String)).
-
-
-%%============================================================================
-%% decode UTF8 string 
-%%============================================================================
-
-decode_UTF8_string(Tlv,TagsIn) ->
-    Val = match_tags(Tlv, TagsIn),
-    case Val of
-	PartList = [_H|_T] -> % constructed val
-	    collect_parts(PartList);
-	Bin ->
-	    Bin
-    end.
-	    
- 
-%%============================================================================
-%% encode BMP string 
-%%============================================================================ 
-
-encode_BMP_string(C, {Name,BMPString}, TagIn) when is_atom(Name)-> 
-    encode_BMP_string(C, BMPString, TagIn);
-encode_BMP_string(_C, BMPString, TagIn) -> 
-    OctetList = mk_BMP_list(BMPString), 
-    encode_tags(TagIn, OctetList, length(OctetList)). 
- 
-mk_BMP_list(In) ->  
-    mk_BMP_list(In,[]). 
- 
-mk_BMP_list([],List) ->  
-    lists:reverse(List); 
-mk_BMP_list([{0,0,C,D}|T],List) ->  
-    mk_BMP_list(T,[D,C|List]); 
-mk_BMP_list([H|T],List) ->  
-    mk_BMP_list(T,[H,0|List]). 
- 
-%%============================================================================ 
-%% decode (OctetList, Range(ignored), tag|notag) -> {ValList, RestList} 
-%%    (Buffer, Range, StringType, HasTag, TotalLen) -> 
-%%                               {String, Remain, RemovedBytes}  
-%%============================================================================ 
-decode_BMP_string(Buffer, Range, Tags) -> 
-    decode_restricted_string(Buffer, Range, ?N_BMPString, 
-			     Tags, [], old). 
- 
-mk_BMP_string(In) -> 
-    mk_BMP_string(In,[]). 
- 
-mk_BMP_string([],US) -> 
-    lists:reverse(US); 
-mk_BMP_string([0,B|T],US) -> 
-    mk_BMP_string(T,[B|US]); 
-mk_BMP_string([C,D|T],US) -> 
-    mk_BMP_string(T,[{0,0,C,D}|US]). 
- 
- 
-%%============================================================================ 
-%% Generalized time, ITU_T X.680 Chapter 39 
-%%
-%% encode Generalized time 
-%%============================================================================ 
-
-encode_generalized_time(C, {Name,OctetList}, TagIn) when is_atom(Name) -> 
-    encode_generalized_time(C, OctetList, TagIn);
-encode_generalized_time(_C, OctetList, TagIn) -> 
-    encode_tags(TagIn, OctetList, length(OctetList)). 
- 
-%%============================================================================ 
-%% decode Generalized time  
-%%    (Buffer, Range, HasTag, TotalLen) -> {String, Remain, RemovedBytes}  
-%%============================================================================ 
-
-decode_generalized_time(Tlv, _Range, Tags) -> 
-    Val = match_tags(Tlv, Tags),
-    NewVal = case Val of
-		 PartList = [_H|_T] -> % constructed
-		     collect_parts(PartList);
-		 Bin ->
-		     Bin
-	     end,
-    binary_to_list(NewVal).
-
-%%============================================================================ 
-%% Universal time, ITU_T X.680 Chapter 40 
-%%
-%% encode UTC time 
-%%============================================================================ 
-
-encode_utc_time(C, {Name,OctetList}, TagIn) when is_atom(Name) -> 
-    encode_utc_time(C, OctetList, TagIn);
-encode_utc_time(_C, OctetList, TagIn) -> 
-    encode_tags(TagIn, OctetList, length(OctetList)).
- 
-%%============================================================================ 
-%% decode UTC time 
-%%    (Buffer, Range, HasTag, TotalLen) -> {String, Remain, RemovedBytes}  
-%%============================================================================ 
-
-decode_utc_time(Tlv, _Range, Tags) -> 
-    Val = match_tags(Tlv, Tags),
-    NewVal = case Val of
-		 PartList = [_H|_T] -> % constructed
-		     collect_parts(PartList);
-		 Bin ->
-		     Bin
-	     end,
-    binary_to_list(NewVal).
-
- 
-%%============================================================================ 
-%% Length handling  
-%%
-%% Encode length 
-%% 
-%% encode_length(Int | indefinite) -> 
-%%          [<127]| [128 + Int (<127),OctetList] | [16#80] 
-%%============================================================================ 
- 
-encode_length(indefinite) -> 
-    {[16#80],1}; % 128 
-encode_length(L) when L =< 16#7F -> 
-    {[L],1}; 
-encode_length(L) -> 
-    Oct = minimum_octets(L), 
-    Len = length(Oct), 
-    if 
-	Len =< 126 -> 
-	    {[ (16#80+Len) | Oct ],Len+1}; 
-	true -> 
-	    exit({error,{asn1, to_long_length_oct, Len}}) 
-    end. 
- 
-
-%% Val must be >= 0
-minimum_octets(Val) -> 
-    minimum_octets(Val,[]). 
- 
-minimum_octets(0,Acc) ->
-    Acc;
-minimum_octets(Val, Acc) ->
-    minimum_octets((Val bsr 8),[Val band 16#FF | Acc]).
-
- 
-%%=========================================================================== 
-%% Decode length 
-%% 
-%% decode_length(OctetList) -> {{indefinite, RestOctetsL}, NoRemovedBytes} |  
-%%                             {{Length, RestOctetsL}, NoRemovedBytes} 
-%%=========================================================================== 
-
-decode_length(<<1:1,0:7,T/binary>>) ->     
-    {indefinite, T};
-decode_length(<<0:1,Length:7,T/binary>>) ->
-    {Length,T};
-decode_length(<<1:1,LL:7,T/binary>>) ->
-    <<Length:LL/unit:8,Rest/binary>> = T,
-    {Length,Rest}.
- 
-
-
-%%-------------------------------------------------------------------------
-%% INTERNAL HELPER FUNCTIONS (not exported)
-%%-------------------------------------------------------------------------
-
- 
-%% decoding postitive integer values. 
-decode_integer2(Len,Bin = <<0:1,_:7,_Bs/binary>>) ->
-    <<Int:Len/unit:8>> = Bin,
-    Int;
-%% decoding negative integer values.
-decode_integer2(Len,<<1:1,B2:7,Bs/binary>>)  ->
-    <<N:Len/unit:8>> = <<B2,Bs/binary>>,
-    Int = N - (1 bsl (8 * Len - 1)),
-    Int.
-
-get_constraint(C,Key) ->
-    case lists:keysearch(Key,1,C) of
-	false ->
-	     no;
-	{value,{_,V}} -> 
-	    V
-    end.
- 
-collect_parts(TlvList) ->
-    collect_parts(TlvList,[]).
-
-collect_parts([{_,L}|Rest],Acc) when is_list(L) ->
-    collect_parts(Rest,[collect_parts(L)|Acc]);
-collect_parts([{?N_BIT_STRING,<<Unused,Bits/binary>>}|Rest],_Acc) ->
-    collect_parts_bit(Rest,[Bits],Unused);
-collect_parts([{_T,V}|Rest],Acc) ->
-    collect_parts(Rest,[V|Acc]);
-collect_parts([],Acc) ->
-    list_to_binary(lists:reverse(Acc)).
-
-collect_parts_bit([{?N_BIT_STRING,<<Unused,Bits/binary>>}|Rest],Acc,Uacc) ->    
-    collect_parts_bit(Rest,[Bits|Acc],Unused+Uacc);
-collect_parts_bit([],Acc,Uacc) ->
-    list_to_binary([Uacc|lists:reverse(Acc)]).
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
diff --git a/lib/asn1/src/asn1rt_check.erl b/lib/asn1/src/asn1rt_check.erl
deleted file mode 100644
index 35b993fc71..0000000000
--- a/lib/asn1/src/asn1rt_check.erl
+++ /dev/null
@@ -1,360 +0,0 @@
-%%
-%% %CopyrightBegin%
-%% 
-%% Copyright Ericsson AB 2001-2011. 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(asn1rt_check).
-
--export([check_bool/2,
-	 check_int/3,
-	 check_bitstring/3,
-	 check_octetstring/2,
-	 check_null/2,
-	 check_objectidentifier/2,
-	 check_objectdescriptor/2,
-	 check_real/2,
-	 check_enum/3,
-	 check_restrictedstring/2]).
-
--export([transform_to_EXTERNAL1990/1,
-	 transform_to_EXTERNAL1994/1]).
-
--export([dynamicsort_SET_components/1,
-	 dynamicsort_SETOF/1]).
-
-check_bool(_Bool,asn1_DEFAULT) ->
-    true;
-check_bool(Bool,Bool) when Bool == true; Bool == false ->
-    true;
-check_bool(_Bool1,Bool2) ->
-    throw({error,Bool2}).
-
-check_int(_,asn1_DEFAULT,_) ->
-    true;
-check_int(Value,Value,_) when is_integer(Value) ->
-    true;
-check_int(DefValue,Value,NNL) when is_atom(Value) ->
-    case lists:keysearch(Value,1,NNL) of
-	{value,{_,DefValue}} ->
-	    true;
-	_ ->
-	    throw({error,DefValue})
-    end;
-check_int(DefaultValue,_Value,_) ->
-    throw({error,DefaultValue}).
-
-% check_bitstring([H|T],[H|T],_) when is_integer(H) ->
-%     true;
-% check_bitstring(V,V,_) when is_integer(V) ->
-%     true;
-%% Two equal lists or integers
-check_bitstring(_,asn1_DEFAULT,_) ->
-    true;
-check_bitstring(V,V,_) ->
-    true;
-%% Default value as a list of 1 and 0 and user value as an integer
-check_bitstring(L=[H|T],Int,_) when is_integer(Int),is_integer(H) ->
-    case bit_list_to_int(L,length(T)) of
-	Int -> true;
-	_ -> throw({error,L,Int})
-    end;
-%% Default value as an integer, val as list
-check_bitstring(Int,Val,NBL) when is_integer(Int),is_list(Val) ->
-    BL = int_to_bit_list(Int,[],length(Val)),
-    check_bitstring(BL,Val,NBL);
-%% Default value and user value as lists of ones and zeros
-check_bitstring(L1=[H1|_T1],L2=[H2|_T2],NBL=[_H|_T]) when is_integer(H1),is_integer(H2) ->
-    L2new = remove_trailing_zeros(L2),
-    check_bitstring(L1,L2new,NBL);
-%% Default value as a list of 1 and 0 and user value as a list of atoms
-check_bitstring(L1=[H1|_T1],L2=[H2|_T2],NBL) when is_integer(H1),is_atom(H2) ->
-    L3 = bit_list_to_nbl(L1,NBL,0,[]),
-    check_bitstring(L3,L2,NBL);
-%% Both default value and user value as a list of atoms
-check_bitstring(L1=[H1|T1],L2=[H2|_T2],_) 
-  when is_atom(H1),is_atom(H2),length(L1) == length(L2) ->
-    case lists:member(H1,L2) of
-	true ->
-	    check_bitstring1(T1,L2);
-	false -> throw({error,L2})
-    end;
-%% Default value as a list of atoms and user value as a list of 1 and 0
-check_bitstring(L1=[H1|_T1],L2=[H2|_T2],NBL) when is_atom(H1),is_integer(H2) ->
-    L3 = bit_list_to_nbl(L2,NBL,0,[]),
-    check_bitstring(L1,L3,NBL);
-%% User value in compact format
-check_bitstring(DefVal,CBS={_,_},NBL) ->
-    NewVal = cbs_to_bit_list(CBS),
-    check_bitstring(DefVal,NewVal,NBL);
-check_bitstring(DV,V,_) ->
-    throw({error,DV,V}).
-
-    
-bit_list_to_int([0|Bs],ShL)->
-    bit_list_to_int(Bs,ShL-1) + 0;
-bit_list_to_int([1|Bs],ShL) ->
-    bit_list_to_int(Bs,ShL-1) + (1 bsl ShL);
-bit_list_to_int([],_) ->
-    0.
-
-int_to_bit_list(0,Acc,0) ->
-    Acc;
-int_to_bit_list(Int,Acc,Len) ->
-    int_to_bit_list(Int bsr 1,[Int band 1|Acc],Len - 1).
-    
-bit_list_to_nbl([0|T],NBL,Pos,Acc) ->
-    bit_list_to_nbl(T,NBL,Pos+1,Acc);
-bit_list_to_nbl([1|T],NBL,Pos,Acc) ->
-    case lists:keysearch(Pos,2,NBL) of
-	{value,{N,_}} ->
-	    bit_list_to_nbl(T,NBL,Pos+1,[N|Acc]);
-	_ ->
-	    throw({error,{no,named,element,at,pos,Pos}})
-    end;
-bit_list_to_nbl([],_,_,Acc) ->
-    Acc.
-    
-remove_trailing_zeros(L2) ->
-    remove_trailing_zeros1(lists:reverse(L2)).
-remove_trailing_zeros1(L) ->
-    lists:reverse(lists:dropwhile(fun(0)->true;
-				     (_) ->false 
-				  end,
-				  L)).
-
-check_bitstring1([H|T],NBL) ->
-    case lists:member(H,NBL) of
-	true ->
-	    check_bitstring1(T,NBL);
-	V -> throw({error,V})
-    end;
-check_bitstring1([],_) ->
-    true.
-
-cbs_to_bit_list({Unused,<<B7:1,B6:1,B5:1,B4:1,B3:1,B2:1,B1:1,B0:1,Rest/binary>>}) when size(Rest) >= 1 ->
-    [B7,B6,B5,B4,B3,B2,B1,B0|cbs_to_bit_list({Unused,Rest})];
-cbs_to_bit_list({0,<<B7:1,B6:1,B5:1,B4:1,B3:1,B2:1,B1:1,B0:1>>}) ->
-    [B7,B6,B5,B4,B3,B2,B1,B0];
-cbs_to_bit_list({Unused,Bin}) when size(Bin) == 1 ->
-    Used = 8-Unused,
-    <<Int:Used,_:Unused>> = Bin,
-    int_to_bit_list(Int,[],Used).
-
-
-check_octetstring(_,asn1_DEFAULT) ->
-    true;
-check_octetstring(L,L) ->
-    true;
-check_octetstring(L,Int) when is_list(L),is_integer(Int) ->
-    case integer_to_octetlist(Int) of
-	L -> true;
-	V -> throw({error,V})
-    end;
-check_octetstring(_,V) ->
-    throw({error,V}).
-
-integer_to_octetlist(Int) ->
-    integer_to_octetlist(Int,[]).
-integer_to_octetlist(0,Acc) ->
-    Acc;
-integer_to_octetlist(Int,Acc) ->
-    integer_to_octetlist(Int bsr 8,[(Int band 255)|Acc]).
-
-check_null(_,asn1_DEFAULT) ->
-    true;
-check_null('NULL','NULL') ->
-    true;
-check_null(_,V) ->
-    throw({error,V}).
-
-check_objectidentifier(_,asn1_DEFAULT) ->
-    true;
-check_objectidentifier(OI,OI) ->
-    true;
-check_objectidentifier(DOI,OI) when is_tuple(DOI),is_tuple(OI) ->
-    check_objectidentifier1(tuple_to_list(DOI),tuple_to_list(OI));
-check_objectidentifier(_,OI) ->
-    throw({error,OI}).
-
-check_objectidentifier1([V|Rest1],[V|Rest2]) ->
-    check_objectidentifier1(Rest1,Rest2,V);
-check_objectidentifier1([V1|Rest1],[V2|Rest2]) ->
-    case reserved_objectid(V2,[]) of
-	V1 ->
-	    check_objectidentifier1(Rest1,Rest2,[V1]);
-	V ->
-	    throw({error,V})
-    end.
-check_objectidentifier1([V|Rest1],[V|Rest2],Above) ->
-    check_objectidentifier1(Rest1,Rest2,[V|Above]);
-check_objectidentifier1([V1|Rest1],[V2|Rest2],Above) ->
-    case reserved_objectid(V2,Above) of
-	V1 ->
-	    check_objectidentifier1(Rest1,Rest2,[V1|Above]);
-	V ->
-	    throw({error,V})
-    end;
-check_objectidentifier1([],[],_) ->
-    true;
-check_objectidentifier1(_,V,_) ->
-    throw({error,object,identifier,V}).
-
-%% ITU-T Rec. X.680 Annex B - D
-reserved_objectid('itu-t',[]) -> 0;
-reserved_objectid('ccitt',[]) -> 0;
-%% arcs below "itu-t" 
-reserved_objectid('recommendation',[0]) -> 0;
-reserved_objectid('question',[0]) -> 1;
-reserved_objectid('administration',[0]) -> 2;
-reserved_objectid('network-operator',[0]) -> 3;
-reserved_objectid('identified-organization',[0]) -> 4;
-
-reserved_objectid(iso,[]) -> 1;
-%% arcs below "iso", note that number 1 is not used
-reserved_objectid('standard',[1]) -> 0;
-reserved_objectid('member-body',[1]) -> 2;
-reserved_objectid('identified-organization',[1]) -> 3;
-
-reserved_objectid('joint-iso-itu-t',[]) -> 2;
-reserved_objectid('joint-iso-ccitt',[]) -> 2;
-
-reserved_objectid(_,_) -> false.
-
-
-check_objectdescriptor(_,asn1_DEFAULT) ->
-    true;
-check_objectdescriptor(OD,OD) ->
-    true;
-check_objectdescriptor(OD,OD) ->
-    throw({error,{not_implemented_yet,check_objectdescriptor}}).
-
-check_real(_,asn1_DEFAULT) ->
-    true;
-check_real(R,R) ->
-    true;
-check_real(_,_) ->
-    throw({error,{not_implemented_yet,check_real}}).
-
-check_enum(_,asn1_DEFAULT,_) ->
-    true;
-check_enum(Val,Val,_) ->
-    true;
-check_enum(Int,Atom,Enumerations) when is_integer(Int),is_atom(Atom) ->
-    case lists:keysearch(Atom,1,Enumerations) of
-	{value,{_,Int}} -> true;
-	_ -> throw({error,{enumerated,Int,Atom}})
-    end;
-check_enum(DefVal,Val,_) ->
-    throw({error,{enumerated,DefVal,Val}}).
-
-
-check_restrictedstring(_,asn1_DEFAULT) ->
-    true;
-check_restrictedstring(Val,Val) ->
-    true;
-check_restrictedstring([V|Rest1],[V|Rest2]) ->
-    check_restrictedstring(Rest1,Rest2);
-check_restrictedstring([V1|Rest1],[V2|Rest2]) ->
-    check_restrictedstring(V1,V2),
-    check_restrictedstring(Rest1,Rest2);
-%% tuple format of value
-check_restrictedstring({V1,V2},[V1,V2]) ->
-    true;
-check_restrictedstring([V1,V2],{V1,V2}) ->
-    true;
-%% quadruple format of value
-check_restrictedstring({V1,V2,V3,V4},[V1,V2,V3,V4]) ->
-    true;
-check_restrictedstring([V1,V2,V3,V4],{V1,V2,V3,V4}) ->
-    true;
-%% character string list
-check_restrictedstring(V1,V2) when is_list(V1),is_tuple(V2) ->
-    check_restrictedstring(V1,tuple_to_list(V2));
-check_restrictedstring(V1,V2) ->
-    throw({error,{restricted,string,V1,V2}}).
-
-transform_to_EXTERNAL1990(Val) when is_tuple(Val),size(Val) == 4 ->
-    transform_to_EXTERNAL1990(tuple_to_list(Val),[]);
-transform_to_EXTERNAL1990(Val) when is_tuple(Val) ->
-    %% Data already in ASN1 1990 format
-    Val.
-
-transform_to_EXTERNAL1990(['EXTERNAL'|Rest],Acc) ->
-    transform_to_EXTERNAL1990(Rest,['EXTERNAL'|Acc]);
-transform_to_EXTERNAL1990([{syntax,Syntax}|Rest],Acc) ->
-    transform_to_EXTERNAL1990(Rest,[asn1_NOVALUE,Syntax|Acc]);
-transform_to_EXTERNAL1990([{'presentation-context-id',PCid}|Rest],Acc) ->
-    transform_to_EXTERNAL1990(Rest,[PCid,asn1_NOVALUE|Acc]);
-transform_to_EXTERNAL1990([{'context-negotiation',Context_negot}|Rest],Acc) ->
-    {_,Presentation_Cid,Transfer_syntax} = Context_negot,
-    transform_to_EXTERNAL1990(Rest,[Presentation_Cid,Transfer_syntax|Acc]);
-transform_to_EXTERNAL1990([asn1_NOVALUE|Rest],Acc) ->
-    transform_to_EXTERNAL1990(Rest,[asn1_NOVALUE|Acc]);
-transform_to_EXTERNAL1990([Data_val_desc,Data_value],Acc) when is_list(Data_value)->
-    list_to_tuple(lists:reverse([{'octet-aligned',Data_value},
-				 Data_val_desc|Acc]));
-transform_to_EXTERNAL1990([Data_val_desc,Data_value],Acc)
-  when is_binary(Data_value)->
-    list_to_tuple(lists:reverse([{'single-ASN1-type',Data_value},
-				 Data_val_desc|Acc]));
-transform_to_EXTERNAL1990([Data_value],Acc)
-  when is_list(Data_value); is_binary(Data_value) ->
-    list_to_tuple(lists:reverse([{'octet-aligned',Data_value}|Acc])).
-
-
-transform_to_EXTERNAL1994(V={'EXTERNAL',DRef,IndRef,Data_v_desc,Encoding}) ->
-    Identification =
-	case {DRef,IndRef} of
-	    {DRef,asn1_NOVALUE} ->
-		{syntax,DRef};
-	    {asn1_NOVALUE,IndRef} ->
-		{'presentation-context-id',IndRef};
-	     _ ->
-		{'context-negotiation',
-		 {'EXTERNAL_identification_context-negotiation',IndRef,DRef}}
-	end,
-    case Encoding of
-	{_,Val} when is_list(Val);is_binary(Val) ->
-	    {'EXTERNAL',Identification,Data_v_desc,Val};
-	
-	_  ->
-	    V
-    end.
-
-
-%% dynamicsort_SET_components(Arg) -> 
-%% Res Arg -> list() 
-%% Res -> list()
-%% Sorts the elements in Arg according to the encoded tag in
-%% increasing order.
-dynamicsort_SET_components(ListOfEncCs) ->
-    BinL = lists:map(fun(X) -> list_to_binary(X) end,ListOfEncCs),
-    TagBinL = lists:map(fun(X) ->
-				{{T,_,TN},_,_} = asn1rt_ber_bin:decode_tag(X),
-				{{T,TN},X}
-			end,BinL),
-    ClassTagNoSorted = lists:keysort(1,TagBinL),
-    lists:map(fun({_,El}) -> El end,ClassTagNoSorted).
-
-%% dynamicsort_SETOF(Arg) -> Res
-%% Arg -> list()
-%% Res -> list()
-%% Sorts the elements in Arg in increasing size
-dynamicsort_SETOF(ListOfEncVal) ->
-    BinL = lists:map(fun(L) when is_list(L) -> list_to_binary(L);
-			(B) -> B end,ListOfEncVal),
-    lists:sort(BinL).
diff --git a/lib/asn1/src/asn1rt_per_bin_rt2ct.erl b/lib/asn1/src/asn1rt_per_bin_rt2ct.erl
deleted file mode 100644
index 5997232f13..0000000000
--- a/lib/asn1/src/asn1rt_per_bin_rt2ct.erl
+++ /dev/null
@@ -1,1587 +0,0 @@
-%%
-%% %CopyrightBegin%
-%% 
-%% Copyright Ericsson AB 2002-2012. 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(asn1rt_per_bin_rt2ct).
-%% encoding / decoding of PER aligned
-
--include("asn1_records.hrl").
-
--export([decode_fragmented/3]).
--export([setchoiceext/1, setext/1, fixoptionals/3, fixextensions/2, 
-	 skipextensions/3, getbit/1, getchoice/3 ]).
--export([set_choice/3, encode_integer/2, encode_integer/3  ]).
--export([encode_small_number/1,
-	 encode_length/2,
-	 encode_small_length/1,
-	 decode_compact_bit_string/3]).
--export([encode_bit_string/3, decode_bit_string/3  ]).
--export([encode_octet_string/2,
-	 encode_object_identifier/1, decode_object_identifier/1,
-	 encode_real/1, decode_real/1,
-	 encode_relative_oid/1, decode_relative_oid/1,
-	 complete/1]).
-
--export([encode_open_type/2, decode_open_type/2]).
-
--export([encode_GeneralString/2, decode_GeneralString/2,
-	 encode_GraphicString/2, decode_GraphicString/2,
-	 encode_TeletexString/2, decode_TeletexString/2,
-	 encode_VideotexString/2, decode_VideotexString/2,
-	 encode_ObjectDescriptor/2, decode_ObjectDescriptor/1,
-	 encode_UTF8String/1,decode_UTF8String/1
-	]).
-
--export([encode_unconstrained_number/1,
-	 encode_octet_string/3,
-	 encode_known_multiplier_string/5,
-	 decode_known_multiplier_string/5]).
-
-
--export([eint_positive/1]).
--export([pre_complete_bits/2]).
-
--define('16K',16384).
--define('32K',32768).
--define('64K',65536).
-
-%%--------------------------------------------------------
-%% setchoiceext(InRootSet) -> [{bit,X}]
-%% X  is set to  1 when InRootSet==false
-%% X  is set to  0 when InRootSet==true
-%%
-setchoiceext(true) ->
-    [0];
-setchoiceext(false) ->
-    [1].
-
-%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
-%% setext(true|false) ->  CompleteList
-%%
-
-setext(false) ->
-%    [{debug,ext},{bits,1,0}];
-    [0];
-setext(true) ->
-%    [{debug,ext},{bits,1,1}];
-    [1].
-
-fixoptionals(OptList,_OptLength,Val) when is_tuple(Val) ->
-%    Bits = fixoptionals(OptList,Val,0),
-%    {Val,{bits,OptLength,Bits}};
-%    {Val,[10,OptLength,Bits]};
-    {Val,fixoptionals(OptList,Val,[])};
-
-fixoptionals([],_,Acc) ->
-    %% Optbits
-    lists:reverse(Acc);
-fixoptionals([{Pos,DefVal}|Ot],Val,Acc) ->
-    case element(Pos,Val) of
-	asn1_DEFAULT -> fixoptionals(Ot,Val,[0|Acc]);
-	DefVal -> fixoptionals(Ot,Val,[0|Acc]);
-	_ -> fixoptionals(Ot,Val,[1|Acc])
-    end;
-fixoptionals([Pos|Ot],Val,Acc) ->
-    case element(Pos,Val) of
-	asn1_NOVALUE -> fixoptionals(Ot,Val,[0|Acc]);
-	asn1_DEFAULT -> fixoptionals(Ot,Val,[0|Acc]);
-	_ -> fixoptionals(Ot,Val,[1|Acc])
-    end.
-
-
-fixextensions({ext,ExtPos,ExtNum},Val) ->
-    case fixextensions(ExtPos,ExtNum+ExtPos,Val,0) of
-	0 -> [];
-	ExtBits ->
-	    [encode_small_length(ExtNum),pre_complete_bits(ExtNum,ExtBits)]
-    end.
-
-fixextensions(Pos,MaxPos,_,Acc) when Pos >= MaxPos ->
-    Acc;
-fixextensions(Pos,ExtPos,Val,Acc) ->
-    Bit = case catch(element(Pos+1,Val)) of
-	      asn1_NOVALUE ->
-		  0;
-	      asn1_NOEXTVALUE ->
-		  0;
-	      {'EXIT',_} ->
-		  0;
-	      _ ->
-		  1
-	  end,
-    fixextensions(Pos+1,ExtPos,Val,(Acc bsl 1)+Bit).
-
-skipextensions(Bytes,Nr,ExtensionBitstr) when is_bitstring(ExtensionBitstr) -> 
-    Prev = Nr - 1,
-    case ExtensionBitstr of
-	<<_:Prev,1:1,_/bitstring>> ->
-	    {_,Bytes2} = decode_open_type(Bytes,[]),
- 	    skipextensions(Bytes2, Nr+1, ExtensionBitstr);
-	<<_:Prev,0:1,_/bitstring>> ->
-	    skipextensions(Bytes, Nr+1, ExtensionBitstr);
-	_ ->
-	    Bytes
-    end.
-	
-
-getchoice(Bytes,1,0) -> % only 1 alternative is not encoded
-    {0,Bytes};
-getchoice(Bytes,_,1) ->
-    decode_small_number(Bytes);
-getchoice(Bytes,NumChoices,0) ->
-    decode_constrained_number(Bytes,{0,NumChoices-1}).
-
-
-%% getbits_as_binary(Num,Bytes) -> {Bin,Rest}
-%% Num = integer(),
-%% Bytes = bitstring(),
-%% Bin = bitstring(),
-%% Rest = bitstring()
-getbits_as_binary(Num,Bytes) when is_bitstring(Bytes) ->
-    <<BS:Num/bitstring,Rest/bitstring>> = Bytes,
-    {BS,Rest}.
-    
-getbits_as_list(Num,Bytes) when is_bitstring(Bytes) ->
-    <<BitStr:Num/bitstring,Rest/bitstring>> = Bytes,
-    {[ B || <<B:1>> <= BitStr],Rest}.
-
-
-getbit(Buffer) ->
-    <<B:1,Rest/bitstring>> = Buffer,
-    {B,Rest}.
-
-
-getbits(Buffer,Num) when is_bitstring(Buffer) ->
-    <<Bs:Num,Rest/bitstring>> = Buffer,
-    {Bs,Rest}.
-
-align(Bin) when is_binary(Bin) ->
-    Bin;
-align(BitStr) when is_bitstring(BitStr) ->
-    AlignBits = bit_size(BitStr) rem 8,
-    <<_:AlignBits,Rest/binary>> = BitStr,
-    Rest.
-
-
-%% First align buffer, then pick the first Num octets.
-%% Returns octets as an integer with bit significance as in buffer.
-getoctets(Buffer,Num) when is_binary(Buffer) ->
-    <<Val:Num/integer-unit:8,RestBin/binary>> = Buffer,
-    {Val,RestBin};
-getoctets(Buffer,Num) when is_bitstring(Buffer) ->
-    AlignBits = bit_size(Buffer) rem 8,
-    <<_:AlignBits,Val:Num/integer-unit:8,RestBin/binary>> = Buffer,
-    {Val,RestBin}.
-
-
-%% First align buffer, then pick the first Num octets.
-%% Returns octets as a binary
-getoctets_as_bin(Bin,Num) when is_binary(Bin) ->
-    <<Octets:Num/binary,RestBin/binary>> = Bin,
-    {Octets,RestBin};
-getoctets_as_bin(Bin,Num) when is_bitstring(Bin) ->
-    AlignBits = bit_size(Bin) rem 8,
-    <<_:AlignBits,Val:Num/binary,RestBin/binary>> = Bin,
-    {Val,RestBin}.
-    
-
-%% same as above but returns octets as a List
-getoctets_as_list(Buffer,Num) ->
-    {Bin,Buffer2} = getoctets_as_bin(Buffer,Num),
-    {binary_to_list(Bin),Buffer2}.
-%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
-%% set_choice(Alt,Choices,Altnum) -> ListofBitSettings
-%% Alt = atom()
-%% Altnum = integer() | {integer(),integer()}% number of alternatives
-%% Choices = [atom()] | {[atom()],[atom()]}
-%% When Choices is a tuple the first list is the Rootset and the
-%% second is the Extensions and then Altnum must also be a tuple with the
-%% lengths of the 2 lists 
-%%
-set_choice(Alt,{L1,L2},{Len1,_Len2}) ->
-    case set_choice_tag(Alt,L1) of
-	N when is_integer(N), Len1 > 1 ->
-%	    [{bits,1,0}, % the value is in the root set
-%	     encode_constrained_number({0,Len1-1},N)];
-	    [0, % the value is in the root set
-	     encode_constrained_number({0,Len1-1},N)];
-	N when is_integer(N) ->
-%	    [{bits,1,0}]; % no encoding if only 0 or 1 alternative
-	    [0]; % no encoding if only 0 or 1 alternative
-	false ->
-%	    [{bits,1,1}, % extension value
-	    [1, % extension value
-	     case set_choice_tag(Alt,L2) of
-		 N2 when is_integer(N2) ->
-		     encode_small_number(N2);
-		 false ->
-		     unknown_choice_alt
-	     end]
-    end;
-set_choice(Alt,L,Len) ->
-    case set_choice_tag(Alt,L) of
-	N when is_integer(N), Len > 1 ->
-	    encode_constrained_number({0,Len-1},N);
-	N when is_integer(N) ->
-	    []; % no encoding if only 0 or 1 alternative
-	false ->
-	    [unknown_choice_alt]
-    end.
-
-set_choice_tag(Alt,Choices) ->
-    set_choice_tag(Alt,Choices,0).
-
-set_choice_tag(Alt,[Alt|_Rest],Tag) ->
-    Tag;
-set_choice_tag(Alt,[_H|Rest],Tag) ->
-    set_choice_tag(Alt,Rest,Tag+1);
-set_choice_tag(_Alt,[],_Tag) ->
-    false.
-
-%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
-%% decode_fragmented_XXX; decode of values encoded fragmented according
-%% to ITU-T X.691 clause 10.9.3.8. The unit (XXX) is either bits, octets,
-%% characters or number of components (in a choice,sequence or similar).
-%% Buffer is a buffer binary().
-%% C is the constrained length.
-%% If the buffer is not aligned, this function does that.
-decode_fragmented_bits(Buffer,C) when is_binary(Buffer) ->
-    decode_fragmented_bits(Buffer,C,[]);
-decode_fragmented_bits(Buffer,C) when is_bitstring(Buffer) ->
-    AlignBits = bit_size(Buffer) rem 8,
-    <<_:AlignBits,Rest/binary>> = Buffer,
-    decode_fragmented_bits(Rest,C,[]).
-
-decode_fragmented_bits(<<3:2,Len:6,Bin/binary>>,C,Acc) ->
-    {Value,Bin2} = split_binary(Bin, Len * ?'16K'), % Len = 1 | 2 | 3 | 4
-    decode_fragmented_bits(Bin2,C,[Value|Acc]);
-decode_fragmented_bits(<<0:1,0:7,Bin/binary>>,C,Acc) ->
-    BinBits = erlang:list_to_bitstring(lists:reverse(Acc)),
-    case C of
-	Int when is_integer(Int),C == bit_size(BinBits) ->
-	    {BinBits,Bin};
-	Int when is_integer(Int) ->
-	    exit({error,{asn1,{illegal_value,C,BinBits}}})
-    end;
-decode_fragmented_bits(<<0:1,Len:7,Bin/binary>>,C,Acc) ->
-    <<Value:Len/bitstring,Rest/bitstring>> = Bin,
-    BinBits = erlang:list_to_bitstring([Value|Acc]),
-    case C of
-	Int when is_integer(Int),C == bit_size(BinBits) ->
-	    {BinBits,Rest};
-	Int when is_integer(Int) ->
-	    exit({error,{asn1,{illegal_value,C,BinBits}}})
-    end.
-
-    
-%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
-%% encode_open_type(Constraint, Value) -> CompleteList
-%% Value = list of bytes of an already encoded value (the list must be flat)
-%%         | binary
-%% Contraint = not used in this version
-%%
-encode_open_type(_Constraint, Val) when is_list(Val) ->
-    Bin = list_to_binary(Val),
-    case size(Bin) of 
-	Size when Size>255 ->
-	    [encode_length(undefined,Size),[21,<<Size:16>>,Bin]];
-	Size ->
-	    [encode_length(undefined,Size),[20,Size,Bin]]
-    end;
-encode_open_type(_Constraint, Val) when is_binary(Val) ->
-    case size(Val) of
-	Size when Size>255 ->
-	    [encode_length(undefined,size(Val)),[21,<<Size:16>>,Val]]; % octets implies align
-	Size ->
-	    [encode_length(undefined,Size),[20,Size,Val]]
-    end.
-%% the binary_to_list is not optimal but compatible with the current solution
-
-%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
-%% decode_open_type(Buffer,Constraint) -> Value
-%% Constraint is not used in this version
-%% Buffer = [byte] with PER encoded data 
-%% Value = [byte] with decoded data (which must be decoded again as some type)
-%%
-decode_open_type(Bytes, _Constraint) ->
-    {Len,Bytes2} = decode_length(Bytes,undefined),
-    getoctets_as_bin(Bytes2,Len).
-
-%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
-%% encode_integer(Constraint,Value,NamedNumberList) -> CompleteList
-%% encode_integer(Constraint,Value) -> CompleteList
-%% encode_integer(Constraint,{Name,Value}) -> CompleteList
-%% 
-%%
-encode_integer(C,V,NamedNumberList) when is_atom(V) ->
-    case lists:keysearch(V,1,NamedNumberList) of
-	{value,{_,NewV}} -> 
-	    encode_integer(C,NewV);
-	_ -> 
-	    exit({error,{asn1,{namednumber,V}}})
-    end;
-encode_integer(C,V,_NamedNumberList) when is_integer(V) ->
-    encode_integer(C,V);
-encode_integer(C,{Name,V},NamedNumberList) when is_atom(Name) ->
-    encode_integer(C,V,NamedNumberList).
-
-encode_integer(C,{Name,Val}) when is_atom(Name) ->
-    encode_integer(C,Val);
-
-encode_integer([{Rc,_Ec}],Val) when is_tuple(Rc) -> % XXX when is this invoked? First argument most often a list,...Ok this is the extension case...but it doesn't work.
-    case (catch encode_integer([Rc],Val)) of
-	{'EXIT',{error,{asn1,_}}} ->
-%	    [{bits,1,1},encode_unconstrained_number(Val)];
-	    [1,encode_unconstrained_number(Val)];
-	Encoded ->
-%	    [{bits,1,0},Encoded]
-	    [0,Encoded]
-    end;
-
-encode_integer([],Val) ->
-    encode_unconstrained_number(Val);
-%% The constraint is the effective constraint, and in this case is a number
-encode_integer([{'SingleValue',V}],V) ->
-    [];
-encode_integer([{'ValueRange',VR={Lb,Ub},Range,PreEnc}],Val) when Val >= Lb,
-						Ub >= Val ->
-    %% this case when NamedNumberList
-    encode_constrained_number(VR,Range,PreEnc,Val);
-encode_integer([{'ValueRange',{Lb,'MAX'}}],Val) ->
-    encode_semi_constrained_number(Lb,Val);
-encode_integer([{'ValueRange',{'MIN',_}}],Val) ->
-    encode_unconstrained_number(Val);
-encode_integer([{'ValueRange',VR={_Lb,_Ub}}],Val) ->
-    encode_constrained_number(VR,Val);
-encode_integer(_,Val) ->
-    exit({error,{asn1,{illegal_value,Val}}}).
-
-    
-%% X.691:10.6 Encoding of a normally small non-negative whole number
-%% Use this for encoding of CHOICE index if there is an extension marker in 
-%% the CHOICE
-encode_small_number({Name,Val}) when is_atom(Name) ->
-    encode_small_number(Val);
-encode_small_number(Val) when Val =< 63 ->
-%    [{bits,1,0},{bits,6,Val}];
-%    [{bits,7,Val}]; % same as above but more efficient
-    [10,7,Val]; % same as above but more efficient
-encode_small_number(Val) ->
-%    [{bits,1,1},encode_semi_constrained_number(0,Val)].
-    [1,encode_semi_constrained_number(0,Val)].
-
-decode_small_number(Bytes) ->
-    {Bit,Bytes2} = getbit(Bytes),
-    case Bit of
-	0 -> 
-	    getbits(Bytes2,6);
-	1 ->
-	    decode_semi_constrained_number(Bytes2)
-    end.
-
-%% X.691:10.7 Encoding of a semi-constrained whole number
-%% might be an optimization encode_semi_constrained_number(0,Val) ->
-encode_semi_constrained_number(C,{Name,Val}) when is_atom(Name) ->
-    encode_semi_constrained_number(C,Val);
-encode_semi_constrained_number({Lb,'MAX'},Val) ->
-    encode_semi_constrained_number(Lb,Val);
-encode_semi_constrained_number(Lb,Val) ->
-    Val2 = Val - Lb,
-    Oct = eint_positive(Val2),
-    Len = length(Oct),
-    if 
-	Len < 128 ->
-	    %{octets,[Len|Oct]}; % equiv with encode_length(undefined,Len) but faster
-	    [20,Len+1,[Len|Oct]];
-	Len < 256 ->
-	    [encode_length(undefined,Len),[20,Len,Oct]];
-	true ->
-	    [encode_length(undefined,Len),[21,<<Len:16>>,Oct]]
-    end.
-
-decode_semi_constrained_number(Bytes) ->
-    {Len,Bytes2} = decode_length(Bytes,undefined),
-    {V,Bytes3} = getoctets(Bytes2,Len),
-    {V,Bytes3}.
-
-encode_constrained_number({Lb,_Ub},_Range,{bits,N},Val) ->
-    Val2 = Val-Lb,
-%    {bits,N,Val2};
-    [10,N,Val2];
-encode_constrained_number({Lb,_Ub},_Range,{octets,N},Val) when N < 256->
-    %% N is 8 or 16 (1 or 2 octets)
-    Val2 = Val-Lb,
-%    {octets,<<Val2:N/unit:8>>};
-    [20,N,Val2];
-encode_constrained_number({Lb,_Ub},_Range,{octets,N},Val) -> % N>255
-    %% N is 8 or 16 (1 or 2 octets)
-    Val2 = Val-Lb,
-%    {octets,<<Val2:N/unit:8>>};
-    [21,<<N:16>>,Val2];
-encode_constrained_number({Lb,_Ub},Range,_,Val) ->
-    Val2 = Val-Lb,
-    if
-	Range =< 16#1000000  -> % max 3 octets
-	    Octs = eint_positive(Val2),
-%	    [encode_length({1,3},size(Octs)),{octets,Octs}];
-	    L = length(Octs),
-	    [encode_length({1,3},L),[20,L,Octs]];
-	Range =< 16#100000000  -> % max 4 octets
-	    Octs = eint_positive(Val2),
-%	    [encode_length({1,4},size(Octs)),{octets,Octs}];
-	    L = length(Octs),
-	    [encode_length({1,4},L),[20,L,Octs]];
-	Range =< 16#10000000000  -> % max 5 octets
-	    Octs = eint_positive(Val2),
-%	    [encode_length({1,5},size(Octs)),{octets,Octs}];
-	    L = length(Octs),
-	    [encode_length({1,5},L),[20,L,Octs]];
-	true  ->
-	    exit({not_supported,{integer_range,Range}})
-    end.
-
-encode_constrained_number(Range,{Name,Val}) when is_atom(Name) ->
-    encode_constrained_number(Range,Val);
-encode_constrained_number({Lb,Ub},Val) when Val >= Lb, Ub >= Val -> 
-    Range = Ub - Lb + 1,
-    Val2 = Val - Lb,
-    if 
-	Range  == 1 -> [];
-	Range  == 2 ->
-%	    Size = {bits,1,Val2};
-	    [Val2];
-	Range  =< 4 -> 
-%	    Size = {bits,2,Val2};
-	    [10,2,Val2];
-	Range  =< 8 ->
-	    [10,3,Val2];
-	Range  =< 16 ->
-	    [10,4,Val2];
-	Range  =< 32 ->
-	    [10,5,Val2];
-	Range  =< 64 ->
-	    [10,6,Val2];
-	Range  =< 128 ->
-	    [10,7,Val2];
-	Range  =< 255 ->
-	    [10,8,Val2];
-	Range  =< 256 ->
-%	    Size = {octets,[Val2]};
-	    [20,1,Val2];
-	Range  =< 65536 ->
-%	    Size = {octets,<<Val2:16>>};
-	    [20,2,<<Val2:16>>];
-	Range =< (1 bsl (255*8))  ->
-            Octs = binary:encode_unsigned(Val2),
-            RangeOcts = binary:encode_unsigned(Range - 1),
-            OctsLen = erlang:byte_size(Octs),
-            RangeOctsLen = erlang:byte_size(RangeOcts),
-            LengthBitsNeeded = minimum_bits(RangeOctsLen - 1),
-            [10,LengthBitsNeeded,OctsLen-1,20,OctsLen,Octs];
-	true  ->
-	    exit({not_supported,{integer_range,Range}})
-    end;
-encode_constrained_number({_,_},Val) -> 
-    exit({error,{asn1,{illegal_value,Val}}}).
-
-decode_constrained_number(Buffer,VR={Lb,Ub}) ->
-    Range = Ub - Lb + 1,
-    decode_constrained_number(Buffer,VR,Range).
-
-decode_constrained_number(Buffer,{Lb,_Ub},Range) ->
-						%    Val2 = Val - Lb,
-    {Val,Remain} = 
-	if 
-	    Range  == 1 ->
-		{0,Buffer};
-	    Range  == 2 ->
-		getbits(Buffer,1);
-	    Range  =< 4 -> 
-		getbits(Buffer,2);
-	    Range  =< 8 ->
-		getbits(Buffer,3);
-	    Range  =< 16 ->
-		getbits(Buffer,4);
-	    Range  =< 32 ->
-		getbits(Buffer,5);
-	    Range  =< 64 ->
-		getbits(Buffer,6);
-	    Range  =< 128 ->
-		getbits(Buffer,7);
-	    Range  =< 255 ->
-		getbits(Buffer,8);
-	    Range  =< 256 ->
-		getoctets(Buffer,1);
-	    Range  =< 65536 ->
-		getoctets(Buffer,2);
-            Range =< (1 bsl (255*8))  ->
-                OList = binary:bin_to_list(binary:encode_unsigned(Range - 1)),
-                RangeOctLen = length(OList),
-                {Len, Bytes} = decode_length(Buffer, {1, RangeOctLen}),
-                {Octs, RestBytes} = getoctets_as_bin(Bytes, Len),
-                {binary:decode_unsigned(Octs), RestBytes};
-	    true  ->
-		exit({not_supported,{integer_range,Range}})
-	end,
-    {Val+Lb,Remain}.
-
-%% For some reason the minimum bits needed in the length field in
-%% the encoding of constrained whole numbers must always be at least 2?
-minimum_bits(N) when N < 4 -> 2;
-minimum_bits(N) when N < 8 -> 3;
-minimum_bits(N) when N < 16 -> 4;
-minimum_bits(N) when N < 32 -> 5;
-minimum_bits(N) when N < 64 -> 6;
-minimum_bits(N) when N < 128 -> 7;
-minimum_bits(_N) -> 8.
-
-%% X.691:10.8 Encoding of an unconstrained whole number
-
-encode_unconstrained_number(Val) when Val >= 0 ->
-    Oct = eint(Val,[]),
-    Len = length(Oct),
-    if 
-	Len < 128 ->
-	    %{octets,[Len|Oct]}; % equiv with encode_length(undefined,Len) but faster
-	    [20,Len+1,[Len|Oct]];
-	Len < 256 ->
-%	    [encode_length(undefined,Len),20,Len,Oct];
-	    [20,Len+2,<<2:2,Len:14>>,Oct];% equiv with encode_length(undefined,Len) but faster
-	true ->
-%	    [encode_length(undefined,Len),{octets,Oct}]
-	    [encode_length(undefined,Len),[21,<<Len:16>>,Oct]]
-    end;
-encode_unconstrained_number(Val) -> % negative
-    Oct = enint(Val,[]),
-    Len = length(Oct),
-    if 
-	Len < 128 ->
-%	    {octets,[Len|Oct]}; % equiv with encode_length(undefined,Len) but faster
-	    [20,Len+1,[Len|Oct]];% equiv with encode_length(undefined,Len) but faster
-	Len < 256 ->
-%	    [encode_length(undefined,Len),20,Len,Oct];
-	    [20,Len+2,<<2:2,Len:14>>,Oct];% equiv with encode_length(undefined,Len) but faster
-	true ->
-	    %[encode_length(undefined,Len),{octets,Oct}]
-	    [encode_length(undefined,Len),[21,<<Len:16>>,Oct]]
-    end.
-
-
-%% used for positive Values which don't need a sign bit
-%% returns a list
-eint_positive(Val) ->
-    case eint(Val,[]) of
-	[0,B1|T] ->
-	    [B1|T];
-	T -> 
-	    T
-    end.
-
-
-eint(0, [B|Acc]) when B < 128 ->
-    [B|Acc];
-eint(N, Acc) ->
-    eint(N bsr 8, [N band 16#ff| Acc]).
-
-enint(-1, [B1|T]) when B1 > 127 ->
-    [B1|T];
-enint(N, Acc) ->
-    enint(N bsr 8, [N band 16#ff|Acc]).
-
-%% X.691:10.9 Encoding of a length determinant
-%%encode_small_length(undefined,Len) -> % null means no UpperBound
-%%    encode_small_number(Len).
-
-%% X.691:10.9.3.5 
-%% X.691:10.9.3.7
-encode_length(undefined,Len) -> % un-constrained
-    if 
-	Len < 128 ->
-%	    {octets,[Len]};
-	    [20,1,Len];
-	Len < 16384 ->
-	    %{octets,<<2:2,Len:14>>};
-	    [20,2,<<2:2,Len:14>>];
-	true  -> % should be able to endode length >= 16384 i.e. fragmented length
-	    exit({error,{asn1,{encode_length,{nyi,above_16k}}}})
-    end;
-
-encode_length({0,'MAX'},Len) ->
-    encode_length(undefined,Len);
-encode_length(Vr={Lb,Ub},Len) when Ub =< 65535 ,Lb >= 0 -> % constrained
-    encode_constrained_number(Vr,Len);
-encode_length({Lb,_Ub},Len) when is_integer(Lb), Lb >= 0 -> % Ub > 65535
-    encode_length(undefined,Len);
-encode_length({Vr={Lb,Ub},Ext},Len) 
-  when Ub =< 65535 ,Lb >= 0,Len=<Ub, is_list(Ext) -> 
-    %% constrained extensible 
-    [0,encode_constrained_number(Vr,Len)];
-encode_length({{Lb,_},Ext},Len) when is_list(Ext) -> 
-    [1,encode_semi_constrained_number(Lb,Len)];
-encode_length(SingleValue,_Len) when is_integer(SingleValue) ->
-    [].
-
-%% X.691 10.9.3.4 (only used for length of bitmap that prefixes extension 
-%% additions in a sequence or set
-encode_small_length(Len) when Len =< 64 ->
-%%    [{bits,1,0},{bits,6,Len-1}];
-%    {bits,7,Len-1}; % the same as above but more efficient
-    [10,7,Len-1];
-encode_small_length(Len) ->
-%    [{bits,1,1},encode_length(undefined,Len)].
-    [1,encode_length(undefined,Len)].
-
-
-decode_length(Buffer,undefined)  -> % un-constrained
-    case align(Buffer) of
-	<<0:1,Oct:7,Rest/binary>> ->
-	    {Oct,Rest};
-	<<2:2,Val:14,Rest/binary>> ->
-	    {Val,Rest};
-	<<3:2,_Val:14,_Rest/binary>> ->
-	    %% this case should be fixed
-	    exit({error,{asn1,{decode_length,{nyi,above_16k}}}})
-    end;
-
-decode_length(Buffer,{Lb,Ub}) when Ub =< 65535 ,Lb >= 0 -> % constrained
-    decode_constrained_number(Buffer,{Lb,Ub});
-decode_length(Buffer,{Lb,_Ub}) when is_integer(Lb), Lb >= 0 -> % Ub > 65535
-    decode_length(Buffer,undefined);
-decode_length(Buffer,{{Lb,Ub},Ext}) when is_list(Ext) -> 
-    case getbit(Buffer) of
-	{0,Buffer2} ->
-	    decode_length(Buffer2, {Lb,Ub});
-	{1,Buffer2} ->
-	    decode_length(Buffer2, undefined)
-    end;
-
-
-%When does this case occur with {_,_Lb,Ub} ??
-% X.691:10.9.3.5 
-decode_length(Bin,{_,_Lb,_Ub}) -> % Unconstrained or large Ub NOTE! this case does not cover case when Ub > 65535
-    case Bin of
-	<<0:1,Val:7,Rest/bitstring>> -> 
-	    {Val,Rest};
-	_ ->
-	    case align(Bin) of
-		<<2:2,Val:14,Rest/binary>> -> 
-		    {Val,Rest};
-		<<3:2,_:14,_Rest/binary>> -> 
-		    exit({error,{asn1,{decode_length,{nyi,length_above_64K}}}})
-	    end
-    end;
-decode_length(Buffer,SingleValue) when is_integer(SingleValue) ->
-    {SingleValue,Buffer}.
-
-
-
-%%===============================================================================
-%%===============================================================================
-%%===============================================================================
-%% Bitstring value, ITU_T X.690 Chapter 8.5
-%%===============================================================================
-%%===============================================================================
-%%===============================================================================
-
-%%===============================================================================
-%% encode bitstring value
-%%===============================================================================
-
-
-
-%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
-%% bitstring NamedBitList
-%% Val can be  of:
-%% - [identifiers] where only named identifers are set to one, 
-%%   the Constraint must then have some information of the 
-%%   bitlength.
-%% - [list of ones and zeroes] all bits 
-%% - integer value representing the bitlist
-%% C is constraint Len, only valid when identifiers
-
-
-%% when the value is a list of {Unused,BinBits}, where 
-%% Unused = integer(),
-%% BinBits = binary().
-
-encode_bit_string(C,Bin={Unused,BinBits},NamedBitList) when is_integer(Unused),
-							    is_binary(BinBits) ->
-    encode_bin_bit_string(C,Bin,NamedBitList);
-
-%% when the value is a list of named bits
-
-encode_bit_string(C, LoNB=[FirstVal | _RestVal], NamedBitList) when is_atom(FirstVal) ->
-    ToSetPos = get_all_bitposes(LoNB, NamedBitList, []),
-    BitList = make_and_set_list(ToSetPos,0),
-    encode_bit_string(C,BitList,NamedBitList);% consider the constraint
-
-encode_bit_string(C, BL=[{bit,_} | _RestVal], NamedBitList) ->
-    ToSetPos = get_all_bitposes(BL, NamedBitList, []),
-    BitList = make_and_set_list(ToSetPos,0),
-    encode_bit_string(C,BitList,NamedBitList);
-
-%% when the value is a list of ones and zeroes
-encode_bit_string(Int, BitListValue, _) 
-  when is_list(BitListValue),is_integer(Int),Int =< 16 ->
-    %% The type is constrained by a single value size constraint
-    %% range_check(Int,length(BitListValue)),
-    [40,Int,length(BitListValue),BitListValue];
-encode_bit_string(Int, BitListValue, _) 
-  when is_list(BitListValue),is_integer(Int), Int =< 255 ->
-    %% The type is constrained by a single value size constraint
-    %% range_check(Int,length(BitListValue)),
-    [2,40,Int,length(BitListValue),BitListValue];
-encode_bit_string(Int, BitListValue, _) 
-  when is_list(BitListValue),is_integer(Int), Int < ?'64K' ->
-    {Code,DesiredLength,Length} = 
-	case length(BitListValue) of
-	    B1 when B1 > Int ->
-		exit({error,{'BIT_STRING_length_greater_than_SIZE',
-			     Int,BitListValue}});
-	    B1 when B1 =< 255,Int =< 255 ->
-		{40,Int,B1};
-	    B1 when B1 =< 255 ->
-		{42,<<Int:16>>,B1};
-	    B1 ->
-		{43,<<Int:16>>,<<B1:16>>}
-	end,
-    %% The type is constrained by a single value size constraint
-    [2,Code,DesiredLength,Length,BitListValue];
-encode_bit_string(no, BitListValue,[]) 
-  when is_list(BitListValue) ->
-    [encode_length(undefined,length(BitListValue)),
-     2,BitListValue];
-encode_bit_string({{Fix,Fix},Ext}, BitListValue,[]) 
-  when is_integer(Fix), is_list(Ext) ->
-    case length(BitListValue) of
-	Len when Len =< Fix ->
-	    [0,encode_bit_string(Fix,BitListValue,[])];
-	_ ->
-	    [1,encode_bit_string(no,BitListValue,[])]
-    end;
-encode_bit_string(C, BitListValue,[]) 
-  when is_list(BitListValue) ->
-    [encode_length(C,length(BitListValue)),
-     2,BitListValue];
-encode_bit_string(no, BitListValue,_NamedBitList) 
-  when is_list(BitListValue) ->
-    %% this case with an unconstrained BIT STRING can be made more efficient
-    %% if the complete driver can take a special code so the length field
-    %% is encoded there.
-    NewBitLVal = lists:reverse(lists:dropwhile(fun(0)->true;(1)->false end,
-					    lists:reverse(BitListValue))),
-    [encode_length(undefined,length(NewBitLVal)),
-     2,NewBitLVal];
-encode_bit_string({{Fix,Fix},Ext}, BitListValue,_NamedBitList) 
-  when is_integer(Fix), is_list(Ext) ->
-    case length(BitListValue) of
-	Len when Len =< Fix ->
-	    [0,encode_bit_string(Fix,BitListValue,_NamedBitList)];
-	_ ->
-	    [1,encode_bit_string(no,BitListValue,_NamedBitList)]
-    end;
-encode_bit_string(C,BitListValue,_NamedBitList) 
-  when is_list(BitListValue) ->% C = {_,'MAX'}
-%     NewBitLVal = lists:reverse(lists:dropwhile(fun(0)->true;(1)->false end,
-% 					    lists:reverse(BitListValue))),
-    NewBitLVal = bit_string_trailing_zeros(BitListValue,C),
-    [encode_length(C,length(NewBitLVal)),
-     2,NewBitLVal]; 
-
-
-%% when the value is an integer
-encode_bit_string(C, IntegerVal, NamedBitList) when is_integer(IntegerVal)->
-    BitList = int_to_bitlist(IntegerVal),
-    encode_bit_string(C,BitList,NamedBitList);
-
-%% when the value is a tuple
-encode_bit_string(C,{Name,Val}, NamedBitList) when is_atom(Name) ->
-    encode_bit_string(C,Val,NamedBitList).
-
-bit_string_trailing_zeros(BitList,C) when is_integer(C) ->
-    bit_string_trailing_zeros1(BitList,C,C);
-bit_string_trailing_zeros(BitList,{Lb,Ub}) when is_integer(Lb) ->
-    bit_string_trailing_zeros1(BitList,Lb,Ub);
-bit_string_trailing_zeros(BitList,{{Lb,Ub},_}) when is_integer(Lb) ->
-    bit_string_trailing_zeros1(BitList,Lb,Ub);
-bit_string_trailing_zeros(BitList,_) ->
-    BitList.
-
-bit_string_trailing_zeros1(BitList,Lb,Ub) ->
-    case length(BitList) of
-	Lb -> BitList;
-	B when B<Lb -> BitList++lists:duplicate(Lb-B,0);
-	D -> F = fun(L,LB,LB,_,_)->lists:reverse(L);
-		    ([0|R],L1,LB,UB,Fun)->Fun(R,L1-1,LB,UB,Fun);
-		    (L,L1,_,UB,_)when L1 =< UB -> lists:reverse(L);
-		    (_,_L1,_,_,_) ->exit({error,{list_length_BIT_STRING,
-						 BitList}}) end,
-	     F(lists:reverse(BitList),D,Lb,Ub,F)
-    end.
-
-%% encode_bin_bit_string/3, when value is a tuple of Unused and BinBits.
-%% Unused = integer(),i.e. number unused bits in least sign. byte of
-%% BinBits = binary().
-encode_bin_bit_string(C,{Unused,BinBits},_NamedBitList)
-  when is_integer(C),C=<16 ->
-    range_check(C,bit_size(BinBits) - Unused),
-    [45,C,size(BinBits),BinBits];
-encode_bin_bit_string(C,{Unused,BinBits},_NamedBitList)
-  when is_integer(C), C =< 255 ->
-    range_check(C,bit_size(BinBits) - Unused),
-    [2,45,C,size(BinBits),BinBits];
-encode_bin_bit_string(C,{Unused,BinBits},_NamedBitList)
-  when is_integer(C), C =< 65535 ->
-    range_check(C,bit_size(BinBits) - Unused),
-    case size(BinBits) of
-	Size when Size =< 255 ->
-	    [2,46,<<C:16>>,Size,BinBits];
-	Size ->
-	    [2,47,<<C:16>>,<<Size:16>>,BinBits]
-    end;
-%% encode_bin_bit_string(C,{_Unused,BinBits},_NamedBitList)
-%%   when is_integer(C) ->
-%%     exit({error,{asn1, {bitstring_size, not_supported, C}}});
-encode_bin_bit_string(C,UnusedAndBin={_,_},NamedBitList) ->
-%    UnusedAndBin1 = {Unused1,Bin1} = 
-    {Unused1,Bin1} = 
-	%% removes all trailing bits if NamedBitList is not empty
-	remove_trailing_bin(NamedBitList,UnusedAndBin),
-    case C of
-	{Lb,Ub} when is_integer(Lb),is_integer(Ub) ->
-%	    [encode_length({Lb,Ub},size(Bin1)*8 - Unused1),
-%	     align,UnusedAndBin1];
-	    Size=size(Bin1),
-	    [encode_length({Lb,Ub},Size*8 - Unused1),
-	     2,octets_unused_to_complete(Unused1,Size,Bin1)];
-	no ->
-	    Size=size(Bin1),
-	    [encode_length(undefined,Size*8 - Unused1),
-	     2,octets_unused_to_complete(Unused1,Size,Bin1)];
-	{{Fix,Fix},Ext} when is_integer(Fix),is_list(Ext) ->
-	    %%[encode_length(Sc,size(Bin1)*8 - Unused1),
-	    case size(Bin1)*8 - Unused1 of
-		Size when Size =< Fix  ->
-		    [0,encode_bin_bit_string(Fix,UnusedAndBin,NamedBitList)];
-		_Size ->
-		    [1,encode_bin_bit_string(no,UnusedAndBin,NamedBitList)]
-	    end;
-	Sc -> 
-	    Size=size(Bin1),
-	    [encode_length(Sc,Size*8 - Unused1),
-	     2,octets_unused_to_complete(Unused1,Size,Bin1)]
-    end.
-
-range_check(C,C) when is_integer(C) ->
-    ok;
-range_check(C1,C2) when is_integer(C1) ->
-    exit({error,{asn1,{bit_string_out_of_range,{C1,C2}}}}).
-
-remove_trailing_bin([], {Unused,Bin}) ->
-    {Unused,Bin};
-remove_trailing_bin(_NamedNumberList,{_Unused,<<>>}) ->
-    {0,<<>>};
-remove_trailing_bin(NamedNumberList, {_Unused,Bin}) ->
-    Size = size(Bin)-1,
-    <<Bfront:Size/binary, LastByte:8>> = Bin,
-    %% clear the Unused bits to be sure
-%    LastByte1 = LastByte band (((1 bsl Unused) -1) bxor 255),% why this???
-    Unused1 = trailingZeroesInNibble(LastByte band 15),
-    Unused2 = 
-	case Unused1 of 
-	    4 ->
-		4 + trailingZeroesInNibble(LastByte bsr 4);
-	    _ -> Unused1
-	end,
-    case Unused2 of
-	8 ->
-	    remove_trailing_bin(NamedNumberList,{0,Bfront});
-	_ ->
-	    {Unused2,Bin}
-    end.
-
-
-trailingZeroesInNibble(0) ->
-    4;
-trailingZeroesInNibble(1) ->
-    0;
-trailingZeroesInNibble(2) ->
-    1;
-trailingZeroesInNibble(3) ->
-    0;
-trailingZeroesInNibble(4) ->
-    2;
-trailingZeroesInNibble(5) ->
-    0;
-trailingZeroesInNibble(6) ->
-    1;
-trailingZeroesInNibble(7) ->
-    0;
-trailingZeroesInNibble(8) ->
-    3;
-trailingZeroesInNibble(9) ->
-    0;
-trailingZeroesInNibble(10) ->
-    1;
-trailingZeroesInNibble(11) ->
-    0;
-trailingZeroesInNibble(12) -> %#1100
-    2;
-trailingZeroesInNibble(13) ->
-    0;
-trailingZeroesInNibble(14) ->
-    1;
-trailingZeroesInNibble(15) ->
-    0.
-
-%%%%%%%%%%%%%%%
-%% The result is presented as a list of named bits (if possible)
-%% else as a tuple {Unused,Bits}. Unused is the number of unused
-%% bits, least significant bits in the last byte of Bits. Bits is
-%% the BIT STRING represented as a binary.
-%% 
-decode_compact_bit_string(Buffer, C, NamedNumberList) ->
-    case get_constraint(C,'SizeConstraint') of
-	0 -> % fixed length
-	    {{8,0},Buffer};
-	V when is_integer(V),V=<16 -> %fixed length 16 bits or less
-	    compact_bit_string(Buffer,V,NamedNumberList);
-	V when is_integer(V),V=<65536 -> %fixed length > 16 bits
-	    Bytes2 = align(Buffer),
-	    compact_bit_string(Bytes2,V,NamedNumberList);
-	V when is_integer(V) -> % V > 65536 => fragmented value
-	    {BitStr,Buffer2} = decode_fragmented_bits(Buffer,V),
-	    case bit_size(BitStr) band 7 of
-		0 -> {{0,BitStr},Buffer2};
-		N -> {{8-N,<<BitStr/bitstring,0:(8-N)>>},Buffer2}
-	    end;
-	{Lb,Ub} when is_integer(Lb),is_integer(Ub) ->
-	    %% This case may demand decoding of fragmented length/value
-	    {Len,Bytes2} = decode_length(Buffer,{Lb,Ub}),
-	    Bytes3 = align(Bytes2),
-	    compact_bit_string(Bytes3,Len,NamedNumberList);
-	no ->
-	    %% This case may demand decoding of fragmented length/value
-	    {Len,Bytes2} = decode_length(Buffer,undefined),
-	    Bytes3 = align(Bytes2),
-	    compact_bit_string(Bytes3,Len,NamedNumberList);
-	{{Fix,Fix},Ext} = Sc when is_integer(Fix), is_list(Ext) ->
-	    case decode_length(Buffer,Sc) of
-		{Len,Bytes2} when Len > Fix ->
-		    Bytes3 = align(Bytes2),
-		    compact_bit_string(Bytes3,Len,NamedNumberList);
-		{Len,Bytes2} when Len > 16 ->
-		    Bytes3 = align(Bytes2),
-		    compact_bit_string(Bytes3,Len,NamedNumberList);
-		{Len,Bytes2} ->
-		    compact_bit_string(Bytes2,Len,NamedNumberList)
-	    end;
-	Sc ->
-	    {Len,Bytes2} = decode_length(Buffer,Sc),
-	    Bytes3 = align(Bytes2),
-	    compact_bit_string(Bytes3,Len,NamedNumberList)
-    end.
-
-
-%%%%%%%%%%%%%%%
-%% The result is presented as a list of named bits (if possible)
-%% else as a list of 0 and 1.
-%% 
-decode_bit_string(Buffer, C, NamedNumberList) ->
-    case get_constraint(C,'SizeConstraint') of
-	{Lb,Ub} when is_integer(Lb),is_integer(Ub) ->
-	    {Len,Bytes2} = decode_length(Buffer,{Lb,Ub}),
-	    Bytes3 = align(Bytes2),
-	    bit_list_or_named(Bytes3,Len,NamedNumberList);
-	no ->
-	    {Len,Bytes2} = decode_length(Buffer,undefined),
-	    Bytes3 = align(Bytes2),
-	    bit_list_or_named(Bytes3,Len,NamedNumberList);
-	0 -> % fixed length
-	    {[],Buffer}; % nothing to encode
-	V when is_integer(V),V=<16 -> % fixed length 16 bits or less
-	    bit_list_or_named(Buffer,V,NamedNumberList);
-	V when is_integer(V),V=<65536 ->
-	    Bytes2 = align(Buffer),
-	    bit_list_or_named(Bytes2,V,NamedNumberList);
-	V when is_integer(V) ->
-	    Bytes2 = align(Buffer),
-	    {BinBits,_Bytes3} = decode_fragmented_bits(Bytes2,V),
-	    bit_list_or_named(BinBits,V,NamedNumberList);
-	{{Fix,Fix},Ext} =Sc when is_integer(Fix), is_list(Ext) ->
-	    case decode_length(Buffer,Sc) of
-		{Len,Bytes2} when Len > Fix ->
-		    Bytes3 = align(Bytes2),
-		    bit_list_or_named(Bytes3,Len,NamedNumberList);
-		{Len,Bytes2} when Len > 16 ->
-		    Bytes3 = align(Bytes2),
-		    bit_list_or_named(Bytes3,Len,NamedNumberList);
-		{Len,Bytes2} ->
-		    bit_list_or_named(Bytes2,Len,NamedNumberList)
-	    end;
-	Sc -> % extension marker
-	    {Len,Bytes2} = decode_length(Buffer,Sc),
-	    Bytes3 = align(Bytes2),
-	    bit_list_or_named(Bytes3,Len,NamedNumberList)
-    end.
-
-
-%% if no named bits are declared we will return a
-%% {Unused,Bits}. Unused = integer(),
-%% Bits = binary().
-compact_bit_string(Buffer,Len,[]) ->
-    {BitStr,Rest} = getbits_as_binary(Len,Buffer), % {{Unused,BinBits},NewBuffer}
-    PadLen = (8 - (bit_size(BitStr) rem 8)) rem 8,
-    {{PadLen,<<BitStr/bitstring,0:PadLen>>},Rest};
-compact_bit_string(Buffer,Len,NamedNumberList) ->
-    bit_list_or_named(Buffer,Len,NamedNumberList).
-
-
-%% if no named bits are declared we will return a
-%% BitList = [0 | 1]
-
-bit_list_or_named(Buffer,Len,[]) ->
-    getbits_as_list(Len,Buffer);
-
-%% if there are named bits declared we will return a named
-%% BitList where the names are atoms and unnamed bits represented
-%% as {bit,Pos}
-%% BitList = [atom() | {bit,Pos}]
-%% Pos = integer()
-
-bit_list_or_named(Buffer,Len,NamedNumberList) ->
-    {BitList,Rest} = getbits_as_list(Len,Buffer),
-    {bit_list_or_named1(0,BitList,NamedNumberList,[]), Rest}.
-
-bit_list_or_named1(Pos,[0|Bt],Names,Acc) ->
-    bit_list_or_named1(Pos+1,Bt,Names,Acc);
-bit_list_or_named1(Pos,[1|Bt],Names,Acc) ->
-    case lists:keysearch(Pos,2,Names) of
-	{value,{Name,_}} ->
-	    bit_list_or_named1(Pos+1,Bt,Names,[Name|Acc]);
-	_  -> 
-	    bit_list_or_named1(Pos+1,Bt,Names,[{bit,Pos}|Acc])
-    end;
-bit_list_or_named1(_Pos,[],_Names,Acc) ->
-    lists:reverse(Acc).
-
-
-
-%%%%%%%%%%%%%%%
-%% 
-
-int_to_bitlist(Int) when is_integer(Int), Int > 0 ->
-    [Int band 1 | int_to_bitlist(Int bsr 1)];
-int_to_bitlist(0) ->
-    [].
-
-
-%%%%%%%%%%%%%%%%%%
-%% get_all_bitposes([list of named bits to set], named_bit_db, []) ->
-%%   [sorted_list_of_bitpositions_to_set]
-
-get_all_bitposes([{bit,ValPos}|Rest], NamedBitList, Ack) ->
-    get_all_bitposes(Rest, NamedBitList, [ValPos | Ack ]);
-
-get_all_bitposes([Val | Rest], NamedBitList, Ack) ->
-    case lists:keysearch(Val, 1, NamedBitList) of
-	{value, {_ValName, ValPos}} ->
-	    get_all_bitposes(Rest, NamedBitList, [ValPos | Ack]);
-	_ ->
-	    exit({error,{asn1, {bitstring_namedbit, Val}}})
-    end;
-get_all_bitposes([], _NamedBitList, Ack) ->
-    lists:sort(Ack).
-
-%%%%%%%%%%%%%%%%%%
-%% make_and_set_list([list of positions to set to 1])->
-%% returns list with all in SetPos set.
-%% in positioning in list the first element is 0, the second 1 etc.., but
-%% 
-
-make_and_set_list([XPos|SetPos], XPos) ->
-    [1 | make_and_set_list(SetPos, XPos + 1)];
-make_and_set_list([Pos|SetPos], XPos) ->
-    [0 | make_and_set_list([Pos | SetPos], XPos + 1)];
-make_and_set_list([], _) ->
-    [].
-
-
-
-%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
-%% X.691:16
-%% encode_octet_string(Constraint,ExtensionMarker,Val)
-%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
-
-encode_octet_string(C,Val) ->
-    encode_octet_string(C,false,Val).
-
-encode_octet_string(C,Bool,{_Name,Val}) ->
-    encode_octet_string(C,Bool,Val);
-encode_octet_string(_C,true,_Val) -> 
-    exit({error,{asn1,{'not_supported',extensionmarker}}});
-encode_octet_string(SZ={_,_},false,Val) ->
-%    [encode_length(SZ,length(Val)),align,
-%	     {octets,Val}];
-    Len = length(Val),
-    try
-	[encode_length(SZ,Len),2,
-	 octets_to_complete(Len,Val)]
-    catch
-	exit:{error,{asn1,{encode_length,_}}} ->
-	    encode_fragmented_octet_string(Val)
-    end;
-encode_octet_string(SZ,false,Val) when is_list(SZ) ->
-    Len = length(Val),
-    try
-	[encode_length({hd(SZ),lists:max(SZ)},Len),2,
-	 octets_to_complete(Len,Val)]
-    catch
-	exit:{error,{asn1,{encode_length,_}}} ->
-	    encode_fragmented_octet_string(Val)
-    end;
-encode_octet_string(Sv,false,Val) when is_integer(Sv) ->
-    encode_fragmented_octet_string(Val);
-encode_octet_string(no,false,Val) ->
-    Len = length(Val),
-    try
-	[encode_length(undefined,Len),2,
-	 octets_to_complete(Len,Val)]
-    catch
-	exit:{error,{asn1,{encode_length,_}}} ->
-	    encode_fragmented_octet_string(Val)
-    end;
-encode_octet_string(C,_,_) ->
-    exit({error,{not_implemented,C}}).
-
-encode_fragmented_octet_string(Val) ->
-    Bin = iolist_to_binary(Val),
-    efos_1(Bin).
-
-efos_1(<<B1:16#C000/binary,B2:16#4000/binary,T/binary>>) ->
-    [20,1,<<3:2,4:6>>,
-     octets_to_complete(16#C000, B1),
-     octets_to_complete(16#4000, B2)|efos_1(T)];
-efos_1(<<B:16#C000/binary,T/binary>>) ->
-    [20,1,<<3:2,3:6>>,octets_to_complete(16#C000, B)|efos_1(T)];
-efos_1(<<B:16#8000/binary,T/binary>>) ->
-    [20,1,<<3:2,2:6>>,octets_to_complete(16#8000, B)|efos_1(T)];
-efos_1(<<B:16#4000/binary,T/binary>>) ->
-    [20,1,<<3:2,1:6>>,octets_to_complete(16#4000, B)|efos_1(T)];
-efos_1(<<>>) ->
-    [20,1,0];
-efos_1(<<B/bitstring>>) ->
-    Len = byte_size(B),
-    [encode_length(undefined, Len),octets_to_complete(Len, B)].
-
-decode_fragmented(SegSz0, Buf0, Unit) ->
-    SegSz = SegSz0 * Unit * ?'16K',
-    <<Res:SegSz/bitstring,Buf/bitstring>> = Buf0,
-    decode_fragmented_1(Buf, Unit, Res).
-
-decode_fragmented_1(<<0:1,N:7,Buf0/bitstring>>, Unit, Res) ->
-    Sz = N*Unit,
-    <<S:Sz/bitstring,Buf/bitstring>> = Buf0,
-    {<<Res/bitstring,S/bitstring>>,Buf};
-decode_fragmented_1(<<1:1,0:1,N:14,Buf0/bitstring>>, Unit, Res) ->
-    Sz = N*Unit,
-    <<S:Sz/bitstring,Buf/bitstring>> = Buf0,
-    {<<Res/bitstring,S/bitstring>>,Buf};
-decode_fragmented_1(<<1:1,1:1,SegSz0:6,Buf0/bitstring>>, Unit, Res0) ->
-    SegSz = SegSz0 * Unit * ?'16K',
-    <<Frag:SegSz/bitstring,Buf/bitstring>> = Buf0,
-    Res = <<Res0/bitstring,Frag/bitstring>>,
-    decode_fragmented_1(Buf, Unit, Res).
-
-
-%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
-%% Restricted char string types 
-%% (NumericString, PrintableString,VisibleString,IA5String,BMPString,UniversalString)
-%% X.691:26 and X.680:34-36
-%%encode_restricted_string(aligned,'BMPString',Constraints,Extension,Val)
-
-
-encode_restricted_string(aligned,{Name,Val}) when is_atom(Name) ->
-    encode_restricted_string(aligned,Val);
-
-encode_restricted_string(aligned,Val) when is_list(Val)->
-    Len = length(Val),
-    [encode_length(undefined,Len),octets_to_complete(Len,Val)].
-
-
-encode_known_multiplier_string(StringType,SizeC,NumBits,CharOutTab,{Name,Val}) when is_atom(Name) ->
-    encode_known_multiplier_string(StringType,SizeC,NumBits,CharOutTab,Val);
-encode_known_multiplier_string(_StringType,SizeC,NumBits,CharOutTab,Val) ->
-    Result = chars_encode2(Val,NumBits,CharOutTab),
-    case SizeC of
-	Ub when is_integer(Ub), Ub*NumBits =< 16  ->
-	    Result;
-	Ub when is_integer(Ub),Ub =<65535 -> % fixed length
-	    [2,Result];
-	{Ub,Lb} ->
-	    [encode_length({Ub,Lb},length(Val)),2,Result];
-	no  ->
-	    [encode_length(undefined,length(Val)),2,Result]
-    end.
-
-decode_restricted_string(Bytes,aligned) ->
-    {Len,Bytes2} = decode_length(Bytes,undefined),
-    getoctets_as_list(Bytes2,Len).
-
-decode_known_multiplier_string(StringType,SizeC,NumBits,CharInTab,Bytes) ->
-    case SizeC of
-	Ub when is_integer(Ub), Ub*NumBits =< 16  ->
-	    chars_decode(Bytes,NumBits,StringType,CharInTab,Ub);
-	Ub when is_integer(Ub),Ub =<65535 -> % fixed length
-	    Bytes1 = align(Bytes),
-	    chars_decode(Bytes1,NumBits,StringType,CharInTab,Ub);
-	Vl when is_list(Vl) ->
-	    {Len,Bytes1} = decode_length(Bytes,{hd(Vl),lists:max(Vl)}),
-	    Bytes2 = align(Bytes1),
-	    chars_decode(Bytes2,NumBits,StringType,CharInTab,Len);
-	no  ->
-	    {Len,Bytes1} = decode_length(Bytes,undefined),
-	    Bytes2 = align(Bytes1),
-	    chars_decode(Bytes2,NumBits,StringType,CharInTab,Len);
-	{Lb,Ub}->
-	    {Len,Bytes1} = decode_length(Bytes,{Lb,Ub}),
-	    Bytes2 = align(Bytes1),
-	    chars_decode(Bytes2,NumBits,StringType,CharInTab,Len)
-    end.
-
-encode_GeneralString(_C,Val) ->
-    encode_restricted_string(aligned,Val).
-decode_GeneralString(Bytes,_C) ->
-    decode_restricted_string(Bytes,aligned).
-
-encode_GraphicString(_C,Val) ->
-    encode_restricted_string(aligned,Val).
-decode_GraphicString(Bytes,_C) ->
-    decode_restricted_string(Bytes,aligned).
-
-encode_ObjectDescriptor(_C,Val) ->
-    encode_restricted_string(aligned,Val).
-decode_ObjectDescriptor(Bytes) ->
-    decode_restricted_string(Bytes,aligned).
-
-encode_TeletexString(_C,Val) -> % equivalent with T61String
-    encode_restricted_string(aligned,Val).
-decode_TeletexString(Bytes,_C) ->
-    decode_restricted_string(Bytes,aligned).
-
-encode_VideotexString(_C,Val) ->
-    encode_restricted_string(aligned,Val).
-decode_VideotexString(Bytes,_C) ->
-    decode_restricted_string(Bytes,aligned).
-
-
-
-
-%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
-%% getBMPChars(Bytes,Len) ->{BMPcharList,RemainingBytes}
-%%
-getBMPChars(<<T/binary>>, 0, Acc) ->
-    {lists:reverse(Acc),T};
-getBMPChars(<<0,O2,Bytes1/bitstring>>, Len, Acc) ->
-    getBMPChars(Bytes1,Len-1,[O2|Acc]);
-getBMPChars(<<O1,O2,Bytes1/bitstring>>, Len, Acc) ->
-    getBMPChars(Bytes1,Len-1,[{0,0,O1,O2}|Acc]).
-
-%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
-%% chars_encode(C,StringType,Value) -> ValueList
-%%
-%% encodes chars according to the per rules taking the constraint PermittedAlphabet 
-%% into account.
-%% This function does only encode the value part and NOT the length
-
-% chars_encode(C,StringType,Value) ->
-%     case {StringType,get_constraint(C,'PermittedAlphabet')} of
-% 	{'UniversalString',{_,Sv}} ->
-% 	    exit({error,{asn1,{'not implemented',"UniversalString with PermittedAlphabet constraint"}}});
-% 	{'BMPString',{_,Sv}} ->
-% 	    exit({error,{asn1,{'not implemented',"BMPString with PermittedAlphabet constraint"}}});
-% 	_ ->
-% 	    {NumBits,CharOutTab} = {get_NumBits(C,StringType),get_CharOutTab(C,StringType)}, 
-% 	    chars_encode2(Value,NumBits,CharOutTab)
-%     end.
-
-
-chars_encode2([H|T],NumBits,T1={Min,Max,notab}) when  H =< Max, H >= Min ->
-%    [[10,NumBits,H-Min]|chars_encode2(T,NumBits,T1)];
-    [pre_complete_bits(NumBits,H-Min)|chars_encode2(T,NumBits,T1)];
-chars_encode2([H|T],NumBits,T1={Min,Max,Tab}) when H =< Max, H >= Min ->
-%    [[10,NumBits,element(H-Min+1,Tab)]|chars_encode2(T,NumBits,T1)];
-    [pre_complete_bits(NumBits,exit_if_false(H,element(H-Min+1,Tab)))|
-     chars_encode2(T,NumBits,T1)];
-chars_encode2([{A,B,C,D}|T],NumBits,T1={Min,_Max,notab}) -> 
-    %% no value range check here (ought to be, but very expensive)
-%    [{bits,NumBits,(A*B*C*D)-Min}|chars_encode2(T,NumBits,{Min,Max,notab})];
-%    [[10,NumBits,((((((A bsl 8)+B) bsl 8)+C) bsl 8)+D)-Min]|chars_encode2(T,NumBits,T1)];
-    [pre_complete_bits(NumBits,
-			       ((((((A bsl 8)+B) bsl 8)+C) bsl 8)+D)-Min)|
-     chars_encode2(T,NumBits,T1)];
-chars_encode2([H={A,B,C,D}|T],NumBits,{Min,Max,Tab}) -> 
-    %% no value range check here (ought to be, but very expensive)
-    [pre_complete_bits(NumBits,exit_if_false(H,element(((((((A bsl 8)+B) bsl 8)+C) bsl 8)+D)-Min,Tab)))|chars_encode2(T,NumBits,{Min,Max,notab})];
-chars_encode2([H|_T],_NumBits,{_Min,_Max,_Tab}) ->
-    exit({error,{asn1,{illegal_char_value,H}}});
-chars_encode2([],_,_) ->
-    [].
-
-exit_if_false(V,false)->
-    exit({error,{asn1,{"illegal value according to Permitted alphabet constraint",V}}});
-exit_if_false(_,V) ->V.
-
-pre_complete_bits(NumBits,Val) when NumBits =< 8 ->
-    [10,NumBits,Val];
-pre_complete_bits(NumBits,Val) when NumBits =< 16 ->
-    [10,NumBits-8,Val bsr 8,10,8,(Val band 255)];
-pre_complete_bits(NumBits,Val) when NumBits =< 2040 -> % 255 * 8
-%     LBUsed = NumBits rem 8,
-%     {Unused,Len} = case (8 - LBUsed) of
-% 		       8 -> {0,NumBits div 8};
-% 		       U -> {U,(NumBits div 8) + 1}
-% 		   end,
-%     NewVal = Val bsr LBUsed,
-%     [30,Unused,Len,<<NewVal:Len/unit:8,Val:LBUsed,0:Unused>>].
-    Unused = (8 - (NumBits rem 8)) rem 8,
-    Len = NumBits + Unused,
-    [30,Unused,Len div 8,<<(Val bsl Unused):Len>>].
-
-
-chars_decode(Bytes,_,'BMPString',_,Len) ->
-    getBMPChars(Bytes,Len,[]);
-chars_decode(Bytes,NumBits,_StringType,CharInTab,Len) ->	
-    chars_decode2(Bytes,CharInTab,NumBits,Len).
-
-
-chars_decode2(Bytes,CharInTab,NumBits,Len) ->
-    chars_decode2(Bytes,CharInTab,NumBits,Len,[]).
-
-chars_decode2(Bytes,_CharInTab,_NumBits,0,Acc) ->
-    {lists:reverse(Acc),Bytes};
-chars_decode2(Bytes,{Min,Max,notab},NumBits,Len,Acc) when NumBits > 8 ->
-    {Char,Bytes2} = getbits(Bytes,NumBits),
-    Result = 
-	if
-	    Char < 256 -> Char;
-	    true ->
-		list_to_tuple(binary_to_list(<<Char:32>>))
-	end,
-    chars_decode2(Bytes2,{Min,Max,notab},NumBits,Len -1,[Result|Acc]);
-chars_decode2(Bytes,{Min,Max,notab},NumBits,Len,Acc) ->
-    {Char,Bytes2} = getbits(Bytes,NumBits),
-    chars_decode2(Bytes2,{Min,Max,notab},NumBits,Len -1,[Char+Min|Acc]);
-
-%% BMPString and UniversalString with PermittedAlphabet is currently not supported
-chars_decode2(Bytes,{Min,Max,CharInTab},NumBits,Len,Acc) ->
-    {Char,Bytes2} = getbits(Bytes,NumBits),
-    chars_decode2(Bytes2,{Min,Max,CharInTab},NumBits,Len -1,[element(Char+1,CharInTab)|Acc]).
-
-
-%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
-%% encode_UTF8String(Val) -> CompleteList
-%% Val -> <<utf8encoded binary>>
-%% CompleteList -> [apropriate codes and values for driver complete]
-%%
-encode_UTF8String(Val) when is_binary(Val) ->
-    [encode_length(undefined,size(Val)),
-     octets_to_complete(size(Val),Val)];
-encode_UTF8String(Val) ->
-    encode_UTF8String(list_to_binary(Val)).
-
-
-%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
-%% decode_UTF8String(Bytes) -> {Utf8Binary,RemainingBytes}
-%% Utf8Binary -> <<utf8 encoded binary>>
-%% RemainingBytes -> <<buffer>>
-decode_UTF8String(Bytes) -> 
-    {Len,Bytes2} = decode_length(Bytes,undefined),
-    {_Bin,_Bytes3} = getoctets_as_bin(Bytes2,Len).
-
-
-
-
-%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
-%% encode_object_identifier(Val) -> CompleteList
-%% encode_object_identifier({Name,Val}) -> CompleteList
-%% Val -> {Int1,Int2,...,IntN} % N >= 2
-%% Name -> atom()
-%% Int1 -> integer(0..2)
-%% Int2 -> integer(0..39) when Int1 (0..1) else integer()
-%% Int3-N -> integer()
-%% CompleteList -> [{bits,8,Val}|{octets,Ol}|align|...]
-%%
-encode_object_identifier({Name,Val}) when is_atom(Name) ->
-    encode_object_identifier(Val);
-encode_object_identifier(Val) ->
-    OctetList = e_object_identifier(Val),
-    Octets = list_to_binary(OctetList),
-    [encode_length(undefined,size(Octets)),
-     octets_to_complete(size(Octets),Octets)].
-
-e_object_identifier({'OBJECT IDENTIFIER',V}) ->
-    e_object_identifier(V);
-e_object_identifier({Cname,V}) when is_atom(Cname),is_tuple(V) ->
-    e_object_identifier(tuple_to_list(V));
-e_object_identifier({Cname,V}) when is_atom(Cname),is_list(V) ->
-    e_object_identifier(V);
-e_object_identifier(V) when is_tuple(V) ->
-    e_object_identifier(tuple_to_list(V));
-
-%% E1 = 0|1|2 and (E2 < 40 when E1 = 0|1) 
-e_object_identifier([E1,E2|Tail]) when E1 >= 0, E1 < 2, E2 < 40 ; E1==2 ->
-    Head = 40*E1 + E2,  % weird
-    e_object_elements([Head|Tail],[]);
-e_object_identifier(Oid=[_,_|_Tail]) ->
-    exit({error,{asn1,{'illegal_value',Oid}}}).
-
-e_object_elements([],Acc) ->
-    lists:reverse(Acc);
-e_object_elements([H|T],Acc) ->
-    e_object_elements(T,[e_object_element(H)|Acc]).
-
-e_object_element(Num) when Num < 128 ->
-    [Num];
-e_object_element(Num) ->
-    [e_o_e(Num bsr 7)|[Num band 2#1111111]].
-e_o_e(Num) when Num < 128 ->
-    Num bor 2#10000000;
-e_o_e(Num) ->
-    [e_o_e(Num bsr 7)|[(Num band 2#1111111) bor 2#10000000]].
-
-
-
-%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
-%% decode_object_identifier(Bytes) -> {ObjId,RemainingBytes}
-%% ObjId -> {integer(),integer(),...} % at least 2 integers
-%% RemainingBytes -> [integer()] when integer() (0..255)
-decode_object_identifier(Bytes) ->
-    {Len,Bytes2} = decode_length(Bytes,undefined),
-    {Octs,Bytes3} = getoctets_as_list(Bytes2,Len),
-    [First|Rest] = dec_subidentifiers(Octs,0,[]),
-    Idlist = if
-		 First < 40 ->
-		     [0,First|Rest];
-		 First < 80 ->
-		     [1,First - 40|Rest];
-		 true ->
-		     [2,First - 80|Rest]
-	     end,
-    {list_to_tuple(Idlist),Bytes3}.
-
-dec_subidentifiers([H|T],Av,Al) when H >=16#80 ->
-    dec_subidentifiers(T,(Av bsl 7) + (H band 16#7F),Al);
-dec_subidentifiers([H|T],Av,Al) ->
-    dec_subidentifiers(T,0,[(Av bsl 7) + H |Al]);
-dec_subidentifiers([],_Av,Al) ->
-    lists:reverse(Al).
-
-%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
-%% encode_relative_oid(Val) -> CompleteList
-%% encode_relative_oid({Name,Val}) -> CompleteList
-encode_relative_oid({Name,Val}) when is_atom(Name) ->
-    encode_relative_oid(Val);
-encode_relative_oid(Val) when is_tuple(Val) ->
-    encode_relative_oid(tuple_to_list(Val));
-encode_relative_oid(Val) when is_list(Val) ->
-    Octets = list_to_binary([e_object_element(X)||X <- Val]),
-    [encode_length(undefined,size(Octets)),
-     octets_to_complete(size(Octets),Octets)].
-    
-%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
-%% decode_relative_oid(Val) -> CompleteList
-%% decode_relative_oid({Name,Val}) -> CompleteList
-decode_relative_oid(Bytes) ->
-    {Len,Bytes2} = decode_length(Bytes,undefined),
-    {Octs,Bytes3} = getoctets_as_list(Bytes2,Len),
-    ObjVals = dec_subidentifiers(Octs,0,[]),
-    {list_to_tuple(ObjVals),Bytes3}.
-
-
-%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
-%% encode_real(Val) -> CompleteList
-%% encode_real({Name,Val}) -> CompleteList
-encode_real({Name,Val}) when is_atom(Name) ->
-    encode_real(Val);
-encode_real(Real) ->
-    {EncVal,Len} = ?RT_COMMON:encode_real([],Real),
-    [encode_length(undefined,Len),octets_to_complete(size(EncVal),EncVal)].
-
-
-%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
-%% decode_real(Val) -> {REALvalue,Rest}
-%% decode_real({Name,Val}) -> {REALvalue,Rest}
-decode_real(Bytes) ->
-    {Len,Bytes2} = decode_length(Bytes,undefined),
-    {RealVal,Rest,Len} = ?RT_COMMON:decode_real(Bytes2,Len),
-    {RealVal,Rest}.
-
-
-get_constraint([{Key,V}],Key) ->
-    V;
-get_constraint([],_) ->
-    no;
-get_constraint(C,Key) ->
-    case lists:keysearch(Key,1,C) of
-	false ->
-	    no;
-	{value,{_,V}} -> 
-	    V
-    end.
-
-
-%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
-%% complete(InList) -> ByteList
-%% Takes a coded list with bits and bytes and converts it to a list of bytes
-%% Should be applied as the last step at encode of a complete ASN.1 type
-%%
-
--ifdef(nodriver).
-
-complete(L) ->
-    erlang_complete(L).
-
--else.
-
-%% asn1-1.7
-complete(L) ->
-    case asn1rt_nif:encode_per_complete(L) of
-	{error, Reason} -> handle_error(Reason, L);
-	Else when is_binary(Else) -> Else
-    end.
-
-handle_error([],_)->
-    exit({error,{asn1,{"memory allocation problem in driver"}}});
-handle_error($1,L) -> % error in complete in driver
-    exit({error,{asn1,L}});
-handle_error(ErrL,L) ->
-    exit({error,{asn1,ErrL,L}}).
-
--endif.
-
-
-octets_to_complete(Len,Val) when Len < 256 ->
-    [20,Len,Val];
-octets_to_complete(Len,Val) ->
-    [21,<<Len:16>>,Val].
-
-octets_unused_to_complete(Unused,Len,Val) when Len < 256 ->
-    [30,Unused,Len,Val];
-octets_unused_to_complete(Unused,Len,Val) ->
-    [31,Unused,<<Len:16>>,Val].
diff --git a/lib/asn1/src/asn1rt_uper_bin.erl b/lib/asn1/src/asn1rt_uper_bin.erl
deleted file mode 100644
index fc65d80245..0000000000
--- a/lib/asn1/src/asn1rt_uper_bin.erl
+++ /dev/null
@@ -1,1487 +0,0 @@
-%%
-%% %CopyrightBegin%
-%% 
-%% Copyright Ericsson AB 2008-2010. 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(asn1rt_uper_bin).
-
-%% encoding / decoding of PER unaligned
-
--include("asn1_records.hrl").
-
-%%-compile(export_all).
-
--export([decode_fragmented/3]).
--export([setext/1, fixoptionals/3,
- 	 fixextensions/2, 
-	 skipextensions/3, getbit/1, getchoice/3 ]).
--export([set_choice/3, encode_integer/2, encode_integer/3]).
--export([encode_small_number/1, encode_boolean/1,
-	 encode_length/2,
-	 encode_small_length/1,
- 	 decode_compact_bit_string/3]).
--export([encode_bit_string/3, decode_bit_string/3  ]).
--export([encode_octet_string/2,
-	 encode_relative_oid/1, decode_relative_oid/1,
- 	 encode_object_identifier/1, decode_object_identifier/1,
-	 encode_real/1, decode_real/1,
- 	 complete/1, complete_NFP/1]).
-
-
- -export([encode_open_type/2, decode_open_type/2]).
-
- -export([encode_UniversalString/2, decode_UniversalString/2,
- 	 encode_PrintableString/2, decode_PrintableString/2,
- 	 encode_GeneralString/2, decode_GeneralString/2,
- 	 encode_GraphicString/2, decode_GraphicString/2,
- 	 encode_TeletexString/2, decode_TeletexString/2,
- 	 encode_VideotexString/2, decode_VideotexString/2,
- 	 encode_VisibleString/2, decode_VisibleString/2,
- 	 encode_UTF8String/1, decode_UTF8String/1,
- 	 encode_BMPString/2, decode_BMPString/2,
- 	 encode_IA5String/2, decode_IA5String/2,
- 	 encode_NumericString/2, decode_NumericString/2,
- 	 encode_ObjectDescriptor/2, decode_ObjectDescriptor/1
- 	]).
-
--define('16K',16384).
--define('32K',32768).
--define('64K',65536).
-
-
-%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
-%% setext(true|false) ->  CompleteList
-%%
-
-setext(false) ->
-    <<0:1>>;
-setext(true) ->
-    <<1:1>>.
-
-
-
-%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
-%% This is the new fixoptionals/3 which is used by the new generates
-%%
-fixoptionals(OptList,OptLength,Val) when is_tuple(Val) ->
-    Bits = fixoptionals(OptList,Val,0),
-    {Val,<<Bits:OptLength>>};
-
-fixoptionals([],_Val,Acc) ->
-    %% Optbits
-    Acc;
-fixoptionals([{Pos,DefVal}|Ot],Val,Acc) ->
-    case element(Pos,Val) of
-	asn1_DEFAULT -> fixoptionals(Ot,Val,Acc bsl 1);
-	DefVal -> fixoptionals(Ot,Val,Acc bsl 1);
-	_ -> fixoptionals(Ot,Val,(Acc bsl 1) + 1)
-    end;
-fixoptionals([Pos|Ot],Val,Acc) ->
-    case element(Pos,Val) of
-	asn1_NOVALUE -> fixoptionals(Ot,Val,Acc bsl 1);
-	asn1_DEFAULT -> fixoptionals(Ot,Val,Acc bsl 1);
-	_ -> fixoptionals(Ot,Val,(Acc bsl 1) + 1)
-    end.
-
-
-fixextensions({ext,ExtPos,ExtNum},Val) ->
-    case fixextensions(ExtPos,ExtNum+ExtPos,Val,0) of
-	0 -> [];
-	ExtBits ->
-	    [encode_small_length(ExtNum),<<ExtBits:ExtNum>>]
-    end.
-
-fixextensions(Pos,MaxPos,_,Acc) when Pos >= MaxPos ->
-    Acc;
-fixextensions(Pos,ExtPos,Val,Acc) ->
-    Bit = case catch(element(Pos+1,Val)) of
-	      asn1_NOVALUE ->
-		  0;
-	      asn1_NOEXTVALUE ->
-		  0;
-	      {'EXIT',_} ->
-		  0;
-	      _ ->
-		  1
-	  end,
-    fixextensions(Pos+1,ExtPos,Val,(Acc bsl 1)+Bit).
-
-skipextensions(Bytes,Nr,ExtensionBitstr) when is_bitstring(ExtensionBitstr) ->
-    Prev = Nr - 1,
-    case ExtensionBitstr of
-	<<_:Prev,1:1,_/bitstring>> ->
-	    {_,Bytes2} = decode_open_type(Bytes,[]),
-	    skipextensions(Bytes2, Nr+1, ExtensionBitstr);
-	<<_:Prev,0:1,_/bitstring>> ->
-	    skipextensions(Bytes, Nr+1, ExtensionBitstr);
-	_ ->
-	    Bytes
-    end.
-
-
-getchoice(Bytes,1,0) -> % only 1 alternative is not encoded
-    {0,Bytes};
-getchoice(Bytes,_,1) ->
-    decode_small_number(Bytes);
-getchoice(Bytes,NumChoices,0) ->
-    decode_constrained_number(Bytes,{0,NumChoices-1}).
-
-
-%% getbits_as_binary(Num,Bytes) -> {{Unused,BinBits},RestBytes},
-%% Num = integer(),
-%% Bytes = list() | tuple(),
-%% Unused = integer(),
-%% BinBits = binary(),
-%% RestBytes = tuple()
-getbits_as_binary(Num,Bytes) when is_bitstring(Bytes) ->
-    <<BS:Num/bitstring,Rest/bitstring>> = Bytes,
-    {BS,Rest}.
-
-getbits_as_list(Num,Bytes) when is_bitstring(Bytes) ->
-    <<BitStr:Num/bitstring,Rest/bitstring>> = Bytes,
-    {[ B || <<B:1>> <= BitStr],Rest}.
-
-getbit(Buffer) ->
-    <<B:1,Rest/bitstring>> = Buffer,
-    {B,Rest}.
-
-
-getbits(Buffer,Num) when is_bitstring(Buffer) ->
-    <<Bs:Num,Rest/bitstring>> = Buffer,
-    {Bs,Rest}.
-
-
-
-%% Pick the first Num octets.
-%% Returns octets as an integer with bit significance as in buffer.
-getoctets(Buffer,Num) when is_bitstring(Buffer) ->
-    <<Val:Num/integer-unit:8,RestBitStr/bitstring>> = Buffer,
-    {Val,RestBitStr}.
-
-%% Pick the first Num octets.
-%% Returns octets as a binary
-getoctets_as_bin(Bin,Num) when is_bitstring(Bin) ->
-    <<Octets:Num/binary,RestBin/bitstring>> = Bin,
-    {Octets,RestBin}.
-
-%% same as above but returns octets as a List
-getoctets_as_list(Buffer,Num) ->
-    {Bin,Buffer2} = getoctets_as_bin(Buffer,Num),
-    {binary_to_list(Bin),Buffer2}.
-%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
-%% set_choice(Alt,Choices,Altnum) -> ListofBitSettings
-%% Alt = atom()
-%% Altnum = integer() | {integer(),integer()}% number of alternatives
-%% Choices = [atom()] | {[atom()],[atom()]}
-%% When Choices is a tuple the first list is the Rootset and the
-%% second is the Extensions and then Altnum must also be a tuple with the
-%% lengths of the 2 lists 
-%%
-set_choice(Alt,{L1,L2},{Len1,_Len2}) ->
-    case set_choice_tag(Alt,L1) of
-	N when is_integer(N), Len1 > 1 ->
-	    [<<0:1>>, % the value is in the root set
-	     encode_integer([{'ValueRange',{0,Len1-1}}],N)];
-	N when is_integer(N) ->
-	    <<0:1>>; % no encoding if only 0 or 1 alternative
-	false ->
-	    [<<1:1>>, % extension value
-	     case set_choice_tag(Alt,L2) of
-		 N2 when is_integer(N2) ->
-		     encode_small_number(N2);
-		 false ->
-		     unknown_choice_alt
-	     end]
-    end;
-set_choice(Alt,L,Len) ->
-    case set_choice_tag(Alt,L) of
-	N when is_integer(N), Len > 1 ->
-	    encode_integer([{'ValueRange',{0,Len-1}}],N);
-	N when is_integer(N) ->
-	    []; % no encoding if only 0 or 1 alternative
-	false ->
-	    [unknown_choice_alt]
-    end.
-
-set_choice_tag(Alt,Choices) ->
-    set_choice_tag(Alt,Choices,0).
-
-set_choice_tag(Alt,[Alt|_Rest],Tag) ->
-    Tag;
-set_choice_tag(Alt,[_H|Rest],Tag) ->
-    set_choice_tag(Alt,Rest,Tag+1);
-set_choice_tag(_Alt,[],_Tag) ->
-    false.
-
-%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
-%% decode_fragmented_XXX; decode of values encoded fragmented according
-%% to ITU-T X.691 clause 10.9.3.8. The unit (XXX) is either bits, octets,
-%% characters or number of components (in a choice,sequence or similar).
-%% Buffer is a buffer {Used, Bin}.
-%% C is the constrained length.
-%% If the buffer is not aligned, this function does that.
-decode_fragmented_bits(Buffer,C) ->
-    decode_fragmented_bits(Buffer,C,[]).
-decode_fragmented_bits(<<3:2,Len:6,BitStr/bitstring>>,C,Acc) ->
-%%    {Value,Bin2} = split_binary(Bin, Len * ?'16K'),
-    FragLen = (Len*?'16K') div 8,
-    <<Value:FragLen/binary,BitStr2/bitstring>> = BitStr,
-    decode_fragmented_bits(BitStr2,C,[Value|Acc]);
-decode_fragmented_bits(<<0:1,0:7,BitStr/bitstring>>,C,Acc) ->
-    BinBits = list_to_binary(lists:reverse(Acc)),
-    case C of
-	Int when is_integer(Int),C == size(BinBits) ->
-	    {BinBits,BitStr};
-	Int when is_integer(Int) ->
-	    exit({error,{asn1,{illegal_value,C,BinBits}}})
-    end;
-decode_fragmented_bits(<<0:1,Len:7,BitStr/bitstring>>,C,Acc) ->
-    <<Val:Len/bitstring,Rest/bitstring>> = BitStr,
-%%    <<Value:Len/binary-unit:1,Bin2/binary>> = Bin,
-    ResBitStr = list_to_bitstring(lists:reverse([Val|Acc])),
-    case C of
-	Int when is_integer(Int),C == bit_size(ResBitStr) ->
-	    {ResBitStr,Rest};
-	Int when is_integer(Int) ->
-	    exit({error,{asn1,{illegal_value,C,ResBitStr}}})
-    end.
-
-    
-%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
-%% encode_open_type(Constraint, Value) -> CompleteList
-%% Value = list of bytes of an already encoded value (the list must be flat)
-%%         | binary
-%% Contraint = not used in this version
-%%
-encode_open_type(C, Val) when is_list(Val) ->
-    encode_open_type(C, list_to_binary(Val));
-encode_open_type(_C, Val) when is_binary(Val) ->
-    [encode_length(undefined,size(Val)),Val].
-
-
-%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
-%% decode_open_type(Buffer,Constraint) -> Value
-%% Constraint is not used in this version
-%% Buffer = [byte] with PER encoded data 
-%% Value = [byte] with decoded data (which must be decoded again as some type)
-%%
-decode_open_type(Bytes, _C) ->
-    {Len,Bytes2} = decode_length(Bytes,undefined),
-    getoctets_as_bin(Bytes2,Len).
-
-%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
-%% encode_integer(Constraint,Value,NamedNumberList) -> CompleteList
-%% encode_integer(Constraint,Value) -> CompleteList
-%% encode_integer(Constraint,{Name,Value}) -> CompleteList
-%% 
-%%
-encode_integer(C,V,NamedNumberList) when is_atom(V) ->
-    case lists:keysearch(V,1,NamedNumberList) of
-	{value,{_,NewV}} -> 
-	    encode_integer(C,NewV);
-	_ -> 
-	    exit({error,{asn1,{namednumber,V}}})
-    end;
-encode_integer(C,V,_NamedNumberList) when is_integer(V) ->
-    encode_integer(C,V);
-encode_integer(C,{Name,V},NamedNumberList) when is_atom(Name) ->
-    encode_integer(C,V,NamedNumberList).
-
-encode_integer(C,{Name,Val}) when is_atom(Name) ->
-    encode_integer(C,Val);
-
-encode_integer([{Rc,_Ec}],Val) when is_tuple(Rc) -> % XXX when is this invoked? First argument most often a list,...Ok this is the extension case...but it doesn't work.
-    case (catch encode_integer([Rc],Val)) of
-	{'EXIT',{error,{asn1,_}}} ->
-	    [<<1:1>>,encode_unconstrained_number(Val)];
-	Encoded ->
-	    [<<0:1>>,Encoded]
-    end;
-encode_integer(C,Val ) when is_list(C) ->
-    case get_constraint(C,'SingleValue') of
-	no ->
-	    encode_integer1(C,Val);
-	V when is_integer(V),V == Val ->
-	    []; % a type restricted to a single value encodes to nothing
-	V when is_list(V) ->
-	    case lists:member(Val,V) of
-		true ->
-		    encode_integer1(C,Val);
-		_ ->
-		    exit({error,{asn1,{illegal_value,Val}}})
-	    end;
-	_ ->
-	    exit({error,{asn1,{illegal_value,Val}}})
-    end.
-
-encode_integer1(C, Val) ->		    
-    case VR = get_constraint(C,'ValueRange') of
-	no ->
-	    encode_unconstrained_number(Val);
-	{Lb,'MAX'} ->
-	    encode_semi_constrained_number(Lb,Val);
-	%% positive with range
-	{Lb,Ub} when Val >= Lb,
-		     Ub >= Val ->
-	    encode_constrained_number(VR,Val);
-	_ ->
-	    exit({error,{asn1,{illegal_value,VR,Val}}})
-    end.
-
-%% X.691:10.6 Encoding of a normally small non-negative whole number
-%% Use this for encoding of CHOICE index if there is an extension marker in 
-%% the CHOICE
-encode_small_number({Name,Val}) when is_atom(Name) ->
-    encode_small_number(Val);
-encode_small_number(Val) when Val =< 63 ->
-    <<Val:7>>;
-encode_small_number(Val) ->
-    [<<1:1>>,encode_semi_constrained_number(0,Val)].
-
-decode_small_number(Bytes) ->
-    {Bit,Bytes2} = getbit(Bytes),
-    case Bit of
-	0 -> 
-	    getbits(Bytes2,6);
-	1 ->
-	    decode_semi_constrained_number(Bytes2)
-    end.
-
-%% X.691:10.7 Encoding of a semi-constrained whole number
-%% might be an optimization encode_semi_constrained_number(0,Val) ->
-encode_semi_constrained_number(C,{Name,Val}) when is_atom(Name) ->
-    encode_semi_constrained_number(C,Val);
-encode_semi_constrained_number({Lb,'MAX'},Val) ->
-    encode_semi_constrained_number(Lb,Val);
-encode_semi_constrained_number(Lb,Val) ->
-    %% encoding in minimum no of octets preceeded by a length
-    Val2 = Val - Lb,
-%%    NumBits = num_bits(Val2),
-    Bin = eint_bin_positive(Val2),
-    Size = size(Bin),
-    if 
-	Size < 128 ->
-	    [<<Size>>,Bin]; % equiv with encode_length(undefined,Len) but faster
-	Size < 16384 ->
-	    [<<2:2,Size:14>>,Bin];
-	true ->
-	    [encode_length(undefined,Size),Bin]
-    end.
-
-decode_semi_constrained_number(Bytes) ->
-    {Len,Bytes2} = decode_length(Bytes,undefined),
-    {V,Bytes3} = getoctets(Bytes2,Len),
-    {V,Bytes3}.
-
-encode_constrained_number(Range,{Name,Val}) when is_atom(Name) ->
-    encode_constrained_number(Range,Val);
-encode_constrained_number({Lb,Ub},Val) when Val >= Lb, Ub >= Val -> 
-    Range = Ub - Lb + 1,
-    Val2 = Val - Lb,
-    NumBits = num_bits(Range),
-    <<Val2:NumBits>>;
-encode_constrained_number(Range,Val) -> 
-    exit({error,{asn1,{integer_range,Range,value,Val}}}).
-
-
-decode_constrained_number(Buffer,{Lb,Ub}) ->
-    Range = Ub - Lb + 1,
-    NumBits = num_bits(Range),
-    {Val,Remain} = getbits(Buffer,NumBits),
-    {Val+Lb,Remain}.
-
-%% X.691:10.8 Encoding of an unconstrained whole number
-
-encode_unconstrained_number(Val) when Val >= 0 ->
-    Oct = eint_bin_2Cs(Val),
-    Len = size(Oct),
-    if 
-	Len < 128 ->
-	    [<<Len>>,Oct]; % equiv with encode_length(undefined,Len) but faster
-	Len < 16384 ->
-	    [<<2:2,Len:14>>,Oct];
-	true ->
-	    [encode_length(undefined,Len),<<Len:16>>,Oct]
-    end;
-encode_unconstrained_number(Val) -> % negative
-    Oct = enint(Val,[]),
-    Len = size(Oct),
-    if 
-	Len < 128 ->
-	    [<<Len>>,Oct]; % equiv with encode_length(undefined,Len) but faster
-	Len < 16384 ->
-	    [<<2:2,Len:14>>,Oct];
-	true ->
-	    [encode_length(undefined,Len),Oct]
-    end.
-
-
-eint_bin_2Cs(Int) ->
-    case eint_bin_positive(Int) of
-	Bin = <<B,_/binary>> when B > 16#7f ->
-	    <<0,Bin/binary>>;
-	Bin -> Bin
-    end.
-
-%% returns the integer as a binary
-eint_bin_positive(Val) when Val < 16#100  ->
-    <<Val>>;
-eint_bin_positive(Val) when Val < 16#10000 ->
-    <<Val:16>>;
-eint_bin_positive(Val) when Val < 16#1000000 ->
-    <<Val:24>>;
-eint_bin_positive(Val) when Val < 16#100000000 ->
-    <<Val:32>>;
-eint_bin_positive(Val) ->
-    list_to_binary([eint_bin_positive2(Val bsr 32)|<<Val:32>>]).
-eint_bin_positive2(Val) when Val < 16#100  ->
-    <<Val>>;
-eint_bin_positive2(Val) when Val < 16#10000 ->
-    <<Val:16>>;
-eint_bin_positive2(Val) when Val < 16#1000000 ->
-    <<Val:24>>;
-eint_bin_positive2(Val) when Val < 16#100000000 ->
-    <<Val:32>>;
-eint_bin_positive2(Val) ->
-    [eint_bin_positive2(Val bsr 32)|<<Val:32>>].
-
-
-
-
-enint(-1, [B1|T]) when B1 > 127 ->
-    list_to_binary([B1|T]);
-enint(N, Acc) ->
-    enint(N bsr 8, [N band 16#ff|Acc]).
-
-
-%% X.691:10.9 Encoding of a length determinant
-%%encode_small_length(undefined,Len) -> % null means no UpperBound
-%%    encode_small_number(Len).
-
-%% X.691:10.9.3.5 
-%% X.691:10.9.3.7
-encode_length(undefined,Len) -> % un-constrained
-    if 
-	Len < 128 ->
-	    <<Len>>;
-	Len < 16384 ->
-	    <<2:2,Len:14>>;
-	true  -> % should be able to endode length >= 16384
-	    error({error,{asn1,{encode_length,{nyi,above_16k}}}})
-    end;
-
-encode_length({0,'MAX'},Len) ->
-    encode_length(undefined,Len);
-encode_length(Vr={Lb,Ub},Len) when Ub =< 65535 ,Lb >= 0 -> % constrained
-    encode_constrained_number(Vr,Len);
-encode_length({Lb,_Ub},Len) when is_integer(Lb), Lb >= 0 -> % Ub > 65535
-    encode_length(undefined,Len);
-encode_length({Vr={Lb,Ub},Ext},Len) 
-  when Ub =< 65535 ,Lb >= 0, Len=<Ub, is_list(Ext) -> 
-    %% constrained extensible
-    [<<0:1>>,encode_constrained_number(Vr,Len)];
-encode_length({{Lb,_Ub},Ext},Len) when is_list(Ext) ->
-    [<<1:1>>,encode_semi_constrained_number(Lb,Len)];
-encode_length(SingleValue,_Len) when is_integer(SingleValue) ->
-    [].
-
-%% X.691 10.9.3.4 (only used for length of bitmap that prefixes extension 
-%% additions in a sequence or set
-encode_small_length(Len) when Len =< 64 ->
-    <<(Len-1):7>>;
-encode_small_length(Len) ->
-    [<<1:1>>,encode_length(undefined,Len)].
-
-
-%% un-constrained
-decode_length(<<0:1,Oct:7,Rest/bitstring>>,undefined)  ->
-    {Oct,Rest};
-decode_length(<<2:2,Val:14,Rest/bitstring>>,undefined)  ->
-    {Val,Rest};
-decode_length(<<3:2,_:14,_Rest/bitstring>>,undefined)  ->
-    exit({error,{asn1,{decode_length,{nyi,above_16k}}}});
-
-decode_length(Buffer,{Lb,Ub}) when Ub =< 65535 ,Lb >= 0 -> % constrained
-    decode_constrained_number(Buffer,{Lb,Ub});
-decode_length(Buffer,{Lb,_}) when is_integer(Lb), Lb >= 0 -> % Ub > 65535
-    decode_length(Buffer,undefined);
-decode_length(Buffer,{VR={_Lb,_Ub},Ext}) when is_list(Ext) ->
-    {0,Buffer2} = getbit(Buffer),
-    decode_length(Buffer2, VR);
-	
-
-%When does this case occur with {_,_Lb,Ub} ??
-% X.691:10.9.3.5 
-decode_length(Bin,{_,_Lb,_Ub}) -> %when Len =< 127 -> % Unconstrained or large Ub NOTE! this case does not cover case when Ub > 65535
-    case Bin of
-	<<0:1,Val:7,Rest/bitstring>> -> 
-	    {Val,Rest};
-	<<2:2,Val:14,Rest/bitstring>> -> 
-	    {Val,Rest};
-	<<3:2,_:14,_Rest/bitstring>> -> 
-	    exit({error,{asn1,{decode_length,{nyi,length_above_64K}}}})
-    end;
-decode_length(Buffer,SingleValue) when is_integer(SingleValue) ->
-    {SingleValue,Buffer}.
-
-
-						% X.691:11
-encode_boolean(true) ->
-    <<1:1>>;
-encode_boolean(false) ->
-    <<0:1>>;
-encode_boolean({Name,Val}) when is_atom(Name) ->
-    encode_boolean(Val);
-encode_boolean(Val) ->
-    exit({error,{asn1,{encode_boolean,Val}}}).
-
-
-%%============================================================================
-%%============================================================================
-%% Bitstring value, ITU_T X.690 Chapter 8.5
-%%============================================================================
-%%============================================================================
-
-%%============================================================================
-%% encode bitstring value
-%%============================================================================
-
-
-
-%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
-%% bitstring NamedBitList
-%% Val can be  of:
-%% - [identifiers] where only named identifers are set to one, 
-%%   the Constraint must then have some information of the 
-%%   bitlength.
-%% - [list of ones and zeroes] all bits 
-%% - integer value representing the bitlist
-%% C is constraint Len, only valid when identifiers
-
-
-%% when the value is a list of {Unused,BinBits}, where 
-%% Unused = integer(),
-%% BinBits = binary().
-
-encode_bit_string(C,Bin={Unused,BinBits},NamedBitList) when is_integer(Unused),
-							    is_binary(BinBits) ->
-    encode_bin_bit_string(get_constraint(C,'SizeConstraint'),Bin,NamedBitList);
-
-encode_bit_string(C, BitListVal, NamedBitList) ->
-    encode_bit_string1(get_constraint(C,'SizeConstraint'), BitListVal, NamedBitList).
-%% when the value is a list of named bits
-encode_bit_string1(C, LoNB=[FirstVal | _RestVal], NamedBitList) when is_atom(FirstVal) ->
-    ToSetPos = get_all_bitposes(LoNB, NamedBitList, []),
-    BitList = make_and_set_list(ToSetPos,0),
-    encode_bit_string1(C,BitList,NamedBitList);
-
-encode_bit_string1(C, BL=[{bit,_No} | _RestVal], NamedBitList) ->
-    ToSetPos = get_all_bitposes(BL, NamedBitList, []),
-    BitList = make_and_set_list(ToSetPos,0),
-    encode_bit_string1(C,BitList,NamedBitList);
-%% when the value is a list of ones and zeroes
-encode_bit_string1(Int, BitListValue, _) 
-  when is_list(BitListValue),is_integer(Int) ->
-    %% The type is constrained by a single value size constraint
-    bit_list2bitstr(Int,BitListValue);
-encode_bit_string1(no, BitListValue,[]) 
-  when is_list(BitListValue) ->
-    Len = length(BitListValue),
-    [encode_length(undefined,Len),bit_list2bitstr(Len,BitListValue)];
-encode_bit_string1(C, BitListValue,[]) 
-  when is_list(BitListValue) ->
-    Len = length(BitListValue),
-    [encode_length(C,Len),bit_list2bitstr(Len,BitListValue)];
-encode_bit_string1(no, BitListValue,_NamedBitList) 
-  when is_list(BitListValue) ->
-    %% this case with an unconstrained BIT STRING can be made more efficient
-    %% if the complete driver can take a special code so the length field
-    %% is encoded there.
-    NewBitLVal = lists:reverse(lists:dropwhile(fun(0)->true;(1)->false end,
-					    lists:reverse(BitListValue))),
-    Len = length(NewBitLVal),
-    [encode_length(undefined,Len),bit_list2bitstr(Len,NewBitLVal)];
-encode_bit_string1(C,BitListValue,_NamedBitList) 
-  when is_list(BitListValue) ->% C = {_,'MAX'}
-    NewBitStr = bitstr_trailing_zeros(BitListValue,C),
-    [encode_length(C,bit_size(NewBitStr)),NewBitStr];
-
-
-%% when the value is an integer
-encode_bit_string1(C, IntegerVal, NamedBitList) when is_integer(IntegerVal)->
-    BitList = int_to_bitlist(IntegerVal),
-    encode_bit_string1(C,BitList,NamedBitList);
-
-%% when the value is a tuple
-encode_bit_string1(C,{Name,Val}, NamedBitList) when is_atom(Name) ->
-    encode_bit_string1(C,Val,NamedBitList).
-
-bit_list2bitstr(Len,BitListValue) ->
-    case length(BitListValue) of
-	Len ->
-	    << <<B:1>> ||B <- BitListValue>>;
-	L when L > Len -> % truncate
-	    << << <<B:1>> ||B <- BitListValue>> :Len/bitstring>>;
-	L -> % Len > L -> pad
-	    << << <<B:1>> ||B <- BitListValue>>/bitstring ,0:(Len-L)>>
-	end.
-
-adjust_trailing_zeros(Len,Bin) when Len == bit_size(Bin) ->
-    Bin;
-adjust_trailing_zeros(Len,Bin) when Len > bit_size(Bin) ->
-    <<Bin/bitstring,0:(Len-bit_size(Bin))>>;
-adjust_trailing_zeros(Len,Bin) ->
-    <<Bin:Len/bitstring>>.
-
-bitstr_trailing_zeros(BitList,C) when is_integer(C) ->
-    bitstr_trailing_zeros1(BitList,C,C);
-bitstr_trailing_zeros(BitList,{Lb,Ub}) when is_integer(Lb) ->
-    bitstr_trailing_zeros1(BitList,Lb,Ub);
-bitstr_trailing_zeros(BitList,{{Lb,Ub},_}) when is_integer(Lb) ->
-    bitstr_trailing_zeros1(BitList,Lb,Ub);
-bitstr_trailing_zeros(BitList,_) ->
-    bit_list2bitstr(length(BitList),BitList).
-
-bitstr_trailing_zeros1(BitList,Lb,Ub) ->
-    case length(BitList) of
-	Lb -> bit_list2bitstr(Lb,BitList);
-	B when B<Lb -> bit_list2bitstr(Lb,BitList);
-	D -> F = fun(L,LB,LB,_,_)->bit_list2bitstr(LB,lists:reverse(L));
-		    ([0|R],L1,LB,UB,Fun)->Fun(R,L1-1,LB,UB,Fun);
-		    (L,L1,_,UB,_)when L1 =< UB -> 
-			 bit_list2bitstr(L1,lists:reverse(L));
-		    (_,_L1,_,_,_) ->exit({error,{list_length_BIT_STRING,
-						 BitList}}) end,
-	     F(lists:reverse(BitList),D,Lb,Ub,F)
-    end.
-
-%% encode_bin_bit_string/3, when value is a tuple of Unused and BinBits.
-%% Unused = integer(),i.e. number unused bits in least sign. byte of
-%% BinBits = binary().
-encode_bin_bit_string(C,{_,BinBits},_NamedBitList)
-  when is_integer(C),C=<16 ->
-    adjust_trailing_zeros(C,BinBits);
-encode_bin_bit_string(C,{_Unused,BinBits},_NamedBitList)
-  when is_integer(C) ->
-    adjust_trailing_zeros(C,BinBits);
-encode_bin_bit_string(C,UnusedAndBin={_,_},NamedBitList) ->
-    %% removes all trailing bits if NamedBitList is not empty
-    BitStr = remove_trailing_bin(NamedBitList,UnusedAndBin),
-    case C of
-	{Lb,Ub} when is_integer(Lb),is_integer(Ub) ->
-	    [encode_length({Lb,Ub},bit_size(BitStr)),BitStr];
-	no ->
-	    [encode_length(undefined,bit_size(BitStr)),BitStr];
-	Sc -> 
-	    [encode_length(Sc,bit_size(BitStr)),BitStr]
-    end.
-
-
-remove_trailing_bin([], {Unused,Bin}) ->
-    BS = bit_size(Bin)-Unused,
-    <<BitStr:BS/bitstring,_:Unused>> = Bin,
-    BitStr;
-remove_trailing_bin(_NamedNumberList,{_Unused,<<>>}) ->
-    <<>>;
-remove_trailing_bin(NamedNumberList, {_Unused,Bin}) ->
-    Size = size(Bin)-1,
-    <<Bfront:Size/binary, LastByte:8>> = Bin,
-
-    %% clear the Unused bits to be sure
-    Unused1 = trailingZeroesInNibble(LastByte band 15),
-    Unused2 = 
-	case Unused1 of 
-	    4 ->
-		4 + trailingZeroesInNibble(LastByte bsr 4);
-	    _ -> Unused1
-	end,
-    case Unused2 of
-	8 ->
-	    remove_trailing_bin(NamedNumberList,{0,Bfront});
-	_ ->
-	    BS = bit_size(Bin) - Unused2,
-	    <<BitStr:BS/bitstring,_:Unused2>> = Bin,
-	    BitStr
-    end.
-
-trailingZeroesInNibble(0) ->
-    4;
-trailingZeroesInNibble(1) ->
-    0;
-trailingZeroesInNibble(2) ->
-    1;
-trailingZeroesInNibble(3) ->
-    0;
-trailingZeroesInNibble(4) ->
-    2;
-trailingZeroesInNibble(5) ->
-    0;
-trailingZeroesInNibble(6) ->
-    1;
-trailingZeroesInNibble(7) ->
-    0;
-trailingZeroesInNibble(8) ->
-    3;
-trailingZeroesInNibble(9) ->
-    0;
-trailingZeroesInNibble(10) ->
-    1;
-trailingZeroesInNibble(11) ->
-    0;
-trailingZeroesInNibble(12) -> %#1100
-    2;
-trailingZeroesInNibble(13) ->
-    0;
-trailingZeroesInNibble(14) ->
-    1;
-trailingZeroesInNibble(15) ->
-    0.
-
-%%%%%%%%%%%%%%%
-%% The result is presented as a list of named bits (if possible)
-%% else as a tuple {Unused,Bits}. Unused is the number of unused
-%% bits, least significant bits in the last byte of Bits. Bits is
-%% the BIT STRING represented as a binary.
-%% 
-decode_compact_bit_string(Buffer, C, NamedNumberList) ->
-    case get_constraint(C,'SizeConstraint') of
-	0 -> % fixed length
-	    {{8,0},Buffer};
-	V when is_integer(V),V=<16 -> %fixed length 16 bits or less
-	    compact_bit_string(Buffer,V,NamedNumberList);
-	V when is_integer(V),V=<65536 -> %fixed length > 16 bits
-	    compact_bit_string(Buffer,V,NamedNumberList);
-	V when is_integer(V) -> % V > 65536 => fragmented value
-	    {Bin,Buffer2} = decode_fragmented_bits(Buffer,V),
-	    PadLen = (8 - (bit_size(Bin) rem 8)) rem 8,
-	    {{PadLen,<<Bin/bitstring,0:PadLen>>},Buffer2};
-%% 		{0,_} -> {{0,Bin},Buffer2};
-%% 		{U,_} -> {{8-U,Bin},Buffer2}
-	{Lb,Ub} when is_integer(Lb),is_integer(Ub) ->
-	    %% This case may demand decoding of fragmented length/value
-	    {Len,Bytes2} = decode_length(Buffer,{Lb,Ub}),
-	    compact_bit_string(Bytes2,Len,NamedNumberList);
-	no ->
-	    %% This case may demand decoding of fragmented length/value
-	    {Len,Bytes2} = decode_length(Buffer,undefined),
-	    compact_bit_string(Bytes2,Len,NamedNumberList);
-	Sc ->
-	    {Len,Bytes2} = decode_length(Buffer,Sc),
-	    compact_bit_string(Bytes2,Len,NamedNumberList)
-    end.
-
-
-%%%%%%%%%%%%%%%
-%% The result is presented as a list of named bits (if possible)
-%% else as a list of 0 and 1.
-%% 
-decode_bit_string(Buffer, C, NamedNumberList) ->
-    case get_constraint(C,'SizeConstraint') of
-	{Lb,Ub} when is_integer(Lb),is_integer(Ub) ->
-	    {Len,Bytes2} = decode_length(Buffer,{Lb,Ub}),
-	    bit_list_or_named(Bytes2,Len,NamedNumberList);
-	no ->
-	    {Len,Bytes2} = decode_length(Buffer,undefined),
-	    bit_list_or_named(Bytes2,Len,NamedNumberList);
-	0 -> % fixed length
-	    {[],Buffer}; % nothing to encode
-	V when is_integer(V),V=<16 -> % fixed length 16 bits or less
-	    bit_list_or_named(Buffer,V,NamedNumberList);
-	V when is_integer(V),V=<65536 ->
-	    bit_list_or_named(Buffer,V,NamedNumberList);
-	V when is_integer(V) ->
-	    {BinBits,_} = decode_fragmented_bits(Buffer,V),
-	    bit_list_or_named(BinBits,V,NamedNumberList);
-	Sc -> % extension marker
-	    {Len,Bytes2} = decode_length(Buffer,Sc),
-	    bit_list_or_named(Bytes2,Len,NamedNumberList)
-    end.
-
-
-%% if no named bits are declared we will return a
-%% {Unused,Bits}. Unused = integer(),
-%% Bits = binary().
-compact_bit_string(Buffer,Len,[]) ->
-    {BitStr,Rest} = getbits_as_binary(Len,Buffer), % {{Unused,BinBits},NewBuffer}
-    PadLen = (8 - (bit_size(BitStr) rem 8)) rem 8,
-    {{PadLen,<<BitStr/bitstring,0:PadLen>>},Rest};
-compact_bit_string(Buffer,Len,NamedNumberList) ->
-    bit_list_or_named(Buffer,Len,NamedNumberList).
-
-
-%% if no named bits are declared we will return a
-%% BitList = [0 | 1]
-
-bit_list_or_named(Buffer,Len,[]) ->
-    getbits_as_list(Len,Buffer);
-
-%% if there are named bits declared we will return a named
-%% BitList where the names are atoms and unnamed bits represented
-%% as {bit,Pos}
-%% BitList = [atom() | {bit,Pos}]
-%% Pos = integer()
-
-bit_list_or_named(Buffer,Len,NamedNumberList) ->
-    {BitList,Rest} = getbits_as_list(Len,Buffer),
-    {bit_list_or_named1(0,BitList,NamedNumberList,[]), Rest}.
-
-bit_list_or_named1(Pos,[0|Bt],Names,Acc) ->
-    bit_list_or_named1(Pos+1,Bt,Names,Acc);
-bit_list_or_named1(Pos,[1|Bt],Names,Acc) ->
-    case lists:keysearch(Pos,2,Names) of
-	{value,{Name,_}} ->
-	    bit_list_or_named1(Pos+1,Bt,Names,[Name|Acc]);
-	_  -> 
-	    bit_list_or_named1(Pos+1,Bt,Names,[{bit,Pos}|Acc])
-    end;
-bit_list_or_named1(_,[],_,Acc) ->
-    lists:reverse(Acc).
-
-
-
-%%%%%%%%%%%%%%%
-%% 
-
-int_to_bitlist(Int) when is_integer(Int), Int > 0 ->
-    [Int band 1 | int_to_bitlist(Int bsr 1)];
-int_to_bitlist(0) ->
-    [].
-
-
-%%%%%%%%%%%%%%%%%%
-%% get_all_bitposes([list of named bits to set], named_bit_db, []) ->
-%%   [sorted_list_of_bitpositions_to_set]
-
-get_all_bitposes([{bit,ValPos}|Rest], NamedBitList, Ack) ->
-    get_all_bitposes(Rest, NamedBitList, [ValPos | Ack ]);
-
-get_all_bitposes([Val | Rest], NamedBitList, Ack) ->
-    case lists:keysearch(Val, 1, NamedBitList) of
-	{value, {_ValName, ValPos}} ->
-	    get_all_bitposes(Rest, NamedBitList, [ValPos | Ack]);
-	_ ->
-	    exit({error,{asn1, {bitstring_namedbit, Val}}})
-    end;
-get_all_bitposes([], _NamedBitList, Ack) ->
-    lists:sort(Ack).
-
-%%%%%%%%%%%%%%%%%%
-%% make_and_set_list([list of positions to set to 1])->
-%% returns list with all in SetPos set.
-%% in positioning in list the first element is 0, the second 1 etc.., but
-%% 
-
-make_and_set_list([XPos|SetPos], XPos) ->
-    [1 | make_and_set_list(SetPos, XPos + 1)];
-make_and_set_list([Pos|SetPos], XPos) ->
-    [0 | make_and_set_list([Pos | SetPos], XPos + 1)];
-make_and_set_list([], _) ->
-    [].
-
-%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
-%% X.691:16
-%% encode_octet_string(Constraint,Val)
-%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
-
-encode_octet_string(C,{_Name,Val}) ->
-    encode_octet_string(C,Val);
-encode_octet_string(C,Val) ->
-    case get_constraint(C,'SizeConstraint') of
-	0 ->
-	    <<>>;
-	1 ->
-	    list_to_binary(Val);
-	2 ->
-	    list_to_binary(Val);
-	{_,_}=VR  ->
-	    try
-		[encode_length(VR, length(Val)),list_to_binary(Val)]
-	    catch
-		error:{error,{asn1,{encode_length,_}}} ->
-		    encode_fragmented_octet_string(Val)
-	    end;
-	Sv when is_integer(Sv), Sv =:= length(Val) -> % fixed length
-	    if
-		Sv =< 65535 ->
-		    list_to_binary(Val);
-		true ->
-		    encode_fragmented_octet_string(Val)
-	    end;
-	Sv when is_list(Sv) ->
-	    try
-		[encode_length({hd(Sv),lists:max(Sv)},
-			       length(Val)),list_to_binary(Val)]
-	    catch
-		error:{error,{asn1,{encode_length,_}}} ->
-		    encode_fragmented_octet_string(Val)
-	    end;
-	no  ->
-	    try
-		[encode_length(undefined, length(Val)),list_to_binary(Val)]
-	    catch
-		error:{error,{asn1,{encode_length,_}}} ->
-		    encode_fragmented_octet_string(Val)
-	    end
-    end.
-
-encode_fragmented_octet_string(Val) ->
-    Bin = list_to_binary(Val),
-    efos_1(Bin).
-
-efos_1(<<B:16#10000/binary,T/binary>>) ->
-    [<<3:2,4:6>>,B|efos_1(T)];
-efos_1(<<B:16#C000/binary,T/binary>>) ->
-    [<<3:2,3:6>>,B|efos_1(T)];
-efos_1(<<B:16#8000/binary,T/binary>>) ->
-    [<<3:2,2:6>>,B|efos_1(T)];
-efos_1(<<B:16#4000/binary,T/binary>>) ->
-    [<<3:2,1:6>>,B|efos_1(T)];
-efos_1(<<B/bitstring>>) ->
-    Len = byte_size(B),
-    [encode_length(undefined, Len),B].
-
-decode_fragmented(SegSz0, Buf0, Unit) ->
-    SegSz = SegSz0 * Unit * ?'16K',
-    <<Res:SegSz/bitstring,Buf/bitstring>> = Buf0,
-    decode_fragmented_1(Buf, Unit, Res).
-
-decode_fragmented_1(<<0:1,N:7,Buf0/bitstring>>, Unit, Res) ->
-    Sz = N*Unit,
-    <<S:Sz/bitstring,Buf/bitstring>> = Buf0,
-    {<<Res/bitstring,S/bitstring>>,Buf};
-decode_fragmented_1(<<1:1,0:1,N:14,Buf0/bitstring>>, Unit, Res) ->
-    Sz = N*Unit,
-    <<S:Sz/bitstring,Buf/bitstring>> = Buf0,
-    {<<Res/bitstring,S/bitstring>>,Buf};
-decode_fragmented_1(<<1:1,1:1,SegSz0:6,Buf0/bitstring>>, Unit, Res0) ->
-    SegSz = SegSz0 * Unit * ?'16K',
-    <<Frag:SegSz/bitstring,Buf/bitstring>> = Buf0,
-    Res = <<Res0/bitstring,Frag/bitstring>>,
-    decode_fragmented_1(Buf, Unit, Res).
-
-
-%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
-%% Restricted char string types 
-%% (NumericString, PrintableString,VisibleString,IA5String,BMPString,UniversalString)
-%% X.691:26 and X.680:34-36
-%%encode_restricted_string('BMPString',Constraints,Extension,Val)
-
-
-encode_restricted_string({Name,Val}) when is_atom(Name) ->
-    encode_restricted_string(Val);
-
-encode_restricted_string(Val) when is_list(Val)->
-    [encode_length(undefined,length(Val)),list_to_binary(Val)].
-
-encode_known_multiplier_string(StringType,C,{Name,Val}) when is_atom(Name) ->
-    encode_known_multiplier_string(StringType,C,Val);
-
-encode_known_multiplier_string(StringType,C,Val) ->
-    Result = chars_encode(C,StringType,Val),
-    NumBits = get_NumBits(C,StringType),
-    case get_constraint(C,'SizeConstraint') of
-	Ub when is_integer(Ub), Ub*NumBits =< 16  ->
-	    Result;
-	0 ->
-	    [];
-	Ub when is_integer(Ub),Ub =<65535 -> % fixed length
-	    Result;
-	{Ub,Lb} ->
-	    [encode_length({Ub,Lb},length(Val)),Result];
-	Vl when is_list(Vl) ->
-	    [encode_length({lists:min(Vl),lists:max(Vl)},length(Val)),Result];
-	no  ->
-	    [encode_length(undefined,length(Val)),Result]
-    end.
-
-decode_restricted_string(Bytes) ->
-    {Len,Bytes2} = decode_length(Bytes,undefined),
-    getoctets_as_list(Bytes2,Len).
-
-decode_known_multiplier_string(Bytes,StringType,C,_Ext) ->
-    NumBits = get_NumBits(C,StringType),
-    case get_constraint(C,'SizeConstraint') of
-	Ub when is_integer(Ub), Ub*NumBits =< 16  ->
-	    chars_decode(Bytes,NumBits,StringType,C,Ub);
-	Ub when is_integer(Ub),Ub =<65535 -> % fixed length
-	    chars_decode(Bytes,NumBits,StringType,C,Ub);
-	0 ->
-	    {[],Bytes};
-	Vl when is_list(Vl) ->
-	    {Len,Bytes1} = decode_length(Bytes,{hd(Vl),lists:max(Vl)}),
-	    chars_decode(Bytes1,NumBits,StringType,C,Len);
-	no  ->
-	    {Len,Bytes1} = decode_length(Bytes,undefined),
-	    chars_decode(Bytes1,NumBits,StringType,C,Len);
-	{Lb,Ub}->
-	    {Len,Bytes1} = decode_length(Bytes,{Lb,Ub}),
-	    chars_decode(Bytes1,NumBits,StringType,C,Len)
-    end.
-
-
-encode_NumericString(C,Val) ->
-    encode_known_multiplier_string('NumericString',C,Val).
-decode_NumericString(Bytes,C) ->
-    decode_known_multiplier_string(Bytes,'NumericString',C,false).
-
-encode_PrintableString(C,Val) ->
-    encode_known_multiplier_string('PrintableString',C,Val).
-decode_PrintableString(Bytes,C) ->
-    decode_known_multiplier_string(Bytes,'PrintableString',C,false).
-
-encode_VisibleString(C,Val) -> % equivalent with ISO646String
-    encode_known_multiplier_string('VisibleString',C,Val).
-decode_VisibleString(Bytes,C) ->
-    decode_known_multiplier_string(Bytes,'VisibleString',C,false).
-
-encode_IA5String(C,Val) ->
-    encode_known_multiplier_string('IA5String',C,Val).
-decode_IA5String(Bytes,C) ->
-    decode_known_multiplier_string(Bytes,'IA5String',C,false).
-
-encode_BMPString(C,Val) ->
-    encode_known_multiplier_string('BMPString',C,Val).
-decode_BMPString(Bytes,C) ->
-    decode_known_multiplier_string(Bytes,'BMPString',C,false).
-
-encode_UniversalString(C,Val) ->
-    encode_known_multiplier_string('UniversalString',C,Val).
-decode_UniversalString(Bytes,C) ->
-    decode_known_multiplier_string(Bytes,'UniversalString',C,false).
-
-    
-%% end of known-multiplier strings for which PER visible constraints are
-%% applied
-
-encode_GeneralString(_C,Val) ->
-    encode_restricted_string(Val).
-decode_GeneralString(Bytes,_C) ->
-    decode_restricted_string(Bytes).
-
-encode_GraphicString(_C,Val) ->
-    encode_restricted_string(Val).
-decode_GraphicString(Bytes,_C) ->
-    decode_restricted_string(Bytes).
-
-encode_ObjectDescriptor(_C,Val) ->
-    encode_restricted_string(Val).
-decode_ObjectDescriptor(Bytes) ->
-    decode_restricted_string(Bytes).
-
-encode_TeletexString(_C,Val) -> % equivalent with T61String
-    encode_restricted_string(Val).
-decode_TeletexString(Bytes,_C) ->
-    decode_restricted_string(Bytes).
-
-encode_VideotexString(_C,Val) ->
-    encode_restricted_string(Val).
-decode_VideotexString(Bytes,_C) ->
-    decode_restricted_string(Bytes).
-
-
-
-
-%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
-%% getBMPChars(Bytes,Len) ->{BMPcharList,RemainingBytes}
-%%
-getBMPChars(Bytes,1) ->
-    {O1,Bytes2} = getbits(Bytes,8),
-    {O2,Bytes3} = getbits(Bytes2,8),
-    if 
-	O1 == 0 ->
-	    {[O2],Bytes3};
-	true ->
-	    {[{0,0,O1,O2}],Bytes3}
-    end;
-getBMPChars(Bytes,Len) ->
-    getBMPChars(Bytes,Len,[]).
-
-getBMPChars(Bytes,0,Acc) ->
-    {lists:reverse(Acc),Bytes};
-getBMPChars(Bytes,Len,Acc) ->
-    {Octs,Bytes1} = getoctets_as_list(Bytes,2),
-    case Octs of
-	[0,O2] ->
-	    getBMPChars(Bytes1,Len-1,[O2|Acc]);
-	[O1,O2]->
-	    getBMPChars(Bytes1,Len-1,[{0,0,O1,O2}|Acc])
-    end.
-
-
-%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
-%% chars_encode(C,StringType,Value) -> ValueList
-%%
-%% encodes chars according to the per rules taking the constraint PermittedAlphabet 
-%% into account.
-%% This function does only encode the value part and NOT the length
-
-chars_encode(C,StringType,Value) ->
-    case {StringType,get_constraint(C,'PermittedAlphabet')} of
-	{'UniversalString',{_,_Sv}} ->
-	    exit({error,{asn1,{'not implemented',"UniversalString with PermittedAlphabet constraint"}}});
-	{'BMPString',{_,_Sv}} ->
-	    exit({error,{asn1,{'not implemented',"BMPString with PermittedAlphabet constraint"}}});
-	_ ->
-	    {NumBits,CharOutTab} = {get_NumBits(C,StringType),get_CharOutTab(C,StringType)}, 
-	    chars_encode2(Value,NumBits,CharOutTab)
-    end.
-
-chars_encode2([H|T],NumBits,{Min,Max,notab}) when  H =< Max, H >= Min ->
-    %%[{bits,NumBits,H-Min}|chars_encode2(T,NumBits,{Min,Max,notab})];
-    [<<(H-Min):NumBits>>|chars_encode2(T,NumBits,{Min,Max,notab})];
-chars_encode2([H|T],NumBits,{Min,Max,Tab}) when H =< Max, H >= Min ->
-%%    [{bits,NumBits,exit_if_false(H,element(H-Min+1,Tab))}|chars_encode2(T,NumBits,{Min,Max,Tab})];
-    Ch = exit_if_false(H,element(H-Min+1,Tab)),
-    [<<Ch:NumBits>>|chars_encode2(T,NumBits,{Min,Max,Tab})];
-chars_encode2([{A,B,C,D}|T],NumBits,{Min,Max,notab}) -> 
-    %% no value range check here (ought to be, but very expensive)
-%%    [{bits,NumBits,((((((A bsl 8)+B) bsl 8)+C) bsl 8)+D)-Min}|chars_encode2(T,NumBits,{Min,Max,notab})];
-    Ch = ((((((A bsl 8)+B) bsl 8)+C) bsl 8)+D)-Min,
-    [<<Ch:NumBits>>|chars_encode2(T,NumBits,{Min,Max,notab})];
-chars_encode2([{A,B,C,D}|T],NumBits,{Min,Max,Tab}) -> 
-    %% no value range check here (ought to be, but very expensive)
-%%    [{bits,NumBits,exit_if_false({A,B,C,D},element(((((((A bsl 8)+B) bsl 8)+C) bsl 8)+D)-Min,Tab))}|chars_encode2(T,NumBits,{Min,Max,notab})];
-    Ch = exit_if_false({A,B,C,D},element(((((((A bsl 8)+B) bsl 8)+C) bsl 8)+D)-Min,Tab)),
-    [<<Ch:NumBits>>|chars_encode2(T,NumBits,{Min,Max,notab})];
-chars_encode2([H|_T],_,{_,_,_}) ->
-    exit({error,{asn1,{illegal_char_value,H}}});
-chars_encode2([],_,_) ->
-    [].
-
-exit_if_false(V,false)->
-    exit({error,{asn1,{"illegal value according to Permitted alphabet constraint",V}}});
-exit_if_false(_,V) ->V.
-
-
-get_NumBits(C,StringType) ->
-    case get_constraint(C,'PermittedAlphabet') of
-	{'SingleValue',Sv} ->
-	    charbits(length(Sv));
-	no ->
-	    case StringType of
-		'IA5String' ->
-		    charbits(128); % 16#00..16#7F
-		'VisibleString' ->
-		    charbits(95); % 16#20..16#7E
-		'PrintableString' ->
-		    charbits(74); % [$\s,$',$(,$),$+,$,,$-,$.,$/,"0123456789",$:,$=,$?,$A..$Z,$a..$z
-		'NumericString' ->
-		    charbits(11); % $ ,"0123456789"
-		'UniversalString' ->
-		    32;
-		'BMPString' ->
-		    16
-	    end
-    end.
-
-get_CharOutTab(C,StringType) ->
-    get_CharTab(C,StringType,out).
-
-get_CharInTab(C,StringType) ->
-    get_CharTab(C,StringType,in).
-
-get_CharTab(C,StringType,InOut) ->
-    case get_constraint(C,'PermittedAlphabet') of
-	{'SingleValue',Sv} ->
-	    get_CharTab2(C,StringType,hd(Sv),lists:max(Sv),Sv,InOut);
-	no ->
-	    case StringType of
-		'IA5String' ->
-		    {0,16#7F,notab};
-		'VisibleString' ->
-		    get_CharTab2(C,StringType,16#20,16#7F,notab,InOut);
-		'PrintableString' ->
-		    Chars = lists:sort(
-			      " '()+,-./0123456789:=?ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz"),
-		    get_CharTab2(C,StringType,hd(Chars),lists:max(Chars),Chars,InOut);
-		'NumericString' ->
-		    get_CharTab2(C,StringType,16#20,$9," 0123456789",InOut);
-		'UniversalString' ->
-		    {0,16#FFFFFFFF,notab};
-		'BMPString' ->
-		    {0,16#FFFF,notab}
-	    end
-    end.
-
-get_CharTab2(C,StringType,Min,Max,Chars,InOut) ->
-    BitValMax = (1 bsl get_NumBits(C,StringType))-1,
-    if
-	Max =< BitValMax ->
-	    {0,Max,notab};
-	true ->
-	    case InOut of
-		out ->
-		    {Min,Max,create_char_tab(Min,Chars)};
-		in  ->
-		    {Min,Max,list_to_tuple(Chars)}
-	    end
-    end.
-
-create_char_tab(Min,L) ->
-    list_to_tuple(create_char_tab(Min,L,0)).
-create_char_tab(Min,[Min|T],V) ->
-    [V|create_char_tab(Min+1,T,V+1)];
-create_char_tab(_Min,[],_V) ->
-    [];
-create_char_tab(Min,L,V) ->
-    [false|create_char_tab(Min+1,L,V)].
-
-%% See Table 20.3 in Dubuisson
-charbits(NumOfChars) when NumOfChars =< 2 -> 1;
-charbits(NumOfChars) when NumOfChars =< 4 -> 2;
-charbits(NumOfChars) when NumOfChars =< 8 -> 3;
-charbits(NumOfChars) when NumOfChars =< 16 -> 4;
-charbits(NumOfChars) when NumOfChars =< 32 -> 5;
-charbits(NumOfChars) when NumOfChars =< 64 -> 6;
-charbits(NumOfChars) when NumOfChars =< 128 -> 7;
-charbits(NumOfChars) when NumOfChars =< 256 -> 8;
-charbits(NumOfChars) when NumOfChars =< 512 -> 9;
-charbits(NumOfChars) when NumOfChars =< 1024 -> 10;
-charbits(NumOfChars) when NumOfChars =< 2048 -> 11;
-charbits(NumOfChars) when NumOfChars =< 4096 -> 12;
-charbits(NumOfChars) when NumOfChars =< 8192 -> 13;
-charbits(NumOfChars) when NumOfChars =< 16384 -> 14;
-charbits(NumOfChars) when NumOfChars =< 32768 -> 15;
-charbits(NumOfChars) when NumOfChars =< 65536 -> 16;
-charbits(NumOfChars) when is_integer(NumOfChars) ->
-    16 + charbits1(NumOfChars bsr 16).
-
-charbits1(0) ->
-    0;
-charbits1(NumOfChars) ->
-    1 + charbits1(NumOfChars bsr 1).
-
-
-chars_decode(Bytes,_,'BMPString',C,Len) ->
-    case get_constraint(C,'PermittedAlphabet') of
-	no ->
-	    getBMPChars(Bytes,Len);
-	_ ->
-	    exit({error,{asn1,
-			 {'not implemented',
-			  "BMPString with PermittedAlphabet constraint"}}})
-    end;
-chars_decode(Bytes,NumBits,StringType,C,Len) ->	
-    CharInTab = get_CharInTab(C,StringType),
-    chars_decode2(Bytes,CharInTab,NumBits,Len).
-
-
-chars_decode2(Bytes,CharInTab,NumBits,Len) ->
-    chars_decode2(Bytes,CharInTab,NumBits,Len,[]).
-
-chars_decode2(Bytes,_CharInTab,_NumBits,0,Acc) ->
-    {lists:reverse(Acc),Bytes};
-chars_decode2(Bytes,{Min,Max,notab},NumBits,Len,Acc) when NumBits > 8 ->
-    {Char,Bytes2} = getbits(Bytes,NumBits),
-    Result = 
-	if
-	    Char < 256 -> Char;
-	    true ->
-		list_to_tuple(binary_to_list(<<Char:32>>))
-	end,
-    chars_decode2(Bytes2,{Min,Max,notab},NumBits,Len -1,[Result|Acc]);
-chars_decode2(Bytes,{Min,Max,notab},NumBits,Len,Acc) ->
-    {Char,Bytes2} = getbits(Bytes,NumBits),
-    chars_decode2(Bytes2,{Min,Max,notab},NumBits,Len -1,[Char+Min|Acc]);
-
-%% BMPString and UniversalString with PermittedAlphabet is currently not supported
-chars_decode2(Bytes,{Min,Max,CharInTab},NumBits,Len,Acc) ->
-    {Char,Bytes2} = getbits(Bytes,NumBits),
-    chars_decode2(Bytes2,{Min,Max,CharInTab},NumBits,Len -1,[element(Char+1,CharInTab)|Acc]).
-
-
-%% UTF8String
-encode_UTF8String(Val) when is_binary(Val) ->
-    [encode_length(undefined,size(Val)),Val];
-encode_UTF8String(Val) ->
-    Bin = list_to_binary(Val),
-    encode_UTF8String(Bin).
-
-decode_UTF8String(Bytes) ->
-    {Len,Bytes2} = decode_length(Bytes,undefined),
-    getoctets_as_bin(Bytes2,Len).
-    
-
-%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
-%% encode_object_identifier(Val) -> CompleteList
-%% encode_object_identifier({Name,Val}) -> CompleteList
-%% Val -> {Int1,Int2,...,IntN} % N >= 2
-%% Name -> atom()
-%% Int1 -> integer(0..2)
-%% Int2 -> integer(0..39) when Int1 (0..1) else integer()
-%% Int3-N -> integer()
-%% CompleteList -> [binary()|bitstring()|list()]
-%%
-encode_object_identifier({Name,Val}) when is_atom(Name) ->
-    encode_object_identifier(Val);
-encode_object_identifier(Val) ->
-    OctetList = e_object_identifier(Val),
-    Octets = list_to_binary(OctetList), % performs a flatten at the same time
-    [encode_length(undefined,size(Octets)),Octets].
-
-%% This code is copied from asn1_encode.erl (BER) and corrected and modified 
-
-e_object_identifier({'OBJECT IDENTIFIER',V}) ->
-    e_object_identifier(V);
-e_object_identifier({Cname,V}) when is_atom(Cname),is_tuple(V) ->
-    e_object_identifier(tuple_to_list(V));
-e_object_identifier({Cname,V}) when is_atom(Cname),is_list(V) ->
-    e_object_identifier(V);
-e_object_identifier(V) when is_tuple(V) ->
-    e_object_identifier(tuple_to_list(V));
-
-%% E1 = 0|1|2 and (E2 < 40 when E1 = 0|1) 
-e_object_identifier([E1,E2|Tail]) when E1 >= 0, E1 < 2, E2 < 40 ; E1==2 ->
-    Head = 40*E1 + E2,  % weird
-    e_object_elements([Head|Tail],[]);
-e_object_identifier(Oid=[_,_|_Tail]) ->
-    exit({error,{asn1,{'illegal_value',Oid}}}).
-
-e_object_elements([],Acc) ->
-    lists:reverse(Acc);
-e_object_elements([H|T],Acc) ->
-    e_object_elements(T,[e_object_element(H)|Acc]).
-
-e_object_element(Num) when Num < 128 ->
-    [Num];
-e_object_element(Num) ->
-    [e_o_e(Num bsr 7)|[Num band 2#1111111]].
-e_o_e(Num) when Num < 128 ->
-    Num bor 2#10000000;
-e_o_e(Num) ->
-    [e_o_e(Num bsr 7)|[(Num band 2#1111111) bor 2#10000000]].
-
-
-
-%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
-%% decode_object_identifier(Bytes) -> {ObjId,RemainingBytes}
-%% ObjId -> {integer(),integer(),...} % at least 2 integers
-%% RemainingBytes -> [integer()] when integer() (0..255)
-decode_object_identifier(Bytes) ->
-    {Len,Bytes2} = decode_length(Bytes,undefined),
-    {Octs,Bytes3} = getoctets_as_list(Bytes2,Len),
-    [First|Rest] = dec_subidentifiers(Octs,0,[]),
-    Idlist = if
-		 First < 40 ->
-		     [0,First|Rest];
-		 First < 80 ->
-		     [1,First - 40|Rest];
-		 true ->
-		     [2,First - 80|Rest]
-	     end,
-    {list_to_tuple(Idlist),Bytes3}.
-
-dec_subidentifiers([H|T],Av,Al) when H >=16#80 ->
-    dec_subidentifiers(T,(Av bsl 7) + (H band 16#7F),Al);
-dec_subidentifiers([H|T],Av,Al) ->
-    dec_subidentifiers(T,0,[(Av bsl 7) + H |Al]);
-dec_subidentifiers([],_Av,Al) ->
-    lists:reverse(Al).
-
-%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
-%% encode_relative_oid(Val) -> CompleteList
-%% encode_relative_oid({Name,Val}) -> CompleteList
-encode_relative_oid({Name,Val}) when is_atom(Name) ->
-    encode_relative_oid(Val);
-encode_relative_oid(Val) when is_tuple(Val) ->
-    encode_relative_oid(tuple_to_list(Val));
-encode_relative_oid(Val) when is_list(Val) ->
-    Octets = list_to_binary([e_object_element(X)||X <- Val]),
-    [encode_length(undefined,size(Octets)),Octets].
-    
-    
-%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
-%% decode_relative_oid(Val) -> CompleteList
-%% decode_relative_oid({Name,Val}) -> CompleteList
-decode_relative_oid(Bytes) ->
-    {Len,Bytes2} = decode_length(Bytes,undefined),
-    {Octs,Bytes3} = getoctets_as_list(Bytes2,Len),
-    ObjVals = dec_subidentifiers(Octs,0,[]),
-    {list_to_tuple(ObjVals),Bytes3}.
-
-
-%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
-%% encode_real(Val) -> CompleteList
-%% encode_real({Name,Val}) -> CompleteList
-encode_real({Name,Val}) when is_atom(Name) ->
-    encode_real(Val);
-encode_real(Real) ->
-    {EncVal,Len} = ?RT_COMMON:encode_real([],Real),
-    [encode_length(undefined,Len),EncVal].
-
-
-%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
-%% decode_real(Val) -> {REALvalue,Rest}
-%% decode_real({Name,Val}) -> {REALvalue,Rest}
-decode_real(Bytes) ->
-    {Len,Bytes2} = decode_length(Bytes,undefined),
-    <<Bytes3:Len/binary,Rest/bitstring>> = Bytes2,
-    {RealVal,Rest,Len} = ?RT_COMMON:decode_real(Bytes3,Len),
-    {RealVal,Rest}.
-
-
-get_constraint([{Key,V}],Key) ->
-    V;
-get_constraint([],_Key) ->
-    no;
-get_constraint(C,Key) ->
-    case lists:keysearch(Key,1,C) of
-	false ->
-	    no;
-	{value,{_,V}} -> 
-	    V
-    end.
-
-%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
-%% complete(InList) -> ByteList
-%% Takes a coded list with bits and bytes and converts it to a list of bytes
-%% Should be applied as the last step at encode of a complete ASN.1 type
-%%
-complete(InList) when is_list(InList) ->
-    case complete1(InList) of
-	<<>> ->
-	    <<0>>;
-	Res ->
-	    case bit_size(Res) band 7 of
-		0 -> Res;
-		Bits -> <<Res/bitstring,0:(8-Bits)>>
-	end
-    end;
-complete(InList) when is_binary(InList) ->
-    InList;
-complete(InList) when is_bitstring(InList) ->
-    PadLen = 8 - (bit_size(InList) band 7),
-    <<InList/bitstring,0:PadLen>>.
-
-complete1(L) when is_list(L) ->
-    list_to_bitstring(L).
-
-%% Special version of complete that does not align the completed message.
-complete_NFP(InList) when is_list(InList) ->
-    list_to_bitstring(InList);
-complete_NFP(InList) when is_bitstring(InList) ->
-    InList.
-
-%% unaligned helpers
-
-%% 10.5.6 NOTE: If "range" satisfies the inequality 2^m < "range" =<
-%% 2^(m+1) then the number of bits = m + 1
-
-num_bits(N) ->
-    num_bits(N,1,0).
-num_bits(N,T,B) when N=<T->B;
-num_bits(N,T,B) ->num_bits(N,T bsl 1, B+1).