/* -*- Mode: C++; tab-width: 2; indent-tabs-mode: nil; c-basic-offset: 2 -*- * * XPLC - Cross-Platform Lightweight Components * Copyright (C) 2000-2003, Pierre Phaneuf * Copyright (C) 2002, Net Integration Technologies, Inc. * * This library is free software; you can redistribute it and/or * modify it under the terms of the GNU Lesser General Public License * as published by the Free Software Foundation; either version 2.1 of * the License, or (at your option) any later version. * * This library 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 * Lesser General Public License for more details. * * You should have received a copy of the GNU Lesser General Public * License along with this library; if not, write to the Free Software * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 * USA */ #include #include #include #include "statichandler.h" UUID_MAP_BEGIN(StaticServiceHandler) UUID_MAP_ENTRY(IObject) UUID_MAP_ENTRY(IServiceHandler) UUID_MAP_ENTRY(IStaticServiceHandler) UUID_MAP_END StaticServiceHandler::~StaticServiceHandler() { ObjectNode* node; ObjectNode* ptr; node = objects; while(node) { ptr = node; node = node->next; delete ptr; } objects = 0; } IObject* StaticServiceHandler::getObject(const UUID& aUuid) { ObjectNode* node; node = objects; while(node) { if(node->uuid == aUuid) { node->obj->addRef(); return node->obj; } node = node->next; } /* * No match was found, we return empty-handed. */ return 0; } void StaticServiceHandler::addObject(const UUID& aUuid, IObject* aObj) { ObjectNode* node; /* No object given? */ if(!aObj) return; node = objects; while(node) { if(node->uuid == aUuid) break; node = node->next; } /* * FIXME: maybe add a "replace" bool parameter? Or would this * encourage UUID hijacking too much? */ if(node) return; node = new ObjectNode(aUuid, aObj, objects); objects = node; } void StaticServiceHandler::removeObject(const UUID& aUuid) { ObjectNode* node; ObjectNode** ptr; node = objects; ptr = &objects; while(node) { if(node->uuid == aUuid) { *ptr = node->next; delete node; break; } ptr = &node->next; node = *ptr; } }