%%
%% %CopyrightBegin%
%%
%% Copyright Ericsson AB 1996-2018. All Rights Reserved.
%%
%% Licensed under the Apache License, Version 2.0 (the "License");
%% you may not use this file except in compliance with the License.
%% You may obtain a copy of the License at
%%
%% http://www.apache.org/licenses/LICENSE-2.0
%%
%% Unless required by applicable law or agreed to in writing, software
%% distributed under the License is distributed on an "AS IS" BASIS,
%% WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
%% See the License for the specific language governing permissions and
%% limitations under the License.
%%
%% %CopyrightEnd%
%%
-module(ets_SUITE).
-export([all/0, suite/0,groups/0,init_per_suite/1, end_per_suite/1,
init_per_group/2,end_per_group/2]).
-export([default/1,setbag/1,badnew/1,verybadnew/1,named/1,keypos2/1,
privacy/1]).
-export([empty/1,badinsert/1]).
-export([time_lookup/1,badlookup/1,lookup_order/1]).
-export([delete_elem/1,delete_tab/1,delete_large_tab/1,
delete_large_named_table/1,
evil_delete/1,baddelete/1,match_delete/1,table_leak/1]).
-export([match_delete3/1]).
-export([firstnext/1,firstnext_concurrent/1]).
-export([slot/1]).
-export([match1/1, match2/1, match_object/1, match_object2/1]).
-export([dups/1, misc1/1, safe_fixtable/1, info/1, tab2list/1]).
-export([tab2file/1, tab2file2/1, tabfile_ext1/1,
tabfile_ext2/1, tabfile_ext3/1, tabfile_ext4/1, badfile/1]).
-export([heavy_lookup/1, heavy_lookup_element/1, heavy_concurrent/1]).
-export([lookup_element_mult/1]).
-export([foldl_ordered/1, foldr_ordered/1, foldl/1, foldr/1, fold_empty/1]).
-export([t_delete_object/1, t_init_table/1, t_whitebox/1,
select_bound_chunk/1,
t_delete_all_objects/1, t_insert_list/1, t_test_ms/1,
t_select_delete/1,t_select_replace/1,t_select_replace_next_bug/1,t_ets_dets/1]).
-export([ordered/1, ordered_match/1, interface_equality/1,
fixtable_next/1, fixtable_insert/1, rename/1, rename_unnamed/1, evil_rename/1,
update_element/1, update_counter/1, evil_update_counter/1, partly_bound/1, match_heavy/1]).
-export([update_counter_with_default/1]).
-export([update_counter_table_growth/1]).
-export([member/1]).
-export([memory/1]).
-export([select_fail/1]).
-export([t_insert_new/1]).
-export([t_repair_continuation/1]).
-export([t_match_spec_run/1]).
-export([t_bucket_disappears/1]).
-export([t_named_select/1]).
-export([otp_5340/1]).
-export([otp_6338/1]).
-export([otp_6842_select_1000/1]).
-export([otp_7665/1]).
-export([meta_wb/1]).
-export([grow_shrink/1, grow_pseudo_deleted/1, shrink_pseudo_deleted/1]).
-export([meta_lookup_unnamed_read/1, meta_lookup_unnamed_write/1,
meta_lookup_named_read/1, meta_lookup_named_write/1,
meta_newdel_unnamed/1, meta_newdel_named/1]).
-export([smp_insert/1, smp_fixed_delete/1, smp_unfix_fix/1, smp_select_delete/1,
smp_ordered_iteration/1,
smp_select_replace/1, otp_8166/1, otp_8732/1, delete_unfix_race/1]).
-export([throughput_benchmark/0, test_throughput_benchmark/1]).
-export([exit_large_table_owner/1,
exit_many_large_table_owner/1,
exit_many_tables_owner/1,
exit_many_many_tables_owner/1]).
-export([write_concurrency/1, heir/1, give_away/1, setopts/1]).
-export([bad_table/1, types/1]).
-export([otp_9932/1]).
-export([otp_9423/1]).
-export([otp_10182/1]).
-export([ets_all/1]).
-export([massive_ets_all/1]).
-export([take/1]).
-export([whereis_table/1]).
-export([init_per_testcase/2, end_per_testcase/2]).
%% Convenience for manual testing
-export([random_test/0]).
-export([t_select_reverse/1]).
-include_lib("stdlib/include/ms_transform.hrl"). % ets:fun2ms
-include_lib("common_test/include/ct.hrl").
-define(m(A,B), assert_eq(A,B)).
-define(heap_binary_size, 64).
init_per_testcase(Case, Config) ->
rand:seed(exsplus),
io:format("*** SEED: ~p ***\n", [rand:export_seed()]),
start_spawn_logger(),
wait_for_test_procs(), %% Ensure previous case cleaned up
[{test_case, Case} | Config].
end_per_testcase(_Func, _Config) ->
wait_for_test_procs(true).
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
suite() ->
[{ct_hooks,[ts_install_cth]},
{timetrap,{minutes,5}}].
all() ->
[{group, new}, {group, insert}, {group, lookup},
{group, delete}, firstnext, firstnext_concurrent, slot,
{group, match}, t_match_spec_run,
{group, lookup_element}, {group, misc}, {group, files},
{group, heavy}, ordered, ordered_match,
interface_equality, fixtable_next, fixtable_insert,
rename, rename_unnamed, evil_rename, update_element,
update_counter, evil_update_counter,
update_counter_with_default, partly_bound,
update_counter_table_growth,
match_heavy, {group, fold}, member, t_delete_object,
select_bound_chunk,
t_init_table, t_whitebox, t_delete_all_objects,
t_insert_list, t_test_ms, t_select_delete, t_select_replace,
t_select_replace_next_bug,
t_ets_dets, memory, t_select_reverse, t_bucket_disappears,
t_named_select,
select_fail, t_insert_new, t_repair_continuation,
otp_5340, otp_6338, otp_6842_select_1000, otp_7665,
otp_8732, meta_wb, grow_shrink, grow_pseudo_deleted,
shrink_pseudo_deleted, {group, meta_smp}, smp_insert,
smp_fixed_delete, smp_unfix_fix, smp_select_replace,
smp_ordered_iteration,
smp_select_delete, otp_8166, exit_large_table_owner,
exit_many_large_table_owner, exit_many_tables_owner,
exit_many_many_tables_owner, write_concurrency, heir,
give_away, setopts, bad_table, types,
otp_10182,
otp_9932,
otp_9423,
ets_all,
massive_ets_all,
take,
whereis_table,
delete_unfix_race,
test_throughput_benchmark].
groups() ->
[{new, [],
[default, setbag, badnew, verybadnew, named, keypos2,
privacy]},
{insert, [], [empty, badinsert]},
{lookup, [], [time_lookup, badlookup, lookup_order]},
{lookup_element, [], [lookup_element_mult]},
{delete, [],
[delete_elem, delete_tab, delete_large_tab,
delete_large_named_table, evil_delete, table_leak,
baddelete, match_delete, match_delete3]},
{match, [],
[match1, match2, match_object, match_object2]},
{misc, [],
[misc1, safe_fixtable, info, dups, tab2list]},
{files, [],
[tab2file, tab2file2, tabfile_ext1,
tabfile_ext2, tabfile_ext3, tabfile_ext4, badfile]},
{heavy, [],
[heavy_lookup, heavy_lookup_element, heavy_concurrent]},
{fold, [],
[foldl_ordered, foldr_ordered, foldl, foldr,
fold_empty]},
{meta_smp, [],
[meta_lookup_unnamed_read, meta_lookup_unnamed_write,
meta_lookup_named_read, meta_lookup_named_write,
meta_newdel_unnamed, meta_newdel_named]}].
init_per_suite(Config) ->
erts_debug:set_internal_state(available_internal_state, true),
erts_debug:set_internal_state(ets_force_trap, true),
Config.
end_per_suite(_Config) ->
stop_spawn_logger(),
erts_debug:set_internal_state(ets_force_trap, false),
catch erts_debug:set_internal_state(available_internal_state, false),
ok.
init_per_group(_GroupName, Config) ->
Config.
end_per_group(_GroupName, Config) ->
Config.
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%% Test that a disappearing bucket during select of a non-fixed table works.
t_bucket_disappears(Config) when is_list(Config) ->
repeat_for_opts(fun t_bucket_disappears_do/1).
t_bucket_disappears_do(Opts) ->
EtsMem = etsmem(),
ets_new(abcd, [named_table, public, {keypos, 2} | Opts]),
ets:insert(abcd, {abcd,1,2}),
ets:insert(abcd, {abcd,2,2}),
ets:insert(abcd, {abcd,3,2}),
{_, Cont} = ets:select(abcd, [{{'_', '$1', '_'},
[{'<', '$1', {const, 10}}],
['$1']}], 1),
ets:delete(abcd, 2),
ets:select(Cont),
true = ets:delete(abcd),
verify_etsmem(EtsMem).
%% OTP-21: Test that select/1 fails if named table was deleted and recreated
%% and succeeds if table was renamed.
t_named_select(_Config) ->
repeat_for_opts(fun t_named_select_do/1).
t_named_select_do(Opts) ->
EtsMem = etsmem(),
T = t_name_tid_select,
ets_new(T, [named_table | Opts]),
ets:insert(T, {1,11}),
ets:insert(T, {2,22}),
ets:insert(T, {3,33}),
MS = [{{'$1', 22}, [], ['$1']}],
{[2], Cont1} = ets:select(T, MS, 1),
ets:delete(T),
{'EXIT',{badarg,_}} = (catch ets:select(Cont1)),
ets_new(T, [named_table | Opts]),
{'EXIT',{badarg,_}} = (catch ets:select(Cont1)),
true = ets:insert_new(T, {1,22}),
true = ets:insert_new(T, {2,22}),
true = ets:insert_new(T, {4,22}),
{[A,B], Cont2} = ets:select(T, MS, 2),
ets:rename(T, abcd),
{[C], '$end_of_table'} = ets:select(Cont2),
7 = A + B + C,
true = ets:delete(abcd),
verify_etsmem(EtsMem).
%% Check ets:match_spec_run/2.
t_match_spec_run(Config) when is_list(Config) ->
ct:timetrap({minutes,30}), %% valgrind needs a lot
init_externals(),
EtsMem = etsmem(),
t_match_spec_run_test([{1},{2},{3}],
[{{'$1'},[{'>','$1',1}],['$1']}],
[2,3]),
Huge = [{X} || X <- lists:seq(1,2500)],
L = lists:seq(2476,2500),
t_match_spec_run_test(Huge, [{{'$1'},[{'>','$1',2475}],['$1']}], L),
L2 = [{X*16#FFFFFFF} || X <- L],
t_match_spec_run_test(Huge,
[{{'$1'}, [{'>','$1',2475}], [{{{'*','$1',16#FFFFFFF}}}]}],
L2),
t_match_spec_run_test(Huge, [{{'$1'}, [{'=:=',{'rem','$1',500},0}], ['$1']}],
[500,1000,1500,2000,2500]),
%% More matching fun with several match clauses and guards,
%% applied to a variety of terms.
Fun = fun(Term) ->
CTerm = {const, Term},
N_List = [{Term, "0", "v-element"},
{"=hidden_node", "0", Term},
{"0", Term, Term},
{"something", Term, "something else"},
{"guard and res", Term, 872346},
{Term, {'and',Term,'again'}, 3.14},
{Term, {'and',Term,'again'}, "m&g"},
{Term, {'and',Term,'again'}, "m&g&r"},
{[{second,Term}, 'and', "tail"], Term, ['and',"tail"]}],
N_MS = [{{'$1','$2','$3'},
[{'=:=','$1',CTerm}, {'=:=','$2',{const,"0"}}],
[{{"Guard only for $1",'$3'}}]},
{{'$3','$1','$4'},
[{'=:=','$3',"=hidden_node"}, {'=:=','$1',{const,"0"}}],
[{{"Result only for $4",'$4'}}]},
{{'$2','$1','$1'},
[{'=:=','$2',{const,"0"}}],
[{{"Match only for $1",'$2'}}]},
{{'$2',Term,['$3'|'_']},
[{is_list,'$2'},{'=:=','$3',$s}],
[{{"Matching term",'$2'}}]},
{{'$1','$2',872346},
[{'=:=','$2',CTerm}, {is_list,'$1'}],
[{{"Guard and result",'$2'}}]},
{{'$1', {'and','$1','again'}, '$2'},
[{is_float,'$2'}],
[{{"Match and result",'$1'}}]},
{{'$1', {'and','$1','again'}, '$2'},
[{'=:=','$1',CTerm}, {'=:=', '$2', "m&g"}],
[{{"Match and guard",'$2'}}]},
{{'$1', {'and','$1','again'}, "m&g&r"},
[{'=:=','$1',CTerm}],
[{{"Match, guard and result",'$1'}}]},
{{'$1', '$2', '$3'},
[{'=:=','$1',[{{second,'$2'}} | '$3']}],
[{{"Building guard"}}]}
],
N_Result = [{"Guard only for $1", "v-element"},
{"Result only for $4", Term},
{"Match only for $1", "0"},
{"Matching term","something"},
{"Guard and result",Term},
{"Match and result",Term},
{"Match and guard","m&g"},
{"Match, guard and result",Term},
{"Building guard"}],
F = fun(N_MS_Perm) ->
t_match_spec_run_test(N_List, N_MS_Perm, N_Result)
end,
repeat_for_permutations(F, N_MS)
end,
test_terms(Fun, skip_refc_check),
verify_etsmem(EtsMem).
t_match_spec_run_test(List, MS, Result) ->
%%io:format("ms = ~p\n",[MS]),
?m(Result, ets:match_spec_run(List, ets:match_spec_compile(MS))),
%% Check that ets:select agree
Tab = ets:new(xxx, [bag]),
ets:insert(Tab, List),
SRes = lists:sort(Result),
?m(SRes, lists:sort(ets:select(Tab, MS))),
ets:delete(Tab),
%% Check that tracing agree
Self = self(),
{Tracee, MonRef} = my_spawn_monitor(fun() -> ms_tracee(Self, List) end),
receive {Tracee, ready} -> ok end,
MST = lists:map(fun(Clause) -> ms_clause_ets_to_trace(Clause) end, MS),
%%io:format("MS = ~p\nMST= ~p\n",[MS,MST]),
erlang:trace_pattern({?MODULE,ms_tracee_dummy,'_'}, MST , [local]),
erlang:trace(Tracee, true, [call]),
Tracee ! start,
TRes = ms_tracer_collect(Tracee, MonRef, []),
case TRes of
SRes -> ok;
_ ->
io:format("TRACE MATCH FAILED\n"),
io:format("Input = ~p\nMST = ~p\nExpected = ~p\nGot = ~p\n", [List, MST, SRes, TRes]),
ct:fail("TRACE MATCH FAILED")
end,
ok.
ms_tracer_collect(Tracee, Ref, Acc) ->
receive
{trace, Tracee, call, _Args, [Msg]} ->
ms_tracer_collect(Tracee, Ref, [Msg | Acc]);
{'DOWN', Ref, process, Tracee, _} ->
TDRef = erlang:trace_delivered(Tracee),
ms_tracer_collect(Tracee, TDRef, Acc);
{trace_delivered, Tracee, Ref} ->
lists:sort(Acc);
Other ->
io:format("Unexpected message = ~p\n", [Other]),
ct:fail("Unexpected tracer msg")
end.
ms_tracee(Parent, CallArgList) ->
Parent ! {self(), ready},
receive start -> ok end,
F = fun({A1}) ->
ms_tracee_dummy(A1);
({A1,A2}) ->
ms_tracee_dummy(A1, A2);
({A1,A2,A3}) ->
ms_tracee_dummy(A1, A2, A3);
({A1,A2,A3,A4}) ->
ms_tracee_dummy(A1, A2, A3, A4)
end,
lists:foreach(F, CallArgList).
ms_tracee_dummy(_) -> ok.
ms_tracee_dummy(_,_) -> ok.
ms_tracee_dummy(_,_,_) -> ok.
ms_tracee_dummy(_,_,_,_) -> ok.
ms_clause_ets_to_trace({Head, Guard, Body}) ->
{tuple_to_list(Head), Guard, [{message, Body}]}.
assert_eq(A,A) -> ok;
assert_eq(A,B) ->
io:format("FAILED MATCH:\n~p\n =/=\n~p\n",[A,B]),
ct:fail("assert_eq failed").
%% Test ets:repair_continuation/2.
t_repair_continuation(Config) when is_list(Config) ->
repeat_for_opts(fun t_repair_continuation_do/1).
t_repair_continuation_do(Opts) ->
EtsMem = etsmem(),
MS = [{'_',[],[true]}],
MS2 = [{{{'$1','_'},'_'},[],['$1']}],
(fun() ->
T = ets_new(x,[ordered_set|Opts]),
F = fun(0,_)->ok;(N,F) -> ets:insert(T,{N,N}), F(N-1,F) end,
F(1000,F),
{_,C} = ets:select(T,MS,5),
C2 = erlang:setelement(5,C,<<>>),
{'EXIT',{badarg,_}} = (catch ets:select(C2)),
C3 = ets:repair_continuation(C2,MS),
{[true,true,true,true,true],_} = ets:select(C3),
{[true,true,true,true,true],_} = ets:select(C),
true = ets:delete(T)
end)(),
(fun() ->
T = ets_new(x,[ordered_set|Opts]),
F = fun(0,_)->ok;(N,F) -> ets:insert(T,{N,N}), F(N-1,F) end,
F(1000,F),
{_,C} = ets:select(T,MS,1001),
C = '$end_of_table',
C3 = ets:repair_continuation(C,MS),
'$end_of_table' = ets:select(C3),
'$end_of_table' = ets:select(C),
true = ets:delete(T)
end)(),
(fun() ->
T = ets_new(x,[ordered_set|Opts]),
F = fun(0,_)->ok;(N,F) ->
ets:insert(T,{integer_to_list(N),N}),
F(N-1,F)
end,
F(1000,F),
{_,C} = ets:select(T,MS,5),
C2 = erlang:setelement(5,C,<<>>),
{'EXIT',{badarg,_}} = (catch ets:select(C2)),
C3 = ets:repair_continuation(C2,MS),
{[true,true,true,true,true],_} = ets:select(C3),
{[true,true,true,true,true],_} = ets:select(C),
true = ets:delete(T)
end)(),
(fun() ->
T = ets_new(x,[ordered_set|Opts]),
F = fun(0,_)->ok;(N,F) ->
ets:insert(T,{{integer_to_list(N),N},N}),
F(N-1,F)
end,
F(1000,F),
{_,C} = ets:select(T,MS2,5),
C2 = erlang:setelement(5,C,<<>>),
{'EXIT',{badarg,_}} = (catch ets:select(C2)),
C3 = ets:repair_continuation(C2,MS2),
{[_,_,_,_,_],_} = ets:select(C3),
{[_,_,_,_,_],_} = ets:select(C),
true = ets:delete(T)
end)(),
(fun() ->
T = ets_new(x,[set|Opts]),
F = fun(0,_)->ok;(N,F) ->
ets:insert(T,{N,N}),
F(N-1,F)
end,
F(1000,F),
{_,C} = ets:select(T,MS,5),
C2 = erlang:setelement(4,C,<<>>),
{'EXIT',{badarg,_}} = (catch ets:select(C2)),
C3 = ets:repair_continuation(C2,MS),
{[true,true,true,true,true],_} = ets:select(C3),
{[true,true,true,true,true],_} = ets:select(C),
true = ets:delete(T)
end)(),
(fun() ->
T = ets_new(x,[set|Opts]),
F = fun(0,_)->ok;(N,F) ->
ets:insert(T,{integer_to_list(N),N}),
F(N-1,F)
end,
F(1000,F),
{_,C} = ets:select(T,MS,5),
C2 = erlang:setelement(4,C,<<>>),
{'EXIT',{badarg,_}} = (catch ets:select(C2)),
C3 = ets:repair_continuation(C2,MS),
{[true,true,true,true,true],_} = ets:select(C3),
{[true,true,true,true,true],_} = ets:select(C),
true = ets:delete(T)
end)(),
(fun() ->
T = ets_new(x,[bag|Opts]),
F = fun(0,_)->ok;(N,F) ->
ets:insert(T,{integer_to_list(N),N}),
F(N-1,F)
end,
F(1000,F),
{_,C} = ets:select(T,MS,5),
C2 = erlang:setelement(4,C,<<>>),
{'EXIT',{badarg,_}} = (catch ets:select(C2)),
C3 = ets:repair_continuation(C2,MS),
{[true,true,true,true,true],_} = ets:select(C3),
{[true,true,true,true,true],_} = ets:select(C),
true = ets:delete(T)
end)(),
(fun() ->
T = ets_new(x,[duplicate_bag|Opts]),
F = fun(0,_)->ok;(N,F) ->
ets:insert(T,{integer_to_list(N),N}),
F(N-1,F)
end,
F(1000,F),
{_,C} = ets:select(T,MS,5),
C2 = erlang:setelement(4,C,<<>>),
{'EXIT',{badarg,_}} = (catch ets:select(C2)),
C3 = ets:repair_continuation(C2,MS),
{[true,true,true,true,true],_} = ets:select(C3),
{[true,true,true,true,true],_} = ets:select(C),
true = ets:delete(T)
end)(),
false = ets:is_compiled_ms(<<>>),
true = ets:is_compiled_ms(ets:match_spec_compile(MS)),
verify_etsmem(EtsMem).
%% Test correct default vaules of a new ets table.
default(Config) when is_list(Config) ->
%% Default should be set,protected
EtsMem = etsmem(),
Def = ets_new(def,[]),
set = ets:info(Def,type),
protected = ets:info(Def,protection),
Compressed = erlang:system_info(ets_always_compress),
Compressed = ets:info(Def,compressed),
Self = self(),
Self = ets:info(Def,owner),
none = ets:info(Def, heir),
false = ets:info(Def,named_table),
ets:delete(Def),
verify_etsmem(EtsMem).
%% Test that select fails even if nothing can match.
select_fail(Config) when is_list(Config) ->
EtsMem = etsmem(),
repeat_for_opts(fun select_fail_do/1,
[all_types,write_concurrency]),
verify_etsmem(EtsMem).
select_fail_do(Opts) ->
T = ets_new(x,Opts),
ets:insert(T,{a,a}),
case (catch
ets:select(T,[{{a,'_'},[],[{snuffla}]}])) of
{'EXIT',{badarg,_}} ->
ok;
Else0 ->
exit({type,ets:info(T,type),
expected,'EXIT',got,Else0})
end,
case (catch
ets:select(T,[{{b,'_'},[],[{snuffla}]}])) of
{'EXIT',{badarg,_}} ->
ok;
Else1 ->
exit({type,ets:info(T,type),
expected,'EXIT',got,Else1})
end,
ets:delete(T).
-define(S(T),ets:info(T,memory)).
%% Whitebox test of ets:info(X, memory).
memory(Config) when is_list(Config) ->
ok = chk_normal_tab_struct_size(),
repeat_for_opts(fun memory_do/1, [compressed]),
catch erts_debug:set_internal_state(available_internal_state, false).
memory_do(Opts) ->
L = [T1,T2,T3,T4] = fill_sets_int(1000,Opts),
XR1 = case mem_mode(T1) of
{normal,_} -> {13836, 15346, 15346, 15346+6};
{compressed,4} -> {11041, 12551, 12551, 12551+1};
{compressed,8} -> {10050, 11560, 11560, 11560}
end,
XRes1 = adjust_xmem(L, XR1, 1),
Res1 = {?S(T1),?S(T2),?S(T3),?S(T4)},
lists:foreach(fun(T) ->
Before = ets:info(T,size),
Key = 2, %894, %%ets:first(T),
Objs = ets:lookup(T,Key),
ets:delete(T,Key),
io:format("deleted key ~p from ~p changed size ~p to ~p: ~p\n",
[Key, ets:info(T,type), Before, ets:info(T,size), Objs])
end,
L),
XR2 = case mem_mode(T1) of
{normal,_} -> {13826, 15337, 15337-9, 15337-3};
{compressed,4} -> {11031, 12542, 12542-9, 12542-8};
{compressed,8} -> {10040, 11551, 11551-9, 11551-9}
end,
XRes2 = adjust_xmem(L, XR2, 1),
Res2 = {?S(T1),?S(T2),?S(T3),?S(T4)},
lists:foreach(fun(T) ->
Before = ets:info(T,size),
Key = 4, %802, %ets:first(T),
Objs = ets:lookup(T,Key),
ets:match_delete(T,{Key,'_'}),
io:format("match_deleted key ~p from ~p changed size ~p to ~p: ~p\n",
[Key, ets:info(T,type), Before, ets:info(T,size), Objs])
end,
L),
XR3 = case mem_mode(T1) of
{normal,_} -> {13816, 15328, 15328-18, 15328-12};
{compressed,4} -> {11021, 12533, 12533-18, 12533-17};
{compressed,8} -> {10030, 11542, 11542-18, 11542-18}
end,
XRes3 = adjust_xmem(L, XR3, 1),
Res3 = {?S(T1),?S(T2),?S(T3),?S(T4)},
lists:foreach(fun(T) ->
ets:delete_all_objects(T)
end,
L),
XRes4 = adjust_xmem(L, {50, 256, 256, 256}, 0),
Res4 = {?S(T1),?S(T2),?S(T3),?S(T4)},
lists:foreach(fun(T) ->
ets:delete(T)
end,
L),
L2 = [T11,T12,T13,T14] = fill_sets_int(1000),
lists:foreach(fun(T) ->
ets:select_delete(T,[{'_',[],[true]}])
end,
L2),
XRes5 = adjust_xmem(L2, {50, 256, 256, 256}, 0),
Res5 = {?S(T11),?S(T12),?S(T13),?S(T14)},
io:format("XRes1 = ~p~n"
" Res1 = ~p~n~n"
"XRes2 = ~p~n"
" Res2 = ~p~n~n"
"XRes3 = ~p~n"
" Res3 = ~p~n~n"
"XRes4 = ~p~n"
" Res4 = ~p~n~n"
"XRes5 = ~p~n"
" Res5 = ~p~n~n",
[XRes1, Res1,
XRes2, Res2,
XRes3, Res3,
XRes4, Res4,
XRes5, Res5]),
XRes1 = Res1,
XRes2 = Res2,
XRes3 = Res3,
XRes4 = Res4,
XRes5 = Res5,
ok.
mem_mode(T) ->
{case ets:info(T,compressed) of
true -> compressed;
false -> normal
end,
erlang:system_info(wordsize)}.
chk_normal_tab_struct_size() ->
System = {os:type(),
os:version(),
erlang:system_info(wordsize),
erlang:system_info(smp_support),
erlang:system_info(heap_type)},
io:format("System = ~p~n", [System]),
ok.
adjust_xmem([_T1,_T2,_T3,_T4], {A0,B0,C0,D0} = _Mem0, EstCnt) ->
%% Adjust for 64-bit, smp, and os:
%% Table struct size may differ.
{TabSz, EstSz} = erts_debug:get_internal_state('DbTable_words'),
HTabSz = TabSz + EstCnt*EstSz,
{A0+TabSz, B0+HTabSz, C0+HTabSz, D0+HTabSz}.
%% Misc. whitebox tests
t_whitebox(Config) when is_list(Config) ->
EtsMem = etsmem(),
repeat_for_opts(fun whitebox_1/1),
repeat_for_opts(fun whitebox_1/1),
repeat_for_opts(fun whitebox_1/1),
repeat_for_opts(fun whitebox_2/1),
repeat_for_opts(fun whitebox_2/1),
repeat_for_opts(fun whitebox_2/1),
verify_etsmem(EtsMem).
whitebox_1(Opts) ->
T=ets_new(x,[bag | Opts]),
ets:insert(T,[{du,glade},{ta,en}]),
ets:insert(T,[{hej,hopp2},{du,glade2},{ta,en2}]),
{_,C}=ets:match(T,{ta,'$1'},1),
ets:select(C),
ets:match(C),
ets:delete(T),
ok.
whitebox_2(Opts) ->
T=ets_new(x,[ordered_set, {keypos,2} | Opts]),
T2=ets_new(x,[set, {keypos,2}| Opts]),
0 = ets:select_delete(T,[{{hej},[],[true]}]),
0 = ets:select_delete(T,[{{hej,hopp},[],[true]}]),
0 = ets:select_delete(T2,[{{hej},[],[true]}]),
0 = ets:select_delete(T2,[{{hej,hopp},[],[true]}]),
ets:delete(T),
ets:delete(T2),
ok.
select_bound_chunk(_Config) ->
repeat_for_opts(fun select_bound_chunk_do/1, [all_types]).
select_bound_chunk_do(Opts) ->
T = ets_new(x, Opts),
ets:insert(T, [{key, 1}]),
{[{key, 1}], '$end_of_table'} = ets:select(T, [{{key,1},[],['$_']}], 100000),
ok.
%% Test ets:to/from_dets.
t_ets_dets(Config) when is_list(Config) ->
repeat_for_opts(fun(Opts) -> t_ets_dets(Config,Opts) end).
t_ets_dets(Config, Opts) ->
Fname = gen_dets_filename(Config,1),
(catch file:delete(Fname)),
{ok,DTab} = dets:open_file(testdets_1,
[{file, Fname}]),
ETab = ets_new(x,Opts),
filltabint(ETab,3000),
DTab = ets:to_dets(ETab,DTab),
ets:delete_all_objects(ETab),
0 = ets:info(ETab,size),
true = ets:from_dets(ETab,DTab),
3000 = ets:info(ETab,size),
ets:delete(ETab),
check_badarg(catch ets:to_dets(ETab,DTab),
ets, to_dets, [ETab,DTab]),
check_badarg(catch ets:from_dets(ETab,DTab),
ets, from_dets, [ETab,DTab]),
ETab2 = ets_new(x,Opts),
filltabint(ETab2,3000),
dets:close(DTab),
check_badarg(catch ets:to_dets(ETab2,DTab),
ets, to_dets, [ETab2,DTab]),
check_badarg(catch ets:from_dets(ETab2,DTab),
ets, from_dets, [ETab2,DTab]),
ets:delete(ETab2),
(catch file:delete(Fname)),
ok.
check_badarg({'EXIT', {badarg, [{M,F,Args,_} | _]}}, M, F, Args) ->
true;
check_badarg({'EXIT', {badarg, [{M,F,A,_} | _]}}, M, F, Args) ->
true = test_server:is_native(M) andalso length(Args) =:= A.
%% Test ets:delete_all_objects/1.
t_delete_all_objects(Config) when is_list(Config) ->
EtsMem = etsmem(),
repeat_for_opts_all_set_table_types(fun t_delete_all_objects_do/1),
verify_etsmem(EtsMem).
get_kept_objects(T) ->
case ets:info(T,stats) of
{_,_,_,_,_,_,KO} ->
KO;
_ ->
0
end.
t_delete_all_objects_do(Opts) ->
KeyRange = 4000,
T=ets_new(x, Opts, KeyRange),
filltabint(T,KeyRange),
O=ets:first(T),
ets:next(T,O),
ets:safe_fixtable(T,true),
true = ets:delete_all_objects(T),
'$end_of_table' = ets:next(T,O),
0 = ets:info(T,size),
case ets:info(T,type) of
ordered_set -> ok;
_ -> KeyRange = get_kept_objects(T)
end,
ets:safe_fixtable(T,false),
0 = ets:info(T,size),
0 = get_kept_objects(T),
filltabint(T, KeyRange),
KeyRange = ets:info(T,size),
true = ets:delete_all_objects(T),
0 = ets:info(T,size),
ets:delete(T),
%% Test delete_all_objects is atomic
T2 = ets_new(t_delete_all_objects, [public | Opts]),
Self = self(),
Inserters = [spawn_link(fun() -> inserter(T2, 100*1000, 1, Self) end) || _ <- [1,2,3,4]],
[receive {Ipid, running} -> ok end || Ipid <- Inserters],
ets:delete_all_objects(T2),
erlang:yield(),
[Ipid ! stop || Ipid <- Inserters],
Result = [receive {Ipid, stopped, Highest} -> {Ipid,Highest} end || Ipid <- Inserters],
%% Verify unbroken sequences of objects inserted _after_ ets:delete_all_objects.
Sum = lists:foldl(fun({Ipid, Highest}, AccSum) ->
%% ets:fun2ms(fun({{K,Ipid}}) when K =< Highest -> true end),
AliveMS = [{{{'$1',Ipid}},[{'=<','$1',{const,Highest}}],[true]}],
Alive = ets:select_count(T2, AliveMS),
Lowest = Highest - (Alive-1),
%% ets:fun2ms(fun({{K,Ipid}}) when K < Lowest -> true end)
DeletedMS = [{{{'$1',Ipid}},[{'<','$1',{const,Lowest}}],[true]}],
0 = ets:select_count(T2, DeletedMS),
AccSum + Alive
end,
0,
Result),
ok = case ets:info(T2, size) of
Sum -> ok;
Size ->
io:format("Sum = ~p\nSize = ~p\n", [Sum, Size]),
{Sum,Size}
end,
ets:delete(T2).
inserter(_, 0, _, _) ->
ok;
inserter(T, N, Next, Papa) ->
case Next of
10*1000 ->
Papa ! {self(), running};
_ ->
ok
end,
ets:insert(T, {{Next, self()}}),
receive
stop ->
Papa ! {self(), stopped, Next},
ok
after 0 ->
inserter(T, N-1, Next+1, Papa)
end.
%% Test ets:delete_object/2.
t_delete_object(Config) when is_list(Config) ->
EtsMem = etsmem(),
repeat_for_opts(fun t_delete_object_do/1),
verify_etsmem(EtsMem).
t_delete_object_do(Opts) ->
T = ets_new(x,Opts),
filltabint(T,4000),
del_one_by_one_set(T,1,4001),
filltabint(T,4000),
del_one_by_one_set(T,4000,0),
filltabint(T,4000),
First = ets:first(T),
Next = ets:next(T,First),
ets:safe_fixtable(T,true),
ets:delete_object(T,{First, integer_to_list(First)}),
Next = ets:next(T,First),
3999 = ets:info(T,size),
1 = get_kept_objects(T),
ets:safe_fixtable(T,false),
3999 = ets:info(T,size),
0 = get_kept_objects(T),
ets:delete(T),
T1 = ets_new(x,[ordered_set | Opts]),
filltabint(T1,4000),
del_one_by_one_set(T1,1,4001),
filltabint(T1,4000),
del_one_by_one_set(T1,4000,0),
ets:delete(T1),
T2 = ets_new(x,[bag | Opts]),
filltabint2(T2,4000),
del_one_by_one_bag(T2,1,4001),
filltabint2(T2,4000),
del_one_by_one_bag(T2,4000,0),
ets:delete(T2),
T3 = ets_new(x,[duplicate_bag | Opts]),
filltabint3(T3,4000),
del_one_by_one_dbag_1(T3,1,4001),
filltabint3(T3,4000),
del_one_by_one_dbag_1(T3,4000,0),
filltabint(T3,4000),
filltabint3(T3,4000),
del_one_by_one_dbag_2(T3,1,4001),
filltabint(T3,4000),
filltabint3(T3,4000),
del_one_by_one_dbag_2(T3,4000,0),
filltabint2(T3,4000),
filltabint(T3,4000),
del_one_by_one_dbag_3(T3,4000,0),
ets:delete(T3),
ok.
make_init_fun(N) when N > 4000->
fun(read) ->
end_of_input;
(close) ->
exit(close_not_expected)
end;
make_init_fun(N) ->
fun(read) ->
case N rem 2 of
0 ->
{[{N, integer_to_list(N)}, {N, integer_to_list(N)}],
make_init_fun(N + 1)};
1 ->
{[], make_init_fun(N + 1)}
end;
(close) ->
exit(close_not_expected)
end.
%% Test ets:init_table/2.
t_init_table(Config) when is_list(Config)->
EtsMem = etsmem(),
repeat_for_opts(fun t_init_table_do/1),
verify_etsmem(EtsMem).
t_init_table_do(Opts) ->
T = ets_new(x,[duplicate_bag | Opts]),
filltabint(T,4000),
ets:init_table(T, make_init_fun(1)),
del_one_by_one_dbag_1(T,4000,0),
ets:delete(T),
ok.
do_fill_dbag_using_lists(T,0) ->
T;
do_fill_dbag_using_lists(T,N) ->
ets:insert(T,[{N,integer_to_list(N)},
{N + N rem 2,integer_to_list(N + N rem 2)}]),
do_fill_dbag_using_lists(T,N - 1).
%% Test the insert_new function.
t_insert_new(Config) when is_list(Config) ->
EtsMem = etsmem(),
L = fill_sets_int(1000) ++ fill_sets_int(1000,[{write_concurrency,true}]),
lists:foreach(fun(Tab) ->
false = ets:insert_new(Tab,{2,"2"}),
true = ets:insert_new(Tab,{2002,"2002"}),
false = ets:insert_new(Tab,{2002,"2002"}),
true = ets:insert(Tab,{2002,"2002"}),
false = ets:insert_new(Tab,[{2002,"2002"}]),
false = ets:insert_new(Tab,[{2002,"2002"},
{2003,"2003"}]),
false = ets:insert_new(Tab,[{2001,"2001"},
{2002,"2002"},
{2003,"2003"}]),
false = ets:insert_new(Tab,[{2001,"2001"},
{2002,"2002"}]),
true = ets:insert_new(Tab,[{2001,"2001"},
{2003,"2003"}]),
false = ets:insert_new(Tab,{2001,"2001"}),
false = ets:insert_new(Tab,{2002,"2002"}),
false = ets:insert_new(Tab,{2003,"2003"}),
true = ets:insert_new(Tab,{2004,"2004"}),
true = ets:insert_new(Tab,{2000,"2000"}),
true = ets:insert_new(Tab,[{2005,"2005"},
{2006,"2006"},
{2007,"2007"}]),
Num =
case ets:info(Tab,type) of
bag ->
true =
ets:insert(Tab,{2004,"2004-2"}),
false =
ets:insert_new(Tab,{2004,"2004-3"}),
1009;
duplicate_bag ->
true =
ets:insert(Tab,{2004,"2004"}),
false =
ets:insert_new(Tab,{2004,"2004"}),
1010;
_ ->
1008
end,
Num = ets:info(Tab,size),
List = ets:tab2list(Tab),
ets:delete_all_objects(Tab),
true = ets:insert_new(Tab,List),
false = ets:insert_new(Tab,List),
ets:delete(Tab)
end,
L),
verify_etsmem(EtsMem).
%% Test ets:insert/2 with list of objects.
t_insert_list(Config) when is_list(Config) ->
EtsMem = etsmem(),
repeat_for_opts(fun t_insert_list_do/1),
verify_etsmem(EtsMem).
t_insert_list_do(Opts) ->
T = ets_new(x,[duplicate_bag | Opts]),
do_fill_dbag_using_lists(T,4000),
del_one_by_one_dbag_2(T,4000,0),
ets:delete(T).
%% Test interface of ets:test_ms/2.
t_test_ms(Config) when is_list(Config) ->
EtsMem = etsmem(),
{ok,[a,b]} = ets:test_ms({a,b},
[{{'$1','$2'},[{'<','$1','$2'}],['$$']}]),
{ok,false} = ets:test_ms({a,b},
[{{'$1','$2'},[{'>','$1','$2'}],['$$']}]),
Tpl = {a,gb_sets:new()},
{ok,Tpl} = ets:test_ms(Tpl, [{{'_','_'}, [], ['$_']}]), % OTP-10190
{error,[{error,String}]} = ets:test_ms({a,b},
[{{'$1','$2'},
[{'flurp','$1','$2'}],
['$$']}]),
true = (if is_list(String) -> true; true -> false end),
verify_etsmem(EtsMem).
%% Test the select reverse BIFs.
t_select_reverse(Config) when is_list(Config) ->
Table = ets_new(xxx, [ordered_set]),
filltabint(Table,1000),
A = lists:reverse(ets:select(Table,[{{'$1', '_'},
[{'>',
{'rem',
'$1', 5},
2}],
['$_']}])),
A = ets:select_reverse(Table,[{{'$1', '_'},
[{'>',
{'rem',
'$1', 5},
2}],
['$_']}]),
A = reverse_chunked(Table,[{{'$1', '_'},
[{'>',
{'rem',
'$1', 5},
2}],
['$_']}],3),
%% A set/bag/duplicate_bag should get the same result regardless
%% of select or select_reverse
Table2 = ets_new(xxx, [set]),
filltabint(Table2,1000),
Table3 = ets_new(xxx, [bag]),
filltabint(Table3,1000),
Table4 = ets_new(xxx, [duplicate_bag]),
filltabint(Table4,1000),
lists:map(fun(Tab) ->
B = ets:select(Tab,[{{'$1', '_'},
[{'>',
{'rem',
'$1', 5},
2}],
['$_']}]),
B = ets:select_reverse(Tab,[{{'$1', '_'},
[{'>',
{'rem',
'$1', 5},
2}],
['$_']}])
end,[Table2, Table3, Table4]),
ok.
reverse_chunked(T,MS,N) ->
do_reverse_chunked(ets:select_reverse(T,MS,N),[]).
do_reverse_chunked('$end_of_table',Acc) ->
lists:reverse(Acc);
do_reverse_chunked({L,C},Acc) ->
NewAcc = lists:reverse(L)++Acc,
do_reverse_chunked(ets:select_reverse(C), NewAcc).
%% Test the ets:select_delete/2 and ets:select_count/2 BIFs.
t_select_delete(Config) when is_list(Config) ->
ct:timetrap({minutes,30}), %% valgrind needs a lot
EtsMem = etsmem(),
Tables = fill_sets_int(10000) ++ fill_sets_int(10000,[{write_concurrency,true}]),
lists:foreach
(fun(Table) ->
4000 = ets:select_count(Table,[{{'$1', '_'},
[{'>',
{'rem',
'$1', 5},
2}],
[true]}]),
4000 = ets:select_delete(Table,[{{'$1', '_'},
[{'>',
{'rem',
'$1', 5},
2}],
[true]}]),
check(Table,
fun({N,_}) when (N rem 5) =< 2 ->
true;
(_) ->
false
end,
6000)
end,
Tables),
lists:foreach
(fun(Table) ->
ets:select_delete(Table,[{'_',[],[true]}]),
xfilltabint(Table,4000),
successive_delete(Table,1,4001,bound),
0 = ets:info(Table,size),
xfilltabint(Table,4000),
successive_delete(Table,4000,0, bound),
0 = ets:info(Table,size),
xfilltabint(Table,4000),
successive_delete(Table,1,4001,unbound),
0 = ets:info(Table,size),
xfilltabint(Table,4000),
successive_delete(Table,4000,0, unbound),
0 = ets:info(Table,size)
end,
Tables),
lists:foreach
(fun(Table) ->
F = case ets:info(Table,type) of
X when X == bag; X == duplicate_bag ->
2;
_ ->
1
end,
xfilltabstr(Table, 4000),
1000 = ets:select_count(Table,
[{{[$3 | '$1'], '_'},
[{'==',
{'length', '$1'},
3}],[true]}]) div F,
1000 = ets:select_delete(Table,
[{{[$3 | '$1'], '_'},
[{'==',
{'length', '$1'},
3}],[true]}]) div F,
check(Table, fun({[3,_,_,_],_}) -> false;
(_) -> true
end, 3000*F),
8 = ets:select_count(Table,
[{{"7",'_'},[],[false]},
{{['_'], '_'},
[],[true]}]) div F,
8 = ets:select_delete(Table,
[{{"7",'_'},[],[false]},
{{['_'], '_'},
[],[true]}]) div F,
check(Table, fun({"7",_}) -> true;
({[_],_}) -> false;
(_) -> true
end, 2992*F),
xfilltabstr(Table, 4000),
%% This happens to be interesting for other select types too
200 = length(ets:select(Table,
[{{[$3,'_','_'],'_'},
[],[true]},
{{[$1,'_','_'],'_'},
[],[true]}])) div F,
200 = ets:select_count(Table,
[{{[$3,'_','_'],'_'},
[],[true]},
{{[$1,'_','_'],'_'},
[],[true]}]) div F,
200 = length(element(1,ets:select(Table,
[{{[$3,'_','_'],'_'},
[],[true]},
{{[$1,'_','_'],'_'},
[],[true]}],
1000))) div F,
200 = length(
ets:select_reverse(Table,
[{{[$3,'_','_'],'_'},
[],[true]},
{{[$1,'_','_'],'_'},
[],[true]}])) div F,
200 = length(
element(1,
ets:select_reverse
(Table,
[{{[$3,'_','_'],'_'},
[],[true]},
{{[$1,'_','_'],'_'},
[],[true]}],
1000))) div F,
200 = ets:select_delete(Table,
[{{[$3,'_','_'],'_'},
[],[true]},
{{[$1,'_','_'],'_'},
[],[true]}]) div F,
0 = ets:select_count(Table,
[{{[$3,'_','_'],'_'},
[],[true]},
{{[$1,'_','_'],'_'},
[],[true]}]) div F,
check(Table, fun({[$3,_,_],_}) -> false;
({[$1,_,_],_}) -> false;
(_) -> true
end, 3800*F)
end,
Tables),
lists:foreach(fun(Tab) -> ets:delete(Tab) end,Tables),
verify_etsmem(EtsMem).
%% Tests the ets:select_replace/2 BIF
t_select_replace(Config) when is_list(Config) ->
EtsMem = etsmem(),
Tables = fill_sets_int(10000) ++ fill_sets_int(10000, [{write_concurrency,true}]),
TestFun = fun (Table, TableType) when TableType =:= bag ->
% Operation not supported; bag implementation
% presented both semantic consistency and performance issues.
10000 = ets:select_delete(Table, [{'_',[],[true]}]);
(Table, TableType) ->
% Invalid replacement doesn't keep the key
MatchSpec1 = [{{'$1', '$2'},
[{'=:=', {'band', '$1', 2#11}, 2#11},
{'=/=', {'hd', '$2'}, $x}],
[{{'$2', '$1'}}]}],
{'EXIT',{badarg,_}} = (catch ets:select_replace(Table, MatchSpec1)),
% Invalid replacement doesn't keep the key (even though it would be the same value)
MatchSpec2 = [{{'$1', '$2'},
[{'=:=', {'band', '$1', 2#11}, 2#11}],
[{{{'+', '$1', 0}, '$2'}}]},
{{'$1', '$2'},
[{'=/=', {'band', '$1', 2#11}, 2#11}],
[{{{'-', '$1', 0}, '$2'}}]}],
{'EXIT',{badarg,_}} = (catch ets:select_replace(Table, MatchSpec2)),
% Invalid replacement changes key to float equivalent
MatchSpec3 = [{{'$1', '$2'},
[{'=:=', {'band', '$1', 2#11}, 2#11},
{'=/=', {'hd', '$2'}, $x}],
[{{{'*', '$1', 1.0}, '$2'}}]}],
{'EXIT',{badarg,_}} = (catch ets:select_replace(Table, MatchSpec3)),
% Replacements are differently-sized tuples
MatchSpec4_A = [{{'$1','$2'},
[{'<', {'rem', '$1', 5}, 2}],
[{{'$1', [$x | '$2'], stuff}}]}],
MatchSpec4_B = [{{'$1','$2','_'},
[],
[{{'$1','$2'}}]}],
4000 = ets:select_replace(Table, MatchSpec4_A),
4000 = ets:select_replace(Table, MatchSpec4_B),
% Replacement is the same tuple
MatchSpec5 = [{{'$1', '$2'},
[{'>', {'rem', '$1', 5}, 3}],
['$_']}],
2000 = ets:select_replace(Table, MatchSpec5),
% Replacement reconstructs an equal tuple
MatchSpec6 = [{{'$1', '$2'},
[{'>', {'rem', '$1', 5}, 3}],
[{{'$1', '$2'}}]}],
2000 = ets:select_replace(Table, MatchSpec6),
% Replacement uses {element,KeyPos,T} for key
2000 = ets:select_replace(Table,
[{{'$1', '$2'},
[{'>', {'rem', '$1', 5}, 3}],
[{{{element, 1, '$_'}, '$2'}}]}]),
% Replacement uses wrong {element,KeyPos,T} for key
{'EXIT',{badarg,_}} = (catch ets:select_replace(Table,
[{{'$1', '$2'},
[],
[{{{element, 2, '$_'}, '$2'}}]}])),
check(Table,
fun ({N, [$x, C | _]}) when ((N rem 5) < 2) -> (C >= $0) andalso (C =< $9);
({N, [C | _]}) when is_float(N) -> (C >= $0) andalso (C =< $9);
({N, [C | _]}) when ((N rem 5) > 3) -> (C >= $0) andalso (C =< $9);
({_, [C | _]}) -> (C >= $0) andalso (C =< $9)
end,
10000),
% Replace unbound range (>)
MatchSpec7 = [{{'$1', '$2'},
[{'>', '$1', 7000}],
[{{'$1', {{gt_range, '$2'}}}}]}],
3000 = ets:select_replace(Table, MatchSpec7),
% Replace unbound range (<)
MatchSpec8 = [{{'$1', '$2'},
[{'<', '$1', 3000}],
[{{'$1', {{le_range, '$2'}}}}]}],
case TableType of
ordered_set -> 2999 = ets:select_replace(Table, MatchSpec8);
set -> 2999 = ets:select_replace(Table, MatchSpec8);
duplicate_bag -> 2998 = ets:select_replace(Table, MatchSpec8)
end,
% Replace bound range
MatchSpec9 = [{{'$1', '$2'},
[{'>=', '$1', 3001},
{'<', '$1', 7000}],
[{{'$1', {{range, '$2'}}}}]}],
case TableType of
ordered_set -> 3999 = ets:select_replace(Table, MatchSpec9);
set -> 3999 = ets:select_replace(Table, MatchSpec9);
duplicate_bag -> 3998 = ets:select_replace(Table, MatchSpec9)
end,
% Replace particular keys
MatchSpec10 = [{{'$1', '$2'},
[{'==', '$1', 3000}],
[{{'$1', {{specific1, '$2'}}}}]},
{{'$1', '$2'},
[{'==', '$1', 7000}],
[{{'$1', {{specific2, '$2'}}}}]}],
case TableType of
ordered_set -> 2 = ets:select_replace(Table, MatchSpec10);
set -> 2 = ets:select_replace(Table, MatchSpec10);
duplicate_bag -> 4 = ets:select_replace(Table, MatchSpec10)
end,
check(Table,
fun ({N, {gt_range, _}}) -> N > 7000;
({N, {le_range, _}}) -> N < 3000;
({N, {range, _}}) -> (N >= 3001) andalso (N < 7000);
({N, {specific1, _}}) -> N == 3000;
({N, {specific2, _}}) -> N == 7000
end,
10000),
10000 = ets:select_delete(Table, [{'_',[],[true]}]),
check(Table, fun (_) -> false end, 0)
end,
lists:foreach(
fun(Table) ->
TestFun(Table, ets:info(Table, type)),
ets:delete(Table)
end,
Tables),
%% Test key-safe match-specs are accepted
BigNum = (123 bsl 123),
RefcBin = list_to_binary(lists:seq(1,?heap_binary_size+1)),
Terms = [a, "hej", 123, 1.23, BigNum , <<"123">>, RefcBin, TestFun, self()],
EqPairs = fun(X,Y) ->
[{ '$1', '$1'},
{ {X, Y}, {{X, Y}}},
{ {'$1', Y}, {{'$1', Y}}},
{ {{X, Y}}, {{{{X, Y}}}}},
{ {X}, {{X}}},
{ X, {const, X}},
{ {X,Y}, {const, {X,Y}}},
{ {X}, {const, {X}}},
{ {X, Y}, {{X, {const, Y}}}},
{ {X, {Y,'$1'}}, {{{const, X}, {{Y,'$1'}}}}},
{ [X, Y | '$1'], [X, Y | '$1']},
{ [{X, '$1'}, Y], [{{X, '$1'}}, Y]},
{ [{X, Y} | '$1'], [{const, {X, Y}} | '$1']},
{ [$p,$r,$e,$f,$i,$x | '$1'], [$p,$r,$e,$f,$i,$x | '$1']},
{ {[{X,Y}]}, {{[{{X,Y}}]}}},
{ {[{X,Y}]}, {{{const, [{X,Y}]}}}},
{ {[{X,Y}]}, {{[{const,{X,Y}}]}}}
]
end,
T2 = ets:new(x, []),
[lists:foreach(fun({A, B}) ->
%% just check that matchspec is accepted
0 = ets:select_replace(T2, [{{A, '$2', '$3'}, [], [{{B, '$3', '$2'}}]}])
end,
EqPairs(X,Y)) || X <- Terms, Y <- Terms],
%% Test key-unsafe matchspecs are rejected
NeqPairs = fun(X, Y) ->
[{'$1', '$2'},
{{X, Y}, {X, Y}},
{{{X, Y}}, {{{X, Y}}}},
{{X}, {{{X}}}},
{{const, X}, {const, X}},
{{const, {X,Y}}, {const, {X,Y}}},
{'$1', {const, '$1'}},
{{X}, {const, {{X}}}},
{{X, {Y,'$1'}}, {{{const, X}, {Y,'$1'}}}},
{[X, Y | '$1'], [X, Y]},
{[X, Y], [X, Y | '$1']},
{[{X, '$1'}, Y], [{X, '$1'}, Y]},
{[$p,$r,$e,$f,$i,$x | '$1'], [$p,$r,$e,$f,$I,$x | '$1']},
{ {[{X,Y}]}, {{[{X,Y}]}}},
{ {[{X,Y}]}, {{{const, [{{X,Y}}]}}}},
{ {[{X,Y}]}, {{[{const,{{X,Y}}}]}}},
{'_', '_'},
{'$_', '$_'},
{'$$', '$$'},
{#{}, #{}},
{#{X => '$1'}, #{X => '$1'}}
]
end,
[lists:foreach(fun({A, B}) ->
%% just check that matchspec is rejected
{'EXIT',{badarg,_}} = (catch ets:select_replace(T2, [{{A, '$2', '$3'}, [], [{{B, '$3', '$2'}}]}]))
end,
NeqPairs(X,Y)) || X <- Terms, Y <- Terms],
%% Wrap entire tuple with 'const'
[[begin
Old = {Key, 1, 2},
ets:insert(T2, Old),
1 = ets:select_replace(T2, [{Old, [], [{const, New}]}]),
[New] = ets:lookup(T2, Key),
ets:delete(T2, Key)
end || New <- [{Key, 1, 2}, {Key, 3, 4}, {Key, 1}, {Key, 1, 2, 3}, {Key}]
]
|| Key <- [{1, tuple}, {nested, {tuple, {a,b}}} | Terms]],
%% 'const' wrap does not work with maps or variables in keys
[[begin
Old = {Key, 1, 2},
{'EXIT',{badarg,_}} = (catch ets:select_replace(T2, [{Old, [], [{const, New}]}]))
end || New <- [{Key, 1, 2}, {Key, 3, 4}, {Key, 1}, {Key, 1, 2, 3}, {Key}]
]
|| Key <- [#{a => 1}, {nested, #{a => 1}}, '$1']],
ets:delete(T2),
verify_etsmem(EtsMem).
%% OTP-15346: Bug caused select_replace of bound key to corrupt static stack
%% used by ets:next and ets:prev.
t_select_replace_next_bug(Config) when is_list(Config) ->
T = ets:new(k, [ordered_set]),
[ets:insert(T, {I, value}) || I <- lists:seq(1,10)],
1 = ets:first(T),
%% Make sure select_replace does not leave pointer
%% to deallocated {2,value} in static stack.
MS = [{{2,value}, [], [{{2,"new_value"}}]}],
1 = ets:select_replace(T, MS),
%% This would crash or give wrong result at least on DEBUG emulator
%% where deallocated memory is overwritten.
2 = ets:next(T, 1),
ets:delete(T).
%% Test that partly bound keys gives faster matches.
partly_bound(Config) when is_list(Config) ->
case os:type() of
{win32,_} ->
{skip,"Inaccurate measurements on Windows"};
_ ->
EtsMem = etsmem(),
dont_make_worse(),
make_better(),
verify_etsmem(EtsMem)
end.
dont_make_worse() ->
seventyfive_percent_success(fun dont_make_worse_sub/0, 0, 0, 10).
dont_make_worse_sub() ->
T = build_table([a,b],[a,b],15000),
T1 = time_match_object(T,{'_',a,a,1500}, [{{a,a,1500},a,a,1500}]),
T2 = time_match_object(T,{{a,a,'_'},a,a,1500},
[{{a,a,1500},a,a,1500}]),
ets:delete(T),
true = (T1 > T2),
ok.
make_better() ->
fifty_percent_success(fun make_better_sub2/0, 0, 0, 10),
fifty_percent_success(fun make_better_sub1/0, 0, 0, 10).
make_better_sub1() ->
T = build_table2([a,b],[a,b],15000),
T1 = time_match_object(T,{'_',1500,a,a}, [{{1500,a,a},1500,a,a}]),
T2 = time_match_object(T,{{1500,a,'_'},1500,a,a},
[{{1500,a,a},1500,a,a}]),
ets:delete(T),
io:format("~p>~p~n",[(T1 / 100),T2]),
true = ((T1 / 100) > T2), % More marginal than needed.
ok.
make_better_sub2() ->
T = build_table2([a,b],[a,b],15000),
T1 = time_match(T,{'$1',1500,a,a}),
T2 = time_match(T,{{1500,a,'$1'},1500,a,a}),
ets:delete(T),
io:format("~p>~p~n",[(T1 / 100),T2]),
true = ((T1 / 100) > T2), % More marginal than needed.
ok.
%% Heavy random matching, comparing set with ordered_set.
match_heavy(Config) when is_list(Config) ->
PrivDir = proplists:get_value(priv_dir,Config),
DataDir = proplists:get_value(data_dir, Config),
%% Easier to have in process dictionary when manually
%% running the test function.
put(where_to_read,DataDir),
put(where_to_write,PrivDir),
random_test(),
drop_match(),
ok.
%%% Extra safety for the very low probability that this is not
%%% caught by the random test (Statistically impossible???)
drop_match() ->
EtsMem = etsmem(),
T = build_table([a,b],[a],1500),
[{{a,a,1},a,a,1},{{b,a,1},b,a,1}] =
ets:match_object(T, {'_','_','_',1}),
true = ets:delete(T),
verify_etsmem(EtsMem).
ets_match(Tab,Expr) ->
case rand:uniform(2) of
1 ->
ets:match(Tab,Expr);
_ ->
match_chunked(Tab,Expr)
end.
match_chunked(Tab,Expr) ->
match_chunked_collect(ets:match(Tab,Expr,
rand:uniform(1999) + 1)).
match_chunked_collect('$end_of_table') ->
[];
match_chunked_collect({Results, Continuation}) ->
Results ++ match_chunked_collect(ets:match(Continuation)).
ets_match_object(Tab,Expr) ->
case rand:uniform(2) of
1 ->
ets:match_object(Tab,Expr);
_ ->
match_object_chunked(Tab,Expr)
end.
match_object_chunked(Tab,Expr) ->
match_object_chunked_collect(ets:match_object(Tab,Expr,
rand:uniform(1999) + 1)).
match_object_chunked_collect('$end_of_table') ->
[];
match_object_chunked_collect({Results, Continuation}) ->
Results ++ match_object_chunked_collect(ets:match_object(Continuation)).
random_test() ->
ReadDir = get(where_to_read),
WriteDir = get(where_to_write),
(catch file:make_dir(WriteDir)),
case file:consult(filename:join([ReadDir,"preset_random_seed.txt"])) of
{ok,[X]} ->
rand:seed(X);
_ ->
rand:seed(exsplus)
end,
Seed = rand:export_seed(),
{ok,F} = file:open(filename:join([WriteDir,"last_random_seed.txt"]),
[write]),
io:format(F,"~p. ~n",[Seed]),
file:close(F),
io:format("Random seed ~p written to ~s, copy to ~s to rerun with "
"same seed.",[Seed,
filename:join([WriteDir, "last_random_seed.txt"]),
filename:join([ReadDir,
"preset_random_seed.txt"])]),
do_random_test().
do_random_test() ->
EtsMem = etsmem(),
OrdSet = ets_new(xxx,[ordered_set]),
Set = ets_new(xxx,[]),
do_n_times(fun() ->
Key = create_random_string(25),
Value = create_random_tuple(25),
ets:insert(OrdSet,{Key,Value}),
ets:insert(Set,{Key,Value})
end, 5000),
io:format("~nData inserted~n"),
do_n_times(fun() ->
I = rand:uniform(25),
Key = create_random_string(I) ++ '_',
L1 = ets_match_object(OrdSet,{Key,'_'}),
L2 = lists:sort(ets_match_object(Set,{Key,'_'})),
case L1 == L2 of
false ->
io:format("~p != ~p~n",
[L1,L2]),
exit({not_eq, L1, L2});
true ->
ok
end
end,
2000),
io:format("~nData matched~n"),
ets:match_delete(OrdSet,'_'),
ets:match_delete(Set,'_'),
do_n_times(fun() ->
Value = create_random_string(25),
Key = create_random_tuple(25),
ets:insert(OrdSet,{Key,Value}),
ets:insert(Set,{Key,Value})
end, 2000),
io:format("~nData inserted~n"),
(fun() ->
Key = list_to_tuple(lists:duplicate(25,'_')),
L1 = ets_match_object(OrdSet,{Key,'_'}),
L2 = lists:sort(ets_match_object(Set,{Key,'_'})),
2000 = length(L1),
case L1 == L2 of
false ->
io:format("~p != ~p~n",
[L1,L2]),
exit({not_eq, L1, L2});
true ->
ok
end
end)(),
(fun() ->
Key = {'$1','$2','$3','$4',
'$5','$6','$7','$8',
'$9','$10','$11','$12',
'$13','$14','$15','$16',
'$17','$18','$19','$20',
'$21','$22','$23','$24',
'$25'},
L1 = ets_match_object(OrdSet,{Key,'_'}),
L2 = lists:sort(ets_match_object(Set,{Key,'_'})),
2000 = length(L1),
case L1 == L2 of
false ->
io:format("~p != ~p~n",
[L1,L2]),
exit({not_eq, L1, L2});
true ->
ok
end
end)(),
(fun() ->
Key = {'$1','$2','$3','$4',
'$5','$6','$7','$8',
'$9','$10','$11','$12',
'$13','$14','$15','$16',
'$17','$18','$19','$20',
'$21','$22','$23','$24',
'$25'},
L1 = ets_match(OrdSet,{Key,'_'}),
L2 = lists:sort(ets_match(Set,{Key,'_'})),
2000 = length(L1),
case L1 == L2 of
false ->
io:format("~p != ~p~n",
[L1,L2]),
exit({not_eq, L1, L2});
true ->
ok
end
end)(),
ets:match_delete(OrdSet,'_'),
ets:match_delete(Set,'_'),
do_n_times(fun() ->
Value = create_random_string(25),
Key = create_random_tuple(25),
ets:insert(OrdSet,{Key,Value}),
ets:insert(Set,{Key,Value})
end, 2000),
io:format("~nData inserted~n"),
do_n_times(fun() ->
Key = create_partly_bound_tuple(25),
L1 = ets_match_object(OrdSet,{Key,'_'}),
L2 = lists:sort(ets_match_object(Set,{Key,'_'})),
case L1 == L2 of
false ->
io:format("~p != ~p~n",
[L1,L2]),
exit({not_eq, L1, L2});
true ->
ok
end
end,
2000),
do_n_times(fun() ->
Key = create_partly_bound_tuple2(25),
L1 = ets_match_object(OrdSet,{Key,'_'}),
L2 = lists:sort(ets_match_object(Set,{Key,'_'})),
case L1 == L2 of
false ->
io:format("~p != ~p~n",
[L1,L2]),
exit({not_eq, L1, L2});
true ->
ok
end
end,
2000),
do_n_times(fun() ->
Key = create_partly_bound_tuple2(25),
L1 = ets_match(OrdSet,{Key,'_'}),
L2 = lists:sort(ets_match(Set,{Key,'_'})),
case L1 == L2 of
false ->
io:format("~p != ~p~n",
[L1,L2]),
exit({not_eq, L1, L2});
true ->
ok
end
end,
2000),
io:format("~nData matched~n"),
ets:match_delete(OrdSet,'_'),
ets:match_delete(Set,'_'),
do_n_times(fun() ->
do_n_times(fun() ->
Value =
create_random_string(25),
Key = create_random_tuple(25),
ets:insert(OrdSet,{Key,Value}),
ets:insert(Set,{Key,Value})
end, 500),
io:format("~nData inserted~n"),
do_n_times(fun() ->
Key =
create_partly_bound_tuple(25),
ets:match_delete(OrdSet,{Key,'_'}),
ets:match_delete(Set,{Key,'_'}),
L1 = ets:info(OrdSet,size),
L2 = ets:info(Set,size),
[] = ets_match_object(OrdSet,
{Key,'_'}),
case L1 == L2 of
false ->
io:format("~p != ~p "
"(deleted ~p)~n",
[L1,L2,Key]),
exit({not_eq, L1, L2,
{deleted,Key}});
true ->
ok
end
end,
50),
io:format("~nData deleted~n")
end,
10),
ets:delete(OrdSet),
ets:delete(Set),
verify_etsmem(EtsMem).
%% Test various variants of update_element.
update_element(Config) when is_list(Config) ->
EtsMem = etsmem(),
repeat_for_opts(fun update_element_opts/1),
verify_etsmem(EtsMem).
update_element_opts(Opts) ->
TupleCases = [{{key,val}, 1 ,2},
{{val,key}, 2, 1},
{{key,val}, 1 ,[2]},
{{key,val,val}, 1, [2,3]},
{{val,key,val,val}, 2, [3,4,1]},
{{val,val,key,val}, 3, [1,4,1,2]}, % update pos1 twice
{{val,val,val,key}, 4, [2,1,2,3]}],% update pos2 twice
lists:foreach(fun({Tuple,KeyPos,UpdPos}) -> update_element_opts(Tuple,KeyPos,UpdPos,Opts) end,
TupleCases),
update_element_neg(Opts).
update_element_opts(Tuple,KeyPos,UpdPos,Opts) ->
Set = ets_new(set,[{keypos,KeyPos} | Opts]),
OrdSet = ets_new(ordered_set,[ordered_set,{keypos,KeyPos} | Opts]),
update_element(Set,Tuple,KeyPos,UpdPos),
update_element(OrdSet,Tuple,KeyPos,UpdPos),
true = ets:delete(Set),
true = ets:delete(OrdSet),
ok.
update_element(T,Tuple,KeyPos,UpdPos) ->
KeyList = [17,"seventeen",<<"seventeen">>,{17},list_to_binary(lists:seq(1,100)),make_ref(), self()],
lists:foreach(fun(Key) ->
TupleWithKey = setelement(KeyPos,Tuple,Key),
update_element_do(T,TupleWithKey,Key,UpdPos)
end,
KeyList).
update_element_do(Tab,Tuple,Key,UpdPos) ->
%% Strategy: Step around in Values array and call ets:update_element for the values.
%% Take Length number of steps of size 1, then of size 2, ..., Length-1.
%% This will try all combinations of {fromValue,toValue}
%%
%% IMPORTANT: size(Values) must be a prime number for this to work!!!
Big32 = 16#12345678,
Big64 = 16#123456789abcdef0,
Values = { 623, -27, 0, Big32, -Big32, Big64, -Big64, Big32*Big32,
-Big32*Big32, Big32*Big64, -Big32*Big64, Big64*Big64, -Big64*Big64,
"A", "Sverker", [], {12,-132}, {},
<<45,232,0,12,133>>, <<234,12,23>>, list_to_binary(lists:seq(1,100)),
(fun(X) -> X*Big32 end),
make_ref(), make_ref(), self(), ok, update_element, 28, 29 },
Length = size(Values),
PosValArgF = fun(ToIx, ResList, [Pos | PosTail], Rand, MeF) ->
NextIx = (ToIx+Rand) rem Length,
MeF(NextIx, [{Pos,element(ToIx+1,Values)} | ResList], PosTail, Rand, MeF);
(_ToIx, ResList, [], _Rand, _MeF) ->
ResList;
(ToIx, [], Pos, _Rand, _MeF) ->
{Pos, element(ToIx+1,Values)} % single {pos,value} arg
end,
UpdateF = fun(ToIx,Rand) ->
PosValArg = PosValArgF(ToIx,[],UpdPos,Rand,PosValArgF),
%%io:format("update_element(~p)~n",[PosValArg]),
ArgHash = erlang:phash2({Tab,Key,PosValArg}),
true = ets:update_element(Tab, Key, PosValArg),
ArgHash = erlang:phash2({Tab,Key,PosValArg}),
NewTuple = update_tuple(PosValArg,Tuple),
[NewTuple] = ets:lookup(Tab,Key)
end,
LoopF = fun(_FromIx, Incr, _Times, Checksum, _MeF) when Incr >= Length ->
Checksum; % done
(FromIx, Incr, 0, Checksum, MeF) ->
MeF(FromIx, Incr+1, Length, Checksum, MeF);
(FromIx, Incr, Times, Checksum, MeF) ->
ToIx = (FromIx + Incr) rem Length,
UpdateF(ToIx,Checksum),
if
Incr =:= 0 -> UpdateF(ToIx,Checksum); % extra update to same value
true -> true
end,
MeF(ToIx, Incr, Times-1, Checksum+ToIx+1, MeF)
end,
FirstTuple = Tuple,
true = ets:insert(Tab,FirstTuple),
[FirstTuple] = ets:lookup(Tab,Key),
Checksum = LoopF(0, 1, Length, 0, LoopF),
Checksum = (Length-1)*Length*(Length+1) div 2, % if Length is a prime
ok.
update_tuple({Pos,Val}, Tpl) ->
setelement(Pos, Tpl, Val);
update_tuple([{Pos,Val} | Tail], Tpl) ->
update_tuple(Tail,setelement(Pos, Tpl, Val));
update_tuple([], Tpl) ->
Tpl.
update_element_neg(Opts) ->
Set = ets_new(set,Opts),
OrdSet = ets_new(ordered_set,[ordered_set | Opts]),
update_element_neg_do(Set),
update_element_neg_do(OrdSet),
ets:delete(Set),
{'EXIT',{badarg,_}} = (catch ets:update_element(Set,key,{2,1})),
ets:delete(OrdSet),
{'EXIT',{badarg,_}} = (catch ets:update_element(OrdSet,key,{2,1})),
Bag = ets_new(bag,[bag | Opts]),
DBag = ets_new(duplicate_bag,[duplicate_bag | Opts]),
{'EXIT',{badarg,_}} = (catch ets:update_element(Bag,key,{2,1})),
{'EXIT',{badarg,_}} = (catch ets:update_element(DBag,key,{2,1})),
true = ets:delete(Bag),
true = ets:delete(DBag),
ok.
update_element_neg_do(T) ->
Object = {key, 0, "Hej"},
true = ets:insert(T,Object),
UpdateF = fun(Arg3) ->
ArgHash = erlang:phash2({T,key,Arg3}),
{'EXIT',{badarg,_}} = (catch ets:update_element(T,key,Arg3)),
ArgHash = erlang:phash2({T,key,Arg3}),
[Object] = ets:lookup(T,key)
end,
%% List of invalid {Pos,Value} tuples
InvList = [false, {2}, {2,1,false}, {false,1}, {0,1}, {1,1}, {-1,1}, {4,1}],
lists:foreach(UpdateF, InvList),
lists:foreach(fun(InvTpl) -> UpdateF([{2,1},InvTpl]) end, InvList),
lists:foreach(fun(InvTpl) -> UpdateF([InvTpl,{2,1}]) end, InvList),
lists:foreach(fun(InvTpl) -> UpdateF([{2,1},{3,"Hello"},InvTpl]) end, InvList),
lists:foreach(fun(InvTpl) -> UpdateF([{3,"Hello"},{2,1},InvTpl]) end, InvList),
lists:foreach(fun(InvTpl) -> UpdateF([{2,1},InvTpl,{3,"Hello"}]) end, InvList),
lists:foreach(fun(InvTpl) -> UpdateF([InvTpl,{3,"Hello"},{2,1}]) end, InvList),
UpdateF([{2,1} | {3,1}]),
lists:foreach(fun(InvTpl) -> UpdateF([{2,1} | InvTpl]) end, InvList),
true = ets:update_element(T,key,[]),
false = ets:update_element(T,false,[]),
false = ets:update_element(T,false,{2,1}),
ets:delete(T,key),
false = ets:update_element(T,key,{2,1}),
ok.
%% test various variants of update_counter.
update_counter(Config) when is_list(Config) ->
EtsMem = etsmem(),
repeat_for_opts(fun update_counter_do/1),
verify_etsmem(EtsMem).
update_counter_do(Opts) ->
Set = ets_new(set,Opts),
OrdSet = ets_new(ordered_set,[ordered_set | Opts]),
update_counter_for(Set),
update_counter_for(OrdSet),
ets:delete_all_objects(Set),
ets:delete_all_objects(OrdSet),
ets:safe_fixtable(Set, true),
ets:safe_fixtable(OrdSet, true),
update_counter_for(Set),
update_counter_for(OrdSet),
ets:safe_fixtable(Set, false),
ets:safe_fixtable(OrdSet, false),
ets:delete(Set),
ets:delete(OrdSet),
update_counter_neg(Opts).
update_counter_for(T) ->
ets:insert(T,{a,1,1}),
101 = ets:update_counter(T,a,100),
[{a,101,1}] = ets:lookup(T,a),
101 = ets:update_counter(T,a,{3,100}),
[{a,101,101}] = ets:lookup(T,a),
LooperF = fun(Obj, 0, _, _) ->
Obj;
(Obj, Times, Arg3, Myself) ->
{NewObj, Ret} = uc_mimic(Obj,Arg3),
ArgHash = erlang:phash2({T,a,Arg3}),
%%io:format("update_counter(~p, ~p, ~p) expecting ~p\n",[T,a,Arg3,Ret]),
[DefaultObj] = ets:lookup(T, a),
Ret = ets:update_counter(T,a,Arg3),
Ret = ets:update_counter(T, b, Arg3, DefaultObj), % Use other key
ArgHash = erlang:phash2({T,a,Arg3}),
%%io:format("NewObj=~p~n ",[NewObj]),
[NewObj] = ets:lookup(T,a),
true = ets:lookup(T, b) =:= [setelement(1, NewObj, b)],
ets:delete(T, b),
Myself(NewObj,Times-1,Arg3,Myself)
end,
LoopF = fun(Obj, Times, Arg3) ->
%%io:format("Loop start:\nObj = ~p\nArg3=~p\n",[Obj,Arg3]),
LooperF(Obj,Times,Arg3,LooperF)
end,
SmallMax32 = (1 bsl 27) - 1,
SmallMax64 = (1 bsl (27+32)) - 1,
Big1Max32 = (1 bsl 32) - 1,
Big1Max64 = (1 bsl 64) - 1,
Steps = 100,
Obj0 = {a,0,0,0,0},
ets:insert(T,Obj0),
Obj1 = LoopF(Obj0, Steps, {2,(SmallMax32 div Steps)*2}),
Obj2 = LoopF(Obj1, Steps, {3,(SmallMax64 div Steps)*2}),
Obj3 = LoopF(Obj2, Steps, {4,(Big1Max32 div Steps)*2}),
Obj4 = LoopF(Obj3, Steps, {5,(Big1Max64 div Steps)*2}),
Obj5 = LoopF(Obj4, Steps, {2,-(SmallMax32 div Steps)*4}),
Obj6 = LoopF(Obj5, Steps, {3,-(SmallMax64 div Steps)*4}),
Obj7 = LoopF(Obj6, Steps, {4,-(Big1Max32 div Steps)*4}),
Obj8 = LoopF(Obj7, Steps, {5,-(Big1Max64 div Steps)*4}),
Obj9 = LoopF(Obj8, Steps, {2,(SmallMax32 div Steps)*2}),
ObjA = LoopF(Obj9, Steps, {3,(SmallMax64 div Steps)*2}),
ObjB = LoopF(ObjA, Steps, {4,(Big1Max32 div Steps)*2}),
Obj0 = LoopF(ObjB, Steps, {5,(Big1Max64 div Steps)*2}),
%% back at zero, same trip again with lists
Obj4 = LoopF(Obj0,Steps,[{2, (SmallMax32 div Steps)*2},
{3, (SmallMax64 div Steps)*2},
{4, (Big1Max32 div Steps)*2},
{5, (Big1Max64 div Steps)*2}]),
Obj8 = LoopF(Obj4,Steps,[{4, -(Big1Max32 div Steps)*4},
{2, -(SmallMax32 div Steps)*4},
{5, -(Big1Max64 div Steps)*4},
{3, -(SmallMax64 div Steps)*4}]),
Obj0 = LoopF(Obj8,Steps,[{5, (Big1Max64 div Steps)*2},
{2, (SmallMax32 div Steps)*2},
{4, (Big1Max32 div Steps)*2},
{3, (SmallMax64 div Steps)*2}]),
%% make them shift size at the same time
ObjC = LoopF(Obj0,Steps,[{5, (Big1Max64 div Steps)*2},
{3, (Big1Max64 div Steps)*2 + 1},
{2, -(Big1Max64 div Steps)*2},
{4, -(Big1Max64 div Steps)*2 + 1}]),
%% update twice in same list
ObjD = LoopF(ObjC,Steps,[{5, -(Big1Max64 div Steps) + 1},
{3, -(Big1Max64 div Steps)*2 - 1},
{5, -(Big1Max64 div Steps) - 1},
{4, (Big1Max64 div Steps)*2 - 1}]),
Obj0 = LoopF(ObjD,Steps,[{2, (Big1Max64 div Steps) - 1},
{4, Big1Max64*2},
{2, (Big1Max64 div Steps) + 1},
{4, -Big1Max64*2}]),
%% warping with list
ObjE = LoopF(Obj0,1000,
[{3,SmallMax32*4 div 5,SmallMax32*2,-SmallMax32*2},
{5,-SmallMax64*4 div 7,-SmallMax64*2,SmallMax64*2},
{4,-Big1Max32*4 div 11,-Big1Max32*2,Big1Max32*2},
{2,Big1Max64*4 div 13,Big1Max64*2,-Big1Max64*2}]),
%% warping without list
ObjF = LoopF(ObjE,1000,{3,SmallMax32*4 div 5,SmallMax32*2,-SmallMax32*2}),
ObjG = LoopF(ObjF,1000,{5,-SmallMax64*4 div 7,-SmallMax64*2,SmallMax64*2}),
ObjH = LoopF(ObjG,1000,{4,-Big1Max32*4 div 11,-Big1Max32*2,Big1Max32*2}),
ObjI = LoopF(ObjH,1000,{2,Big1Max64*4 div 13,Big1Max64*2,-Big1Max64*2}),
%% mixing it up
LoopF(ObjI,1000,
[{3,SmallMax32*4 div 5,SmallMax32*2,-SmallMax32*2},
{5,-SmallMax64*4 div 3},
{3,-SmallMax32*4 div 11},
{5,0},
{4,1},
{5,-SmallMax64*4 div 7,-SmallMax64*2,SmallMax64*2},
{2,Big1Max64*4 div 13,Big1Max64*2,-Big1Max64*2}]),
ok.
%% uc_mimic works kind of like the real ets:update_counter
%% Obj = Tuple in ets
%% Pits = {Pos,Incr} | {Pos,Incr,Thres,Warp}
%% Returns {Updated tuple in ets, Return value from update_counter}
uc_mimic(Obj, Pits) when is_tuple(Pits) ->
Pos = element(1,Pits),
NewObj = setelement(Pos, Obj, uc_adder(element(Pos,Obj),Pits)),
{NewObj, element(Pos,NewObj)};
uc_mimic(Obj, PitsList) when is_list(PitsList) ->
{NewObj,ValList} = uc_mimic(Obj,PitsList,[]),
{NewObj,lists:reverse(ValList)}.
uc_mimic(Obj, [], Acc) ->
{Obj,Acc};
uc_mimic(Obj, [Pits|Tail], Acc) ->
{NewObj,NewVal} = uc_mimic(Obj,Pits),
uc_mimic(NewObj,Tail,[NewVal|Acc]).
uc_adder(Init, {_Pos, Add}) ->
Init + Add;
uc_adder(Init, {_Pos, Add, Thres, Warp}) ->
case Init + Add of
X when X > Thres, Add > 0 ->
Warp;
Y when Y < Thres, Add < 0 ->
Warp;
Z ->
Z
end.
update_counter_neg(Opts) ->
Set = ets_new(set,Opts),
OrdSet = ets_new(ordered_set,[ordered_set | Opts]),
update_counter_neg_for(Set),
update_counter_neg_for(OrdSet),
ets:delete(Set),
{'EXIT',{badarg,_}} = (catch ets:update_counter(Set,key,1)),
ets:delete(OrdSet),
{'EXIT',{badarg,_}} = (catch ets:update_counter(OrdSet,key,1)),
Bag = ets_new(bag,[bag | Opts]),
DBag = ets_new(duplicate_bag,[duplicate_bag | Opts]),
{'EXIT',{badarg,_}} = (catch ets:update_counter(Bag,key,1)),
{'EXIT',{badarg,_}} = (catch ets:update_counter(DBag,key,1)),
true = ets:delete(Bag),
true = ets:delete(DBag),
ok.
update_counter_neg_for(T) ->
Object = {key,0,false,1},
true = ets:insert(T,Object),
UpdateF = fun(Arg3) ->
ArgHash = erlang:phash2({T,key,Arg3}),
{'EXIT',{badarg,_}} = (catch ets:update_counter(T,key,Arg3)),
ArgHash = erlang:phash2({T,key,Arg3}),
[Object] = ets:lookup(T,key)
end,
%% List of invalid arg3-tuples
InvList = [false, {2}, {2,false}, {false,1},
{0,1}, {-1,1}, % BUG < R12B-2
{1,1}, {3,1}, {5,1}, {2,1,100}, {2,1,100,0,false}, {2,1,false,0}, {2,1,0,false}],
lists:foreach(UpdateF, InvList),
lists:foreach(fun(Inv) -> UpdateF([{2,1},Inv]) end, InvList),
lists:foreach(fun(Inv) -> UpdateF([Inv,{2,1}]) end, InvList),
lists:foreach(fun(Inv) -> UpdateF([{2,1},{4,-100},Inv]) end, InvList),
lists:foreach(fun(Inv) -> UpdateF([{4,100,50,0},{2,1},Inv]) end, InvList),
lists:foreach(fun(Inv) -> UpdateF([{2,1},Inv,{4,100,50,0}]) end, InvList),
lists:foreach(fun(Inv) -> UpdateF([Inv,{4,100,50,0},{2,1}]) end, InvList),
UpdateF([{2,1} | {4,1}]),
lists:foreach(fun(Inv) -> UpdateF([{2,1} | Inv]) end, InvList),
{'EXIT',{badarg,_}} = (catch ets:update_counter(T,false,1)),
ets:delete(T,key),
{'EXIT',{badarg,_}} = (catch ets:update_counter(T,key,1)),
ok.
evil_update_counter(Config) when is_list(Config) ->
%% The code server uses ets table. Pre-load modules that might not be
%% already loaded.
gb_sets:module_info(),
math:module_info(),
ordsets:module_info(),
rand:module_info(),
repeat_for_opts(fun evil_update_counter_do/1).
evil_update_counter_do(Opts) ->
EtsMem = etsmem(),
process_flag(trap_exit, true),
Pids = [my_spawn_link(fun() -> evil_counter(I,Opts) end) || I <- lists:seq(1, 40)],
wait_for_all(gb_sets:from_list(Pids)),
verify_etsmem(EtsMem),
ok.
wait_for_all(Pids0) ->
case gb_sets:is_empty(Pids0) of
true ->
ok;
false ->
receive
{'EXIT',Pid,normal} ->
Pids = gb_sets:delete(Pid, Pids0),
wait_for_all(Pids);
Other ->
io:format("unexpected: ~p\n", [Other]),
ct:fail(failed)
end
end.
evil_counter(I,Opts) ->
T = ets_new(a, Opts),
Start0 = case I rem 3 of
0 -> 16#12345678;
1 -> 16#12345678FFFFFFFF;
2 -> 16#7777777777FFFFFFFF863648726743
end,
Start = Start0 + rand:uniform(100000),
ets:insert(T, {dracula,Start}),
Iter = 40000 div syrup_factor(),
End = Start + Iter,
End = evil_counter_1(Iter, T),
ets:delete(T).
evil_counter_1(0, T) ->
[{dracula,Count}] = ets:lookup(T, dracula),
Count;
evil_counter_1(Iter, T) ->
ets:update_counter(T, dracula, 1),
evil_counter_1(Iter-1, T).
update_counter_with_default(Config) when is_list(Config) ->
repeat_for_opts(fun update_counter_with_default_do/1).
update_counter_with_default_do(Opts) ->
T1 = ets_new(a, [set | Opts]),
%% Insert default object.
3 = ets:update_counter(T1, foo, 2, {beaufort,1}),
%% Increment.
5 = ets:update_counter(T1, foo, 2, {cabecou,1}),
%% Increment with list.
[9] = ets:update_counter(T1, foo, [{2,4}], {camembert,1}),
%% Same with non-immediate key.
3 = ets:update_counter(T1, {foo,bar}, 2, {{chaource,chevrotin},1}),
5 = ets:update_counter(T1, {foo,bar}, 2, {{cantal,comté},1}),
[9] = ets:update_counter(T1, {foo,bar}, [{2,4}], {{emmental,de,savoie},1}),
%% Same with ordered set.
T2 = ets_new(b, [ordered_set | Opts]),
3 = ets:update_counter(T2, foo, 2, {maroilles,1}),
5 = ets:update_counter(T2, foo, 2, {mimolette,1}),
[9] = ets:update_counter(T2, foo, [{2,4}], {morbier,1}),
3 = ets:update_counter(T2, {foo,bar}, 2, {{laguiole},1}),
5 = ets:update_counter(T2, {foo,bar}, 2, {{saint,nectaire},1}),
[9] = ets:update_counter(T2, {foo,bar}, [{2,4}], {{rocamadour},1}),
%% Arithmetically-equal keys.
3 = ets:update_counter(T2, 1.0, 2, {1,1}),
5 = ets:update_counter(T2, 1, 2, {1,1}),
7 = ets:update_counter(T2, 1, 2, {1.0,1}),
%% Same with reversed type difference.
3 = ets:update_counter(T2, 2, 2, {2.0,1}),
5 = ets:update_counter(T2, 2.0, 2, {2.0,1}),
7 = ets:update_counter(T2, 2.0, 2, {2,1}),
%% bar is not an integer.
{'EXIT',{badarg,_}} = (catch ets:update_counter(T1, qux, 3, {saint,félicien})),
%% No third element in default value.
{'EXIT',{badarg,_}} = (catch ets:update_counter(T1, qux, [{3,1}], {roquefort,1})),
ok.
update_counter_table_growth(_Config) ->
repeat_for_opts(fun update_counter_table_growth_do/1).
update_counter_table_growth_do(Opts) ->
Set = ets_new(b, [set | Opts]),
[ets:update_counter(Set, N, {2, 1}, {N, 1}) || N <- lists:seq(1,10000)],
OrderedSet = ets_new(b, [ordered_set | Opts]),
[ets:update_counter(OrderedSet, N, {2, 1}, {N, 1}) || N <- lists:seq(1,10000)],
ok.
%% Check that a first-next sequence always works on a fixed table.
fixtable_next(Config) when is_list(Config) ->
repeat_for_opts(fun fixtable_next_do/1,
[write_concurrency,all_types]).
fixtable_next_do(Opts) ->
EtsMem = etsmem(),
do_fixtable_next(ets_new(set,[public | Opts])),
verify_etsmem(EtsMem).
do_fixtable_next(Tab) ->
F = fun(X,T,FF) ->
case X of
0 -> true;
_ ->
ets:insert(T, {X,
integer_to_list(X),
X rem 10}),
FF(X-1,T,FF)
end
end,
F(100,Tab,F),
ets:safe_fixtable(Tab,true),
First = ets:first(Tab),
ets:delete(Tab, First),
ets:next(Tab, First),
ets:match_delete(Tab,{'_','_','_'}),
'$end_of_table' = ets:next(Tab, First),
true = ets:info(Tab, fixed),
ets:safe_fixtable(Tab, false),
false = ets:info(Tab, fixed),
ets:delete(Tab).
%% Check inserts of deleted keys in fixed bags.
fixtable_insert(Config) when is_list(Config) ->
Combos = [[Type,{write_concurrency,WC}] || Type<- [bag,duplicate_bag],
WC <- [false,true]],
lists:foreach(fun(Opts) -> fixtable_insert_do(Opts) end,
Combos),
ok.
fixtable_insert_do(Opts) ->
io:format("Opts = ~p\n",[Opts]),
Ets = make_table(ets, Opts, [{a,1}, {a,2}, {b,1}, {b,2}]),
ets:safe_fixtable(Ets,true),
ets:match_delete(Ets,{b,1}),
First = ets:first(Ets),
Next = case First of
a -> b;
b -> a
end,
Next = ets:next(Ets,First),
ets:delete(Ets,Next),
'$end_of_table' = ets:next(Ets,First),
ets:insert(Ets, {Next,1}),
false = ets:insert_new(Ets, {Next,1}),
Next = ets:next(Ets,First),
'$end_of_table' = ets:next(Ets,Next),
ets:delete(Ets,Next),
'$end_of_table' = ets:next(Ets,First),
ets:insert(Ets, {Next,2}),
false = ets:insert_new(Ets, {Next,1}),
Next = ets:next(Ets,First),
'$end_of_table' = ets:next(Ets,Next),
ets:delete(Ets,First),
Next = ets:first(Ets),
'$end_of_table' = ets:next(Ets,Next),
ets:delete(Ets,Next),
'$end_of_table' = ets:next(Ets,First),
true = ets:insert_new(Ets,{Next,1}),
false = ets:insert_new(Ets,{Next,2}),
Next = ets:next(Ets,First),
ets:delete_object(Ets,{Next,1}),
'$end_of_table' = ets:next(Ets,First),
true = ets:insert_new(Ets,{Next,2}),
false = ets:insert_new(Ets,{Next,1}),
Next = ets:next(Ets,First),
ets:delete(Ets,First),
ets:safe_fixtable(Ets,false),
{'EXIT',{badarg,_}} = (catch ets:next(Ets,First)),
ok.
%% Test the 'write_concurrency' option.
write_concurrency(Config) when is_list(Config) ->
EtsMem = etsmem(),
Yes1 = ets_new(foo,[public,{write_concurrency,true}]),
Yes2 = ets_new(foo,[protected,{write_concurrency,true}]),
No1 = ets_new(foo,[private,{write_concurrency,true}]),
Yes3 = ets_new(foo,[bag,public,{write_concurrency,true}]),
Yes4 = ets_new(foo,[bag,protected,{write_concurrency,true}]),
No2 = ets_new(foo,[bag,private,{write_concurrency,true}]),
Yes5 = ets_new(foo,[duplicate_bag,public,{write_concurrency,true}]),
Yes6 = ets_new(foo,[duplicate_bag,protected,{write_concurrency,true}]),
No3 = ets_new(foo,[duplicate_bag,private,{write_concurrency,true}]),
Yes7 = ets_new(foo,[ordered_set,public,{write_concurrency,true}]),
Yes8 = ets_new(foo,[ordered_set,protected,{write_concurrency,true}]),
Yes9 = ets_new(foo,[ordered_set,{write_concurrency,true}]),
Yes10 = ets_new(foo,[{write_concurrency,true},ordered_set,public]),
Yes11 = ets_new(foo,[{write_concurrency,true},ordered_set,protected]),
Yes12 = ets_new(foo,[set,{write_concurrency,false},
{write_concurrency,true},ordered_set,public]),
Yes13 = ets_new(foo,[private,public,set,{write_concurrency,false},
{write_concurrency,true},ordered_set]),
No4 = ets_new(foo,[ordered_set,private,{write_concurrency,true}]),
No5 = ets_new(foo,[ordered_set,public,{write_concurrency,false}]),
No6 = ets_new(foo,[ordered_set,protected,{write_concurrency,false}]),
No7 = ets_new(foo,[ordered_set,private,{write_concurrency,false}]),
No8 = ets_new(foo,[public,{write_concurrency,false}]),
No9 = ets_new(foo,[protected,{write_concurrency,false}]),
YesMem = ets:info(Yes1,memory),
NoHashMem = ets:info(No1,memory),
YesTreeMem = ets:info(Yes7,memory),
NoTreeMem = ets:info(No4,memory),
io:format("YesMem=~p NoHashMem=~p NoTreeMem=~p YesTreeMem=~p\n",[YesMem,NoHashMem,
NoTreeMem,YesTreeMem]),
YesMem = ets:info(Yes2,memory),
YesMem = ets:info(Yes3,memory),
YesMem = ets:info(Yes4,memory),
YesMem = ets:info(Yes5,memory),
YesMem = ets:info(Yes6,memory),
NoHashMem = ets:info(No2,memory),
NoHashMem = ets:info(No3,memory),
YesTreeMem = ets:info(Yes7,memory),
YesTreeMem = ets:info(Yes8,memory),
YesTreeMem = ets:info(Yes9,memory),
YesTreeMem = ets:info(Yes10,memory),
YesTreeMem = ets:info(Yes11,memory),
YesTreeMem = ets:info(Yes12,memory),
YesTreeMem = ets:info(Yes13,memory),
NoTreeMem = ets:info(No4,memory),
NoTreeMem = ets:info(No5,memory),
NoTreeMem = ets:info(No6,memory),
NoTreeMem = ets:info(No7,memory),
NoHashMem = ets:info(No8,memory),
NoHashMem = ets:info(No9,memory),
true = YesMem > NoHashMem,
true = YesMem > NoTreeMem,
true = YesMem > YesTreeMem,
true = YesTreeMem < NoTreeMem,
{'EXIT',{badarg,_}} = (catch ets_new(foo,[public,{write_concurrency,foo}])),
{'EXIT',{badarg,_}} = (catch ets_new(foo,[public,{write_concurrency}])),
{'EXIT',{badarg,_}} = (catch ets_new(foo,[public,{write_concurrency,true,foo}])),
{'EXIT',{badarg,_}} = (catch ets_new(foo,[public,write_concurrency])),
lists:foreach(fun(T) -> ets:delete(T) end,
[Yes1,Yes2,Yes3,Yes4,Yes5,Yes6,Yes7,Yes8,Yes9,Yes10,Yes11,Yes12,Yes13,
No1,No2,No3,No4,No5,No6,No7,No8,No9]),
verify_etsmem(EtsMem),
ok.
%% The 'heir' option.
heir(Config) when is_list(Config) ->
repeat_for_opts(fun heir_do/1).
heir_do(Opts) ->
EtsMem = etsmem(),
Master = self(),
%% Different types of heir data and link/monitor relations
TestFun = fun(Arg) -> {EtsMem,Arg} end,
Combos = [{Data,Mode} || Data<-[foo_data, <<"binary">>,
lists:seq(1,10), {17,TestFun,self()},
"The busy heir"],
Mode<-[none,link,monitor]],
lists:foreach(fun({Data,Mode})-> heir_1(Data,Mode,Opts) end,
Combos),
%% No heir
{Founder1,MrefF1} = my_spawn_monitor(fun()->heir_founder(Master,foo_data,Opts)end),
Founder1 ! {go, none},
{"No heir",Founder1} = receive_any(),
{'DOWN', MrefF1, process, Founder1, normal} = receive_any(),
undefined = ets:info(foo),
%% An already dead heir
{Heir2,MrefH2} = my_spawn_monitor(fun()->die end),
{'DOWN', MrefH2, process, Heir2, normal} = receive_any(),
{Founder2,MrefF2} = my_spawn_monitor(fun()->heir_founder(Master,foo_data,Opts)end),
Founder2 ! {go, Heir2},
{"No heir",Founder2} = receive_any(),
{'DOWN', MrefF2, process, Founder2, normal} = receive_any(),
undefined = ets:info(foo),
%% When heir dies before founder
{Founder3,MrefF3} = my_spawn_monitor(fun()->heir_founder(Master,"The dying heir",Opts)end),
{Heir3,MrefH3} = my_spawn_monitor(fun()->heir_heir(Founder3)end),
Founder3 ! {go, Heir3},
{'DOWN', MrefH3, process, Heir3, normal} = receive_any(),
Founder3 ! die_please,
{'DOWN', MrefF3, process, Founder3, normal} = receive_any(),
undefined = ets:info(foo),
%% When heir dies and pid reused before founder dies
repeat_while(fun() ->
NextPidIx = erts_debug:get_internal_state(next_pid),
{Founder4,MrefF4} = my_spawn_monitor(fun()->heir_founder(Master,"The dying heir",Opts)end),
{Heir4,MrefH4} = my_spawn_monitor(fun()->heir_heir(Founder4)end),
Founder4 ! {go, Heir4},
{'DOWN', MrefH4, process, Heir4, normal} = receive_any(),
erts_debug:set_internal_state(next_pid, NextPidIx),
DoppelGanger = spawn_monitor_with_pid(Heir4,
fun()-> die_please = receive_any() end),
Founder4 ! die_please,
{'DOWN', MrefF4, process, Founder4, normal} = receive_any(),
case DoppelGanger of
{Heir4,MrefH4_B} ->
Heir4 ! die_please,
{'DOWN', MrefH4_B, process, Heir4, normal} = receive_any(),
undefined = ets:info(foo),
false;
failed ->
io:format("Failed to spawn process with pid ~p\n", [Heir4]),
true % try again
end
end),
verify_etsmem(EtsMem).
heir_founder(Master, HeirData, Opts) ->
{go,Heir} = receive_any(),
HeirTpl = case Heir of
none -> {heir,none};
_ -> {heir, Heir, HeirData}
end,
T = ets_new(foo,[named_table, private, HeirTpl | Opts]),
true = ets:insert(T,{key,1}),
[{key,1}] = ets:lookup(T,key),
Self = self(),
Self = ets:info(T,owner),
case ets:info(T,heir) of
none ->
true = (Heir =:= none) orelse (not is_process_alive(Heir)),
Master ! {"No heir",self()};
Heir ->
true = is_process_alive(Heir),
Heir ! {table,T,HeirData},
die_please = receive_any()
end.
heir_heir(Founder) ->
heir_heir(Founder, none).
heir_heir(Founder, Mode) ->
{table,T,HeirData} = receive_any(),
{'EXIT',{badarg,_}} = (catch ets:lookup(T,key)),
case HeirData of
"The dying heir" -> exit(normal);
_ -> ok
end,
Mref = case Mode of
link -> process_flag(trap_exit, true),
link(Founder);
monitor -> erlang:monitor(process,Founder);
none -> ok
end,
Founder ! die_please,
Msg = case HeirData of
"The busy heir" -> receive_any_spinning();
_ -> receive_any()
end,
{'ETS-TRANSFER', T, Founder, HeirData} = Msg,
foo = T,
Self = self(),
Self = ets:info(T,owner),
Self = ets:info(T,heir),
[{key,1}] = ets:lookup(T,key),
true = ets:insert(T,{key,2}),
[{key,2}] = ets:lookup(T,key),
case Mode of % Verify that EXIT or DOWN comes after ETS-TRANSFER
link ->
{'EXIT',Founder,normal} = receive_any(),
process_flag(trap_exit, false);
monitor ->
{'DOWN', Mref, process, Founder, normal} = receive_any();
none -> ok
end.
heir_1(HeirData,Mode,Opts) ->
io:format("test with heir_data = ~p\n", [HeirData]),
Master = self(),
Founder = my_spawn_link(fun() -> heir_founder(Master,HeirData,Opts) end),
io:format("founder spawned = ~p\n", [Founder]),
{Heir,Mref} = my_spawn_monitor(fun() -> heir_heir(Founder,Mode) end),
io:format("heir spawned = ~p\n", [{Heir,Mref}]),
Founder ! {go, Heir},
{'DOWN', Mref, process, Heir, normal} = receive_any().
%% Test ets:give_way/3.
give_away(Config) when is_list(Config) ->
repeat_for_opts(fun give_away_do/1).
give_away_do(Opts) ->
T = ets_new(foo,[named_table, private | Opts]),
true = ets:insert(T,{key,1}),
[{key,1}] = ets:lookup(T,key),
Parent = self(),
%% Give and then give back
{Receiver,Mref} = my_spawn_monitor(fun()-> give_away_receiver(T,Parent) end),
give_me = receive_any(),
true = ets:give_away(T,Receiver,here_you_are),
{'EXIT',{badarg,_}} = (catch ets:lookup(T,key)),
Receiver ! give_back,
{'ETS-TRANSFER',T,Receiver,"Tillbakakaka"} = receive_any(),
[{key,2}] = ets:lookup(T,key),
{'DOWN', Mref, process, Receiver, normal} = receive_any(),
%% Give and then let receiver keep it
true = ets:insert(T,{key,1}),
{Receiver3,Mref3} = my_spawn_monitor(fun()-> give_away_receiver(T,Parent) end),
give_me = receive_any(),
true = ets:give_away(T,Receiver3,here_you_are),
{'EXIT',{badarg,_}} = (catch ets:lookup(T,key)),
Receiver3 ! die_please,
{'DOWN', Mref3, process, Receiver3, normal} = receive_any(),
undefined = ets:info(T),
%% Give and then kill receiver to get back
T2 = ets_new(foo,[private | Opts]),
true = ets:insert(T2,{key,1}),
ets:setopts(T2,{heir,self(),"Som en gummiboll..."}),
{Receiver2,Mref2} = my_spawn_monitor(fun()-> give_away_receiver(T2,Parent) end),
give_me = receive_any(),
true = ets:give_away(T2,Receiver2,here_you_are),
{'EXIT',{badarg,_}} = (catch ets:lookup(T2,key)),
Receiver2 ! die_please,
{'ETS-TRANSFER',T2,Receiver2,"Som en gummiboll..."} = receive_any(),
[{key,2}] = ets:lookup(T2,key),
{'DOWN', Mref2, process, Receiver2, normal} = receive_any(),
%% Some negative testing
{'EXIT',{badarg,_}} = (catch ets:give_away(T2,Receiver,"To a dead one")),
{'EXIT',{badarg,_}} = (catch ets:give_away(T2,self(),"To myself")),
{'EXIT',{badarg,_}} = (catch ets:give_away(T2,"not a pid","To wrong type")),
true = ets:delete(T2),
{ReceiverNeg,MrefNeg} = my_spawn_monitor(fun()-> give_away_receiver(T2,Parent) end),
give_me = receive_any(),
{'EXIT',{badarg,_}} = (catch ets:give_away(T2,ReceiverNeg,"A deleted table")),
T3 = ets_new(foo,[public | Opts]),
my_spawn_link(fun()-> {'EXIT',{badarg,_}} = (catch ets:give_away(T3,ReceiverNeg,"From non owner")),
Parent ! done
end),
done = receive_any(),
ReceiverNeg ! no_soup_for_you,
{'DOWN', MrefNeg, process, ReceiverNeg, normal} = receive_any(),
ok.
give_away_receiver(T, Giver) ->
{'EXIT',{badarg,_}} = (catch ets:lookup(T,key)),
Giver ! give_me,
case receive_any() of
{'ETS-TRANSFER',T,Giver,here_you_are} ->
[{key,1}] = ets:lookup(T,key),
true = ets:insert(T,{key,2}),
case receive_any() of
give_back ->
true = ets:give_away(T,Giver,"Tillbakakaka"),
{'EXIT',{badarg,_}} = (catch ets:lookup(T,key));
die_please ->
ok
end;
no_soup_for_you ->
ok
end.
%% Test ets:setopts/2.
setopts(Config) when is_list(Config) ->
repeat_for_opts(fun setopts_do/1, [write_concurrency,all_types]).
setopts_do(Opts) ->
Self = self(),
T = ets_new(foo,[named_table, private | Opts]),
none = ets:info(T,heir),
Heir = my_spawn_link(fun()->heir_heir(Self) end),
ets:setopts(T,{heir,Heir,"Data"}),
Heir = ets:info(T,heir),
ets:setopts(T,{heir,self(),"Data"}),
Self = ets:info(T,heir),
ets:setopts(T,[{heir,Heir,"Data"}]),
Heir = ets:info(T,heir),
ets:setopts(T,[{heir,none}]),
none = ets:info(T,heir),
{'EXIT',{badarg,_}} = (catch ets:setopts(T,[{heir,self(),"Data"},false])),
{'EXIT',{badarg,_}} = (catch ets:setopts(T,{heir,self()})),
{'EXIT',{badarg,_}} = (catch ets:setopts(T,{heir,false})),
{'EXIT',{badarg,_}} = (catch ets:setopts(T,heir)),
{'EXIT',{badarg,_}} = (catch ets:setopts(T,{heir,false,"Data"})),
{'EXIT',{badarg,_}} = (catch ets:setopts(T,{false,self(),"Data"})),
ets:setopts(T,{protection,protected}),
ets:setopts(T,{protection,public}),
ets:setopts(T,{protection,private}),
ets:setopts(T,[{protection,protected}]),
ets:setopts(T,[{protection,public}]),
ets:setopts(T,[{protection,private}]),
{'EXIT',{badarg,_}} = (catch ets:setopts(T,{protection})),
{'EXIT',{badarg,_}} = (catch ets:setopts(T,{protection,false})),
{'EXIT',{badarg,_}} = (catch ets:setopts(T,{protection,private,false})),
{'EXIT',{badarg,_}} = (catch ets:setopts(T,protection)),
ets:delete(T),
unlink(Heir),
exit(Heir, bang),
ok.
%% All kinds of operations with bad table argument.
bad_table(Config) when is_list(Config) ->
%% Open and close disk_log to stabilize etsmem.
Name = make_ref(),
File = filename:join([proplists:get_value(priv_dir, Config),"bad_table.dummy"]),
{ok, Name} = disk_log:open([{name, Name}, {file, File}]),
disk_log:close(Name),
file:delete(File),
EtsMem = etsmem(),
repeat_for_opts(fun(Opts) -> bad_table_do(Opts,File) end,
[write_concurrency, all_types]),
verify_etsmem(EtsMem),
ok.
bad_table_do(Opts, DummyFile) ->
Parent = self(),
{Pid,Mref} = my_spawn_opt(fun()-> ets_new(priv,[private,named_table | Opts]),
Priv = ets_new(priv,[private | Opts]),
ets_new(prot,[protected,named_table | Opts]),
Prot = ets_new(prot,[protected | Opts]),
Parent ! {self(),Priv,Prot},
die_please = receive_any()
end,
[link, monitor]),
{Pid,Priv,Prot} = receive_any(),
MatchSpec = {{key,'_'}, [], ['$$']},
Fun = fun(X,_) -> X end,
OpList = [{delete,[key],update},
{delete_all_objects,[],update},
{delete_object,[{key,data}],update},
{first,[],read},
{foldl,[Fun, 0], read, tabarg_last},
{foldr,[Fun, 0], read, tabarg_last},
%%{from_dets,[DetsTab], update},
{give_away,[Pid, data], update},
%%{info, [], read},
%%{info, [safe_fixed], read},
%%{init_table,[Name, InitFun],update},
{insert, [{key,data}], update},
{insert_new, [{key,data}], update},
{insert_new, [[{key,data},{other,data}]], update},
{last, [], read},
{lookup, [key], read},
{lookup_element, [key, 2], read},
{match, [{}], read},
{match, [{},17], read},
{match_delete, [{}], update},
{match_object, [{}], read},
{match_object, [{},17], read},
{member,[key], read},
{next, [key], read},
{prev, [key], read},
{rename, [new_name], update},
{safe_fixtable, [true], read},
{select,[MatchSpec], read},
{select,[MatchSpec,17], read},
{select_count,[MatchSpec], read},
{select_delete,[MatchSpec], update},
{setopts, [{heir,none}], update},
{slot, [0], read},
{tab2file, [DummyFile], read, {return,{error,badtab}}},
{tab2file, [DummyFile,[]], read, {return,{error,badtab}}},
{tab2list, [], read},
%%{table,[], read},
%%{to_dets, [DetsTab], read},
{update_counter,[key,1], update},
{update_element,[key,{2,new_data}], update}
],
Info = {Opts, Priv, Prot},
lists:foreach(fun(Op) -> bad_table_op(Info, Op) end,
OpList),
Pid ! die_please,
{'DOWN', Mref, process, Pid, normal} = receive_any(),
ok.
bad_table_op({Opts,Priv,Prot}, Op) ->
%%io:format("Doing Op=~p on ~p's\n",[Op,Type]),
T1 = ets_new(noname,Opts),
bad_table_call(noname,Op),
ets:delete(T1),
bad_table_call(T1,Op),
T2 = ets_new(named,[named_table | Opts]),
ets:delete(T2),
bad_table_call(named,Op),
bad_table_call(T2,Op),
bad_table_call(priv,Op),
bad_table_call(Priv,Op),
case element(3,Op) of
update ->
bad_table_call(prot,Op),
bad_table_call(Prot,Op);
read -> ok
end.
bad_table_call(T,{F,Args,_}) ->
{'EXIT',{badarg,_}} = (catch apply(ets, F, [T|Args]));
bad_table_call(T,{F,Args,_,tabarg_last}) ->
{'EXIT',{badarg,_}} = (catch apply(ets, F, Args++[T]));
bad_table_call(T,{F,Args,_,{return,Return}}) ->
try
Return = apply(ets, F, [T|Args])
catch
error:badarg -> ok
end.
%% Check rename of ets tables.
rename(Config) when is_list(Config) ->
repeat_for_opts(fun rename_do/1, [write_concurrency, all_types]).
rename_do(Opts) ->
EtsMem = etsmem(),
ets_new(foobazz,[named_table, public | Opts]),
ets:insert(foobazz,{foo,bazz}),
ungermanbazz = ets:rename(foobazz,ungermanbazz),
{'EXIT',{badarg, _}} = (catch ets:lookup(foobazz,foo)),
[{foo,bazz}] = ets:lookup(ungermanbazz,foo),
{'EXIT',{badarg,_}} = (catch ets:rename(ungermanbazz,"no atom")),
ets:delete(ungermanbazz),
verify_etsmem(EtsMem).
%% Check rename of unnamed ets table.
rename_unnamed(Config) when is_list(Config) ->
repeat_for_opts(fun rename_unnamed_do/1,
[write_concurrency,all_types]).
rename_unnamed_do(Opts) ->
EtsMem = etsmem(),
Tab = ets_new(bonkz,[public | Opts]),
{'EXIT',{badarg, _}} = (catch ets:insert(bonkz,{foo,bazz})),
bonkz = ets:info(Tab, name),
Tab = ets:rename(Tab, tjabonkz),
{'EXIT',{badarg, _}} = (catch ets:insert(tjabonkz,{foo,bazz})),
tjabonkz = ets:info(Tab, name),
ets:delete(Tab),
verify_etsmem(EtsMem).
%% Rename a table with many fixations, and at the same time delete it.
evil_rename(Config) when is_list(Config) ->
EtsMem = etsmem(),
evil_rename_1(old_hash, new_hash, [public,named_table]),
evil_rename_1(old_tree, new_tree, [public,ordered_set,named_table]),
wait_for_test_procs(true),
verify_etsmem(EtsMem).
evil_rename_1(Old, New, Flags) ->
process_flag(trap_exit, true),
Old = ets_new(Old, Flags),
Fixer = fun() -> ets:safe_fixtable(Old, true) end,
crazy_fixtable(15000, Fixer),
erlang:yield(),
New = ets:rename(Old, New),
erlang:yield(),
ets:delete(New),
ok.
crazy_fixtable(N, Fixer) ->
Dracula = ets_new(count_dracula, [public]),
ets:insert(Dracula, {count,0}),
SpawnFun = fun() ->
Fixer(),
case ets:update_counter(Dracula, count, 1) rem 15 of
0 -> evil_creater_destroyer();
_ -> erlang:hibernate(erlang, error, [dont_wake_me])
end
end,
crazy_fixtable_1(N, SpawnFun),
crazy_fixtable_wait(N, Dracula),
Dracula.
crazy_fixtable_wait(N, Dracula) ->
case ets:lookup(Dracula, count) of
[{count,N}] ->
ets:delete(Dracula);
Other ->
io:format("~p\n", [Other]),
receive after 10 -> ok end,
crazy_fixtable_wait(N, Dracula)
end.
crazy_fixtable_1(0, _) ->
ok;
crazy_fixtable_1(N, Fun) ->
%%FIXME my_spawn_link(Fun),
my_spawn_link(Fun),
crazy_fixtable_1(N-1, Fun).
evil_creater_destroyer() ->
T1 = evil_create_fixed_tab(),
ets:delete(T1).
evil_create_fixed_tab() ->
T = ets_new(arne, [public]),
ets:safe_fixtable(T, true),
T.
%% Tests that the return values and errors are equal for set's and
%% ordered_set's where applicable.
interface_equality(Config) when is_list(Config) ->
repeat_for_opts(fun interface_equality_do/1).
interface_equality_do(Opts) ->
EtsMem = etsmem(),
Set = ets_new(set,[set | Opts]),
OrderedSet = ets_new(ordered_set,[ordered_set | Opts]),
F = fun(X,T,FF) -> case X of
0 -> true;
_ ->
ets:insert(T, {X,
integer_to_list(X),
X rem 10}),
FF(X-1,T,FF)
end
end,
F(100,Set,F),
F(100,OrderedSet,F),
equal_results(ets, insert, Set, OrderedSet, [{a,"a"}]),
equal_results(ets, insert, Set, OrderedSet, [{1,1,"1"}]),
equal_results(ets, lookup, Set, OrderedSet, [10]),
equal_results(ets, lookup, Set, OrderedSet, [1000]),
equal_results(ets, delete, Set, OrderedSet, [10]),
equal_results(ets, delete, Set, OrderedSet, [nott]),
equal_results(ets, lookup, Set, OrderedSet, [1000]),
equal_results(ets, insert, Set, OrderedSet, [10]),
equal_results(ets, next, Set, OrderedSet, ['$end_of_table']),
equal_results(ets, prev, Set, OrderedSet, ['$end_of_table']),
equal_results(ets, match, Set, OrderedSet, [{'_','_','_'}]),
equal_results(ets, match, Set, OrderedSet, [{'_','_','_','_'}]),
equal_results(ets, match, Set, OrderedSet, [{$3,$2,2}]),
equal_results(ets, match, Set, OrderedSet, ['_']),
equal_results(ets, match, Set, OrderedSet, ['$1']),
equal_results(ets, match, Set, OrderedSet, [{'_','$50',3}]),
equal_results(ets, match, Set, OrderedSet, [['_','$50',3]]),
equal_results(ets, match_delete, Set, OrderedSet, [{'_','_',4}]),
equal_results(ets, match_delete, Set, OrderedSet, [{'_','_',4}]),
equal_results(ets, match_object, Set, OrderedSet, [{'_','_',4}]),
equal_results(ets, match_object, Set, OrderedSet, [{'_','_',5}]),
equal_results(ets, match_object, Set, OrderedSet, [{'_','_',4}]),
equal_results(ets, match_object, Set, OrderedSet, ['_']),
equal_results(ets, match_object, Set, OrderedSet, ['$5011']),
equal_results(ets, match_delete, Set, OrderedSet, ['$20']),
equal_results(ets, lookup_element, Set, OrderedSet, [13,2]),
equal_results(ets, lookup_element, Set, OrderedSet, [13,4]),
equal_results(ets, lookup_element, Set, OrderedSet, [14,2]),
equal_results(ets, delete, Set, OrderedSet, []),
verify_etsmem(EtsMem).
equal_results(M, F, FirstArg1, FirstArg2 ,ACommon) ->
Res = maybe_sort((catch apply(M,F, [FirstArg1 | ACommon]))),
Res = maybe_sort((catch apply(M,F,[FirstArg2 | ACommon]))).
maybe_sort(L) when is_list(L) ->
lists:sort(L);
maybe_sort({'EXIT',{Reason, List}}) when is_list(List) ->
{'EXIT',{Reason, lists:map(fun({Module, Function, _, _}) ->
{Module, Function, '_'}
end,
List)}};
maybe_sort(Any) ->
Any.
%% Test match, match_object and match_delete in ordered set's.
ordered_match(Config) when is_list(Config)->
repeat_for_opts(fun ordered_match_do/1).
ordered_match_do(Opts) ->
EtsMem = etsmem(),
F = fun(X,T,FF) -> case X of
0 -> true;
_ ->
ets:insert(T, {X,
integer_to_list(X),
X rem 10,
X rem 100,
X rem 1000}),
FF(X-1,T,FF)
end
end,
T1 = ets_new(xxx,[ordered_set| Opts]),
F(3000,T1,F),
[[3,3],[3,3],[3,3]] = ets:match(T1, {'_','_','$1','$2',3}),
F2 = fun(X,Rem,Res,FF) -> case X of
0 -> [];
_ ->
case X rem Rem of
Res ->
FF(X-1,Rem,Res,FF) ++
[{X,
integer_to_list(X),
X rem 10,
X rem 100,
X rem 1000}];
_ ->
FF(X-1,Rem,Res,FF)
end
end
end,
OL1 = F2(3000,100,2,F2),
OL1 = ets:match_object(T1, {'_','_','_',2,'_'}),
true = ets:match_delete(T1,{'_','_','_',2,'_'}),
[] = ets:match_object(T1, {'_','_','_',2,'_'}),
OL2 = F2(3000,100,3,F2),
OL2 = ets:match_object(T1, {'_','_','_',3,'_'}),
ets:delete(T1),
verify_etsmem(EtsMem).
%% Test basic functionality in ordered_set's.
ordered(Config) when is_list(Config) ->
repeat_for_opts(fun ordered_do/1).
ordered_do(Opts) ->
EtsMem = etsmem(),
T = ets_new(oset, [ordered_set | Opts]),
InsList = [
25,26,27,28,
5,6,7,8,
21,22,23,24,
9,10,11,12,
1,2,3,4,
17,18,19,20,
13,14,15,16,
1 bsl 33
],
lists:foreach(fun(X) ->
ets:insert(T,{X,integer_to_list(X)})
end,
InsList),
IL2 = lists:map(fun(X) -> {X,integer_to_list(X)} end, InsList),
L1 = pick_all_forward(T),
L2 = pick_all_backwards(T),
S1 = lists:sort(IL2),
S2 = lists:reverse(lists:sort(IL2)),
S1 = L1,
S2 = L2,
[{1,"1"}] = ets:slot(T,0),
[{28,"28"}] = ets:slot(T,27),
[{1 bsl 33,_}] = ets:slot(T,28),
27 = ets:prev(T,28),
[{7,"7"}] = ets:slot(T,6),
'$end_of_table' = ets:next(T,1 bsl 33),
[{12,"12"}] = ets:slot(T,11),
'$end_of_table' = ets:slot(T,29),
[{1,"1"}] = ets:slot(T,0),
28 = ets:prev(T,1 bsl 33),
1 = ets:next(T,0),
pick_all_forward(T),
[{7,"7"}] = ets:slot(T,6),
L2 = pick_all_backwards(T),
[{7,"7"}] = ets:slot(T,6),
ets:delete(T),
verify_etsmem(EtsMem).
pick_all(_T,'$end_of_table',_How) ->
[];
pick_all(T,Last,How) ->
This = case How of
next ->
ets:next(T,Last);
prev ->
ets:prev(T,Last)
end,
[LastObj] = ets:lookup(T,Last),
[LastObj | pick_all(T,This,How)].
pick_all_forward(T) ->
pick_all(T,ets:first(T),next).
pick_all_backwards(T) ->
pick_all(T,ets:last(T),prev).
%% Small test case for both set and bag type ets tables.
setbag(Config) when is_list(Config) ->
EtsMem = etsmem(),
lists:foreach(fun(SetType) ->
Set = ets_new(SetType,[SetType]),
Bag = ets_new(bag,[bag]),
Key = {foo,bar},
%% insert some value
ets:insert(Set,{Key,val1}),
ets:insert(Bag,{Key,val1}),
%% insert new value for same key again
ets:insert(Set,{Key,val2}),
ets:insert(Bag,{Key,val2}),
%% check
[{Key,val2}] = ets:lookup(Set,Key),
[{Key,val1},{Key,val2}] = ets:lookup(Bag,Key),
true = ets:delete(Set),
true = ets:delete(Bag)
end, [set, cat_ord_set,stim_cat_ord_set,ordered_set]),
verify_etsmem(EtsMem).
%% Test case to check proper return values for illegal ets_new() calls.
badnew(Config) when is_list(Config) ->
EtsMem = etsmem(),
{'EXIT',{badarg,_}} = (catch ets:new(12,[])),
{'EXIT',{badarg,_}} = (catch ets:new({a,b},[])),
{'EXIT',{badarg,_}} = (catch ets:new(name,[foo])),
{'EXIT',{badarg,_}} = (catch ets:new(name,{bag})),
{'EXIT',{badarg,_}} = (catch ets:new(name,bag)),
verify_etsmem(EtsMem).
%% OTP-2314. Test case to check that a non-proper list does not
%% crash the emulator.
verybadnew(Config) when is_list(Config) ->
EtsMem = etsmem(),
{'EXIT',{badarg,_}} = (catch ets:new(verybad,[set|protected])),
verify_etsmem(EtsMem).
%% Small check to see if named tables work.
named(Config) when is_list(Config) ->
EtsMem = etsmem(),
Tab = make_table(foo,
[named_table],
[{key,val}]),
[{key,val}] = ets:lookup(foo,key),
true = ets:delete(Tab),
verify_etsmem(EtsMem).
%% Test case to check if specified keypos works.
keypos2(Config) when is_list(Config) ->
EtsMem = etsmem(),
lists:foreach(fun(SetType) ->
Tab = make_table(foo,
[SetType,{keypos,2}],
[{val,key}, {val2,key}]),
[{val2,key}] = ets:lookup(Tab,key),
true = ets:delete(Tab)
end, [set, cat_ord_set,stim_cat_ord_set,ordered_set]),
verify_etsmem(EtsMem).
%% Privacy check. Check that a named(public/private/protected) table
%% cannot be read by the wrong process(es).
privacy(Config) when is_list(Config) ->
repeat_for_opts(fun privacy_do/1).
privacy_do(Opts) ->
EtsMem = etsmem(),
process_flag(trap_exit,true),
Parent = self(),
Owner = my_spawn_link(fun() -> privacy_owner(Parent, Opts) end),
receive
{'EXIT',Owner,Reason} ->
exit({privacy_test,Reason});
ok ->
ok
end,
privacy_check(pub,prot,priv),
Owner ! {shift,1,{pub,prot,priv}},
receive
{Pub1,Prot1,Priv1} ->
ok = privacy_check(Pub1,Prot1,Priv1),
Owner ! {shift,2,{Pub1,Prot1,Priv1}}
end,
receive
{Pub2,Prot2,Priv2} ->
ok = privacy_check(Pub2,Prot2,Priv2),
Owner ! {shift,0,{Pub2,Prot2,Priv2}}
end,
receive
{Pub3,Prot3,Priv3} ->
ok = privacy_check(Pub3,Prot3,Priv3)
end,
Owner ! die,
receive {'EXIT',Owner,_} -> ok end,
verify_etsmem(EtsMem).
privacy_check(Pub,Prot,Priv) ->
%% check read rights
[] = ets:lookup(Pub, foo),
[] = ets:lookup(Prot,foo),
{'EXIT',{badarg,_}} = (catch ets:lookup(Priv,foo)),
%% check write rights
true = ets:insert(Pub, {1,foo}),
{'EXIT',{badarg,_}} = (catch ets:insert(Prot,{2,foo})),
{'EXIT',{badarg,_}} = (catch ets:insert(Priv,{3,foo})),
%% check that it really wasn't written, either
[] = ets:lookup(Prot,foo),
ok.
privacy_owner(Boss, Opts) ->
ets_new(pub, [public,named_table | Opts]),
ets_new(prot,[protected,named_table | Opts]),
ets_new(priv,[private,named_table | Opts]),
Boss ! ok,
privacy_owner_loop(Boss).
privacy_owner_loop(Boss) ->
receive
{shift,N,Pub_Prot_Priv} ->
{Pub,Prot,Priv} = rotate_tuple(Pub_Prot_Priv, N),
ets:setopts(Pub,{protection,public}),
ets:setopts(Prot,{protection,protected}),
ets:setopts(Priv,{protection,private}),
Boss ! {Pub,Prot,Priv},
privacy_owner_loop(Boss);
die -> ok
end.
rotate_tuple(Tuple, 0) ->
Tuple;
rotate_tuple(Tuple, N) ->
[H|T] = tuple_to_list(Tuple),
rotate_tuple(list_to_tuple(T ++ [H]), N-1).
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%% Check lookup in an empty table and lookup of a non-existing key.
empty(Config) when is_list(Config) ->
repeat_for_opts_all_table_types(fun empty_do/1).
empty_do(Opts) ->
EtsMem = etsmem(),
Tab = ets_new(foo,Opts),
[] = ets:lookup(Tab,key),
true = ets:insert(Tab,{key2,val}),
[] = ets:lookup(Tab,key),
true = ets:delete(Tab),
verify_etsmem(EtsMem).
%% Check proper return values for illegal insert operations.
badinsert(Config) when is_list(Config) ->
repeat_for_opts_all_table_types(fun badinsert_do/1).
badinsert_do(Opts) ->
EtsMem = etsmem(),
{'EXIT',{badarg,_}} = (catch ets:insert(foo,{key,val})),
Tab = ets_new(foo,Opts),
{'EXIT',{badarg,_}} = (catch ets:insert(Tab,{})),
Tab3 = ets_new(foo,[{keypos,3}| Opts]),
{'EXIT',{badarg,_}} = (catch ets:insert(Tab3,{a,b})),
{'EXIT',{badarg,_}} = (catch ets:insert(Tab,[key,val2])),
true = ets:delete(Tab),
true = ets:delete(Tab3),
verify_etsmem(EtsMem).
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%% Test lookup timing.
time_lookup(Config) when is_list(Config) ->
%% just for timing, really
EtsMem = etsmem(),
Values = repeat_for_opts_all_table_types(fun time_lookup_do/1),
verify_etsmem(EtsMem),
{comment,lists:flatten(io_lib:format(
"~p ets lookups/s",[Values]))}.
time_lookup_do(Opts) ->
Tab = ets_new(foo,Opts),
fill_tab(Tab,foo),
ets:insert(Tab,{{a,key},foo}),
N = 100000,
{Time,_} = timer:tc(fun() -> time_lookup_many(N, Tab) end),
Seconds = Time / 1000000,
true = ets:delete(Tab),
round(N / Seconds). % lookups/s
time_lookup_many(0, _Tab) ->
ok;
time_lookup_many(N, Tab) ->
ets:lookup(Tab, {a,key}),
time_lookup_many(N-1, Tab).
%% Check proper return values from bad lookups in existing/non existing
%% ets tables.
badlookup(Config) when is_list(Config) ->
EtsMem = etsmem(),
{'EXIT',{badarg,_}} = (catch ets:lookup(foo,key)),
Tab = ets_new(foo,[]),
ets:delete(Tab),
{'EXIT',{badarg,_}} = (catch ets:lookup(Tab,key)),
verify_etsmem(EtsMem).
%% Test that lookup returns objects in order of insertion for bag and dbag.
lookup_order(Config) when is_list(Config) ->
EtsMem = etsmem(),
repeat_for_opts(fun lookup_order_do/1,
[write_concurrency,[bag,duplicate_bag]]),
verify_etsmem(EtsMem),
ok.
lookup_order_do(Opts) ->
lookup_order_2(Opts, false),
lookup_order_2(Opts, true).
lookup_order_2(Opts, Fixed) ->
io:format("Opts=~p Fixed=~p\n",[Opts,Fixed]),
A = 1, B = 2, C = 3,
ABC = [A,B,C],
Pair = [{A,B},{B,A},{A,C},{C,A},{B,C},{C,B}],
Combos = [{D1,D2,D3} || D1<-ABC, D2<-Pair, D3<-Pair],
lists:foreach(fun({D1,{D2a,D2b},{D3a,D3b}}) ->
T = ets_new(foo,Opts),
case Fixed of
true -> ets:safe_fixtable(T,true);
false -> ok
end,
S10 = {T,[],key},
S20 = check_insert(S10,A),
S30 = check_insert(S20,B),
S40 = check_insert(S30,C),
S50 = check_delete(S40,D1),
S55 = check_insert(S50,D1),
S60 = check_insert(S55,D1),
S70 = check_delete(S60,D2a),
S80 = check_delete(S70,D2b),
S90 = check_insert(S80,D2a),
SA0 = check_delete(S90,D3a),
SB0 = check_delete(SA0,D3b),
check_insert_new(SB0,D3b),
true = ets:delete(T)
end,
Combos).
check_insert({T,List0,Key},Val) ->
%%io:format("insert ~p into ~p\n",[Val,List0]),
ets:insert(T,{Key,Val}),
List1 = case (ets:info(T,type) =:= bag andalso
lists:member({Key,Val},List0)) of
true -> List0;
false -> [{Key,Val} | List0]
end,
check_check({T,List1,Key}).
check_insert_new({T,List0,Key},Val) ->
%%io:format("insert_new ~p into ~p\n",[Val,List0]),
Ret = ets:insert_new(T,{Key,Val}),
Ret = (List0 =:= []),
List1 = case Ret of
true -> [{Key,Val}];
false -> List0
end,
check_check({T,List1,Key}).
check_delete({T,List0,Key},Val) ->
%%io:format("delete ~p from ~p\n",[Val,List0]),
ets:delete_object(T,{Key,Val}),
List1 = lists:filter(fun(Obj) -> Obj =/= {Key,Val} end,
List0),
check_check({T,List1,Key}).
check_check(S={T,List,Key}) ->
case lists:reverse(ets:lookup(T,Key)) of
List -> ok;
ETS -> io:format("check failed:\nETS: ~p\nCHK: ~p\n", [ETS,List]),
ct:fail("Invalid return value from ets:lookup")
end,
Items = ets:info(T,size),
Items = length(List),
S.
fill_tab(Tab,Val) ->
ets:insert(Tab,{key,Val}),
ets:insert(Tab,{{a,144},Val}),
ets:insert(Tab,{{a,key2},Val}),
ets:insert(Tab,{14,Val}),
ok.
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%% OTP-2386. Multiple return elements.
lookup_element_mult(Config) when is_list(Config) ->
repeat_for_opts(fun lookup_element_mult_do/1).
lookup_element_mult_do(Opts) ->
EtsMem = etsmem(),
T = ets_new(service, [bag, {keypos, 2} | Opts]),
D = lists:reverse(lem_data()),
lists:foreach(fun(X) -> ets:insert(T, X) end, D),
ok = lem_crash_3(T),
ets:insert(T, {0, "heap_key"}),
ets:lookup_element(T, "heap_key", 2),
true = ets:delete(T),
verify_etsmem(EtsMem).
lem_data() ->
[{service,'eddie2@boromir',{150,236,14,103},httpd88,self()},
{service,'eddie2@boromir',{150,236,14,103},httpd80,self()},
{service,'eddie3@boromir',{150,236,14,107},httpd88,self()},
{service,'eddie3@boromir',{150,236,14,107},httpd80,self()},
{service,'eddie4@boromir',{150,236,14,108},httpd88,self()}].
lem_crash(T) ->
L = ets:lookup_element(T, 'eddie2@boromir', 3),
{erlang:phash(L, 256), L}.
lem_crash_3(T) ->
lem_crash(T),
io:format("Survived once~n"),
lem_crash(T),
io:format("Survived twice~n"),
lem_crash(T),
io:format("Survived all!~n"),
ok.
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%% Check delete of an element inserted in a `filled' table.
delete_elem(Config) when is_list(Config) ->
repeat_for_opts(fun delete_elem_do/1,
[write_concurrency, all_types]).
delete_elem_do(Opts) ->
EtsMem = etsmem(),
Tab = ets_new(foo,Opts),
fill_tab(Tab,foo),
ets:insert(Tab,{{b,key},foo}),
ets:insert(Tab,{{c,key},foo}),
true = ets:delete(Tab,{b,key}),
[] = ets:lookup(Tab,{b,key}),
[{{c,key},foo}] = ets:lookup(Tab,{c,key}),
true = ets:delete(Tab),
verify_etsmem(EtsMem).
%% Check that ets:delete() works and releases the name of the
%% deleted table.
delete_tab(Config) when is_list(Config) ->
repeat_for_opts(fun delete_tab_do/1,
[write_concurrency,all_types]).
delete_tab_do(Opts) ->
Name = foo,
EtsMem = etsmem(),
Name = ets_new(Name, [named_table | Opts]),
true = ets:delete(foo),
%% The name should be available again.
Name = ets_new(Name, [named_table | Opts]),
true = ets:delete(Name),
verify_etsmem(EtsMem).
%% Check that ets:delete/1 works and that other processes can run.
delete_large_tab(Config) when is_list(Config) ->
ct:timetrap({minutes,60}), %% valgrind needs a lot
KeyRange = 16#ffffff,
Data = [{erlang:phash2(I, KeyRange),I} || I <- lists:seq(1, 200000)],
EtsMem = etsmem(),
repeat_for_opts(fun(Opts) -> delete_large_tab_do(key_range(Opts,KeyRange),
Data) end),
verify_etsmem(EtsMem).
delete_large_tab_do(Opts,Data) ->
delete_large_tab_1(foo_hash, Opts, Data, false),
delete_large_tab_1(foo_tree, [ordered_set | Opts], Data, false),
delete_large_tab_1(foo_tree, [stim_cat_ord_set | Opts], Data, false),
delete_large_tab_1(foo_hash_fix, Opts, Data, true).
delete_large_tab_1(Name, Flags, Data, Fix) ->
case is_redundant_opts_combo(Flags) of
true -> skip;
false ->
delete_large_tab_2(Name, Flags, Data, Fix)
end.
delete_large_tab_2(Name, Flags, Data, Fix) ->
Tab = ets_new(Name, Flags),
ets:insert(Tab, Data),
case Fix of
false -> ok;
true ->
true = ets:safe_fixtable(Tab, true),
lists:foreach(fun({K,_}) -> ets:delete(Tab, K) end, Data)
end,
{priority, Prio} = process_info(self(), priority),
Deleter = self(),
[SchedTracer]
= start_loopers(1,
Prio,
fun (SC) ->
receive
{trace, Deleter, out, _} ->
undefined = ets:info(Tab),
SC+1;
{trace,
Deleter,
register,
delete_large_tab_done_marker}->
Deleter ! {schedule_count, SC},
exit(normal);
_ ->
SC
end
end,
0),
SchedTracerMon = monitor(process, SchedTracer),
Loopers = start_loopers(erlang:system_info(schedulers),
Prio,
fun (_) -> erlang:yield() end,
ok),
erlang:yield(),
1 = erlang:trace(self(),true,[running,procs,{tracer,SchedTracer}]),
true = ets:delete(Tab),
%% The register stuff is just a trace marker
true = register(delete_large_tab_done_marker, self()),
true = unregister(delete_large_tab_done_marker),
undefined = ets:info(Tab),
ok = stop_loopers(Loopers),
receive
{schedule_count, N} ->
io:format("~s: context switches: ~p", [Name,N]),
if
N >= 5 -> ok;
true -> ct:fail(failed)
end
end,
receive {'DOWN',SchedTracerMon,process,SchedTracer,_} -> ok end,
ok.
%% Delete a large name table and try to create a new table with
%% the same name in another process.
delete_large_named_table(Config) when is_list(Config) ->
KeyRange = 16#ffffff,
Data = [{erlang:phash2(I, KeyRange),I} || I <- lists:seq(1, 200000)],
EtsMem = etsmem(),
repeat_for_opts(fun(Opts) ->
delete_large_named_table_do(key_range(Opts,KeyRange),
Data)
end),
verify_etsmem(EtsMem),
ok.
delete_large_named_table_do(Opts,Data) ->
delete_large_named_table_1(foo_hash, [named_table | Opts], Data, false),
delete_large_named_table_1(foo_tree, [ordered_set,named_table | Opts], Data, false),
delete_large_named_table_1(foo_tree, [stim_cat_ord_set,named_table | Opts], Data, false),
delete_large_named_table_1(foo_hash, [named_table | Opts], Data, true).
delete_large_named_table_1(Name, Flags, Data, Fix) ->
case is_redundant_opts_combo(Flags) of
true -> skip;
false ->
delete_large_named_table_2(Name, Flags, Data, Fix)
end.
delete_large_named_table_2(Name, Flags, Data, Fix) ->
Tab = ets_new(Name, Flags),
ets:insert(Tab, Data),
case Fix of
false -> ok;
true ->
true = ets:safe_fixtable(Tab, true),
lists:foreach(fun({K,_}) -> ets:delete(Tab, K) end, Data)
end,
{Pid, MRef} = my_spawn_opt(fun() ->
receive
ets_new ->
ets_new(Name, [named_table])
end
end,
[link, monitor]),
true = ets:delete(Tab),
Pid ! ets_new,
receive {'DOWN',MRef,process,Pid,_} -> ok end,
ok.
%% Delete a large table, and kill the process during the delete.
evil_delete(Config) when is_list(Config) ->
KeyRange = 100000,
Data = [{I,I*I} || I <- lists:seq(1, KeyRange)],
repeat_for_opts(fun(Opts) ->
evil_delete_do(key_range(Opts,KeyRange),
Data)
end).
evil_delete_do(Opts,Data) ->
EtsMem = etsmem(),
evil_delete_owner(foo_hash, Opts, Data, false),
verify_etsmem(EtsMem),
evil_delete_owner(foo_hash, Opts, Data, true),
verify_etsmem(EtsMem),
evil_delete_owner(foo_tree, [ordered_set | Opts], Data, false),
verify_etsmem(EtsMem),
evil_delete_owner(foo_catree, [stim_cat_ord_set | Opts], Data, false),
verify_etsmem(EtsMem),
TabA = evil_delete_not_owner(foo_hash, Opts, Data, false),
verify_etsmem(EtsMem),
TabB = evil_delete_not_owner(foo_hash, Opts, Data, true),
verify_etsmem(EtsMem),
TabC = evil_delete_not_owner(foo_tree, [ordered_set | Opts], Data, false),
verify_etsmem(EtsMem),
TabD = evil_delete_not_owner(foo_catree, [stim_cat_ord_set | Opts], Data, false),
verify_etsmem(EtsMem),
lists:foreach(fun(T) -> undefined = ets:info(T) end,
[TabA,TabB,TabC,TabD]).
evil_delete_not_owner(Name, Flags, Data, Fix) ->
case is_redundant_opts_combo(Flags) of
true -> skip;
false ->
evil_delete_not_owner_1(Name, Flags, Data, Fix)
end.
evil_delete_not_owner_1(Name, Flags, Data, Fix) ->
io:format("Not owner: ~p, fix = ~p", [Name,Fix]),
Tab = ets_new(Name, [public|Flags]),
ets:insert(Tab, Data),
case Fix of
false -> ok;
true ->
true = ets:safe_fixtable(Tab, true),
lists:foreach(fun({K,_}) -> ets:delete(Tab, K) end, Data)
end,
Pid = my_spawn(fun() ->
P = my_spawn_link(
fun() ->
receive kill -> ok end,
erlang:yield(),
exit(kill_linked_processes_now)
end),
erlang:yield(),
P ! kill,
true = ets:delete(Tab)
end),
Ref = erlang:monitor(process, Pid),
receive {'DOWN',Ref,_,_,_} -> ok end,
Tab.
evil_delete_owner(Name, Flags, Data, Fix) ->
case is_redundant_opts_combo(Flags) of
true -> skip;
false ->
evil_delete_owner_1(Name, Flags, Data, Fix)
end.
evil_delete_owner_1(Name, Flags, Data, Fix) ->
Fun = fun() ->
Tab = ets_new(Name, [public|Flags]),
ets:insert(Tab, Data),
case Fix of
false -> ok;
true ->
true = ets:safe_fixtable(Tab, true),
lists:foreach(fun({K,_}) ->
ets:delete(Tab, K)
end, Data)
end,
erlang:yield(),
my_spawn_link(fun() ->
erlang:yield(),
exit(kill_linked_processes_now)
end),
true = ets:delete(Tab)
end,
Pid = my_spawn(Fun),
Ref = erlang:monitor(process, Pid),
receive {'DOWN',Ref,_,_,_} -> ok end.
exit_large_table_owner(Config) when is_list(Config) ->
%%Data = [{erlang:phash2(I, 16#ffffff),I} || I <- lists:seq(1, 500000)],
Laps = 500000 div syrup_factor(),
FEData = fun(Do) -> repeat_while(fun(I) when I =:= Laps -> {false,ok};
(I) -> Do({erlang:phash2(I, 16#ffffff),I}),
{true, I+1}
end, 1)
end,
EtsMem = etsmem(),
repeat_for_opts(fun(Opts) ->
exit_large_table_owner_do(Opts,
FEData,
Config)
end),
verify_etsmem(EtsMem).
exit_large_table_owner_do(Opts, FEData, Config) ->
verify_rescheduling_exit(Config, FEData, [named_table | Opts], true, 1, 1),
verify_rescheduling_exit(Config, FEData, Opts, false, 1, 1).
exit_many_large_table_owner(Config) when is_list(Config) ->
ct:timetrap({minutes,30}), %% valgrind needs a lot
%%Data = [{erlang:phash2(I, 16#ffffff),I} || I <- lists:seq(1, 500000)],
Laps = 500000 div syrup_factor(),
FEData = fun(Do) -> repeat_while(fun(I) when I =:= Laps -> {false,ok};
(I) -> Do({erlang:phash2(I, 16#ffffff),I}),
{true, I+1}
end, 1)
end,
EtsMem = etsmem(),
repeat_for_opts(fun(Opts) -> exit_many_large_table_owner_do(Opts,FEData,Config) end),
verify_etsmem(EtsMem).
exit_many_large_table_owner_do(Opts,FEData,Config) ->
verify_rescheduling_exit(Config, FEData, Opts, true, 1, 4),
verify_rescheduling_exit(Config, FEData, [named_table | Opts], false, 1, 4).
exit_many_tables_owner(Config) when is_list(Config) ->
NoData = fun(_Do) -> ok end,
EtsMem = etsmem(),
verify_rescheduling_exit(Config, NoData, [named_table], false, 1000, 1),
verify_rescheduling_exit(Config, NoData, [named_table,{write_concurrency,true}], false, 1000, 1),
verify_etsmem(EtsMem).
exit_many_many_tables_owner(Config) when is_list(Config) ->
Data = [{erlang:phash2(I, 16#ffffff),I} || I <- lists:seq(1, 50)],
FEData = fun(Do) -> lists:foreach(Do, Data) end,
repeat_for_opts(fun(Opts) -> exit_many_many_tables_owner_do(Opts,FEData,Config) end).
exit_many_many_tables_owner_do(Opts,FEData,Config) ->
verify_rescheduling_exit(Config, FEData, [named_table | Opts], true, 200, 5),
verify_rescheduling_exit(Config, FEData, Opts, false, 200, 5),
wait_for_test_procs(),
EtsMem = etsmem(),
verify_rescheduling_exit(Config, FEData, Opts, true, 200, 5),
verify_rescheduling_exit(Config, FEData, [named_table | Opts], false, 200, 5),
verify_etsmem(EtsMem).
count_exit_sched(TP) ->
receive
{trace, TP, in_exiting, 0} ->
count_exit_sched_out(TP, 1);
{trace, TP, out_exiting, 0} ->
count_exit_sched_in(TP, 1);
{trace, TP, out_exited, 0} ->
0
end.
count_exit_sched_in(TP, N) ->
receive
{trace, TP, in_exiting, 0} ->
count_exit_sched_out(TP, N);
{trace, TP, _, _} = Msg ->
exit({unexpected_trace_msg, Msg})
end.
count_exit_sched_out(TP, N) ->
receive
{trace, TP, out_exiting, 0} ->
count_exit_sched_in(TP, N+1);
{trace, TP, out_exited, 0} ->
N;
{trace, TP, _, _} = Msg ->
exit({unexpected_trace_msg, Msg})
end.
vre_fix_tables(Tab) ->
Parent = self(),
Go = make_ref(),
my_spawn_link(fun () ->
true = ets:safe_fixtable(Tab, true),
Parent ! Go,
receive infinity -> ok end
end),
receive Go -> ok end,
ok.
verify_rescheduling_exit(Config, ForEachData, Flags, Fix, NOTabs, NOProcs) ->
NoFix = 5,
TestCase = atom_to_list(proplists:get_value(test_case, Config)),
Parent = self(),
KillMe = make_ref(),
PFun =
fun () ->
repeat(
fun () ->
Uniq = erlang:unique_integer([positive]),
Name = list_to_atom(TestCase ++ "-" ++
integer_to_list(Uniq)),
Tab = ets_new(Name, Flags),
ForEachData(fun(Data) -> ets:insert(Tab, Data) end),
case Fix of
false -> ok;
true ->
lists:foreach(fun (_) ->
vre_fix_tables(Tab)
end,
lists:seq(1,NoFix)),
KeyPos = ets:info(Tab,keypos),
ForEachData(fun(Data) ->
ets:delete(Tab, element(KeyPos,Data))
end)
end
end,
NOTabs),
Parent ! {KillMe, self()},
receive after infinity -> ok end
end,
TPs = lists:map(fun (_) ->
TP = my_spawn_link(PFun),
1 = erlang:trace(TP, true, [exiting]),
TP
end,
lists:seq(1, NOProcs)),
lists:foreach(fun (TP) ->
receive {KillMe, TP} -> ok end
end,
TPs),
LPs = start_loopers(erlang:system_info(schedulers),
normal,
fun (_) ->
erlang:yield()
end,
ok),
lists:foreach(fun (TP) ->
unlink(TP),
exit(TP, bang)
end,
TPs),
lists:foreach(fun (TP) ->
XScheds = count_exit_sched(TP),
io:format("~p XScheds=~p~n",
[TP, XScheds]),
true = XScheds >= 3
end,
TPs),
stop_loopers(LPs),
ok.
%% Make sure that slots for ets tables are cleared properly.
table_leak(Config) when is_list(Config) ->
repeat_for_opts_all_non_stim_table_types(fun(Opts) -> table_leak_1(Opts,20000) end).
table_leak_1(_,0) -> ok;
table_leak_1(Opts,N) ->
T = ets_new(fooflarf, Opts),
true = ets:delete(T),
table_leak_1(Opts,N-1).
%% Check proper return values for illegal delete operations.
baddelete(Config) when is_list(Config) ->
EtsMem = etsmem(),
{'EXIT',{badarg,_}} = (catch ets:delete(foo)),
Tab = ets_new(foo,[]),
true = ets:delete(Tab),
{'EXIT',{badarg,_}} = (catch ets:delete(Tab)),
verify_etsmem(EtsMem).
%% Check that match_delete works. Also tests tab2list function.
match_delete(Config) when is_list(Config) ->
EtsMem = etsmem(),
repeat_for_opts(fun match_delete_do/1,
[write_concurrency,all_types]),
verify_etsmem(EtsMem).
match_delete_do(Opts) ->
EtsMem = etsmem(),
Tab = ets_new(kad,Opts),
fill_tab(Tab,foo),
ets:insert(Tab,{{c,key},bar}),
_ = ets:match_delete(Tab,{'_',foo}),
[{{c,key},bar}] = ets:tab2list(Tab),
_ = ets:match_delete(Tab,'_'),
[] = ets:tab2list(Tab),
true = ets:delete(Tab),
verify_etsmem(EtsMem).
%% OTP-3005: check match_delete with constant argument.
match_delete3(Config) when is_list(Config) ->
repeat_for_opts(fun match_delete3_do/1).
match_delete3_do(Opts) ->
EtsMem = etsmem(),
T = make_table(test,
[duplicate_bag | Opts],
[{aa,17},
{cA,1000},
{cA,17},
{cA,1000},
{aa,17}]),
%% 'aa' and 'cA' have the same hash value in the current
%% implementation. This causes the aa's to precede the cA's, to make
%% the test more interesting.
[{cA,1000},{cA,1000}] = ets:match_object(T, {'_', 1000}),
ets:match_delete(T, {cA,1000}),
[] = ets:match_object(T, {'_', 1000}),
ets:delete(T),
verify_etsmem(EtsMem).
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%% Test ets:first/1 & ets:next/2.
firstnext(Config) when is_list(Config) ->
repeat_for_opts_all_set_table_types(fun firstnext_do/1).
firstnext_do(Opts) ->
EtsMem = etsmem(),
Tab = ets_new(foo,Opts),
[] = firstnext_collect(Tab,ets:first(Tab),[]),
fill_tab(Tab,foo),
Len = length(ets:tab2list(Tab)),
Len = length(firstnext_collect(Tab,ets:first(Tab),[])),
true = ets:delete(Tab),
verify_etsmem(EtsMem).
firstnext_collect(_Tab,'$end_of_table',List) ->
List;
firstnext_collect(Tab,Key,List) ->
firstnext_collect(Tab,ets:next(Tab,Key),[Key|List]).
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%% Tests ets:first/1 & ets:next/2.
firstnext_concurrent(Config) when is_list(Config) ->
lists:foreach(
fun(TableType) ->
register(master, self()),
TableName = list_to_atom(atom_to_list(?MODULE) ++ atom_to_list(TableType)),
ets_init(TableName, 20, TableType),
[dynamic_go(TableName) || _ <- lists:seq(1, 2)],
receive
after 5000 -> ok
end,
unregister(master)
end, repeat_for_opts_atom2list(ord_set_types)).
ets_init(Tab, N, TableType) ->
ets_new(Tab, [named_table,public,TableType]),
cycle(Tab, lists:seq(1,N+1)).
cycle(_Tab, [H|T]) when H > length(T)-> ok;
cycle(Tab, L) ->
ets:insert(Tab,list_to_tuple(L)),
cycle(Tab, tl(L)++[hd(L)]).
dynamic_go(TableName) -> my_spawn_link(fun() -> dynamic_init(TableName) end).
dynamic_init(TableName) -> [dyn_lookup(TableName) || _ <- lists:seq(1, 10)].
dyn_lookup(T) -> dyn_lookup(T, ets:first(T)).
dyn_lookup(_T, '$end_of_table') -> [];
dyn_lookup(T, K) ->
NextKey = ets:next(T,K),
case ets:next(T,K) of
NextKey ->
dyn_lookup(T, NextKey);
NK ->
io:fwrite("hmmm... ~p =/= ~p~n", [NextKey,NK]),
exit(failed)
end.
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
slot(Config) when is_list(Config) ->
repeat_for_opts_all_set_table_types(fun slot_do/1).
slot_do(Opts) ->
EtsMem = etsmem(),
Tab = ets_new(foo,Opts),
fill_tab(Tab,foo),
Elts = ets:info(Tab,size),
Elts = slot_loop(Tab,0,0),
true = ets:delete(Tab),
verify_etsmem(EtsMem).
slot_loop(Tab,SlotNo,EltsSoFar) ->
case ets:slot(Tab,SlotNo) of
'$end_of_table' ->
{'EXIT',{badarg,_}} =
(catch ets:slot(Tab,SlotNo+1)),
EltsSoFar;
Elts ->
slot_loop(Tab,SlotNo+1,EltsSoFar+length(Elts))
end.
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
match1(Config) when is_list(Config) ->
repeat_for_opts_all_set_table_types(fun match1_do/1).
match1_do(Opts) ->
EtsMem = etsmem(),
Tab = ets_new(foo,Opts),
fill_tab(Tab,foo),
[] = ets:match(Tab,{}),
ets:insert(Tab,{{one,4},4}),
ets:insert(Tab,{{one,5},5}),
ets:insert(Tab,{{two,4},4}),
ets:insert(Tab,{{two,5},6}),
case ets:match(Tab,{{one,'_'},'$0'}) of
[[4],[5]] -> ok;
[[5],[4]] -> ok
end,
case ets:match(Tab,{{two,'$1'},'$0'}) of
[[4,4],[6,5]] -> ok;
[[6,5],[4,4]] -> ok
end,
case ets:match(Tab,{{two,'$9'},'$4'}) of
[[4,4],[6,5]] -> ok;
[[6,5],[4,4]] -> ok
end,
case ets:match(Tab,{{two,'$9'},'$22'}) of
[[4,4],[5,6]] -> ok;
[[5,6],[4,4]] -> ok
end,
[[4]] = ets:match(Tab,{{two,'$0'},'$0'}),
Len = length(ets:match(Tab,'$0')),
Len = length(ets:match(Tab,'_')),
if Len > 4 -> ok end,
true = ets:delete(Tab),
verify_etsmem(EtsMem).
%% Test match with specified keypos bag table.
match2(Config) when is_list(Config) ->
repeat_for_opts(fun match2_do/1).
match2_do(Opts) ->
EtsMem = etsmem(),
Tab = make_table(foobar,
[bag, named_table, {keypos, 2} | Opts],
[{value1, key1},
{value2_1, key2},
{value2_2, key2},
{value3_1, key3},
{value3_2, key3},
{value2_1, key2_wannabe}]),
case length(ets:match(Tab, '$1')) of
6 -> ok;
_ -> ct:fail("Length of matched list is wrong.")
end,
[[value3_1],[value3_2]] = ets:match(Tab, {'$1', key3}),
[[key1]] = ets:match(Tab, {value1, '$1'}),
[[key2_wannabe],[key2]] = ets:match(Tab, {value2_1, '$2'}),
[] = ets:match(Tab,{'$1',nosuchkey}),
[] = ets:match(Tab,{'$1',kgY2}), % same hash as key2
[] = ets:match(Tab,{nosuchvalue,'$1'}),
true = ets:delete(Tab),
verify_etsmem(EtsMem).
%% Some ets:match_object tests.
match_object(Config) when is_list(Config) ->
repeat_for_opts_all_set_table_types(fun match_object_do/1).
match_object_do(Opts) ->
EtsMem = etsmem(),
Tab = ets_new(foobar, Opts),
fill_tab(Tab, foo),
ets:insert(Tab,{{one,4},4}),
ets:insert(Tab,{{one,5},5}),
ets:insert(Tab,{{two,4},4}),
ets:insert(Tab,{{two,5},6}),
ets:insert(Tab, {#{camembert=>cabécou},7}),
ets:insert(Tab, {#{"hi"=>"hello","wazzup"=>"awesome","1337"=>"42"},8}),
ets:insert(Tab, {#{"hi"=>"hello",#{"wazzup"=>3}=>"awesome","1337"=>"42"},9}),
ets:insert(Tab, {#{"hi"=>"hello","wazzup"=>#{"awesome"=>3},"1337"=>"42"},10}),
Is = lists:seq(1,100),
M1 = maps:from_list([{I,I}||I <- Is]),
M2 = maps:from_list([{I,"hi"}||I <- Is]),
ets:insert(Tab, {M1,11}),
ets:insert(Tab, {M2,12}),
case ets:match_object(Tab, {{one, '_'}, '$0'}) of
[{{one,5},5},{{one,4},4}] -> ok;
[{{one,4},4},{{one,5},5}] -> ok;
_ -> ct:fail("ets:match_object() returned something funny.")
end,
case ets:match_object(Tab, {{two, '$1'}, '$0'}) of
[{{two,5},6},{{two,4},4}] -> ok;
[{{two,4},4},{{two,5},6}] -> ok;
_ -> ct:fail("ets:match_object() returned something funny.")
end,
case ets:match_object(Tab, {{two, '$9'}, '$4'}) of
[{{two,5},6},{{two,4},4}] -> ok;
[{{two,4},4},{{two,5},6}] -> ok;
_ -> ct:fail("ets:match_object() returned something funny.")
end,
case ets:match_object(Tab, {{two, '$9'}, '$22'}) of
[{{two,5},6},{{two,4},4}] -> ok;
[{{two,4},4},{{two,5},6}] -> ok;
_ -> ct:fail("ets:match_object() returned something funny.")
end,
%% Check that maps are inspected for variables.
[{#{camembert:=cabécou},7}] = ets:match_object(Tab, {#{camembert=>'_'},7}),
[{#{"hi":="hello",#{"wazzup"=>3}:="awesome","1337":="42"},9}] =
ets:match_object(Tab, {#{#{"wazzup"=>3}=>"awesome","hi"=>"hello","1337"=>"42"},9}),
[{#{"hi":="hello",#{"wazzup"=>3}:="awesome","1337":="42"},9}] =
ets:match_object(Tab, {#{#{"wazzup"=>3}=>"awesome","hi"=>"hello","1337"=>'_'},'_'}),
[{#{"hi":="hello","wazzup":=#{"awesome":=3},"1337":="42"},10}] =
ets:match_object(Tab, {#{"wazzup"=>'_',"hi"=>'_',"1337"=>'_'},10}),
%% multiple patterns
Pat = {{#{#{"wazzup"=>3}=>"awesome","hi"=>"hello","1337"=>'_'},'$1'},[{is_integer,'$1'}],['$_']},
[{#{"hi":="hello",#{"wazzup"=>3}:="awesome","1337":="42"},9}] =
ets:select(Tab, [Pat,Pat,Pat,Pat]),
case ets:match_object(Tab, {#{"hi"=>"hello","wazzup"=>'_',"1337"=>"42"},'_'}) of
[{#{"1337" := "42","hi" := "hello","wazzup" := "awesome"},8},
{#{"1337" := "42","hi" := "hello","wazzup" := #{"awesome" := 3}},10}] -> ok;
[{#{"1337" := "42","hi" := "hello","wazzup" := #{"awesome" := 3}},10},
{#{"1337" := "42","hi" := "hello","wazzup" := "awesome"},8}] -> ok;
_ -> ct:fail("ets:match_object() returned something funny.")
end,
case ets:match_object(Tab, {#{"hi"=>'_'},'_'}) of
[{#{"1337":="42", "hi":="hello"},_},
{#{"1337":="42", "hi":="hello"},_},
{#{"1337":="42", "hi":="hello"},_}] -> ok;
_ -> ct:fail("ets:match_object() returned something funny.")
end,
%% match large maps
[{#{1:=1,2:=2,99:=99,100:=100},11}] = ets:match_object(Tab, {M1,11}),
[{#{1:="hi",2:="hi",99:="hi",100:="hi"},12}] = ets:match_object(Tab, {M2,12}),
case ets:match_object(Tab, {#{1=>'_',2=>'_'},'_'}) of
%% only match a part of the map
[{#{1:=1,5:=5,99:=99,100:=100},11},{#{1:="hi",6:="hi",99:="hi"},12}] -> ok;
[{#{1:="hi",2:="hi",59:="hi"},12},{#{1:=1,2:=2,39:=39,100:=100},11}] -> ok;
_ -> ct:fail("ets:match_object() returned something funny.")
end,
case ets:match_object(Tab, {maps:from_list([{I,'_'}||I<-Is]),'_'}) of
%% only match a part of the map
[{#{1:=1,5:=5,99:=99,100:=100},11},{#{1:="hi",6:="hi",99:="hi"},12}] -> ok;
[{#{1:="hi",2:="hi",59:="hi"},12},{#{1:=1,2:=2,39:=39,100:=100},11}] -> ok;
_ -> ct:fail("ets:match_object() returned something funny.")
end,
{'EXIT',{badarg,_}} = (catch ets:match_object(Tab, {#{'$1'=>'_'},7})),
Mve = maps:from_list([{list_to_atom([$$|integer_to_list(I)]),'_'}||I<-Is]),
{'EXIT',{badarg,_}} = (catch ets:match_object(Tab, {Mve,11})),
%% Check that unsuccessful match returns an empty list.
[] = ets:match_object(Tab, {{three,'$0'}, '$92'}),
%% Check that '$0' equals '_'.
Len = length(ets:match_object(Tab, '$0')),
Len = length(ets:match_object(Tab, '_')),
if Len > 4 -> ok end,
true = ets:delete(Tab),
verify_etsmem(EtsMem).
%% Tests that db_match_object does not generate a `badarg' when
%% resuming a search with no previous matches.
match_object2(Config) when is_list(Config) ->
repeat_for_opts_all_table_types(fun match_object2_do/1).
match_object2_do(Opts) ->
EtsMem = etsmem(),
KeyRange = 13005,
Tab = ets_new(foo, [{keypos, 2} | Opts], KeyRange),
fill_tab2(Tab, 0, KeyRange), % match_db_object does 1000
% elements per pass, might
% change in the future.
[] = ets:match_object(Tab, {hej, '$1'}),
ets:delete(Tab),
verify_etsmem(EtsMem).
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%% OTP-3319. Test tab2list.
tab2list(Config) when is_list(Config) ->
repeat_for_all_ord_set_table_types(
fun(Opts) ->
EtsMem = etsmem(),
Tab = make_table(foo,
Opts,
[{a,b}, {c,b}, {b,b}, {a,c}]),
[{a,c},{b,b},{c,b}] = ets:tab2list(Tab),
true = ets:delete(Tab),
verify_etsmem(EtsMem)
end).
%% Simple general small test. If this fails, ets is in really bad
%% shape.
misc1(Config) when is_list(Config) ->
repeat_for_opts_all_table_types(fun misc1_do/1).
misc1_do(Opts) ->
EtsMem = etsmem(),
Tab = ets_new(foo,Opts),
true = lists:member(Tab,ets:all()),
ets:delete(Tab),
false = lists:member(Tab,ets:all()),
case catch ets:delete(Tab) of
{'EXIT',_Reason} ->
verify_etsmem(EtsMem);
true ->
ct:fail("Delete of nonexisting table returned `true'.")
end,
ok.
%% Check the safe_fixtable function.
safe_fixtable(Config) when is_list(Config) ->
repeat_for_opts_all_table_types(fun safe_fixtable_do/1).
safe_fixtable_do(Opts) ->
EtsMem = etsmem(),
Tab = ets_new(foo, Opts),
fill_tab(Tab, foobar),
true = ets:safe_fixtable(Tab, true),
receive after 1 -> ok end,
true = ets:safe_fixtable(Tab, false),
false = ets:info(Tab,safe_fixed_monotonic_time),
false = ets:info(Tab,safe_fixed),
SysBefore = erlang:timestamp(),
MonBefore = erlang:monotonic_time(),
true = ets:safe_fixtable(Tab, true),
MonAfter = erlang:monotonic_time(),
SysAfter = erlang:timestamp(),
Self = self(),
{FixMonTime,[{Self,1}]} = ets:info(Tab,safe_fixed_monotonic_time),
{FixSysTime,[{Self,1}]} = ets:info(Tab,safe_fixed),
true = is_integer(FixMonTime),
true = MonBefore =< FixMonTime,
true = FixMonTime =< MonAfter,
{FstMs,FstS,FstUs} = FixSysTime,
true = is_integer(FstMs),
true = is_integer(FstS),
true = is_integer(FstUs),
case erlang:system_info(time_warp_mode) of
no_time_warp ->
true = timer:now_diff(FixSysTime, SysBefore) >= 0,
true = timer:now_diff(SysAfter, FixSysTime) >= 0;
_ ->
%% ets:info(Tab,safe_fixed) not timewarp safe...
ignore
end,
%% Test that an unjustified 'unfix' is a no-op.
{Pid,MRef} = my_spawn_monitor(fun() -> true = ets:safe_fixtable(Tab,false) end),
{'DOWN', MRef, process, Pid, normal} = receive M -> M end,
true = ets:info(Tab,fixed),
{FixMonTime,[{Self,1}]} = ets:info(Tab,safe_fixed_monotonic_time),
{FixSysTime,[{Self,1}]} = ets:info(Tab,safe_fixed),
%% badarg's
{'EXIT', {badarg, _}} = (catch ets:safe_fixtable(Tab, foobar)),
true = ets:info(Tab,fixed),
true = ets:safe_fixtable(Tab, false),
false = ets:info(Tab,fixed),
{'EXIT', {badarg, _}} = (catch ets:safe_fixtable(Tab, foobar)),
false = ets:info(Tab,fixed),
ets:delete(Tab),
case catch ets:safe_fixtable(Tab, true) of
{'EXIT', _Reason} ->
verify_etsmem(EtsMem);
_ ->
ct:fail("Fixtable on nonexisting table returned `true'")
end,
ok.
%% Tests ets:info result for required tuples.
info(Config) when is_list(Config) ->
repeat_for_opts_all_table_types(fun info_do/1).
info_do(Opts) ->
EtsMem = etsmem(),
TableType = lists:foldl(
fun(Item, Curr) ->
case Item of
set -> set;
ordered_set -> ordered_set;
cat_ord_set -> ordered_set;
stim_cat_ord_set -> ordered_set;
bag -> bag;
duplicate_bag -> duplicate_bag;
_ -> Curr
end
end, set, Opts),
PublicOrCurr =
fun(Curr) ->
case lists:member({write_concurrency, false}, Opts) or
lists:member(private, Opts) or
lists:member(protected, Opts) of
true -> Curr;
false -> public
end
end,
Protection = lists:foldl(
fun(Item, Curr) ->
case Item of
public -> public;
protected -> protected;
private -> private;
cat_ord_set -> PublicOrCurr(Curr); %% Special items
stim_cat_ord_set -> PublicOrCurr(Curr);
_ -> Curr
end
end, protected, Opts),
MeMyselfI=self(),
ThisNode=node(),
Tab = ets_new(foobar, [{keypos, 2} | Opts]),
%% Note: ets:info/1 used to return a tuple, but from R11B onwards it
%% returns a list.
Res = ets:info(Tab),
{value, {memory, _Mem}} = lists:keysearch(memory, 1, Res),
{value, {owner, MeMyselfI}} = lists:keysearch(owner, 1, Res),
{value, {name, foobar}} = lists:keysearch(name, 1, Res),
{value, {size, 0}} = lists:keysearch(size, 1, Res),
{value, {node, ThisNode}} = lists:keysearch(node, 1, Res),
{value, {named_table, false}} = lists:keysearch(named_table, 1, Res),
{value, {type, TableType}} = lists:keysearch(type, 1, Res),
{value, {keypos, 2}} = lists:keysearch(keypos, 1, Res),
{value, {protection, Protection}} =
lists:keysearch(protection, 1, Res),
{value, {id, Tab}} = lists:keysearch(id, 1, Res),
true = ets:delete(Tab),
undefined = ets:info(non_existing_table_xxyy),
undefined = ets:info(non_existing_table_xxyy,type),
undefined = ets:info(non_existing_table_xxyy,node),
undefined = ets:info(non_existing_table_xxyy,named_table),
undefined = ets:info(non_existing_table_xxyy,safe_fixed_monotonic_time),
undefined = ets:info(non_existing_table_xxyy,safe_fixed),
verify_etsmem(EtsMem).
%% Test various duplicate_bags stuff.
dups(Config) when is_list(Config) ->
repeat_for_opts(fun dups_do/1).
dups_do(Opts) ->
EtsMem = etsmem(),
T = make_table(funky,
[duplicate_bag | Opts],
[{1, 2}, {1, 2}]),
2 = length(ets:tab2list(T)),
ets:delete(T, 1),
[] = ets:lookup(T, 1),
ets:insert(T, {1, 2, 2}),
ets:insert(T, {1, 2, 4}),
ets:insert(T, {1, 2, 2}),
ets:insert(T, {1, 2, 2}),
ets:insert(T, {1, 2, 4}),
5 = length(ets:tab2list(T)),
5 = length(ets:match(T, {'$1', 2, '$2'})),
3 = length(ets:match(T, {'_', '$1', '$1'})),
ets:match_delete(T, {'_', '$1', '$1'}),
0 = length(ets:match(T, {'_', '$1', '$1'})),
ets:delete(T),
verify_etsmem(EtsMem).
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%% Test the ets:tab2file function on an empty ets table.
tab2file(Config) when is_list(Config) ->
FName = filename:join([proplists:get_value(priv_dir, Config),"tab2file_case"]),
tab2file_do(FName, [], set),
tab2file_do(FName, [], ordered_set),
tab2file_do(FName, [], cat_ord_set),
tab2file_do(FName, [], stim_cat_ord_set),
tab2file_do(FName, [{sync,true}], set),
tab2file_do(FName, [{sync,false}], set),
{'EXIT',{{badmatch,{error,_}},_}} = (catch tab2file_do(FName, [{sync,yes}], set)),
{'EXIT',{{badmatch,{error,_}},_}} = (catch tab2file_do(FName, [sync], set)),
ok.
tab2file_do(FName, Opts, TableType) ->
%% Write an empty ets table to a file, read back and check properties.
Tab = ets_new(ets_SUITE_foo_tab, [named_table, TableType, public,
{keypos, 2},
compressed,
{write_concurrency,true},
{read_concurrency,true}]),
ActualTableType =
case TableType of
cat_ord_set -> ordered_set;
stim_cat_ord_set -> ordered_set;
_ -> TableType
end,
catch file:delete(FName),
Res = ets:tab2file(Tab, FName, Opts),
true = ets:delete(Tab),
ok = Res,
%%
EtsMem = etsmem(),
{ok, Tab2} = ets:file2tab(FName),
public = ets:info(Tab2, protection),
true = ets:info(Tab2, named_table),
2 = ets:info(Tab2, keypos),
ActualTableType = ets:info(Tab2, type),
true = ets:info(Tab2, compressed),
Smp = erlang:system_info(smp_support),
Smp = ets:info(Tab2, read_concurrency),
Smp = ets:info(Tab2, write_concurrency),
true = ets:delete(Tab2),
verify_etsmem(EtsMem).
%% Check the ets:tab2file function on a filled set/bag type ets table.
tab2file2(Config) when is_list(Config) ->
repeat_for_opts(fun(Opts) ->
tab2file2_do(Opts, Config)
end, [[stim_cat_ord_set,cat_ord_set,set,bag],compressed]).
tab2file2_do(Opts, Config) ->
EtsMem = etsmem(),
KeyRange = 10000,
Tab = ets_new(ets_SUITE_foo_tab, [named_table, private, {keypos, 2} | Opts],
KeyRange),
FName = filename:join([proplists:get_value(priv_dir, Config),"tab2file2_case"]),
ok = fill_tab2(Tab, 0, KeyRange), % Fill up the table (grucho mucho!)
Len = length(ets:tab2list(Tab)),
Mem = ets:info(Tab, memory),
Type = ets:info(Tab, type),
%%io:format("org tab: ~p\n",[ets:info(Tab)]),
ok = ets:tab2file(Tab, FName),
true = ets:delete(Tab),
EtsMem4 = etsmem(),
{ok, Tab2} = ets:file2tab(FName),
%%io:format("loaded tab: ~p\n",[ets:info(Tab2)]),
private = ets:info(Tab2, protection),
true = ets:info(Tab2, named_table),
2 = ets:info(Tab2, keypos),
Type = ets:info(Tab2, type),
Len = length(ets:tab2list(Tab2)),
Mem = ets:info(Tab2, memory),
true = ets:delete(Tab2),
io:format("Between = ~p\n", [EtsMem4]),
verify_etsmem(EtsMem).
-define(test_list, [8,5,4,1,58,125,255, 250, 245, 240, 235,
230, Num rem 255, 255, 125, 130, 135, 140, 145,
150, 134, 12, 54, Val rem 255, 12, 3, 6, 9, 126]).
-define(big_test_list, [Num rem 256|lists:seq(1, 66)]).
-define(test_integer, 2846287468+Num).
-define(test_float, 187263.18236-Val).
-define(test_atom, some_crazy_atom).
-define(test_tuple, {just, 'Some', 'Tuple', 1, [list, item], Val+Num}).
%% Insert different datatypes into a ets table.
fill_tab2(_Tab, _Val, 0) ->
ok;
fill_tab2(Tab, Val, Num) ->
Item =
case Num rem 10 of
0 -> "String";
1 -> ?test_atom;
2 -> ?test_tuple;
3 -> ?test_integer;
4 -> ?test_float;
5 -> list_to_binary(?test_list); %Heap binary
6 -> list_to_binary(?big_test_list); %Refc binary
7 -> make_sub_binary(?test_list, Num); %Sub binary
8 -> ?test_list;
9 -> fun(X) -> {Tab,Val,X*Num} end
end,
true=ets:insert(Tab, {Item, Val}),
fill_tab2(Tab, Val+1, Num-1),
ok.
%% Test verification of tables with object count extended_info.
tabfile_ext1(Config) when is_list(Config) ->
repeat_for_opts_all_set_table_types(fun(Opts) -> tabfile_ext1_do(Opts, Config) end).
tabfile_ext1_do(Opts,Config) ->
FName = filename:join([proplists:get_value(priv_dir, Config),"nisse.dat"]),
FName2 = filename:join([proplists:get_value(priv_dir, Config),"countflip.dat"]),
KeyRange = 10,
L = lists:seq(1,KeyRange),
T = ets_new(x,Opts,KeyRange),
Name = make_ref(),
[ets:insert(T,{X,integer_to_list(X)}) || X <- L],
ok = ets:tab2file(T,FName,[{extended_info,[object_count]}]),
true = lists:sort(ets:tab2list(T)) =:=
lists:sort(ets:tab2list(element(2,ets:file2tab(FName)))),
true = lists:sort(ets:tab2list(T)) =:=
lists:sort(ets:tab2list(
element(2,ets:file2tab(FName,[{verify,true}])))),
{ok,Name} = disk_log:open([{name,Name},{file,FName}]),
{_,[H0|T0]} = disk_log:chunk(Name,start),
disk_log:close(Name),
LH0=tuple_to_list(H0),
{value,{size,N}}=lists:keysearch(size,1,LH0),
NewLH0 = lists:keyreplace(size,1,LH0,{size,N-1}),
NewH0 = list_to_tuple(NewLH0),
NewT0=lists:keydelete(8,1,T0),
file:delete(FName2),
disk_log:open([{name,Name},{file,FName2},{mode,read_write}]),
disk_log:log_terms(Name,[NewH0|NewT0]),
disk_log:close(Name),
9 = length(ets:tab2list(element(2,ets:file2tab(FName2)))),
{error,invalid_object_count} = ets:file2tab(FName2,[{verify,true}]),
{ok, _} = ets:tabfile_info(FName2),
{ok, _} = ets:tabfile_info(FName),
file:delete(FName),
file:delete(FName2),
ok.
%% Test verification of tables with md5sum extended_info.
tabfile_ext2(Config) when is_list(Config) ->
repeat_for_opts_all_set_table_types(fun(Opts) -> tabfile_ext2_do(Opts,Config) end).
tabfile_ext2_do(Opts,Config) ->
FName = filename:join([proplists:get_value(priv_dir, Config),"olle.dat"]),
FName2 = filename:join([proplists:get_value(priv_dir, Config),"bitflip.dat"]),
KeyRange = 10,
L = lists:seq(1, KeyRange),
T = ets_new(x, Opts, KeyRange),
Name = make_ref(),
[ets:insert(T,{X,integer_to_list(X)}) || X <- L],
ok = ets:tab2file(T,FName,[{extended_info,[md5sum]}]),
true = lists:sort(ets:tab2list(T)) =:=
lists:sort(ets:tab2list(element(2,ets:file2tab(FName)))),
true = lists:sort(ets:tab2list(T)) =:=
lists:sort(ets:tab2list(
element(2,ets:file2tab(FName,[{verify,true}])))),
{ok, Name} = disk_log:open([{name,Name},{file,FName}]),
{_,[H1|T1]} = disk_log:chunk(Name,start),
disk_log:close(Name),
NewT1=lists:keyreplace(8,1,T1,{8,"9"}),
file:delete(FName2),
disk_log:open([{name,Name},{file,FName2},{mode,read_write}]),
disk_log:log_terms(Name,[H1|NewT1]),
disk_log:close(Name),
{value,{8,"9"}} = lists:keysearch(8,1,
ets:tab2list(
element(2,ets:file2tab(FName2)))),
{error,checksum_error} = ets:file2tab(FName2,[{verify,true}]),
{value,{extended_info,[md5sum]}} =
lists:keysearch(extended_info,1,element(2,ets:tabfile_info(FName2))),
{value,{extended_info,[md5sum]}} =
lists:keysearch(extended_info,1,element(2,ets:tabfile_info(FName))),
file:delete(FName),
file:delete(FName2),
ok.
%% Test verification of (named) tables without extended info.
tabfile_ext3(Config) when is_list(Config) ->
repeat_for_all_set_table_types(
fun(Opts) ->
FName = filename:join([proplists:get_value(priv_dir, Config),"namn.dat"]),
FName2 = filename:join([proplists:get_value(priv_dir, Config),"ncountflip.dat"]),
L = lists:seq(1,10),
Name = make_ref(),
?MODULE = ets_new(?MODULE,[named_table|Opts]),
[ets:insert(?MODULE,{X,integer_to_list(X)}) || X <- L],
ets:tab2file(?MODULE,FName),
{error,cannot_create_table} = ets:file2tab(FName),
true = ets:delete(?MODULE),
{ok,?MODULE} = ets:file2tab(FName),
true = ets:delete(?MODULE),
disk_log:open([{name,Name},{file,FName}]),
{_,[H2|T2]} = disk_log:chunk(Name,start),
disk_log:close(Name),
NewT2=lists:keydelete(8,1,T2),
file:delete(FName2),
disk_log:open([{name,Name},{file,FName2},{mode,read_write}]),
disk_log:log_terms(Name,[H2|NewT2]),
disk_log:close(Name),
9 = length(ets:tab2list(element(2,ets:file2tab(FName2)))),
true = ets:delete(?MODULE),
{error,invalid_object_count} = ets:file2tab(FName2,[{verify,true}]),
{'EXIT',_} = (catch ets:delete(?MODULE)),
{ok,_} = ets:tabfile_info(FName2),
{ok,_} = ets:tabfile_info(FName),
file:delete(FName),
file:delete(FName2)
end),
ok.
%% Tests verification of large table with md5 sum.
tabfile_ext4(Config) when is_list(Config) ->
repeat_for_all_set_table_types(
fun(Opts) ->
FName = filename:join([proplists:get_value(priv_dir, Config),"bauta.dat"]),
LL = lists:seq(1,10000),
TL = ets_new(x,Opts),
Name2 = make_ref(),
[ets:insert(TL,{X,integer_to_list(X)}) || X <- LL],
ok = ets:tab2file(TL,FName,[{extended_info,[md5sum]}]),
{ok, Name2} = disk_log:open([{name, Name2}, {file, FName},
{mode, read_only}]),
{C,[_|_]} = disk_log:chunk(Name2,start),
{_,[_|_]} = disk_log:chunk(Name2,C),
disk_log:close(Name2),
true = lists:sort(ets:tab2list(TL)) =:=
lists:sort(ets:tab2list(element(2,ets:file2tab(FName)))),
Res = [begin
{ok,FD} = file:open(FName,[binary,read,write]),
{ok, Bin} = file:pread(FD,0,1000),
<<B1:N/binary,Ch:8,B2/binary>> = Bin,
Ch2 = (Ch + 1) rem 255,
Bin2 = <<B1/binary,Ch2:8,B2/binary>>,
ok = file:pwrite(FD,0,Bin2),
ok = file:close(FD),
X = case ets:file2tab(FName) of
{ok,TL2} ->
true = lists:sort(ets:tab2list(TL)) =/=
lists:sort(ets:tab2list(TL2));
_ ->
totally_broken
end,
{error,Y} = ets:file2tab(FName,[{verify,true}]),
ets:tab2file(TL,FName,[{extended_info,[md5sum]}]),
{X,Y}
end || N <- lists:seq(500,600)],
io:format("~p~n",[Res]),
file:delete(FName)
end),
ok.
%% Test that no disk_log is left open when file has been corrupted.
badfile(Config) when is_list(Config) ->
PrivDir = proplists:get_value(priv_dir,Config),
File = filename:join(PrivDir, "badfile"),
_ = file:delete(File),
T = ets:new(table, []),
true = ets:insert(T, [{a,1},{b,2}]),
ok = ets:tab2file(T, File, []),
true = ets:delete(T),
[H0 | Ts ] = get_all_terms(l, File),
H1 = tuple_to_list(H0),
H2 = [{K,V} || {K,V} <- H1, K =/= protection],
H = list_to_tuple(H2),
ok = file:delete(File),
write_terms(l, File, [H | Ts]),
%% All mandatory keys are no longer members of the header
{error, badfile} = ets:file2tab(File),
{error, badfile} = ets:tabfile_info(File),
file:delete(File),
{[],[]} = disk_log:accessible_logs(),
ok.
get_all_terms(Log, File) ->
{ok, Log} = disk_log:open([{name,Log},
{file, File},
{mode, read_only}]),
Ts = get_all_terms(Log),
ok = disk_log:close(Log),
Ts.
get_all_terms(Log) ->
get_all_terms1(Log, start, []).
get_all_terms1(Log, Cont, Res) ->
case disk_log:chunk(Log, Cont) of
{error, _R} ->
throw(fel);
{Cont2, Terms} ->
get_all_terms1(Log, Cont2, Res ++ Terms);
eof ->
Res
end.
write_terms(Log, File, Terms) ->
{ok, Log} = disk_log:open([{name,Log},{file, File},{mode,read_write}]),
ok = disk_log:log(Log, Terms),
ok = disk_log:close(Log).
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
make_sub_binary(List, Num) when is_list(List) ->
N = Num rem 23,
Bin = list_to_binary([lists:seq(0, N)|List]),
{_,B} = split_binary(Bin, N+1),
B.
%% Lookup stuff like crazy...
%% Perform multiple lookups for every key in a large table.
heavy_lookup(Config) when is_list(Config) ->
repeat_for_opts_all_set_table_types(fun heavy_lookup_do/1).
heavy_lookup_do(Opts) ->
EtsMem = etsmem(),
KeyRange = 7000,
Tab = ets_new(foobar_table, [{keypos, 2} | Opts], KeyRange),
ok = fill_tab2(Tab, 0, KeyRange),
_ = [do_lookup(Tab, KeyRange-1) || _ <- lists:seq(1, 50)],
true = ets:delete(Tab),
verify_etsmem(EtsMem).
do_lookup(_Tab, 0) -> ok;
do_lookup(Tab, N) ->
case ets:lookup(Tab, N) of
[] ->
io:format("Set #~p was reported as empty. Not valid.",
[N]),
exit('Invalid lookup');
_ ->
do_lookup(Tab, N-1)
end.
%% Perform multiple lookups for every element in a large table.
heavy_lookup_element(Config) when is_list(Config) ->
repeat_for_opts_all_set_table_types(fun heavy_lookup_element_do/1).
heavy_lookup_element_do(Opts) ->
EtsMem = etsmem(),
KeyRange = 7000,
Tab = ets_new(foobar_table, [{keypos, 2} | Opts], KeyRange),
ok = fill_tab2(Tab, 0, KeyRange),
%% lookup ALL elements 50 times
Laps = 50 div syrup_factor(),
_ = [do_lookup_element(Tab, KeyRange-1, 1) || _ <- lists:seq(1, Laps)],
true = ets:delete(Tab),
verify_etsmem(EtsMem).
do_lookup_element(_Tab, 0, _) -> ok;
do_lookup_element(Tab, N, M) ->
case catch ets:lookup_element(Tab, N, M) of
{'EXIT', {badarg, _}} ->
case M of
1 -> ct:fail("Set #~p reported as empty. Not valid.",
[N]),
exit('Invalid lookup_element');
_ -> do_lookup_element(Tab, N-1, 1)
end;
_ -> do_lookup_element(Tab, N, M+1)
end.
heavy_concurrent(Config) when is_list(Config) ->
ct:timetrap({minutes,120}), %% valgrind needs a lot of time
repeat_for_opts_all_set_table_types(fun do_heavy_concurrent/1).
do_heavy_concurrent(Opts) ->
KeyRange = 10000,
Laps = 10000 div syrup_factor(),
EtsMem = etsmem(),
Tab = ets_new(blupp, [public, {keypos, 2} | Opts], KeyRange),
ok = fill_tab2(Tab, 0, KeyRange),
Procs = lists:map(
fun (N) ->
my_spawn_link(
fun () ->
do_heavy_concurrent_proc(Tab, Laps, N)
end)
end,
lists:seq(1, 500)),
lists:foreach(fun (P) ->
M = erlang:monitor(process, P),
receive
{'DOWN', M, process, P, _} ->
ok
end
end,
Procs),
true = ets:delete(Tab),
verify_etsmem(EtsMem).
do_heavy_concurrent_proc(_Tab, 0, _Offs) ->
done;
do_heavy_concurrent_proc(Tab, N, Offs) when (N+Offs) rem 100 == 0 ->
Data = {"here", are, "S O M E ", data, "toooooooooooooooooo", insert,
make_ref(), make_ref(), make_ref()},
true=ets:insert(Tab, {{self(),Data}, N}),
do_heavy_concurrent_proc(Tab, N-1, Offs);
do_heavy_concurrent_proc(Tab, N, Offs) ->
_ = ets:lookup(Tab, N),
do_heavy_concurrent_proc(Tab, N-1, Offs).
fold_empty(Config) when is_list(Config) ->
repeat_for_opts_all_set_table_types(
fun(Opts) ->
EtsMem = etsmem(),
Tab = make_table(a, Opts, []),
[] = ets:foldl(fun(_X) -> exit(hej) end, [], Tab),
[] = ets:foldr(fun(_X) -> exit(hej) end, [], Tab),
true = ets:delete(Tab),
verify_etsmem(EtsMem)
end),
ok.
foldl(Config) when is_list(Config) ->
repeat_for_opts_all_table_types(
fun(Opts) ->
EtsMem = etsmem(),
L = [{a,1}, {c,3}, {b,2}],
LS = lists:sort(L),
Tab = make_table(a, Opts, L),
LS = lists:sort(ets:foldl(fun(E,A) -> [E|A] end, [], Tab)),
true = ets:delete(Tab),
verify_etsmem(EtsMem)
end),
ok.
foldr(Config) when is_list(Config) ->
repeat_for_opts_all_table_types(
fun(Opts) ->
EtsMem = etsmem(),
L = [{a,1}, {c,3}, {b,2}],
LS = lists:sort(L),
Tab = make_table(a, Opts, L),
LS = lists:sort(ets:foldr(fun(E,A) -> [E|A] end, [], Tab)),
true = ets:delete(Tab),
verify_etsmem(EtsMem)
end),
ok.
foldl_ordered(Config) when is_list(Config) ->
repeat_for_opts_all_ord_set_table_types(
fun(Opts) ->
EtsMem = etsmem(),
L = [{a,1}, {c,3}, {b,2}],
LS = lists:sort(L),
Tab = make_table(a, Opts, L),
LS = lists:reverse(ets:foldl(fun(E,A) -> [E|A] end, [], Tab)),
true = ets:delete(Tab),
verify_etsmem(EtsMem)
end),
ok.
foldr_ordered(Config) when is_list(Config) ->
repeat_for_opts_all_ord_set_table_types(
fun(Opts) ->
EtsMem = etsmem(),
L = [{a,1}, {c,3}, {b,2}],
LS = lists:sort(L),
Tab = make_table(a, Opts, L),
LS = ets:foldr(fun(E,A) -> [E|A] end, [], Tab),
true = ets:delete(Tab),
verify_etsmem(EtsMem)
end),
ok.
%% Test ets:member BIF.
member(Config) when is_list(Config) ->
repeat_for_opts(fun member_do/1, [write_concurrency, all_types]).
member_do(Opts) ->
EtsMem = etsmem(),
T = ets_new(xxx, Opts),
false = ets:member(T,hej),
E = fun(0,_F)->ok;
(N,F) ->
ets:insert(T,{N,N rem 10}),
F(N-1,F)
end,
E(10000,E),
false = ets:member(T,hej),
true = ets:member(T,1),
false = ets:member(T,20000),
ets:delete(T,5),
false = ets:member(T,5),
ets:safe_fixtable(T,true),
ets:delete(T,6),
false = ets:member(T,6),
ets:safe_fixtable(T,false),
false = ets:member(T,6),
ets:delete(T),
{'EXIT',{badarg,_}} = (catch ets:member(finnsinte, 23)),
{'EXIT',{badarg,_}} = (catch ets:member(T, 23)),
verify_etsmem(EtsMem).
build_table(L1,L2,Num) ->
T = ets_new(xxx, [ordered_set]),
lists:foreach(
fun(X1) ->
lists:foreach(
fun(X2) ->
F = fun(FF,N) ->
ets:insert(T,{{X1,X2,N}, X1, X2, N}),
case N of
0 ->
ok;
_ ->
FF(FF,N-1)
end
end,
F(F,Num)
end, L2)
end, L1),
T.
build_table2(L1,L2,Num) ->
T = ets_new(xxx, [ordered_set]),
lists:foreach(
fun(X1) ->
lists:foreach(
fun(X2) ->
F = fun(FF,N) ->
ets:insert(T,{{N,X1,X2}, N, X1, X2}),
case N of
0 ->
ok;
_ ->
FF(FF,N-1)
end
end,
F(F,Num)
end, L2)
end, L1),
T.
time_match_object(Tab,Match, Res) ->
T1 = erlang:monotonic_time(microsecond),
Res = ets:match_object(Tab,Match),
T2 = erlang:monotonic_time(microsecond),
T2 - T1.
time_match(Tab,Match) ->
T1 = erlang:monotonic_time(microsecond),
ets:match(Tab,Match),
T2 = erlang:monotonic_time(microsecond),
T2 - T1.
seventyfive_percent_success(_,S,Fa,0) ->
true = (S > ((S + Fa) * 0.75));
seventyfive_percent_success(F, S, Fa, N) when is_function(F, 0) ->
try F() of
_ ->
seventyfive_percent_success(F, S+1, Fa, N-1)
catch error:_ ->
seventyfive_percent_success(F, S, Fa+1, N-1)
end.
fifty_percent_success(_,S,Fa,0) ->
true = (S > ((S + Fa) * 0.5));
fifty_percent_success(F, S, Fa, N) when is_function(F, 0) ->
try F() of
_ ->
fifty_percent_success(F, S+1, Fa, N-1)
catch
error:_ ->
fifty_percent_success(F, S, Fa+1, N-1)
end.
create_random_string(0) ->
[];
create_random_string(OfLength) ->
C = case rand:uniform(2) of
1 ->
(rand:uniform($Z - $A + 1) - 1) + $A;
_ ->
(rand:uniform($z - $a + 1) - 1) + $a
end,
[C | create_random_string(OfLength - 1)].
create_random_tuple(OfLength) ->
list_to_tuple(lists:map(fun(X) ->
list_to_atom([X])
end,create_random_string(OfLength))).
create_partly_bound_tuple(OfLength) ->
case rand:uniform(2) of
1 ->
create_partly_bound_tuple1(OfLength);
_ ->
create_partly_bound_tuple3(OfLength)
end.
create_partly_bound_tuple1(OfLength) ->
T0 = create_random_tuple(OfLength),
I = rand:uniform(OfLength),
setelement(I,T0,'$1').
set_n_random_elements(T0,0,_,_) ->
T0;
set_n_random_elements(T0,N,OfLength,GenFun) ->
I = rand:uniform(OfLength),
What = GenFun(I),
case element(I,T0) of
What ->
set_n_random_elements(T0,N,OfLength,GenFun);
_Else ->
set_n_random_elements(setelement(I,T0,What),
N-1,OfLength,GenFun)
end.
make_dollar_atom(I) ->
list_to_atom([$$] ++ integer_to_list(I)).
create_partly_bound_tuple2(OfLength) ->
T0 = create_random_tuple(OfLength),
I = rand:uniform(OfLength - 1),
set_n_random_elements(T0,I,OfLength,fun make_dollar_atom/1).
create_partly_bound_tuple3(OfLength) ->
T0 = create_random_tuple(OfLength),
I = rand:uniform(OfLength - 1),
set_n_random_elements(T0,I,OfLength,fun(_) -> '_' end).
do_n_times(_,0) ->
ok;
do_n_times(Fun,N) ->
Fun(),
case N rem 1000 of
0 ->
io:format(".");
_ ->
ok
end,
do_n_times(Fun,N-1).
make_table(Name, Options, Elements) ->
T = ets_new(Name, Options),
lists:foreach(fun(E) -> ets:insert(T, E) end, Elements),
T.
filltabint(Tab,0) ->
Tab;
filltabint(Tab,N) ->
ets:insert(Tab,{N,integer_to_list(N)}),
filltabint(Tab,N-1).
filltabint2(Tab,0) ->
Tab;
filltabint2(Tab,N) ->
ets:insert(Tab,{N + N rem 2,integer_to_list(N)}),
filltabint2(Tab,N-1).
filltabint3(Tab,0) ->
Tab;
filltabint3(Tab,N) ->
ets:insert(Tab,{N + N rem 2,integer_to_list(N + N rem 2)}),
filltabint3(Tab,N-1).
xfilltabint(Tab,N) ->
case ets:info(Tab,type) of
bag ->
filltabint2(Tab,N);
duplicate_bag ->
ets:select_delete(Tab,[{'_',[],[true]}]),
filltabint3(Tab,N);
_ ->
filltabint(Tab,N)
end.
filltabstr(Tab,N) ->
filltabstr(Tab,0,N).
filltabstr(Tab,N,N) ->
Tab;
filltabstr(Tab,Floor,N) when N > Floor ->
ets:insert(Tab,{integer_to_list(N),N}),
filltabstr(Tab,Floor,N-1).
filltabstr2(Tab,0) ->
Tab;
filltabstr2(Tab,N) ->
ets:insert(Tab,{integer_to_list(N),N}),
ets:insert(Tab,{integer_to_list(N),N+1}),
filltabstr2(Tab,N-1).
filltabstr3(Tab,0) ->
Tab;
filltabstr3(Tab,N) ->
ets:insert(Tab,{integer_to_list(N),N}),
ets:insert(Tab,{integer_to_list(N),N}),
filltabstr3(Tab,N-1).
xfilltabstr(Tab,N) ->
case ets:info(Tab,type) of
bag ->
filltabstr2(Tab,N);
duplicate_bag ->
ets:select_delete(Tab,[{'_',[],[true]}]),
filltabstr3(Tab,N);
_ ->
filltabstr(Tab,N)
end.
fill_sets_int(N) ->
fill_sets_int(N,[]).
fill_sets_int(N,Opts) ->
Tab1 = ets_new(xxx, [ordered_set|Opts]),
filltabint(Tab1,N),
Tab2 = ets_new(xxx, [set|Opts]),
filltabint(Tab2,N),
Tab3 = ets_new(xxx, [bag|Opts]),
filltabint2(Tab3,N),
Tab4 = ets_new(xxx, [duplicate_bag|Opts]),
filltabint3(Tab4,N),
[Tab1,Tab2,Tab3,Tab4].
check_fun(_Tab,_Fun,'$end_of_table') ->
ok;
check_fun(Tab,Fun,Item) ->
lists:foreach(fun(Obj) ->
true = Fun(Obj)
end,
ets:lookup(Tab,Item)),
check_fun(Tab,Fun,ets:next(Tab,Item)).
check(Tab,Fun,N) ->
N = ets:info(Tab, size),
check_fun(Tab,Fun,ets:first(Tab)).
del_one_by_one_set(T,N,N) ->
0 = ets:info(T,size),
ok;
del_one_by_one_set(T,From,To) ->
N = ets:info(T,size),
ets:delete_object(T,{From, integer_to_list(From)}),
N = (ets:info(T,size) + 1),
Next = if
From < To ->
From + 1;
true ->
From - 1
end,
del_one_by_one_set(T,Next,To).
del_one_by_one_bag(T,N,N) ->
0 = ets:info(T,size),
ok;
del_one_by_one_bag(T,From,To) ->
N = ets:info(T,size),
ets:delete_object(T,{From + From rem 2, integer_to_list(From)}),
N = (ets:info(T,size) + 1),
Next = if
From < To ->
From + 1;
true ->
From - 1
end,
del_one_by_one_bag(T,Next,To).
del_one_by_one_dbag_1(T,N,N) ->
0 = ets:info(T,size),
ok;
del_one_by_one_dbag_1(T,From,To) ->
N = ets:info(T,size),
ets:delete_object(T,{From, integer_to_list(From)}),
case From rem 2 of
0 ->
N = (ets:info(T,size) + 2);
1 ->
N = ets:info(T,size)
end,
Next = if
From < To ->
From + 1;
true ->
From - 1
end,
del_one_by_one_dbag_1(T,Next,To).
del_one_by_one_dbag_2(T,N,N) ->
0 = ets:info(T,size),
ok;
del_one_by_one_dbag_2(T,From,To) ->
N = ets:info(T,size),
ets:delete_object(T,{From, integer_to_list(From)}),
case From rem 2 of
0 ->
N = (ets:info(T,size) + 3);
1 ->
N = (ets:info(T,size) + 1)
end,
Next = if
From < To ->
From + 1;
true ->
From - 1
end,
del_one_by_one_dbag_2(T,Next,To).
del_one_by_one_dbag_3(T,N,N) ->
0 = ets:info(T,size),
ok;
del_one_by_one_dbag_3(T,From,To) ->
N = ets:info(T,size),
Obj = {From + From rem 2, integer_to_list(From)},
ets:delete_object(T,Obj),
case From rem 2 of
0 ->
N = (ets:info(T,size) + 2);
1 ->
N = (ets:info(T,size) + 1),
Obj2 = {From, integer_to_list(From)},
ets:delete_object(T,Obj2),
N = (ets:info(T,size) + 2)
end,
Next = if
From < To ->
From + 1;
true ->
From - 1
end,
del_one_by_one_dbag_3(T,Next,To).
successive_delete(Table,From,To,Type) ->
successive_delete(Table,From,To,Type,ets:info(Table,type)).
successive_delete(_Table,N,N,_,_) ->
ok;
successive_delete(Table,From,To,Type,TType) ->
MS = case Type of
bound ->
[{{From,'_'},[],[true]}];
unbound ->
[{{'$1','_'},[],[{'==', '$1', From}]}]
end,
case TType of
X when X == bag; X == duplicate_bag ->
%%erlang:display(From),
case From rem 2 of
0 ->
2 = ets:select_delete(Table,MS);
_ ->
0 = ets:select_delete(Table,MS)
end;
_ ->
1 = ets:select_delete(Table,MS)
end,
Next = if
From < To ->
From + 1;
true ->
From - 1
end,
successive_delete(Table, Next, To, Type,TType).
gen_dets_filename(Config,N) ->
filename:join(proplists:get_value(priv_dir,Config),
"testdets_" ++ integer_to_list(N) ++ ".dets").
otp_6842_select_1000(Config) when is_list(Config) ->
repeat_for_opts_all_ord_set_table_types(
fun(Opts) ->
KeyRange = 10000,
Tab = ets_new(xxx, Opts, KeyRange),
[ets:insert(Tab,{X,X}) || X <- lists:seq(1,KeyRange)],
AllTrue = lists:duplicate(10,true),
AllTrue =
[ length(
element(1,
ets:select(Tab,[{'_',[],['$_']}],X*1000))) =:=
X*1000 || X <- lists:seq(1,10) ],
Sequences = [[1000,1000,1000,1000,1000,1000,1000,1000,1000,1000],
[2000,2000,2000,2000,2000],
[3000,3000,3000,1000],
[4000,4000,2000],
[5000,5000],
[6000,4000],
[7000,3000],
[8000,2000],
[9000,1000],
[10000]],
AllTrue = [ check_seq(Tab, ets:select(Tab,[{'_',[],['$_']}],hd(L)),L) ||
L <- Sequences ],
ets:delete(Tab)
end),
ok.
check_seq(_,'$end_of_table',[]) ->
true;
check_seq(Tab,{L,C},[H|T]) when length(L) =:= H ->
check_seq(Tab, ets:select(C),T);
check_seq(A,B,C) ->
erlang:display({A,B,C}),
false.
otp_6338(Config) when is_list(Config) ->
repeat_for_opts_all_ord_set_table_types(
fun(Opts) ->
L = binary_to_term(<<131,108,0,0,0,2,104,2,108,0,0,0,2,103,100,0,19,112,112,
98,49,95,98,115,49,50,64,98,108,97,100,101,95,48,95,53,
0,0,33,50,0,0,0,4,1,98,0,0,23,226,106,100,0,4,101,120,
105,116,104,2,108,0,0,0,2,104,2,100,0,3,115,98,109,100,
0,19,112,112,98,50,95,98,115,49,50,64,98,108,97,100,
101,95,48,95,56,98,0,0,18,231,106,100,0,4,114,101,99,
118,106>>),
T = ets_new(xxx,Opts),
lists:foreach(fun(X) -> ets:insert(T,X) end,L),
[[4839,recv]] = ets:match(T,{[{sbm,ppb2_bs12@blade_0_8},'$1'],'$2'}),
ets:delete(T)
end),
ok.
%% Elements could come in the wrong order in a bag if a rehash occurred.
otp_5340(Config) when is_list(Config) ->
repeat_for_opts(fun otp_5340_do/1).
otp_5340_do(Opts) ->
N = 3000,
T = ets_new(otp_5340, [bag,public | Opts]),
Ids = [1,2,3,4,5],
[w(T, N, Id) || Id <- Ids],
verify(T, Ids),
ets:delete(T).
w(_,0, _) -> ok;
w(T,N, Id) ->
ets:insert(T, {N, Id}),
w(T,N-1,Id).
verify(T, Ids) ->
List = my_tab_to_list(T),
Errors = lists:filter(fun(Bucket) ->
verify2(Bucket, Ids)
end, List),
case Errors of
[] ->
ok;
_ ->
io:format("Failed:\n~p\n", [Errors]),
ct:fail(failed)
end.
verify2([{_N,Id}|RL], [Id|R]) ->
verify2(RL,R);
verify2([],[]) -> false;
verify2(_Err, _) ->
true.
%% delete_object followed by delete on fixed bag failed to delete objects.
otp_7665(Config) when is_list(Config) ->
repeat_for_opts(fun otp_7665_do/1).
otp_7665_do(Opts) ->
Tab = ets_new(otp_7665,[bag | Opts]),
Min = 0,
Max = 10,
lists:foreach(fun(N)-> otp_7665_act(Tab,Min,Max,N) end,
lists:seq(Min,Max)),
true = ets:delete(Tab).
otp_7665_act(Tab,Min,Max,DelNr) ->
List1 = [{key,N} || N <- lists:seq(Min,Max)],
true = ets:insert(Tab, List1),
true = ets:safe_fixtable(Tab, true),
true = ets:delete_object(Tab, {key,DelNr}),
List2 = lists:delete({key,DelNr}, List1),
%% Now verify that we find all remaining objects
List2 = ets:lookup(Tab,key),
EList2 = lists:map(fun({key,N})-> N end,
List2),
EList2 = ets:lookup_element(Tab,key,2),
true = ets:delete(Tab, key),
[] = ets:lookup(Tab, key),
true = ets:safe_fixtable(Tab, false),
ok.
%% Whitebox testing of meta name table hashing.
meta_wb(Config) when is_list(Config) ->
EtsMem = etsmem(),
repeat_for_opts_all_non_stim_table_types(fun meta_wb_do/1),
verify_etsmem(EtsMem).
meta_wb_do(Opts) ->
%% Do random new/delete/rename of colliding named tables
Names0 = [pioneer | colliding_names(pioneer)],
%% Remove any names that happen to exist as tables already
Names = lists:filter(fun(Name) -> ets:info(Name) == undefined end,
Names0),
Len = length(Names),
OpFuns = {fun meta_wb_new/4, fun meta_wb_delete/4, fun meta_wb_rename/4},
true = (Len >= 3),
io:format("Colliding names = ~p\n",[Names]),
F = fun(0,_,_) -> ok;
(N,Tabs,Me) ->
Name1 = lists:nth(rand:uniform(Len), Names),
Name2 = lists:nth(rand:uniform(Len), Names),
Op = element(rand:uniform(3),OpFuns),
NTabs = Op(Name1, Name2, Tabs, Opts),
Me(N-1, NTabs, Me)
end,
F(Len*100, [], F),
%% cleanup
lists:foreach(fun(Name)->catch ets:delete(Name) end,
Names).
meta_wb_new(Name, _, Tabs, Opts) ->
case (catch ets_new(Name,[named_table|Opts])) of
Name ->
false = lists:member(Name, Tabs),
[Name | Tabs];
{'EXIT',{badarg,_}} ->
true = lists:member(Name, Tabs),
Tabs
end.
meta_wb_delete(Name, _, Tabs, _) ->
case (catch ets:delete(Name)) of
true ->
true = lists:member(Name, Tabs),
lists:delete(Name, Tabs);
{'EXIT',{badarg,_}} ->
false = lists:member(Name, Tabs),
Tabs
end.
meta_wb_rename(Old, New, Tabs, _) ->
case (catch ets:rename(Old,New)) of
New ->
true = lists:member(Old, Tabs)
andalso not lists:member(New, Tabs),
[New | lists:delete(Old, Tabs)];
{'EXIT',{badarg,_}} ->
true = not lists:member(Old, Tabs)
orelse lists:member(New,Tabs),
Tabs
end.
colliding_names(Name) ->
erts_debug:set_internal_state(colliding_names, {Name,5}).
%% OTP_6913: Grow and shrink.
grow_shrink(Config) when is_list(Config) ->
repeat_for_all_set_table_types(
fun(Opts) ->
EtsMem = etsmem(),
Set = ets_new(a, Opts, 5000),
grow_shrink_0(0, 3071, 3000, 5000, Set),
ets:delete(Set),
verify_etsmem(EtsMem)
end).
grow_shrink_0(N, _, _, Max, _) when N >= Max ->
ok;
grow_shrink_0(N0, GrowN, ShrinkN, Max, T) ->
N1 = grow_shrink_1(N0, GrowN, ShrinkN, T),
grow_shrink_0(N1, GrowN, ShrinkN, Max, T).
grow_shrink_1(N0, GrowN, ShrinkN, T) ->
N1 = grow_shrink_2(N0+1, N0 + GrowN, T),
grow_shrink_3(N1, N1 - ShrinkN, T).
grow_shrink_2(N, GrowTo, _) when N > GrowTo ->
GrowTo;
grow_shrink_2(N, GrowTo, T) ->
true = ets:insert(T, {N,a}),
grow_shrink_2(N+1, GrowTo, T).
grow_shrink_3(N, ShrinkTo, _) when N =< ShrinkTo ->
ShrinkTo;
grow_shrink_3(N, ShrinkTo, T) ->
true = ets:delete(T, N),
grow_shrink_3(N-1, ShrinkTo, T).
%% Grow a hash table that still contains pseudo-deleted objects.
grow_pseudo_deleted(Config) when is_list(Config) ->
only_if_smp(fun() -> grow_pseudo_deleted_do() end).
grow_pseudo_deleted_do() ->
lists:foreach(fun(Type) -> grow_pseudo_deleted_do(Type) end,
[set,bag,duplicate_bag]).
grow_pseudo_deleted_do(Type) ->
process_flag(scheduler,1),
Self = self(),
T = ets_new(kalle,[Type,public,{write_concurrency,true}]),
Mod = 7, Mult = 10000,
filltabint(T,Mod*Mult),
true = ets:safe_fixtable(T,true),
Mult = ets:select_delete(T,
[{{'$1', '_'},
[{'=:=', {'rem', '$1', Mod}, 0}],
[true]}]),
Left = Mult*(Mod-1),
Left = ets:info(T,size),
Mult = get_kept_objects(T),
filltabstr(T,Mult),
my_spawn_opt(
fun() ->
true = ets:info(T,fixed),
Self ! start,
io:put_chars("Starting to filltabstr...\n"),
do_tc(fun() ->
filltabstr(T, Mult, Mult+10000)
end,
fun(Elapsed) ->
io:format("Done with filltabstr in ~p ms\n",
[Elapsed])
end),
Self ! done
end, [link, {scheduler,2}]),
start = receive_any(),
io:format("Unfixing table... nitems=~p\n", [ets:info(T, size)]),
do_tc(fun() ->
true = ets:safe_fixtable(T, false)
end,
fun(Elapsed) ->
io:format("Unfix table done in ~p ms. nitems=~p\n",
[Elapsed,ets:info(T, size)])
end),
false = ets:info(T,fixed),
0 = get_kept_objects(T),
done = receive_any(),
%%verify_table_load(T), % may fail if concurrency is poor (genny)
ets:delete(T),
process_flag(scheduler,0).
%% Shrink a hash table that still contains pseudo-deleted objects.
shrink_pseudo_deleted(Config) when is_list(Config) ->
only_if_smp(fun()->shrink_pseudo_deleted_do() end).
shrink_pseudo_deleted_do() ->
lists:foreach(fun(Type) -> shrink_pseudo_deleted_do(Type) end,
[set,bag,duplicate_bag]).
shrink_pseudo_deleted_do(Type) ->
process_flag(scheduler,1),
Self = self(),
T = ets_new(kalle,[Type,public,{write_concurrency,true}]),
Half = 10000,
filltabint(T,Half*2),
true = ets:safe_fixtable(T,true),
Half = ets:select_delete(T,
[{{'$1', '_'},
[{'>', '$1', Half}],
[true]}]),
Half = ets:info(T,size),
Half = get_kept_objects(T),
my_spawn_opt(
fun()-> true = ets:info(T,fixed),
Self ! start,
io:put_chars("Starting to delete... ~p\n"),
do_tc(fun() ->
del_one_by_one_set(T, 1, Half+1)
end,
fun(Elapsed) ->
io:format("Done with delete in ~p ms.\n",
[Elapsed])
end),
Self ! done
end, [link, {scheduler,2}]),
start = receive_any(),
io:format("Unfixing table... nitems=~p\n", [ets:info(T, size)]),
do_tc(fun() ->
true = ets:safe_fixtable(T, false)
end,
fun(Elapsed) ->
io:format("Unfix table done in ~p ms. nitems=~p\n",
[Elapsed,ets:info(T, size)])
end),
false = ets:info(T,fixed),
0 = get_kept_objects(T),
done = receive_any(),
%%verify_table_load(T), % may fail if concurrency is poor (genny)
ets:delete(T),
process_flag(scheduler,0).
meta_lookup_unnamed_read(Config) when is_list(Config) ->
InitF = fun(_) -> Tab = ets_new(unnamed,[]),
true = ets:insert(Tab,{key,data}),
Tab
end,
ExecF = fun(Tab) -> [{key,data}] = ets:lookup(Tab,key),
Tab
end,
FiniF = fun(Tab) -> true = ets:delete(Tab)
end,
run_smp_workers(InitF,ExecF,FiniF,10000).
meta_lookup_unnamed_write(Config) when is_list(Config) ->
InitF = fun(_) -> Tab = ets_new(unnamed,[]),
{Tab,0}
end,
ExecF = fun({Tab,N}) -> true = ets:insert(Tab,{key,N}),
{Tab,N+1}
end,
FiniF = fun({Tab,_}) -> true = ets:delete(Tab)
end,
run_smp_workers(InitF,ExecF,FiniF,10000).
meta_lookup_named_read(Config) when is_list(Config) ->
InitF = fun([ProcN|_]) -> Name = list_to_atom(integer_to_list(ProcN)),
Tab = ets_new(Name,[named_table]),
true = ets:insert(Tab,{key,data}),
Tab
end,
ExecF = fun(Tab) -> [{key,data}] = ets:lookup(Tab,key),
Tab
end,
FiniF = fun(Tab) -> true = ets:delete(Tab)
end,
run_smp_workers(InitF,ExecF,FiniF,10000).
meta_lookup_named_write(Config) when is_list(Config) ->
InitF = fun([ProcN|_]) -> Name = list_to_atom(integer_to_list(ProcN)),
Tab = ets_new(Name,[named_table]),
{Tab,0}
end,
ExecF = fun({Tab,N}) -> true = ets:insert(Tab,{key,N}),
{Tab,N+1}
end,
FiniF = fun({Tab,_}) -> true = ets:delete(Tab)
end,
run_smp_workers(InitF,ExecF,FiniF,10000).
meta_newdel_unnamed(Config) when is_list(Config) ->
InitF = fun(_) -> ok end,
ExecF = fun(_) -> Tab = ets_new(unnamed,[]),
true = ets:delete(Tab)
end,
FiniF = fun(_) -> ok end,
run_smp_workers(InitF,ExecF,FiniF,10000).
meta_newdel_named(Config) when is_list(Config) ->
InitF = fun([ProcN|_]) -> list_to_atom(integer_to_list(ProcN))
end,
ExecF = fun(Name) -> Name = ets_new(Name,[named_table]),
true = ets:delete(Name),
Name
end,
FiniF = fun(_) -> ok end,
run_smp_workers(InitF,ExecF,FiniF,10000).
%% Concurrent insert's on same table.
smp_insert(Config) when is_list(Config) ->
repeat_for_opts(fun smp_insert_do/1,
[[set,ordered_set,stim_cat_ord_set]]).
smp_insert_do(Opts) ->
KeyRange = 10000,
ets_new(smp_insert,[named_table,public,{write_concurrency,true}|Opts],
KeyRange),
InitF = fun(_) -> ok end,
ExecF = fun(_) -> true = ets:insert(smp_insert,{rand:uniform(KeyRange)})
end,
FiniF = fun(_) -> ok end,
run_smp_workers(InitF,ExecF,FiniF,100000),
verify_table_load(smp_insert),
ets:delete(smp_insert).
%% Concurrent deletes on same fixated table.
smp_fixed_delete(Config) when is_list(Config) ->
only_if_smp(fun() -> smp_fixed_delete_do() end).
smp_fixed_delete_do() ->
T = ets_new(foo,[public,{write_concurrency,true}]),
%%Mem = ets:info(T,memory),
NumOfObjs = 100000,
filltabint(T,NumOfObjs),
ets:safe_fixtable(T,true),
Buckets = num_of_buckets(T),
InitF = fun([ProcN,NumOfProcs|_]) -> {ProcN,NumOfProcs} end,
ExecF = fun({Key,_}) when Key > NumOfObjs ->
[end_of_work];
({Key,Increment}) ->
true = ets:delete(T,Key),
{Key+Increment,Increment}
end,
FiniF = fun(_) -> ok end,
run_sched_workers(InitF,ExecF,FiniF,NumOfObjs),
0 = ets:info(T,size),
true = ets:info(T,fixed),
Buckets = num_of_buckets(T),
case ets:info(T,type) of
set -> NumOfObjs = get_kept_objects(T);
_ -> ok
end,
ets:safe_fixtable(T,false),
%% Will fail as unfix does not shrink the table:
%%Mem = ets:info(T,memory),
%%verify_table_load(T),
ets:delete(T).
%% ERL-720
%% Provoke race between ets:delete and table unfix (by select_count)
%% that caused ets_misc memory counter to indicate false leak.
delete_unfix_race(Config) when is_list(Config) ->
EtsMem = etsmem(),
Table = ets:new(t,[set,public,{write_concurrency,true}]),
InsertOp =
fun() ->
receive stop ->
false
after 0 ->
ets:insert(Table, {rand:uniform(10)}),
true
end
end,
DeleteOp =
fun() ->
receive stop ->
false
after 0 ->
ets:delete(Table, rand:uniform(10)),
true
end
end,
SelectOp =
fun() ->
ets:select_count(Table, ets:fun2ms(fun(X) -> true end))
end,
Main = self(),
Ins = spawn(fun()-> repeat_while(InsertOp), Main ! self() end),
Del = spawn(fun()-> repeat_while(DeleteOp), Main ! self() end),
spawn(fun()->
repeat(SelectOp, 10000),
Del ! stop,
Ins ! stop
end),
[receive Pid -> ok end || Pid <- [Ins,Del]],
ets:delete(Table),
verify_etsmem(EtsMem).
num_of_buckets(T) ->
case ets:info(T,type) of
set -> element(1,ets:info(T,stats));
bag -> element(1,ets:info(T,stats));
duplicate_bag -> element(1,ets:info(T,stats));
_ -> ok
end.
%% Fixate hash table while other process is busy doing unfix.
smp_unfix_fix(Config) when is_list(Config) ->
only_if_smp(fun()-> smp_unfix_fix_do() end).
smp_unfix_fix_do() ->
process_flag(scheduler,1),
Parent = self(),
T = ets_new(foo,[public,{write_concurrency,true}]),
%%Mem = ets:info(T,memory),
NumOfObjs = 100000,
Deleted = 50000,
filltabint(T,NumOfObjs),
ets:safe_fixtable(T,true),
Buckets = num_of_buckets(T),
Deleted = ets:select_delete(T,[{{'$1', '_'},
[{'=<','$1', Deleted}],
[true]}]),
Buckets = num_of_buckets(T),
Left = NumOfObjs - Deleted,
Left = ets:info(T,size),
true = ets:info(T,fixed),
Deleted = get_kept_objects(T),
{Child, Mref} =
my_spawn_opt(
fun()->
true = ets:info(T,fixed),
Parent ! start,
io:format("Child waiting for table to be unfixed... mem=~p\n",
[ets:info(T, memory)]),
do_tc(fun() ->
repeat_while(fun()-> ets:info(T, fixed) end)
end,
fun(Elapsed) ->
io:format("Table unfixed in ~p ms."
" Child Fixating! mem=~p\n",
[Elapsed,ets:info(T,memory)])
end),
true = ets:safe_fixtable(T,true),
repeat_while(fun(Key) when Key =< NumOfObjs ->
ets:delete(T,Key), {true,Key+1};
(Key) -> {false,Key}
end,
Deleted),
0 = ets:info(T,size),
true = get_kept_objects(T) >= Left,
done = receive_any()
end,
[link, monitor, {scheduler,2}]),
start = receive_any(),
true = ets:info(T,fixed),
io:put_chars("Parent starting to unfix... ~p\n"),
do_tc(fun() ->
ets:safe_fixtable(T, false)
end,
fun(Elapsed) ->
io:format("Parent done with unfix in ~p ms.\n",
[Elapsed])
end),
Child ! done,
{'DOWN', Mref, process, Child, normal} = receive_any(),
false = ets:info(T,fixed),
0 = get_kept_objects(T),
%%verify_table_load(T),
ets:delete(T),
process_flag(scheduler,0).
%% Unsafe unfix was done by trapping select/match.
otp_8166(Config) when is_list(Config) ->
only_if_smp(3, fun()-> otp_8166_do(false),
otp_8166_do(true)
end).
otp_8166_do(WC) ->
%% Bug scenario: One process segv while reading the table because another
%% process is doing unfix without write-lock at the end of a trapping match_object.
process_flag(scheduler,1),
T = ets_new(foo,[public, {write_concurrency,WC}]),
NumOfObjs = 3000, %% Need more than 1000 live objects for match_object to trap one time
Deleted = NumOfObjs div 2,
filltabint(T,NumOfObjs),
{ReaderPid, ReaderMref} = my_spawn_opt(fun()-> otp_8166_reader(T,NumOfObjs) end,
[link, monitor, {scheduler,2}]),
{ZombieCrPid, ZombieCrMref} = my_spawn_opt(fun()-> otp_8166_zombie_creator(T,Deleted) end,
[link, monitor, {scheduler,3}]),
repeat(fun() -> ZombieCrPid ! {loop, self()},
zombies_created = receive_any(),
otp_8166_trapper(T, 10, ZombieCrPid)
end, 100),
ReaderPid ! quit,
{'DOWN', ReaderMref, process, ReaderPid, normal} = receive_any(),
ZombieCrPid ! quit,
{'DOWN', ZombieCrMref, process, ZombieCrPid, normal} = receive_any(),
false = ets:info(T,fixed),
0 = get_kept_objects(T),
%%verify_table_load(T),
ets:delete(T),
process_flag(scheduler,0).
%% Keep reading the table
otp_8166_reader(T, NumOfObjs) ->
repeat_while(fun(0) ->
receive quit -> {false,done}
after 0 -> {true,NumOfObjs}
end;
(Key) ->
ets:lookup(T,Key),
{true, Key-1}
end,
NumOfObjs).
%% Do a match_object that will trap and thereby fixate and then unfixate the table
otp_8166_trapper(T, Try, ZombieCrPid) ->
[] = ets:match_object(T,{'_',"Pink Unicorn"}),
case {ets:info(T,fixed),Try} of
{true,1} ->
io:format("failed to provoke unsafe unfix, give up...\n",[]),
ZombieCrPid ! unfix;
{true,_} ->
io:format("trapper too fast, trying again...\n",[]),
otp_8166_trapper(T, Try-1, ZombieCrPid);
{false,_} -> done
end.
%% Fixate table and create some pseudo-deleted objects (zombies)
%% Then wait for trapper to fixate before unfixing, as we want the trappers'
%% unfix to be the one that purges the zombies.
otp_8166_zombie_creator(T,Deleted) ->
case receive_any() of
quit -> done;
{loop,Pid} ->
filltabint(T,Deleted),
ets:safe_fixtable(T,true),
Deleted = ets:select_delete(T,[{{'$1', '_'},
[{'=<','$1', Deleted}],
[true]}]),
Pid ! zombies_created,
repeat_while(fun() -> case ets:info(T,safe_fixed_monotonic_time) of
{_,[_P1,_P2]} ->
false;
_ ->
receive unfix -> false
after 0 -> true
end
end
end),
ets:safe_fixtable(T,false),
otp_8166_zombie_creator(T,Deleted);
unfix ->
io:format("ignore unfix in outer loop?\n",[]),
otp_8166_zombie_creator(T,Deleted)
end.
verify_table_load(T) ->
case ets:info(T,type) of
ordered_set -> ok;
_ ->
Stats = ets:info(T,stats),
{Buckets,AvgLen,StdDev,ExpSD,_MinLen,_MaxLen,_} = Stats,
ok = if
AvgLen > 1.2 ->
io:format("Table overloaded: Stats=~p\n~p\n",
[Stats, ets:info(T)]),
false;
Buckets>256, AvgLen < 0.47 ->
io:format("Table underloaded: Stats=~p\n~p\n",
[Stats, ets:info(T)]),
false;
StdDev > ExpSD*2 ->
io:format("Too large standard deviation (poor hashing?),"
" stats=~p\n~p\n",[Stats, ets:info(T)]),
false;
true ->
io:format("Stats = ~p\n",[Stats]),
ok
end
end.
%% ets:select on a tree with NIL key object.
otp_8732(Config) when is_list(Config) ->
repeat_for_all_ord_set_table_types(
fun(Opts) ->
KeyRange = 999,
KeyFun = fun(K) -> integer_to_list(K) end,
Tab = ets_new(noname,Opts, KeyRange, KeyFun),
filltabstr(Tab, KeyRange),
ets:insert(Tab,{[],"nasty NIL object"}),
[] = ets:match(Tab,{'_',nomatch}) %% Will hang if bug not fixed
end),
ok.
%% Run concurrent select_delete (and inserts) on same table.
smp_select_delete(Config) when is_list(Config) ->
repeat_for_opts(fun smp_select_delete_do/1,
[[set,ordered_set,stim_cat_ord_set],
read_concurrency, compressed]).
smp_select_delete_do(Opts) ->
KeyRange = 10000,
begin % indentation
T = ets_new(smp_select_delete,[named_table,public,{write_concurrency,true}|Opts],
KeyRange),
Mod = 17,
Zeros = erlang:make_tuple(Mod,0),
InitF = fun(_) -> Zeros end,
ExecF = fun(Diffs0) ->
case rand:uniform(20) of
1 ->
Mod = 17,
Eq = rand:uniform(Mod) - 1,
Deleted = ets:select_delete(T,
[{{'_', '$1'},
[{'=:=', {'rem', '$1', Mod}, Eq}],
[true]}]),
Diffs1 = setelement(Eq+1, Diffs0,
element(Eq+1,Diffs0) - Deleted),
Diffs1;
_ ->
Key = rand:uniform(KeyRange),
Eq = Key rem Mod,
case ets:insert_new(T,{Key,Key}) of
true ->
Diffs1 = setelement(Eq+1, Diffs0,
element(Eq+1,Diffs0)+1),
Diffs1;
false -> Diffs0
end
end
end,
FiniF = fun(Result) -> Result end,
Results = run_sched_workers(InitF,ExecF,FiniF,20000),
TotCnts = lists:foldl(fun(Diffs, Sum) -> add_lists(Sum,tuple_to_list(Diffs)) end,
lists:duplicate(Mod, 0), Results),
io:format("TotCnts = ~p\n",[TotCnts]),
LeftInTab = lists:foldl(fun(N,Sum) -> Sum+N end,
0, TotCnts),
io:format("LeftInTab = ~p\n",[LeftInTab]),
LeftInTab = ets:info(T,size),
lists:foldl(fun(Cnt,Eq) ->
WasCnt = ets:select_count(T,
[{{'_', '$1'},
[{'=:=', {'rem', '$1', Mod}, Eq}],
[true]}]),
io:format("~p: ~p =?= ~p\n",[Eq,Cnt,WasCnt]),
Cnt = WasCnt,
Eq+1
end,
0, TotCnts),
%% May fail as select_delete does not shrink table (enough)
%%verify_table_load(T),
LeftInTab = ets:select_delete(T, [{{'$1','$1'}, [], [true]}]),
0 = ets:info(T,size),
false = ets:info(T,fixed),
ets:delete(T)
end, % indentation
ok.
smp_select_replace(Config) when is_list(Config) ->
repeat_for_opts(fun smp_select_replace_do/1,
[[set,ordered_set,stim_cat_ord_set,duplicate_bag]]).
smp_select_replace_do(Opts) ->
KeyRange = 20,
T = ets_new(smp_select_replace,
[public, {write_concurrency, true} | Opts],
KeyRange),
InitF = fun (_) -> 0 end,
ExecF = fun (Cnt0) ->
CounterId = rand:uniform(KeyRange),
Match = [{{'$1', '$2'},
[{'=:=', '$1', CounterId}],
[{{'$1', {'+', '$2', 1}}}]}],
Cnt1 = case ets:select_replace(T, Match) of
1 -> Cnt0+1;
0 ->
ets:insert_new(T, {CounterId, 0}),
Cnt0
end,
receive stop ->
[end_of_work | Cnt1]
after 0 ->
Cnt1
end
end,
FiniF = fun (Cnt) -> Cnt end,
Pids = run_sched_workers(InitF, ExecF, FiniF, infinite),
receive after 3*1000 -> ok end,
[P ! stop || P <- Pids],
Results = wait_pids(Pids),
FinalCounts = ets:select(T, [{{'_', '$1'}, [], ['$1']}]),
Total = lists:sum(FinalCounts),
Total = lists:sum(Results),
KeyRange = ets:select_delete(T, [{{'_', '_'}, [], [true]}]),
0 = ets:info(T, size),
true = ets:delete(T),
ok.
%% Iterate ordered_set with write_concurrency
%% and make sure we hit all "stable" long lived keys
%% while "volatile" objects are randomly inserted and deleted.
smp_ordered_iteration(Config) when is_list(Config) ->
repeat_for_opts(fun smp_ordered_iteration_do/1,
[[cat_ord_set,stim_cat_ord_set]]).
smp_ordered_iteration_do(Opts) ->
KeyRange = 1000,
OffHeap = erts_test_utils:mk_ext_pid({a@b,1}, 4711, 1),
KeyFun = fun(K, Type) ->
{K div 10, K rem 10, Type, OffHeap}
end,
StimKeyFun = fun(K) ->
KeyFun(K, element(rand:uniform(3),
{stable, other, volatile}))
end,
T = ets_new(smp_ordered_iteration, [public, {write_concurrency,true} | Opts],
KeyRange, StimKeyFun),
NStable = KeyRange div 4,
prefill_table(T, KeyRange, NStable, fun(K) -> {KeyFun(K, stable), 0} end),
NStable = ets:info(T, size),
NVolatile = KeyRange div 2,
prefill_table(T, KeyRange, NVolatile, fun(K) -> {KeyFun(K, volatile), 0} end),
InitF = fun (_) -> #{insert => 0, delete => 0,
select_delete_bk => 0, select_delete_pbk => 0,
select_replace_bk => 0, select_replace_pbk => 0}
end,
ExecF = fun (Counters) ->
K = rand:uniform(KeyRange),
Key = KeyFun(K, volatile),
Acc = case rand:uniform(22) of
R when R =< 10 ->
ets:insert(T, {Key}),
incr_counter(insert, Counters);
R when R =< 15 ->
ets:delete(T, Key),
incr_counter(delete, Counters);
R when R =< 19 ->
%% Delete bound key
ets:select_delete(T, [{{Key, '_'}, [], [true]}]),
incr_counter(select_delete_bk, Counters);
R when R =< 20 ->
%% Delete partially bound key
ets:select_delete(T, [{{{K div 10, '_', volatile, '_'}, '_'}, [], [true]}]),
incr_counter(select_delete_pbk, Counters);
R when R =< 21 ->
%% Replace bound key
ets:select_replace(T, [{{Key, '$1'}, [],
[{{{const,Key}, {'+','$1',1}}}]}]),
incr_counter(select_replace_bk, Counters);
_ ->
%% Replace partially bound key
ets:select_replace(T, [{{{K div 10, '_', volatile, '_'}, '$1'}, [],
[{{{element,1,'$_'}, {'+','$1',1}}}]}]),
incr_counter(select_replace_pbk, Counters)
end,
receive stop ->
[end_of_work | Acc]
after 0 ->
Acc
end
end,
FiniF = fun (Acc) -> Acc end,
Pids = run_sched_workers(InitF, ExecF, FiniF, infinite),
timer:send_after(1000, stop),
Log2ChunkMax = math:log2(NStable*2),
Rounds = fun Loop(N) ->
MS = [{{{'_', '_', stable, '_'}, '_'}, [], [true]}],
NStable = ets:select_count(T, MS),
NStable = count_stable(T, next, ets:first(T), 0),
NStable = count_stable(T, prev, ets:last(T), 0),
NStable = length(ets:select(T, MS)),
NStable = length(ets:select_reverse(T, MS)),
Chunk = round(math:pow(2, rand:uniform()*Log2ChunkMax)),
NStable = ets_select_chunks_count(T, MS, Chunk),
receive stop -> N
after 0 -> Loop(N+1)
end
end (1),
[P ! stop || P <- Pids],
Results = wait_pids(Pids),
io:format("Ops = ~p\n", [maps_sum(Results)]),
io:format("Diff = ~p\n", [ets:info(T,size) - NStable - NVolatile]),
io:format("Stats = ~p\n", [ets:info(T,stats)]),
io:format("Rounds = ~p\n", [Rounds]),
true = ets:delete(T),
%% Verify no leakage of offheap key data
ok = erts_test_utils:check_node_dist(),
ok.
incr_counter(Name, Counters) ->
Counters#{Name => maps:get(Name, Counters, 0) + 1}.
count_stable(T, Next, {_, _, stable, _}=Key, N) ->
count_stable(T, Next, ets:Next(T, Key), N+1);
count_stable(T, Next, {_, _, volatile, _}=Key, N) ->
count_stable(T, Next, ets:Next(T, Key), N);
count_stable(_, _, '$end_of_table', N) ->
N.
ets_select_chunks_count(T, MS, Chunk) ->
ets_select_chunks_count(ets:select(T, MS, Chunk), 0).
ets_select_chunks_count('$end_of_table', N) ->
N;
ets_select_chunks_count({List, Continuation}, N) ->
ets_select_chunks_count(ets:select(Continuation),
length(List) + N).
maps_sum([Ma | Tail]) when is_map(Ma) ->
maps_sum([lists:sort(maps:to_list(Ma)) | Tail]);
maps_sum([La, Mb | Tail]) ->
Lab = lists:zipwith(fun({K,Va}, {K,Vb}) -> {K,Va+Vb} end,
La,
lists:sort(maps:to_list(Mb))),
maps_sum([Lab | Tail]);
maps_sum([L]) ->
L.
%% Test different types.
types(Config) when is_list(Config) ->
init_externals(),
repeat_for_opts(fun types_do/1, [repeat_for_opts_atom2list(set_types),
compressed]).
types_do(Opts) ->
EtsMem = etsmem(),
T = ets_new(xxx,Opts),
Fun = fun(Term) ->
ets:insert(T,{Term}),
[{Term}] = ets:lookup(T,Term),
ets:insert(T,{Term,xxx}),
[{Term,xxx}] = ets:lookup(T,Term),
ets:insert(T,{Term,"xxx"}),
[{Term,"xxx"}] = ets:lookup(T,Term),
ets:insert(T,{xxx,Term}),
[{xxx,Term}] = ets:lookup(T,xxx),
ets:insert(T,{"xxx",Term}),
[{"xxx",Term}] = ets:lookup(T,"xxx"),
ets:delete_all_objects(T),
0 = ets:info(T,size)
end,
test_terms(Fun, strict),
ets:delete(T),
verify_etsmem(EtsMem).
%% OTP-9932: Memory overwrite when inserting large integers in compressed bag.
%% Will crash with segv on 64-bit opt if not fixed.
otp_9932(Config) when is_list(Config) ->
T = ets_new(xxx, [bag, compressed]),
Fun = fun(N) ->
Key = {1316110174588445 bsl N,1316110174588583 bsl N},
S = {Key, Key},
true = ets:insert(T, S),
[S] = ets:lookup(T, Key),
true = ets:insert(T, S),
[S] = ets:lookup(T, Key)
end,
lists:foreach(Fun, lists:seq(0, 16)),
ets:delete(T).
%% vm-deadlock caused by race between ets:delete and others on
%% write_concurrency table.
otp_9423(Config) when is_list(Config) ->
repeat_for_all_non_stim_set_table_types(
fun(Opts) ->
InitF = fun(_) -> {0,0} end,
ExecF = fun({S,F}) ->
receive
stop ->
io:format("~p got stop\n", [self()]),
[end_of_work | {"Succeded=",S,"Failed=",F}]
after 0 ->
%%io:format("~p (~p) doing lookup\n", [self(), {S,F}]),
try ets:lookup(otp_9423, key) of
[] -> {S+1,F}
catch
error:badarg -> {S,F+1}
end
end
end,
FiniF = fun(R) -> R end,
case run_smp_workers(InitF, ExecF, FiniF, infinite, 1) of
Pids when is_list(Pids) ->
%%[P ! start || P <- Pids],
repeat(fun() -> ets_new(otp_9423, [named_table, public,
{write_concurrency,true}|Opts]),
ets:delete(otp_9423)
end, 10000),
[P ! stop || P <- Pids],
wait_pids(Pids),
ok;
Skipped -> Skipped
end
end).
%% Corrupted binary in compressed table
otp_10182(Config) when is_list(Config) ->
repeat_for_opts_all_table_types(
fun(Opts) ->
Bin = <<"aHR0cDovL2hvb3RzdWl0ZS5jb20vYy9wcm8tYWRyb2xsLWFi">>,
Key = {test, Bin},
Value = base64:decode(Bin),
In = {Key,Value},
Db = ets_new(undefined, Opts),
ets:insert(Db, In),
[Out] = ets:lookup(Db, Key),
io:format("In : ~p\nOut: ~p\n", [In,Out]),
ets:delete(Db),
In = Out
end).
%% Test that ets:all include/exclude tables that we know are created/deleted
ets_all(Config) when is_list(Config) ->
Pids = [spawn_link(fun() -> ets_all_run() end) || _ <- [1,2]],
receive after 3*1000 -> ok end,
[begin unlink(P), exit(P,kill) end || P <- Pids],
ok.
ets_all_run() ->
Table = ets:new(undefined, []),
true = lists:member(Table, ets:all()),
ets:delete(Table),
false = lists:member(Table, ets:all()),
ets_all_run().
create_tables(N) ->
create_tables(N, []).
create_tables(0, Ts) ->
Ts;
create_tables(N, Ts) ->
create_tables(N-1, [ets:new(tjo, [])|Ts]).
massive_ets_all(Config) when is_list(Config) ->
Me = self(),
InitTables = lists:sort(ets:all()),
io:format("InitTables=~p~n", [InitTables]),
PMs0 = lists:map(fun (Sid) ->
my_spawn_opt(fun () ->
Ts = create_tables(250),
Me ! {self(), up, Ts},
receive {Me, die} -> ok end
end,
[link, monitor, {scheduler, Sid}])
end,
lists:seq(1, erlang:system_info(schedulers_online))),
AllRes = lists:sort(lists:foldl(fun ({P, _M}, Ts) ->
receive
{P, up, PTs} ->
PTs ++ Ts
end
end,
InitTables,
PMs0)),
AllRes = lists:sort(ets:all()),
PMs1 = lists:map(fun (_) ->
my_spawn_opt(fun () ->
AllRes = lists:sort(ets:all())
end,
[link, monitor])
end, lists:seq(1, 50)),
lists:foreach(fun ({P, M}) ->
receive
{'DOWN', M, process, P, _} ->
ok
end
end, PMs1),
PMs2 = lists:map(fun (_) ->
my_spawn_opt(fun () ->
_ = ets:all()
end,
[link, monitor])
end, lists:seq(1, 50)),
lists:foreach(fun ({P, _M}) ->
P ! {Me, die}
end, PMs0),
lists:foreach(fun ({P, M}) ->
receive
{'DOWN', M, process, P, _} ->
ok
end
end, PMs0 ++ PMs2),
EndTables = lists:sort(ets:all()),
io:format("EndTables=~p~n", [EndTables]),
InitTables = EndTables,
ok.
take(Config) when is_list(Config) ->
%% Simple test for set tables.
T1 = ets_new(a, [set]),
[] = ets:take(T1, foo),
ets:insert(T1, {foo,bar}),
[] = ets:take(T1, bar),
[{foo,bar}] = ets:take(T1, foo),
[] = ets:tab2list(T1),
%% Non-immediate key.
ets:insert(T1, {{'not',<<"immediate">>},ok}),
[{{'not',<<"immediate">>},ok}] = ets:take(T1, {'not',<<"immediate">>}),
%% Same with ordered tables.
repeat_for_all_ord_set_table_types(
fun(Opts) ->
T2 = ets_new(b, Opts),
[] = ets:take(T2, foo),
ets:insert(T2, {foo,bar}),
[] = ets:take(T2, bar),
[{foo,bar}] = ets:take(T2, foo),
[] = ets:tab2list(T2),
ets:insert(T2, {{'not',<<"immediate">>},ok}),
[{{'not',<<"immediate">>},ok}] = ets:take(T2, {'not',<<"immediate">>}),
%% Arithmetically-equal keys.
ets:insert(T2, [{1.0,float},{2,integer}]),
[{1.0,float}] = ets:take(T2, 1),
[{2,integer}] = ets:take(T2, 2.0),
[] = ets:tab2list(T2),
ets:delete(T2)
end),
%% Same with bag.
T3 = ets_new(c, [bag]),
ets:insert(T3, [{1,1},{1,2},{3,3}]),
[{1,1},{1,2}] = ets:take(T3, 1),
[{3,3}] = ets:take(T3, 3),
[] = ets:tab2list(T3),
ets:delete(T1),
ets:delete(T3),
ok.
whereis_table(Config) when is_list(Config) ->
%% Do we return 'undefined' when the named table doesn't exist?
undefined = ets:whereis(whereis_test),
%% Does the tid() refer to the same table as the name?
whereis_test = ets:new(whereis_test, [named_table]),
Tid = ets:whereis(whereis_test),
ets:insert(whereis_test, [{hello}, {there}]),
[[{hello}],[{there}]] = ets:match(whereis_test, '$1'),
[[{hello}],[{there}]] = ets:match(Tid, '$1'),
true = ets:delete_all_objects(Tid),
[] = ets:match(whereis_test, '$1'),
[] = ets:match(Tid, '$1'),
%% Does the name disappear when deleted through the tid()?
true = ets:delete(Tid),
undefined = ets:info(whereis_test),
{'EXIT',{badarg, _}} = (catch ets:match(whereis_test, '$1')),
%% Is the old tid() broken when the table is re-created with the same
%% name?
whereis_test = ets:new(whereis_test, [named_table]),
[] = ets:match(whereis_test, '$1'),
{'EXIT',{badarg, _}} = (catch ets:match(Tid, '$1')),
ok.
%% The following work functions are used by
%% throughput_benchmark/4. They are declared on the top level beacuse
%% declaring them as function local funs cause a scalability issue.
get_op([{_,O}], _RandNum) ->
O;
get_op([{Prob,O}|Rest], RandNum) ->
case RandNum < Prob of
true -> O;
false -> get_op(Rest, RandNum)
end.
do_op(Table, ProbHelpTab, Range, Operations) ->
RandNum = rand:uniform(),
Op = get_op(ProbHelpTab, RandNum),
#{ Op := TheOp} = Operations,
TheOp(Table, Range).
do_work(WorksDoneSoFar, Table, ProbHelpTab, Range, Operations) ->
receive
stop -> WorksDoneSoFar
after
0 -> do_op(Table, ProbHelpTab, Range, Operations),
do_work(WorksDoneSoFar + 1, Table, ProbHelpTab, Range, Operations)
end.
prefill_table(T, KeyRange, Num, ObjFun) ->
Seed = rand:uniform(KeyRange),
%%io:format("prefill_table: Seed = ~p\n", [Seed]),
RState = unique_rand_start(KeyRange, Seed),
prefill_table_loop(T, RState, Num, ObjFun).
prefill_table_loop(_, _, 0, _) ->
ok;
prefill_table_loop(T, RS0, N, ObjFun) ->
{Key, RS1} = unique_rand_next(RS0),
ets:insert(T, ObjFun(Key)),
prefill_table_loop(T, RS1, N-1, ObjFun).
throughput_benchmark() ->
throughput_benchmark(false, not_set, not_set).
throughput_benchmark(TestMode, BenchmarkRunMs, RecoverTimeMs) ->
NrOfSchedulers = erlang:system_info(schedulers),
%% Definitions of operations that are supported by the benchmark
NextSeqOp =
fun (T, KeyRange, SeqSize) ->
Start = rand:uniform(KeyRange),
Last =
lists:foldl(
fun(_, Prev) ->
case Prev of
'$end_of_table'-> ok;
_ ->
try ets:next(T, Prev) of
Normal -> Normal
catch
error:badarg ->
% sets (not ordered_sets) cannot handle when the argument
% to next is not in the set
rand:uniform(KeyRange)
end
end
end,
Start,
lists:seq(1, SeqSize)),
case Last =:= -1 of
true -> io:format("Will never be printed");
false -> ok
end
end,
PartialSelectOp =
fun (T, KeyRange, SeqSize) ->
Start = rand:uniform(KeyRange),
Last = Start + SeqSize,
case -1 =:= ets:select_count(T,
ets:fun2ms(fun({X}) when X > Start andalso X =< Last -> true end)) of
true -> io:format("Will never be printed");
false -> ok
end
end,
%% Mapping benchmark operation names to their corresponding functions that do them
Operations =
#{insert =>
fun(T,KeyRange) ->
Num = rand:uniform(KeyRange),
ets:insert(T, {Num})
end,
delete =>
fun(T,KeyRange) ->
Num = rand:uniform(KeyRange),
ets:delete(T, Num)
end,
lookup =>
fun(T,KeyRange) ->
Num = rand:uniform(KeyRange),
ets:lookup(T, Num)
end,
nextseq10 =>
fun(T,KeyRange) -> NextSeqOp(T,KeyRange,10) end,
nextseq100 =>
fun(T,KeyRange) -> NextSeqOp(T,KeyRange,100) end,
nextseq1000 =>
fun(T,KeyRange) -> NextSeqOp(T,KeyRange,1000) end,
selectAll =>
fun(T,_KeyRange) ->
case -1 =:= ets:select_count(T, ets:fun2ms(fun(X) -> true end)) of
true -> io:format("Will never be printed");
false -> ok
end
end,
partial_select1000 =>
fun(T,KeyRange) -> PartialSelectOp(T,KeyRange,1000) end
},
%% Helper functions
CalculateThreadCounts = fun Calculate([Count|Rest]) ->
case Count > NrOfSchedulers of
true -> lists:reverse(Rest);
false -> Calculate([Count*2,Count|Rest])
end
end,
CalculateOpsProbHelpTab =
fun Calculate([{_, OpName}], _) ->
[{1.0, OpName}];
Calculate([{OpPropability, OpName}|Res], Current) ->
NewCurrent = Current + OpPropability,
[{NewCurrent, OpName}| Calculate(Res, NewCurrent)]
end,
RenderScenario =
fun R([], StringSoFar) ->
StringSoFar;
R([{Fraction, Operation}], StringSoFar) ->
io_lib:format("~s ~f% ~p",[StringSoFar, Fraction * 100.0, Operation]);
R([{Fraction, Operation}|Rest], StringSoFar) ->
R(Rest,
io_lib:format("~s ~f% ~p, ",[StringSoFar, Fraction * 100.0, Operation]))
end,
SafeFixTableIfRequired =
fun(Table, Scenario, On) ->
case set =:= ets:info(Table, type) of
true ->
HasNotRequiringOp =
lists:search(
fun({_,nextseq10}) -> true;
({_,nextseq100}) -> true;
({_,nextseq1000}) -> true;
(_) -> false
end, Scenario),
case HasNotRequiringOp of
false -> ok;
_ -> ets:safe_fixtable(Table, On)
end;
false -> ok
end
end,
%% Function that runs a benchmark instance and returns the number
%% of operations that were performed
RunBenchmark =
fun(NrOfProcs, TableConfig, Scenario,
Range, Duration, RecoverTime) ->
ProbHelpTab = CalculateOpsProbHelpTab(Scenario, 0),
Table = ets:new(t, TableConfig),
Nobj = Range div 2,
prefill_table(Table, Range, Nobj, fun(K) -> {K} end),
Nobj = ets:info(Table, size),
SafeFixTableIfRequired(Table, Scenario, true),
ParentPid = self(),
ChildPids =
lists:map(
fun(_N) ->
spawn(fun() ->
receive start -> ok end,
WorksDone =
do_work(0, Table, ProbHelpTab, Range, Operations),
ParentPid ! WorksDone
end)
end, lists:seq(1, NrOfProcs)),
lists:foreach(fun(Pid) -> Pid ! start end, ChildPids),
timer:sleep(Duration),
lists:foreach(fun(Pid) -> Pid ! stop end, ChildPids),
TotalWorksDone = lists:foldl(
fun(_, Sum) ->
receive
Count -> Sum + Count
end
end, 0, ChildPids),
SafeFixTableIfRequired(Table, Scenario, false),
ets:delete(Table),
timer:sleep(RecoverTime),
TotalWorksDone
end,
%%
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%%%% Benchmark Configuration %%%%%%%%%%%%%%%%%%%%%%%%
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%%
%% Change the following variables to configure the benchmark runs
ThreadCounts =
case TestMode of
true -> [1, NrOfSchedulers];
false -> CalculateThreadCounts([1])
end,
KeyRanges = % Sizes of the key ranges
case TestMode of
true -> [50000];
false -> [1000000]
end,
Duration =
case BenchmarkRunMs of % Duration of a benchmark run in milliseconds
not_set -> 30000;
_ -> BenchmarkRunMs
end,
TimeMsToSleepAfterEachBenchmarkRun =
case RecoverTimeMs of
not_set -> 1000;
_ -> RecoverTimeMs
end,
TableTypes = % The table types that will be benchmarked
[
[ordered_set, public],
[ordered_set, public, {write_concurrency, true}],
[ordered_set, public, {read_concurrency, true}],
[ordered_set, public, {write_concurrency, true}, {read_concurrency, true}],
[set, public],
[set, public, {write_concurrency, true}],
[set, public, {read_concurrency, true}],
[set, public, {write_concurrency, true}, {read_concurrency, true}]
],
Scenarios = % Benchmark scenarios (the fractions should add up to approximately 1.0)
[
[
{0.5, insert},
{0.5, delete}
],
[
{0.1, insert},
{0.1, delete},
{0.8, lookup}
],
[
{0.01, insert},
{0.01, delete},
{0.98, lookup}
],
[
{1.0, lookup}
],
[
{0.1, insert},
{0.1, delete},
{0.4, lookup},
{0.4, nextseq10}
],
[
{0.1, insert},
{0.1, delete},
{0.4, lookup},
{0.4, nextseq100}
],
[
{0.1, insert},
{0.1, delete},
{0.4, lookup},
{0.4, nextseq1000}
],
[
{1.0, nextseq1000}
],
[
{0.1, insert},
{0.1, delete},
{0.79, lookup},
{0.01, selectAll}
],
[
{0.1, insert},
{0.1, delete},
{0.7999, lookup},
{0.0001, selectAll}
],
[
{0.1, insert},
{0.1, delete},
{0.799999, lookup},
{0.000001, selectAll}
],
[
{0.1, insert},
{0.1, delete},
{0.79, lookup},
{0.01, partial_select1000}
],
[
{0.1, insert},
{0.1, delete},
{0.7999, lookup},
{0.0001, partial_select1000}
],
[
{0.1, insert},
{0.1, delete},
{0.799999, lookup},
{0.000001, partial_select1000}
]
],
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%%%% End of Benchmark Configuration %%%%%%%%%%%%%%%%
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%% Prepare for memory check
EtsMem = case TestMode of
true -> etsmem();
false -> ok
end,
%% Run the benchmark
io:format("# Each instance of the benchmark runs for ~w seconds:~n", [Duration/1000]),
io:format("# The result of a benchmark instance is presented as a number representing~n"),
io:format("# the number of operations performed per second:~n~n~n"),
io:format("# To plot graphs for the results below:~n"),
io:format("# 1. Open \"$ERL_TOP/lib/stdlib/test/ets_SUITE_data/visualize_throughput.html\" in a web browser~n"),
io:format("# 2. Copy the lines between \"#BENCHMARK STARTED$\" and \"#BENCHMARK ENDED$\" below~n"),
io:format("# 3. Paste the lines copied in step 2 to the text box in the browser window opened in~n"),
io:format("# step 1 and press the Render button~n~n"),
io:format("#BENCHMARK STARTED$~n"),
%% The following loop runs all benchmark scenarios and prints the results (i.e, operations/second)
lists:foreach(
fun(KeyRange) ->
lists:foreach(
fun(Scenario) ->
io:format("Scenario: ~s | Key Range Size: ~w$~n",
[RenderScenario(Scenario, ""),
KeyRange]),
lists:foreach(
fun(ThreadCount) ->
io:format("; ~w",[ThreadCount])
end,
ThreadCounts),
io:format("$~n",[]),
lists:foreach(
fun(TableType) ->
io:format("~w ",[TableType]),
lists:foreach(
fun(ThreadCount) ->
Result = RunBenchmark(ThreadCount,
TableType,
Scenario,
KeyRange,
Duration,
TimeMsToSleepAfterEachBenchmarkRun),
io:format("; ~f",[Result/(Duration/1000.0)])
end,
ThreadCounts),
io:format("$~n",[])
end,
TableTypes)
end,
Scenarios)
end,
KeyRanges),
io:format("~n#BENCHMARK ENDED$~n~n"),
case TestMode of
true -> verify_etsmem(EtsMem);
false -> ok
end.
test_throughput_benchmark(Config) when is_list(Config) ->
throughput_benchmark(true, 100, 0).
add_lists(L1,L2) ->
add_lists(L1,L2,[]).
add_lists([],[],Acc) ->
lists:reverse(Acc);
add_lists([E1|T1], [E2|T2], Acc) ->
add_lists(T1, T2, [E1+E2 | Acc]).
run_smp_workers(InitF,ExecF,FiniF,Laps) ->
run_smp_workers(InitF,ExecF,FiniF,Laps, 0).
run_smp_workers(InitF,ExecF,FiniF,Laps, Exclude) ->
case erlang:system_info(schedulers_online) of
N when N > Exclude ->
run_workers_do(InitF,ExecF,FiniF,Laps, N - Exclude);
_ ->
{skipped, "Too few schedulers online"}
end.
run_sched_workers(InitF,ExecF,FiniF,Laps) ->
run_workers_do(InitF,ExecF,FiniF,Laps,
erlang:system_info(schedulers)).
run_workers_do(InitF,ExecF,FiniF,Laps, NumOfProcs) ->
io:format("starting ~p workers\n",[NumOfProcs]),
Seeds = [{ProcN,rand:uniform(9999)} || ProcN <- lists:seq(1,NumOfProcs)],
Parent = self(),
Pids = [my_spawn_link(fun()-> worker(Seed,InitF,ExecF,FiniF,Laps,Parent,NumOfProcs) end)
|| Seed <- Seeds],
case Laps of
infinite -> Pids;
_ -> wait_pids(Pids)
end.
worker({ProcN,Seed}, InitF, ExecF, FiniF, Laps, Parent, NumOfProcs) ->
io:format("smp worker ~p, seed=~p~n",[self(),Seed]),
rand:seed(exsplus, {Seed,Seed,Seed}),
State1 = InitF([ProcN, NumOfProcs]),
State2 = worker_loop(Laps, ExecF, State1),
Result = FiniF(State2),
io:format("worker ~p done\n",[self()]),
Parent ! {self(), Result}.
worker_loop(0, _, State) ->
State;
worker_loop(_, _, [end_of_work|State]) ->
State;
worker_loop(infinite, ExecF, State) ->
worker_loop(infinite,ExecF,ExecF(State));
worker_loop(N, ExecF, State) ->
worker_loop(N-1,ExecF,ExecF(State)).
wait_pids(Pids) ->
wait_pids(Pids,[]).
wait_pids([],Acc) ->
Acc;
wait_pids(Pids, Acc) ->
receive
{Pid,Result} ->
true = lists:member(Pid,Pids),
Others = lists:delete(Pid,Pids),
%%io:format("wait_pid got ~p from ~p\n",[Result,Pid]),
wait_pids(Others,[Result | Acc])
after 60*1000 ->
io:format("Still waiting for workers ~p\n",[Pids]),
wait_pids(Pids, Acc)
end.
my_tab_to_list(Ts) ->
Key = ets:first(Ts),
my_tab_to_list(Ts,ets:next(Ts,Key),[ets:lookup(Ts, Key)]).
my_tab_to_list(_Ts,'$end_of_table', Acc) -> lists:reverse(Acc);
my_tab_to_list(Ts,Key, Acc) ->
my_tab_to_list(Ts,ets:next(Ts,Key),[ets:lookup(Ts, Key)| Acc]).
wait_for_memory_deallocations() ->
try
erts_debug:set_internal_state(wait, deallocations)
catch
error:undef ->
erts_debug:set_internal_state(available_internal_state, true),
wait_for_memory_deallocations()
end.
etsmem() ->
% The following is done twice to avoid an inconsistent memory
% "snapshot" (see verify_etsmem/2).
lists:foldl(
fun(_,_) ->
wait_for_memory_deallocations(),
AllTabs = lists:map(fun(T) -> {T,ets:info(T,name),ets:info(T,size),
ets:info(T,memory),ets:info(T,type)}
end, ets:all()),
EtsAllocSize = erts_debug:alloc_blocks_size(ets_alloc),
ErlangMemoryEts = try erlang:memory(ets) catch error:notsup -> notsup end,
Mem = {ErlangMemoryEts, EtsAllocSize},
{Mem, AllTabs}
end,
not_used,
lists:seq(1,2)).
verify_etsmem(MI) ->
wait_for_test_procs(),
verify_etsmem(MI, 1).
verify_etsmem({MemInfo,AllTabs}, Try) ->
case etsmem() of
{MemInfo,_} ->
io:format("Ets mem info: ~p", [MemInfo]),
case {MemInfo, Try} of
{{ErlMem,EtsAlloc},_} when ErlMem == notsup; EtsAlloc == undefined ->
%% Use 'erl +Mea max' to do more complete memory leak testing.
{comment,"Incomplete or no mem leak testing"};
{_, 1} ->
ok;
_ ->
{comment, "Transient memory discrepancy"}
end;
{MemInfo2, AllTabs2} ->
io:format("#Expected: ~p", [MemInfo]),
io:format("#Actual: ~p", [MemInfo2]),
io:format("#Changed tables before: ~p\n",[AllTabs -- AllTabs2]),
io:format("#Changed tables after: ~p\n", [AllTabs2 -- AllTabs]),
case Try < 2 of
true ->
io:format("\n#This discrepancy could be caused by an "
"inconsistent memory \"snapshot\""
"\n#Try again...\n", []),
verify_etsmem({MemInfo, AllTabs}, Try+1);
false ->
ct:fail("Failed memory check")
end
end.
start_loopers(N, Prio, Fun, State) ->
lists:map(fun (_) ->
my_spawn_opt(fun () -> looper(Fun, State) end,
[{priority, Prio}, link])
end,
lists:seq(1, N)).
stop_loopers(Loopers) ->
lists:foreach(fun (P) ->
unlink(P),
exit(P, bang)
end,
Loopers),
ok.
looper(Fun, State) ->
looper(Fun, Fun(State)).
spawn_logger(Procs) ->
receive
{new_test_proc, Proc} ->
spawn_logger([Proc|Procs]);
{sync_test_procs, Kill, From} ->
lists:foreach(fun (Proc) when From == Proc ->
ok;
(Proc) ->
Mon = erlang:monitor(process, Proc),
ok = receive
{'DOWN', Mon, _, _, _} ->
ok
after 0 ->
case Kill of
true -> exit(Proc, kill);
_ -> ok
end,
receive
{'DOWN', Mon, _, _, _} ->
ok
after 5000 ->
io:format("Waiting for 'DOWN' from ~w, status=~w\n"
"info = ~p\n", [Proc,
pid_status(Proc),
process_info(Proc)]),
timeout
end
end
end, Procs),
From ! test_procs_synced,
spawn_logger([From])
end.
pid_status(Pid) ->
try
erts_debug:get_internal_state({process_status, Pid})
catch
error:undef ->
erts_debug:set_internal_state(available_internal_state, true),
pid_status(Pid)
end.
start_spawn_logger() ->
case whereis(ets_test_spawn_logger) of
Pid when is_pid(Pid) -> true;
_ -> register(ets_test_spawn_logger,
spawn_opt(fun () -> spawn_logger([]) end,
[{priority, max}]))
end.
%% restart_spawn_logger() ->
%% stop_spawn_logger(),
%% start_spawn_logger().
stop_spawn_logger() ->
Mon = erlang:monitor(process, ets_test_spawn_logger),
(catch exit(whereis(ets_test_spawn_logger), kill)),
receive {'DOWN', Mon, _, _, _} -> ok end.
wait_for_test_procs() ->
wait_for_test_procs(false).
wait_for_test_procs(Kill) ->
ets_test_spawn_logger ! {sync_test_procs, Kill, self()},
receive test_procs_synced -> ok end.
log_test_proc(Proc) when is_pid(Proc) ->
ets_test_spawn_logger ! {new_test_proc, Proc},
Proc.
my_spawn(Fun) -> log_test_proc(spawn(Fun)).
my_spawn_link(Fun) -> log_test_proc(spawn_link(Fun)).
my_spawn_opt(Fun,Opts) ->
case spawn_opt(Fun,Opts) of
Pid when is_pid(Pid) -> log_test_proc(Pid);
{Pid, _} = Res when is_pid(Pid) -> log_test_proc(Pid), Res
end.
my_spawn_monitor(Fun) ->
Res = spawn_monitor(Fun),
{Pid, _} = Res,
log_test_proc(Pid),
Res.
repeat(_Fun, 0) ->
ok;
repeat(Fun, N) ->
Fun(),
repeat(Fun, N-1).
repeat_while(Fun) ->
case Fun() of
true -> repeat_while(Fun);
false -> false
end.
repeat_while(Fun, Arg0) ->
case Fun(Arg0) of
{true,Arg1} -> repeat_while(Fun,Arg1);
{false,Ret} -> Ret
end.
%% Some (but not all) permutations of List
repeat_for_permutations(Fun, List) ->
repeat_for_permutations(Fun, List, length(List)-1).
repeat_for_permutations(Fun, List, 0) ->
Fun(List);
repeat_for_permutations(Fun, List, N) ->
{A,B} = lists:split(N, List),
L1 = B++A,
L2 = lists:reverse(L1),
L3 = B++lists:reverse(A),
L4 = lists:reverse(B)++A,
Fun(L1), Fun(L2), Fun(L3), Fun(L4),
repeat_for_permutations(Fun, List, N-1).
receive_any() ->
receive M ->
io:format("Process ~p got msg ~p\n", [self(),M]),
M
end.
receive_any_spinning() ->
receive_any_spinning(1000000).
receive_any_spinning(Loops) ->
receive_any_spinning(Loops,Loops,1).
receive_any_spinning(Loops,0,Tries) ->
receive M ->
io:format("Spinning process ~p got msg ~p after ~p tries\n", [self(),M,Tries]),
M
after 0 ->
receive_any_spinning(Loops, Loops, Tries+1)
end;
receive_any_spinning(Loops, N, Tries) when N>0 ->
receive_any_spinning(Loops, N-1, Tries).
spawn_monitor_with_pid(Pid, Fun) when is_pid(Pid) ->
spawn_monitor_with_pid(Pid, Fun, 10).
spawn_monitor_with_pid(_, _, 0) ->
failed;
spawn_monitor_with_pid(Pid, Fun, N) ->
case my_spawn(fun()-> case self() of
Pid -> Fun();
_ -> die
end
end) of
Pid ->
{Pid, erlang:monitor(process, Pid)};
_Other ->
spawn_monitor_with_pid(Pid,Fun,N-1)
end.
only_if_smp(Func) ->
only_if_smp(2, Func).
only_if_smp(Schedulers, Func) ->
case erlang:system_info(schedulers_online) of
N when N < Schedulers -> {skip,"Too few schedulers online"};
_ -> Func()
end.
%% Copy-paste from emulator/test/binary_SUITE.erl
test_terms(Test_Func, Mode) ->
garbage_collect(),
Pib0 = process_info(self(),binary),
Test_Func(atom),
Test_Func(''),
Test_Func('a'),
Test_Func('ab'),
Test_Func('abc'),
Test_Func('abcd'),
Test_Func('abcde'),
Test_Func('abcdef'),
Test_Func('abcdefg'),
Test_Func('abcdefgh'),
Test_Func(fun() -> ok end),
X = id([a,{b,c},c]),
Y = id({x,y,z}),
Z = id(1 bsl 8*257),
Test_Func(fun() -> X end),
Test_Func(fun() -> {X,Y} end),
Test_Func([fun() -> {X,Y,Z} end,
fun() -> {Z,X,Y} end,
fun() -> {Y,Z,X} end]),
Test_Func({trace_ts,{even_bigger,{some_data,fun() -> ok end}},{1,2,3}}),
Test_Func({trace_ts,{even_bigger,{some_data,<<1,2,3,4,5,6,7,8,9,10>>}},
{1,2,3}}),
Test_Func(1),
Test_Func(42),
Test_Func(-23),
Test_Func(256),
Test_Func(25555),
Test_Func(-3333),
Test_Func(1.0),
Test_Func(183749783987483978498378478393874),
Test_Func(-37894183749783987483978498378478393874),
Very_Big = very_big_num(),
Test_Func(Very_Big),
Test_Func(-Very_Big+1),
Test_Func([]),
Test_Func("abcdef"),
Test_Func([a, b, 1, 2]),
Test_Func([a|b]),
Test_Func({}),
Test_Func({1}),
Test_Func({a, b}),
Test_Func({a, b, c}),
Test_Func(list_to_tuple(lists:seq(0, 255))),
Test_Func(list_to_tuple(lists:seq(0, 256))),
Test_Func(make_ref()),
Test_Func([make_ref(), make_ref()]),
Test_Func(make_port()),
Test_Func(make_pid()),
Test_Func(make_ext_pid()),
Test_Func(make_ext_port()),
Test_Func(make_ext_ref()),
Bin0 = list_to_binary(lists:seq(0, 14)),
Test_Func(Bin0),
Bin1 = list_to_binary(lists:seq(0, ?heap_binary_size)),
Test_Func(Bin1),
Bin2 = list_to_binary(lists:seq(0, ?heap_binary_size+1)),
Test_Func(Bin2),
Bin3 = list_to_binary(lists:seq(0, 255)),
garbage_collect(),
Pib = process_info(self(),binary),
Test_Func(Bin3),
garbage_collect(),
case Mode of
strict -> Pib = process_info(self(),binary);
skip_refc_check -> ok
end,
Test_Func(make_unaligned_sub_binary(Bin0)),
Test_Func(make_unaligned_sub_binary(Bin1)),
Test_Func(make_unaligned_sub_binary(Bin2)),
Test_Func(make_unaligned_sub_binary(Bin3)),
Test_Func(make_sub_binary(lists:seq(42, 43))),
Test_Func(make_sub_binary([42,43,44])),
Test_Func(make_sub_binary([42,43,44,45])),
Test_Func(make_sub_binary([42,43,44,45,46])),
Test_Func(make_sub_binary([42,43,44,45,46,47])),
Test_Func(make_sub_binary([42,43,44,45,46,47,48])),
Test_Func(make_sub_binary(lists:seq(42, 49))),
Test_Func(make_sub_binary(lists:seq(0, 14))),
Test_Func(make_sub_binary(lists:seq(0, ?heap_binary_size))),
Test_Func(make_sub_binary(lists:seq(0, ?heap_binary_size+1))),
Test_Func(make_sub_binary(lists:seq(0, 255))),
Test_Func(make_unaligned_sub_binary(lists:seq(42, 43))),
Test_Func(make_unaligned_sub_binary([42,43,44])),
Test_Func(make_unaligned_sub_binary([42,43,44,45])),
Test_Func(make_unaligned_sub_binary([42,43,44,45,46])),
Test_Func(make_unaligned_sub_binary([42,43,44,45,46,47])),
Test_Func(make_unaligned_sub_binary([42,43,44,45,46,47,48])),
Test_Func(make_unaligned_sub_binary(lists:seq(42, 49))),
Test_Func(make_unaligned_sub_binary(lists:seq(0, 14))),
Test_Func(make_unaligned_sub_binary(lists:seq(0, ?heap_binary_size))),
Test_Func(make_unaligned_sub_binary(lists:seq(0, ?heap_binary_size+1))),
Test_Func(make_unaligned_sub_binary(lists:seq(0, 255))),
%% Bit level binaries.
Test_Func(<<1:1>>),
Test_Func(<<2:2>>),
Test_Func(<<42:10>>),
Test_Func(list_to_bitstring([<<5:6>>|lists:seq(0, 255)])),
Test_Func(F = fun(A) -> 42*A end),
Test_Func(lists:duplicate(32, F)),
Test_Func(FF = fun binary_SUITE:all/1),
Test_Func(lists:duplicate(32, FF)),
garbage_collect(),
case Mode of
strict -> Pib0 = process_info(self(),binary);
skip_refc_check -> ok
end,
ok.
id(I) -> I.
very_big_num() ->
very_big_num(33, 1).
very_big_num(Left, Result) when Left > 0 ->
very_big_num(Left-1, Result*256);
very_big_num(0, Result) ->
Result.
make_port() ->
hd(erlang:ports()).
make_pid() ->
spawn_link(fun sleeper/0).
sleeper() ->
receive after infinity -> ok end.
make_ext_pid() ->
{Pid, _, _} = get(externals),
Pid.
make_ext_port() ->
{_, Port, _} = get(externals),
Port.
make_ext_ref() ->
{_, _, Ref} = get(externals),
Ref.
init_externals() ->
case get(externals) of
undefined ->
OtherNode = {gurka@sallad, 1},
Res = {mk_pid(OtherNode, 7645, 8123),
mk_port(OtherNode, 187489773),
mk_ref(OtherNode, [262143, 1293964255, 3291964278])},
put(externals, Res);
{_,_,_} -> ok
end.
%%
%% Node container constructor functions
%%
-define(VERSION_MAGIC, 131).
-define(PORT_EXT, 102).
-define(PID_EXT, 103).
-define(NEW_REFERENCE_EXT, 114).
uint32_be(Uint) when is_integer(Uint), 0 =< Uint, Uint < 1 bsl 32 ->
[(Uint bsr 24) band 16#ff,
(Uint bsr 16) band 16#ff,
(Uint bsr 8) band 16#ff,
Uint band 16#ff];
uint32_be(Uint) ->
exit({badarg, uint32_be, [Uint]}).
uint16_be(Uint) when is_integer(Uint), 0 =< Uint, Uint < 1 bsl 16 ->
[(Uint bsr 8) band 16#ff,
Uint band 16#ff];
uint16_be(Uint) ->
exit({badarg, uint16_be, [Uint]}).
uint8(Uint) when is_integer(Uint), 0 =< Uint, Uint < 1 bsl 8 ->
Uint band 16#ff;
uint8(Uint) ->
exit({badarg, uint8, [Uint]}).
mk_pid({NodeName, Creation}, Number, Serial) when is_atom(NodeName) ->
<<?VERSION_MAGIC, NodeNameExt/binary>> = term_to_binary(NodeName),
mk_pid({NodeNameExt, Creation}, Number, Serial);
mk_pid({NodeNameExt, Creation}, Number, Serial) ->
case catch binary_to_term(list_to_binary([?VERSION_MAGIC,
?PID_EXT,
NodeNameExt,
uint32_be(Number),
uint32_be(Serial),
uint8(Creation)])) of
Pid when is_pid(Pid) ->
Pid;
{'EXIT', {badarg, _}} ->
exit({badarg, mk_pid, [{NodeNameExt, Creation}, Number, Serial]});
Other ->
exit({unexpected_binary_to_term_result, Other})
end.
mk_port({NodeName, Creation}, Number) when is_atom(NodeName) ->
<<?VERSION_MAGIC, NodeNameExt/binary>> = term_to_binary(NodeName),
mk_port({NodeNameExt, Creation}, Number);
mk_port({NodeNameExt, Creation}, Number) ->
case catch binary_to_term(list_to_binary([?VERSION_MAGIC,
?PORT_EXT,
NodeNameExt,
uint32_be(Number),
uint8(Creation)])) of
Port when is_port(Port) ->
Port;
{'EXIT', {badarg, _}} ->
exit({badarg, mk_port, [{NodeNameExt, Creation}, Number]});
Other ->
exit({unexpected_binary_to_term_result, Other})
end.
mk_ref({NodeName, Creation}, Numbers) when is_atom(NodeName),
is_integer(Creation),
is_list(Numbers) ->
<<?VERSION_MAGIC, NodeNameExt/binary>> = term_to_binary(NodeName),
mk_ref({NodeNameExt, Creation}, Numbers);
mk_ref({NodeNameExt, Creation}, Numbers) when is_binary(NodeNameExt),
is_integer(Creation),
is_list(Numbers) ->
case catch binary_to_term(list_to_binary([?VERSION_MAGIC,
?NEW_REFERENCE_EXT,
uint16_be(length(Numbers)),
NodeNameExt,
uint8(Creation),
lists:map(fun (N) ->
uint32_be(N)
end,
Numbers)])) of
Ref when is_reference(Ref) ->
Ref;
{'EXIT', {badarg, _}} ->
exit({badarg, mk_ref, [{NodeNameExt, Creation}, Numbers]});
Other ->
exit({unexpected_binary_to_term_result, Other})
end.
make_sub_binary(Bin) when is_binary(Bin) ->
{_,B} = split_binary(list_to_binary([0,1,3,Bin]), 3),
B;
make_sub_binary(List) ->
make_sub_binary(list_to_binary(List)).
make_unaligned_sub_binary(Bin0) when is_binary(Bin0) ->
Bin1 = <<0:3,Bin0/binary,31:5>>,
Sz = size(Bin0),
<<0:3,Bin:Sz/binary,31:5>> = id(Bin1),
Bin;
make_unaligned_sub_binary(List) ->
make_unaligned_sub_binary(list_to_binary(List)).
%% Repeat test function with different combination of table options
%%
repeat_for_opts(F) ->
repeat_for_opts(F, [write_concurrency, read_concurrency, compressed]).
repeat_for_opts_all_table_types(F) ->
repeat_for_opts(F, [all_types, write_concurrency, read_concurrency, compressed]).
repeat_for_opts_all_non_stim_table_types(F) ->
repeat_for_opts(F, [all_non_stim_types, write_concurrency, read_concurrency, compressed]).
repeat_for_opts_all_set_table_types(F) ->
repeat_for_opts(F, [set_types, write_concurrency, read_concurrency, compressed]).
repeat_for_all_set_table_types(F) ->
repeat_for_opts(F, [set_types]).
repeat_for_all_ord_set_table_types(F) ->
repeat_for_opts(F, [ord_set_types]).
repeat_for_all_non_stim_set_table_types(F) ->
repeat_for_opts(F, [all_non_stim_set_types]).
repeat_for_opts_all_ord_set_table_types(F) ->
repeat_for_opts(F, [ord_set_types, write_concurrency, read_concurrency, compressed]).
repeat_for_opts(F, OptGenList) when is_function(F, 1) ->
repeat_for_opts(F, OptGenList, []).
repeat_for_opts(F, [], Acc) ->
lists:foldl(fun(Opts, RV_Acc) ->
OptList = lists:filter(fun(E) -> E =/= void end, Opts),
case is_redundant_opts_combo(OptList) of
true ->
%%io:format("Ignoring redundant options ~p\n",[OptList]),
ok;
false ->
io:format("Calling with options ~p\n",[OptList]),
RV = F(OptList),
case RV_Acc of
{comment,_} -> RV_Acc;
_ -> case RV of
{comment,_} -> RV;
_ -> [RV | RV_Acc]
end
end
end
end, [], Acc);
repeat_for_opts(F, [OptList | Tail], []) when is_list(OptList) ->
repeat_for_opts(F, Tail, [[Opt] || Opt <- OptList]);
repeat_for_opts(F, [OptList | Tail], AccList) when is_list(OptList) ->
repeat_for_opts(F, Tail, [[Opt|Acc] || Opt <- OptList, Acc <- AccList]);
repeat_for_opts(F, [Atom | Tail], AccList) when is_atom(Atom) ->
repeat_for_opts(F, [repeat_for_opts_atom2list(Atom) | Tail ], AccList).
repeat_for_opts_atom2list(set_types) -> [set,ordered_set,stim_cat_ord_set,cat_ord_set];
repeat_for_opts_atom2list(ord_set_types) -> [ordered_set,stim_cat_ord_set,cat_ord_set];
repeat_for_opts_atom2list(all_types) -> [set,ordered_set,stim_cat_ord_set,cat_ord_set,bag,duplicate_bag];
repeat_for_opts_atom2list(all_non_stim_types) -> [set,ordered_set,cat_ord_set,bag,duplicate_bag];
repeat_for_opts_atom2list(all_non_stim_set_types) -> [set,ordered_set,cat_ord_set];
repeat_for_opts_atom2list(write_concurrency) -> [{write_concurrency,false},{write_concurrency,true}];
repeat_for_opts_atom2list(read_concurrency) -> [{read_concurrency,false},{read_concurrency,true}];
repeat_for_opts_atom2list(compressed) -> [compressed,void].
is_redundant_opts_combo(Opts) ->
(lists:member(stim_cat_ord_set, Opts) orelse
lists:member(cat_ord_set, Opts))
andalso
(lists:member({write_concurrency, false}, Opts) orelse
lists:member(private, Opts) orelse
lists:member(protected, Opts)).
%% Add fake table option with info about key range.
%% Will be consumed by ets_new and used for stim_cat_ord_set.
key_range(Opts, KeyRange) ->
[{key_range, KeyRange} | Opts].
ets_new(Name, Opts0) ->
{KeyRange, Opts1} = case lists:keytake(key_range, 1, Opts0) of
{value, {key_range, KR}, Rest1} ->
{KR, Rest1};
false ->
{1000*1000, Opts0}
end,
ets_new(Name, Opts1, KeyRange).
ets_new(Name, Opts, KeyRange) ->
ets_new(Name, Opts, KeyRange, fun id/1).
ets_new(Name, Opts0, KeyRange, KeyFun) ->
{CATree, Stimulate, RevOpts} =
lists:foldl(fun(cat_ord_set, {false, false, Lacc}) ->
{true, false, [ordered_set | Lacc]};
(stim_cat_ord_set, {false, false, Lacc}) ->
{true, true, [ordered_set | Lacc]};
(Other, {CAT, STIM, Lacc}) ->
{CAT, STIM, [Other | Lacc]}
end,
{false, false, []},
Opts0),
Opts = lists:reverse(RevOpts),
EtsNewHelper =
fun (UseOpts) ->
case get(ets_new_opts) of
UseOpts ->
silence; %% suppress identical table opts spam
_ ->
put(ets_new_opts, UseOpts),
io:format("ets:new(~p, ~p)~n", [Name, UseOpts])
end,
ets:new(Name, UseOpts)
end,
case CATree andalso
(not lists:member({write_concurrency, false}, Opts)) andalso
(not lists:member(private, Opts)) andalso
(not lists:member(protected, Opts)) of
true ->
NewOpts1 =
case lists:member({write_concurrency, true}, Opts) of
true -> Opts;
false -> [{write_concurrency, true}|Opts]
end,
NewOpts2 =
case lists:member(public, NewOpts1) of
true -> NewOpts1;
false -> [public|NewOpts1]
end,
T = EtsNewHelper(NewOpts2),
case Stimulate of
false -> ok;
true -> stimulate_contention(T, KeyRange, KeyFun)
end,
T;
false ->
EtsNewHelper(Opts)
end.
% The purpose of this function is to stimulate fine grained locking in
% tables of types ordered_set with the write_concurrency options
% turned on. The erts_debug feature 'ets_force_split' is used to easier
% generate a routing tree with fine grained locking without having to
% provoke lots of actual lock contentions.
stimulate_contention(Tid, KeyRange, KeyFun) ->
T = case Tid of
A when is_atom(A) -> ets:whereis(A);
_ -> Tid
end,
erts_debug:set_internal_state(ets_force_split, {T, true}),
Num = case KeyRange > 50 of
true -> 50;
false -> KeyRange
end,
Seed = rand:uniform(KeyRange),
%%io:format("prefill_table: Seed = ~p\n", [Seed]),
RState = unique_rand_start(KeyRange, Seed),
stim_inserter_loop(T, RState, Num, KeyFun),
Num = ets:info(T, size),
ets:match_delete(T, {'$1','$1','$1'}),
0 = ets:info(T, size),
erts_debug:set_internal_state(ets_force_split, {T, false}),
case ets:info(T,stats) of
{0, _, _} ->
io:format("No routing nodes in table?\n"
"Debug feature 'ets_force_split' does not seem to work.\n", []),
ct:fail("No ets_force_split?");
Stats ->
io:format("stimulated ordered_set: ~p\n", [Stats])
end.
stim_inserter_loop(_, _, 0, _) ->
ok;
stim_inserter_loop(T, RS0, N, KeyFun) ->
{K, RS1} = unique_rand_next(RS0),
Key = KeyFun(K),
ets:insert(T, {Key, Key, Key}),
stim_inserter_loop(T, RS1, N-1, KeyFun).
do_tc(Do, Report) ->
T1 = erlang:monotonic_time(),
Do(),
T2 = erlang:monotonic_time(),
Elapsed = erlang:convert_time_unit(T2 - T1, native, millisecond),
Report(Elapsed).
syrup_factor() ->
case erlang:system_info(build_type) of
valgrind -> 20;
_ -> 1
end.
%%
%% This is a pseudo random number generator for UNIQUE integers.
%% All integers between 1 and Max will be generated before it repeat itself.
%% It's a variant of this one using quadratic residues by Jeff Preshing:
%% http://preshing.com/20121224/how-to-generate-a-sequence-of-unique-random-integers/
%%
unique_rand_start(Max, Seed) ->
L = lists:dropwhile(fun(P) -> P < Max end,
primes_3mod4()),
[P | _] = case L of
[] ->
error("Random range too large");
_ ->
L
end,
3 = P rem 4,
{0, {Max, P, Seed}}.
unique_rand_next({N, {Max, P, Seed}=Const}) ->
case dquad(P, N, Seed) + 1 of
RND when RND > Max -> % Too large, skip
unique_rand_next({N+1, Const});
RND ->
{RND, {N+1, Const}}
end.
%% A one-to-one relation between all integers 0 =< X < Prime
%% if Prime rem 4 == 3.
quad(Prime, X) ->
Rem = X*X rem Prime,
case 2*X < Prime of
true ->
Rem;
false ->
Prime - Rem
end.
dquad(Prime, X, Seed) ->
quad(Prime, (quad(Prime, X) + Seed) rem Prime).
%% Primes where P rem 4 == 3.
primes_3mod4() ->
[103, 211, 503, 1019, 2003, 5003, 10007, 20011, 50023,
100003, 200003, 500083, 1000003, 2000003, 5000011,
10000019, 20000003, 50000047, 100000007].