49
49
#define RED_FMT (s ) "\033[40;31m"s"\033[0m"
50
50
51
51
#define COLOR (val , fmt , str , ret , color ) do \
52
- { \
53
- if ((val) > 100) \
54
- ret = sprintf(str, \
55
- color##_FMT(fmt), (val)); \
56
- else \
57
- ret = sprintf(str, fmt, (val)); \
58
- } while(0)
52
+ { \
53
+ if ((val) > 100) \
54
+ ret = sprintf(str, \
55
+ color##_FMT(fmt), (val)); \
56
+ else \
57
+ ret = sprintf(str, fmt, (val)); \
58
+ } while(0)
59
59
60
60
#define FALSE 0
61
61
#define TRUE 1
@@ -129,43 +129,43 @@ enum {MIN, MEAN, MAX};
129
129
130
130
131
131
#define __PRINT_S (buffer , val , ret ) do { \
132
- int _i; \
133
- double _f; \
134
- char u[] = {'K', 'M', 'G', 'T'}; \
135
- __INDENT((val), _i, _f); \
136
- (ret) += sprintf((buffer), FMT_S, _f, u[_i]); \
137
- }while(0)
132
+ int _i; \
133
+ double _f; \
134
+ char u[] = {'K', 'M', 'G', 'T'}; \
135
+ __INDENT((val), _i, _f); \
136
+ (ret) += sprintf((buffer), FMT_S, _f, u[_i]); \
137
+ }while(0)
138
138
139
139
#define __PRINT_SP (buffer , val , ret ) do { \
140
- (ret) += sprintf(buffer, FMT_SP, (val)); \
141
- }while(0)
140
+ (ret) += sprintf(buffer, FMT_SP, (val)); \
141
+ }while(0)
142
142
143
143
#define __PRINT_NAGIOS (buffer , val , ret ) do { \
144
- (ret) += sprintf(buffer, FMT_NAGIOS, (val)); \
145
- }while(0)
144
+ (ret) += sprintf(buffer, FMT_NAGIOS, (val)); \
145
+ }while(0)
146
146
147
147
#define PRINT (buffer , val , ret , type ) do { \
148
- if (type == OUTPUT_NAGIOS) { \
149
- __PRINT_NAGIOS(buffer, val, ret); \
150
- } \
151
- else{ \
152
- if ((val) < KB) { \
153
- __PRINT_SP(buffer, val, ret); \
154
- } \
155
- else { \
156
- __PRINT_S(buffer, val, ret); \
157
- } \
158
- } \
159
- } while(0)
148
+ if (type == OUTPUT_NAGIOS) { \
149
+ __PRINT_NAGIOS(buffer, val, ret); \
150
+ } \
151
+ else{ \
152
+ if ((val) < KB) { \
153
+ __PRINT_SP(buffer, val, ret); \
154
+ } \
155
+ else { \
156
+ __PRINT_S(buffer, val, ret); \
157
+ } \
158
+ } \
159
+ } while(0)
160
160
161
161
#define myalloc (p , type , size ) \
162
162
struct type * p = NULL; \
163
- p = (struct type *)malloc(size); \
164
- if(!p) { \
165
- fprintf(stderr, "failed to alloc memory\n"); \
166
- exit(EXIT_FAILURE); \
167
- } \
168
- memset(p, 0, size) \
163
+ p = (struct type *)malloc(size); \
164
+ if(!p) { \
165
+ fprintf(stderr, "failed to alloc memory\n"); \
166
+ exit(EXIT_FAILURE); \
167
+ } \
168
+ memset(p, 0, size) \
169
169
170
170
#define BUFFER_ROTATE (mod , size ) \
171
171
do { \
@@ -175,28 +175,28 @@ enum {MIN, MEAN, MAX};
175
175
176
176
inline void func_mod_free (struct module * mod )
177
177
{
178
- free (mod -> detail );
179
- free (mod -> summary );
180
- mod -> detail = NULL ;
181
- mod -> summary = NULL ;
178
+ free (mod -> detail );
179
+ free (mod -> summary );
180
+ mod -> detail = NULL ;
181
+ mod -> summary = NULL ;
182
182
}
183
183
184
184
#define INIT_STRING_P (s , nr , len ) \
185
185
do { \
186
186
int i; \
187
187
s = (char **)malloc((nr) * sizeof(char *)); \
188
188
for(i = 0; i < (nr); i++) \
189
- s[i] = (char *)malloc(len); \
189
+ s[i] = (char *)malloc(len); \
190
190
} while(0)
191
191
192
192
193
193
#define DECLARE_TMP_MOD_STATISTICS (mod ) \
194
194
union mod##_statistics mod##_tmp_s; \
195
-
195
+
196
196
#define SET_CURRENT_VALUE (mod , type , member , ret ) \
197
197
do { \
198
198
mod##_tmp_s.mod##_##type.ret = \
199
- s_st_##mod[CURR].member; \
199
+ s_st_##mod[CURR].member; \
200
200
}while(0)
201
201
202
202
#define __COMPUTE_MOD_VALUE (ret , ops , m1 , m2 , i ) \
@@ -217,11 +217,11 @@ inline void func_mod_free(struct module *mod)
217
217
do { \
218
218
/*printf("i = %ld\n", (i));*/ \
219
219
__COMPUTE_MOD_VALUE ( \
220
- mod ##_tmp_s .mod ##_ ##type .ret, \
221
- ops, \
222
- s_st_##mod[1].member, \
223
- s_st_##mod[0].member, \
224
- (i)); \
220
+ mod ##_tmp_s .mod ##_ ##type .ret, \
221
+ ops, \
222
+ s_st_##mod[1].member, \
223
+ s_st_##mod[0].member, \
224
+ (i)); \
225
225
} while(0)
226
226
227
227
@@ -235,7 +235,7 @@ inline void func_mod_free(struct module *mod)
235
235
sw = 1; \
236
236
} else { \
237
237
if (((val) - (max)) > 0.00001) \
238
- (max) = (val); \
238
+ (max) = (val); \
239
239
else if (((min) - (val)) > 0.00001) { \
240
240
(min) = (val); \
241
241
} \
@@ -245,32 +245,32 @@ inline void func_mod_free(struct module *mod)
245
245
246
246
#define SET_MOD_STATISTICS (mod , member , i , type ) \
247
247
__SET_MOD_STATISTICS \
248
- ( \
249
- mod##_tmp_s.mod##_##type.member, \
250
- mod##_statis[MEAN].mod##_##type.member, \
251
- mod##_statis[MAX].mod##_##type.member, \
252
- mod##_statis[MIN].mod##_##type.member, \
253
- i)
248
+ ( \
249
+ mod##_tmp_s.mod##_##type.member, \
250
+ mod##_statis[MEAN].mod##_##type.member, \
251
+ mod##_statis[MAX].mod##_##type.member, \
252
+ mod##_statis[MIN].mod##_##type.member, \
253
+ i)
254
254
255
255
#define __PRINT_AVG (buf , pos , val , member , idx , count , otype ) do \
256
- { \
257
- if ((idx) == MEAN) \
258
- val[(idx)].member = \
259
- val[(idx)].member / (count); \
260
- PRINT(buf[(idx)] + pos[(idx)], \
261
- val[(idx)].member, \
262
- pos[(idx)], (otype)); \
263
- }while(0)
256
+ { \
257
+ if ((idx) == MEAN) \
258
+ val[(idx)].member = \
259
+ val[(idx)].member / (count); \
260
+ PRINT(buf[(idx)] + pos[(idx)], \
261
+ val[(idx)].member, \
262
+ pos[(idx)], (otype)); \
263
+ }while(0)
264
264
265
265
#define __PRINT_AVG_SEP (buf , pos , val , member , sep , idx , count , otype ) do \
266
- { \
267
- if((idx) == MEAN) \
268
- val[(idx)].member = \
269
- (val[(idx)].member / (count)); \
270
- PRINT(buf[(idx)] + pos[(idx)], \
271
- val[(idx)].member * (sep), \
272
- pos[(idx)], (otype)); \
273
- }while(0)
266
+ { \
267
+ if((idx) == MEAN) \
268
+ val[(idx)].member = \
269
+ (val[(idx)].member / (count)); \
270
+ PRINT(buf[(idx)] + pos[(idx)], \
271
+ val[(idx)].member * (sep), \
272
+ pos[(idx)], (otype)); \
273
+ }while(0)
274
274
275
275
inline char * getitem (char * r , char * mnt )
276
276
{
0 commit comments