server/common/logger.C

/*
 * This file is part of Deliantra, the Roguelike Realtime MMORPG.
 * 
 * Copyright (©) 2005,2006,2007,2008 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
 * Copyright (©) 2002,2007 Mark Wedel & Crossfire Development Team
 * Copyright (©) 1992,2007 Frank Tore Johansen
 * 
 * Deliantra 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, either version 3 of the License, or
 * (at your option) any later version.
 * 
 * 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 <http://www.gnu.org/licenses/>.
 * 
 * The authors can be reached via e-mail to <support@deliantra.net>
 */

#include <cstdarg>
#include <cstring>

#include <vector>

#include <sys/uio.h>
#include <pthread.h>

#include "global.h"
#include "dynbuf.h"
#include "util.h"

struct logline
{
  struct timeval tv;
  char *buf; // includes PREFIX_LEN garbage bytes
  int len;
  int flags;
};

static SMUTEX(mutex);
static SCOND(cond);
static int logfd = STDERR_FILENO;
static int logsync = 1;
static std::vector<logline, slice_allocator<logline> > queue;

void set_logfd (int fd)
{
  SMUTEX_LOCK (mutex);
  logfd = fd < 0 ? STDERR_FILENO : fd;
  SMUTEX_UNLOCK (mutex);
}

#define PREFIX_LEN sizeof ("0000-00-00 00:00:00.0000+") - 1

static void
log_sync (logline &line)
{
  struct tm lt;
  char pfx [PREFIX_LEN];

  localtime_r (&line.tv.tv_sec, &lt);

  sprintf (pfx, "%04d-%02d-%02d %02d:%02d:%02d.%04d",
    lt.tm_year + 1900,
    lt.tm_mon + 1,
    lt.tm_mday,
    lt.tm_hour,
    lt.tm_min,
    lt.tm_sec,
    (int)(line.tv.tv_usec / 100)
  );

  pfx [PREFIX_LEN - 1] = line.flags & logSync ? '=' : ' ';

  struct iovec iov [2];

  iov [0].iov_base = pfx;
  iov [0].iov_len = PREFIX_LEN;

  char *buf = line.buf;

  while (char *end = strchr (buf, '\n'))
    {
      iov [1].iov_base = buf;
      iov [1].iov_len = end - buf + 1;

      writev (STDERR_FILENO, iov, 2);
      if (logfd != STDERR_FILENO)
        writev (logfd, iov, 2);

      buf = end + 1;

      if (buf == line.buf + line.len)
        break;

      pfx [PREFIX_LEN - 1] = '+';
    }

  sfree (line.buf, line.len);
}

static void *
logthread_proc (void *arg)
{
  int idx = 0;

  for (;;)
    {
      logline line;

      SMUTEX_LOCK (mutex);

      while (queue.empty ())
        SCOND_WAIT (cond, mutex);

      line = queue [idx++];

      // this algorithm could result in an ever-increasing vector
      // size if we log faster than we can write, but if that happens
      // we have bigger problems.
      if (idx == queue.size ())
        {
          queue.clear ();
          idx = 0;
        }

      SMUTEX_UNLOCK (mutex);

      log_sync (line);
    }
}

void
log_cleanup ()
{
  logsync = 1;

  for (;;)
    {
      int done;

      SMUTEX_LOCK (mutex);
      done = queue.empty ();
      SMUTEX_UNLOCK (mutex);

      if (done)
        break;

      usleep (10000);
    }
}

static void
af_child ()
{
  logsync = 1;
}

static struct logthread : thread
{
  logthread ()
  {
    pthread_atfork (0, 0, af_child);
    start (logthread_proc);
    logsync = 0;
  }
} logthread;

