390
|
1 package rep.handler;
|
|
2
|
|
3 import java.util.Comparator;
|
|
4 import java.util.LinkedList;
|
|
5 import java.util.List;
|
|
6 import java.util.TreeSet;
|
|
7
|
|
8 import rep.REP;
|
|
9 import rep.REPCommand;
|
407
|
10 import rep.SessionManager;
|
421
|
11 import rep.channel.REPLogger;
|
390
|
12 import rep.optimizers.REPCommandOptimizer;
|
|
13
|
|
14 public class Translator {
|
|
15 public int eid;
|
|
16
|
|
17 public REPCommandOptimizer optimizer;
|
|
18 private LinkedList<REPCommand> unMergedCmds;
|
|
19 public LinkedList<REPCommand> sentMergedList;
|
|
20 private LinkedList<REPCommand> mergeAgainList;
|
421
|
21 public REPLogger logger = SessionManager.logger;
|
390
|
22 boolean merge_mode = false;
|
|
23
|
|
24 public Translator(int _eid,REPCommandOptimizer opt){
|
|
25 eid = _eid;
|
|
26 optimizer = opt;
|
|
27 unMergedCmds = new LinkedList<REPCommand>();
|
|
28 mergeAgainList = new LinkedList<REPCommand>();
|
|
29 sentMergedList = new LinkedList<REPCommand>();
|
|
30 }
|
|
31
|
|
32 /**
|
|
33 * New command from an editor
|
|
34 * The command is sent to the next editor
|
|
35 * @param cmd
|
|
36 * @return translated command.
|
|
37 */
|
|
38 public REPCommand transSendCmd(REPCommand cmd){
|
|
39 assert(cmd.eid==eid);
|
|
40 unMergedCmds.add(cmd);
|
|
41
|
|
42 //マージ中にユーザから割り込みがあった場合
|
|
43 if(isMerging()){
|
|
44 mergeAgainList.add(cmd);
|
|
45 }
|
|
46
|
|
47 return cmd;
|
|
48 }
|
|
49 /**
|
|
50 * My command is returned from the session ring, and START_MERGE_ACK
|
|
51 * is returned. At this
|
|
52 * stage my writeQueue is empty, our editor is waiting for me.
|
|
53 * Start merge process.
|
|
54 * @param cmd
|
|
55 */
|
|
56 public boolean catchOwnCommand(REPNode editor){
|
427
|
57 logger.writeLog("beforeMerge:"+unMergedCmds);
|
390
|
58 LinkedList<REPCommand> output = new LinkedList<REPCommand>();
|
427
|
59 TreeSet<REPCommand> cmds = new TreeSet<REPCommand>(new REPCommandComparator());
|
|
60 // merge queue上にあるコマンドを全部undoコマンドするのと同時に
|
|
61 // sort したコマンド列を生成する
|
|
62 for( REPCommand cmd0 : unMergedCmds) {
|
390
|
63 output.add( createUndo(cmd0) );
|
|
64 cmds.add(cmd0);
|
|
65 }
|
|
66 output.addAll(cmds);
|
427
|
67 // ACKが来たものは必ず先頭
|
|
68 unMergedCmds.removeFirst();
|
426
|
69 logger.writeLog("outputMerge:"+output);
|
|
70 logger.writeLog("afterMerge:"+unMergedCmds);
|
390
|
71 return optimizedSend(editor,output);
|
|
72 }
|
|
73
|
|
74 /**
|
|
75 * Sent optimized merged command list
|
|
76 * @param editor
|
|
77 * @param output
|
|
78 * @return if any sent commands output
|
|
79 */
|
|
80 public boolean optimizedSend(REPNode editor, LinkedList<REPCommand> output) {
|
|
81 List<REPCommand> output1 = optimizer.optimize(output);
|
|
82 if (output1.size()==0) {
|
|
83 merge_mode = false;
|
|
84 return false;
|
|
85 }
|
|
86 for(REPCommand c:output1) {
|
|
87 REPCommand m = new REPCommand(c);
|
|
88 m.setEID(REP.MERGE_EID.id);
|
|
89 m.setSEQID(editor.seq());
|
|
90 sentMergedList.add(m);
|
|
91 editor.send(m);
|
|
92 }
|
|
93 merge_mode = true;
|
|
94 return true;
|
|
95 }
|
|
96
|
|
97 private REPCommand createUndo(REPCommand cmd){
|
|
98 REPCommand retCmd = new REPCommand(cmd);
|
|
99 if (cmd.cmd==REP.REPCMD_INSERT) retCmd.cmd=REP.REPCMD_DELETE;
|
|
100 else if (cmd.cmd==REP.REPCMD_DELETE) retCmd.cmd=REP.REPCMD_INSERT;
|
|
101 return retCmd;
|
|
102 }
|
|
103
|
|
104 class REPCommandComparator implements Comparator<REPCommand>{
|
|
105
|
|
106 public int compare(REPCommand o1, REPCommand o2) {
|
427
|
107 if ( o1.eid<o2.eid ) return -1;
|
|
108 if ( o1.eid>o2.eid ) return 1;
|
|
109 if ( o1.seq<o2.seq ) return -1;
|
|
110 if ( o1.seq>o2.seq ) return 1;
|
|
111 assert(false);
|
|
112 return 0;
|
390
|
113 }
|
|
114 }
|
|
115
|
|
116 /**
|
|
117 * Translate Command cmd that was received from SeMa.
|
|
118 * @param cmd the command to be translated.
|
|
119 * @return translated commannd.
|
|
120 */
|
|
121 public void transReceiveCmd(REPNode nextEditor,REPCommand cmd){
|
|
122 assert (cmd.eid != eid);
|
|
123 unMergedCmds.add(cmd);
|
|
124 }
|
|
125
|
|
126 public void setEid(int _eid){
|
|
127 eid = _eid;
|
|
128 }
|
|
129
|
|
130 public boolean checkMergeConflict(REPCommand command) {
|
|
131 REPCommand prev = sentMergedList.remove();
|
|
132 assert (prev.seq==command.seq);
|
|
133
|
|
134 if(mergeAgainList.size() > 0){
|
|
135 mergeAgainList.add(command);
|
|
136 return true;
|
|
137 }
|
|
138 if(sentMergedList.size()==0) {
|
|
139 merge_mode=false;
|
|
140 }
|
|
141 return false;
|
|
142 }
|
|
143
|
|
144 public void getMergeAgain(REPNode editor) {
|
|
145 LinkedList<REPCommand> returnCommand = new LinkedList<REPCommand>();
|
|
146 for(int i = 0; i < mergeAgainList.size(); i++){
|
|
147 //eid = REP.MEGE_EID
|
|
148 returnCommand.add(createUndo(mergeAgainList.get(mergeAgainList.size() - i -1)));
|
|
149 }
|
|
150 for(REPCommand command : mergeAgainList){
|
|
151 if(command.eid == REP.MERGE_EID.id){
|
|
152 returnCommand.add(command);
|
|
153 }
|
|
154 }
|
|
155 for(REPCommand command : mergeAgainList){
|
|
156 if(command.eid == eid){
|
|
157 command.eid = REP.MERGE_EID.id;
|
|
158 returnCommand.add(command);
|
|
159 }
|
|
160 }
|
411
|
161 // int count = 0;
|
|
162 // for(REPCommand command: returnCommand) {
|
|
163 // switch(command.cmd) {
|
|
164 // case REPCMD_INSERT: count++; break;
|
|
165 // case REPCMD_DELETE: count--; break;
|
|
166 // default: assert false;
|
|
167 // }
|
|
168 // }
|
421
|
169 logger.writeLog("MergeAgain ret="+returnCommand.size());
|
411
|
170 // +" increment="+count);
|
390
|
171 mergeAgainList.clear();
|
|
172 optimizedSend(editor, returnCommand);
|
|
173 }
|
|
174
|
|
175 public boolean isFinished() {
|
|
176 if(unMergedCmds.size() > 0) return false;
|
|
177 if(sentMergedList.size() > 0) return false;
|
|
178 return true;
|
|
179 }
|
|
180
|
|
181 public boolean isMerging() {
|
|
182 return merge_mode;
|
|
183 }
|
|
184
|
|
185 public void startMerge(REPCommand cmd) {
|
427
|
186 logger.writeLog("START MERGE command ="+cmd+" and top of unMergedCmds = "+ unMergedCmds.getFirst());
|
390
|
187 merge_mode = true;
|
|
188 }
|
|
189
|
|
190 public void mergeAck() {
|
|
191 }
|
|
192
|
|
193
|
|
194
|
|
195 }
|