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 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241
|
/*
* Copyright (c) 2009 Sippy Software, Inc., http://www.sippysoft.com
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
* SUCH DAMAGE.
*
* $Id: rtpp_syslog_async.c,v 1.1.2.1 2009/10/06 09:51:28 sobomax Exp $
*
*/
#include <pthread.h>
#include <syslog.h>
#include <stdarg.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define SYSLOG_WI_POOL_SIZE 64
#define SYSLOG_WI_DATA_LEN 2048
typedef enum {
SYSLOG_ITEM_ASYNC_WRITE,
SYSLOG_ITEM_ASYNC_EXIT
} item_types;
struct syslog_wi
{
item_types item_type;
char data[SYSLOG_WI_DATA_LEN];
int len;
int priority;
struct syslog_wi *next;
};
#define SYSLOG_WI_NOWAIT 0
#define SYSLOG_WI_WAIT 1
static pthread_mutex_t syslog_init_mutex = PTHREAD_MUTEX_INITIALIZER;
static int syslog_queue_inited = 0;
static pthread_t syslog_queue;
static pthread_cond_t syslog_queue_cond;
static pthread_mutex_t syslog_queue_mutex;
static pthread_cond_t syslog_wi_free_cond;
static pthread_mutex_t syslog_wi_free_mutex;
static int syslog_dropped_items;
static struct syslog_wi syslog_wi_pool[SYSLOG_WI_POOL_SIZE];
static struct syslog_wi *syslog_wi_free;
static struct syslog_wi *syslog_wi_queue, *syslog_wi_queue_tail;
static void
syslog_queue_run(void)
{
struct syslog_wi *wi;
for (;;) {
pthread_mutex_lock(&syslog_queue_mutex);
while (syslog_wi_queue == NULL) {
pthread_cond_wait(&syslog_queue_cond, &syslog_queue_mutex);
}
wi = syslog_wi_queue;
syslog_wi_queue = wi->next;
pthread_mutex_unlock(&syslog_queue_mutex);
/* main work here */
switch (wi->item_type) {
case SYSLOG_ITEM_ASYNC_WRITE:
syslog(wi->priority, wi->data);
break;
case SYSLOG_ITEM_ASYNC_EXIT:
return;
default:
break;
}
/* put wi into syslog_wi_free' tail */
pthread_mutex_lock(&syslog_wi_free_mutex);
wi->next = syslog_wi_free;
syslog_wi_free = wi;
pthread_cond_signal(&syslog_wi_free_cond);
pthread_mutex_unlock(&syslog_wi_free_mutex);
}
}
static int
syslog_queue_init(void)
{
int i;
memset(syslog_wi_pool, 0, sizeof(syslog_wi_pool));
for (i = 0; i < SYSLOG_WI_POOL_SIZE - 1; i++) {
syslog_wi_pool[i].next = &syslog_wi_pool[i + 1];
}
syslog_wi_pool[SYSLOG_WI_POOL_SIZE - 1].next = NULL;
syslog_wi_free = syslog_wi_pool;
syslog_wi_queue = NULL;
syslog_wi_queue_tail = NULL;
syslog_dropped_items = 0;
pthread_cond_init(&syslog_queue_cond, NULL);
pthread_mutex_init(&syslog_queue_mutex, NULL);
pthread_cond_init(&syslog_wi_free_cond, NULL);
pthread_mutex_init(&syslog_wi_free_mutex, NULL);
if (pthread_create(&syslog_queue, NULL, (void *(*)(void *))&syslog_queue_run, NULL) != 0)
return -1;
return 0;
}
static struct syslog_wi *
syslog_queue_get_free_item(int wait)
{
struct syslog_wi *wi;
pthread_mutex_lock(&syslog_wi_free_mutex);
while (syslog_wi_free == NULL) {
/* no free work items, return if no wait is requested */
if (wait == 0) {
syslog_dropped_items++;
pthread_mutex_unlock(&syslog_wi_free_mutex);
return NULL;
}
pthread_cond_wait(&syslog_wi_free_cond, &syslog_wi_free_mutex);
}
wi = syslog_wi_free;
/* move up syslog_wi_free */
syslog_wi_free = syslog_wi_free->next;
pthread_mutex_unlock(&syslog_wi_free_mutex);
return wi;
}
static void
syslog_queue_put_item(struct syslog_wi *wi)
{
pthread_mutex_lock(&syslog_queue_mutex);
wi->next = NULL;
if (syslog_wi_queue == NULL) {
syslog_wi_queue = wi;
syslog_wi_queue_tail = wi;
} else {
syslog_wi_queue_tail->next = wi;
syslog_wi_queue_tail = wi;
}
/* notify worker thread */
pthread_cond_signal(&syslog_queue_cond);
pthread_mutex_unlock(&syslog_queue_mutex);
}
static void
syslog_async_atexit(void)
{
struct syslog_wi *wi;
if (syslog_queue_inited == 0)
return;
/* Wait for the worker thread to exit */
wi = syslog_queue_get_free_item(SYSLOG_WI_WAIT);
wi->item_type = SYSLOG_ITEM_ASYNC_EXIT;
syslog_queue_put_item(wi);
pthread_join(syslog_queue, NULL);
}
int
syslog_async_init(const char *app, int facility)
{
pthread_mutex_lock(&syslog_init_mutex);
if (syslog_queue_inited == 0) {
if (syslog_queue_init() != 0) {
pthread_mutex_unlock(&syslog_init_mutex);
return -1;
}
}
syslog_queue_inited = 1;
pthread_mutex_unlock(&syslog_init_mutex);
openlog(app, LOG_PID | LOG_CONS, facility);
atexit(syslog_async_atexit);
return 0;
}
void
vsyslog_async(int priority, const char *format, va_list ap)
{
struct syslog_wi *wi;
char *p;
int s1, s2;
wi = syslog_queue_get_free_item(SYSLOG_WI_NOWAIT);
if (wi == NULL)
return;
p = wi->data;
s1 = sizeof(wi->data);
s2 = vsnprintf(p, s1, format, ap);
if (s2 >= s1) {
/* message was truncated */
s2 = s1 - 1;
p[s2] = '\0';
}
wi->len = s2;
wi->priority = priority;
wi->item_type = SYSLOG_ITEM_ASYNC_WRITE;
syslog_queue_put_item(wi);
}
|