Differential D8908 Diff 32112 java/src/main/java/org/softwareheritage/graph/utils/ListOriginContributors.java

Changeset View

Standalone View

java/src/main/java/org/softwareheritage/graph/utils/ListOriginContributors.java

This file was added.

				/*
				* Copyright (c) 2022 The Software Heritage developers
				* See the AUTHORS file at the top-level directory of this distribution
				* License: GNU General Public License version 3, or any later version
				* See top-level LICENSE file for more information
				*/

				/* For each origin and each person, outputs a line "origin_swhid,person_id",
				* if that person contributed to the origin.
				*
				* This takes the output of TopoSort on stdin.
				*
				*/

				package org.softwareheritage.graph.utils;

				import it.unimi.dsi.big.webgraph.LazyLongIterator;
				import org.softwareheritage.graph.*;

				import java.io.IOException;
				import java.util.HashMap;
				import java.util.HashSet;
				import java.util.Scanner;

				public class ListOriginContributors {
				/*
				* For nodes with a single ancestor, reuses the ancestor's set of contributors instead of copying,
				* when that ancestor has no more pending successors.
				*/
				private static boolean optimizeReuse = true;

				public static void main(String[] args) throws IOException, ClassNotFoundException {
				if (args.length != 1) {
				System.err.println("Syntax: java org.softwareheritage.graph.utils.FindEarliestRevision <path/to/graph>");
				System.exit(1);
				}
				String graphBasename = args[0];

				System.err.println("Loading graph " + graphBasename + " ...");
				SwhBidirectionalGraph underlyingGraph = SwhBidirectionalGraph.loadMapped(graphBasename);
				System.err.println("Loading person ids");
				underlyingGraph.loadPersonIds();
				System.err.println("Selecting subgraph.");
				Subgraph graph = new Subgraph(underlyingGraph, new AllowedNodes("rev,rel,snp,ori"));
				System.err.println("Graph loaded.");

				Scanner stdin = new Scanner(System.in);

				String firstLine = stdin.nextLine().strip();
				if (!firstLine.equals("SWHID,ancestors,successors,sample_ancestor1,sample_ancestor2")) {
				System.err.format("Unexpected header: %s\n", firstLine);
				System.exit(2);
				}

				/* Map each node id to its set of contributor person ids */
				HashMap<Long, HashSet<Long>> contributors = new HashMap<>();

				/*
				* For each node it, counts its number of direct successors that still need to be handled
				*/
				HashMap<Long, Long> pendingSuccessors = new HashMap<>();

				System.out.println("origin_SWHID,person_id");
				while (stdin.hasNextLine()) {
				String cells[] = stdin.nextLine().strip().split(",", -1);
				SWHID nodeSWHID = new SWHID(cells[0]);
				long nodeId = graph.getNodeId(nodeSWHID);
				long ancestorCount = Long.parseLong(cells[1]);
				long successorCount = Long.parseLong(cells[2]);
				String sampleAncestor1SWHID = cells[3];
				String sampleAncestor2SWHID = cells[4];

				HashSet<Long> nodeContributors;
				boolean reuseAncestorSet = optimizeReuse && (ancestorCount == 1);

				if (reuseAncestorSet) {
				long ancestorNodeId = underlyingGraph.getNodeId(new SWHID(sampleAncestor1SWHID));
				if (pendingSuccessors.get(ancestorNodeId) == 1) {
				nodeContributors = contributors.remove(ancestorNodeId);
				pendingSuccessors.remove(ancestorNodeId);
				} else {
				/* Ancestor is not yet ready to be popped */
				pendingSuccessors.put(ancestorNodeId, pendingSuccessors.get(ancestorNodeId) - 1);
				nodeContributors = new HashSet<>();
				}
				} else {
				nodeContributors = new HashSet<>();
				}

				if (nodeSWHID.getType() == SwhType.REV) {
				nodeContributors.add(underlyingGraph.getAuthorId(nodeId));
				nodeContributors.add(underlyingGraph.getCommitterId(nodeId));
				} else if (nodeSWHID.getType() == SwhType.REL) {
				nodeContributors.add(underlyingGraph.getAuthorId(nodeId));
				}

				if (!reuseAncestorSet) {
				long computedAncestorCount = 0;
				LazyLongIterator it = graph.successors(nodeId);
				for (long ancestorNodeId; (ancestorNodeId = it.nextLong()) != -1;) {
				computedAncestorCount++;
				if (pendingSuccessors.get(ancestorNodeId) == 1) {
				/*
				* If this node is the last unhandled successor of the ancestor; pop the ancestor information,
				* as we won't need it anymore
				*/
				pendingSuccessors.remove(ancestorNodeId);
				nodeContributors.addAll(contributors.remove(ancestorNodeId));
				} else {
				/*
				* The ancestor has remaining successors to handle; decrement the counter and copy its set of
				* contributors to the current set
				*/
				pendingSuccessors.put(ancestorNodeId, pendingSuccessors.get(ancestorNodeId) - 1);
				nodeContributors.addAll(contributors.get(ancestorNodeId));
				}
				}

				if (ancestorCount != computedAncestorCount) {
				System.err.format("Mismatched ancestor count: expected %d, found %d", ancestorCount,
				computedAncestorCount);
				System.exit(2);
				}
				}

				if (nodeSWHID.getType() == SwhType.ORI) {
				nodeContributors.forEach((contributorId) -> {
				System.out.format("%s,%d\n", nodeSWHID.toString(), contributorId);
				});
				}

				if (successorCount > 0) {
				/*
				* If the node has any successor, store its set of contributors for later
				*/
				contributors.put(nodeId, nodeContributors);
				pendingSuccessors.put(nodeId, successorCount);
				}
				}
				}
				}