openpam_debug.h revision 348980 
1/*-
2 * Copyright (c) 2001-2003 Networks Associates Technology, Inc.
3 * Copyright (c) 2004-2011 Dag-Erling Sm��rgrav
4 * All rights reserved.
5 *
6 * This software was developed for the FreeBSD Project by ThinkSec AS and
7 * Network Associates Laboratories, the Security Research Division of
8 * Network Associates, Inc.  under DARPA/SPAWAR contract N66001-01-C-8035
9 * ("CBOSS"), as part of the DARPA CHATS research program.
10 *
11 * Redistribution and use in source and binary forms, with or without
12 * modification, are permitted provided that the following conditions
13 * are met:
14 * 1. Redistributions of source code must retain the above copyright
15 *    notice, this list of conditions and the following disclaimer.
16 * 2. Redistributions in binary form must reproduce the above copyright
17 *    notice, this list of conditions and the following disclaimer in the
18 *    documentation and/or other materials provided with the distribution.
19 * 3. The name of the author may not be used to endorse or promote
20 *    products derived from this software without specific prior written
21 *    permission.
22 *
23 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
24 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
25 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
26 * ARE DISCLAIMED.  IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
27 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
28 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
29 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
30 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
31 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
32 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
33 * SUCH DAMAGE.
34 *
35 * $OpenPAM: openpam_debug.h 938 2017-04-30 21:34:42Z des $
36 */
37
38#ifndef OPENPAM_DEBUG_H_INCLUDED
39#define OPENPAM_DEBUG_H_INCLUDED
40
41#ifdef OPENPAM_DEBUG
42#define ENTER() openpam_log(PAM_LOG_LIBDEBUG, "entering")
43#define ENTERI(i) do { \
44	int i_ = (i); \
45	if (i_ > 0 && i_ < PAM_NUM_ITEMS) \
46		openpam_log(PAM_LOG_LIBDEBUG, "entering: %s", pam_item_name[i_]); \
47	else \
48		openpam_log(PAM_LOG_LIBDEBUG, "entering: %d", i_); \
49} while (0)
50#define ENTERN(n) do { \
51	int n_ = (n); \
52	openpam_log(PAM_LOG_LIBDEBUG, "entering: %d", n_); \
53} while (0)
54#define ENTERS(s) do { \
55	const char *s_ = (s); \
56	if (s_ == NULL) \
57		openpam_log(PAM_LOG_LIBDEBUG, "entering: NULL"); \
58	else \
59		openpam_log(PAM_LOG_LIBDEBUG, "entering: '%s'", s_); \
60} while (0)
61#define ENTERF(f) do { \
62	int f_ = (f); \
63	if (f_ >= 0 && f_ <= OPENPAM_NUM_FEATURES) \
64		openpam_log(PAM_LOG_LIBDEBUG, "entering: %s", \
65		    openpam_features[f_].name); \
66	else \
67		openpam_log(PAM_LOG_LIBDEBUG, "entering: %d", f_); \
68} while (0)
69#define	RETURNV() openpam_log(PAM_LOG_LIBDEBUG, "returning")
70#define RETURNC(c) do { \
71	int c_ = (c); \
72	if (c_ >= 0 && c_ < PAM_NUM_ERRORS) \
73		openpam_log(PAM_LOG_LIBDEBUG, "returning %s", pam_err_name[c_]); \
74	else \
75		openpam_log(PAM_LOG_LIBDEBUG, "returning %d!", c_); \
76	return (c_); \
77} while (0)
78#define	RETURNN(n) do { \
79	int n_ = (n); \
80	openpam_log(PAM_LOG_LIBDEBUG, "returning %d", n_); \
81	return (n_); \
82} while (0)
83#define	RETURNP(p) do { \
84	void *p_ = (p); \
85	if (p_ == NULL) \
86		openpam_log(PAM_LOG_LIBDEBUG, "returning NULL"); \
87	else \
88		openpam_log(PAM_LOG_LIBDEBUG, "returning %p", p_); \
89	return (p_); \
90} while (0)
91#define	RETURNS(s) do { \
92	const char *s_ = (s); \
93	if (s_ == NULL) \
94		openpam_log(PAM_LOG_LIBDEBUG, "returning NULL"); \
95	else \
96		openpam_log(PAM_LOG_LIBDEBUG, "returning '%s'", s_); \
97	return (s_); \
98} while (0)
99#else
100#define ENTER()
101#define ENTERI(i)
102#define ENTERN(n)
103#define ENTERS(s)
104#define ENTERF(f)
105#define RETURNV() return
106#define RETURNC(c) return (c)
107#define RETURNN(n) return (n)
108#define RETURNP(p) return (p)
109#define RETURNS(s) return (s)
110#endif
111
112#endif
113