2 * Substantial penalty for early withdrawal.
7 #include "../../src/rrd_tool.h"
9 typedef struct string_arr_t {
22 #define RRD_CHECK_ERROR \
23 if (rrd_test_error()) \
24 rb_raise(rb_eRRDError, rrd_get_error()); \
27 string_arr string_arr_new(
34 Check_Type(rb_strings, T_ARRAY);
35 a.len = RARRAY(rb_strings)->len + 1;
37 a.strings = malloc(a.len * sizeof(char *));
38 a.strings[0] = "dummy"; /* first element is a dummy element */
40 for (i = 0; i < a.len - 1; i++) {
41 VALUE v = rb_ary_entry(rb_strings, i);
45 a.strings[i + 1] = strdup(STR2CSTR(v));
48 snprintf(buf, 63, "%d", FIX2INT(v));
49 a.strings[i + 1] = strdup(buf);
52 rb_raise(rb_eTypeError,
53 "invalid argument - %s, expected T_STRING or T_FIXNUM on index %d",
54 rb_class2name(CLASS_OF(v)), i);
62 void string_arr_delete(
67 /* skip dummy first entry */
68 for (i = 1; i < a.len; i++) {
89 a = string_arr_new(args);
91 func(a.len, a.strings);
94 RRD_CHECK_ERROR return Qnil;
101 return rrd_call(rrd_create, args);
108 return rrd_call(rrd_dump, args);
116 unsigned long i, j, k, step, ds_cnt;
117 rrd_value_t *raw_data;
119 VALUE data, names, result;
122 a = string_arr_new(args);
124 rrd_fetch(a.len, a.strings, &start, &end, &step, &ds_cnt, &raw_names,
126 string_arr_delete(a);
128 RRD_CHECK_ERROR names = rb_ary_new();
130 for (i = 0; i < ds_cnt; i++) {
131 rb_ary_push(names, rb_str_new2(raw_names[i]));
138 for (i = start; i <= end; i += step) {
139 VALUE line = rb_ary_new2(ds_cnt);
141 for (j = 0; j < ds_cnt; j++) {
142 rb_ary_store(line, j, rb_float_new(raw_data[k]));
145 rb_ary_push(data, line);
149 result = rb_ary_new2(5);
150 rb_ary_store(result, 0, INT2NUM(start));
151 rb_ary_store(result, 1, INT2NUM(end));
152 rb_ary_store(result, 2, names);
153 rb_ary_store(result, 3, data);
154 rb_ary_store(result, 4, INT2FIX(step));
164 VALUE result, print_results;
168 a = string_arr_new(args);
170 rrd_graph(a.len, a.strings, &calcpr, &xsize, &ysize, NULL, &ymin, &ymax);
171 string_arr_delete(a);
173 RRD_CHECK_ERROR result = rb_ary_new2(3);
175 print_results = rb_ary_new();
177 for (p = calcpr; p && *p; p++) {
178 rb_ary_push(print_results, rb_str_new2(*p));
182 rb_ary_store(result, 0, print_results);
183 rb_ary_store(result, 1, INT2FIX(xsize));
184 rb_ary_store(result, 2, INT2FIX(ysize));
196 a = string_arr_new(args);
197 data = rrd_info(a.len, a.strings);
198 string_arr_delete(a);
200 RRD_CHECK_ERROR result = rb_hash_new();
203 VALUE key = rb_str_new2(data->key);
205 switch (data->type) {
207 if (isnan(data->value.u_val)) {
208 rb_hash_aset(result, key, Qnil);
210 rb_hash_aset(result, key, rb_float_new(data->value.u_val));
214 rb_hash_aset(result, key, INT2FIX(data->value.u_cnt));
217 rb_hash_aset(result, key, rb_str_new2(data->value.u_str));
218 free(data->value.u_str);
235 a = string_arr_new(args);
237 last = rrd_last(a.len, a.strings);
238 string_arr_delete(a);
241 return rb_funcall(rb_cTime, rb_intern("at"), 1, INT2FIX(last));
248 return rrd_call(rrd_resize, args);
251 VALUE rb_rrd_restore(
255 return rrd_call(rrd_restore, args);
262 return rrd_call(rrd_tune, args);
269 return rrd_call(rrd_update, args);
275 mRRD = rb_define_module("RRD");
276 rb_eRRDError = rb_define_class("RRDError", rb_eStandardError);
278 rb_define_module_function(mRRD, "create", rb_rrd_create, -2);
279 rb_define_module_function(mRRD, "dump", rb_rrd_dump, -2);
280 rb_define_module_function(mRRD, "fetch", rb_rrd_fetch, -2);
281 rb_define_module_function(mRRD, "graph", rb_rrd_graph, -2);
282 rb_define_module_function(mRRD, "last", rb_rrd_last, -2);
283 rb_define_module_function(mRRD, "resize", rb_rrd_resize, -2);
284 rb_define_module_function(mRRD, "restore", rb_rrd_restore, -2);
285 rb_define_module_function(mRRD, "tune", rb_rrd_tune, -2);
286 rb_define_module_function(mRRD, "update", rb_rrd_update, -2);
287 rb_define_module_function(mRRD, "info", rb_rrd_info, -2);