Suggest URLs for updated setup based on build architecture

[cygwin-apps/setup.git] / package_db.cc

/*
 * Copyright (c) 2001, 2003 Robert Collins.
 *
 *     This program is free software; you can redistribute it and/or modify
 *     it under the terms of the GNU General Public License as published by
 *     the Free Software Foundation; either version 2 of the License, or
 *     (at your option) any later version.
 *
 *     A copy of the GNU General Public License can be found at
 *     http://www.gnu.org/
 *
 * Written by Robert Collins  <rbtcollins@hotmail.com>
 *
 */

/* this is the package database class.
 * It lists all known packages, including custom ones, ones from a mirror and
 * installed ones.
 */

#include <stdio.h>
#include <stdlib.h>
#include <unistd.h>
#include <strings.h>
#include <algorithm>
#include <sstream>
#if HAVE_ERRNO_H
#include <errno.h>
#endif

#include "io_stream.h"
#include "compress.h"

#include "filemanip.h"
#include "package_version.h"
#include "package_db.h"
#include "package_meta.h"
#include "Exception.h"
#include "Generic.h"
#include "LogSingleton.h"
#include "resource.h"
#include "libsolv.h"
#include "csu_util/version_compare.h"
#include "getopt++/BoolOption.h"

static BoolOption MirrorOption (false, 'm', "mirror-mode", IDS_HELPTEXT_MIRROR_MODE);

packagedb::packagedb ()
{
}

void
packagedb::init ()
{
  installeddbread = 0;
  installeddbver = 0;
  prepped = false;

  packages.clear();
  sourcePackages.clear();
  categories.clear();
  solver.clear();
  solution.clear();
  basepkg = packageversion();
  dependencyOrderedPackages.clear();
}

void
packagedb::read ()
{
  if (!installeddbread)
    {
      /* Read in the local installation database. */
      io_stream *db = 0;
      db = io_stream::open ("cygfile:///etc/setup/installed.db", "rt", 0);
      installeddbread = 1;
      if (!db)
	return;
      char line[1000], pkgname[1000];

      if (db->gets (line, 1000))
	{
	  /* Look for header line (absent in version 1) */
	  int instsz;
	  int dbver;
	  sscanf (line, "%s %d", pkgname, &instsz);
	  if (!strcasecmp (pkgname, "INSTALLED.DB"))
	    dbver = instsz;
	  else
	    dbver = 1;
	  delete db;
	  db = 0;

	  Log (LOG_BABBLE) << "INSTALLED.DB version " << dbver << endLog;

	  if (dbver <= 3)
	    {
	      char inst[1000];

	      db =
		io_stream::open ("cygfile:///etc/setup/installed.db", "rt", 0);

	      // skip over already-parsed header line
	      if (dbver >= 2)
		db->gets (line, 1000);

	      while (db->gets (line, 1000))
		{
		  int parseable;
		  int user_picked = 0;
		  pkgname[0] = '\0';
		  inst[0] = '\0';

		  int res = sscanf (line, "%s %s %d", pkgname, inst, &user_picked);

		  if (res < 3 || pkgname[0] == '\0' || inst[0] == '\0')
			continue;

		  fileparse f;
		  parseable = parse_filename (inst, f);
		  if (!parseable)
		    continue;

                  SolverPool::addPackageData data;
                  data.reponame = "_installed";
                  data.version = f.ver;
                  data.type = package_binary;

                  // very limited information is available from installed.db, so
                  // we put our best guesses here...
                  data.vendor = "cygwin";
                  data.requires = NULL;
                  data.obsoletes = NULL;
                  data.provides = NULL;
                  data.conflicts = NULL;
                  data.sdesc = "";
                  data.ldesc = "";
                  data.stability = TRUST_UNKNOWN;
                  data.spkg = PackageSpecification(std::string(pkgname) + "-src", f.ver);

                  // supplement this with sdesc, source, and stability
                  // information from setup.ini, if possible...
                  packageversion pv = findBinaryVersion(PackageSpecification(pkgname, f.ver));
                  PackageDepends dep;
                  PackageDepends obs;
                  PackageDepends prov;
                  PackageDepends conf;
                  if (pv)
                    {
                      data.sdesc = pv.SDesc();
                      data.ldesc = pv.LDesc();
                      data.archive = *pv.source();
                      data.stability = pv.Stability();
                      data.spkg_id = pv.sourcePackage();
                      data.spkg = pv.sourcePackageName();
                      dep = pv.depends();
                      data.requires = &dep;
                      obs = pv.obsoletes();
                      data.obsoletes = &obs;
                      prov = pv.provides();
                      data.provides = &prov;
                      conf = pv.conflicts();
                      data.conflicts = &conf;
                    }
                  else
                    // This version is no longer available.  It could
                    // be old, or it could be a previous test release
                    // that has been replaced by a new test release.
                    // Try to get some info from the packagemeta.
                    {
                      packagemeta *pkgm = findBinary(PackageSpecification(pkgname));
                      if (pkgm)
                        {
                          data.sdesc = pkgm->curr.SDesc();
                          data.ldesc = pkgm->curr.LDesc();
                          if (pkgm->curr
                              && version_compare (f.ver, pkgm->curr.Canonical_version()) > 0)
                            data.stability = TRUST_TEST;
                        }
                    }

                  packagemeta *pkg = packagedb::addBinary (pkgname, data);

                  pkg->set_installed_version (f.ver);

		  if (dbver == 3)
		    pkg->user_picked = (user_picked & 1);

		}
	      delete db;
	      db = 0;
	    }
	  else
	    {
              fatal(NULL, IDS_INSTALLEDB_VERSION);
	    }

	  installeddbver = dbver;
	}
    }
  solver.internalize();
}

