You are viewing a plain text version of this content. The canonical link for it is here.
Posted to commits@hbase.apache.org by gi...@apache.org on 2018/10/20 14:53:25 UTC
[26/51] [partial] hbase-site git commit: Published site at
7adf590106826b9e4432cfeee06acdc0ccff8c6e.
http://git-wip-us.apache.org/repos/asf/hbase-site/blob/425db230/devapidocs/src-html/org/apache/hadoop/hbase/procedure2/store/wal/WALProcedureTree.html
----------------------------------------------------------------------
diff --git a/devapidocs/src-html/org/apache/hadoop/hbase/procedure2/store/wal/WALProcedureTree.html b/devapidocs/src-html/org/apache/hadoop/hbase/procedure2/store/wal/WALProcedureTree.html
new file mode 100644
index 0000000..8ef0ff5
--- /dev/null
+++ b/devapidocs/src-html/org/apache/hadoop/hbase/procedure2/store/wal/WALProcedureTree.html
@@ -0,0 +1,371 @@
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN" "http://www.w3.org/TR/html4/loose.dtd">
+<html lang="en">
+<head>
+<title>Source code</title>
+<link rel="stylesheet" type="text/css" href="../../../../../../../../stylesheet.css" title="Style">
+</head>
+<body>
+<div class="sourceContainer">
+<pre><span class="sourceLineNo">001</span>/**<a name="line.1"></a>
+<span class="sourceLineNo">002</span> * Licensed to the Apache Software Foundation (ASF) under one<a name="line.2"></a>
+<span class="sourceLineNo">003</span> * or more contributor license agreements. See the NOTICE file<a name="line.3"></a>
+<span class="sourceLineNo">004</span> * distributed with this work for additional information<a name="line.4"></a>
+<span class="sourceLineNo">005</span> * regarding copyright ownership. The ASF licenses this file<a name="line.5"></a>
+<span class="sourceLineNo">006</span> * to you under the Apache License, Version 2.0 (the<a name="line.6"></a>
+<span class="sourceLineNo">007</span> * "License"); you may not use this file except in compliance<a name="line.7"></a>
+<span class="sourceLineNo">008</span> * with the License. You may obtain a copy of the License at<a name="line.8"></a>
+<span class="sourceLineNo">009</span> *<a name="line.9"></a>
+<span class="sourceLineNo">010</span> * http://www.apache.org/licenses/LICENSE-2.0<a name="line.10"></a>
+<span class="sourceLineNo">011</span> *<a name="line.11"></a>
+<span class="sourceLineNo">012</span> * Unless required by applicable law or agreed to in writing, software<a name="line.12"></a>
+<span class="sourceLineNo">013</span> * distributed under the License is distributed on an "AS IS" BASIS,<a name="line.13"></a>
+<span class="sourceLineNo">014</span> * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.<a name="line.14"></a>
+<span class="sourceLineNo">015</span> * See the License for the specific language governing permissions and<a name="line.15"></a>
+<span class="sourceLineNo">016</span> * limitations under the License.<a name="line.16"></a>
+<span class="sourceLineNo">017</span> */<a name="line.17"></a>
+<span class="sourceLineNo">018</span>package org.apache.hadoop.hbase.procedure2.store.wal;<a name="line.18"></a>
+<span class="sourceLineNo">019</span><a name="line.19"></a>
+<span class="sourceLineNo">020</span>import java.io.IOException;<a name="line.20"></a>
+<span class="sourceLineNo">021</span>import java.util.ArrayList;<a name="line.21"></a>
+<span class="sourceLineNo">022</span>import java.util.Collection;<a name="line.22"></a>
+<span class="sourceLineNo">023</span>import java.util.Collections;<a name="line.23"></a>
+<span class="sourceLineNo">024</span>import java.util.Comparator;<a name="line.24"></a>
+<span class="sourceLineNo">025</span>import java.util.HashMap;<a name="line.25"></a>
+<span class="sourceLineNo">026</span>import java.util.Iterator;<a name="line.26"></a>
+<span class="sourceLineNo">027</span>import java.util.List;<a name="line.27"></a>
+<span class="sourceLineNo">028</span>import java.util.Map;<a name="line.28"></a>
+<span class="sourceLineNo">029</span>import java.util.NoSuchElementException;<a name="line.29"></a>
+<span class="sourceLineNo">030</span>import org.apache.commons.lang3.mutable.MutableInt;<a name="line.30"></a>
+<span class="sourceLineNo">031</span>import org.apache.hadoop.hbase.procedure2.Procedure;<a name="line.31"></a>
+<span class="sourceLineNo">032</span>import org.apache.hadoop.hbase.procedure2.ProcedureUtil;<a name="line.32"></a>
+<span class="sourceLineNo">033</span>import org.apache.hadoop.hbase.procedure2.store.ProcedureStore.ProcedureIterator;<a name="line.33"></a>
+<span class="sourceLineNo">034</span>import org.apache.yetus.audience.InterfaceAudience;<a name="line.34"></a>
+<span class="sourceLineNo">035</span>import org.slf4j.Logger;<a name="line.35"></a>
+<span class="sourceLineNo">036</span>import org.slf4j.LoggerFactory;<a name="line.36"></a>
+<span class="sourceLineNo">037</span><a name="line.37"></a>
+<span class="sourceLineNo">038</span>import org.apache.hadoop.hbase.shaded.protobuf.generated.ProcedureProtos;<a name="line.38"></a>
+<span class="sourceLineNo">039</span><a name="line.39"></a>
+<span class="sourceLineNo">040</span>/**<a name="line.40"></a>
+<span class="sourceLineNo">041</span> * Used to build the tree for procedures.<a name="line.41"></a>
+<span class="sourceLineNo">042</span> * <p/><a name="line.42"></a>
+<span class="sourceLineNo">043</span> * We will group the procedures with the root procedure, and then validate each group. For each<a name="line.43"></a>
+<span class="sourceLineNo">044</span> * group of procedures(with the same root procedure), we will collect all the stack ids, if the max<a name="line.44"></a>
+<span class="sourceLineNo">045</span> * stack id is n, then all the stack ids should be from 0 to n, non-repetition and non-omission. If<a name="line.45"></a>
+<span class="sourceLineNo">046</span> * not, we will consider all the procedures in this group as corrupted. Please see the code in<a name="line.46"></a>
+<span class="sourceLineNo">047</span> * {@link #checkReady(Entry, Map)} method.<a name="line.47"></a>
+<span class="sourceLineNo">048</span> * <p/><a name="line.48"></a>
+<span class="sourceLineNo">049</span> * For the procedures not in any group, i.e, can not find the root procedure for these procedures,<a name="line.49"></a>
+<span class="sourceLineNo">050</span> * we will also consider them as corrupted. Please see the code in {@link #checkOrphan(Map)} method.<a name="line.50"></a>
+<span class="sourceLineNo">051</span> */<a name="line.51"></a>
+<span class="sourceLineNo">052</span>@InterfaceAudience.Private<a name="line.52"></a>
+<span class="sourceLineNo">053</span>public final class WALProcedureTree {<a name="line.53"></a>
+<span class="sourceLineNo">054</span><a name="line.54"></a>
+<span class="sourceLineNo">055</span> private static final Logger LOG = LoggerFactory.getLogger(WALProcedureTree.class);<a name="line.55"></a>
+<span class="sourceLineNo">056</span><a name="line.56"></a>
+<span class="sourceLineNo">057</span> private static final class Entry {<a name="line.57"></a>
+<span class="sourceLineNo">058</span><a name="line.58"></a>
+<span class="sourceLineNo">059</span> private final ProcedureProtos.Procedure proc;<a name="line.59"></a>
+<span class="sourceLineNo">060</span><a name="line.60"></a>
+<span class="sourceLineNo">061</span> private final List<Entry> subProcs = new ArrayList<>();<a name="line.61"></a>
+<span class="sourceLineNo">062</span><a name="line.62"></a>
+<span class="sourceLineNo">063</span> public Entry(ProcedureProtos.Procedure proc) {<a name="line.63"></a>
+<span class="sourceLineNo">064</span> this.proc = proc;<a name="line.64"></a>
+<span class="sourceLineNo">065</span> }<a name="line.65"></a>
+<span class="sourceLineNo">066</span><a name="line.66"></a>
+<span class="sourceLineNo">067</span> @Override<a name="line.67"></a>
+<span class="sourceLineNo">068</span> public String toString() {<a name="line.68"></a>
+<span class="sourceLineNo">069</span> StringBuilder sb = new StringBuilder();<a name="line.69"></a>
+<span class="sourceLineNo">070</span> sb.append("Procedure(pid=");<a name="line.70"></a>
+<span class="sourceLineNo">071</span> sb.append(proc.getProcId());<a name="line.71"></a>
+<span class="sourceLineNo">072</span> sb.append(", ppid=");<a name="line.72"></a>
+<span class="sourceLineNo">073</span> sb.append(proc.hasParentId() ? proc.getParentId() : Procedure.NO_PROC_ID);<a name="line.73"></a>
+<span class="sourceLineNo">074</span> sb.append(", class=");<a name="line.74"></a>
+<span class="sourceLineNo">075</span> sb.append(proc.getClassName());<a name="line.75"></a>
+<span class="sourceLineNo">076</span> sb.append(")");<a name="line.76"></a>
+<span class="sourceLineNo">077</span> return sb.toString();<a name="line.77"></a>
+<span class="sourceLineNo">078</span> }<a name="line.78"></a>
+<span class="sourceLineNo">079</span> }<a name="line.79"></a>
+<span class="sourceLineNo">080</span><a name="line.80"></a>
+<span class="sourceLineNo">081</span> // when loading we will iterator the procedures twice, so use this class to cache the deserialized<a name="line.81"></a>
+<span class="sourceLineNo">082</span> // result to prevent deserializing multiple times.<a name="line.82"></a>
+<span class="sourceLineNo">083</span> private static final class ProtoAndProc {<a name="line.83"></a>
+<span class="sourceLineNo">084</span> private final ProcedureProtos.Procedure proto;<a name="line.84"></a>
+<span class="sourceLineNo">085</span><a name="line.85"></a>
+<span class="sourceLineNo">086</span> private Procedure<?> proc;<a name="line.86"></a>
+<span class="sourceLineNo">087</span><a name="line.87"></a>
+<span class="sourceLineNo">088</span> public ProtoAndProc(ProcedureProtos.Procedure proto) {<a name="line.88"></a>
+<span class="sourceLineNo">089</span> this.proto = proto;<a name="line.89"></a>
+<span class="sourceLineNo">090</span> }<a name="line.90"></a>
+<span class="sourceLineNo">091</span><a name="line.91"></a>
+<span class="sourceLineNo">092</span> public Procedure<?> getProc() throws IOException {<a name="line.92"></a>
+<span class="sourceLineNo">093</span> if (proc == null) {<a name="line.93"></a>
+<span class="sourceLineNo">094</span> proc = ProcedureUtil.convertToProcedure(proto);<a name="line.94"></a>
+<span class="sourceLineNo">095</span> }<a name="line.95"></a>
+<span class="sourceLineNo">096</span> return proc;<a name="line.96"></a>
+<span class="sourceLineNo">097</span> }<a name="line.97"></a>
+<span class="sourceLineNo">098</span> }<a name="line.98"></a>
+<span class="sourceLineNo">099</span><a name="line.99"></a>
+<span class="sourceLineNo">100</span> private final List<ProtoAndProc> validProcs = new ArrayList<>();<a name="line.100"></a>
+<span class="sourceLineNo">101</span><a name="line.101"></a>
+<span class="sourceLineNo">102</span> private final List<ProtoAndProc> corruptedProcs = new ArrayList<>();<a name="line.102"></a>
+<span class="sourceLineNo">103</span><a name="line.103"></a>
+<span class="sourceLineNo">104</span> private static boolean isFinished(ProcedureProtos.Procedure proc) {<a name="line.104"></a>
+<span class="sourceLineNo">105</span> if (!proc.hasParentId()) {<a name="line.105"></a>
+<span class="sourceLineNo">106</span> switch (proc.getState()) {<a name="line.106"></a>
+<span class="sourceLineNo">107</span> case ROLLEDBACK:<a name="line.107"></a>
+<span class="sourceLineNo">108</span> case SUCCESS:<a name="line.108"></a>
+<span class="sourceLineNo">109</span> return true;<a name="line.109"></a>
+<span class="sourceLineNo">110</span> default:<a name="line.110"></a>
+<span class="sourceLineNo">111</span> break;<a name="line.111"></a>
+<span class="sourceLineNo">112</span> }<a name="line.112"></a>
+<span class="sourceLineNo">113</span> }<a name="line.113"></a>
+<span class="sourceLineNo">114</span> return false;<a name="line.114"></a>
+<span class="sourceLineNo">115</span> }<a name="line.115"></a>
+<span class="sourceLineNo">116</span><a name="line.116"></a>
+<span class="sourceLineNo">117</span> private WALProcedureTree(Map<Long, Entry> procMap) {<a name="line.117"></a>
+<span class="sourceLineNo">118</span> List<Entry> rootEntries = buildTree(procMap);<a name="line.118"></a>
+<span class="sourceLineNo">119</span> for (Entry rootEntry : rootEntries) {<a name="line.119"></a>
+<span class="sourceLineNo">120</span> checkReady(rootEntry, procMap);<a name="line.120"></a>
+<span class="sourceLineNo">121</span> }<a name="line.121"></a>
+<span class="sourceLineNo">122</span> checkOrphan(procMap);<a name="line.122"></a>
+<span class="sourceLineNo">123</span> Comparator<ProtoAndProc> cmp =<a name="line.123"></a>
+<span class="sourceLineNo">124</span> (p1, p2) -> Long.compare(p1.proto.getProcId(), p2.proto.getProcId());<a name="line.124"></a>
+<span class="sourceLineNo">125</span> Collections.sort(validProcs, cmp);<a name="line.125"></a>
+<span class="sourceLineNo">126</span> Collections.sort(corruptedProcs, cmp);<a name="line.126"></a>
+<span class="sourceLineNo">127</span> }<a name="line.127"></a>
+<span class="sourceLineNo">128</span><a name="line.128"></a>
+<span class="sourceLineNo">129</span> private List<Entry> buildTree(Map<Long, Entry> procMap) {<a name="line.129"></a>
+<span class="sourceLineNo">130</span> List<Entry> rootEntries = new ArrayList<>();<a name="line.130"></a>
+<span class="sourceLineNo">131</span> procMap.values().forEach(entry -> {<a name="line.131"></a>
+<span class="sourceLineNo">132</span> if (!entry.proc.hasParentId()) {<a name="line.132"></a>
+<span class="sourceLineNo">133</span> rootEntries.add(entry);<a name="line.133"></a>
+<span class="sourceLineNo">134</span> } else {<a name="line.134"></a>
+<span class="sourceLineNo">135</span> Entry parentEntry = procMap.get(entry.proc.getParentId());<a name="line.135"></a>
+<span class="sourceLineNo">136</span> // For a valid procedure this should not be null. We will log the error later if it is null,<a name="line.136"></a>
+<span class="sourceLineNo">137</span> // as it will not be referenced by any root procedures.<a name="line.137"></a>
+<span class="sourceLineNo">138</span> if (parentEntry != null) {<a name="line.138"></a>
+<span class="sourceLineNo">139</span> parentEntry.subProcs.add(entry);<a name="line.139"></a>
+<span class="sourceLineNo">140</span> }<a name="line.140"></a>
+<span class="sourceLineNo">141</span> }<a name="line.141"></a>
+<span class="sourceLineNo">142</span> });<a name="line.142"></a>
+<span class="sourceLineNo">143</span> return rootEntries;<a name="line.143"></a>
+<span class="sourceLineNo">144</span> }<a name="line.144"></a>
+<span class="sourceLineNo">145</span><a name="line.145"></a>
+<span class="sourceLineNo">146</span> private void collectStackId(Entry entry, Map<Integer, List<Entry>> stackId2Proc,<a name="line.146"></a>
+<span class="sourceLineNo">147</span> MutableInt maxStackId) {<a name="line.147"></a>
+<span class="sourceLineNo">148</span> for (int i = 0, n = entry.proc.getStackIdCount(); i < n; i++) {<a name="line.148"></a>
+<span class="sourceLineNo">149</span> int stackId = entry.proc.getStackId(i);<a name="line.149"></a>
+<span class="sourceLineNo">150</span> if (stackId > maxStackId.intValue()) {<a name="line.150"></a>
+<span class="sourceLineNo">151</span> maxStackId.setValue(stackId);<a name="line.151"></a>
+<span class="sourceLineNo">152</span> }<a name="line.152"></a>
+<span class="sourceLineNo">153</span> stackId2Proc.computeIfAbsent(stackId, k -> new ArrayList<>()).add(entry);<a name="line.153"></a>
+<span class="sourceLineNo">154</span> }<a name="line.154"></a>
+<span class="sourceLineNo">155</span> entry.subProcs.forEach(e -> collectStackId(e, stackId2Proc, maxStackId));<a name="line.155"></a>
+<span class="sourceLineNo">156</span> }<a name="line.156"></a>
+<span class="sourceLineNo">157</span><a name="line.157"></a>
+<span class="sourceLineNo">158</span> private void addAllToCorruptedAndRemoveFromProcMap(Entry entry,<a name="line.158"></a>
+<span class="sourceLineNo">159</span> Map<Long, Entry> remainingProcMap) {<a name="line.159"></a>
+<span class="sourceLineNo">160</span> corruptedProcs.add(new ProtoAndProc(entry.proc));<a name="line.160"></a>
+<span class="sourceLineNo">161</span> remainingProcMap.remove(entry.proc.getProcId());<a name="line.161"></a>
+<span class="sourceLineNo">162</span> for (Entry e : entry.subProcs) {<a name="line.162"></a>
+<span class="sourceLineNo">163</span> addAllToCorruptedAndRemoveFromProcMap(e, remainingProcMap);<a name="line.163"></a>
+<span class="sourceLineNo">164</span> }<a name="line.164"></a>
+<span class="sourceLineNo">165</span> }<a name="line.165"></a>
+<span class="sourceLineNo">166</span><a name="line.166"></a>
+<span class="sourceLineNo">167</span> private void addAllToValidAndRemoveFromProcMap(Entry entry, Map<Long, Entry> remainingProcMap) {<a name="line.167"></a>
+<span class="sourceLineNo">168</span> validProcs.add(new ProtoAndProc(entry.proc));<a name="line.168"></a>
+<span class="sourceLineNo">169</span> remainingProcMap.remove(entry.proc.getProcId());<a name="line.169"></a>
+<span class="sourceLineNo">170</span> for (Entry e : entry.subProcs) {<a name="line.170"></a>
+<span class="sourceLineNo">171</span> addAllToValidAndRemoveFromProcMap(e, remainingProcMap);<a name="line.171"></a>
+<span class="sourceLineNo">172</span> }<a name="line.172"></a>
+<span class="sourceLineNo">173</span> }<a name="line.173"></a>
+<span class="sourceLineNo">174</span><a name="line.174"></a>
+<span class="sourceLineNo">175</span> // In this method first we will check whether the given root procedure and all its sub procedures<a name="line.175"></a>
+<span class="sourceLineNo">176</span> // are valid, through the procedure stack. And we will also remove all these procedures from the<a name="line.176"></a>
+<span class="sourceLineNo">177</span> // remainingProcMap, so at last, if there are still procedures in the map, we know that there are<a name="line.177"></a>
+<span class="sourceLineNo">178</span> // orphan procedures.<a name="line.178"></a>
+<span class="sourceLineNo">179</span> private void checkReady(Entry rootEntry, Map<Long, Entry> remainingProcMap) {<a name="line.179"></a>
+<span class="sourceLineNo">180</span> if (isFinished(rootEntry.proc)) {<a name="line.180"></a>
+<span class="sourceLineNo">181</span> if (!rootEntry.subProcs.isEmpty()) {<a name="line.181"></a>
+<span class="sourceLineNo">182</span> LOG.error("unexpected active children for root-procedure: {}", rootEntry);<a name="line.182"></a>
+<span class="sourceLineNo">183</span> rootEntry.subProcs.forEach(e -> LOG.error("unexpected active children: {}", e));<a name="line.183"></a>
+<span class="sourceLineNo">184</span> addAllToCorruptedAndRemoveFromProcMap(rootEntry, remainingProcMap);<a name="line.184"></a>
+<span class="sourceLineNo">185</span> } else {<a name="line.185"></a>
+<span class="sourceLineNo">186</span> addAllToValidAndRemoveFromProcMap(rootEntry, remainingProcMap);<a name="line.186"></a>
+<span class="sourceLineNo">187</span> }<a name="line.187"></a>
+<span class="sourceLineNo">188</span> return;<a name="line.188"></a>
+<span class="sourceLineNo">189</span> }<a name="line.189"></a>
+<span class="sourceLineNo">190</span> Map<Integer, List<Entry>> stackId2Proc = new HashMap<>();<a name="line.190"></a>
+<span class="sourceLineNo">191</span> MutableInt maxStackId = new MutableInt(Integer.MIN_VALUE);<a name="line.191"></a>
+<span class="sourceLineNo">192</span> collectStackId(rootEntry, stackId2Proc, maxStackId);<a name="line.192"></a>
+<span class="sourceLineNo">193</span> // the stack ids should start from 0 and increase by one every time<a name="line.193"></a>
+<span class="sourceLineNo">194</span> boolean valid = true;<a name="line.194"></a>
+<span class="sourceLineNo">195</span> for (int i = 0; i <= maxStackId.intValue(); i++) {<a name="line.195"></a>
+<span class="sourceLineNo">196</span> List<Entry> entries = stackId2Proc.get(i);<a name="line.196"></a>
+<span class="sourceLineNo">197</span> if (entries == null) {<a name="line.197"></a>
+<span class="sourceLineNo">198</span> LOG.error("Missing stack id {}, max stack id is {}, root procedure is {}", i, maxStackId,<a name="line.198"></a>
+<span class="sourceLineNo">199</span> rootEntry);<a name="line.199"></a>
+<span class="sourceLineNo">200</span> valid = false;<a name="line.200"></a>
+<span class="sourceLineNo">201</span> } else if (entries.size() > 1) {<a name="line.201"></a>
+<span class="sourceLineNo">202</span> LOG.error("Multiple procedures {} have the same stack id {}, max stack id is {}," +<a name="line.202"></a>
+<span class="sourceLineNo">203</span> " root procedure is {}", entries, i, maxStackId, rootEntry);<a name="line.203"></a>
+<span class="sourceLineNo">204</span> valid = false;<a name="line.204"></a>
+<span class="sourceLineNo">205</span> }<a name="line.205"></a>
+<span class="sourceLineNo">206</span> }<a name="line.206"></a>
+<span class="sourceLineNo">207</span> if (valid) {<a name="line.207"></a>
+<span class="sourceLineNo">208</span> addAllToValidAndRemoveFromProcMap(rootEntry, remainingProcMap);<a name="line.208"></a>
+<span class="sourceLineNo">209</span> } else {<a name="line.209"></a>
+<span class="sourceLineNo">210</span> addAllToCorruptedAndRemoveFromProcMap(rootEntry, remainingProcMap);<a name="line.210"></a>
+<span class="sourceLineNo">211</span> }<a name="line.211"></a>
+<span class="sourceLineNo">212</span> }<a name="line.212"></a>
+<span class="sourceLineNo">213</span><a name="line.213"></a>
+<span class="sourceLineNo">214</span> private void checkOrphan(Map<Long, Entry> procMap) {<a name="line.214"></a>
+<span class="sourceLineNo">215</span> procMap.values().forEach(entry -> {<a name="line.215"></a>
+<span class="sourceLineNo">216</span> LOG.error("Orphan procedure: {}", entry);<a name="line.216"></a>
+<span class="sourceLineNo">217</span> corruptedProcs.add(new ProtoAndProc(entry.proc));<a name="line.217"></a>
+<span class="sourceLineNo">218</span> });<a name="line.218"></a>
+<span class="sourceLineNo">219</span> }<a name="line.219"></a>
+<span class="sourceLineNo">220</span><a name="line.220"></a>
+<span class="sourceLineNo">221</span> private static final class Iter implements ProcedureIterator {<a name="line.221"></a>
+<span class="sourceLineNo">222</span><a name="line.222"></a>
+<span class="sourceLineNo">223</span> private final List<ProtoAndProc> procs;<a name="line.223"></a>
+<span class="sourceLineNo">224</span><a name="line.224"></a>
+<span class="sourceLineNo">225</span> private Iterator<ProtoAndProc> iter;<a name="line.225"></a>
+<span class="sourceLineNo">226</span><a name="line.226"></a>
+<span class="sourceLineNo">227</span> private ProtoAndProc current;<a name="line.227"></a>
+<span class="sourceLineNo">228</span><a name="line.228"></a>
+<span class="sourceLineNo">229</span> public Iter(List<ProtoAndProc> procs) {<a name="line.229"></a>
+<span class="sourceLineNo">230</span> this.procs = procs;<a name="line.230"></a>
+<span class="sourceLineNo">231</span> reset();<a name="line.231"></a>
+<span class="sourceLineNo">232</span> }<a name="line.232"></a>
+<span class="sourceLineNo">233</span><a name="line.233"></a>
+<span class="sourceLineNo">234</span> @Override<a name="line.234"></a>
+<span class="sourceLineNo">235</span> public void reset() {<a name="line.235"></a>
+<span class="sourceLineNo">236</span> iter = procs.iterator();<a name="line.236"></a>
+<span class="sourceLineNo">237</span> if (iter.hasNext()) {<a name="line.237"></a>
+<span class="sourceLineNo">238</span> current = iter.next();<a name="line.238"></a>
+<span class="sourceLineNo">239</span> } else {<a name="line.239"></a>
+<span class="sourceLineNo">240</span> current = null;<a name="line.240"></a>
+<span class="sourceLineNo">241</span> }<a name="line.241"></a>
+<span class="sourceLineNo">242</span> }<a name="line.242"></a>
+<span class="sourceLineNo">243</span><a name="line.243"></a>
+<span class="sourceLineNo">244</span> @Override<a name="line.244"></a>
+<span class="sourceLineNo">245</span> public boolean hasNext() {<a name="line.245"></a>
+<span class="sourceLineNo">246</span> return current != null;<a name="line.246"></a>
+<span class="sourceLineNo">247</span> }<a name="line.247"></a>
+<span class="sourceLineNo">248</span><a name="line.248"></a>
+<span class="sourceLineNo">249</span> private void checkNext() {<a name="line.249"></a>
+<span class="sourceLineNo">250</span> if (!hasNext()) {<a name="line.250"></a>
+<span class="sourceLineNo">251</span> throw new NoSuchElementException();<a name="line.251"></a>
+<span class="sourceLineNo">252</span> }<a name="line.252"></a>
+<span class="sourceLineNo">253</span> }<a name="line.253"></a>
+<span class="sourceLineNo">254</span><a name="line.254"></a>
+<span class="sourceLineNo">255</span> @Override<a name="line.255"></a>
+<span class="sourceLineNo">256</span> public boolean isNextFinished() {<a name="line.256"></a>
+<span class="sourceLineNo">257</span> checkNext();<a name="line.257"></a>
+<span class="sourceLineNo">258</span> return isFinished(current.proto);<a name="line.258"></a>
+<span class="sourceLineNo">259</span> }<a name="line.259"></a>
+<span class="sourceLineNo">260</span><a name="line.260"></a>
+<span class="sourceLineNo">261</span> private void moveToNext() {<a name="line.261"></a>
+<span class="sourceLineNo">262</span> if (iter.hasNext()) {<a name="line.262"></a>
+<span class="sourceLineNo">263</span> current = iter.next();<a name="line.263"></a>
+<span class="sourceLineNo">264</span> } else {<a name="line.264"></a>
+<span class="sourceLineNo">265</span> current = null;<a name="line.265"></a>
+<span class="sourceLineNo">266</span> }<a name="line.266"></a>
+<span class="sourceLineNo">267</span> }<a name="line.267"></a>
+<span class="sourceLineNo">268</span><a name="line.268"></a>
+<span class="sourceLineNo">269</span> @Override<a name="line.269"></a>
+<span class="sourceLineNo">270</span> public void skipNext() {<a name="line.270"></a>
+<span class="sourceLineNo">271</span> checkNext();<a name="line.271"></a>
+<span class="sourceLineNo">272</span> moveToNext();<a name="line.272"></a>
+<span class="sourceLineNo">273</span> }<a name="line.273"></a>
+<span class="sourceLineNo">274</span><a name="line.274"></a>
+<span class="sourceLineNo">275</span> @Override<a name="line.275"></a>
+<span class="sourceLineNo">276</span> public Procedure<?> next() throws IOException {<a name="line.276"></a>
+<span class="sourceLineNo">277</span> checkNext();<a name="line.277"></a>
+<span class="sourceLineNo">278</span> Procedure<?> proc = current.getProc();<a name="line.278"></a>
+<span class="sourceLineNo">279</span> moveToNext();<a name="line.279"></a>
+<span class="sourceLineNo">280</span> return proc;<a name="line.280"></a>
+<span class="sourceLineNo">281</span> }<a name="line.281"></a>
+<span class="sourceLineNo">282</span> }<a name="line.282"></a>
+<span class="sourceLineNo">283</span><a name="line.283"></a>
+<span class="sourceLineNo">284</span> public ProcedureIterator getValidProcs() {<a name="line.284"></a>
+<span class="sourceLineNo">285</span> return new Iter(validProcs);<a name="line.285"></a>
+<span class="sourceLineNo">286</span> }<a name="line.286"></a>
+<span class="sourceLineNo">287</span><a name="line.287"></a>
+<span class="sourceLineNo">288</span> public ProcedureIterator getCorruptedProcs() {<a name="line.288"></a>
+<span class="sourceLineNo">289</span> return new Iter(corruptedProcs);<a name="line.289"></a>
+<span class="sourceLineNo">290</span> }<a name="line.290"></a>
+<span class="sourceLineNo">291</span><a name="line.291"></a>
+<span class="sourceLineNo">292</span> public static WALProcedureTree build(Collection<ProcedureProtos.Procedure> procedures) {<a name="line.292"></a>
+<span class="sourceLineNo">293</span> Map<Long, Entry> procMap = new HashMap<>();<a name="line.293"></a>
+<span class="sourceLineNo">294</span> for (ProcedureProtos.Procedure proc : procedures) {<a name="line.294"></a>
+<span class="sourceLineNo">295</span> procMap.put(proc.getProcId(), new Entry(proc));<a name="line.295"></a>
+<span class="sourceLineNo">296</span> }<a name="line.296"></a>
+<span class="sourceLineNo">297</span> return new WALProcedureTree(procMap);<a name="line.297"></a>
+<span class="sourceLineNo">298</span> }<a name="line.298"></a>
+<span class="sourceLineNo">299</span>}<a name="line.299"></a>
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+</pre>
+</div>
+</body>
+</html>