/* * * (C) 2003-2013 Anope Team * Contact us at team@anope.org * * Please read COPYING and README for further details. * * Based on the original code of Epona by Lara. * Based on the original code of Services by Andy Church. * */ #include "service.h" #include "access.h" #include "regchannel.h" #include "users.h" #include "account.h" Privilege::Privilege(const Anope::string &n, const Anope::string &d, int r) : name(n), desc(d), rank(r) { } bool Privilege::operator==(const Privilege &other) const { return this->name == other.name; } std::vector PrivilegeManager::Privileges; void PrivilegeManager::AddPrivilege(Privilege p) { unsigned i; for (i = 0; i < Privileges.size(); ++i) { Privilege &priv = Privileges[i]; if (priv.rank > p.rank) break; } Privileges.insert(Privileges.begin() + i, p); } void PrivilegeManager::RemovePrivilege(Privilege &p) { std::vector::iterator it = std::find(Privileges.begin(), Privileges.end(), p); if (it != Privileges.end()) Privileges.erase(it); for (registered_channel_map::const_iterator cit = RegisteredChannelList->begin(), cit_end = RegisteredChannelList->end(); cit != cit_end; ++cit) { cit->second->QueueUpdate(); cit->second->RemoveLevel(p.name); } } Privilege *PrivilegeManager::FindPrivilege(const Anope::string &name) { for (unsigned i = Privileges.size(); i > 0; --i) if (Privileges[i - 1].name.equals_ci(name)) return &Privileges[i - 1]; return NULL; } std::vector &PrivilegeManager::GetPrivileges() { return Privileges; } void PrivilegeManager::ClearPrivileges() { Privileges.clear(); } AccessProvider::AccessProvider(Module *o, const Anope::string &n) : Service(o, "AccessProvider", n) { Providers.push_back(this); } AccessProvider::~AccessProvider() { std::list::iterator it = std::find(Providers.begin(), Providers.end(), this); if (it != Providers.end()) Providers.erase(it); } std::list AccessProvider::Providers; const std::list& AccessProvider::GetProviders() { return Providers; } ChanAccess::ChanAccess(AccessProvider *p) : Serializable("ChanAccess"), provider(p) { } ChanAccess::~ChanAccess() { if (ci) ci->EraseAccess(this); } void ChanAccess::Serialize(Serialize::Data &data) const { data["provider"] << this->provider->name; data["ci"] << this->ci->name; data["mask"] << this->mask; data["creator"] << this->creator; data.SetType("last_seen", Serialize::Data::DT_INT); data["last_seen"] << this->last_seen; data.SetType("created", Serialize::Data::DT_INT); data["created"] << this->created; data["data"] << this->AccessSerialize(); } Serializable* ChanAccess::Unserialize(Serializable *obj, Serialize::Data &data) { Anope::string provider, chan; data["provider"] >> provider; data["ci"] >>chan; ServiceReference aprovider("AccessProvider", provider); ChannelInfo *ci = ChannelInfo::Find(chan); if (!aprovider || !ci) return NULL; ChanAccess *access; if (obj) access = anope_dynamic_static_cast(obj); else access = aprovider->Create(); access->ci = ci; data["mask"] >> access->mask; data["creator"] >> access->creator; data["last_seen"] >> access->last_seen; data["created"] >> access->created; Anope::string adata; data["data"] >> adata; access->AccessUnserialize(adata); if (!obj) ci->AddAccess(access); return access; } bool ChanAccess::Matches(const User *u, const NickCore *nc) const { bool is_mask = this->mask.find_first_of("!@?*") != Anope::string::npos; if (u && is_mask && Anope::Match(u->nick, this->mask)) return true; else if (u && Anope::Match(u->GetDisplayedMask(), this->mask)) return true; else if (nc) for (std::list >::const_iterator it = nc->aliases.begin(); it != nc->aliases.end();) { const NickAlias *na = *it++; if (na && Anope::Match(na->nick, this->mask)) return true; } return false; } bool ChanAccess::operator>(const ChanAccess &other) const { const std::vector &privs = PrivilegeManager::GetPrivileges(); for (unsigned i = privs.size(); i > 0; --i) { bool this_p = this->HasPriv(privs[i - 1].name), other_p = other.HasPriv(privs[i - 1].name); if (!this_p && !other_p) continue; else if (this_p && !other_p) return true; else return false; } return false; } bool ChanAccess::operator<(const ChanAccess &other) const { const std::vector &privs = PrivilegeManager::GetPrivileges(); for (unsigned i = privs.size(); i > 0; --i) { bool this_p = this->HasPriv(privs[i - 1].name), other_p = other.HasPriv(privs[i - 1].name); if (!this_p && !other_p) continue; else if (!this_p && other_p) return true; else return false; } return false; } bool ChanAccess::operator>=(const ChanAccess &other) const { const std::vector &privs = PrivilegeManager::GetPrivileges(); for (unsigned i = privs.size(); i > 0; --i) { bool this_p = this->HasPriv(privs[i - 1].name), other_p = other.HasPriv(privs[i - 1].name); if (!this_p && !other_p) continue; else if (!this_p && other_p) return false; else return true; } return true; } bool ChanAccess::operator<=(const ChanAccess &other) const { const std::vector &privs = PrivilegeManager::GetPrivileges(); for (unsigned i = privs.size(); i > 0; --i) { bool this_p = this->HasPriv(privs[i - 1].name), other_p = other.HasPriv(privs[i - 1].name); if (!this_p && !other_p) continue; else if (this_p && !other_p) return false; else return true; } return true; } AccessGroup::AccessGroup() : std::vector() { this->ci = NULL; this->nc = NULL; this->super_admin = this->founder = false; } bool AccessGroup::HasPriv(const Anope::string &name) const { if (this->super_admin) return true; else if (ci->GetLevel(name) == ACCESS_INVALID) return false; else if (this->founder) return true; EventReturn MOD_RESULT; FOREACH_RESULT(I_OnGroupCheckPriv, OnGroupCheckPriv(this, name)); if (MOD_RESULT != EVENT_CONTINUE) return MOD_RESULT == EVENT_ALLOW; for (unsigned i = this->size(); i > 0; --i) { ChanAccess *access = this->at(i - 1); FOREACH_RESULT(I_OnCheckPriv, OnCheckPriv(access, name)); if (MOD_RESULT == EVENT_ALLOW || access->HasPriv(name)) return true; } return false; } const ChanAccess *AccessGroup::Highest() const { const std::vector &privs = PrivilegeManager::GetPrivileges(); for (unsigned i = privs.size(); i > 0; --i) for (unsigned j = this->size(); j > 0; --j) if (this->at(j - 1)->HasPriv(privs[i - 1].name)) return this->at(j - 1); return NULL; } bool AccessGroup::operator>(const AccessGroup &other) const { if (this->super_admin) return true; else if (other.super_admin) return false; else if (this->founder && !other.founder) return true; else if (!this->founder && other.founder) return false; const std::vector &privs = PrivilegeManager::GetPrivileges(); for (unsigned i = privs.size(); i > 0; --i) { bool this_p = this->HasPriv(privs[i - 1].name), other_p = other.HasPriv(privs[i - 1].name); if (!this_p && !other_p) continue; else if (this_p && !other_p) return true; else return false; } return false; } bool AccessGroup::operator<(const AccessGroup &other) const { if (other.super_admin) return true; else if (this->super_admin) return false; else if (other.founder && !this->founder) return true; else if (this->founder && !other.founder) return false; const std::vector &privs = PrivilegeManager::GetPrivileges(); for (unsigned i = privs.size(); i > 0; --i) { bool this_p = this->HasPriv(privs[i - 1].name), other_p = other.HasPriv(privs[i - 1].name); if (!this_p && !other_p) continue; else if (!this_p && other_p) return true; else return false; } return false; } bool AccessGroup::operator>=(const AccessGroup &other) const { if (this->super_admin) return true; else if (other.super_admin) return false; else if (this->founder) return true; else if (other.founder) return false; const std::vector &privs = PrivilegeManager::GetPrivileges(); for (unsigned i = privs.size(); i > 0; --i) { bool this_p = this->HasPriv(privs[i - 1].name), other_p = other.HasPriv(privs[i - 1].name); if (!this_p && !other_p) continue; else if (other_p && !this_p) return false; else return true; } return true; } bool AccessGroup::operator<=(const AccessGroup &other) const { if (other.super_admin) return true; else if (this->super_admin) return false; else if (other.founder) return true; else if (this->founder) return false; const std::vector &privs = PrivilegeManager::GetPrivileges(); for (unsigned i = privs.size(); i > 0; --i) { bool this_p = this->HasPriv(privs[i - 1].name), other_p = other.HasPriv(privs[i - 1].name); if (!this_p && !other_p) continue; else if (this_p && !other_p) return false; else return true; } return true; }