/* Create the fictitious basepkg */
void
packagedb::makeBase()
{
  SolverPool::addPackageData data;
  data.reponame = "_installed";
  data.version = "0.0-0";
  data.type = package_binary;
  data.vendor = "cygwin";
  data.sdesc = "Ficitious package that requires all Base packages";
  data.ldesc = "Ficitious package that requires all Base packages";
  data.obsoletes = NULL;
  data.provides = NULL;
  data.conflicts = NULL;
  data.stability = TRUST_CURR;
  // data.spkg = PackageSpecification();
  // data.spkg_id = packageversion();

  PackageDepends dep;
  for (std::vector <packagemeta *>::const_iterator i = categories["Base"].begin();
       i != categories["Base"].end(); i++)
    {
      packagemeta *pkg = *i;
      PackageSpecification *spec = new PackageSpecification(pkg->name);
      dep.push_back(spec);
    }
  data.requires = &dep;

  basepkg = solver.addPackage("base", data);
  /* We don't register this in packagemeta */
}

/* Create the fictitious windows package */
void
packagedb::makeWindows()
{
  std::stringstream v;
  v << OSMajorVersion() << "." << OSMinorVersion() << "." << OSBuildNumber();

  SolverPool::addPackageData data;
  data.reponame = "_installed";
  data.version = v.str();
  data.type = package_binary;
  data.vendor = "cygwin";
  data.sdesc = "Ficitious package indicating Windows version";
  data.ldesc = "Ficitious package indicating Windows version";
  data.requires = NULL;
  data.obsoletes = NULL;
  data.provides = NULL;
  data.conflicts = NULL;
  data.stability = TRUST_CURR;

  solver.addPackage("_windows", data);
  /* We don't register this in packagemeta */
}

/* Add a package version to the packagedb */
packagemeta *
packagedb::addBinary (const std::string &pkgname,
                      const SolverPool::addPackageData &pkgdata)
{
  /* If pkgname isn't already in packagedb, add a packagemeta */
  packagemeta *pkg = findBinary (PackageSpecification(pkgname));
  if (!pkg)
    {
      pkg = new packagemeta (pkgname);
      packages.insert (packagedb::packagecollection::value_type(pkgname, pkg));
    }

  /* Create the SolvableVersion and register it in packagemeta */
  pkg->add_version (pkgdata);

  return pkg;
}

packageversion
packagedb::addSource (const std::string &pkgname,
                      const SolverPool::addPackageData &pkgdata)
{
  /* If pkgname isn't already in packagedb, add a packagemeta */
  packagemeta *pkg = findSource (PackageSpecification(pkgname));
  if (!pkg)
    {
      pkg = new packagemeta (pkgname);
      sourcePackages.insert (packagedb::packagecollection::value_type(pkgname, pkg));
    }

  /* Create the SolvableVersion and register it in packagemeta */
  SolvableVersion sv = pkg->add_version (pkgdata);

  return sv;
}

