Remove unused files
This commit is contained in:
Kresten Krab Thorup
parent
4b2c937be9
commit
3abc189680
2 changed files with 0 additions and 281 deletions
|
|
@ -1,241 +0,0 @@
|
|||
%% ----------------------------------------------------------------------------
|
||||
%%
|
||||
%% lsm_btree: LSM-trees (Log-Structured Merge Trees) Indexed Storage
|
||||
%%
|
||||
%% Copyright 2011-2012 (c) Trifork A/S. All Rights Reserved.
|
||||
%% http://trifork.com/ info@trifork.com
|
||||
%%
|
||||
%% Copyright 2012 (c) Basho Technologies, Inc. All Rights Reserved.
|
||||
%% http://basho.com/ info@basho.com
|
||||
%%
|
||||
%% This file is provided to you 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.
|
||||
%%
|
||||
%% ----------------------------------------------------------------------------
|
||||
|
||||
-module(lsm_btree).
|
||||
-author('Kresten Krab Thorup <krab@trifork.com>').
|
||||
|
||||
|
||||
-behavior(gen_server).
|
||||
|
||||
-export([init/1, handle_call/3, handle_cast/2, handle_info/2,
|
||||
terminate/2, code_change/3]).
|
||||
|
||||
-export([open/1, close/1, get/2, lookup/2, delete/2, put/3,
|
||||
async_range/2, async_fold_range/4, sync_range/2, sync_fold_range/4]).
|
||||
|
||||
-include("lsm_btree.hrl").
|
||||
-include_lib("kernel/include/file.hrl").
|
||||
-include_lib("include/lsm_btree.hrl").
|
||||
|
||||
-record(state, { top, nursery, dir }).
|
||||
|
||||
|
||||
%% PUBLIC API
|
||||
|
||||
open(Dir) ->
|
||||
gen_server:start(?MODULE, [Dir], []).
|
||||
|
||||
close(Ref) ->
|
||||
try
|
||||
gen_server:call(Ref, close)
|
||||
catch
|
||||
exit:{noproc,_} -> ok;
|
||||
exit:noproc -> ok;
|
||||
%% Handle the case where the monitor triggers
|
||||
exit:{normal, _} -> ok
|
||||
end.
|
||||
|
||||
get(Ref,Key) when is_binary(Key) ->
|
||||
gen_server:call(Ref, {get, Key}).
|
||||
|
||||
%% for compatibility with original code
|
||||
lookup(Ref,Key) when is_binary(Key) ->
|
||||
gen_server:call(Ref, {get, Key}).
|
||||
|
||||
delete(Ref,Key) when is_binary(Key) ->
|
||||
gen_server:call(Ref, {delete, Key}).
|
||||
|
||||
put(Ref,Key,Value) when is_binary(Key), is_binary(Value) ->
|
||||
gen_server:call(Ref, {put, Key, Value}).
|
||||
|
||||
sync_range(Ref, #btree_range{}=Range) ->
|
||||
gen_server:call(Ref, {sync_range, self(), Range}).
|
||||
|
||||
sync_fold_range(Ref,Fun,Acc0,Range) ->
|
||||
{ok, PID} = sync_range(Ref, Range),
|
||||
sync_receive_fold_range(PID,Fun,Acc0).
|
||||
|
||||
sync_receive_fold_range(PID,Fun,Acc0) ->
|
||||
receive
|
||||
{fold_result, PID, K,V} ->
|
||||
sync_receive_fold_range(PID, Fun, Fun(K,V,Acc0));
|
||||
{fold_limit, PID, _} ->
|
||||
Acc0;
|
||||
{fold_done, PID} ->
|
||||
Acc0
|
||||
end.
|
||||
|
||||
|
||||
|
||||
async_range(Ref, #btree_range{}=Range) ->
|
||||
gen_server:call(Ref, {async_range, self(), Range}).
|
||||
|
||||
async_fold_range(Ref,Fun,Acc0,Range) ->
|
||||
Range2 = Range#btree_range{ limit=?BTREE_ASYNC_CHUNK_SIZE },
|
||||
FoldMoreFun = fun() ->
|
||||
{ok, PID} = gen_server:call(Ref, {sync_range, self(), Range}),
|
||||
async_receive_fold_range(PID,Fun,Acc0,Ref,Range2)
|
||||
end,
|
||||
{async, FoldMoreFun}.
|
||||
|
||||
async_receive_fold_range(PID,Fun,Acc0,Ref,Range) ->
|
||||
receive
|
||||
{fold_result, PID, K,V} ->
|
||||
async_receive_fold_range(PID, Fun, Fun(K,V,Acc0), Ref, Range);
|
||||
{fold_limit, PID, Key} ->
|
||||
Range2 = Range#btree_range{ from_key = Key, from_inclusive=true },
|
||||
async_fold_range(Ref, Fun, Acc0, Range2);
|
||||
{fold_done, PID} ->
|
||||
{ok, Acc0}
|
||||
end.
|
||||
|
||||
|
||||
init([Dir]) ->
|
||||
|
||||
case file:read_file_info(Dir) of
|
||||
{ok, #file_info{ type=directory }} ->
|
||||
{ok, TopLevel} = open_levels(Dir),
|
||||
{ok, Nursery} = lsm_btree_nursery:recover(Dir, TopLevel);
|
||||
|
||||
{error, E} when E =:= enoent ->
|
||||
ok = file:make_dir(Dir),
|
||||
{ok, TopLevel} = lsm_btree_level:open(Dir, ?TOP_LEVEL, undefined),
|
||||
{ok, Nursery} = lsm_btree_nursery:new(Dir)
|
||||
end,
|
||||
|
||||
{ok, #state{ top=TopLevel, dir=Dir, nursery=Nursery }}.
|
||||
|
||||
|
||||
|
||||
open_levels(Dir) ->
|
||||
{ok, Files} = file:list_dir(Dir),
|
||||
|
||||
%% parse file names and find max level
|
||||
{MinLevel,MaxLevel} =
|
||||
lists:foldl(fun(FileName, {MinLevel,MaxLevel}) ->
|
||||
case parse_level(FileName) of
|
||||
{ok, Level} ->
|
||||
{ erlang:min(MinLevel, Level),
|
||||
erlang:max(MaxLevel, Level) };
|
||||
_ ->
|
||||
{MinLevel,MaxLevel}
|
||||
end
|
||||
end,
|
||||
{?TOP_LEVEL, ?TOP_LEVEL},
|
||||
Files),
|
||||
|
||||
% error_logger:info_msg("found level files ... {~p,~p}~n", [MinLevel, MaxLevel]),
|
||||
|
||||
%% remove old nursery file
|
||||
file:delete(filename:join(Dir,"nursery.data")),
|
||||
|
||||
TopLevel =
|
||||
lists:foldl( fun(LevelNo, Prev) ->
|
||||
{ok, Level} = lsm_btree_level:open(Dir,LevelNo,Prev),
|
||||
Level
|
||||
end,
|
||||
undefined,
|
||||
lists:seq(MaxLevel, MinLevel, -1)),
|
||||
|
||||
{ok, TopLevel}.
|
||||
|
||||
parse_level(FileName) ->
|
||||
case re:run(FileName, "^[^\\d]+-(\\d+)\\.data$", [{capture,all_but_first,list}]) of
|
||||
{match,[StringVal]} ->
|
||||
{ok, list_to_integer(StringVal)};
|
||||
_ ->
|
||||
nomatch
|
||||
end.
|
||||
|
||||
|
||||
handle_info(Info,State) ->
|
||||
error_logger:error_msg("Unknown info ~p~n", [Info]),
|
||||
{stop,bad_msg,State}.
|
||||
|
||||
handle_cast(Info,State) ->
|
||||
error_logger:error_msg("Unknown cast ~p~n", [Info]),
|
||||
{stop,bad_msg,State}.
|
||||
|
||||
|
||||
%% premature delete -> cleanup
|
||||
terminate(_Reason,_State) ->
|
||||
% error_logger:info_msg("got terminate(~p,~p)~n", [Reason,State]),
|
||||
% flush_nursery(State),
|
||||
ok.
|
||||
|
||||
code_change(_OldVsn, State, _Extra) ->
|
||||
{ok, State}.
|
||||
|
||||
|
||||
|
||||
handle_call({async_range, Sender, Range}, _From, State=#state{ top=TopLevel, nursery=Nursery }) ->
|
||||
{ok, FoldWorkerPID} = lsm_btree_fold_worker:start(Sender),
|
||||
lsm_btree_nursery:do_level_fold(Nursery, FoldWorkerPID, Range),
|
||||
Result = lsm_btree_level:async_range(TopLevel, FoldWorkerPID, Range),
|
||||
{reply, Result, State};
|
||||
|
||||
handle_call({sync_range, Sender, Range}, _From, State=#state{ top=TopLevel, nursery=Nursery }) ->
|
||||
{ok, FoldWorkerPID} = lsm_btree_fold_worker:start(Sender),
|
||||
lsm_btree_nursery:do_level_fold(Nursery, FoldWorkerPID, Range),
|
||||
Result = lsm_btree_level:sync_range(TopLevel, FoldWorkerPID, Range),
|
||||
{reply, Result, State};
|
||||
|
||||
handle_call({put, Key, Value}, _From, State) when is_binary(Key), is_binary(Value) ->
|
||||
{ok, State2} = do_put(Key, Value, State),
|
||||
{reply, ok, State2};
|
||||
|
||||
handle_call({delete, Key}, _From, State) when is_binary(Key) ->
|
||||
{ok, State2} = do_put(Key, ?TOMBSTONE, State),
|
||||
{reply, ok, State2};
|
||||
|
||||
handle_call({get, Key}, _From, State=#state{ top=Top, nursery=Nursery } ) when is_binary(Key) ->
|
||||
case lsm_btree_nursery:lookup(Key, Nursery) of
|
||||
{value, ?TOMBSTONE} ->
|
||||
{reply, not_found, State};
|
||||
{value, Value} when is_binary(Value) ->
|
||||
{reply, {ok, Value}, State};
|
||||
none ->
|
||||
Reply = lsm_btree_level:lookup(Top, Key),
|
||||
{reply, Reply, State}
|
||||
end;
|
||||
|
||||
handle_call(close, _From, State=#state{top=Top}) ->
|
||||
try
|
||||
{ok, State2} = flush_nursery(State),
|
||||
ok = lsm_btree_level:close(Top),
|
||||
{stop, normal, ok, State2}
|
||||
catch
|
||||
E:R ->
|
||||
error_logger:info_msg("exception from close ~p:~p~n", [E,R]),
|
||||
{stop, normal, ok, State}
|
||||
end.
|
||||
|
||||
do_put(Key, Value, State=#state{ nursery=Nursery, top=Top }) ->
|
||||
{ok, Nursery2} = lsm_btree_nursery:add_maybe_flush(Key, Value, Nursery, Top),
|
||||
{ok, State#state{ nursery=Nursery2 }}.
|
||||
|
||||
flush_nursery(State=#state{nursery=Nursery, top=Top, dir=Dir}) ->
|
||||
ok = lsm_btree_nursery:finish(Nursery, Top),
|
||||
{ok, Nursery2} = lsm_btree_nursery:new(Dir),
|
||||
{ok, State#state{ nursery=Nursery2 }}.
|
||||
40
src/qtop.erl
40
src/qtop.erl
|
|
@ -1,40 +0,0 @@
|
|||
-module(qtop).
|
||||
|
||||
-export([max/0, max/1, queue/2, queue/1]).
|
||||
|
||||
max() ->
|
||||
max(5).
|
||||
|
||||
max(N) ->
|
||||
PIDs = erlang:processes(),
|
||||
Pairs = lists:foldl(fun(PID,Acc) ->
|
||||
case erlang:process_info(PID, message_queue_len) of
|
||||
{message_queue_len, Len} ->
|
||||
[{Len, PID}|Acc];
|
||||
_ ->
|
||||
Acc
|
||||
end
|
||||
end,
|
||||
[],
|
||||
PIDs),
|
||||
[{_, MaxPID}|_] = lists:reverse(lists:sort(Pairs)),
|
||||
queue(MaxPID,N).
|
||||
|
||||
queue(PID) ->
|
||||
queue(PID, 5).
|
||||
|
||||
queue(PID, N) when is_list(PID) ->
|
||||
queue(erlang:list_to_pid(PID), N);
|
||||
queue(MaxPID, N) ->
|
||||
{message_queue_len, MaxLen} = erlang:process_info(MaxPID, message_queue_len),
|
||||
{messages, Msgs} = erlang:process_info(MaxPID, messages),
|
||||
{Front30,_} = lists:split(min(N,length(Msgs)), Msgs),
|
||||
io:format("==== PID: ~p, qlen:~p~n", [MaxPID,MaxLen]),
|
||||
lists:foldl( fun(Msg,M) ->
|
||||
io:format("[~p]: ~P~n", [M, Msg,30]),
|
||||
M+1
|
||||
end,
|
||||
1,
|
||||
Front30),
|
||||
ok.
|
||||
|
||||
Loading…
Reference in a new issue