void
LOG (int flags, const char *format, ...)
{
  int level = flags & 15;

  if (level > settings.debug)
    return;

  logline line;
  gettimeofday (&line.tv, 0);

  static dynbuf_text buf;

  va_list ap;
  va_start (ap, format);
  buf.vprintf (format, ap);
  va_end (ap);

  buf << '\n';

  line.buf = buf.linearise ();
  line.len = buf.size ();

  if (line.buf [line.len - 2] == '\n')
    --line.len;

  line.buf = salloc<char> (line.len, line.buf);

  buf.clear ();

  if (logsync)
    flags |= logSync;

  if (flags & logBacktrace)
    {
      line.buf [line.len - 1] = 0;
      log_backtrace (line.buf);
      line.buf [line.len - 1] = '\n';
    }

  line.flags = flags;

  if (line.flags & logSync)
    log_sync (line);
  else
    {
      SMUTEX_LOCK (mutex);
      queue.push_back (line);
      SMUTEX_UNLOCK (mutex);
      SCOND_SIGNAL (cond);
    }
}

Revision:	1.19
Committed:	Tue May 6 16:55:25 2008 UTC (18 years, 5 months ago) by root
Content type:	text/plain
Branch:	MAIN
CVS Tags:	rel-2_80, rel-2_6, rel-2_7, rel-2_72, rel-2_73, rel-2_71, rel-2_76, rel-2_77, rel-2_74, rel-2_75, rel-2_54, rel-2_55, rel-2_56, rel-2_79, rel-2_78, rel-2_61
Changes since 1.18:	+1 -1 lines
Log Message:	update copyright
#	User	Rev	Content
1	elmex	1.1	/*
2	root	1.16	* This file is part of Deliantra, the Roguelike Realtime MMORPG.
3	pippijn	1.11	*
4	root	1.19	* Copyright (©) 2005,2006,2007,2008 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
5	root	1.13	* Copyright (©) 2002,2007 Mark Wedel & Crossfire Development Team
6			* Copyright (©) 1992,2007 Frank Tore Johansen
7	pippijn	1.11	*
8	root	1.16	* Deliantra is free software: you can redistribute it and/or modify
9	root	1.15	* it under the terms of the GNU General Public License as published by
10			* the Free Software Foundation, either version 3 of the License, or
11			* (at your option) any later version.
12	pippijn	1.11	*
13	root	1.15	* This program is distributed in the hope that it will be useful,
14			* but WITHOUT ANY WARRANTY; without even the implied warranty of
15			* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16			* GNU General Public License for more details.
17	pippijn	1.11	*
18	root	1.15	* You should have received a copy of the GNU General Public License
19			* along with this program. If not, see <http://www.gnu.org/licenses/>.
20	root	1.13	*
21	root	1.16	* The authors can be reached via e-mail to <support@deliantra.net>
22	pippijn	1.11	*/
23	elmex	1.1
24	root	1.12	#include <cstdarg>
25	root	1.17	#include <cstring>
26
27			#include <vector>
28
29			#include <sys/uio.h>
30			#include <pthread.h>
31
32			#include "global.h"
33			#include "dynbuf.h"
34			#include "util.h"
35
36			struct logline
37			{
38			struct timeval tv;
39			char *buf; // includes PREFIX_LEN garbage bytes
40			int len;
41			int flags;
42			};
43
44			static SMUTEX(mutex);
45			static SCOND(cond);
46			static int logfd = STDERR_FILENO;
47			static int logsync = 1;
48			static std::vector<logline, slice_allocator<logline> > queue;
49
50			void set_logfd (int fd)
51			{
52			SMUTEX_LOCK (mutex);
53			logfd = fd < 0 ? STDERR_FILENO : fd;
54			SMUTEX_UNLOCK (mutex);
55			}
56
57			#define PREFIX_LEN sizeof ("0000-00-00 00:00:00.0000+") - 1
58
59			static void
60			log_sync (logline &line)
61			{
62	root	1.18	struct tm lt;
63	root	1.17	char pfx [PREFIX_LEN];
64
65	root	1.18	localtime_r (&line.tv.tv_sec, &lt);
66
67	root	1.17	sprintf (pfx, "%04d-%02d-%02d %02d:%02d:%02d.%04d",
68	root	1.18	lt.tm_year + 1900,
69			lt.tm_mon + 1,
70			lt.tm_mday,
71			lt.tm_hour,
72			lt.tm_min,
73			lt.tm_sec,
74	root	1.17	(int)(line.tv.tv_usec / 100)
75			);
76
77			pfx [PREFIX_LEN - 1] = line.flags & logSync ? '=' : ' ';
78
79			struct iovec iov [2];
80
81			iov [0].iov_base = pfx;
82			iov [0].iov_len = PREFIX_LEN;
83
84			char *buf = line.buf;
85
86			while (char *end = strchr (buf, '\n'))
87			{
88			iov [1].iov_base = buf;
89			iov [1].iov_len = end - buf + 1;
90
91			writev (STDERR_FILENO, iov, 2);
92			if (logfd != STDERR_FILENO)
93			writev (logfd, iov, 2);
94
95			buf = end + 1;
96
97			if (buf == line.buf + line.len)
98			break;
99
100			pfx [PREFIX_LEN - 1] = '+';
101			}
102
103			sfree (line.buf, line.len);
104			}
105
106			static void *
107			logthread_proc (void *arg)
108			{
109			int idx = 0;
110
111			for (;;)
112			{
113			logline line;
114
115			SMUTEX_LOCK (mutex);
116
117			while (queue.empty ())
118			SCOND_WAIT (cond, mutex);
119
120			line = queue [idx++];
121
122			// this algorithm could result in an ever-increasing vector
123			// size if we log faster than we can write, but if that happens
124			// we have bigger problems.
125			if (idx == queue.size ())
126			{
127			queue.clear ();
128			idx = 0;
129			}
130
131			SMUTEX_UNLOCK (mutex);
132
133			log_sync (line);
134			}
135			}
136
137			void
138			log_cleanup ()
139			{
140			logsync = 1;
141
142			for (;;)
143			{
144			int done;
145
146			SMUTEX_LOCK (mutex);
147			done = queue.empty ();
148			SMUTEX_UNLOCK (mutex);
149
150			if (done)
151			break;
152
153			usleep (10000);
154			}
155			}
156
157			static void
158			af_child ()
159			{
160			logsync = 1;
161			}
162
163			static struct logthread : thread
164			{
165			logthread ()
166			{
167			pthread_atfork (0, 0, af_child);
168			start (logthread_proc);
169			logsync = 0;
170			}
171			} logthread;
172	elmex	1.1
173	root	1.4	void
174	root	1.12	LOG (int flags, const char *format, ...)
175	elmex	1.1	{
176	root	1.12	int level = flags & 15;
177
178			if (level > settings.debug)
179			return;
180
181	root	1.17	logline line;
182			gettimeofday (&line.tv, 0);
183	root	1.12
184	root	1.17	static dynbuf_text buf;
185	root	1.12
186			va_list ap;
187			va_start (ap, format);
188	root	1.17	buf.vprintf (format, ap);
189	root	1.12	va_end (ap);
190
191	root	1.17	buf << '\n';
192
193			line.buf = buf.linearise ();
194			line.len = buf.size ();
195	root	1.12
196	root	1.17	if (line.buf [line.len - 2] == '\n')
197			--line.len;
198	root	1.14
199	root	1.17	line.buf = salloc<char> (line.len, line.buf);
200
201			buf.clear ();
202
203			if (logsync)
204			flags \|= logSync;
205	root	1.12
206			if (flags & logBacktrace)
207	root	1.17	{
208			line.buf [line.len - 1] = 0;
209			log_backtrace (line.buf);
210			line.buf [line.len - 1] = '\n';
211			}
212
213			line.flags = flags;
214
215			if (line.flags & logSync)
216			log_sync (line);
217			else
218			{
219			SMUTEX_LOCK (mutex);
220			queue.push_back (line);
221			SMUTEX_UNLOCK (mutex);
222			SCOND_SIGNAL (cond);
223			}
224	elmex	1.1	}
225	root	1.17