Menu

[2d617b]: / src / HierarchyMaintainer.cpp  Maximize  Restore  History

Download this file

133 lines (107 with data), 3.7 kB

  1
  2
  3
  4
  5
  6
  7
  8
  9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
/*
* HierarchyMaintainer.cpp
*
* Copyright 2000, LifeLine Networks BV (www.lifeline.nl). All rights reserved.
* Copyright 2000, Bastiaan Bakker. All rights reserved.
*
* See the COPYING file for the terms of usage and distribution.
*/
#include "PortabilityImpl.hh"
#ifdef LOG4CPP_HAVE_IO_H
# include <io.h>
#endif
#ifdef LOG4CPP_HAVE_UNISTD_H
# include <unistd.h>
#endif
#include <cstdio>
#include <log4cpp/HierarchyMaintainer.hh>
#include <log4cpp/FileAppender.hh>
namespace log4cpp {
HierarchyMaintainer& HierarchyMaintainer::getDefaultMaintainer() {
static HierarchyMaintainer defaultMaintainer;
return defaultMaintainer;
}
HierarchyMaintainer::HierarchyMaintainer() {
}
HierarchyMaintainer::~HierarchyMaintainer() {
shutdown();
deleteAllCategories();
}
Category* HierarchyMaintainer::getExistingInstance(const std::string& name) {
threading::ScopedLock lock(_categoryMutex);
return _getExistingInstance(name);
}
Category* HierarchyMaintainer::_getExistingInstance(const std::string& name) {
Category* result = NULL;
CategoryMap::iterator i = _categoryMap.find(name);
if (_categoryMap.end() != i) {
result = (*i).second;
}
return result;
}
Category& HierarchyMaintainer::getInstance(const std::string& name) {
threading::ScopedLock lock(_categoryMutex);
return _getInstance(name);
}
/* assume lock is held */
Category& HierarchyMaintainer::_getInstance(const std::string& name) {
Category* result;
result = _getExistingInstance(name);
if (NULL == result) {
if (name == "") {
result = new Category(name, NULL, Priority::INFO);
} else {
std::string parentName;
size_t dotIndex = name.find_last_of('.');
if (name.length() <= dotIndex) {
parentName = "";
} else {
parentName = name.substr(0, dotIndex);
}
Category& parent = _getInstance(parentName);
result = new Category(name, &parent, Priority::NOTSET);
}
_categoryMap[name] = result;
}
return *result;
}
std::vector<Category*>* HierarchyMaintainer::getCurrentCategories() const {
std::vector<Category*>* categories = new std::vector<Category*>;
threading::ScopedLock lock(_categoryMutex);
{
for(CategoryMap::const_iterator i = _categoryMap.begin(); i != _categoryMap.end(); i++) {
categories->push_back((*i).second);
}
}
return categories;
}
void HierarchyMaintainer::shutdown() {
threading::ScopedLock lock(_categoryMutex);
{
for(CategoryMap::const_iterator i = _categoryMap.begin(); i != _categoryMap.end(); i++) {
((*i).second)->removeAllAppenders();
}
}
try
{
for(handlers_t::const_iterator i = handlers_.begin(), last = handlers_.end(); i != last; ++i)
(**i)();
}
catch(...)
{
}
}
void HierarchyMaintainer::register_shutdown_handler(shutdown_fun_ptr handler)
{
handlers_.push_back(handler);
}
void HierarchyMaintainer::deleteAllCategories() {
threading::ScopedLock lock(_categoryMutex);
{
for(CategoryMap::const_iterator i = _categoryMap.begin(); i != _categoryMap.end(); i++) {
delete ((*i).second);
}
_categoryMap.clear();
}
}
}
Want the latest updates on software, tech news, and AI?
Get latest updates about software, tech news, and AI from SourceForge directly in your inbox once a month.