13 #include "../../src/rrd_tool.h"
15 /* perl 5.004 compatibility */
16 #if PERLPATCHLEVEL < 5
17 #define PL_sv_undef sv_undef
21 #define rrdcode(name) \
22 argv = (char **) malloc((items+1)*sizeof(char *));\
24 for (i = 0; i < items; i++) { \
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); \
34 RETVAL=name(items+1,argv); \
35 for (i=0; i < items; i++) {\
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 *)); \
48 for (i = 0; i < items; i++) { \
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); \
58 data=name(items+1, argv); \
59 for (i=0; i < items; i++) { \
63 if (rrd_test_error()) XSRETURN_UNDEF; \
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) { \
71 if (isnan(data->value.u_val)) \
74 hvs(newSVnv(data->value.u_val)); \
77 hvs(newSViv(data->value.u_int)); \
80 hvs(newSViv(data->value.u_cnt)); \
83 hvs(newSVpv(data->value.u_str,0)); \
84 rrd_freemem(data->value.u_str); \
87 rrd_freemem(data->key); \
92 RETVAL = newRV_noinc((SV*)hash);
95 * should not be needed if libc is linked (see ntmake.pl)
99 #define realloc realloc
104 MODULE = RRDs PACKAGE = RRDs PREFIX = rrd_
107 #ifdef MUST_DISABLE_SIGFPE
108 signal(SIGFPE,SIG_IGN);
110 #ifdef MUST_DISABLE_FPMASK
118 if (! rrd_test_error()) XSRETURN_UNDEF;
119 RETVAL = newSVpv(rrd_get_error(),0);
196 argv = (char **) malloc((items+1)*sizeof(char *));
198 for (i = 0; i < items; i++) {
200 char *handle = SvPV(ST(i),len);
201 /* actually copy the data to make sure possible modifications
202 on the argv data does not backfire into perl */
203 argv[i+1] = (char *) malloc((strlen(handle)+1)*sizeof(char));
204 strcpy(argv[i+1],handle);
208 rrd_graph(items+1,argv,&calcpr,&xsize,&ysize,NULL,&ymin,&ymax);
209 for (i=0; i < items; i++) {
214 if (rrd_test_error()) {
216 for(i=0;calcpr[i];i++)
217 rrd_freemem(calcpr[i]);
222 for(i=0;calcpr[i];i++){
223 av_push(retar,newSVpv(calcpr[i],0));
224 rrd_freemem(calcpr[i]);
229 PUSHs(sv_2mortal(newRV_noinc((SV*)retar)));
230 PUSHs(sv_2mortal(newSViv(xsize)));
231 PUSHs(sv_2mortal(newSViv(ysize)));
238 unsigned long step, ds_cnt,i,ii;
239 rrd_value_t *data,*datai;
242 AV *retar,*line,*names;
244 argv = (char **) malloc((items+1)*sizeof(char *));
246 for (i = 0; i < items; i++) {
248 char *handle= SvPV(ST(i),len);
249 /* actually copy the data to make sure possible modifications
250 on the argv data does not backfire into perl */
251 argv[i+1] = (char *) malloc((strlen(handle)+1)*sizeof(char));
252 strcpy(argv[i+1],handle);
256 rrd_fetch(items+1,argv,&start,&end,&step,&ds_cnt,&ds_namv,&data);
257 for (i=0; i < items; i++) {
261 if (rrd_test_error()) XSRETURN_UNDEF;
262 /* convert the ds_namv into perl format */
264 for (ii = 0; ii < ds_cnt; ii++){
265 av_push(names,newSVpv(ds_namv[ii],0));
266 rrd_freemem(ds_namv[ii]);
268 rrd_freemem(ds_namv);
269 /* convert the data array into perl format */
272 for (i = start+step; i <= end; i += step){
274 for (ii = 0; ii < ds_cnt; ii++){
275 av_push(line,(isnan(*datai) ? &PL_sv_undef : newSVnv(*datai)));
278 av_push(retar,newRV_noinc((SV*)line));
282 PUSHs(sv_2mortal(newSViv(start+step)));
283 PUSHs(sv_2mortal(newSViv(step)));
284 PUSHs(sv_2mortal(newRV_noinc((SV*)names)));
285 PUSHs(sv_2mortal(newRV_noinc((SV*)retar)));
288 rrd_times(start, end)
292 struct rrd_time_value start_tv, end_tv;
293 char *parsetime_error = NULL;
294 time_t start_tmp, end_tmp;
297 if( (parsetime_error = parsetime( start, &start_tv))) {
298 rrd_set_error( "start time: %s", parsetime_error);
301 if( (parsetime_error = parsetime( end, &end_tv))) {
302 rrd_set_error( "end time: %s", parsetime_error);
305 if( proc_start_end( &start_tv, &end_tv, &start_tmp, &end_tmp) == -1) {
309 PUSHs(sv_2mortal(newSVuv(start_tmp)));
310 PUSHs(sv_2mortal(newSVuv(end_tmp)));
318 unsigned long step, col_cnt,row_cnt,i,ii;
319 rrd_value_t *data,*ptr;
320 char **argv,**legend_v;
321 AV *retar,*line,*names;
323 argv = (char **) malloc((items+1)*sizeof(char *));
325 for (i = 0; i < items; i++) {
327 char *handle = SvPV(ST(i),len);
328 /* actually copy the data to make sure possible modifications
329 on the argv data does not backfire into perl */
330 argv[i+1] = (char *) malloc((strlen(handle)+1)*sizeof(char));
331 strcpy(argv[i+1],handle);
335 rrd_xport(items+1,argv,&xsize,&start,&end,&step,&col_cnt,&legend_v,&data);
336 for (i=0; i < items; i++) {
340 if (rrd_test_error()) XSRETURN_UNDEF;
342 /* convert the legend_v into perl format */
344 for (ii = 0; ii < col_cnt; ii++){
345 av_push(names,newSVpv(legend_v[ii],0));
346 rrd_freemem(legend_v[ii]);
348 rrd_freemem(legend_v);
350 /* convert the data array into perl format */
353 for (i = start+step; i <= end; i += step){
355 for (ii = 0; ii < col_cnt; ii++){
356 av_push(line,(isnan(*ptr) ? &PL_sv_undef : newSVnv(*ptr)));
359 av_push(retar,newRV_noinc((SV*)line));
364 PUSHs(sv_2mortal(newSViv(start+step)));
365 PUSHs(sv_2mortal(newSViv(end)));
366 PUSHs(sv_2mortal(newSViv(step)));
367 PUSHs(sv_2mortal(newSViv(col_cnt)));
368 PUSHs(sv_2mortal(newRV_noinc((SV*)names)));
369 PUSHs(sv_2mortal(newRV_noinc((SV*)retar)));
380 rrdinfocode(rrd_info);
393 rrdinfocode(rrd_update_v);
416 rrdcode(rrd_restore);