1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
|
/*******************************************************************************
* Copyright (c) 2007, 2017 IBM Corporation and others.
*
* This program and the accompanying materials
* are made available under the terms of the Eclipse Public License 2.0
* which accompanies this distribution, and is available at
* https://www.eclipse.org/legal/epl-2.0/
*
* SPDX-License-Identifier: EPL-2.0
*
* Contributors:
* IBM Corporation - initial API and implementation
*******************************************************************************/
package org.eclipse.equinox.internal.p2.director;
import java.util.*;
import org.eclipse.equinox.p2.engine.IProvisioningPlan;
import org.eclipse.equinox.p2.metadata.*;
import org.eclipse.equinox.p2.query.*;
public class OperationGenerator {
private static final IInstallableUnit NULL_IU = MetadataFactory.createResolvedInstallableUnit(MetadataFactory.createInstallableUnit(new MetadataFactory.InstallableUnitDescription()), new IInstallableUnitFragment[0]);
private final IProvisioningPlan plan;
public OperationGenerator(IProvisioningPlan plan) {
this.plan = plan;
}
public void generateOperation(Collection<IInstallableUnit> from_, Collection<IInstallableUnit> to_) {
Collection<IInstallableUnit> intersection = new HashSet<>(from_);
intersection.retainAll(to_);
HashSet<IInstallableUnit> tmpFrom = new HashSet<>(from_);
HashSet<IInstallableUnit> tmpTo = new HashSet<>(to_);
tmpFrom.removeAll(intersection);
tmpTo.removeAll(intersection);
List<IInstallableUnit> from = new ArrayList<>(tmpFrom);
Collections.sort(from);
List<IInstallableUnit> to = new ArrayList<>(tmpTo);
Collections.sort(to);
generateUpdates(from, to);
generateInstallUninstall(from, to);
generateConfigurationChanges(to_, intersection);
}
//This generates operations that are causing the IUs to be reconfigured.
private void generateConfigurationChanges(Collection<IInstallableUnit> to_, Collection<IInstallableUnit> intersection) {
if (intersection.size() == 0)
return;
//We retain from each set the things that are the same.
//Note that despite the fact that they are the same, a different CU can be attached.
//The objects contained in the intersection are the one that were originally in the from collection.
TreeSet<IInstallableUnit> to = new TreeSet<>(to_);
for (IInstallableUnit fromIU : intersection) {
IInstallableUnit toIU = to.tailSet(fromIU).first();
generateConfigurationOperation(fromIU, toIU);
}
}
private void generateConfigurationOperation(IInstallableUnit fromIU, IInstallableUnit toIU) {
Collection<IInstallableUnitFragment> fromFragments = fromIU.getFragments();
Collection<IInstallableUnitFragment> toFragments = toIU.getFragments();
if (fromFragments == toFragments)
return;
//Check to see if the two arrays are equals independently of the order of the fragments
if (fromFragments.size() == toFragments.size() && fromFragments.containsAll(toFragments))
return;
plan.updateInstallableUnit(fromIU, toIU);
}
private void generateInstallUninstall(List<IInstallableUnit> from, List<IInstallableUnit> to) {
int toIdx = 0;
int fromIdx = 0;
while (fromIdx != from.size() && toIdx != to.size()) {
IInstallableUnit fromIU = from.get(fromIdx);
IInstallableUnit toIU = to.get(toIdx);
int comparison = toIU.compareTo(fromIU);
if (comparison < 0) {
plan.addInstallableUnit(toIU);
toIdx++;
} else if (comparison == 0) {
toIdx++;
fromIdx++;
// System.out.println("same " + fromIU);
} else {
plan.removeInstallableUnit(fromIU);
fromIdx++;
}
}
if (fromIdx != from.size()) {
for (int i = fromIdx; i < from.size(); i++) {
plan.removeInstallableUnit(from.get(i));
}
}
if (toIdx != to.size()) {
for (int i = toIdx; i < to.size(); i++) {
plan.addInstallableUnit(to.get(i));
}
}
}
private void generateUpdates(List<IInstallableUnit> from, List<IInstallableUnit> to) {
if (to.isEmpty() || from.isEmpty())
return;
Set<IInstallableUnit> processed = new HashSet<>();
Set<IInstallableUnit> removedFromTo = new HashSet<>();
QueryableArray indexedFromElements = new QueryableArray(from.toArray(new IInstallableUnit[from.size()]));
for (int toIdx = 0; toIdx < to.size(); toIdx++) {
IInstallableUnit iuTo = to.get(toIdx);
if (iuTo.getId().equals(next(to, toIdx).getId())) { //This handle the case where there are multiple versions of the same IU in the target. Eg we are trying to update from A 1.0.0 to A 1.1.1 and A 1.2.2
toIdx = skip(to, iuTo, toIdx) - 1;
//System.out.println("Can't update " + iuTo + " because another iu with same id is in the target state");
continue;
}
if (iuTo.getUpdateDescriptor() == null)
continue;
//TODO we eventually need to handle the case where an IU is a merge of several others.
IQuery<IInstallableUnit> updateQuery = QueryUtil.createMatchQuery(iuTo.getUpdateDescriptor().getIUsBeingUpdated().iterator().next(), new Object[0]);
iuTo.getUpdateDescriptor().getIUsBeingUpdated();
IQueryResult<IInstallableUnit> updates = indexedFromElements.query(updateQuery, null);
if (updates.isEmpty()) { //Nothing to update from.
continue;
}
Iterator<IInstallableUnit> updatesIterator = updates.iterator();
IInstallableUnit iuFrom = updatesIterator.next();
if (updatesIterator.hasNext()) { //There are multiple IUs to update from
//System.out.println("Can't update " + iuTo + " because there are multiple IUs to update from (" + toString(iusFrom) + ')');
continue;
}
if (iuTo.equals(iuFrom)) {
from.remove(iuFrom);
// fromIdIndexList.remove(iuFrom);
removedFromTo.add(iuTo);
continue;
}
plan.updateInstallableUnit(iuFrom, iuTo);
from.remove(iuFrom);
// fromIdIndexList.remove(iuFrom);
processed.add(iuTo);
}
to.removeAll(processed);
to.removeAll(removedFromTo);
}
private IInstallableUnit next(List<IInstallableUnit> l, int i) {
i++;
if (i >= l.size())
return NULL_IU;
return l.get(i);
}
private int skip(List<IInstallableUnit> c, IInstallableUnit id, int idx) {
int i = idx;
for (; i < c.size(); i++) {
if (!id.getId().equals(c.get(i).getId()))
return i;
}
return i;
}
}
|
