kvs.erl 18 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427
  1. -module(kvs).
  2. -copyright('Synrc Research Center s.r.o.').
  3. -compile(export_all).
  4. %-include_lib("stdlib/include/qlc.hrl").
  5. -include("config.hrl").
  6. -include("metainfo.hrl").
  7. -include("kvs.hrl").
  8. -include("user.hrl").
  9. -include("api.hrl").
  10. % Public Main Backend is given in sys.config and
  11. % could be obtained with application:get_env(kvs,dba,store_mnesia).
  12. delete(Table,Key) -> delete (Table, Key, #kvs{mod=?DBA}).
  13. remove(Table,Key) -> remove (Table, Key, #kvs{mod=?DBA}).
  14. get(Table,Key) -> get (Table, Key, #kvs{mod=?DBA}).
  15. index(Table,K,V) -> index (Table, K,V, #kvs{mod=?DBA}).
  16. change_storage(Table,Type) -> change_storage(Table,Type, #kvs{mod=?DBA}).
  17. entries(A,B,C) -> entries (A,B,C, #kvs{mod=?DBA}).
  18. join() -> join ([], #kvs{mod=?DBA}).
  19. join(Node) -> join (Node, #kvs{mod=?DBA}).
  20. count(Table) -> count (Table, #kvs{mod=?DBA}).
  21. add(Record) -> add (Record, #kvs{mod=?DBA}).
  22. all(Table) -> all (Table, #kvs{mod=?DBA}).
  23. put(Record) -> put (Record, #kvs{mod=?DBA}).
  24. link(Record) -> link (Record, #kvs{mod=?DBA}).
  25. unlink(Record) -> unlink (Record, #kvs{mod=?DBA}).
  26. fold(Fun,Acc,T,S,C,D) -> fold (Fun,Acc,T,S,C,D, #kvs{mod=?DBA}).
  27. info(T) -> info (T, #kvs{mod=?DBA}).
  28. start() -> start (#kvs{mod=?DBA}).
  29. stop() -> stop (#kvs{mod=?DBA}).
  30. destroy() -> destroy (#kvs{mod=?DBA}).
  31. version() -> version (#kvs{mod=?DBA}).
  32. dir() -> dir (#kvs{mod=?DBA}).
  33. seq(Table,DX) -> next_id(Table,DX).
  34. next_id(Table,DX) -> next_id(Table, DX, #kvs{mod=?DBA}).
  35. generation(Table,Key) ->
  36. case Key - topleft(Table,Key) < norm(application:get_env(kvs,generation,{?MODULE,limit}),Table,Key) of
  37. true -> skip;
  38. false -> kvs:rotate(Table) end.
  39. norm({A,B},Table,Key) -> A:B(Table,Key);
  40. norm(_,Table,Key) -> limit(Table,Key).
  41. limit(user,_Key) -> 25000;
  42. limit(comment,_Key) -> 25000;
  43. limit(_Table,_Key) -> 25000.
  44. forbid(user) -> 5;
  45. forbid(comment) -> 5;
  46. forbid(____) -> 5.
  47. % Implementation
  48. init(Backend, Module) ->
  49. [ begin
  50. Backend:create_table(T#table.name, [{attributes,T#table.fields},{T#table.copy_type, [node()]},{type,T#table.type}]),
  51. [ Backend:add_table_index(T#table.name, Key) || Key <- T#table.keys ],
  52. T
  53. end || T <- (Module:metainfo())#schema.tables ].
  54. start(#kvs{mod=DBA}) -> DBA:start().
  55. stop(#kvs{mod=DBA}) -> DBA:stop().
  56. change_storage(Type) -> [ change_storage(Name,Type) || #table{name=Name} <- kvs:tables() ].
  57. change_storage(Table,Type,#kvs{mod=DBA}) -> DBA:change_storage(Table,Type).
  58. destroy(#kvs{mod=DBA}) -> DBA:destroy().
  59. join(Node,#kvs{mod=DBA}) -> DBA:join(Node), rotate_new(), load_partitions(), load_config().
  60. version(#kvs{mod=DBA}) -> DBA:version().
  61. tables() -> lists:flatten([ (M:metainfo())#schema.tables || M <- modules() ]).
  62. table(Name) when is_atom(Name) -> lists:keyfind(rname(Name),#table.name,tables());
  63. table(_) -> false.
  64. dir(#kvs{mod=DBA}) -> DBA:dir().
  65. info(T,#kvs{mod=DBA}) -> DBA:info(T).
  66. modules() -> kvs:config(schema).
  67. containers() ->
  68. lists:flatten([ [ {T#table.name,T#table.fields}
  69. || T=#table{container=true} <- (M:metainfo())#schema.tables ]
  70. || M <- modules() ]).
  71. create(ContainerName) -> create(ContainerName, kvs:next_id(atom_to_list(ContainerName), 1), #kvs{mod=?DBA}).
  72. create(ContainerName, Id, Driver) ->
  73. kvs:info(?MODULE,"Create: ~p",[ContainerName]),
  74. Fields = proplists:get_value(ContainerName, kvs:containers()),
  75. Instance = list_to_tuple([ContainerName | lists:map(fun(_) -> [] end,Fields)]),
  76. Top = setelement(#container.id,Instance,Id),
  77. Top2 = setelement(#container.top,Top,[]),
  78. Top3 = setelement(#container.rear,Top2,[]),
  79. Top4 = setelement(#container.count,Top3,0),
  80. ok = kvs:put(Top4, Driver),
  81. Id.
  82. ensure_link(Record, #kvs{mod=_Store}=Driver) ->
  83. Id = element(2,Record),
  84. Type = rname(element(1,Record)),
  85. CName = element(#iterator.container,Record),
  86. Cid = case element(#iterator.feed_id,Record) of
  87. [] -> rname(element(1,Record));
  88. undefined -> rname(element(1,Record));
  89. Fid -> Fid end,
  90. Container = case kvs:get(CName, Cid, Driver) of
  91. {ok,Res} -> Res;
  92. {error, _} when Cid /= undefined andalso Cid /= [] ->
  93. Fields = proplists:get_value(CName, kvs:containers()),
  94. NC1 = list_to_tuple([CName | lists:map(fun(_) -> [] end,Fields)]),
  95. NC2 = setelement(#container.id, NC1, Cid),
  96. NC3 = setelement(#container.rear, NC2, Id),
  97. NC4 = setelement(#container.count, NC3, 0);
  98. _Error -> error end,
  99. case Container of
  100. error -> {error,no_container};
  101. _ when element(#container.top, Container) == Id -> {error,just_added};
  102. _ ->
  103. Top = case element(#container.top, Container) of
  104. undefined -> [];
  105. [] -> [];
  106. Tid -> case kvs:get(Type, Tid, Driver) of
  107. {error, _} -> [];
  108. {ok, T} -> setelement(#iterator.next, T, Id) end end,
  109. Prev = case Top of
  110. undefined -> [];
  111. [] -> [];
  112. E -> element(#iterator.id, E) end,
  113. Next = [],
  114. C2 = setelement(#container.top, Container, Id),
  115. C3 = setelement(#container.count, C2, element(#container.count, Container)+1),
  116. R = setelement(#iterator.feeds, Record,
  117. [ case F1 of
  118. {FN, Fd} -> {FN, Fd};
  119. _-> {F1, kvs:create(CName,{F1,element(#iterator.id,Record)},Driver)}
  120. end || F1 <- element(#iterator.feeds, Record)]),
  121. R1 = setelement(#iterator.next, R, Next),
  122. R2 = setelement(#iterator.prev, R1, Prev),
  123. R3 = setelement(#iterator.feed_id, R2, element(#container.id, Container)),
  124. case {kvs:put(R3, Driver),Top} of % Iterator
  125. {ok,[]} -> kvs:put(C3, Driver); % Container
  126. {ok,Top} -> kvs:put(C3, Driver),
  127. kvs:put(Top, Driver);
  128. __ -> kvs:error(?MODULE,"Error Updating Iterator: ~p~n",
  129. [element(#container.id,R3)]) end,
  130. kvs:info(?MODULE,"Put: ~p~n", [element(#container.id,R3)]),
  131. {ok, R3} end.
  132. link(Record,#kvs{mod=_Store}=Driver) ->
  133. Id = element(#iterator.id, Record),
  134. case kvs:get(rname(element(1,Record)), Id, Driver) of
  135. {ok, Exists} -> ensure_link(Exists, Driver);
  136. {error, not_found} -> {error, not_found} end.
  137. %add(Record, #kvs{mod=store_mnesia}=Driver) when is_tuple(Record) -> store_mnesia:add(Record);
  138. add(Record, #kvs{mod=Store}=Driver) when is_tuple(Record) -> append(Record,Driver).
  139. append(Record, #kvs{mod=_Store}=Driver) when is_tuple(Record) ->
  140. Id = element(#iterator.id, Record),
  141. Name = rname(element(1,Record)),
  142. generation(Name, Id),
  143. case kvs:get(Name, Id, Driver) of
  144. {error, _} -> ensure_link(Record, Driver);
  145. {aborted, Reason} -> {aborted, Reason};
  146. {ok, _} -> {error, exist} end.
  147. reverse(#iterator.prev) -> #iterator.next;
  148. reverse(#iterator.next) -> #iterator.prev.
  149. relink(C, E, D) ->
  150. kvs:warning(?MODULE,"Deprecated! Will be removed in the future, use unlink/3 instead",[]),
  151. unlink(C, E, D).
  152. unlink(E,Driver) ->
  153. case kvs:get(element(#iterator.container,E),element(#iterator.feed_id,E)) of
  154. {ok,C} ->
  155. unlink(C, E, Driver),
  156. E2=setelement(#iterator.next, E, []),
  157. E3=setelement(#iterator.prev, E2, []),
  158. kvs:put(E3,Driver),
  159. {ok,E};
  160. _ -> {error,no_container} end.
  161. unlink(Container, E, Driver) ->
  162. Id = element(#iterator.id, E),
  163. Next = element(#iterator.next, E),
  164. Prev = element(#iterator.prev, E),
  165. case kvs:get(element(1,E), Prev, Driver) of
  166. {ok, PE} -> kvs:put(setelement(#iterator.next, PE, Next), Driver);
  167. _ -> ok end,
  168. case kvs:get(element(1,E), Next, Driver) of
  169. {ok, NE} -> kvs:put(setelement(#iterator.prev, NE, Prev), Driver);
  170. _ -> ok end,
  171. C2 = case element(#container.top, Container) of
  172. Id -> setelement(#container.top, Container, Prev);
  173. _ -> Container end,
  174. C3 = case element(#container.rear, C2) of
  175. Id -> setelement(#container.rear, C2, Next);
  176. _ -> C2 end,
  177. case element(#container.top,C3) of
  178. undefined -> kvs:delete(element(1,C3),element(#container.id,C3));
  179. [] -> kvs:delete(element(1,C3),element(#container.id,C3));
  180. _ -> kvs:put(setelement(#container.count,C3,element(#container.count,C3)-1), Driver) end.
  181. delete(Tab, Key, #kvs{mod=Mod}) ->
  182. case range(Tab,Key) of
  183. [] -> Mod:delete(Tab, Key);
  184. T -> Mod:delete(T, Key) end.
  185. remove(Record, Id,#kvs{mod=store_mnesia}=Driver) -> store_mnesia:remove(Record,Id);
  186. remove(Record, Id,#kvs{mod=Store}=Driver) -> takeoff(Record,Id,Driver).
  187. takeoff(Record,Id,#kvs{mod=Mod}=Driver) ->
  188. case get(Record,Id) of
  189. {error, not_found} -> kvs:error(?MODULE,"Can't remove ~p~n",[{Record,Id}]);
  190. {ok,R} -> do_remove(R,Driver) end.
  191. do_remove(E,#kvs{mod=Mod}=Driver) ->
  192. case get(element(#iterator.container,E),element(#iterator.feed_id,E)) of
  193. {ok, C} -> unlink(C,E,Driver);
  194. _ -> skip end,
  195. kvs:info(?MODULE,"Delete: ~p", [E]),
  196. kvs:delete(element(1,E),element(2,E), Driver).
  197. fold(___,Acc,_,[],_,_,_) -> Acc;
  198. fold(___,Acc,_,undefined,_,_,_) -> Acc;
  199. fold(___,Acc,_,_,0,_,_) -> Acc;
  200. fold(Fun,Acc,Table,Start,Count,Direction,Driver) ->
  201. %io:format("fold: ~p~n",[{Table, Start, Driver}]),
  202. try
  203. case kvs:get(rname(Table), Start, Driver) of
  204. {ok, R} -> Prev = element(Direction, R),
  205. Count1 = case Count of C when is_integer(C) -> C - 1; _-> Count end,
  206. fold(Fun, Fun(R,Acc), Table, Prev, Count1, Direction, Driver);
  207. Error -> %kvs:error(?MODULE,"Error: ~p~n",[Error]),
  208. Acc end catch _:_ -> Acc end.
  209. entries({error,_},_,_,_) -> [];
  210. entries({ok,T},N,C,Driver) ->
  211. lists:reverse(fold(fun(A,Acc) -> [A|Acc] end,[],N,element(#container.top,T),C,#iterator.prev,Driver)).
  212. add_seq_ids() ->
  213. Init = fun(Key) ->
  214. case kvs:get(id_seq, Key) of
  215. {error, _} -> {Key,kvs:put(#id_seq{thing = Key, id = 0})};
  216. {ok, _} -> {Key,skip} end end,
  217. [ Init(atom_to_list(Name)) || {Name,_Fields} <- containers() ].
  218. put(Records,#kvs{mod=Mod}) when is_list(Records) -> Mod:put(Records);
  219. put(Record,#kvs{mod=Mod}) ->
  220. case range(element(1,Record),element(2,Record)) of
  221. [] -> Mod:put(Record);
  222. Name -> Mod:put(setelement(1,Record,Name)) end.
  223. get(RecordName, Key, #kvs{mod=Mod}) ->
  224. case range(RecordName,Key) of
  225. [] -> Mod:get(RecordName, Key);
  226. Name -> case Mod:get(Name, Key) of
  227. {ok,Record} -> {ok,setelement(1,Record,kvs:last(RecordName,Key))};
  228. Else -> Else end end.
  229. count(Tab,#kvs{mod=DBA}) -> lists:foldl(fun(T,A) -> DBA:count(T) + A end, 0, rlist(Tab)).
  230. all(Tab,#kvs{mod=DBA}) ->
  231. lists:flatten([ rnorm(rname(Tab),DBA:all(T)) || T <- rlist(Tab) ]).
  232. index(Tab, Key, Value,#kvs{mod=DBA}) ->
  233. lists:flatten([ rnorm(rname(Tab),DBA:index(T, Key, Value)) || T <- rlist(Tab) ]).
  234. next_id(Tab, Incr,#kvs{mod=DBA}) ->
  235. DBA:next_id(case table(Tab) of #table{} -> atom_to_list(Tab); _ -> Tab end, Incr).
  236. save_db(Path) ->
  237. Data = lists:append([all(B) || B <- [list_to_atom(Name) || {table,Name} <- kvs:dir()] ]),
  238. kvs:save(Path, Data).
  239. load_db(Path) ->
  240. add_seq_ids(),
  241. AllEntries = kvs:load(Path),
  242. [kvs:put(E) || E <- lists:filter(fun(E) -> is_tuple(E) end ,AllEntries)].
  243. save(Dir, Value) ->
  244. filelib:ensure_dir(Dir),
  245. file:write_file(Dir, term_to_binary(Value)).
  246. load(Key) ->
  247. {ok, Bin} = file:read_file(Key),
  248. binary_to_term(Bin).
  249. notify(_EventPath, _Data) -> skip.
  250. config(Key) -> config(kvs, Key, "").
  251. config(App,Key) -> config(App,Key, "").
  252. config(App, Key, Default) -> case application:get_env(App,Key) of
  253. undefined -> Default;
  254. {ok,V} -> V end.
  255. log_modules() -> [].
  256. -define(ALLOWED, (config(kvs,log_modules,kvs))).
  257. log(Module, String, Args, Fun) ->
  258. case lists:member(Module,?ALLOWED:log_modules()) of
  259. true -> error_logger:Fun("~p:"++String, [Module|Args]);
  260. false -> skip end.
  261. info(Module, String, Args) -> log(Module, String, Args, info_msg).
  262. warning(Module,String, Args) -> log(Module, String, Args, warning_msg).
  263. error(Module, String, Args) -> log(Module, String, Args, error_msg).
  264. dump() -> dump([ rlist(N) || #table{name=N} <- kvs:tables() ]).
  265. dump(short) ->
  266. Gen = fun(T) ->
  267. {S,M,C}=lists:unzip3([ dump_info(R) || R <- rlist(T) ]),
  268. {lists:usort(S),lists:sum(M),lists:sum(C)}
  269. end,
  270. dump_format([ {T,Gen(T)} || T <- [ N || #table{name=N} <- kvs:tables() ] ]);
  271. dump(Table) when is_atom(Table) -> dump(rlist(Table));
  272. dump(Tables) ->
  273. dump_format([{case nname(T) of 1 -> rname(T); _ -> T end,dump_info(T)} || T <- lists:flatten(Tables) ]).
  274. dump_info(T) ->
  275. {mnesia:table_info(T,storage_type),
  276. mnesia:table_info(T,memory) * erlang:system_info(wordsize) / 1024 / 1024,
  277. mnesia:table_info(T,size)}.
  278. dump_format(List) ->
  279. io:format("~20s ~32s ~14s ~10s~n~n",["NAME","STORAGE TYPE","MEMORY (MB)","ELEMENTS"]),
  280. [ io:format("~20s ~32w ~14.2f ~10b~n",[T,S,M,C]) || {T,{S,M,C}} <- List ],
  281. io:format("~nSnapshot taken: ~p~n",[calendar:now_to_datetime(os:timestamp())]).
  282. % Table Partitions
  283. range(RecordName,Id) -> (find(kvs:config(kvs:rname(RecordName)),RecordName,Id))#block.name.
  284. topleft(RecordName,Id) -> (find(kvs:config(kvs:rname(RecordName)),RecordName,Id))#block.left.
  285. last(RecordName,Id) -> (find(kvs:config(kvs:rname(RecordName)),RecordName,Id))#block.last.
  286. find([],_,_Id) -> #block{left=1,right=infinity,name=[],last=[]};
  287. find([Range|T],RecordName,Id) ->
  288. case lookup(Range,Id) of
  289. [] -> find(T,RecordName,Id);
  290. Range -> Range end.
  291. lookup(#block{left=Left,right=Right,name=Name}=I,Id) when Id =< Right, Id >= Left -> I;
  292. lookup(#block{},_) -> [].
  293. rotate_new() ->
  294. N = [ kvs:rotate(kvs:table(T)) || {T,_} <- fold_tables(),
  295. length(proplists:get_value(attributes,info(last_disc(T)),[])) /= length((table(rname(T)))#table.fields) ],
  296. io:format("Nonexistent: ~p~n",[N]), N.
  297. rotate(#table{name=N}) ->
  298. R = name(rname(N)),
  299. init(setelement(#table.name,kvs:table(kvs:last_table(N)),R)),
  300. update_config(rname(N),R);
  301. rotate(Table) ->
  302. Ranges = kvs:config(Table),
  303. {M,F} = application:get_env(kvs,forbidding,{?MODULE,forbid}),
  304. New = lists:sublist(Ranges,M:F(Table)),
  305. Delete = Ranges -- New,
  306. io:format("Delete: ~p~n",[Delete]),
  307. % [ mnesia:change_table_copy_type(Name, node(), disc_only_copies) || #block{name=Name} <- shd(Delete) ],
  308. [ mnesia:delete_table(Name) || #block{name=Name} <- Delete ],
  309. rotate(kvs:table(Table)), ok.
  310. load_partitions() ->
  311. [ case kvs:get(config,Table) of
  312. {ok,{config,_,List}} -> application:set_env(kvs,Table,List);
  313. Else -> ok end || {table,Table} <- kvs:dir() ].
  314. rnorm(Tag,List) -> [ setelement(1,R,Tag) || R <- List ].
  315. rlist(Table) -> [ N || #block{name=N} <- kvs:config(Table) ]++[Table].
  316. shd([]) -> [];
  317. shd(X) -> [hd(X)].
  318. wait() -> timer:tc(fun() -> mnesia:wait_for_tables([ T#table.name || T <- kvs:tables()],infinity) end).
  319. stl([]) -> [];
  320. stl(S) -> tl(S).
  321. dat(T) -> [ mnesia:change_table_copy_type(Name, node(), disc_only_copies) || #block{name=Name} <- stl((element(2,kvs:get(config,T)))#config.value) ].
  322. omitone(1) -> [];
  323. omitone(X) -> X.
  324. limit() -> infinity.
  325. load_config() -> [ application:set_env(kvs,Key,Value) || #config{key=Key,value=Value}<- kvs:all(config) ].
  326. store(Table,X) -> application:set_env(kvs,Table,X), X.
  327. rname(Table) -> list_to_atom(lists:filter(fun(X) -> not lists:member(X,"1234567890") end, atom_to_list(Table))).
  328. nname(Table) -> list_to_integer(case lists:filter(fun(X) -> lists:member(X,"1234567890") end, atom_to_list(Table)) of [] -> "1"; E -> E end).
  329. fold(N) -> kvs:fold(fun(X,A)->[X|A]end,[],process,N,-1,#iterator.next,#kvs{mod=store_mnesia}).
  330. top(acl) -> id_seq(conv);
  331. top(i) -> id_seq(conv);
  332. top(Table) -> id_seq(Table).
  333. name(T) -> list_to_atom(lists:concat([T,omitone(kvs:next_id(lists:concat([T,".tables"]),1))])).
  334. init(T) -> store_mnesia:create_table(T#table.name, [{attributes,T#table.fields},{T#table.copy_type, [node()]}]),
  335. [ store_mnesia:add_table_index(T#table.name, Key) || Key <- T#table.keys ].
  336. id_seq(Tab) -> T = atom_to_list(Tab), case kvs:get(id_seq,T) of {ok,#id_seq{id=Id}} -> Id; _ -> kvs:next_id(T,1) end.
  337. last_disc(T) -> list_to_atom(lists:concat([T,omitone(kvs:id_seq(list_to_atom(lists:concat([T,".tables"]))))])).
  338. last_table(T) -> list_to_atom(lists:concat([T,omitone(lists:max(proplists:get_value(T,fold_tables(),[1])))])).
  339. fold_tables() -> lists:foldl(fun(#table{name=X},Acc) ->
  340. setkey(kvs:rname(X),1,Acc,{kvs:rname(X),[kvs:nname(X)|proplists:get_value(kvs:rname(X),Acc,[])]}) end,
  341. [], kvs:tables()).
  342. range(L,R,Name) -> #block{left=L,right=R,name=Name,last=last_table(rname(Name))}.
  343. update_config(Table,Name) ->
  344. Store = store(Table,case kvs:get(config,Table) of
  345. {error,not_found} -> update_list(Table,[],Name);
  346. {ok,#config{value=List}} -> update_list(Table,List,Name) end),
  347. % {M,F} = application:get_env(kvs,forbidding,{?MODULE,forbid}),
  348. New = Store, %lists:sublist(Store,M:F(Table)),
  349. kvs:put(#config{key = Table, value = New }).
  350. update_list(Table,[],Name) -> [ range(top(Table)+1,limit(),Name) ];
  351. update_list(Table,[#block{}=CI|Tail],Name) -> [ range(top(Table)+1,limit(),Name) ] ++
  352. [ CI#block{right=top(Table)} ] ++ Tail.
  353. setkey(Name,Pos,List,New) ->
  354. case lists:keyfind(Name,Pos,List) of
  355. false -> [New|List];
  356. _Element -> lists:keyreplace(Name,Pos,List,New) end.
  357. test() -> test(#user{}).
  358. test(Proto) ->
  359. kvs:join(),
  360. Table = element(1,Proto),
  361. [ kvs:add(setelement(2,Proto,kvs:next_id(Table,1))) || _ <- lists:seq(1,20000) ],
  362. io:format("Config: ~p~n",[kvs:all(config)]),
  363. io:format("Fetch: ~p~n",[kvs:entries(kvs:get(feed,Table),Table,10)]).