1 /*****************************************************************************
2 * RRDtool 1.1.x Copyright Tobias Oetiker, 1997 - 2002
3 *****************************************************************************
4 * rrd_fetch.c read date from an rrd to use for further processing
5 *****************************************************************************
8 * Revision 1.7 2003/11/11 19:46:21 oetiker
9 * replaced time_value with rrd_time_value as MacOS X introduced a struct of that name in their standard headers
11 * Revision 1.6 2003/01/16 23:27:54 oetiker
12 * fix border condition in rra selection of rrd_fetch
13 * -- Stanislav Sinyagin <ssinyagin@yahoo.com>
15 * Revision 1.5 2002/06/23 22:29:40 alex
16 * Added "step=1800" and such to "DEF"
17 * Cleaned some of the signed vs. unsigned problems
19 * Revision 1.4 2002/02/01 20:34:49 oetiker
20 * fixed version number and date/time
22 * Revision 1.3 2001/12/24 06:51:49 alex
23 * A patch of size 44Kbytes... in short:
25 * Found and repaired the off-by-one error in rrd_fetch_fn().
26 * As a result I had to remove the hacks in rrd_fetch_fn(),
27 * rrd_tool.c, vdef_calc(), data_calc(), data_proc() and
28 * reduce_data(). There may be other places which I didn't
31 * Enhanced debugging in rrd_fetch_fn(), it shows the RRA selection
34 * Added the ability to print VDEF timestamps. At the moment it
35 * is a hack, I needed it now to fix the off-by-one error.
36 * If the format string is "%c" (and nothing else!), the time
37 * will be printed by both ctime() and as a long int.
39 * Moved some code around (slightly altering it) from rrd_graph()
40 * initializing now in rrd_graph_init()
41 * options parsing now in rrd_graph_options()
42 * script parsing now in rrd_graph_script()
44 * Revision 1.2 2001/12/17 12:48:43 oetiker
45 * fix overflow error ...
47 * Revision 1.1.1.1 2001/02/25 22:25:05 oetiker
50 *****************************************************************************/
59 time_t *end, /* which time frame do you want ?
60 * will be changed to represent reality */
61 unsigned long *step, /* which stepsize do you want?
62 * will be changed to represent reality */
63 unsigned long *ds_cnt, /* number of data sources in file */
64 char ***ds_namv, /* names of data sources */
65 rrd_value_t **data) /* two dimensional array containing the data */
70 time_t start_tmp=0, end_tmp=0;
73 struct rrd_time_value start_tv, end_tv;
74 char *parsetime_error = NULL;
76 /* init start and end time */
77 parsetime("end-24h", &start_tv);
78 parsetime("now", &end_tv);
81 static struct option long_options[] =
83 {"resolution", required_argument, 0, 'r'},
84 {"start", required_argument, 0, 's'},
85 {"end", required_argument, 0, 'e'},
90 opt = getopt_long(argc, argv, "r:s:e:",
91 long_options, &option_index);
98 if ((parsetime_error = parsetime(optarg, &start_tv))) {
99 rrd_set_error( "start time: %s", parsetime_error );
104 if ((parsetime_error = parsetime(optarg, &end_tv))) {
105 rrd_set_error( "end time: %s", parsetime_error );
110 step_tmp = atol(optarg);
113 rrd_set_error("unknown option '-%c'",optopt);
119 if (proc_start_end(&start_tv,&end_tv,&start_tmp,&end_tmp) == -1){
124 if (start_tmp < 3600*24*365*10){
125 rrd_set_error("the first entry to fetch should be after 1980");
129 if (end_tmp < start_tmp) {
130 rrd_set_error("start (%ld) should be less than end (%ld)", start_tmp, end_tmp);
138 rrd_set_error("step must be >= 1 second");
143 if (optind + 1 >= argc){
144 rrd_set_error("not enough arguments");
148 if ((int)(cf_idx=cf_conv(argv[optind+1])) == -1 ){
152 if (rrd_fetch_fn(argv[optind],cf_idx,start,end,step,ds_cnt,ds_namv,data) == -1)
159 char *filename, /* name of the rrd */
160 enum cf_en cf_idx, /* which consolidation function ?*/
162 time_t *end, /* which time frame do you want ?
163 * will be changed to represent reality */
164 unsigned long *step, /* which stepsize do you want?
165 * will be changed to represent reality */
166 unsigned long *ds_cnt, /* number of data sources in file */
167 char ***ds_namv, /* names of data_sources */
168 rrd_value_t **data) /* two dimensional array containing the data */
172 time_t cal_start,cal_end, rra_start_time,rra_end_time;
173 long best_full_rra=0, best_part_rra=0, chosen_rra=0, rra_pointer=0;
174 long best_step_diff=0, tmp_step_diff=0, tmp_match=0, best_match=0;
175 long full_match, rra_base;
176 long start_offset, end_offset;
180 rrd_value_t *data_ptr;
181 unsigned long rows = (*end - *start) / *step;
184 fprintf(stderr,"Entered rrd_fetch_fn() searching for the best match\n");
185 fprintf(stderr,"Looking for: start %10lu end %10lu step %5lu rows %lu\n",
186 *start,*end,*step,rows);
189 if(rrd_open(filename,&in_file,&rrd, RRD_READONLY)==-1)
192 /* when was the realy last update of this file ? */
194 if (((*ds_namv) = (char **) malloc(rrd.stat_head->ds_cnt * sizeof(char*)))==NULL){
195 rrd_set_error("malloc fetch ds_namv array");
201 for(i=0;(unsigned long)i<rrd.stat_head->ds_cnt;i++){
202 if ((((*ds_namv)[i]) = malloc(sizeof(char) * DS_NAM_SIZE))==NULL){
203 rrd_set_error("malloc fetch ds_namv entry");
209 strncpy((*ds_namv)[i],rrd.ds_def[i].ds_nam,DS_NAM_SIZE-1);
210 (*ds_namv)[i][DS_NAM_SIZE-1]='\0';
214 /* find the rra which best matches the requirements */
215 for(i=0;(unsigned)i<rrd.stat_head->rra_cnt;i++){
216 if(cf_conv(rrd.rra_def[i].cf_nam) == cf_idx){
218 cal_end = (rrd.live_head->last_up - (rrd.live_head->last_up
219 % (rrd.rra_def[i].pdp_cnt
220 * rrd.stat_head->pdp_step)));
222 - (rrd.rra_def[i].pdp_cnt
223 * rrd.rra_def[i].row_cnt
224 * rrd.stat_head->pdp_step));
226 full_match = *end -*start;
228 fprintf(stderr,"Considering: start %10lu end %10lu step %5lu ",
230 rrd.stat_head->pdp_step * rrd.rra_def[i].pdp_cnt);
232 /* we need step difference in either full or partial case */
233 tmp_step_diff = labs(*step - (rrd.stat_head->pdp_step
234 * rrd.rra_def[i].pdp_cnt));
235 /* best full match */
237 && cal_start <= *start){
238 if (first_full || (tmp_step_diff < best_step_diff)){
240 best_step_diff = tmp_step_diff;
243 fprintf(stderr,"best full match so far\n");
247 fprintf(stderr,"full match, not best\n");
252 /* best partial match */
253 tmp_match = full_match;
254 if (cal_start>*start)
255 tmp_match -= (cal_start-*start);
257 tmp_match -= (*end-cal_end);
259 (best_match < tmp_match) ||
260 (best_match == tmp_match &&
261 tmp_step_diff < best_step_diff)){
263 fprintf(stderr,"best partial so far\n");
266 best_match = tmp_match;
267 best_step_diff = tmp_step_diff;
271 fprintf(stderr,"partial match, not best\n");
278 /* lets see how the matching went. */
280 chosen_rra = best_full_rra;
281 else if (first_part==0)
282 chosen_rra = best_part_rra;
284 rrd_set_error("the RRD does not contain an RRA matching the chosen CF");
290 /* set the wish parameters to their real values */
291 *step = rrd.stat_head->pdp_step * rrd.rra_def[chosen_rra].pdp_cnt;
292 *start -= (*start % *step);
293 if (*end % *step) *end += (*step - *end % *step);
294 rows = (*end - *start) / *step;
297 fprintf(stderr,"We found: start %10lu end %10lu step %5lu rows %lu\n",
298 *start,*end,*step,rows);
301 /* Start and end are now multiples of the step size. The amount of
302 ** steps we want is (end-start)/step and *not* an extra one.
303 ** Reasoning: if step is s and we want to graph from t to t+s,
304 ** we need exactly ((t+s)-t)/s rows. The row to collect from the
305 ** database is the one with time stamp (t+s) which means t to t+s.
307 *ds_cnt = rrd.stat_head->ds_cnt;
308 if (((*data) = malloc(*ds_cnt * rows * sizeof(rrd_value_t)))==NULL){
309 rrd_set_error("malloc fetch data area");
310 for (i=0;(unsigned long)i<*ds_cnt;i++)
320 /* find base address of rra */
321 rra_base=ftell(in_file);
322 for(i=0;i<chosen_rra;i++)
323 rra_base += ( *ds_cnt
324 * rrd.rra_def[i].row_cnt
325 * sizeof(rrd_value_t));
327 /* find start and end offset */
328 rra_end_time = (rrd.live_head->last_up
329 - (rrd.live_head->last_up % *step));
330 rra_start_time = (rra_end_time
331 - ( *step * (rrd.rra_def[chosen_rra].row_cnt-1)));
332 /* here's an error by one if we don't be careful */
333 start_offset =(long)(*start + *step - rra_start_time) / (long)*step;
334 end_offset = (long)(rra_end_time - *end ) / (long)*step;
336 fprintf(stderr,"rra_start %lu, rra_end %lu, start_off %li, end_off %li\n",
337 rra_start_time,rra_end_time,start_offset,end_offset);
340 /* fill the gap at the start if needs be */
342 if (start_offset <= 0)
343 rra_pointer = rrd.rra_ptr[chosen_rra].cur_row+1;
345 rra_pointer = rrd.rra_ptr[chosen_rra].cur_row+1+start_offset;
347 if(fseek(in_file,(rra_base
350 * sizeof(rrd_value_t))),SEEK_SET) != 0){
351 rrd_set_error("seek error in RRA");
352 for (i=0;(unsigned)i<*ds_cnt;i++)
363 fprintf(stderr,"First Seek: rra_base %lu rra_pointer %lu\n",
364 rra_base, rra_pointer);
366 /* step trough the array */
369 i< (signed)rrd.rra_def[chosen_rra].row_cnt - end_offset;
371 /* no valid data yet */
374 fprintf(stderr,"pre fetch %li -- ",i);
376 for(ii=0;(unsigned)ii<*ds_cnt;ii++){
377 *(data_ptr++) = DNAN;
379 fprintf(stderr,"%10.2f ",*(data_ptr-1));
383 /* past the valid data area */
384 else if (i >= (signed)rrd.rra_def[chosen_rra].row_cnt) {
386 fprintf(stderr,"post fetch %li -- ",i);
388 for(ii=0;(unsigned)ii<*ds_cnt;ii++){
389 *(data_ptr++) = DNAN;
391 fprintf(stderr,"%10.2f ",*(data_ptr-1));
395 /* OK we are inside the valid area but the pointer has to
397 if (rra_pointer >= (signed)rrd.rra_def[chosen_rra].row_cnt) {
398 rra_pointer -= rrd.rra_def[chosen_rra].row_cnt;
399 if(fseek(in_file,(rra_base+rra_pointer
401 * sizeof(rrd_value_t)),SEEK_SET) != 0){
402 rrd_set_error("wrap seek in RRA did fail");
403 for (ii=0;(unsigned)ii<*ds_cnt;ii++)
404 free((*ds_namv)[ii]);
413 fprintf(stderr,"wrap seek ...\n");
419 *ds_cnt,in_file) != rrd.stat_head->ds_cnt){
420 rrd_set_error("fetching cdp from rra");
421 for (ii=0;(unsigned)ii<*ds_cnt;ii++)
422 free((*ds_namv)[ii]);
431 fprintf(stderr,"post fetch %li -- ",i);
432 for(ii=0;ii<*ds_cnt;ii++)
433 fprintf(stderr,"%10.2f ",*(data_ptr+ii));
439 fprintf(stderr,"\n");