1
0
mirror of https://github.com/moparisthebest/pacman synced 2024-12-23 16:28:50 -05:00
pacman/lib/libalpm/db.c

227 lines
5.4 KiB
C
Raw Normal View History

2005-03-14 20:51:43 -05:00
/*
* db.c
*
* Copyright (c) 2002-2006 by Judd Vinet <jvinet@zeroflux.org>
* Copyright (c) 2005 by Aurelien Foret <orelien@chez.com>
* Copyright (c) 2005 by Christian Hamar <krics@linuxforum.hu>
* Copyright (c) 2006 by David Kimpe <dnaku@frugalware.org>
* Copyright (c) 2005, 2006 by Miklos Vajna <vmiklos@frugalware.org>
2005-03-14 20:51:43 -05:00
*
* 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.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307,
* USA.
*/
#if defined(__APPLE__) || defined(__OpenBSD__)
#include <sys/syslimits.h>
#include <sys/stat.h>
#endif
2005-03-14 20:51:43 -05:00
#include "config.h"
#include <unistd.h>
#include <stdio.h>
#include <stdlib.h>
#include <errno.h>
#include <string.h>
#include <sys/stat.h>
#include <dirent.h>
2006-05-14 22:19:57 -04:00
#include <libintl.h>
#ifdef CYGWIN
#include <limits.h> /* PATH_MAX */
#endif
2005-03-14 20:51:43 -05:00
/* pacman */
#include "log.h"
2005-03-14 20:51:43 -05:00
#include "util.h"
2006-02-20 15:41:40 -05:00
#include "error.h"
#include "server.h"
2005-03-14 20:51:43 -05:00
#include "db.h"
#include "handle.h"
#include "cache.h"
#include "alpm.h"
2005-03-14 20:51:43 -05:00
pmdb_t *_alpm_db_new(char *root, char* dbpath, char *treename)
2005-03-14 20:51:43 -05:00
{
pmdb_t *db;
2006-02-20 15:41:40 -05:00
db = (pmdb_t *)malloc(sizeof(pmdb_t));
if(db == NULL) {
2006-05-14 22:19:57 -04:00
_alpm_log(PM_LOG_ERROR, _("malloc failed: could not allocate %d bytes"),
sizeof(pmdb_t));
2006-02-20 15:41:40 -05:00
RET_ERR(PM_ERR_MEMORY, NULL);
}
2005-03-14 20:51:43 -05:00
2006-03-14 17:53:42 -05:00
db->path = (char *)malloc(strlen(root)+strlen(dbpath)+strlen(treename)+2);
2006-02-20 15:41:40 -05:00
if(db->path == NULL) {
2006-05-14 22:19:57 -04:00
_alpm_log(PM_LOG_ERROR, _("malloc failed: could not allocate %d bytes"),
strlen(root)+strlen(dbpath)+strlen(treename)+2);
FREE(db);
2006-02-20 15:41:40 -05:00
RET_ERR(PM_ERR_MEMORY, NULL);
}
2006-03-14 17:53:42 -05:00
sprintf(db->path, "%s%s/%s", root, dbpath, treename);
2005-03-14 20:51:43 -05:00
STRNCPY(db->treename, treename, PATH_MAX);
2005-03-14 20:51:43 -05:00
db->pkgcache = NULL;
db->grpcache = NULL;
db->servers = NULL;
2005-03-14 20:51:43 -05:00
return(db);
}
void _alpm_db_free(void *data)
2005-03-14 20:51:43 -05:00
{
2006-02-22 15:49:33 -05:00
pmdb_t *db = data;
FREELISTSERVERS(db->servers);
FREE(db->path);
FREE(db);
return;
2005-03-14 20:51:43 -05:00
}
int _alpm_db_cmp(const void *db1, const void *db2)
{
return(strcmp(((pmdb_t *)db1)->treename, ((pmdb_t *)db2)->treename));
}
pmlist_t *_alpm_db_search(pmdb_t *db, pmlist_t *needles)
{
pmlist_t *i, *j, *k, *ret = NULL;
for(i = needles; i; i = i->next) {
char *targ;
int retval;
if(i->data == NULL) {
continue;
}
targ = strdup(i->data);
_alpm_log(PM_LOG_DEBUG, "searching for target '%s'", targ);
for(j = _alpm_db_get_pkgcache(db, INFRQ_DESC|INFRQ_DEPENDS); j; j = j->next) {
pmpkg_t *pkg = j->data;
char *haystack;
int match = 0;
/* check name */
haystack = strdup(pkg->name);
retval = _alpm_reg_match(haystack, targ);
if(retval < 0) {
/* bad regexp */
FREE(haystack);
return(NULL);
} else if(retval) {
_alpm_log(PM_LOG_DEBUG, " search target '%s' matched '%s'", targ, haystack);
match = 1;
}
FREE(haystack);
/* check description */
if(!match) {
haystack = strdup(pkg->desc);
retval = _alpm_reg_match(haystack, targ);
if(retval < 0) {
/* bad regexp */
FREE(haystack);
return(NULL);
} else if(retval) {
match = 1;
}
FREE(haystack);
}
/* check provides */
if(!match) {
for(k = pkg->provides; k; k = k->next) {
haystack = strdup(k->data);
retval = _alpm_reg_match(haystack, targ);
if(retval < 0) {
/* bad regexp */
FREE(haystack);
return(NULL);
} else if(retval) {
match = 1;
}
FREE(haystack);
}
}
if(match) {
ret = _alpm_list_add(ret, pkg);
}
}
FREE(targ);
}
return(ret);
}
pmdb_t *_alpm_db_register(char *treename, alpm_cb_db_register callback)
{
struct stat buf;
pmdb_t *db;
char path[PATH_MAX];
if(strcmp(treename, "local") == 0) {
if(handle->db_local != NULL) {
_alpm_log(PM_LOG_WARNING, _("attempt to re-register the 'local' DB"));
RET_ERR(PM_ERR_DB_NOT_NULL, NULL);
}
} else {
pmlist_t *i;
for(i = handle->dbs_sync; i; i = i->next) {
pmdb_t *sdb = i->data;
if(strcmp(treename, sdb->treename) == 0) {
_alpm_log(PM_LOG_DEBUG, _("attempt to re-register the '%s' databse, using existing"), sdb->treename);
return sdb;
}
}
}
_alpm_log(PM_LOG_FLOW1, _("registering database '%s'"), treename);
/* make sure the database directory exists */
snprintf(path, PATH_MAX, "%s%s/%s", handle->root, handle->dbpath, treename);
if(stat(path, &buf) != 0 || !S_ISDIR(buf.st_mode)) {
_alpm_log(PM_LOG_FLOW1, _("database directory '%s' does not exist -- try creating it"), path);
if(_alpm_makepath(path) != 0) {
RET_ERR(PM_ERR_SYSTEM, NULL);
}
}
db = _alpm_db_new(handle->root, handle->dbpath, treename);
if(db == NULL) {
RET_ERR(PM_ERR_DB_CREATE, NULL);
}
_alpm_log(PM_LOG_DEBUG, _("opening database '%s'"), db->treename);
if(_alpm_db_open(db) == -1) {
_alpm_db_free(db);
RET_ERR(PM_ERR_DB_OPEN, NULL);
}
/* Only call callback on NEW registration. */
if(callback) callback(treename, db);
if(strcmp(treename, "local") == 0) {
handle->db_local = db;
} else {
handle->dbs_sync = _alpm_list_add(handle->dbs_sync, db);
}
return(db);
}
/* vim: set noet: */