int
packagedb::flush ()
{
  /* naive approach - just dump the lot */
  char const *odbn = "cygfile:///etc/setup/installed.db";
  char const *ndbn = "cygfile:///etc/setup/installed.db.new";

  io_stream::mkpath_p (PATH_TO_FILE, ndbn, 0755);

  io_stream *ndb = io_stream::open (ndbn, "wb", 0644);

  // XXX if this failed, try removing any existing .new database?
  if (!ndb)
    return errno ? errno : 1;

  ndb->write ("INSTALLED.DB 3\n", strlen ("INSTALLED.DB 3\n"));
  for (packagedb::packagecollection::iterator i = packages.begin ();
       i != packages.end (); ++i)
    {
      packagemeta & pkgm = *(i->second);
      if (pkgm.installed)
	{
	  /*
	    In INSTALLED.DB 3, lines are: 'packagename version flags', where
	    version is encoded in a notional filename for backwards
	    compatibility, and the only currently defined flag is user-picked
	    (bit 0).
	  */
	  std::string line;
	  line = pkgm.name + " " +
	    pkgm.name + "-" + std::string(pkgm.installed.Canonical_version()) + ".tar.bz2 " +
	    (pkgm.user_picked ? "1" : "0") + "\n";
	  ndb->write (line.c_str(), line.size());
	}
    }

  delete ndb;

  io_stream::remove (odbn);

  if (io_stream::move (ndbn, odbn))
    return errno ? errno : 1;
  return 0;
}

void
packagedb::upgrade()
{
  if (installeddbver < 3)
    {
      /* Guess which packages were user_picked.  This has to take place after
         setup.ini has been parsed as it needs dependency information. */
      guessUserPicked();
      installeddbver = 3;
    }
}

packagemeta *
packagedb::findBinary (PackageSpecification const &spec) const
{
  packagedb::packagecollection::iterator n = packages.find(spec.packageName());
  if (n != packages.end())
    {
      packagemeta & pkgm = *(n->second);
      for (std::set<packageversion>::iterator i=pkgm.versions.begin();
	  i != pkgm.versions.end(); ++i)
	if (spec.satisfies (*i))
	  return &pkgm;
    }
  return NULL;
}

packageversion
packagedb::findBinaryVersion (PackageSpecification const &spec) const
{
  packagedb::packagecollection::iterator n = packages.find(spec.packageName());
  if (n != packages.end())
    {
      packagemeta & pkgm = *(n->second);
      for (std::set<packageversion>::iterator i=pkgm.versions.begin();
          i != pkgm.versions.end(); ++i)
        if (spec.satisfies (*i))
          return *i;
    }
  return packageversion();
}

packagemeta *
packagedb::findSource (PackageSpecification const &spec) const
{
  packagedb::packagecollection::iterator n = sourcePackages.find(spec.packageName());
  if (n != sourcePackages.end())
    {
      packagemeta & pkgm = *(n->second);
      for (std::set<packageversion>::iterator i = pkgm.versions.begin();
	   i != pkgm.versions.end(); ++i)
	if (spec.satisfies (*i))
	  return &pkgm;
    }
  return NULL;
}

packageversion
packagedb::findSourceVersion (PackageSpecification const &spec) const
{
  packagedb::packagecollection::iterator n = sourcePackages.find(spec.packageName());
  if (n != sourcePackages.end())
    {
      packagemeta & pkgm = *(n->second);
      for (std::set<packageversion>::iterator i = pkgm.versions.begin();
           i != pkgm.versions.end(); ++i)
        if (spec.satisfies (*i))
          return *i;
    }
  return packageversion();
}

/* static members */

int packagedb::installeddbread = 0;
int packagedb::installeddbver = 0;
bool packagedb::prepped = false;
packagedb::packagecollection packagedb::packages;
packagedb::categoriesType packagedb::categories;
packagedb::packagecollection packagedb::sourcePackages;
PackageDBActions packagedb::task = PackageDB_Install;
packageversion packagedb::basepkg;
std::vector <packagemeta *> packagedb::dependencyOrderedPackages;
SolverPool packagedb::solver;
SolverSolution packagedb::solution(packagedb::solver);

#include <stack>

class
ConnectedLoopFinder
{
public:
  ConnectedLoopFinder(void);
  void doIt(void);
private:
  size_t visit (packagemeta *pkg);

  packagedb db;
  size_t visited;

  typedef std::map<packagemeta *, size_t> visitMap;
  visitMap visitOrder;
  std::stack<packagemeta *> nodesInStronglyConnectedComponent;
};

ConnectedLoopFinder::ConnectedLoopFinder() : visited(0)
{
  for (packagedb::packagecollection::iterator i = db.packages.begin ();
       i != db.packages.end (); ++i)
    visitOrder.insert(visitMap::value_type(i->second, 0));
}

