diff options
author | Christophe Romain <christophe.romain@process-one.net> | 2015-04-08 18:12:05 +0300 |
---|---|---|
committer | Christophe Romain <christophe.romain@process-one.net> | 2015-04-21 16:24:16 +0300 |
commit | e0563e3918984d151fbea45a5f6fc8255913726d (patch) | |
tree | e62bcc5cc538a722f81c3f53291e02594e576711 /src/nodetree_dag.erl | |
parent | 63926efd204c093b3125f789d5114e85ae4ff988 (diff) |
PubSub improvements
This commit contains
- code cleanup
- use of db_type instead of old mod_pubsub_odbc
- some minor optimizations
- some minor bugfixes
Diffstat (limited to 'src/nodetree_dag.erl')
-rw-r--r-- | src/nodetree_dag.erl | 368 |
1 files changed, 141 insertions, 227 deletions
diff --git a/src/nodetree_dag.erl b/src/nodetree_dag.erl index e8ad8b141..b2d4fade0 100644 --- a/src/nodetree_dag.erl +++ b/src/nodetree_dag.erl @@ -4,11 +4,13 @@ %%% compliance with the License. You should have received a copy of the %%% Erlang Public License along with this software. If not, it can be %%% retrieved via the world wide web at http://www.erlang.org/. +%%% %%% %%% Software distributed under the License is distributed on an "AS IS" %%% basis, WITHOUT WARRANTY OF ANY KIND, either express or implied. See %%% the License for the specific language governing rights and limitations %%% under the License. +%%% %%% %%% @author Brian Cully <bjc@kublai.com> %%% @version {@vsn}, {@date} {@time} @@ -16,219 +18,141 @@ %%% ==================================================================== -module(nodetree_dag). - +-behaviour(gen_pubsub_nodetree). -author('bjc@kublai.com'). -%% API --export([init/3, terminate/2, options/0, set_node/1, - get_node/3, get_node/2, get_node/1, get_nodes/2, - get_nodes/1, get_parentnodes/3, get_parentnodes_tree/3, - get_subnodes/3, get_subnodes_tree/3, create_node/6, - delete_node/2]). - -include_lib("stdlib/include/qlc.hrl"). --include("ejabberd.hrl"). --include("logger.hrl"). - -include("pubsub.hrl"). - -include("jlib.hrl"). --behaviour(gen_pubsub_nodetree). +-export([init/3, terminate/2, options/0, set_node/1, + get_node/3, get_node/2, get_node/1, get_nodes/2, + get_nodes/1, get_parentnodes/3, get_parentnodes_tree/3, + get_subnodes/3, get_subnodes_tree/3, create_node/6, + delete_node/2]). --define(DEFAULT_NODETYPE, leaf). +-define(DEFAULT_NODETYPE, leaf). -define(DEFAULT_PARENTS, []). - -define(DEFAULT_CHILDREN, []). --compile(export_all). - -%%==================================================================== -%% API -%%==================================================================== init(Host, ServerHost, Opts) -> nodetree_tree:init(Host, ServerHost, Opts). terminate(Host, ServerHost) -> nodetree_tree:terminate(Host, ServerHost). --spec(create_node/6 :: -( - Key :: mod_pubsub:hostPubsub(), - NodeID :: mod_pubsub:nodeId(), - Type :: binary(), - Owner :: jid(), - Options :: mod_pubsub:nodeOptions(), - Parents :: [mod_pubsub:nodeId()]) - -> {ok, NodeIdx::mod_pubsub:nodeIdx()} - | {error, xmlel()} -). -create_node(Key, NodeID, Type, Owner, Options, Parents) -> - OwnerJID = jlib:jid_tolower(jlib:jid_remove_resource(Owner)), - case find_node(Key, NodeID) of - false -> - NodeIdx = pubsub_index:new(node), - N = #pubsub_node{nodeid = oid(Key, NodeID), id = NodeIdx, - type = Type, parents = Parents, owners = [OwnerJID], - options = Options}, - case set_node(N) of - ok -> {ok, NodeIdx}; - Other -> Other - end; - _ -> {error, ?ERR_CONFLICT} - end. - --spec(set_node/1 :: -( - PubsubNode::mod_pubsub:pubsubNode()) - -> ok - %%% - | {error, xmlel()} -). -set_node(#pubsub_node{nodeid = {Key, _}, owners = Owners, options = Options} = - Node) -> +set_node(#pubsub_node{nodeid = {Key, _}, owners = Owners, options = Options} = Node) -> Parents = find_opt(collection, ?DEFAULT_PARENTS, Options), case validate_parentage(Key, Owners, Parents) of - true -> - mnesia:write(Node#pubsub_node{parents = Parents}); - Other -> Other + true -> mnesia:write(Node#pubsub_node{parents = Parents}); + Other -> Other end. --spec(delete_node/2 :: -( - Key :: mod_pubsub:hostPubsub(), - NodeID :: mod_pubsub:nodeId()) - -> [mod_pubsub:pubsubNode(),...] - %%% - | {error, xmlel()} -). -delete_node(Key, NodeID) -> - case find_node(Key, NodeID) of - false -> {error, ?ERR_ITEM_NOT_FOUND}; - Node -> - lists:foreach(fun (#pubsub_node{options = Opts} = - Child) -> - NewOpts = remove_config_parent(NodeID, Opts), - Parents = find_opt(collection, ?DEFAULT_PARENTS, - NewOpts), - ok = mnesia:write(pubsub_node, - Child#pubsub_node{parents = - Parents, - options = - NewOpts}, - write) - end, - get_subnodes(Key, NodeID)), - pubsub_index:free(node, Node#pubsub_node.id), - mnesia:delete_object(pubsub_node, Node, write), - [Node] +create_node(Key, Node, Type, Owner, Options, Parents) -> + OwnerJID = jlib:jid_tolower(jlib:jid_remove_resource(Owner)), + case find_node(Key, Node) of + false -> + Nidx = pubsub_index:new(node), + N = #pubsub_node{nodeid = oid(Key, Node), id = Nidx, + type = Type, parents = Parents, owners = [OwnerJID], + options = Options}, + case set_node(N) of + ok -> {ok, Nidx}; + Other -> Other + end; + _ -> + {error, ?ERR_CONFLICT} end. -options() -> nodetree_tree:options(). +delete_node(Key, Node) -> + case find_node(Key, Node) of + false -> + {error, ?ERR_ITEM_NOT_FOUND}; + Record -> + lists:foreach(fun (#pubsub_node{options = Opts} = Child) -> + NewOpts = remove_config_parent(Node, Opts), + Parents = find_opt(collection, ?DEFAULT_PARENTS, NewOpts), + ok = mnesia:write(pubsub_node, + Child#pubsub_node{parents = Parents, + options = NewOpts}, + write) + end, + get_subnodes(Key, Node)), + pubsub_index:free(node, Record#pubsub_node.id), + mnesia:delete_object(pubsub_node, Record, write), + [Record] + end. -get_node(Host, NodeID, _From) -> get_node(Host, NodeID). +options() -> + nodetree_tree:options(). --spec(get_node/2 :: -( - Host :: mod_pubsub:hostPubsub(), - NodeID :: mod_pubsub:nodeId()) - -> mod_pubsub:pubsubNode() - %%% - | {error, xmlel} -). -get_node(Host, NodeID) -> - case find_node(Host, NodeID) of - false -> {error, ?ERR_ITEM_NOT_FOUND}; - Node -> Node +get_node(Host, Node, _From) -> + get_node(Host, Node). + +get_node(Host, Node) -> + case find_node(Host, Node) of + false -> {error, ?ERR_ITEM_NOT_FOUND}; + Record -> Record end. --spec(get_node/1 :: -( - NodeIdx::mod_pubsub:nodeIdx()) - -> mod_pubsub:pubsubNode() - | {error, xmlel()} -). -get_node(NodeId) -> nodetree_tree:get_node(NodeId). +get_node(Node) -> + nodetree_tree:get_node(Node). get_nodes(Key, From) -> nodetree_tree:get_nodes(Key, From). --spec(get_nodes/1 :: -( - Host::mod_pubsub:host()) - -> [mod_pubsub:pubsubNode()] -). -get_nodes(Key) -> nodetree_tree:get_nodes(Key). +get_nodes(Key) -> + nodetree_tree:get_nodes(Key). --spec(get_parentnodes/3 :: -( - Host :: mod_pubsub:hostPubsub(), - NodeID :: mod_pubsub:nodeId(), - _From :: _) - -> [mod_pubsub:pubsubNode()] - %%% - | {error, xmlel()} -). -get_parentnodes(Host, NodeID, _From) -> - case find_node(Host, NodeID) of - false -> {error, ?ERR_ITEM_NOT_FOUND}; - #pubsub_node{parents = Parents} -> - Q = qlc:q([N - || #pubsub_node{nodeid = {NHost, NNode}} = N +get_parentnodes(Host, Node, _From) -> + case find_node(Host, Node) of + false -> + {error, ?ERR_ITEM_NOT_FOUND}; + #pubsub_node{parents = Parents} -> + Q = qlc:q([N + || #pubsub_node{nodeid = {NHost, NNode}} = N <- mnesia:table(pubsub_node), - Parent <- Parents, Host == NHost, Parent == NNode]), - qlc:e(Q) + Parent <- Parents, Host == NHost, Parent == NNode]), + qlc:e(Q) end. -get_parentnodes_tree(Host, NodeID, _From) -> - Pred = fun (NID, #pubsub_node{nodeid = {_, NNodeID}}) -> - NID == NNodeID - end, +get_parentnodes_tree(Host, Node, _From) -> + Pred = fun (NID, #pubsub_node{nodeid = {_, NNode}}) -> + NID == NNode + end, Tr = fun (#pubsub_node{parents = Parents}) -> Parents - end, - traversal_helper(Pred, Tr, Host, [NodeID]). + end, + traversal_helper(Pred, Tr, Host, [Node]). -get_subnodes(Host, NodeID, _From) -> - get_subnodes(Host, NodeID). +get_subnodes(Host, Node, _From) -> + get_subnodes(Host, Node). --spec(get_subnodes/2 :: -( - Host :: mod_pubsub:hostPubsub(), - NodeId :: mod_pubsub:nodeId()) - -> [mod_pubsub:pubsubNode()] -). get_subnodes(Host, <<>>) -> get_subnodes_helper(Host, <<>>); -get_subnodes(Host, NodeID) -> - case find_node(Host, NodeID) of - false -> {error, ?ERR_ITEM_NOT_FOUND}; - _ -> get_subnodes_helper(Host, NodeID) +get_subnodes(Host, Node) -> + case find_node(Host, Node) of + false -> {error, ?ERR_ITEM_NOT_FOUND}; + _ -> get_subnodes_helper(Host, Node) end. --spec(get_subnodes_helper/2 :: -( - Host :: mod_pubsub:hostPubsub(), - NodeID :: mod_pubsub:nodeId()) - -> [mod_pubsub:pubsubNode()] -). -get_subnodes_helper(Host, NodeID) -> - Q = qlc:q([Node - || #pubsub_node{nodeid = {NHost, _}, - parents = Parents} = - Node - <- mnesia:table(pubsub_node), - Host == NHost, lists:member(NodeID, Parents)]), +get_subnodes_helper(Host, Node) -> + Q = qlc:q([N + || #pubsub_node{nodeid = {NHost, _}, + parents = Parents} = + N + <- mnesia:table(pubsub_node), + Host == NHost, lists:member(Node, Parents)]), qlc:e(Q). -get_subnodes_tree(Host, NodeID, From) -> +get_subnodes_tree(Host, Node, From) -> Pred = fun (NID, #pubsub_node{parents = Parents}) -> - lists:member(NID, Parents) - end, + lists:member(NID, Parents) + end, Tr = fun (#pubsub_node{nodeid = {_, N}}) -> [N] end, - traversal_helper(Pred, Tr, 1, Host, [NodeID], - [{0, [get_node(Host, NodeID, From)]}]). + traversal_helper(Pred, Tr, 1, Host, [Node], + [{0, [get_node(Host, Node, From)]}]). %%==================================================================== %% Internal functions @@ -236,17 +160,17 @@ get_subnodes_tree(Host, NodeID, From) -> oid(Key, Name) -> {Key, Name}. %% Key = jlib:jid() | host() -%% NodeID = string() +%% Node = string() -spec(find_node/2 :: -( - Key :: mod_pubsub:hostPubsub(), - NodeID :: mod_pubsub:nodeId()) + ( + Key :: mod_pubsub:hostPubsub(), + Node :: mod_pubsub:nodeId()) -> mod_pubsub:pubsubNode() | false -). -find_node(Key, NodeID) -> - case mnesia:read(pubsub_node, oid(Key, NodeID), read) of - [] -> false; - [Node] -> Node + ). +find_node(Key, Node) -> + case mnesia:read(pubsub_node, oid(Key, Node), read) of + [] -> false; + [Node] -> Node end. %% Key = jlib:jid() | host() @@ -254,77 +178,67 @@ find_node(Key, NodeID) -> %% Options = [{Key = atom(), Value = term()}] find_opt(Key, Default, Options) -> case lists:keysearch(Key, 1, Options) of - {value, {Key, Val}} -> Val; - _ -> Default + {value, {Key, Val}} -> Val; + _ -> Default end. -spec(traversal_helper/4 :: -( - Pred :: fun(), - Tr :: fun(), - Host :: mod_pubsub:hostPubsub(), - NodeId :: [mod_pubsub:pubsubNode(),...]) - -> [{Depth::non_neg_integer(), Nodes::[mod_pubsub:pubsubNode(),...]}] -). - -traversal_helper(Pred, Tr, Host, NodeIDs) -> - traversal_helper(Pred, Tr, 0, Host, NodeIDs, []). + ( + Pred :: fun(), + Tr :: fun(), + Host :: mod_pubsub:hostPubsub(), + Nodes :: [mod_pubsub:nodeId(),...]) + -> [{Depth::non_neg_integer(), Nodes::[mod_pubsub:pubsubNode(),...]}] + ). +traversal_helper(Pred, Tr, Host, Nodes) -> + traversal_helper(Pred, Tr, 0, Host, Nodes, []). traversal_helper(_Pred, _Tr, _Depth, _Host, [], Acc) -> Acc; -traversal_helper(Pred, Tr, Depth, Host, NodeIDs, Acc) -> - Q = qlc:q([Node - || #pubsub_node{nodeid = {NHost, _}} = Node - <- mnesia:table(pubsub_node), - NodeID <- NodeIDs, Host == NHost, Pred(NodeID, Node)]), +traversal_helper(Pred, Tr, Depth, Host, Nodes, Acc) -> + Q = qlc:q([N + || #pubsub_node{nodeid = {NHost, _}} = N + <- mnesia:table(pubsub_node), + Node <- Nodes, Host == NHost, Pred(Node, N)]), Nodes = qlc:e(Q), IDs = lists:flatmap(Tr, Nodes), - traversal_helper(Pred, Tr, Depth + 1, Host, IDs, - [{Depth, Nodes} | Acc]). + traversal_helper(Pred, Tr, Depth + 1, Host, IDs, [{Depth, Nodes} | Acc]). -remove_config_parent(NodeID, Options) -> - remove_config_parent(NodeID, Options, []). +remove_config_parent(Node, Options) -> + remove_config_parent(Node, Options, []). -remove_config_parent(_NodeID, [], Acc) -> +remove_config_parent(_Node, [], Acc) -> lists:reverse(Acc); -remove_config_parent(NodeID, [{collection, Parents} | T], Acc) -> - remove_config_parent(NodeID, T, - [{collection, lists:delete(NodeID, Parents)} | Acc]); -remove_config_parent(NodeID, [H | T], Acc) -> - remove_config_parent(NodeID, T, [H | Acc]). +remove_config_parent(Node, [{collection, Parents} | T], Acc) -> + remove_config_parent(Node, T, [{collection, lists:delete(Node, Parents)} | Acc]); +remove_config_parent(Node, [H | T], Acc) -> + remove_config_parent(Node, T, [H | Acc]). -spec(validate_parentage/3 :: -( - Key :: mod_pubsub:hostPubsub(), - Owners :: [ljid(),...], - Parent_NodeIds :: [mod_pubsub:nodeId()]) + ( + Key :: mod_pubsub:hostPubsub(), + Owners :: [ljid(),...], + Parent_Nodes :: [mod_pubsub:nodeId()]) -> true %%% - | {error, xmlel()} -). -validate_parentage(_Key, _Owners, []) -> true; + | {error, xmlel()} + ). +validate_parentage(_Key, _Owners, []) -> + true; validate_parentage(Key, Owners, [[] | T]) -> validate_parentage(Key, Owners, T); validate_parentage(Key, Owners, [<<>> | T]) -> validate_parentage(Key, Owners, T); validate_parentage(Key, Owners, [ParentID | T]) -> case find_node(Key, ParentID) of - false -> {error, ?ERR_ITEM_NOT_FOUND}; - #pubsub_node{owners = POwners, options = POptions} -> - NodeType = find_opt(node_type, ?DEFAULT_NODETYPE, POptions), - MutualOwners = [O || O <- Owners, PO <- POwners, O == PO], - case {MutualOwners, NodeType} of - {[], _} -> {error, ?ERR_FORBIDDEN}; - {_, collection} -> validate_parentage(Key, Owners, T); - {_, _} -> {error, ?ERR_NOT_ALLOWED} - end - end. - -%% @spec (Host) -> jid() -%% Host = host() -%% @doc <p>Generate pubsub service JID.</p> -service_jid(Host) -> - case Host of - {U, S, _} -> jlib:make_jid(U, S, <<>>); - _ -> jlib:make_jid(<<>>, Host, <<>>) + false -> + {error, ?ERR_ITEM_NOT_FOUND}; + #pubsub_node{owners = POwners, options = POptions} -> + NodeType = find_opt(node_type, ?DEFAULT_NODETYPE, POptions), + MutualOwners = [O || O <- Owners, PO <- POwners, O == PO], + case {MutualOwners, NodeType} of + {[], _} -> {error, ?ERR_FORBIDDEN}; + {_, collection} -> validate_parentage(Key, Owners, T); + {_, _} -> {error, ?ERR_NOT_ALLOWED} + end end. |