1 #ifdef __cplusplus
2 extern "C" {
3 #endif
5 #include "EXTERN.h"
6 #include "perl.h"
7 #include "XSUB.h"
9 #ifdef __cplusplus
10 }
11 #endif
13 #include "../../src/rrd_tool.h"
15 /* perl 5.004 compatibility */
16 #if PERLPATCHLEVEL < 5
17 #define PL_sv_undef sv_undef
18 #endif
21 #define rrdcode(name) \
22 argv = (char **) malloc((items+1)*sizeof(char *));\
23 argv[0] = "dummy";\
24 for (i = 0; i < items; i++) { \
25 STRLEN len; \
26 char *handle= SvPV(ST(i),len);\
27 /* actually copy the data to make sure possible modifications \
28 on the argv data does not backfire into perl */ \
29 argv[i+1] = (char *) malloc((strlen(handle)+1)*sizeof(char)); \
30 strcpy(argv[i+1],handle); \
31 } \
32 optind=0; opterr=0; \
33 rrd_clear_error();\
34 RETVAL=name(items+1,argv); \
35 for (i=0; i < items; i++) {\
36 free(argv[i+1]);\
37 } \
38 free(argv);\
39 \
40 if (rrd_test_error()) XSRETURN_UNDEF;
42 #define hvs(VAL) hv_store_ent(hash, sv_2mortal(newSVpv(data->key,0)),VAL,0)
44 #define rrdinfocode(name) \
45 /* prepare argument list */ \
46 argv = (char **) malloc((items+1)*sizeof(char *)); \
47 argv[0] = "dummy"; \
48 for (i = 0; i < items; i++) { \
49 STRLEN len; \
50 char *handle= SvPV(ST(i),len); \
51 /* actually copy the data to make sure possible modifications \
52 on the argv data does not backfire into perl */ \
53 argv[i+1] = (char *) malloc((strlen(handle)+1)*sizeof(char)); \
54 strcpy(argv[i+1],handle); \
55 } \
56 optind=0; opterr=0; \
57 rrd_clear_error(); \
58 data=name(items+1, argv); \
59 for (i=0; i < items; i++) { \
60 free(argv[i+1]); \
61 } \
62 free(argv); \
63 if (rrd_test_error()) XSRETURN_UNDEF; \
64 hash = newHV(); \
65 while (data) { \
66 save=data; \
67 /* the newSV will get copied by hv so we create it as a mortal \
68 to make sure it does not keep hanging round after the fact */ \
69 switch (data->type) { \
70 case RD_I_VAL: \
71 if (isnan(data->value.u_val)) \
72 hvs(&PL_sv_undef); \
73 else \
74 hvs(newSVnv(data->value.u_val)); \
75 break; \
76 case RD_I_INT: \
77 hvs(newSViv(data->value.u_int)); \
78 break; \
79 case RD_I_CNT: \
80 hvs(newSViv(data->value.u_cnt)); \
81 break; \
82 case RD_I_STR: \
83 hvs(newSVpv(data->value.u_str,0)); \
84 rrd_freemem(data->value.u_str); \
85 break; \
86 } \
87 rrd_freemem(data->key); \
88 data = data->next; \
89 rrd_freemem(save); \
90 } \
91 rrd_freemem(data); \
92 RETVAL = newRV_noinc((SV*)hash);
94 /*
95 * should not be needed if libc is linked (see ntmake.pl)
96 #ifdef WIN32
97 #define free free
98 #define malloc malloc
99 #define realloc realloc
100 #endif
101 */
104 MODULE = RRDs PACKAGE = RRDs PREFIX = rrd_
106 BOOT:
107 #ifdef MUST_DISABLE_SIGFPE
108 signal(SIGFPE,SIG_IGN);
109 #endif
110 #ifdef MUST_DISABLE_FPMASK
111 fpsetmask(0);
112 #endif
115 SV*
116 rrd_error()
117 CODE:
118 if (! rrd_test_error()) XSRETURN_UNDEF;
119 RETVAL = newSVpv(rrd_get_error(),0);
120 OUTPUT:
121 RETVAL
124 int
125 rrd_last(...)
126 PROTOTYPE: @
127 PREINIT:
128 int i;
129 char **argv;
130 CODE:
131 rrdcode(rrd_last);
132 OUTPUT:
133 RETVAL
136 int
137 rrd_create(...)
138 PROTOTYPE: @
139 PREINIT:
140 int i;
141 char **argv;
142 CODE:
143 rrdcode(rrd_create);
144 RETVAL = 1;
145 OUTPUT:
146 RETVAL
149 int
150 rrd_update(...)
151 PROTOTYPE: @
152 PREINIT:
153 int i;
154 char **argv;
155 CODE:
156 rrdcode(rrd_update);
157 RETVAL = 1;
158 OUTPUT:
159 RETVAL
162 int
163 rrd_tune(...)
164 PROTOTYPE: @
165 PREINIT:
166 int i;
167 char **argv;
168 CODE:
169 rrdcode(rrd_tune);
170 RETVAL = 1;
171 OUTPUT:
172 RETVAL
175 void
176 rrd_graph(...)
177 PROTOTYPE: @
178 PREINIT:
179 char **calcpr=NULL;
180 int i,xsize,ysize;
181 char **argv;
182 AV *retar;
183 PPCODE:
184 argv = (char **) malloc((items+1)*sizeof(char *));
185 argv[0] = "dummy";
186 for (i = 0; i < items; i++) {
187 STRLEN len;
188 char *handle = SvPV(ST(i),len);
189 /* actually copy the data to make sure possible modifications
190 on the argv data does not backfire into perl */
191 argv[i+1] = (char *) malloc((strlen(handle)+1)*sizeof(char));
192 strcpy(argv[i+1],handle);
193 }
194 optind=0; opterr=0;
195 rrd_clear_error();
196 rrd_graph(items+1,argv,&calcpr,&xsize,&ysize,NULL);
197 for (i=0; i < items; i++) {
198 free(argv[i+1]);
199 }
200 free(argv);
202 if (rrd_test_error()) {
203 if(calcpr)
204 for(i=0;calcpr[i];i++)
205 rrd_freemem(calcpr[i]);
206 XSRETURN_UNDEF;
207 }
208 retar=newAV();
209 if(calcpr){
210 for(i=0;calcpr[i];i++){
211 av_push(retar,newSVpv(calcpr[i],0));
212 rrd_freemem(calcpr[i]);
213 }
214 rrd_freemem(calcpr);
215 }
216 EXTEND(sp,4);
217 PUSHs(sv_2mortal(newRV_noinc((SV*)retar)));
218 PUSHs(sv_2mortal(newSViv(xsize)));
219 PUSHs(sv_2mortal(newSViv(ysize)));
221 void
222 rrd_fetch(...)
223 PROTOTYPE: @
224 PREINIT:
225 time_t start,end;
226 unsigned long step, ds_cnt,i,ii;
227 rrd_value_t *data,*datai;
228 char **argv;
229 char **ds_namv;
230 AV *retar,*line,*names;
231 PPCODE:
232 argv = (char **) malloc((items+1)*sizeof(char *));
233 argv[0] = "dummy";
234 for (i = 0; i < items; i++) {
235 STRLEN len;
236 char *handle= SvPV(ST(i),len);
237 /* actually copy the data to make sure possible modifications
238 on the argv data does not backfire into perl */
239 argv[i+1] = (char *) malloc((strlen(handle)+1)*sizeof(char));
240 strcpy(argv[i+1],handle);
241 }
242 optind=0; opterr=0;
243 rrd_clear_error();
244 rrd_fetch(items+1,argv,&start,&end,&step,&ds_cnt,&ds_namv,&data);
245 for (i=0; i < items; i++) {
246 free(argv[i+1]);
247 }
248 free(argv);
249 if (rrd_test_error()) XSRETURN_UNDEF;
250 /* convert the ds_namv into perl format */
251 names=newAV();
252 for (ii = 0; ii < ds_cnt; ii++){
253 av_push(names,newSVpv(ds_namv[ii],0));
254 rrd_freemem(ds_namv[ii]);
255 }
256 rrd_freemem(ds_namv);
257 /* convert the data array into perl format */
258 datai=data;
259 retar=newAV();
260 for (i = start+step; i <= end; i += step){
261 line = newAV();
262 for (ii = 0; ii < ds_cnt; ii++){
263 av_push(line,(isnan(*datai) ? &PL_sv_undef : newSVnv(*datai)));
264 datai++;
265 }
266 av_push(retar,newRV_noinc((SV*)line));
267 }
268 rrd_freemem(data);
269 EXTEND(sp,5);
270 PUSHs(sv_2mortal(newSViv(start+step)));
271 PUSHs(sv_2mortal(newSViv(step)));
272 PUSHs(sv_2mortal(newRV_noinc((SV*)names)));
273 PUSHs(sv_2mortal(newRV_noinc((SV*)retar)));
275 void
276 rrd_times(start, end)
277 char *start
278 char *end
279 PREINIT:
280 struct time_value start_tv, end_tv;
281 char *parsetime_error = NULL;
282 time_t start_tmp, end_tmp;
283 PPCODE:
284 rrd_clear_error();
285 if( (parsetime_error = parsetime( start, &start_tv))) {
286 rrd_set_error( "start time: %s", parsetime_error);
287 XSRETURN_UNDEF;
288 }
289 if( (parsetime_error = parsetime( end, &end_tv))) {
290 rrd_set_error( "end time: %s", parsetime_error);
291 XSRETURN_UNDEF;
292 }
293 if( proc_start_end( &start_tv, &end_tv, &start_tmp, &end_tmp) == -1) {
294 XSRETURN_UNDEF;
295 }
296 EXTEND(sp,2);
297 PUSHs(sv_2mortal(newSVuv(start_tmp)));
298 PUSHs(sv_2mortal(newSVuv(end_tmp)));
300 int
301 rrd_xport(...)
302 PROTOTYPE: @
303 PREINIT:
304 time_t start,end;
305 int xsize;
306 unsigned long step, col_cnt,row_cnt,i,ii;
307 rrd_value_t *data,*ptr;
308 char **argv,**legend_v;
309 AV *retar,*line,*names;
310 PPCODE:
311 argv = (char **) malloc((items+1)*sizeof(char *));
312 argv[0] = "dummy";
313 for (i = 0; i < items; i++) {
314 STRLEN len;
315 char *handle = SvPV(ST(i),len);
316 /* actually copy the data to make sure possible modifications
317 on the argv data does not backfire into perl */
318 argv[i+1] = (char *) malloc((strlen(handle)+1)*sizeof(char));
319 strcpy(argv[i+1],handle);
320 }
321 optind=0; opterr=0;
322 rrd_clear_error();
323 rrd_xport(items+1,argv,&xsize,&start,&end,&step,&col_cnt,&legend_v,&data);
324 for (i=0; i < items; i++) {
325 free(argv[i+1]);
326 }
327 free(argv);
328 if (rrd_test_error()) XSRETURN_UNDEF;
330 /* convert the legend_v into perl format */
331 names=newAV();
332 for (ii = 0; ii < col_cnt; ii++){
333 av_push(names,newSVpv(legend_v[ii],0));
334 rrd_freemem(legend_v[ii]);
335 }
336 rrd_freemem(legend_v);
338 /* convert the data array into perl format */
339 ptr=data;
340 retar=newAV();
341 for (i = start+step; i <= end; i += step){
342 line = newAV();
343 for (ii = 0; ii < col_cnt; ii++){
344 av_push(line,(isnan(*ptr) ? &PL_sv_undef : newSVnv(*ptr)));
345 ptr++;
346 }
347 av_push(retar,newRV_noinc((SV*)line));
348 }
349 rrd_freemem(data);
351 EXTEND(sp,7);
352 PUSHs(sv_2mortal(newSViv(start+step)));
353 PUSHs(sv_2mortal(newSViv(end)));
354 PUSHs(sv_2mortal(newSViv(step)));
355 PUSHs(sv_2mortal(newSViv(col_cnt)));
356 PUSHs(sv_2mortal(newRV_noinc((SV*)names)));
357 PUSHs(sv_2mortal(newRV_noinc((SV*)retar)));
359 SV*
360 rrd_info(...)
361 PROTOTYPE: @
362 PREINIT:
363 info_t *data,*save;
364 int i;
365 char **argv;
366 HV *hash;
367 CODE:
368 rrdinfocode(rrd_info);
369 OUTPUT:
370 RETVAL
372 SV*
373 rrd_updatev(...)
374 PROTOTYPE: @
375 PREINIT:
376 info_t *data,*save;
377 int i;
378 char **argv;
379 HV *hash;
380 CODE:
381 rrdinfocode(rrd_update_v);
382 OUTPUT:
383 RETVAL