void
ConnectedLoopFinder::doIt()
{
  /* XXX this could be done useing a class to hold both the visitedInIteration and the package
   * meta reference. Then we could use a range, not an int loop. 
   */
  /* We have to expect dependency loops.  These loops break the topological
     sorting which would be a result of the below algorithm looking for
     strongly connected components in a directed graph.  Unfortunately it's
     not possible to order a directed graph with loops topologially.
     So we always have to make sure that the really important packages don't
     introduce dependency loops, since we can't do this from within setup. */
  for (packagedb::packagecollection::iterator i = db.packages.begin ();
       i != db.packages.end (); ++i)
    {
      packagemeta &pkg (*(i->second));
      if (pkg.installed && !visitOrder[&pkg])
	visit (&pkg);
    }
  Log (LOG_BABBLE) << "Visited: " << visited << " nodes out of "
                   << db.packages.size() << " while creating dependency order."
                   << endLog;
}

static bool
checkForInstalled (PackageSpecification *spec)
{
  packagedb db;
  packagemeta *required = db.findBinary (*spec);
  if (!required)
    return false;
  if (spec->satisfies (required->installed)
      && required->desired == required->installed )
    /* done, found a satisfactory installed version that will remain
       installed */
    return true;
  return false;
}

size_t
ConnectedLoopFinder::visit(packagemeta *nodeToVisit)
{
  if (!nodeToVisit->installed)
    /* Can't visit this node, and it is not less than any visted node */
    return db.packages.size() + 1;

  if (visitOrder[nodeToVisit])
    return visitOrder[nodeToVisit];

  ++visited;
  visitOrder[nodeToVisit] = visited;

#if DEBUG
  Log (LOG_PLAIN) << "visited '" << nodeToVisit->name << "', assigned id " << visited << endLog;
#endif

  size_t minimumVisitId = visited;
  nodesInStronglyConnectedComponent.push(nodeToVisit);

  /* walk through each node */
  const PackageDepends deps = nodeToVisit->installed.depends();
  PackageDepends::const_iterator dp = deps.begin();
  while (dp != deps.end())
    {
      /* check for an installed match */
      if (checkForInstalled (*dp))
	{
	  /* we found an installed ok package */
	  /* visit it if needed */
	  /* UGLY. Need to refactor. iterators in the outer would help as we could simply
	   * vist the iterator
	   */
	  const packagedb::packagecollection::iterator n = db.packages.find((*dp)->packageName());

	  if (n == db.packages.end())
	     Log (LOG_PLAIN) << "Search for package '" << (*dp)->packageName() << "' failed." << endLog;
	   else
	   {
	       packagemeta *nodeJustVisited = n->second;
	       minimumVisitId = std::min (minimumVisitId, visit (nodeJustVisited));
	   }
	}
	/* not installed or not available we ignore */
      ++dp;
    }

  if (minimumVisitId == visitOrder[nodeToVisit])
  {
    packagemeta *popped;
    do {
      popped = nodesInStronglyConnectedComponent.top();
      nodesInStronglyConnectedComponent.pop();
      db.dependencyOrderedPackages.push_back(popped);
      /* mark as displayed in a connected component */
      visitOrder[popped] = db.packages.size() + 2;
    } while (popped != nodeToVisit);
  }

  return minimumVisitId;
}

PackageDBConnectedIterator
packagedb::connectedBegin()
{
  if (!dependencyOrderedPackages.size())
    {
      ConnectedLoopFinder doMe;
      doMe.doIt();
      std::string s = "Dependency order of packages: ";
      
      for (std::vector<packagemeta *>::iterator i =
           dependencyOrderedPackages.begin();
           i != dependencyOrderedPackages.end(); ++i)
        s = s + (*i)->name + " ";
      Log (LOG_BABBLE) << s << endLog;
    }
  return dependencyOrderedPackages.begin();
}

PackageDBConnectedIterator
packagedb::connectedEnd()
{
  return dependencyOrderedPackages.end();
}

void
packagedb::setExistence ()
{
  /* binary packages */
  /* Remove packages that are in the db, not installed, and have no 
     mirror info and are not cached for both binary and source packages. */
  packagedb::packagecollection::iterator i = packages.begin ();
  while (i != packages.end ())
    {
      packagemeta & pkg = *(i->second);
      if (!pkg.installed && !pkg.accessible() && 
          !pkg.sourceAccessible() )
        {
          packagemeta *pkgm = (*i).second;
          delete pkgm;
          packages.erase (i++);
        }
      else
        ++i;
    }

#if 0
  /* remove any source packages which are not accessible */
  vector <packagemeta *>::iterator i = db.sourcePackages.begin();
  while (i != db.sourcePackages.end())
    {
      packagemeta & pkg = **i;
      if (!packageAccessible (pkg))
    {
   packagemeta *pkgm = *i;
   delete pkgm;
      i = db.sourcePackages.erase (i);
    }
      else
 ++i;
    }
#endif
}

