pacemaker 2.1.1-77db578727
Scalable High-Availability cluster resource manager
Loading...
Searching...
No Matches
output_log.c
Go to the documentation of this file.
1/*
2 * Copyright 2019-2021 the Pacemaker project contributors
3 *
4 * The version control history for this file may have further details.
5 *
6 * This source code is licensed under the GNU Lesser General Public License
7 * version 2.1 or later (LGPLv2.1+) WITHOUT ANY WARRANTY.
8 */
9
10#include <crm_internal.h>
11
12#include <ctype.h>
13#include <stdarg.h>
14#include <stdlib.h>
15#include <stdio.h>
16
17GOptionEntry pcmk__log_output_entries[] = {
18 { NULL }
19};
20
21typedef struct private_data_s {
22 /* gathered in log_begin_list */
23 GQueue/*<char*>*/ *prefixes;
24 int log_level;
26
27static void
28log_subprocess_output(pcmk__output_t *out, int exit_status,
29 const char *proc_stdout, const char *proc_stderr) {
30 /* This function intentionally left blank */
31}
32
33static void
34log_free_priv(pcmk__output_t *out) {
35 private_data_t *priv = out->priv;
36
37 if (priv == NULL) {
38 return;
39 }
40
41 g_queue_free(priv->prefixes);
42 free(priv);
43 out->priv = NULL;
44}
45
46static bool
47log_init(pcmk__output_t *out) {
48 private_data_t *priv = NULL;
49
50 /* If log_init was previously called on this output struct, just return. */
51 if (out->priv != NULL) {
52 return true;
53 }
54
55 out->priv = calloc(1, sizeof(private_data_t));
56 if (out->priv == NULL) {
57 return false;
58 }
59
60 priv = out->priv;
61
62 priv->prefixes = g_queue_new();
63 priv->log_level = LOG_INFO;
64
65 return true;
66}
67
68static void
69log_finish(pcmk__output_t *out, crm_exit_t exit_status, bool print, void **copy_dest) {
70 /* This function intentionally left blank */
71}
72
73static void
74log_reset(pcmk__output_t *out) {
75 CRM_ASSERT(out != NULL);
76
77 out->dest = freopen(NULL, "w", out->dest);
78 CRM_ASSERT(out->dest != NULL);
79
80 log_free_priv(out);
81 log_init(out);
82}
83
84static void
85log_version(pcmk__output_t *out, bool extended) {
86 private_data_t *priv = NULL;
87
88 CRM_ASSERT(out != NULL && out->priv != NULL);
89 priv = out->priv;
90
91 if (extended) {
92 do_crm_log(priv->log_level, "Pacemaker %s (Build: %s): %s",
94 } else {
95 do_crm_log(priv->log_level, "Pacemaker %s", PACEMAKER_VERSION);
96 do_crm_log(priv->log_level, "Written by Andrew Beekhof");
97 }
98}
99
100G_GNUC_PRINTF(2, 3)
101static void
102log_err(pcmk__output_t *out, const char *format, ...) {
103 va_list ap;
104 char* buffer = NULL;
105 int len = 0;
106
107 CRM_ASSERT(out != NULL);
108
109 va_start(ap, format);
110 /* Informational output does not get indented, to separate it from other
111 * potentially indented list output.
112 */
113 len = vasprintf(&buffer, format, ap);
114 CRM_ASSERT(len >= 0);
115 va_end(ap);
116
117 crm_err("%s", buffer);
118
119 free(buffer);
120}
121
122static void
123log_output_xml(pcmk__output_t *out, const char *name, const char *buf) {
124 xmlNodePtr node = NULL;
125 private_data_t *priv = NULL;
126
127 CRM_ASSERT(out != NULL && out->priv != NULL);
128 priv = out->priv;
129
130 node = create_xml_node(NULL, name);
131 xmlNodeSetContent(node, (pcmkXmlStr) buf);
132 do_crm_log_xml(priv->log_level, name, node);
133 free(node);
134}
135
136G_GNUC_PRINTF(4, 5)
137static void
138log_begin_list(pcmk__output_t *out, const char *singular_noun, const char *plural_noun,
139 const char *format, ...) {
140 int len = 0;
141 va_list ap;
142 char* buffer = NULL;
143 private_data_t *priv = NULL;
144
145 CRM_ASSERT(out != NULL && out->priv != NULL);
146 priv = out->priv;
147
148 va_start(ap, format);
149 len = vasprintf(&buffer, format, ap);
150 CRM_ASSERT(len >= 0);
151 va_end(ap);
152
153 /* Don't skip empty prefixes,
154 * otherwise there will be mismatch
155 * in the log_end_list */
156 if(strcmp(buffer, "") == 0) {
157 /* nothing */
158 }
159
160 g_queue_push_tail(priv->prefixes, buffer);
161}
162
163G_GNUC_PRINTF(3, 4)
164static void
165log_list_item(pcmk__output_t *out, const char *name, const char *format, ...) {
166 int len = 0;
167 va_list ap;
168 private_data_t *priv = NULL;
169 char prefix[LINE_MAX] = { 0 };
170 int offset = 0;
171 char* buffer = NULL;
172
173 CRM_ASSERT(out != NULL && out->priv != NULL);
174 priv = out->priv;
175
176 for (GList* gIter = priv->prefixes->head; gIter; gIter = gIter->next) {
177 if (strcmp(prefix, "") != 0) {
178 offset += snprintf(prefix + offset, LINE_MAX - offset, ": %s", (char *)gIter->data);
179 } else {
180 offset = snprintf(prefix, LINE_MAX, "%s", (char *)gIter->data);
181 }
182 }
183
184 va_start(ap, format);
185 len = vasprintf(&buffer, format, ap);
186 CRM_ASSERT(len >= 0);
187 va_end(ap);
188
189 if (strcmp(buffer, "") != 0) { /* We don't want empty messages */
190 if ((name != NULL) && (strcmp(name, "") != 0)) {
191 if (strcmp(prefix, "") != 0) {
192 do_crm_log(priv->log_level, "%s: %s: %s", prefix, name, buffer);
193 } else {
194 do_crm_log(priv->log_level, "%s: %s", name, buffer);
195 }
196 } else {
197 if (strcmp(prefix, "") != 0) {
198 do_crm_log(priv->log_level, "%s: %s", prefix, buffer);
199 } else {
200 do_crm_log(priv->log_level, "%s", buffer);
201 }
202 }
203 }
204 free(buffer);
205}
206
207static void
208log_end_list(pcmk__output_t *out) {
209 private_data_t *priv = NULL;
210
211 CRM_ASSERT(out != NULL && out->priv != NULL);
212 priv = out->priv;
213
214 if (priv->prefixes == NULL) {
215 return;
216 }
217 CRM_ASSERT(priv->prefixes->tail != NULL);
218
219 free((char *)priv->prefixes->tail->data);
220 g_queue_pop_tail(priv->prefixes);
221}
222
223G_GNUC_PRINTF(2, 3)
224static int
225log_info(pcmk__output_t *out, const char *format, ...) {
226 private_data_t *priv = NULL;
227 int len = 0;
228 va_list ap;
229 char* buffer = NULL;
230
231 CRM_ASSERT(out != NULL && out->priv != NULL);
232 priv = out->priv;
233
234 va_start(ap, format);
235 len = vasprintf(&buffer, format, ap);
236 CRM_ASSERT(len >= 0);
237 va_end(ap);
238
239 do_crm_log(priv->log_level, "%s", buffer);
240
241 free(buffer);
242 return pcmk_rc_ok;
243}
244
245static bool
246log_is_quiet(pcmk__output_t *out) {
247 return false;
248}
249
250static void
251log_spacer(pcmk__output_t *out) {
252 /* This function intentionally left blank */
253}
254
255static void
256log_progress(pcmk__output_t *out, bool end) {
257 /* This function intentionally left blank */
258}
259
260static void
261log_prompt(const char *prompt, bool echo, char **dest) {
262 /* This function intentionally left blank */
263}
264
267 pcmk__output_t *retval = calloc(1, sizeof(pcmk__output_t));
268
269 if (retval == NULL) {
270 return NULL;
271 }
272
273 retval->fmt_name = "log";
274 retval->request = argv == NULL ? NULL : g_strjoinv(" ", argv);
275
276 retval->init = log_init;
277 retval->free_priv = log_free_priv;
278 retval->finish = log_finish;
279 retval->reset = log_reset;
280
282 retval->message = pcmk__call_message;
283
284 retval->subprocess_output = log_subprocess_output;
285 retval->version = log_version;
286 retval->info = log_info;
287 retval->err = log_err;
288 retval->output_xml = log_output_xml;
289
290 retval->begin_list = log_begin_list;
291 retval->list_item = log_list_item;
292 retval->end_list = log_end_list;
293
294 retval->is_quiet = log_is_quiet;
295 retval->spacer = log_spacer;
296 retval->progress = log_progress;
297 retval->prompt = log_prompt;
298
299 return retval;
300}
301
302void
304 private_data_t *priv = NULL;
305
306 CRM_ASSERT(out != NULL && out->priv != NULL);
307
308 if (!pcmk__str_eq(out->fmt_name, "log", pcmk__str_none)) {
309 return;
310 }
311
312 priv = out->priv;
313 priv->log_level = log_level;
314}
#define PACEMAKER_VERSION
Definition config.h:477
#define CRM_FEATURES
Definition config.h:35
#define BUILD_VERSION
Definition config.h:8
#define do_crm_log_xml(level, text, xml)
Log XML line-by-line in a formatted fashion.
Definition logging.h:242
#define do_crm_log(level, fmt, args...)
Log a message.
Definition logging.h:159
#define crm_err(fmt, args...)
Definition logging.h:350
struct private_data_s private_data_t
int pcmk__call_message(pcmk__output_t *out, const char *message_id,...)
Definition output.c:119
void pcmk__register_message(pcmk__output_t *out, const char *message_id, pcmk__message_fn_t fn)
Definition output.c:139
GOptionEntry pcmk__log_output_entries[]
Definition output_log.c:17
void pcmk__output_set_log_level(pcmk__output_t *out, int log_level)
Definition output_log.c:303
pcmk__output_t * pcmk__mk_log_output(char **argv)
Definition output_log.c:266
struct private_data_s private_data_t
char * name
Definition pcmk_fence.c:31
#define CRM_ASSERT(expr)
Definition results.h:42
@ pcmk_rc_ok
Definition results.h:142
enum crm_exit_e crm_exit_t
@ pcmk__str_none
This structure contains everything that makes up a single output formatter.
void(* end_list)(pcmk__output_t *out)
void(* version)(pcmk__output_t *out, bool extended)
int(* message)(pcmk__output_t *out, const char *message_id,...)
bool(* is_quiet)(pcmk__output_t *out)
const char * fmt_name
The name of this output formatter.
FILE * dest
Where output should be written.
int(*) void(*) void(* output_xml)(pcmk__output_t *out, const char *name, const char *buf)
void(* register_message)(pcmk__output_t *out, const char *message_id, pcmk__message_fn_t fn)
void(*) void(* list_item)(pcmk__output_t *out, const char *name, const char *format,...) G_GNUC_PRINTF(3
int(*) void(* err)(pcmk__output_t *out, const char *format,...) G_GNUC_PRINTF(2
void(* finish)(pcmk__output_t *out, crm_exit_t exit_status, bool print, void **copy_dest)
void(* prompt)(const char *prompt, bool echo, char **dest)
void(* subprocess_output)(pcmk__output_t *out, int exit_status, const char *proc_stdout, const char *proc_stderr)
void(* begin_list)(pcmk__output_t *out, const char *singular_noun, const char *plural_noun, const char *format,...) G_GNUC_PRINTF(4
bool(* init)(pcmk__output_t *out)
void * priv
Implementation-specific private data.
void(* spacer)(pcmk__output_t *out)
void(* progress)(pcmk__output_t *out, bool end)
void(* reset)(pcmk__output_t *out)
int(* info)(pcmk__output_t *out, const char *format,...) G_GNUC_PRINTF(2
void(* free_priv)(pcmk__output_t *out)
gchar * request
A copy of the request that generated this output.
const xmlChar * pcmkXmlStr
Definition xml.h:51
xmlNode * create_xml_node(xmlNode *parent, const char *name)
Definition xml.c:696