1 /* -*- Mode: C++; tab-width: 8; indent-tabs-mode: t; c-basic-offset: 4 -*- */
4 * Copyright (C) 2008 SUSE Linux Products GmbH
6 * This program is free software; you can redistribute it and/or
7 * modify it under the terms of the GNU General Public License,
8 * version 2, as published by the Free Software Foundation.
10 * This program is distributed in the hope that it will be useful, but
11 * WITHOUT ANY WARRANTY; without even the implied warranty of
12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
13 * General Public License for more details.
15 * You should have received a copy of the GNU General Public License
16 * along with this program; if not, write to the Free Software
17 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA
22 #include <solv/solver.h>
25 #define ZYPP_USE_RESOLVER_INTERNALS
27 #include "zypp/base/Logger.h"
28 #include "zypp/solver/detail/SolverQueueItemLock.h"
30 /////////////////////////////////////////////////////////////////////////
32 { ///////////////////////////////////////////////////////////////////////
33 ///////////////////////////////////////////////////////////////////////
35 { /////////////////////////////////////////////////////////////////////
36 /////////////////////////////////////////////////////////////////////
38 { ///////////////////////////////////////////////////////////////////
42 IMPL_PTR_TYPE(SolverQueueItemLock);
44 //---------------------------------------------------------------------------
47 SolverQueueItemLock::dumpOn( std::ostream & os ) const
49 os << "[" << (_soft?"Soft":"") << "Lock: " <<
55 //---------------------------------------------------------------------------
57 SolverQueueItemLock::SolverQueueItemLock (const ResPool & pool,
58 const PoolItem & item, bool soft)
59 : SolverQueueItem (QUEUE_ITEM_TYPE_LOCK, pool)
66 SolverQueueItemLock::~SolverQueueItemLock()
70 //---------------------------------------------------------------------------
72 bool SolverQueueItemLock::addRule (sat::detail::CQueue & q)
74 ::Id id = _item.satSolvable().id();
76 ERR << "Lock : " << _item << " not found" << endl;
79 MIL << "Lock " << _item << " with the SAT-Pool ID: " << id << endl;
80 if (_item.status().isInstalled()) {
82 queue_push( &(q), SOLVER_INSTALL | SOLVER_SOLVABLE | SOLVER_WEAK );
84 queue_push( &(q), SOLVER_INSTALL | SOLVER_SOLVABLE );
88 queue_push( &(q), SOLVER_ERASE | SOLVER_SOLVABLE | SOLVER_WEAK );
90 queue_push( &(q), SOLVER_ERASE | SOLVER_SOLVABLE );
93 queue_push( &(q), id );
98 SolverQueueItemLock::copy (void) const
100 SolverQueueItemLock_Ptr new_lock = new SolverQueueItemLock (pool(), _item);
101 new_lock->SolverQueueItem::copy(this);
103 new_lock->_soft = _soft;
108 SolverQueueItemLock::cmp (SolverQueueItem_constPtr item) const
110 int cmp = this->compare (item);
113 SolverQueueItemLock_constPtr lock = dynamic_pointer_cast<const SolverQueueItemLock>(item);
114 return compareByNVRA (_item, lock->_item);
118 //---------------------------------------------------------------------------
121 ///////////////////////////////////////////////////////////////////
122 };// namespace detail
123 /////////////////////////////////////////////////////////////////////
124 /////////////////////////////////////////////////////////////////////
125 };// namespace solver
126 ///////////////////////////////////////////////////////////////////////
127 ///////////////////////////////////////////////////////////////////////
129 /////////////////////////////////////////////////////////////////////////