tikhomirov@31: /*
tikhomirov@74:  * Copyright (c) 2011 TMate Software Ltd
tikhomirov@74:  *  
tikhomirov@74:  * This program is free software; you can redistribute it and/or modify
tikhomirov@74:  * it under the terms of the GNU General Public License as published by
tikhomirov@74:  * the Free Software Foundation; version 2 of the License.
tikhomirov@74:  *
tikhomirov@74:  * This program is distributed in the hope that it will be useful,
tikhomirov@74:  * but WITHOUT ANY WARRANTY; without even the implied warranty of
tikhomirov@74:  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
tikhomirov@74:  * GNU General Public License for more details.
tikhomirov@74:  *
tikhomirov@74:  * For information on how to redistribute this software under
tikhomirov@74:  * the terms of a license other than GNU General Public License
tikhomirov@102:  * contact TMate Software at support@hg4j.com
tikhomirov@31:  */
tikhomirov@74: package org.tmatesoft.hg.console;
tikhomirov@31: 
tikhomirov@171: import static org.tmatesoft.hg.core.Nodeid.NULL;
tikhomirov@171: 
tikhomirov@173: import java.util.Arrays;
tikhomirov@31: import java.util.Collection;
tikhomirov@173: import java.util.Collections;
tikhomirov@173: import java.util.Comparator;
tikhomirov@31: import java.util.HashSet;
tikhomirov@173: import java.util.Iterator;
tikhomirov@173: import java.util.LinkedHashMap;
tikhomirov@31: import java.util.LinkedHashSet;
tikhomirov@31: import java.util.LinkedList;
tikhomirov@31: import java.util.List;
tikhomirov@173: import java.util.Map.Entry;
tikhomirov@173: 
tikhomirov@74: import org.tmatesoft.hg.core.Nodeid;
tikhomirov@97: import org.tmatesoft.hg.repo.HgChangelog;
tikhomirov@171: import org.tmatesoft.hg.repo.HgRemoteRepository.RemoteBranch;
tikhomirov@74: import org.tmatesoft.hg.repo.HgRepository;
tikhomirov@74: 
tikhomirov@31: 
tikhomirov@31: /**
tikhomirov@74:  * WORK IN PROGRESS, DO NOT USE
tikhomirov@173:  * hg incoming counterpart
tikhomirov@74:  * 
tikhomirov@74:  * @author Artem Tikhomirov
tikhomirov@74:  * @author TMate Software Ltd.
tikhomirov@31:  */
tikhomirov@31: public class Incoming {
tikhomirov@31: 
tikhomirov@31: 	public static void main(String[] args) throws Exception {
tikhomirov@173: 		if (Boolean.TRUE.booleanValue()) {
tikhomirov@173: 			new SequenceConstructor().test();
tikhomirov@173: 			return;
tikhomirov@173: 		}
tikhomirov@74: 		Options cmdLineOpts = Options.parse(args);
tikhomirov@74: 		HgRepository hgRepo = cmdLineOpts.findRepository();
tikhomirov@31: 		if (hgRepo.isInvalid()) {
tikhomirov@31: 			System.err.printf("Can't find repository in: %s\n", hgRepo.getLocation());
tikhomirov@31: 			return;
tikhomirov@31: 		}
tikhomirov@31: 		// in fact, all we need from changelog is set of all nodeids. However, since ParentWalker reuses same Nodeids, it's not too expensive
tikhomirov@31: 		// to reuse it here, XXX although later this may need to be refactored
tikhomirov@98: 		final HgChangelog.ParentWalker pw = hgRepo.getChangelog().new ParentWalker();
tikhomirov@31: 		pw.init();
tikhomirov@31: 		//
tikhomirov@31: 		HashSet<Nodeid> base = new HashSet<Nodeid>();
tikhomirov@31: 		HashSet<Nodeid> unknownRemoteHeads = new HashSet<Nodeid>();
tikhomirov@31: 		// imagine empty repository - any nodeid from remote heads would be unknown
tikhomirov@31: 		unknownRemoteHeads.add(Nodeid.fromAscii("382cfe9463db0484a14136e4b38407419525f0c0".getBytes(), 0, 40));
tikhomirov@31: 		//
tikhomirov@31: 		LinkedList<RemoteBranch> remoteBranches = new LinkedList<RemoteBranch>();
tikhomirov@31: 		remoteBranches(unknownRemoteHeads, remoteBranches);
tikhomirov@31: 		//
tikhomirov@31: 		HashSet<Nodeid> visited = new HashSet<Nodeid>();
tikhomirov@31: 		HashSet<RemoteBranch> processed = new HashSet<RemoteBranch>();
tikhomirov@31: 		LinkedList<Nodeid[]> toScan = new LinkedList<Nodeid[]>();
tikhomirov@31: 		LinkedHashSet<Nodeid> toFetch = new LinkedHashSet<Nodeid>();
tikhomirov@31: 		// next one seems to track heads we've asked (or plan to ask) remote.branches for
tikhomirov@31: 		HashSet<Nodeid> unknownHeads /*req*/ = new HashSet<Nodeid>(unknownRemoteHeads);
tikhomirov@31: 		while (!remoteBranches.isEmpty()) {
tikhomirov@31: 			LinkedList<Nodeid> toQueryRemote = new LinkedList<Nodeid>();
tikhomirov@31: 			while (!remoteBranches.isEmpty()) {
tikhomirov@31: 				RemoteBranch next = remoteBranches.removeFirst();
tikhomirov@31: 				if (visited.contains(next.head) || processed.contains(next)) {
tikhomirov@31: 					continue;
tikhomirov@31: 				}
tikhomirov@31: 				if (Nodeid.NULL.equals(next.head)) {
tikhomirov@31: 					// it's discovery.py that expects next.head to be nullid here, I can't imagine how this may happen, hence this exception
tikhomirov@31: 					throw new IllegalStateException("I wonder if null if may ever get here with remote branches");
tikhomirov@31: 				} else if (pw.knownNode(next.root)) {
tikhomirov@31: 					// root of the remote change is known locally, analyze to find exact missing changesets
tikhomirov@31: 					toScan.addLast(new Nodeid[] { next.head, next.root });
tikhomirov@31: 					processed.add(next);
tikhomirov@31: 				} else {
tikhomirov@31: 					if (!visited.contains(next.root) && !toFetch.contains(next.root)) {
tikhomirov@31: 						// if parents are locally known, this is new branch (sequence of changes) (sequence sprang out of known parents) 
tikhomirov@31: 						if ((next.p1 == null || pw.knownNode(next.p1)) && (next.p2 == null || pw.knownNode(next.p2))) {
tikhomirov@31: 							toFetch.add(next.root);
tikhomirov@31: 						}
tikhomirov@31: 						// XXX perhaps, may combine this parent processing below (I don't understand what this code is exactly about)
tikhomirov@31: 						if (pw.knownNode(next.p1)) {
tikhomirov@31: 							base.add(next.p1);
tikhomirov@31: 						}
tikhomirov@31: 						if (pw.knownNode(next.p2)) {
tikhomirov@31: 							base.add(next.p2);
tikhomirov@31: 						}
tikhomirov@31: 					}
tikhomirov@31: 					if (next.p1 != null && !pw.knownNode(next.p1) && !unknownHeads.contains(next.p1)) {
tikhomirov@31: 						toQueryRemote.add(next.p1);
tikhomirov@31: 						unknownHeads.add(next.p1);
tikhomirov@31: 					}
tikhomirov@31: 					if (next.p2 != null && !pw.knownNode(next.p2) && !unknownHeads.contains(next.p2)) {
tikhomirov@31: 						toQueryRemote.add(next.p2);
tikhomirov@31: 						unknownHeads.add(next.p2);
tikhomirov@31: 					}
tikhomirov@31: 				}
tikhomirov@31: 				visited.add(next.head);
tikhomirov@31: 			}
tikhomirov@31: 			if (!toQueryRemote.isEmpty()) {
tikhomirov@31: 				// discovery.py in fact does this in batches of 10 revisions a time.
tikhomirov@31: 				// however, this slicing may be done in remoteBranches call instead (if needed)
tikhomirov@31: 				remoteBranches(toQueryRemote, remoteBranches);
tikhomirov@31: 			}
tikhomirov@31: 		}
tikhomirov@31: 		while (!toScan.isEmpty()) {
tikhomirov@31: 			Nodeid[] head_root = toScan.removeFirst();
tikhomirov@31: 			List<Nodeid> nodesBetween = remoteBetween(head_root[0], head_root[1], new LinkedList<Nodeid>());
tikhomirov@31: 			nodesBetween.add(head_root[1]);
tikhomirov@31: 			int x = 1;
tikhomirov@31: 			Nodeid p = head_root[0];
tikhomirov@31: 			for (Nodeid i : nodesBetween) {
tikhomirov@31: 				System.out.println("narrowing " + x + ":" + nodesBetween.size() + " " + i.shortNotation());
tikhomirov@31: 				if (pw.knownNode(i)) {
tikhomirov@31: 					if (x <= 2) {
tikhomirov@31: 						toFetch.add(p);
tikhomirov@31: 						base.add(i);
tikhomirov@31: 					} else {
tikhomirov@31: 						// XXX original discovery.py collects new elements to scan separately
tikhomirov@31: 						// likely to "batch" calls to server
tikhomirov@31: 						System.out.println("narrowed branch search to " + p.shortNotation() + ":" + i.shortNotation());
tikhomirov@31: 						toScan.addLast(new Nodeid[] { p, i });
tikhomirov@31: 					}
tikhomirov@31: 					break;
tikhomirov@31: 				}
tikhomirov@31: 				x = x << 1;
tikhomirov@31: 				p = i;
tikhomirov@31: 			}
tikhomirov@31: 		}
tikhomirov@31: 		for (Nodeid n : toFetch) {
tikhomirov@31: 			if (pw.knownNode(n)) {
tikhomirov@31: 				System.out.println("Erroneous to fetch:" + n);
tikhomirov@31: 			} else {
tikhomirov@31: 				System.out.println(n);
tikhomirov@31: 			}
tikhomirov@31: 		}
tikhomirov@33: 		
tikhomirov@31: 	}
tikhomirov@31: 
tikhomirov@31: 
tikhomirov@31: 	private static void remoteBranches(Collection<Nodeid> unknownRemoteHeads, List<RemoteBranch> remoteBranches) {
tikhomirov@31: 		//
tikhomirov@31: 		// TODO implement this with remote access
tikhomirov@31: 		//
tikhomirov@171: 		RemoteBranch rb = new RemoteBranch(unknownRemoteHeads.iterator().next(), Nodeid.fromAscii("dbd663faec1f0175619cf7668bddc6350548b8d6"), NULL, NULL);
tikhomirov@31: 		remoteBranches.add(rb);
tikhomirov@31: 	}
tikhomirov@31: 
tikhomirov@31: 	private static List<Nodeid> remoteBetween(Nodeid nodeid1, Nodeid nodeid2, List<Nodeid> list) {
tikhomirov@31: 		// sent: cmd=between&pairs=d6d2a630f4a6d670c90a5ca909150f2b426ec88f-dbd663faec1f0175619cf7668bddc6350548b8d6
tikhomirov@31: 		// received: a78c980749e3ccebb47138b547e9b644a22797a9 286d221f6c28cbfce25ea314e1f46a23b7f979d3 fc265ddeab262ff5c34b4cf4e2522d8d41f1f05b a3576694a4d1edaa681cab15b89d6b556b02aff4
tikhomirov@31: 		// 1st, 2nd, fourth and eights of total 8 changes between rev9 and rev0
tikhomirov@31: 		//
tikhomirov@31: 		//
tikhomirov@31: 		//           a78c980749e3ccebb47138b547e9b644a22797a9 286d221f6c28cbfce25ea314e1f46a23b7f979d3 fc265ddeab262ff5c34b4cf4e2522d8d41f1f05b a3576694a4d1edaa681cab15b89d6b556b02aff4
tikhomirov@31: 		//d6d2a630f4a6d670c90a5ca909150f2b426ec88f a78c980749e3ccebb47138b547e9b644a22797a9 5abe5af181bd6a6d3e94c378376c901f0f80da50 08db726a0fb7914ac9d27ba26dc8bbf6385a0554
tikhomirov@31: 
tikhomirov@31: 		// TODO implement with remote access
tikhomirov@31: 		String response = null;
tikhomirov@31: 		if (nodeid1.equals(Nodeid.fromAscii("382cfe9463db0484a14136e4b38407419525f0c0".getBytes(), 0, 40)) && nodeid2.equals(Nodeid.fromAscii("dbd663faec1f0175619cf7668bddc6350548b8d6".getBytes(), 0, 40))) {
tikhomirov@31: 			response = "d6d2a630f4a6d670c90a5ca909150f2b426ec88f a78c980749e3ccebb47138b547e9b644a22797a9 5abe5af181bd6a6d3e94c378376c901f0f80da50 08db726a0fb7914ac9d27ba26dc8bbf6385a0554";
tikhomirov@31: 		} else if (nodeid1.equals(Nodeid.fromAscii("a78c980749e3ccebb47138b547e9b644a22797a9".getBytes(), 0, 40)) && nodeid2.equals(Nodeid.fromAscii("5abe5af181bd6a6d3e94c378376c901f0f80da50".getBytes(), 0, 40))) {
tikhomirov@31: 			response = "286d221f6c28cbfce25ea314e1f46a23b7f979d3";
tikhomirov@31: 		}
tikhomirov@31: 		if (response == null) {
tikhomirov@31: 			throw HgRepository.notImplemented();
tikhomirov@31: 		}
tikhomirov@31: 		for (String s : response.split(" ")) {
tikhomirov@31: 			list.add(Nodeid.fromAscii(s.getBytes(), 0, 40));
tikhomirov@31: 		}
tikhomirov@31: 		return list;
tikhomirov@31: 	}
tikhomirov@31: 
tikhomirov@173: 	private static class SequenceConstructor {
tikhomirov@173: 
tikhomirov@173: 		private int[] between(int root, int head) {
tikhomirov@173: 			if (head <= (root+1)) {
tikhomirov@173: 				return new int[0];
tikhomirov@173: 			}
tikhomirov@173: 			System.out.printf("[%d, %d]\t\t", root, head);
tikhomirov@173: 			int size = 1 + (int) Math.floor(Math.log(head-root - 1) / Math.log(2));
tikhomirov@173: 			int[] rv = new int[size];
tikhomirov@173: 			for (int v = 1, i = 0; i < rv.length; i++) {
tikhomirov@173: 				rv[i] = root + v;
tikhomirov@173: 				v = v << 1;
tikhomirov@173: 			}
tikhomirov@173: 			System.out.println(Arrays.toString(rv));
tikhomirov@173: 			return rv;
tikhomirov@173: 		}
tikhomirov@173: 
tikhomirov@173: 		public void test() {
tikhomirov@173: 			int root = 0, head = 1000;
tikhomirov@173: 			int[] data = between(root, head); // max number of elements to recover is 2**(1+data.length)-1, need room for 
tikhomirov@173: 			// as much elements, hence 2**(data.length+1). In worst case, when there are onlu 2**data.length + 1 missing element,
tikhomirov@173: 			// almost half of the finalSequence would be empty
tikhomirov@173: 			int[] finalSequence = new int[1 << (data.length+1) >>> 5]; // div 32 - total bits to integers
tikhomirov@173: 			int exactNumberOfElements = -1; // exact number of meaningful bits in finalSequence
tikhomirov@173: 			LinkedHashMap<Integer, int[]> datas = new LinkedHashMap<Integer, int[]>();
tikhomirov@173: 			datas.put(root, data);
tikhomirov@173: 			int totalQueries = 1;
tikhomirov@173: 			HashSet<Integer> queried = new HashSet<Integer>();
tikhomirov@173: 			int[] checkSequence = null;
tikhomirov@173: 			while(!datas.isEmpty()) {
tikhomirov@173: 				LinkedList<int[]> toQuery = new LinkedList<int[]>();
tikhomirov@173: 				do {
tikhomirov@173: 					Iterator<Entry<Integer, int[]>> it = datas.entrySet().iterator();
tikhomirov@173: 					Entry<Integer, int[]> next = it.next();
tikhomirov@173: 					int r = next.getKey();
tikhomirov@173: 					data = next.getValue();
tikhomirov@173: 					it.remove();
tikhomirov@173: 					populate(r, head, data, finalSequence);
tikhomirov@173: 					if (checkSequence != null) {
tikhomirov@173: 						boolean match = true;
tikhomirov@173: //						System.out.println("Try to match:");
tikhomirov@173: 						for (int i = 0; i < checkSequence.length; i++) {
tikhomirov@173: //							System.out.println(i);
tikhomirov@173: //							System.out.println("control:" + toBinaryString(checkSequence[i], ' '));
tikhomirov@173: //							System.out.println("present:" + toBinaryString(finalSequence[i], ' '));
tikhomirov@173: 							if (checkSequence[i] != finalSequence[i]) {
tikhomirov@173: 								match = false;
tikhomirov@173: 							} else {
tikhomirov@173: 								match &= true;
tikhomirov@173: 							}
tikhomirov@173: 						}
tikhomirov@173: 						System.out.println(match ? "Match, on query:" + totalQueries : "Didn't match");
tikhomirov@173: 					}
tikhomirov@173: 					if (data.length > 2) { 
tikhomirov@173: 						for (int x : data) {
tikhomirov@173: 							if (!queried.contains(x) && head - x > 1) { /*queries for neighboring elements is senseless*/
tikhomirov@173: 								toQuery.add(new int[] {x, head});
tikhomirov@173: 							}
tikhomirov@173: 						}
tikhomirov@173: 					}
tikhomirov@173: 				} while (!datas.isEmpty()) ;
tikhomirov@173: 				if (!toQuery.isEmpty()) {
tikhomirov@173: 					System.out.println();
tikhomirov@173: 					totalQueries++;
tikhomirov@173: 				}
tikhomirov@173: 				Collections.sort(toQuery, new Comparator<int[]>() {
tikhomirov@173: 
tikhomirov@173: 					public int compare(int[] o1, int[] o2) {
tikhomirov@173: 						return o1[0] < o2[0] ? -1 : (o1[0] == o2[0] ? 0 : 1);
tikhomirov@173: 					}
tikhomirov@173: 				});
tikhomirov@173: 				for (int[] x : toQuery) {
tikhomirov@173: 					if (!queried.contains(x[0])) {
tikhomirov@173: 						queried.add(x[0]);
tikhomirov@173: 						data = between(x[0], x[1]);
tikhomirov@173: 						if (exactNumberOfElements == -1 && data.length == 1) {
tikhomirov@173: 							exactNumberOfElements = x[0] + 1;
tikhomirov@173: 							System.out.printf("On query %d found out exact number of missing elements: %d\n", totalQueries, exactNumberOfElements);
tikhomirov@173: 							// get a bit sequence of exactNumberOfElements, 0111..110
tikhomirov@173: 							// to 'and' it with finalSequence later
tikhomirov@173: 							int totalInts = (exactNumberOfElements + 2 /*heading and tailing zero bits*/) >>> 5;
tikhomirov@173: 							int trailingBits = (exactNumberOfElements + 2) & 0x1f;
tikhomirov@173: 							if (trailingBits != 0) {
tikhomirov@173: 								totalInts++;
tikhomirov@173: 							}
tikhomirov@173: 							checkSequence = new int[totalInts];
tikhomirov@173: 							Arrays.fill(checkSequence, 0xffffffff);
tikhomirov@173: 							checkSequence[0] &= 0x7FFFFFFF;
tikhomirov@173: 							if (trailingBits == 0) {
tikhomirov@173: 								checkSequence[totalInts-1] &= 0xFFFFFFFE;
tikhomirov@173: 							} else if (trailingBits == 1) {
tikhomirov@173: 								checkSequence[totalInts-1] = 0;
tikhomirov@173: 							} else {
tikhomirov@173: 								// trailingBits include heading and trailing zero bits
tikhomirov@173: 								int mask = 0x80000000 >> trailingBits-2; // with sign!
tikhomirov@173: 								checkSequence[totalInts - 1] &= mask;
tikhomirov@173: 							}
tikhomirov@173: 							for (int e : checkSequence) {
tikhomirov@173: 								System.out.print(toBinaryString(e, ' '));
tikhomirov@173: 							}
tikhomirov@173: 							System.out.println();
tikhomirov@173: 						}
tikhomirov@173: 						datas.put(x[0], data);
tikhomirov@173: 					}
tikhomirov@173: 				}
tikhomirov@173: 			}
tikhomirov@173: 
tikhomirov@173: 			System.out.println("Total queries:" + totalQueries);
tikhomirov@173: 			for (int x : finalSequence) {
tikhomirov@173: 				System.out.print(toBinaryString(x, ' '));
tikhomirov@173: 			}
tikhomirov@173: 		}
tikhomirov@173: 		
tikhomirov@173: 		private void populate(int root, int head, int[] data, int[] finalSequence) {
tikhomirov@173: 			for (int i = 1, x = 0; root+i < head; i = i << 1, x++) {
tikhomirov@173: 				int value = data[x];
tikhomirov@173: 				int value_check = root+i;
tikhomirov@174: 				if (value != value_check) {
tikhomirov@174: 					throw new IllegalStateException();
tikhomirov@174: 				}
tikhomirov@173: 				int wordIx = (root + i) >>> 5;
tikhomirov@173: 				int bitIx = (root + i) & 0x1f;
tikhomirov@173: 				finalSequence[wordIx] |= 1 << (31-bitIx);
tikhomirov@173: 			}
tikhomirov@173: 		}
tikhomirov@173: 		
tikhomirov@173: 		private static String toBinaryString(int x, char byteSeparator) {
tikhomirov@173: 			StringBuilder sb = new StringBuilder(4*8+4);
tikhomirov@173: 			sb.append(toBinaryString((byte) (x >>> 24)));
tikhomirov@173: 			sb.append(byteSeparator);
tikhomirov@173: 			sb.append(toBinaryString((byte) ((x & 0x00ff0000) >>> 16)));
tikhomirov@173: 			sb.append(byteSeparator);
tikhomirov@173: 			sb.append(toBinaryString((byte) ((x & 0x00ff00) >>> 8)));
tikhomirov@173: 			sb.append(byteSeparator);
tikhomirov@173: 			sb.append(toBinaryString((byte) (x & 0x00ff)));
tikhomirov@173: 			sb.append(byteSeparator);
tikhomirov@173: 			return sb.toString();
tikhomirov@173: 		}
tikhomirov@173: 
tikhomirov@173: 		private static String toBinaryString(byte b) {
tikhomirov@173: 			final String nibbles = "0000000100100011010001010110011110001001101010111100110111101111";
tikhomirov@173: 			assert nibbles.length() == 16*4;
tikhomirov@173: 			int x1 = (b >>> 4) & 0x0f, x2 = b & 0x0f;
tikhomirov@173: 			x1 *= 4; x2 *= 4; // 4 characters per nibble
tikhomirov@173: 			return nibbles.substring(x1, x1+4).concat(nibbles.substring(x2, x2+4));
tikhomirov@173: 		}
tikhomirov@173: 	}
tikhomirov@31: }