void
packagedb::fillMissingCategory ()
{
  for (packagedb::packagecollection::iterator i = packages.begin(); i != packages.end(); i++)
    {
      if (i->second->hasNoCategories())
        i->second->setDefaultCategories();

      i->second->addToCategoryAll();
    }
}

void
packagedb::defaultTrust (SolverTasks &q, SolverSolution::updateMode mode, bool test)
{
  solution.update(q, mode, test);
  solution.augmentTasks(q);

  // reflect that task list into packagedb
  solution.trans2db();
}

void
packagedb::removeEmptyCategories()
{
  std::vector<std::string> empty;

  for (packagedb::categoriesType::iterator n = packagedb::categories.begin();
       n != packagedb::categories.end(); ++n)
    if (!n->second.size())
      {
        empty.push_back(n->first);
      }

  for (unsigned int i = 0; i < empty.size(); ++i)
    {
      packagedb::categoriesType::iterator n = packagedb::categories.find(empty[i]);
      Log (LOG_BABBLE) << "Removing empty category " << empty[i] << endLog;
      if (n != packagedb::categories.end())
        packagedb::categories.erase(n);
    }
}

void
packagedb::guessUserPicked()
{
  /*
    Assume that any non-base installed package which is a dependency of an
    installed package wasn't user_picked

    i.e. only installed packages which aren't in the base category, and aren't
    a dependency of any installed package are user_picked
  */

  /* First mark all installed non-base packages */
  for (packagedb::packagecollection::iterator i = packages.begin ();
       i != packages.end (); ++i)
    {
      packagemeta & pkgm = *(i->second);

      if (pkgm.categories.find ("Base") != pkgm.categories.end ())
	continue;

      if (pkgm.installed)
	pkgm.user_picked = TRUE;
    }

  /* Then clear the mark for all dependencies of all installed packages */
  for (packagedb::packagecollection::iterator i = packages.begin ();
       i != packages.end (); ++i)
    {
      packagemeta & pkgm = *(i->second);

      if (!pkgm.installed)
	continue;

      /* walk through each node */
      const PackageDepends deps = pkgm.installed.depends();
      std::vector <PackageSpecification *>::const_iterator dp = deps.begin();
      while (dp != deps.end())
	{
	  /* check for an installed match */
          if (checkForInstalled(*dp))
	    {
	      const packagedb::packagecollection::iterator n = packages.find((*dp)->packageName());
	      if (n != packages.end())
		{
		  packagemeta *pkgm2 = n->second;
		  pkgm2->user_picked = FALSE;
		}
	      /* skip to next and clause */
	      ++dp;
	      continue;
	    }
	  ++dp;
	}
    }
}

void
packagedb::fixup_source_package_ids()
{
  for (packagecollection::iterator i = packages.begin ();
       i != packages.end (); ++i)
    {
      packagemeta &pkgm = *(i->second);

      for (std::set<packageversion>::iterator i = pkgm.versions.begin();
           i != pkgm.versions.end(); ++i)
        {
          /* Some packages really have no source, indicated by no [sS]ource:
             line in setup.ini, which becomes an empty source package name */
          const std::string spkg = i->sourcePackageName();
          if (spkg.empty())
            continue;

          /* Otherwise, we need to find the source package and fix up the source
             package id*/
          packageversion spkg_id = findSourceVersion(PackageSpecification(spkg,
                                                                          i->Canonical_version()));

          if (spkg_id)
            {
              if (i->sourcePackage() != spkg_id)
                i->fixup_spkg_id(spkg_id);
            }
          else
            {
              Log (LOG_BABBLE) << "No source package for '" << i->Name() << "' " << i->Canonical_version() << ", source package name '" << spkg << "'" << endLog;
            }
        }
    }

  solver.internalize();
}

void
packagedb::prep()
{
  /* make packagedb ready for use for chooser */
  if (prepped)
    return;

  makeBase();
  makeWindows();
  read();
  upgrade();
  fixup_source_package_ids();
  removeEmptyCategories();

  /* XXX: this needs to be broken out somewhere where it can do progress
     reporting, as it can take a long time... */
  if (source == IDC_SOURCE_DOWNLOAD || source ==IDC_SOURCE_LOCALDIR)
    packagemeta::ScanDownloadedFiles (MirrorOption);

  setExistence ();
  fillMissingCategory ();

  prepped = true;
}

void
packagedb::noChanges ()
{
  for (packagecollection::iterator i = packages.begin();
       i != packages.end(); i++)
    {
      packagemeta *pkg = i->second;
      pkg->set_action(packagemeta::NoChange_action, pkg->installed);
      pkg->default_version = pkg->installed;
    }
}