X-Git-Url: https://git.netwichtig.de/gitweb/?a=blobdiff_plain;f=src%2Fbase.cpp;h=66a3cb140076e0db326435458b98b8b7fecf8f06;hb=a785f350fd584d87f3b84bbaff569ecb59c29f04;hp=53ebda798990c658c1ebf2c01166d5becba7ec9a;hpb=98ebe62da8fa6377863bc771a22a5d0cdce49348;p=user%2Fhenk%2Fcode%2Finspircd.git diff --git a/src/base.cpp b/src/base.cpp index 53ebda798..66a3cb140 100644 --- a/src/base.cpp +++ b/src/base.cpp @@ -1,125 +1,315 @@ -/* +------------------------------------+ - * | Inspire Internet Relay Chat Daemon | - * +------------------------------------+ +/* + * InspIRCd -- Internet Relay Chat Daemon * - * InspIRCd is copyright (C) 2002-2006 ChatSpike-Dev. - * E-mail: - * - * - * - * Written by Craig Edwards, Craig McLure, and others. - * This program is free but copyrighted software; see - * the file COPYING for details. + * Copyright (C) 2009 Daniel De Graaf + * Copyright (C) 2007 Dennis Friis + * Copyright (C) 2004-2006 Craig Edwards + * Copyright (C) 2006 Oliver Lupton * - * --------------------------------------------------- + * This file is part of InspIRCd. InspIRCd is free software: you can + * redistribute it and/or modify it under the terms of the GNU General Public + * License as published by the Free Software Foundation, version 2. + * + * This program is distributed in the hope that it will be useful, but WITHOUT + * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS + * FOR A PARTICULAR PURPOSE. See the GNU General Public License for more + * details. + * + * You should have received a copy of the GNU General Public License + * along with this program. If not, see . */ -#include "inspircd_config.h" + +#include "inspircd.h" #include "base.h" #include -#include -#include -#include -#include "inspircd.h" -#include "modules.h" -#include "helperfuncs.h" +#include -const int bitfields[] = {1,2,4,8,16,32,64,128}; -const int inverted_bitfields[] = {~1,~2,~4,~8,~16,~32,~64,~128}; +classbase::classbase() +{ + if (ServerInstance && ServerInstance->Logs) + ServerInstance->Logs->Log("CULLLIST", DEBUG, "classbase::+ @%p", (void*)this); +} + +CullResult classbase::cull() +{ + if (ServerInstance && ServerInstance->Logs) + ServerInstance->Logs->Log("CULLLIST", DEBUG, "classbase::-%s @%p", + typeid(*this).name(), (void*)this); + return CullResult(); +} + +classbase::~classbase() +{ + if (ServerInstance && ServerInstance->Logs) + ServerInstance->Logs->Log("CULLLIST", DEBUG, "classbase::~ @%p", (void*)this); +} -extern time_t TIME; +CullResult::CullResult() +{ +} + +// This trick detects heap allocations of refcountbase objects +static void* last_heap = NULL; + +void* refcountbase::operator new(size_t size) +{ + last_heap = ::operator new(size); + return last_heap; +} + +void refcountbase::operator delete(void* obj) +{ + if (last_heap == obj) + last_heap = NULL; + ::operator delete(obj); +} + +refcountbase::refcountbase() : refcount(0) +{ + if (this != last_heap) + throw CoreException("Reference allocate on the stack!"); +} -bool Extensible::Extend(const std::string &key, char* p) +refcountbase::~refcountbase() { - // only add an item if it doesnt already exist - if (this->Extension_Items.find(key) == this->Extension_Items.end()) + if (refcount && ServerInstance && ServerInstance->Logs) + ServerInstance->Logs->Log("CULLLIST", DEBUG, "refcountbase::~ @%p with refcount %d", + (void*)this, refcount); +} + +usecountbase::~usecountbase() +{ + if (usecount && ServerInstance && ServerInstance->Logs) + ServerInstance->Logs->Log("CULLLIST", DEBUG, "usecountbase::~ @%p with refcount %d", + (void*)this, usecount); +} + +ServiceProvider::~ServiceProvider() +{ +} + +ExtensionItem::ExtensionItem(const std::string& Key, Module* mod) : ServiceProvider(mod, Key, SERVICE_METADATA) +{ +} + +ExtensionItem::~ExtensionItem() +{ +} + +void* ExtensionItem::get_raw(const Extensible* container) const +{ + Extensible::ExtensibleStore::const_iterator i = + container->extensions.find(const_cast(this)); + if (i == container->extensions.end()) + return NULL; + return i->second; +} + +void* ExtensionItem::set_raw(Extensible* container, void* value) +{ + std::pair rv = + container->extensions.insert(std::make_pair(this, value)); + if (rv.second) { - this->Extension_Items[key] = p; - log(DEBUG,"Extending object with item %s",key.c_str()); - return true; + return NULL; } - // item already exists, return false - return false; + else + { + void* old = rv.first->second; + rv.first->second = value; + return old; + } +} + +void* ExtensionItem::unset_raw(Extensible* container) +{ + Extensible::ExtensibleStore::iterator i = container->extensions.find(this); + if (i == container->extensions.end()) + return NULL; + void* rv = i->second; + container->extensions.erase(i); + return rv; } -bool Extensible::Shrink(const std::string &key) +bool ExtensionManager::Register(ExtensionItem* item) { - // only attempt to remove a map item that exists - if (this->Extension_Items.find(key) != this->Extension_Items.end()) + return types.insert(std::make_pair(item->name, item)).second; +} + +void ExtensionManager::BeginUnregister(Module* module, std::vector >& list) +{ + std::map >::iterator i = types.begin(); + while (i != types.end()) { - this->Extension_Items.erase(this->Extension_Items.find(key)); - log(DEBUG,"Shrinking object with item %s",key.c_str()); - return true; + std::map >::iterator me = i++; + ExtensionItem* item = me->second; + if (item->creator == module) + { + list.push_back(item); + types.erase(me); + } } - return false; } -char* Extensible::GetExt(const std::string &key) +ExtensionItem* ExtensionManager::GetItem(const std::string& name) +{ + std::map >::iterator i = types.find(name); + if (i == types.end()) + return NULL; + return i->second; +} + +void Extensible::doUnhookExtensions(const std::vector >& toRemove) { - if (this->Extension_Items.find(key) != this->Extension_Items.end()) + for(std::vector >::const_iterator i = toRemove.begin(); i != toRemove.end(); ++i) { - return (this->Extension_Items.find(key))->second; + ExtensionItem* item = *i; + ExtensibleStore::iterator e = extensions.find(item); + if (e != extensions.end()) + { + item->free(e->second); + extensions.erase(e); + } } - return NULL; } -void Extensible::GetExtList(std::deque &list) +static struct DummyExtensionItem : LocalExtItem +{ + DummyExtensionItem() : LocalExtItem("", NULL) {} + void free(void*) {} +} dummy; + +Extensible::Extensible() +{ + extensions[&dummy] = NULL; +} + +CullResult Extensible::cull() { - for (std::map::iterator u = Extension_Items.begin(); u != Extension_Items.end(); u++) + for(ExtensibleStore::iterator i = extensions.begin(); i != extensions.end(); ++i) { - list.push_back(u->first); + i->first->free(i->second); } + extensions.clear(); + return classbase::cull(); +} + +Extensible::~Extensible() +{ + if (!extensions.empty() && ServerInstance && ServerInstance->Logs) + ServerInstance->Logs->Log("CULLLIST", DEBUG, + "Extensible destructor called without cull @%p", (void*)this); +} + +LocalExtItem::LocalExtItem(const std::string& Key, Module* mod) : ExtensionItem(Key, mod) +{ +} + +LocalExtItem::~LocalExtItem() +{ +} + +std::string LocalExtItem::serialize(SerializeFormat format, const Extensible* container, void* item) const +{ + return ""; +} + +void LocalExtItem::unserialize(SerializeFormat format, Extensible* container, const std::string& value) +{ +} + +LocalStringExt::LocalStringExt(const std::string& Key, Module* Owner) + : SimpleExtItem(Key, Owner) { } + +LocalStringExt::~LocalStringExt() +{ +} + +std::string LocalStringExt::serialize(SerializeFormat format, const Extensible* container, void* item) const +{ + if (item && format == FORMAT_USER) + return *static_cast(item); + return ""; +} + +LocalIntExt::LocalIntExt(const std::string& Key, Module* mod) : LocalExtItem(Key, mod) +{ +} + +LocalIntExt::~LocalIntExt() +{ +} + +std::string LocalIntExt::serialize(SerializeFormat format, const Extensible* container, void* item) const +{ + if (format != FORMAT_USER) + return ""; + return ConvToStr(reinterpret_cast(item)); +} + +intptr_t LocalIntExt::get(const Extensible* container) const +{ + return reinterpret_cast(get_raw(container)); +} + +intptr_t LocalIntExt::set(Extensible* container, intptr_t value) +{ + if (value) + return reinterpret_cast(set_raw(container, reinterpret_cast(value))); + else + return reinterpret_cast(unset_raw(container)); } -void BoolSet::Set(int number) +void LocalIntExt::free(void*) { - this->bits |= bitfields[number]; } -void BoolSet::Unset(int number) +StringExtItem::StringExtItem(const std::string& Key, Module* mod) : ExtensionItem(Key, mod) { - this->bits &= inverted_bitfields[number]; } -void BoolSet::Invert(int number) +StringExtItem::~StringExtItem() { - this->bits ^= bitfields[number]; } -bool BoolSet::Get(int number) +std::string* StringExtItem::get(const Extensible* container) const { - return ((this->bits | bitfields[number]) > 0); + return static_cast(get_raw(container)); } -bool BoolSet::operator==(BoolSet other) +std::string StringExtItem::serialize(SerializeFormat format, const Extensible* container, void* item) const { - return (this->bits == other.bits); + return item ? *static_cast(item) : ""; } -BoolSet BoolSet::operator|(BoolSet other) +void StringExtItem::unserialize(SerializeFormat format, Extensible* container, const std::string& value) { - BoolSet x(this->bits | other.bits); - return x; + if (value.empty()) + unset(container); + else + set(container, value); } -BoolSet BoolSet::operator&(BoolSet other) +void StringExtItem::set(Extensible* container, const std::string& value) { - BoolSet x(this->bits & other.bits); - return x; + void* old = set_raw(container, new std::string(value)); + delete static_cast(old); } -BoolSet::BoolSet() +void StringExtItem::unset(Extensible* container) { - this->bits = 0; + void* old = unset_raw(container); + delete static_cast(old); } -BoolSet::BoolSet(char bitmask) +void StringExtItem::free(void* item) { - this->bits = bitmask; + delete static_cast(item); } -bool BoolSet::operator=(BoolSet other) +ModuleException::ModuleException(const std::string &message, Module* who) + : CoreException(message, who ? who->ModuleSourceFile : "A Module") { - this->bits = other.bits; - return true; } +