tikhomirov@30: /* 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@30: */ tikhomirov@74: package org.tmatesoft.hg.console; tikhomirov@30: tikhomirov@171: import static org.tmatesoft.hg.core.Nodeid.NULL; tikhomirov@171: tikhomirov@172: import java.io.File; tikhomirov@172: import java.net.MalformedURLException; tikhomirov@171: import java.net.URL; tikhomirov@30: import java.util.Collection; tikhomirov@30: import java.util.LinkedList; tikhomirov@30: import java.util.List; tikhomirov@30: tikhomirov@171: import org.tmatesoft.hg.core.HgException; tikhomirov@74: import org.tmatesoft.hg.core.Nodeid; tikhomirov@172: import org.tmatesoft.hg.internal.ConfigFile; tikhomirov@172: import org.tmatesoft.hg.internal.Internals; tikhomirov@97: import org.tmatesoft.hg.repo.HgChangelog; tikhomirov@171: import org.tmatesoft.hg.repo.HgLookup; tikhomirov@171: import org.tmatesoft.hg.repo.HgRemoteRepository; tikhomirov@171: import org.tmatesoft.hg.repo.HgRemoteRepository.RemoteBranch; tikhomirov@74: import org.tmatesoft.hg.repo.HgRepository; tikhomirov@74: tikhomirov@30: tikhomirov@30: /** tikhomirov@74: * WORK IN PROGRESS, DO NOT USE tikhomirov@171: * hg outgoing tikhomirov@74: * tikhomirov@74: * @author Artem Tikhomirov tikhomirov@74: * @author TMate Software Ltd. tikhomirov@30: */ tikhomirov@30: public class Outgoing { tikhomirov@30: tikhomirov@30: public static void main(String[] args) throws Exception { tikhomirov@74: Options cmdLineOpts = Options.parse(args); tikhomirov@74: HgRepository hgRepo = cmdLineOpts.findRepository(); tikhomirov@30: if (hgRepo.isInvalid()) { tikhomirov@30: System.err.printf("Can't find repository in: %s\n", hgRepo.getLocation()); tikhomirov@30: return; tikhomirov@30: } tikhomirov@172: String key = "hg4j-gc"; tikhomirov@172: ConfigFile cfg = new Internals().newConfigFile(); tikhomirov@172: cfg.addLocation(new File(System.getProperty("user.home"), ".hgrc")); tikhomirov@172: String server = cfg.getSection("paths").get(key); tikhomirov@172: if (server == null) { tikhomirov@172: throw new HgException(String.format("Can't find server %s specification in the config", key)); tikhomirov@172: } tikhomirov@172: HgRemoteRepository hgRemote = new HgLookup().detect(new URL(server)); tikhomirov@171: tikhomirov@98: HgChangelog.ParentWalker pw = hgRepo.getChangelog().new ParentWalker(); tikhomirov@30: pw.init(); tikhomirov@171: tikhomirov@171: List commonKnown = findCommonWithRemote(pw, hgRemote); tikhomirov@171: dump("Nodes known to be both locally and at remote server", commonKnown); tikhomirov@171: // sanity check tikhomirov@171: for (Nodeid n : commonKnown) { tikhomirov@171: if (!pw.knownNode(n)) { tikhomirov@171: throw new HgException("Unknown node reported as common:" + n); tikhomirov@30: } tikhomirov@30: } tikhomirov@171: // find all local children of commonKnown tikhomirov@171: List result = pw.childrenOf(commonKnown); tikhomirov@171: dump("Result", result); tikhomirov@171: } tikhomirov@171: tikhomirov@171: private static List findCommonWithRemote(HgChangelog.ParentWalker pwLocal, HgRemoteRepository hgRemote) { tikhomirov@171: List remoteHeads = hgRemote.heads(); tikhomirov@171: LinkedList common = new LinkedList(); // these remotes are known in local tikhomirov@171: LinkedList toQuery = new LinkedList(); // these need further queries to find common tikhomirov@171: for (Nodeid rh : remoteHeads) { tikhomirov@171: if (pwLocal.knownNode(rh)) { tikhomirov@171: common.add(rh); tikhomirov@171: } else { tikhomirov@171: toQuery.add(rh); tikhomirov@171: } tikhomirov@171: } tikhomirov@171: if (toQuery.isEmpty()) { tikhomirov@171: return common; tikhomirov@171: } tikhomirov@171: LinkedList checkUp2Head = new LinkedList(); // branch.root and branch.head are of interest only. tikhomirov@171: // these are branches with unknown head but known root, which might not be the last common known, tikhomirov@171: // i.e. there might be children changeset that are also available at remote, [..?..common-head..remote-head] - need to tikhomirov@171: // scroll up to common head. tikhomirov@171: while (!toQuery.isEmpty()) { tikhomirov@171: List remoteBranches = hgRemote.branches(toQuery); //head, root, first parent, second parent tikhomirov@171: toQuery.clear(); tikhomirov@171: while(!remoteBranches.isEmpty()) { tikhomirov@171: RemoteBranch rb = remoteBranches.remove(0); tikhomirov@171: // I assume branches remote call gives branches with head equal to what I pass there, i.e. tikhomirov@171: // that I don't need to check whether rb.head is unknown. tikhomirov@171: if (pwLocal.knownNode(rb.root)) { tikhomirov@171: // we known branch start, common head is somewhere in its descendants line tikhomirov@171: checkUp2Head.add(rb); tikhomirov@171: } else { tikhomirov@171: // dig deeper in the history, if necessary tikhomirov@171: if (!NULL.equals(rb.p1) && !pwLocal.knownNode(rb.p1)) { tikhomirov@171: toQuery.add(rb.p1); tikhomirov@171: } tikhomirov@171: if (!NULL.equals(rb.p2) && !pwLocal.knownNode(rb.p2)) { tikhomirov@171: toQuery.add(rb.p2); tikhomirov@171: } tikhomirov@30: } tikhomirov@30: } tikhomirov@30: } tikhomirov@171: // can't check nodes between checkUp2Head element and local heads, remote might have distinct descendants sequence tikhomirov@171: for (RemoteBranch rb : checkUp2Head) { tikhomirov@171: // rb.root is known locally tikhomirov@171: List remoteRevisions = hgRemote.between(rb.root, rb.head); tikhomirov@171: if (remoteRevisions.isEmpty()) { tikhomirov@171: // head is immediate child tikhomirov@171: common.add(rb.root); tikhomirov@171: } else { tikhomirov@171: Nodeid root = rb.root; tikhomirov@171: while(!remoteRevisions.isEmpty()) { tikhomirov@171: Nodeid n = remoteRevisions.remove(0); tikhomirov@171: if (pwLocal.knownNode(n)) { tikhomirov@171: if (remoteRevisions.isEmpty()) { tikhomirov@171: // this is the last known node before an unknown tikhomirov@171: common.add(n); tikhomirov@171: break; tikhomirov@171: } tikhomirov@171: if (remoteRevisions.size() == 1) { tikhomirov@171: // there's only one left between known n and unknown head tikhomirov@171: // this check is to save extra between query, not really essential tikhomirov@171: Nodeid last = remoteRevisions.remove(0); tikhomirov@171: common.add(pwLocal.knownNode(last) ? last : n); tikhomirov@171: break; tikhomirov@171: } tikhomirov@171: // might get handy for next between query, to narrow search down tikhomirov@171: root = n; tikhomirov@171: } else { tikhomirov@171: remoteRevisions = hgRemote.between(root, n); tikhomirov@171: if (remoteRevisions.isEmpty()) { tikhomirov@171: common.add(root); tikhomirov@171: } tikhomirov@171: } tikhomirov@171: } tikhomirov@171: } tikhomirov@171: } tikhomirov@171: // TODO ensure unique elements in the list tikhomirov@171: return common; tikhomirov@30: } tikhomirov@30: tikhomirov@30: private static void dump(String s, Collection c) { tikhomirov@30: System.out.println(s); tikhomirov@30: for (Nodeid n : c) { tikhomirov@30: System.out.println(n); tikhomirov@30: } tikhomirov@30: } tikhomirov@30: }