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
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
|
-module(fabric_db_create).
-export([go/2]).
-include("fabric.hrl").
-include_lib("mem3/include/mem3.hrl").
-include_lib("couch/include/couch_db.hrl").
-define(DBNAME_REGEX, "^[a-z][a-z0-9\\_\\$()\\+\\-\\/\\s.]*$").
%% @doc Create a new database, and all its partition files across the cluster
%% Options is proplist with user_ctx, n, q
go(DbName, Options) ->
case re:run(DbName, ?DBNAME_REGEX, [{capture,none}]) of
match ->
Shards = mem3:choose_shards(DbName, Options),
Doc = make_document(Shards),
Workers = fabric_util:submit_jobs(Shards, create_db, [Options, Doc]),
Acc0 = fabric_dict:init(Workers, nil),
case fabric_util:recv(Workers, #shard.ref, fun handle_message/3, Acc0) of
{ok, _} ->
ok;
Else ->
Else
end;
nomatch ->
{error, illegal_database_name}
end.
handle_message(Msg, Shard, Counters) ->
C1 = fabric_dict:store(Shard, Msg, Counters),
case fabric_dict:any(nil, C1) of
true ->
{ok, C1};
false ->
final_answer(C1)
end.
make_document([#shard{dbname=DbName}|_] = Shards) ->
{RawOut, ByNodeOut, ByRangeOut} =
lists:foldl(fun(#shard{node=N, range=[B,E]}, {Raw, ByNode, ByRange}) ->
Range = ?l2b([couch_util:to_hex(<<B:32/integer>>), "-",
couch_util:to_hex(<<E:32/integer>>)]),
Node = couch_util:to_binary(N),
{[[<<"add">>, Range, Node] | Raw], orddict:append(Node, Range, ByNode),
orddict:append(Range, Node, ByRange)}
end, {[], [], []}, Shards),
#doc{id=DbName, body = {[
{<<"changelog">>, lists:sort(RawOut)},
{<<"by_node">>, {[{K,lists:sort(V)} || {K,V} <- ByNodeOut]}},
{<<"by_range">>, {[{K,lists:sort(V)} || {K,V} <- ByRangeOut]}}
]}}.
final_answer(Counters) ->
Successes = [X || {_, M} = X <- Counters, M == ok orelse M == file_exists],
case fabric_view:is_progress_possible(Successes) of
true ->
case lists:keymember(file_exists, 2, Successes) of
true ->
{error, file_exists};
false ->
{stop, ok}
end;
false ->
{error, internal_server_error}
end.
|
