kuser/ku_group.cpp

   1 /*
   2  *  Copyright (c) 1998 Denis Perchine <dyp@perchine.com>
   3  *  Copyright (c) 2004 Szombathelyi GyĂśrgy <gyurco@freemail.hu>
   4  *  Former maintainer: Adriaan de Groot <groot@kde.org>
   5  *
   6  *  This program is free software; you can redistribute it and/or
   7  *  modify it under the terms of the GNU General Public
   8  *  License version 2 as published by the Free Software Foundation.
   9  *
  10  *  This library is distributed in the hope that it will be useful,
  11  *  but WITHOUT ANY WARRANTY; without even the implied warranty of
  12  *  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
  13  *  Library General Public License for more details.
  14  *
  15  *  You should have received a copy of the GNU Library General Public License
  16  *  along with this library; see the file COPYING.LIB.  If not, write to
  17  *  the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor,
  18  *  Boston, MA 02110-1301, USA.
  19  **/
  20
  21 #include <kdebug.h>
  22 #include <QSharedData>
  23
  24 #include "ku_group.h"
  25
  26
  27 KU_Group_Private::KU_Group_Private()
  28 {
  29   Pwd = QString::fromLatin1("*");
  30   GID = 0;
  31   Type = 2;
  32   Caps = 0;
  33 }
  34
  35 KU_Group::KU_Group()
  36 {
  37   d = new KU_Group_Private;
  38 }
  39
  40 KU_Group::KU_Group(KU_Group *group)
  41 {
  42   d = new KU_Group_Private;
  43   copy( group );
  44 }
  45
  46 KU_Group::~KU_Group()
  47 {
  48 }
  49
  50 void KU_Group::copy( const KU_Group *group )
  51 {
  52   if ( group != this ) {
  53     *this = *group;
  54   }
  55 }
  56
  57 bool KU_Group::operator ==(const KU_Group &other) const
  58 {
  59   if ( getGID() == other.getGID() &&
  60        getName() == other.getName() )
  61     return true;
  62   else
  63     return false;
  64 }
  65
  66 KU_PROPERTY_IMPL(KU_Group,int, Caps)
  67
  68 KU_PROPERTY_IMPL(KU_Group,QString, Name)
  69 KU_PROPERTY_IMPL(KU_Group,QString, Pwd)
  70 KU_PROPERTY_IMPL(KU_Group,gid_t, GID )
  71
  72   //Samba
  73 KU_PROPERTY_IMPL(KU_Group,SID, SID)
  74 KU_PROPERTY_IMPL(KU_Group,int, Type)
  75 KU_PROPERTY_IMPL(KU_Group,QString, DisplayName)
  76 KU_PROPERTY_IMPL(KU_Group,QString, Desc)
  77
  78 bool KU_Group::lookup_user(const QString &name) const
  79 {
  80   return d->users.contains(name);
  81 }
  82
  83 bool KU_Group::addUser(const QString &name)
  84 {
  85   if (!lookup_user(name)) {
  86     d->users.append(name);
  87     return true;
  88   } else
  89     return false;
  90 }
  91
  92 bool KU_Group::removeUser(const QString &name)
  93 {
  94   return ( d->users.removeAll(name) > 0 );
  95 }
  96
  97 uint KU_Group::count() const
  98 {
  99   return d->users.count();
 100 }
 101
 102 QString KU_Group::user(uint i) const
 103 {
 104   return d->users[i];
 105 }
 106
 107 void KU_Group::clear()
 108 {
 109   d->users.clear();
 110 }
 111
 112 KU_Groups::KU_Groups(KU_PrefsBase *cfg)
 113 {
 114   mCfg = cfg;
 115 }
 116
 117 int KU_Groups::lookup(const QString &name) const
 118 {
 119   for ( int i = 0; i<count(); i++ ) {
 120     if ( at(i).getName() == name ) return i;
 121   }
 122   return -1;
 123 }
 124
 125 int KU_Groups::lookup(gid_t gid) const
 126 {
 127   for ( int i = 0; i<count(); i++ ) {
 128     if ( at(i).getGID() == gid ) return i;
 129   }
 130   return -1;
 131 }
 132
 133 int KU_Groups::lookup_sam( const SID &sid ) const
 134 {
 135   for ( int i = 0; i<count(); i++ ) {
 136     if ( at(i).getSID() == sid ) return i;
 137   }
 138   return -1;
 139 }
 140
 141 int KU_Groups::lookup_sam( const QString &sid ) const
 142 {
 143   for ( int i = 0; i<count(); i++ ) {
 144     if ( at(i).getSID().getSID() == sid ) return i;
 145   }
 146   return -1;
 147 }
 148
 149 int KU_Groups::lookup_sam( uint rid ) const
 150 {
 151   for ( int i = 0; i<count(); i++ ) {
 152     if ( at(i).getSID().getRID() == rid ) return i;
 153   }
 154   return -1;
 155 }
 156
 157 gid_t KU_Groups::first_free() const
 158 {
 159   gid_t t;
 160
 161   for (t = mCfg->firstGID(); t<65534; t++)
 162     if (lookup(t) == -1)
 163       return t;
 164
 165   return NO_FREE;
 166 }
 167
 168 uint KU_Groups::first_free_sam() const
 169 {
 170   uint t;
 171
 172   for (t = 30000; t<65534; t++)
 173     if (lookup_sam(t) == -1)
 174       return t;
 175
 176   return 0;
 177 }
 178
 179 KU_Groups::~KU_Groups()
 180 {
 181 }
 182
 183 const QString &KU_Groups::getDOMSID() const
 184 {
 185   return domsid;
 186 }
 187
 188 void KU_Groups::add(const KU_Group &group)
 189 {
 190   kDebug() << "adding group: " << group.getName() << " gid: " << group.getGID();
 191   mAdd.append( group );
 192 }
 193
 194 void KU_Groups::del(int index)
 195 {
 196   kDebug() << "deleting group: " << at(index).getName() << " gid: " << at(index).getGID();
 197   mDel.append( index );
 198 }
 199
 200 void KU_Groups::mod(int index, const KU_Group &newgroup)
 201 {
 202   kDebug() << "modify group " << newgroup.getName() << " gid: " << newgroup.getGID();
 203   mMod.insert( index, newgroup );
 204 }
 205
 206 void KU_Groups::commit()
 207 {
 208   kDebug() << "KU_Groups::commit()";
 209
 210   for ( ModList::Iterator it = mModSucc.begin(); it != mModSucc.end(); ++it ) {
 211     replace(it.key(),*it);
 212   }
 213   for ( AddList::Iterator it = mAddSucc.begin(); it != mAddSucc.end(); ++it ) {
 214     append(*it);
 215   }
 216   for ( DelList::Iterator it = mDelSucc.begin(); it != mDelSucc.end(); ++it ) {
 217     removeAt(*it);
 218   }
 219   cancelMods();
 220 }
 221
 222 void KU_Groups::cancelMods()
 223 {
 224   mAdd.clear();
 225   mDel.clear();
 226   mMod.clear();
 227 }