1 /* opkg_upgrade.c - the opkg package management system
2 
3    Carl D. Worth
4    Copyright (C) 2001 University of Southern California
5 
6    Copyright (C) 2003 Daniele Nicolodi <daniele@grinta.net>
7 
8    This program is free software; you can redistribute it and/or
9    modify it under the terms of the GNU General Public License as
10    published by the Free Software Foundation; either version 2, or (at
11    your option) any later version.
12 
13    This program is distributed in the hope that it will be useful, but
14    WITHOUT ANY WARRANTY; without even the implied warranty of
15    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
16    General Public License for more details.
17 */
18 
19 #include <stdio.h>
20 #include <stdlib.h>
21 
22 #include "opkg_install.h"
23 #include "opkg_upgrade.h"
24 #include "opkg_message.h"
25 
opkg_upgrade_pkg(pkg_t * old)26 int opkg_upgrade_pkg(pkg_t * old)
27 {
28 	pkg_t *new;
29 	int cmp;
30 	char *old_version, *new_version;
31 
32 	if (old->state_flag & SF_HOLD) {
33 		opkg_msg(NOTICE, "Not upgrading package %s which is marked "
34 			 "hold (flags=%#x).\n", old->name, old->state_flag);
35 		return 0;
36 	}
37 
38 	new = pkg_hash_fetch_best_installation_candidate_by_name(old->name);
39 	if (new == NULL) {
40 		old_version = pkg_version_str_alloc(old);
41 		opkg_msg(NOTICE, "Assuming locally installed package %s (%s) "
42 			 "is up to date.\n", old->name, old_version);
43 		free(old_version);
44 		return 0;
45 	}
46 
47 	old_version = pkg_version_str_alloc(old);
48 	new_version = pkg_version_str_alloc(new);
49 
50 	cmp = pkg_compare_versions(old, new);
51 	opkg_msg(DEBUG, "Comparing visible versions of pkg %s:"
52 		 "\n\t%s is installed "
53 		 "\n\t%s is available "
54 		 "\n\t%d was comparison result\n",
55 		 old->name, old_version, new_version, cmp);
56 	if (cmp == 0) {
57 		opkg_msg(INFO,
58 			 "Package %s (%s) installed in %s is up to date.\n",
59 			 old->name, old_version, old->dest->name);
60 		free(old_version);
61 		free(new_version);
62 		return 0;
63 	} else if (cmp > 0) {
64 		opkg_msg(NOTICE,
65 			 "Not downgrading package %s on %s from %s to %s.\n",
66 			 old->name, old->dest->name, old_version, new_version);
67 		free(old_version);
68 		free(new_version);
69 		return 0;
70 	} else if (cmp < 0) {
71 		new->dest = old->dest;
72 		old->state_want = SW_DEINSTALL;
73 	}
74 
75 	free(old_version);
76 	free(new_version);
77 	new->state_flag |= SF_USER;
78 	return opkg_install_pkg(new, 1);
79 }
80 
81 static void
pkg_hash_check_installed_pkg_helper(const char * pkg_name,void * entry,void * data)82 pkg_hash_check_installed_pkg_helper(const char *pkg_name, void *entry,
83 				    void *data)
84 {
85 	struct active_list *item, *head = (struct active_list *)data;
86 	abstract_pkg_t *ab_pkg = (abstract_pkg_t *) entry;
87 	pkg_vec_t *pkg_vec = ab_pkg->pkgs;
88 	int j;
89 
90 	if (!pkg_vec)
91 		return;
92 
93 	for (j = 0; j < pkg_vec->len; j++) {
94 		pkg_t *pkg = pkg_vec->pkgs[j];
95 		if (pkg->state_status == SS_INSTALLED
96 		    || pkg->state_status == SS_UNPACKED) {
97 			item = active_list_head_new();
98 			item->pkg = pkg;
99 			active_list_add(head, item);
100 		}
101 	}
102 }
103 
prepare_upgrade_list(void)104 struct active_list *prepare_upgrade_list(void)
105 {
106 	struct active_list *head = active_list_head_new();
107 	struct active_list *all = active_list_head_new();
108 	struct active_list *node = NULL;
109 
110 	/* ensure all data is valid */
111 	pkg_info_preinstall_check();
112 
113 	hash_table_foreach(&conf->pkg_hash, pkg_hash_check_installed_pkg_helper,
114 			   all);
115 	for (node = active_list_next(all, all); node;
116 	     node = active_list_next(all, node)) {
117 		pkg_t *old, *new;
118 		int cmp;
119 
120 		old = node->pkg;
121 		new =
122 		    pkg_hash_fetch_best_installation_candidate_by_name(old->
123 								       name);
124 
125 		if (new == NULL)
126 			continue;
127 
128 		cmp = pkg_compare_versions(old, new);
129 
130 		if (cmp < 0) {
131 			node = active_list_move_node(all, head, node);
132 		}
133 	}
134 	active_list_head_delete(all);
135 	return head;
136 }
137