]> git.saurik.com Git - apt.git/blob - apt-pkg/depcache.cc
9adc4e3901f9cecab2f1cf42e770e71ff35e40fc
[apt.git] / apt-pkg / depcache.cc
1 // -*- mode: cpp; mode: fold -*-
2 // Description /*{{{*/
3 // $Id: depcache.cc,v 1.25 2001/05/27 05:36:04 jgg Exp $
4 /* ######################################################################
5
6 Dependency Cache - Caches Dependency information.
7
8 ##################################################################### */
9 /*}}}*/
10 // Include Files /*{{{*/
11 #ifdef __GNUG__
12 #pragma implementation "apt-pkg/depcache.h"
13 #endif
14 #include <apt-pkg/depcache.h>
15 #include <apt-pkg/version.h>
16 #include <apt-pkg/error.h>
17 #include <apt-pkg/sptr.h>
18 #include <apt-pkg/algorithms.h>
19
20 #include <apt-pkg/fileutl.h>
21 #include <apt-pkg/configuration.h>
22 #include <apt-pkg/tagfile.h>
23
24 #include <iostream>
25 #include <sstream>
26 #include <apti18n.h>
27 /*}}}*/
28
29 // DepCache::pkgDepCache - Constructors /*{{{*/
30 // ---------------------------------------------------------------------
31 /* */
32 pkgDepCache::pkgDepCache(pkgCache *pCache,Policy *Plcy) :
33 Cache(pCache), PkgState(0), DepState(0)
34 {
35 delLocalPolicy = 0;
36 LocalPolicy = Plcy;
37 if (LocalPolicy == 0)
38 delLocalPolicy = LocalPolicy = new Policy;
39 }
40 /*}}}*/
41 // DepCache::~pkgDepCache - Destructor /*{{{*/
42 // ---------------------------------------------------------------------
43 /* */
44 pkgDepCache::~pkgDepCache()
45 {
46 delete [] PkgState;
47 delete [] DepState;
48 delete delLocalPolicy;
49 }
50 /*}}}*/
51 // DepCache::Init - Generate the initial extra structures. /*{{{*/
52 // ---------------------------------------------------------------------
53 /* This allocats the extension buffers and initializes them. */
54 bool pkgDepCache::Init(OpProgress *Prog)
55 {
56 delete [] PkgState;
57 delete [] DepState;
58 PkgState = new StateCache[Head().PackageCount];
59 DepState = new unsigned char[Head().DependsCount];
60 memset(PkgState,0,sizeof(*PkgState)*Head().PackageCount);
61 memset(DepState,0,sizeof(*DepState)*Head().DependsCount);
62
63 if (Prog != 0)
64 {
65 Prog->OverallProgress(0,2*Head().PackageCount,Head().PackageCount,
66 _("Building dependency tree"));
67 Prog->SubProgress(Head().PackageCount,_("Candidate versions"));
68 }
69
70 /* Set the current state of everything. In this state all of the
71 packages are kept exactly as is. See AllUpgrade */
72 int Done = 0;
73 for (PkgIterator I = PkgBegin(); I.end() != true; I++,Done++)
74 {
75 if (Prog != 0)
76 Prog->Progress(Done);
77
78 // Find the proper cache slot
79 StateCache &State = PkgState[I->ID];
80 State.iFlags = 0;
81
82 // Figure out the install version
83 State.CandidateVer = GetCandidateVer(I);
84 State.InstallVer = I.CurrentVer();
85 State.Mode = ModeKeep;
86
87 State.Update(I,*this);
88 }
89
90 if (Prog != 0)
91 {
92
93 Prog->OverallProgress(Head().PackageCount,2*Head().PackageCount,
94 Head().PackageCount,
95 _("Building dependency tree"));
96 Prog->SubProgress(Head().PackageCount,_("Dependency generation"));
97 }
98
99 Update(Prog);
100
101 if(Prog != 0)
102 Prog->Done();
103
104 return true;
105 }
106 /*}}}*/
107
108 bool pkgDepCache::readStateFile(OpProgress *Prog)
109 {
110 FileFd state_file;
111 string state = _config->FindDir("Dir::State") + "pkgstates";
112 if(FileExists(state)) {
113 state_file.Open(state, FileFd::ReadOnly);
114 int file_size = state_file.Size();
115 if(Prog != NULL)
116 Prog->OverallProgress(0, file_size, 1,
117 _("Reading state information"));
118
119 pkgTagFile tagfile(&state_file);
120 pkgTagSection section;
121 int amt=0;
122 while(tagfile.Step(section)) {
123 string pkgname = section.FindS("Package");
124 pkgCache::PkgIterator pkg=Cache->FindPkg(pkgname);
125 // Silently ignore unknown packages and packages with no actual
126 // version.
127 if(!pkg.end() && !pkg.VersionList().end()) {
128 short reason = section.FindI("Auto-Installed", 0);
129 if(reason > 0)
130 PkgState[pkg->ID].Flags |= Flag::Auto;
131 if(_config->FindB("Debug::pkgAutoRemove",false))
132 std::cout << "Auto-Installed : " << pkgname << std::endl;
133 amt+=section.size();
134 if(Prog != NULL)
135 Prog->OverallProgress(amt, file_size, 1,
136 _("Reading state information"));
137 }
138 if(Prog != NULL)
139 Prog->OverallProgress(file_size, file_size, 1,
140 _("Reading state information"));
141 }
142 }
143
144 return true;
145 }
146
147 bool pkgDepCache::writeStateFile(OpProgress *prog)
148 {
149 FileFd StateFile;
150 string state = _config->FindDir("Dir::State") + "pkgstates";
151
152 if(_config->FindB("Debug::pkgAutoRemove",false))
153 std::clog << "pkgDepCache::writeStateFile()" << std::endl;
154
155 if(!StateFile.Open(state, FileFd::WriteEmpty))
156 return _error->Error(_("Failed to write StateFile %s"),
157 state.c_str());
158
159 std::ostringstream ostr;
160 for(pkgCache::PkgIterator pkg=Cache->PkgBegin(); !pkg.end();pkg++) {
161
162 if(PkgState[pkg->ID].Flags & Flag::Auto) {
163 if(_config->FindB("Debug::pkgAutoRemove",false))
164 std::clog << "AutoInstal: " << pkg.Name() << std::endl;
165 ostr.str(string(""));
166 ostr << "Package: " << pkg.Name()
167 << "\nAuto-Installed: 1\n\n";
168 StateFile.Write(ostr.str().c_str(), ostr.str().size());
169 }
170 }
171 return true;
172 }
173
174 // DepCache::CheckDep - Checks a single dependency /*{{{*/
175 // ---------------------------------------------------------------------
176 /* This first checks the dependency against the main target package and
177 then walks along the package provides list and checks if each provides
178 will be installed then checks the provides against the dep. Res will be
179 set to the package which was used to satisfy the dep. */
180 bool pkgDepCache::CheckDep(DepIterator Dep,int Type,PkgIterator &Res)
181 {
182 Res = Dep.TargetPkg();
183
184 /* Check simple depends. A depends -should- never self match but
185 we allow it anyhow because dpkg does. Technically it is a packaging
186 bug. Conflicts may never self match */
187 if (Dep.TargetPkg() != Dep.ParentPkg() ||
188 (Dep->Type != Dep::Conflicts && Dep->Type != Dep::Obsoletes))
189 {
190 PkgIterator Pkg = Dep.TargetPkg();
191 // Check the base package
192 if (Type == NowVersion && Pkg->CurrentVer != 0)
193 if (VS().CheckDep(Pkg.CurrentVer().VerStr(),Dep->CompareOp,
194 Dep.TargetVer()) == true)
195 return true;
196
197 if (Type == InstallVersion && PkgState[Pkg->ID].InstallVer != 0)
198 if (VS().CheckDep(PkgState[Pkg->ID].InstVerIter(*this).VerStr(),
199 Dep->CompareOp,Dep.TargetVer()) == true)
200 return true;
201
202 if (Type == CandidateVersion && PkgState[Pkg->ID].CandidateVer != 0)
203 if (VS().CheckDep(PkgState[Pkg->ID].CandidateVerIter(*this).VerStr(),
204 Dep->CompareOp,Dep.TargetVer()) == true)
205 return true;
206 }
207
208 if (Dep->Type == Dep::Obsoletes)
209 return false;
210
211 // Check the providing packages
212 PrvIterator P = Dep.TargetPkg().ProvidesList();
213 PkgIterator Pkg = Dep.ParentPkg();
214 for (; P.end() != true; P++)
215 {
216 /* Provides may never be applied against the same package if it is
217 a conflicts. See the comment above. */
218 if (P.OwnerPkg() == Pkg && Dep->Type == Dep::Conflicts)
219 continue;
220
221 // Check if the provides is a hit
222 if (Type == NowVersion)
223 {
224 if (P.OwnerPkg().CurrentVer() != P.OwnerVer())
225 continue;
226 }
227
228 if (Type == InstallVersion)
229 {
230 StateCache &State = PkgState[P.OwnerPkg()->ID];
231 if (State.InstallVer != (Version *)P.OwnerVer())
232 continue;
233 }
234
235 if (Type == CandidateVersion)
236 {
237 StateCache &State = PkgState[P.OwnerPkg()->ID];
238 if (State.CandidateVer != (Version *)P.OwnerVer())
239 continue;
240 }
241
242 // Compare the versions.
243 if (VS().CheckDep(P.ProvideVersion(),Dep->CompareOp,Dep.TargetVer()) == true)
244 {
245 Res = P.OwnerPkg();
246 return true;
247 }
248 }
249
250 return false;
251 }
252 /*}}}*/
253 // DepCache::AddSizes - Add the packages sizes to the counters /*{{{*/
254 // ---------------------------------------------------------------------
255 /* Call with Mult = -1 to preform the inverse opration */
256 void pkgDepCache::AddSizes(const PkgIterator &Pkg,signed long Mult)
257 {
258 StateCache &P = PkgState[Pkg->ID];
259
260 if (Pkg->VersionList == 0)
261 return;
262
263 if (Pkg.State() == pkgCache::PkgIterator::NeedsConfigure &&
264 P.Keep() == true)
265 return;
266
267 // Compute the size data
268 if (P.NewInstall() == true)
269 {
270 iUsrSize += (signed)(Mult*P.InstVerIter(*this)->InstalledSize);
271 iDownloadSize += (signed)(Mult*P.InstVerIter(*this)->Size);
272 return;
273 }
274
275 // Upgrading
276 if (Pkg->CurrentVer != 0 &&
277 (P.InstallVer != (Version *)Pkg.CurrentVer() ||
278 (P.iFlags & ReInstall) == ReInstall) && P.InstallVer != 0)
279 {
280 iUsrSize += (signed)(Mult*((signed)P.InstVerIter(*this)->InstalledSize -
281 (signed)Pkg.CurrentVer()->InstalledSize));
282 iDownloadSize += (signed)(Mult*P.InstVerIter(*this)->Size);
283 return;
284 }
285
286 // Reinstall
287 if (Pkg.State() == pkgCache::PkgIterator::NeedsUnpack &&
288 P.Delete() == false)
289 {
290 iDownloadSize += (signed)(Mult*P.InstVerIter(*this)->Size);
291 return;
292 }
293
294 // Removing
295 if (Pkg->CurrentVer != 0 && P.InstallVer == 0)
296 {
297 iUsrSize -= (signed)(Mult*Pkg.CurrentVer()->InstalledSize);
298 return;
299 }
300 }
301 /*}}}*/
302 // DepCache::AddStates - Add the package to the state counter /*{{{*/
303 // ---------------------------------------------------------------------
304 /* This routine is tricky to use, you must make sure that it is never
305 called twice for the same package. This means the Remove/Add section
306 should be as short as possible and not encompass any code that will
307 calld Remove/Add itself. Remember, dependencies can be circular so
308 while processing a dep for Pkg it is possible that Add/Remove
309 will be called on Pkg */
310 void pkgDepCache::AddStates(const PkgIterator &Pkg,int Add)
311 {
312 StateCache &State = PkgState[Pkg->ID];
313
314 // The Package is broken
315 if ((State.DepState & DepInstMin) != DepInstMin)
316 iBrokenCount += Add;
317
318 // Bad state
319 if (Pkg.State() != PkgIterator::NeedsNothing)
320 iBadCount += Add;
321
322 // Not installed
323 if (Pkg->CurrentVer == 0)
324 {
325 if (State.Mode == ModeDelete &&
326 (State.iFlags | Purge) == Purge && Pkg.Purge() == false)
327 iDelCount += Add;
328
329 if (State.Mode == ModeInstall)
330 iInstCount += Add;
331 return;
332 }
333
334 // Installed, no upgrade
335 if (State.Status == 0)
336 {
337 if (State.Mode == ModeDelete)
338 iDelCount += Add;
339 else
340 if ((State.iFlags & ReInstall) == ReInstall)
341 iInstCount += Add;
342
343 return;
344 }
345
346 // Alll 3 are possible
347 if (State.Mode == ModeDelete)
348 iDelCount += Add;
349 if (State.Mode == ModeKeep)
350 iKeepCount += Add;
351 if (State.Mode == ModeInstall)
352 iInstCount += Add;
353 }
354 /*}}}*/
355 // DepCache::BuildGroupOrs - Generate the Or group dep data /*{{{*/
356 // ---------------------------------------------------------------------
357 /* The or group results are stored in the last item of the or group. This
358 allows easy detection of the state of a whole or'd group. */
359 void pkgDepCache::BuildGroupOrs(VerIterator const &V)
360 {
361 unsigned char Group = 0;
362
363 for (DepIterator D = V.DependsList(); D.end() != true; D++)
364 {
365 // Build the dependency state.
366 unsigned char &State = DepState[D->ID];
367
368 /* Invert for Conflicts. We have to do this twice to get the
369 right sense for a conflicts group */
370 if (D->Type == Dep::Conflicts || D->Type == Dep::Obsoletes)
371 State = ~State;
372
373 // Add to the group if we are within an or..
374 State &= 0x7;
375 Group |= State;
376 State |= Group << 3;
377 if ((D->CompareOp & Dep::Or) != Dep::Or)
378 Group = 0;
379
380 // Invert for Conflicts
381 if (D->Type == Dep::Conflicts || D->Type == Dep::Obsoletes)
382 State = ~State;
383 }
384 }
385 /*}}}*/
386 // DepCache::VersionState - Perform a pass over a dependency list /*{{{*/
387 // ---------------------------------------------------------------------
388 /* This is used to run over a dependency list and determine the dep
389 state of the list, filtering it through both a Min check and a Policy
390 check. The return result will have SetMin/SetPolicy low if a check
391 fails. It uses the DepState cache for it's computations. */
392 unsigned char pkgDepCache::VersionState(DepIterator D,unsigned char Check,
393 unsigned char SetMin,
394 unsigned char SetPolicy)
395 {
396 unsigned char Dep = 0xFF;
397
398 while (D.end() != true)
399 {
400 // Compute a single dependency element (glob or)
401 DepIterator Start = D;
402 unsigned char State = 0;
403 for (bool LastOR = true; D.end() == false && LastOR == true; D++)
404 {
405 State |= DepState[D->ID];
406 LastOR = (D->CompareOp & Dep::Or) == Dep::Or;
407 }
408
409 // Minimum deps that must be satisfied to have a working package
410 if (Start.IsCritical() == true)
411 if ((State & Check) != Check)
412 Dep &= ~SetMin;
413
414 // Policy deps that must be satisfied to install the package
415 if (IsImportantDep(Start) == true &&
416 (State & Check) != Check)
417 Dep &= ~SetPolicy;
418 }
419
420 return Dep;
421 }
422 /*}}}*/
423 // DepCache::DependencyState - Compute the 3 results for a dep /*{{{*/
424 // ---------------------------------------------------------------------
425 /* This is the main dependency computation bit. It computes the 3 main
426 results for a dependencys, Now, Install and Candidate. Callers must
427 invert the result if dealing with conflicts. */
428 unsigned char pkgDepCache::DependencyState(DepIterator &D)
429 {
430 unsigned char State = 0;
431
432 if (CheckDep(D,NowVersion) == true)
433 State |= DepNow;
434 if (CheckDep(D,InstallVersion) == true)
435 State |= DepInstall;
436 if (CheckDep(D,CandidateVersion) == true)
437 State |= DepCVer;
438
439 return State;
440 }
441 /*}}}*/
442 // DepCache::UpdateVerState - Compute the Dep member of the state /*{{{*/
443 // ---------------------------------------------------------------------
444 /* This determines the combined dependency representation of a package
445 for its two states now and install. This is done by using the pre-generated
446 dependency information. */
447 void pkgDepCache::UpdateVerState(PkgIterator Pkg)
448 {
449 // Empty deps are always true
450 StateCache &State = PkgState[Pkg->ID];
451 State.DepState = 0xFF;
452
453 // Check the Current state
454 if (Pkg->CurrentVer != 0)
455 {
456 DepIterator D = Pkg.CurrentVer().DependsList();
457 State.DepState &= VersionState(D,DepNow,DepNowMin,DepNowPolicy);
458 }
459
460 /* Check the candidate state. We do not compare against the whole as
461 a candidate state but check the candidate version against the
462 install states */
463 if (State.CandidateVer != 0)
464 {
465 DepIterator D = State.CandidateVerIter(*this).DependsList();
466 State.DepState &= VersionState(D,DepInstall,DepCandMin,DepCandPolicy);
467 }
468
469 // Check target state which can only be current or installed
470 if (State.InstallVer != 0)
471 {
472 DepIterator D = State.InstVerIter(*this).DependsList();
473 State.DepState &= VersionState(D,DepInstall,DepInstMin,DepInstPolicy);
474 }
475 }
476 /*}}}*/
477 // DepCache::Update - Figure out all the state information /*{{{*/
478 // ---------------------------------------------------------------------
479 /* This will figure out the state of all the packages and all the
480 dependencies based on the current policy. */
481 void pkgDepCache::Update(OpProgress *Prog)
482 {
483 iUsrSize = 0;
484 iDownloadSize = 0;
485 iDelCount = 0;
486 iInstCount = 0;
487 iKeepCount = 0;
488 iBrokenCount = 0;
489 iBadCount = 0;
490
491 // Perform the depends pass
492 int Done = 0;
493 for (PkgIterator I = PkgBegin(); I.end() != true; I++,Done++)
494 {
495 if (Prog != 0 && Done%20 == 0)
496 Prog->Progress(Done);
497 for (VerIterator V = I.VersionList(); V.end() != true; V++)
498 {
499 unsigned char Group = 0;
500
501 for (DepIterator D = V.DependsList(); D.end() != true; D++)
502 {
503 // Build the dependency state.
504 unsigned char &State = DepState[D->ID];
505 State = DependencyState(D);
506
507 // Add to the group if we are within an or..
508 Group |= State;
509 State |= Group << 3;
510 if ((D->CompareOp & Dep::Or) != Dep::Or)
511 Group = 0;
512
513 // Invert for Conflicts
514 if (D->Type == Dep::Conflicts || D->Type == Dep::Obsoletes)
515 State = ~State;
516 }
517 }
518
519 // Compute the pacakge dependency state and size additions
520 AddSizes(I);
521 UpdateVerState(I);
522 AddStates(I);
523 }
524
525 readStateFile(Prog);
526
527 if (Prog != 0)
528 Prog->Progress(Done);
529 }
530 /*}}}*/
531 // DepCache::Update - Update the deps list of a package /*{{{*/
532 // ---------------------------------------------------------------------
533 /* This is a helper for update that only does the dep portion of the scan.
534 It is mainly ment to scan reverse dependencies. */
535 void pkgDepCache::Update(DepIterator D)
536 {
537 // Update the reverse deps
538 for (;D.end() != true; D++)
539 {
540 unsigned char &State = DepState[D->ID];
541 State = DependencyState(D);
542
543 // Invert for Conflicts
544 if (D->Type == Dep::Conflicts || D->Type == Dep::Obsoletes)
545 State = ~State;
546
547 RemoveStates(D.ParentPkg());
548 BuildGroupOrs(D.ParentVer());
549 UpdateVerState(D.ParentPkg());
550 AddStates(D.ParentPkg());
551 }
552 }
553 /*}}}*/
554 // DepCache::Update - Update the related deps of a package /*{{{*/
555 // ---------------------------------------------------------------------
556 /* This is called whenever the state of a package changes. It updates
557 all cached dependencies related to this package. */
558 void pkgDepCache::Update(PkgIterator const &Pkg)
559 {
560 // Recompute the dep of the package
561 RemoveStates(Pkg);
562 UpdateVerState(Pkg);
563 AddStates(Pkg);
564
565 // Update the reverse deps
566 Update(Pkg.RevDependsList());
567
568 // Update the provides map for the current ver
569 if (Pkg->CurrentVer != 0)
570 for (PrvIterator P = Pkg.CurrentVer().ProvidesList();
571 P.end() != true; P++)
572 Update(P.ParentPkg().RevDependsList());
573
574 // Update the provides map for the candidate ver
575 if (PkgState[Pkg->ID].CandidateVer != 0)
576 for (PrvIterator P = PkgState[Pkg->ID].CandidateVerIter(*this).ProvidesList();
577 P.end() != true; P++)
578 Update(P.ParentPkg().RevDependsList());
579 }
580
581 /*}}}*/
582
583 // DepCache::MarkKeep - Put the package in the keep state /*{{{*/
584 // ---------------------------------------------------------------------
585 /* */
586 void pkgDepCache::MarkKeep(PkgIterator const &Pkg,bool Soft)
587 {
588 // Simplifies other routines.
589 if (Pkg.end() == true)
590 return;
591
592 /* Reject an attempt to keep a non-source broken installed package, those
593 must be upgraded */
594 if (Pkg.State() == PkgIterator::NeedsUnpack &&
595 Pkg.CurrentVer().Downloadable() == false)
596 return;
597
598 /* We changed the soft state all the time so the UI is a bit nicer
599 to use */
600 StateCache &P = PkgState[Pkg->ID];
601 if (Soft == true)
602 P.iFlags |= AutoKept;
603 else
604 P.iFlags &= ~AutoKept;
605
606 // Check that it is not already kept
607 if (P.Mode == ModeKeep)
608 return;
609
610 // We dont even try to keep virtual packages..
611 if (Pkg->VersionList == 0)
612 return;
613
614 P.Flags &= ~Flag::Auto;
615 RemoveSizes(Pkg);
616 RemoveStates(Pkg);
617
618 P.Mode = ModeKeep;
619 if (Pkg->CurrentVer == 0)
620 P.InstallVer = 0;
621 else
622 P.InstallVer = Pkg.CurrentVer();
623
624 AddStates(Pkg);
625
626 Update(Pkg);
627
628 AddSizes(Pkg);
629 }
630 /*}}}*/
631 // DepCache::MarkDelete - Put the package in the delete state /*{{{*/
632 // ---------------------------------------------------------------------
633 /* */
634 void pkgDepCache::MarkDelete(PkgIterator const &Pkg, bool rPurge)
635 {
636 // Simplifies other routines.
637 if (Pkg.end() == true)
638 return;
639
640 // Check that it is not already marked for delete
641 StateCache &P = PkgState[Pkg->ID];
642 P.iFlags &= ~(AutoKept | Purge);
643 if (rPurge == true)
644 P.iFlags |= Purge;
645
646 if ((P.Mode == ModeDelete || P.InstallVer == 0) &&
647 (Pkg.Purge() == true || rPurge == false))
648 return;
649
650 // We dont even try to delete virtual packages..
651 if (Pkg->VersionList == 0)
652 return;
653
654 RemoveSizes(Pkg);
655 RemoveStates(Pkg);
656
657 if (Pkg->CurrentVer == 0 && (Pkg.Purge() == true || rPurge == false))
658 P.Mode = ModeKeep;
659 else
660 P.Mode = ModeDelete;
661 P.InstallVer = 0;
662 // This was not inverted before, but I think it should be
663 P.Flags &= ~Flag::Auto;
664
665 AddStates(Pkg);
666 Update(Pkg);
667 AddSizes(Pkg);
668 }
669 /*}}}*/
670 // DepCache::MarkInstall - Put the package in the install state /*{{{*/
671 // ---------------------------------------------------------------------
672 /* */
673 void pkgDepCache::MarkInstall(PkgIterator const &Pkg,bool AutoInst,
674 unsigned long Depth)
675 {
676 if (Depth > 100)
677 return;
678
679 // Simplifies other routines.
680 if (Pkg.end() == true)
681 return;
682
683 /* Check that it is not already marked for install and that it can be
684 installed */
685 StateCache &P = PkgState[Pkg->ID];
686 P.iFlags &= ~AutoKept;
687 if (P.InstBroken() == false && (P.Mode == ModeInstall ||
688 P.CandidateVer == (Version *)Pkg.CurrentVer()))
689 {
690 if (P.CandidateVer == (Version *)Pkg.CurrentVer() && P.InstallVer == 0)
691 MarkKeep(Pkg);
692 return;
693 }
694
695 // See if there is even any possible instalation candidate
696 if (P.CandidateVer == 0)
697 return;
698
699 // We dont even try to install virtual packages..
700 if (Pkg->VersionList == 0)
701 return;
702
703 /* Target the candidate version and remove the autoflag. We reset the
704 autoflag below if this was called recursively. Otherwise the user
705 should have the ability to de-auto a package by changing its state */
706 RemoveSizes(Pkg);
707 RemoveStates(Pkg);
708
709 P.Mode = ModeInstall;
710 P.InstallVer = P.CandidateVer;
711 P.Flags &= ~Flag::Auto;
712 if (P.CandidateVer == (Version *)Pkg.CurrentVer())
713 P.Mode = ModeKeep;
714
715 AddStates(Pkg);
716 Update(Pkg);
717 AddSizes(Pkg);
718
719 if (AutoInst == false)
720 return;
721
722 DepIterator Dep = P.InstVerIter(*this).DependsList();
723 for (; Dep.end() != true;)
724 {
725 // Grok or groups
726 DepIterator Start = Dep;
727 bool Result = true;
728 unsigned Ors = 0;
729 for (bool LastOR = true; Dep.end() == false && LastOR == true; Dep++,Ors++)
730 {
731 LastOR = (Dep->CompareOp & Dep::Or) == Dep::Or;
732
733 if ((DepState[Dep->ID] & DepInstall) == DepInstall)
734 Result = false;
735 }
736
737 // Dep is satisfied okay.
738 if (Result == false)
739 continue;
740
741 /* Check if this dep should be consider for install. If it is a user
742 defined important dep and we are installed a new package then
743 it will be installed. Otherwise we only worry about critical deps */
744 if (IsImportantDep(Start) == false)
745 continue;
746 if (Pkg->CurrentVer != 0 && Start.IsCritical() == false)
747 continue;
748
749 /* If we are in an or group locate the first or that can
750 succeed. We have already cached this.. */
751 for (; Ors > 1 && (DepState[Start->ID] & DepCVer) != DepCVer; Ors--)
752 Start++;
753
754 /* This bit is for processing the possibilty of an install/upgrade
755 fixing the problem */
756 SPtrArray<Version *> List = Start.AllTargets();
757 if ((DepState[Start->ID] & DepCVer) == DepCVer)
758 {
759 // Right, find the best version to install..
760 Version **Cur = List;
761 PkgIterator P = Start.TargetPkg();
762 PkgIterator InstPkg(*Cache,0);
763
764 // See if there are direct matches (at the start of the list)
765 for (; *Cur != 0 && (*Cur)->ParentPkg == P.Index(); Cur++)
766 {
767 PkgIterator Pkg(*Cache,Cache->PkgP + (*Cur)->ParentPkg);
768 if (PkgState[Pkg->ID].CandidateVer != *Cur)
769 continue;
770 InstPkg = Pkg;
771 break;
772 }
773
774 // Select the highest priority providing package
775 if (InstPkg.end() == true)
776 {
777 pkgPrioSortList(*Cache,Cur);
778 for (; *Cur != 0; Cur++)
779 {
780 PkgIterator Pkg(*Cache,Cache->PkgP + (*Cur)->ParentPkg);
781 if (PkgState[Pkg->ID].CandidateVer != *Cur)
782 continue;
783 InstPkg = Pkg;
784 break;
785 }
786 }
787
788 if (InstPkg.end() == false)
789 {
790 MarkInstall(InstPkg,true,Depth + 1);
791
792 // Set the autoflag, after MarkInstall because MarkInstall unsets it
793 if (P->CurrentVer == 0)
794 PkgState[InstPkg->ID].Flags |= Flag::Auto;
795 }
796
797 continue;
798 }
799
800 /* For conflicts we just de-install the package and mark as auto,
801 Conflicts may not have or groups */
802 if (Start->Type == Dep::Conflicts || Start->Type == Dep::Obsoletes)
803 {
804 for (Version **I = List; *I != 0; I++)
805 {
806 VerIterator Ver(*this,*I);
807 PkgIterator Pkg = Ver.ParentPkg();
808
809 MarkDelete(Pkg);
810 PkgState[Pkg->ID].Flags |= Flag::Auto;
811 }
812 continue;
813 }
814 }
815 }
816 /*}}}*/
817 // DepCache::SetReInstall - Set the reinstallation flag /*{{{*/
818 // ---------------------------------------------------------------------
819 /* */
820 void pkgDepCache::SetReInstall(PkgIterator const &Pkg,bool To)
821 {
822 RemoveSizes(Pkg);
823 RemoveStates(Pkg);
824
825 StateCache &P = PkgState[Pkg->ID];
826 if (To == true)
827 P.iFlags |= ReInstall;
828 else
829 P.iFlags &= ~ReInstall;
830
831 AddStates(Pkg);
832 AddSizes(Pkg);
833 }
834 /*}}}*/
835 // DepCache::SetCandidateVersion - Change the candidate version /*{{{*/
836 // ---------------------------------------------------------------------
837 /* */
838 void pkgDepCache::SetCandidateVersion(VerIterator TargetVer)
839 {
840 pkgCache::PkgIterator Pkg = TargetVer.ParentPkg();
841 StateCache &P = PkgState[Pkg->ID];
842
843 RemoveSizes(Pkg);
844 RemoveStates(Pkg);
845
846 if (P.CandidateVer == P.InstallVer)
847 P.InstallVer = (Version *)TargetVer;
848 P.CandidateVer = (Version *)TargetVer;
849 P.Update(Pkg,*this);
850
851 AddStates(Pkg);
852 Update(Pkg);
853 AddSizes(Pkg);
854 }
855 /*}}}*/
856 // StateCache::Update - Compute the various static display things /*{{{*/
857 // ---------------------------------------------------------------------
858 /* This is called whenever the Candidate version changes. */
859 void pkgDepCache::StateCache::Update(PkgIterator Pkg,pkgCache &Cache)
860 {
861 // Some info
862 VerIterator Ver = CandidateVerIter(Cache);
863
864 // Use a null string or the version string
865 if (Ver.end() == true)
866 CandVersion = "";
867 else
868 CandVersion = Ver.VerStr();
869
870 // Find the current version
871 CurVersion = "";
872 if (Pkg->CurrentVer != 0)
873 CurVersion = Pkg.CurrentVer().VerStr();
874
875 // Strip off the epochs for display
876 CurVersion = StripEpoch(CurVersion);
877 CandVersion = StripEpoch(CandVersion);
878
879 // Figure out if its up or down or equal
880 Status = Ver.CompareVer(Pkg.CurrentVer());
881 if (Pkg->CurrentVer == 0 || Pkg->VersionList == 0 || CandidateVer == 0)
882 Status = 2;
883 }
884 /*}}}*/
885 // StateCache::StripEpoch - Remove the epoch specifier from the version /*{{{*/
886 // ---------------------------------------------------------------------
887 /* */
888 const char *pkgDepCache::StateCache::StripEpoch(const char *Ver)
889 {
890 if (Ver == 0)
891 return 0;
892
893 // Strip any epoch
894 for (const char *I = Ver; *I != 0; I++)
895 if (*I == ':')
896 return I + 1;
897 return Ver;
898 }
899 /*}}}*/
900
901 // Policy::GetCandidateVer - Returns the Candidate install version /*{{{*/
902 // ---------------------------------------------------------------------
903 /* The default just returns the highest available version that is not
904 a source and automatic. */
905 pkgCache::VerIterator pkgDepCache::Policy::GetCandidateVer(PkgIterator Pkg)
906 {
907 /* Not source/not automatic versions cannot be a candidate version
908 unless they are already installed */
909 VerIterator Last(*(pkgCache *)this,0);
910
911 for (VerIterator I = Pkg.VersionList(); I.end() == false; I++)
912 {
913 if (Pkg.CurrentVer() == I)
914 return I;
915
916 for (VerFileIterator J = I.FileList(); J.end() == false; J++)
917 {
918 if ((J.File()->Flags & Flag::NotSource) != 0)
919 continue;
920
921 /* Stash the highest version of a not-automatic source, we use it
922 if there is nothing better */
923 if ((J.File()->Flags & Flag::NotAutomatic) != 0)
924 {
925 if (Last.end() == true)
926 Last = I;
927 continue;
928 }
929
930 return I;
931 }
932 }
933
934 return Last;
935 }
936 /*}}}*/
937 // Policy::IsImportantDep - True if the dependency is important /*{{{*/
938 // ---------------------------------------------------------------------
939 /* */
940 bool pkgDepCache::Policy::IsImportantDep(DepIterator Dep)
941 {
942 return Dep.IsCritical();
943 }
944 /*}}}*/