2 * Copyright (c) 2007-2009, Novell Inc.
4 * This program is licensed under the BSD license, read LICENSE.BSD
5 * for further information
13 #ifndef LIBSOLV_TRANSACTION_H
14 #define LIBSOLV_TRANSACTION_H
16 #include "pooltypes.h"
26 struct _TransactionOrderdata;
28 typedef struct _Transaction {
29 struct _Pool *pool; /* back pointer to pool */
31 Queue steps; /* the transaction steps */
33 #ifdef LIBSOLV_INTERNAL
34 Queue transaction_info;
35 Id *transaction_installed;
39 struct _TransactionOrderdata *orderdata;
46 #define SOLVER_TRANSACTION_IGNORE 0x00
48 #define SOLVER_TRANSACTION_ERASE 0x10
49 #define SOLVER_TRANSACTION_REINSTALLED 0x11
50 #define SOLVER_TRANSACTION_DOWNGRADED 0x12
51 #define SOLVER_TRANSACTION_CHANGED 0x13
52 #define SOLVER_TRANSACTION_UPGRADED 0x14
53 #define SOLVER_TRANSACTION_OBSOLETED 0x15
55 #define SOLVER_TRANSACTION_INSTALL 0x20
56 #define SOLVER_TRANSACTION_REINSTALL 0x21
57 #define SOLVER_TRANSACTION_DOWNGRADE 0x22
58 #define SOLVER_TRANSACTION_CHANGE 0x23
59 #define SOLVER_TRANSACTION_UPGRADE 0x24
60 #define SOLVER_TRANSACTION_OBSOLETES 0x25
62 #define SOLVER_TRANSACTION_MULTIINSTALL 0x30
63 #define SOLVER_TRANSACTION_MULTIREINSTALL 0x31
65 #define SOLVER_TRANSACTION_MAXTYPE 0x3f
68 #define SOLVER_TRANSACTION_SHOW_ACTIVE (1 << 0)
69 #define SOLVER_TRANSACTION_SHOW_ALL (1 << 1)
70 #define SOLVER_TRANSACTION_SHOW_OBSOLETES (1 << 2)
71 #define SOLVER_TRANSACTION_SHOW_MULTIINSTALL (1 << 3)
72 #define SOLVER_TRANSACTION_CHANGE_IS_REINSTALL (1 << 4)
73 #define SOLVER_TRANSACTION_MERGE_VENDORCHANGES (1 << 5)
74 #define SOLVER_TRANSACTION_MERGE_ARCHCHANGES (1 << 6)
76 #define SOLVER_TRANSACTION_RPM_ONLY (1 << 7)
78 #define SOLVER_TRANSACTION_KEEP_PSEUDO (1 << 8)
80 #define SOLVER_TRANSACTION_OBSOLETE_IS_UPGRADE (1 << 9)
82 /* extra classifications */
83 #define SOLVER_TRANSACTION_ARCHCHANGE 0x100
84 #define SOLVER_TRANSACTION_VENDORCHANGE 0x101
87 #define SOLVER_TRANSACTION_KEEP_ORDERDATA (1 << 0)
89 extern Transaction *transaction_create(struct _Pool *pool);
90 extern Transaction *transaction_create_decisionq(struct _Pool *pool, Queue *decisionq, Map *multiversionmap);
91 extern Transaction *transaction_create_clone(Transaction *srctrans);
92 extern void transaction_free(Transaction *trans);
93 extern void transaction_free_orderdata(Transaction *trans);
95 /* if p is installed, returns with pkg(s) obsolete p */
96 /* if p is not installed, returns with pkg(s) we obsolete */
97 extern Id transaction_obs_pkg(Transaction *trans, Id p);
98 extern void transaction_all_obs_pkgs(Transaction *trans, Id p, Queue *pkgs);
100 /* return step type of a transaction element */
101 extern Id transaction_type(Transaction *trans, Id p, int mode);
103 /* return sorted collection of all step types */
104 /* classify_pkgs can be used to return all packages of a type */
105 extern void transaction_classify(Transaction *trans, int mode, Queue *classes);
106 extern void transaction_classify_pkgs(Transaction *trans, int mode, Id type, Id from, Id to, Queue *pkgs);
108 /* return all packages that will be installed after the transaction is run*/
109 /* The new packages are put at the head of the queue, the number of new
110 packages is returned */
111 extern int transaction_installedresult(Transaction *trans, Queue *installedq);
113 int transaction_calc_installsizechange(Transaction *trans);
114 void transaction_calc_duchanges(Transaction *trans, struct _DUChanges *mps, int nmps);
116 /* order a transaction */
117 extern void transaction_order(Transaction *trans, int flags);
119 /* roll your own order funcion:
120 * add pkgs free for installation to queue choices after chosen was
121 * installed. start with chosen = 0
122 * needs an ordered transaction created with SOLVER_TRANSACTION_KEEP_ORDERDATA */
123 extern int transaction_order_add_choices(Transaction *trans, Id chosen, Queue *choices);
124 /* add obsoleted packages into transaction steps */
125 extern void transaction_add_obsoleted(Transaction *trans);
127 /* debug function, report problems found in the order */
128 extern void transaction_check_order(Transaction *trans);