| % 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. |
| |
| -module(couch_mrview_updater). |
| |
| -export([start_update/3, purge/4, process_doc/3, finish_update/1]). |
| |
| -include_lib("couch/include/couch_db.hrl"). |
| -include_lib("couch_mrview/include/couch_mrview.hrl"). |
| |
| |
| start_update(Partial, State, NumChanges) -> |
| QueueOpts = [{max_size, 100000}, {max_items, 500}], |
| {ok, DocQueue} = couch_work_queue:new(QueueOpts), |
| {ok, WriteQueue} = couch_work_queue:new(QueueOpts), |
| |
| InitState = State#mrst{ |
| first_build=State#mrst.update_seq==0, |
| partial_resp_pid=Partial, |
| doc_acc=[], |
| doc_queue=DocQueue, |
| write_queue=WriteQueue |
| }, |
| |
| Self = self(), |
| MapFun = fun() -> |
| couch_task_status:add_task([ |
| {type, indexer}, |
| {database, State#mrst.db_name}, |
| {design_document, State#mrst.idx_name}, |
| {progress, 0}, |
| {changes_done, 0}, |
| {total_changes, NumChanges} |
| ]), |
| couch_task_status:set_update_frequency(500), |
| map_docs(Self, InitState) |
| end, |
| WriteFun = fun() -> write_results(Self, InitState) end, |
| |
| spawn_link(MapFun), |
| spawn_link(WriteFun), |
| |
| {ok, InitState}. |
| |
| |
| purge(_Db, PurgeSeq, PurgedIdRevs, State) -> |
| #mrst{ |
| id_btree=IdBtree, |
| log_btree=LogBtree, |
| views=Views |
| } = State, |
| |
| Ids = [Id || {Id, _Revs} <- PurgedIdRevs], |
| {ok, Lookups, LLookups, LogBtree2, IdBtree2} = case LogBtree of |
| nil -> |
| {ok, L, Bt} = couch_btree:query_modify(IdBtree, Ids, [], Ids), |
| {ok, L, [], nil, Bt}; |
| _ -> |
| {ok, L, Bt} = couch_btree:query_modify(IdBtree, Ids, [], Ids), |
| {ok, LL, LBt} = couch_btree:query_modify(LogBtree, Ids, [], Ids), |
| {ok, L, LL, LBt, Bt} |
| end, |
| |
| MakeDictFun = fun |
| ({ok, {DocId, ViewNumRowKeys}}, DictAcc) -> |
| FoldFun = fun |
| ({ViewNum, {Key, Seq, _Op}}, DictAcc2) -> |
| dict:append(ViewNum, {Key, Seq, DocId}, DictAcc2); |
| ({ViewNum, RowKey}, DictAcc2) -> |
| dict:append(ViewNum, {RowKey, DocId}, DictAcc2) |
| end, |
| lists:foldl(FoldFun, DictAcc, ViewNumRowKeys); |
| ({not_found, _}, DictAcc) -> |
| DictAcc |
| end, |
| KeysToRemove = lists:foldl(MakeDictFun, dict:new(), Lookups), |
| SeqsToRemove = lists:foldl(MakeDictFun, dict:new(), LLookups), |
| |
| RemKeysFun = fun(#mrview{id_num=ViewId}=View) -> |
| ToRem = couch_util:dict_find(ViewId, KeysToRemove, []), |
| {ok, VBtree2} = couch_btree:add_remove(View#mrview.btree, [], ToRem), |
| NewPurgeSeq = case VBtree2 =/= View#mrview.btree of |
| true -> PurgeSeq; |
| _ -> View#mrview.purge_seq |
| end, |
| {SeqBtree2, KeyBySeqBtree2} = case View#mrview.seq_indexed of |
| true -> |
| SToRem = couch_util:dict_find(ViewId, SeqsToRemove, []), |
| SKs = [{Seq, Key} || {Key, Seq, _} <- SToRem], |
| KSs = [{[Seq, Key], DocId} || {Key, Seq, DocId} <- SToRem], |
| {ok, SBt} = couch_btree:add_remove(View#mrview.seq_btree, |
| [], SKs), |
| {ok, KSbt} = couch_btree:add_remove(View#mrview.key_byseq_btree, |
| [], KSs), |
| {SBt, KSbt}; |
| _ -> {nil, nil} |
| end, |
| View#mrview{btree=VBtree2, |
| seq_btree=SeqBtree2, |
| key_byseq_btree=KeyBySeqBtree2, |
| purge_seq=NewPurgeSeq} |
| |
| end, |
| |
| Views2 = lists:map(RemKeysFun, Views), |
| {ok, State#mrst{ |
| id_btree=IdBtree2, |
| log_btree=LogBtree2, |
| views=Views2, |
| purge_seq=PurgeSeq |
| }}. |
| |
| |
| process_doc(Doc, Seq, #mrst{doc_acc=Acc}=State) when length(Acc) > 100 -> |
| couch_work_queue:queue(State#mrst.doc_queue, lists:reverse(Acc)), |
| process_doc(Doc, Seq, State#mrst{doc_acc=[]}); |
| process_doc(nil, Seq, #mrst{doc_acc=Acc}=State) -> |
| {ok, State#mrst{doc_acc=[{nil, Seq, nil} | Acc]}}; |
| process_doc(#doc{id=Id, deleted=true}, Seq, #mrst{doc_acc=Acc}=State) -> |
| {ok, State#mrst{doc_acc=[{Id, Seq, deleted} | Acc]}}; |
| process_doc(#doc{id=Id}=Doc, Seq, #mrst{doc_acc=Acc}=State) -> |
| {ok, State#mrst{doc_acc=[{Id, Seq, Doc} | Acc]}}. |
| |
| |
| finish_update(#mrst{doc_acc=Acc}=State) -> |
| if Acc /= [] -> |
| couch_work_queue:queue(State#mrst.doc_queue, Acc); |
| true -> ok |
| end, |
| couch_work_queue:close(State#mrst.doc_queue), |
| receive |
| {new_state, NewState} -> |
| {ok, NewState#mrst{ |
| first_build=undefined, |
| partial_resp_pid=undefined, |
| doc_acc=undefined, |
| doc_queue=undefined, |
| write_queue=undefined, |
| qserver=nil |
| }} |
| end. |
| |
| |
| map_docs(Parent, State0) -> |
| case couch_work_queue:dequeue(State0#mrst.doc_queue) of |
| closed -> |
| couch_query_servers:stop_doc_map(State0#mrst.qserver), |
| couch_work_queue:close(State0#mrst.write_queue); |
| {ok, Dequeued} -> |
| % Run all the non deleted docs through the view engine and |
| % then pass the results on to the writer process. |
| State1 = case State0#mrst.qserver of |
| nil -> start_query_server(State0); |
| _ -> State0 |
| end, |
| QServer = State1#mrst.qserver, |
| DocFun = fun |
| ({nil, Seq, _}, {SeqAcc, Results}) -> |
| {erlang:max(Seq, SeqAcc), Results}; |
| ({Id, Seq, deleted}, {SeqAcc, Results}) -> |
| {erlang:max(Seq, SeqAcc), [{Id, Seq, []} | Results]}; |
| ({Id, Seq, Doc}, {SeqAcc, Results}) -> |
| {ok, Res} = couch_query_servers:map_doc_raw(QServer, Doc), |
| {erlang:max(Seq, SeqAcc), [{Id, Seq, Res} | Results]} |
| end, |
| FoldFun = fun(Docs, Acc) -> |
| update_task(length(Docs)), |
| lists:foldl(DocFun, Acc, Docs) |
| end, |
| Results = lists:foldl(FoldFun, {0, []}, Dequeued), |
| couch_work_queue:queue(State1#mrst.write_queue, Results), |
| map_docs(Parent, State1) |
| end. |
| |
| |
| write_results(Parent, State) -> |
| case couch_work_queue:dequeue(State#mrst.write_queue) of |
| closed -> |
| Parent ! {new_state, State}; |
| {ok, Info} -> |
| EmptyKVs = [{V#mrview.id_num, {[], []}} || V <- State#mrst.views], |
| {Seq, ViewKVs, DocIdKeys, Log} = merge_results(Info, 0, EmptyKVs, |
| [], dict:new()), |
| NewState = write_kvs(State, Seq, ViewKVs, DocIdKeys, Log), |
| send_partial(NewState#mrst.partial_resp_pid, NewState), |
| write_results(Parent, NewState) |
| end. |
| |
| |
| start_query_server(State) -> |
| #mrst{ |
| language=Language, |
| lib=Lib, |
| views=Views |
| } = State, |
| Defs = [View#mrview.def || View <- Views], |
| {ok, QServer} = couch_query_servers:start_doc_map(Language, Defs, Lib), |
| State#mrst{qserver=QServer}. |
| |
| |
| merge_results([], SeqAcc, ViewKVs, DocIdKeys, Log) -> |
| {SeqAcc, ViewKVs, DocIdKeys, Log}; |
| merge_results([{Seq, Results} | Rest], SeqAcc, ViewKVs, DocIdKeys, Log) -> |
| Fun = fun(RawResults, {VKV, DIK, Log2}) -> |
| merge_results(RawResults, VKV, DIK, Log2) |
| end, |
| {ViewKVs1, DocIdKeys1, Log1} = lists:foldl(Fun, {ViewKVs, DocIdKeys, Log}, |
| Results), |
| merge_results(Rest, erlang:max(Seq, SeqAcc), ViewKVs1, DocIdKeys1, |
| Log1). |
| |
| |
| merge_results({DocId, _Seq, []}, ViewKVs, DocIdKeys, Log) -> |
| {ViewKVs, [{DocId, []} | DocIdKeys], dict:store(DocId, [], Log)}; |
| merge_results({DocId, Seq, RawResults}, ViewKVs, DocIdKeys, Log) -> |
| JsonResults = couch_query_servers:raw_to_ejson(RawResults), |
| Results = [[list_to_tuple(Res) || Res <- FunRs] || FunRs <- JsonResults], |
| {ViewKVs1, ViewIdKeys, Log1} = insert_results(DocId, Seq, Results, ViewKVs, [], |
| [], Log), |
| {ViewKVs1, [ViewIdKeys | DocIdKeys], Log1}. |
| |
| |
| insert_results(DocId, _Seq, [], [], ViewKVs, ViewIdKeys, Log) -> |
| {lists:reverse(ViewKVs), {DocId, ViewIdKeys}, Log}; |
| insert_results(DocId, Seq, [KVs | RKVs], [{Id, {VKVs, SKVs}} | RVKVs], VKVAcc, |
| VIdKeys, Log) -> |
| CombineDupesFun = fun |
| ({Key, Val}, {[{Key, {dups, Vals}} | Rest], IdKeys, Log2}) -> |
| {[{Key, {dups, [Val | Vals]}} | Rest], IdKeys, Log2}; |
| ({Key, Val1}, {[{Key, Val2} | Rest], IdKeys, Log2}) -> |
| {[{Key, {dups, [Val1, Val2]}} | Rest], IdKeys, Log2}; |
| ({Key, _}=KV, {Rest, IdKeys, Log2}) -> |
| {[KV | Rest], [{Id, Key} | IdKeys], |
| dict:append(DocId, {Id, {Key, Seq, add}}, Log2)} |
| end, |
| InitAcc = {[], VIdKeys, Log}, |
| {Duped, VIdKeys0, Log1} = lists:foldl(CombineDupesFun, InitAcc, |
| lists:sort(KVs)), |
| FinalKVs = [{{Key, DocId}, Val} || {Key, Val} <- Duped] ++ VKVs, |
| FinalSKVs = [{{Seq, Key}, {DocId, Val}} || {Key, Val} <- Duped] ++ SKVs, |
| insert_results(DocId, Seq, RKVs, RVKVs, |
| [{Id, {FinalKVs, FinalSKVs}} | VKVAcc], VIdKeys0, Log1). |
| |
| |
| log_removed([], _, Log) -> |
| Log; |
| log_removed([{ok, {DocId, VIdKeys}} | Rest], Seq, Log) -> |
| Log2 = lists:foldl(fun |
| ({Id, Keys}, Log1) when is_list(Keys) -> |
| lists:foldl(fun(Key, Log3) -> |
| dict:append(DocId, {Id, {Key, Seq, del}}, Log3) |
| end, Log1, Keys); |
| ({Id, Key}, Log1) -> |
| dict:append(DocId, {Id, {Key, Seq, del}}, Log1) |
| end, Log, VIdKeys), |
| log_removed(Rest, Seq, Log2); |
| log_removed([_ | Rest], Seq, Log) -> |
| log_removed(Rest, Seq, Log). |
| |
| write_kvs(State, UpdateSeq, ViewKVs, DocIdKeys, Log0) -> |
| #mrst{ |
| id_btree=IdBtree, |
| log_btree=LogBtree, |
| first_build=FirstBuild |
| } = State, |
| |
| {ok, ToRemove, IdBtree2} = update_id_btree(IdBtree, DocIdKeys, FirstBuild), |
| ToRemByView = collapse_rem_keys(ToRemove, dict:new()), |
| |
| %% add removed keys to the log |
| Log = log_removed(ToRemove, UpdateSeq, Log0), |
| |
| {ok, SeqsToAdd, SeqsToRemove, LogBtree2} = case LogBtree of |
| nil -> {ok, undefined, undefined, nil}; |
| _ -> update_log(LogBtree, Log, UpdateSeq, FirstBuild) |
| end, |
| |
| UpdateView = fun(#mrview{id_num=ViewId}=View, {ViewId, {KVs, SKVs}}) -> |
| ToRem = couch_util:dict_find(ViewId, ToRemByView, []), |
| {ok, VBtree2} = couch_btree:add_remove(View#mrview.btree, KVs, ToRem), |
| NewUpdateSeq = case VBtree2 =/= View#mrview.btree of |
| true -> UpdateSeq; |
| _ -> View#mrview.update_seq |
| end, |
| |
| %% store the view changes. |
| {SeqBtree2, KeyBySeqBtree2} = case View#mrview.seq_indexed of |
| true -> |
| SToRem = couch_util:dict_find(ViewId, SeqsToRemove, []), |
| SToAdd = couch_util:dict_find(ViewId, SeqsToAdd, []), |
| RemSKs = [{Seq, Key} || {Key, Seq, _} <- SToRem], |
| RemKSs = [{[Key, Seq], DocId} || {Key, Seq, DocId} <- SToRem], |
| SKVs1 = SKVs ++ SToAdd, |
| {ok, SBt} = couch_btree:add_remove(View#mrview.seq_btree, |
| SKVs1, RemSKs), |
| |
| {ok, KSbt} = couch_btree:add_remove(View#mrview.key_byseq_btree, |
| couch_mrview_util:to_key_seq(SKVs1), |
| RemKSs), |
| {SBt, KSbt}; |
| _ -> {nil, nil} |
| end, |
| View#mrview{btree=VBtree2, |
| seq_btree=SeqBtree2, |
| key_byseq_btree=KeyBySeqBtree2, |
| update_seq=NewUpdateSeq} |
| end, |
| |
| State#mrst{ |
| views=lists:zipwith(UpdateView, State#mrst.views, ViewKVs), |
| update_seq=UpdateSeq, |
| id_btree=IdBtree2, |
| log_btree=LogBtree2 |
| }. |
| |
| |
| update_id_btree(Btree, DocIdKeys, true) -> |
| ToAdd = [{Id, DIKeys} || {Id, DIKeys} <- DocIdKeys, DIKeys /= []], |
| couch_btree:query_modify(Btree, [], ToAdd, []); |
| update_id_btree(Btree, DocIdKeys, _) -> |
| ToFind = [Id || {Id, _} <- DocIdKeys], |
| ToAdd = [{Id, DIKeys} || {Id, DIKeys} <- DocIdKeys, DIKeys /= []], |
| ToRem = [Id || {Id, DIKeys} <- DocIdKeys, DIKeys == []], |
| couch_btree:query_modify(Btree, ToFind, ToAdd, ToRem). |
| |
| walk_log(BTree, Fun, Acc, Ids) -> |
| WrapFun = fun(KV, _Offset, Acc2) -> |
| Fun(KV, Acc2) |
| end, |
| lists:foldl(fun(Id, Acc1) -> |
| Opt = [{start_key, Id}, {end_key, Id}], |
| {ok, _, A} = couch_btree:fold(BTree, WrapFun, Acc1, Opt), |
| A |
| end, Acc, Ids). |
| |
| update_log(Btree, Log, _UpdatedSeq, true) -> |
| ToAdd = [{Id, DIKeys} || {Id, DIKeys} <- dict:to_list(Log), |
| DIKeys /= []], |
| {ok, LogBtree2} = couch_btree:add_remove(Btree, ToAdd, []), |
| {ok, dict:new(), dict:new(), LogBtree2}; |
| update_log(Btree, Log, UpdatedSeq, _) -> |
| %% build list of updated keys and Id |
| {ToLook, Updated, Removed} = dict:fold(fun |
| (Id, [], {IdsAcc, KeysAcc, RemAcc}) -> |
| {[Id | IdsAcc], KeysAcc, RemAcc}; |
| (Id, DIKeys, {IdsAcc, KeysAcc, RemAcc}) -> |
| {KeysAcc1, RemAcc1} = lists:foldl(fun |
| ({ViewId, {Key, _Seq, Op}}, |
| {KeysAcc2, RemAcc2}) -> |
| KeysAcc3 = [{Id, ViewId, Key} | KeysAcc2], |
| RemAcc3 = case Op of |
| add -> RemAcc2; |
| del -> [{Id, ViewId, Key} | RemAcc2] |
| end, |
| {KeysAcc3, RemAcc3} |
| end, {KeysAcc, RemAcc}, DIKeys), |
| {[Id | IdsAcc], KeysAcc1, RemAcc1} |
| end, {[], [], []}, Log), |
| |
| RemValue = {[{<<"_removed">>, true}]}, |
| {Log1, AddAcc, DelAcc} = walk_log(Btree, fun({DocId, VIdKeys}, |
| {Log2, AddAcc2, DelAcc2}) -> |
| |
| {Log3, AddAcc3, DelAcc3} = lists:foldl(fun({ViewId,{Key, Seq,_Op}}, |
| {Log4, AddAcc4, DelAcc4}) -> |
| |
| IsUpdated = lists:member({DocId, ViewId, Key}, |
| Updated), |
| IsRemoved = lists:member({DocId, ViewId, Key}, |
| Removed), |
| |
| case IsUpdated of |
| true -> |
| %% the log is updated, deleted old |
| %% record from the view |
| DelAcc5 = dict:append(ViewId, |
| {Key, Seq, DocId}, |
| DelAcc4), |
| %% check if the key has been deleted |
| %% and if true, update the view with a |
| %% removed record. |
| AddAcc5 = case IsRemoved of |
| false -> AddAcc4; |
| true -> |
| dict:append(ViewId, |
| {{UpdatedSeq, Key}, |
| {DocId, RemValue}}, |
| AddAcc4) |
| end, |
| {Log4, AddAcc5, DelAcc5}; |
| false -> |
| %% an update operation has been |
| %% logged for this key. We must now |
| %% record it as deleted in the |
| %% log, remove the old record in |
| %% the view and update the view |
| %% with a removed record. |
| Log5 = dict:append(DocId, |
| {ViewId, |
| {Key,UpdatedSeq, del}}, |
| Log4), |
| DelAcc5 = dict:append(ViewId, |
| {Key, Seq, DocId}, |
| DelAcc4), |
| AddAcc5 = dict:append(ViewId, |
| {{UpdatedSeq, Key}, |
| {DocId, RemValue}}, |
| AddAcc4), |
| {Log5, AddAcc5, DelAcc5} |
| end |
| end, {Log2, AddAcc2, DelAcc2}, VIdKeys), |
| {ok, {Log3, AddAcc3, DelAcc3}} |
| end, {Log, dict:new(), dict:new()}, ToLook), |
| |
| ToAdd = [{Id, DIKeys} || {Id, DIKeys} <- dict:to_list(Log1), DIKeys /= []], |
| %% store the new logs |
| {ok, LogBtree2} = couch_btree:add_remove(Btree, ToAdd, []), |
| {ok, AddAcc, DelAcc, LogBtree2}. |
| |
| collapse_rem_keys([], Acc) -> |
| Acc; |
| collapse_rem_keys([{ok, {DocId, ViewIdKeys}} | Rest], Acc) -> |
| NewAcc = lists:foldl(fun({ViewId, Key}, Acc2) -> |
| dict:append(ViewId, {Key, DocId}, Acc2) |
| end, Acc, ViewIdKeys), |
| collapse_rem_keys(Rest, NewAcc); |
| collapse_rem_keys([{not_found, _} | Rest], Acc) -> |
| collapse_rem_keys(Rest, Acc). |
| |
| |
| send_partial(Pid, State) when is_pid(Pid) -> |
| gen_server:cast(Pid, {new_state, State}); |
| send_partial(_, _) -> |
| ok. |
| |
| |
| update_task(NumChanges) -> |
| [Changes, Total] = couch_task_status:get([changes_done, total_changes]), |
| Changes2 = Changes + NumChanges, |
| Progress = case Total of |
| 0 -> |
| % updater restart after compaction finishes |
| 0; |
| _ -> |
| (Changes2 * 100) div Total |
| end, |
| couch_task_status:update([{progress, Progress}, {changes_done, Changes2}]). |
