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.6 2003/01/16 23:27:54 oetiker
9 * fix border condition in rra selection of rrd_fetch
10 * -- Stanislav Sinyagin <ssinyagin@yahoo.com>
12 * Revision 1.5 2002/06/23 22:29:40 alex
13 * Added "step=1800" and such to "DEF"
14 * Cleaned some of the signed vs. unsigned problems
16 * Revision 1.4 2002/02/01 20:34:49 oetiker
17 * fixed version number and date/time
19 * Revision 1.3 2001/12/24 06:51:49 alex
20 * A patch of size 44Kbytes... in short:
22 * Found and repaired the off-by-one error in rrd_fetch_fn().
23 * As a result I had to remove the hacks in rrd_fetch_fn(),
24 * rrd_tool.c, vdef_calc(), data_calc(), data_proc() and
25 * reduce_data(). There may be other places which I didn't
28 * Enhanced debugging in rrd_fetch_fn(), it shows the RRA selection
31 * Added the ability to print VDEF timestamps. At the moment it
32 * is a hack, I needed it now to fix the off-by-one error.
33 * If the format string is "%c" (and nothing else!), the time
34 * will be printed by both ctime() and as a long int.
36 * Moved some code around (slightly altering it) from rrd_graph()
37 * initializing now in rrd_graph_init()
38 * options parsing now in rrd_graph_options()
39 * script parsing now in rrd_graph_script()
41 * Revision 1.2 2001/12/17 12:48:43 oetiker
42 * fix overflow error ...
44 * Revision 1.1.1.1 2001/02/25 22:25:05 oetiker
47 *****************************************************************************/
56 time_t *end, /* which time frame do you want ?
57 * will be changed to represent reality */
58 unsigned long *step, /* which stepsize do you want?
59 * will be changed to represent reality */
60 unsigned long *ds_cnt, /* number of data sources in file */
61 char ***ds_namv, /* names of data sources */
62 rrd_value_t **data) /* two dimensional array containing the data */
67 time_t start_tmp=0, end_tmp=0;
70 struct time_value start_tv, end_tv;
71 char *parsetime_error = NULL;
73 /* init start and end time */
74 parsetime("end-24h", &start_tv);
75 parsetime("now", &end_tv);
78 static struct option long_options[] =
80 {"resolution", required_argument, 0, 'r'},
81 {"start", required_argument, 0, 's'},
82 {"end", required_argument, 0, 'e'},
87 opt = getopt_long(argc, argv, "r:s:e:",
88 long_options, &option_index);
95 if ((parsetime_error = parsetime(optarg, &start_tv))) {
96 rrd_set_error( "start time: %s", parsetime_error );
101 if ((parsetime_error = parsetime(optarg, &end_tv))) {
102 rrd_set_error( "end time: %s", parsetime_error );
107 step_tmp = atol(optarg);
110 rrd_set_error("unknown option '-%c'",optopt);
116 if (proc_start_end(&start_tv,&end_tv,&start_tmp,&end_tmp) == -1){
121 if (start_tmp < 3600*24*365*10){
122 rrd_set_error("the first entry to fetch should be after 1980");
126 if (end_tmp < start_tmp) {
127 rrd_set_error("start (%ld) should be less than end (%ld)", start_tmp, end_tmp);
135 rrd_set_error("step must be >= 1 second");
140 if (optind + 1 >= argc){
141 rrd_set_error("not enough arguments");
145 if ((int)(cf_idx=cf_conv(argv[optind+1])) == -1 ){
149 if (rrd_fetch_fn(argv[optind],cf_idx,start,end,step,ds_cnt,ds_namv,data) == -1)
156 char *filename, /* name of the rrd */
157 enum cf_en cf_idx, /* which consolidation function ?*/
159 time_t *end, /* which time frame do you want ?
160 * will be changed to represent reality */
161 unsigned long *step, /* which stepsize do you want?
162 * will be changed to represent reality */
163 unsigned long *ds_cnt, /* number of data sources in file */
164 char ***ds_namv, /* names of data_sources */
165 rrd_value_t **data) /* two dimensional array containing the data */
169 time_t cal_start,cal_end, rra_start_time,rra_end_time;
170 long best_full_rra=0, best_part_rra=0, chosen_rra=0, rra_pointer=0;
171 long best_step_diff=0, tmp_step_diff=0, tmp_match=0, best_match=0;
172 long full_match, rra_base;
173 long start_offset, end_offset;
177 rrd_value_t *data_ptr;
178 unsigned long rows = (*end - *start) / *step;
181 fprintf(stderr,"Entered rrd_fetch_fn() searching for the best match\n");
182 fprintf(stderr,"Looking for: start %10lu end %10lu step %5lu rows %lu\n",
183 *start,*end,*step,rows);
186 if(rrd_open(filename,&in_file,&rrd, RRD_READONLY)==-1)
189 /* when was the realy last update of this file ? */
191 if (((*ds_namv) = (char **) malloc(rrd.stat_head->ds_cnt * sizeof(char*)))==NULL){
192 rrd_set_error("malloc fetch ds_namv array");
198 for(i=0;(unsigned long)i<rrd.stat_head->ds_cnt;i++){
199 if ((((*ds_namv)[i]) = malloc(sizeof(char) * DS_NAM_SIZE))==NULL){
200 rrd_set_error("malloc fetch ds_namv entry");
206 strncpy((*ds_namv)[i],rrd.ds_def[i].ds_nam,DS_NAM_SIZE-1);
207 (*ds_namv)[i][DS_NAM_SIZE-1]='\0';
211 /* find the rra which best matches the requirements */
212 for(i=0;(unsigned)i<rrd.stat_head->rra_cnt;i++){
213 if(cf_conv(rrd.rra_def[i].cf_nam) == cf_idx){
215 cal_end = (rrd.live_head->last_up - (rrd.live_head->last_up
216 % (rrd.rra_def[i].pdp_cnt
217 * rrd.stat_head->pdp_step)));
219 - (rrd.rra_def[i].pdp_cnt
220 * rrd.rra_def[i].row_cnt
221 * rrd.stat_head->pdp_step));
223 full_match = *end -*start;
225 fprintf(stderr,"Considering: start %10lu end %10lu step %5lu ",
227 rrd.stat_head->pdp_step * rrd.rra_def[i].pdp_cnt);
229 /* we need step difference in either full or partial case */
230 tmp_step_diff = labs(*step - (rrd.stat_head->pdp_step
231 * rrd.rra_def[i].pdp_cnt));
232 /* best full match */
234 && cal_start <= *start){
235 if (first_full || (tmp_step_diff < best_step_diff)){
237 best_step_diff = tmp_step_diff;
240 fprintf(stderr,"best full match so far\n");
244 fprintf(stderr,"full match, not best\n");
249 /* best partial match */
250 tmp_match = full_match;
251 if (cal_start>*start)
252 tmp_match -= (cal_start-*start);
254 tmp_match -= (*end-cal_end);
256 (best_match < tmp_match) ||
257 (best_match == tmp_match &&
258 tmp_step_diff < best_step_diff)){
260 fprintf(stderr,"best partial so far\n");
263 best_match = tmp_match;
264 best_step_diff = tmp_step_diff;
268 fprintf(stderr,"partial match, not best\n");
275 /* lets see how the matching went. */
277 chosen_rra = best_full_rra;
278 else if (first_part==0)
279 chosen_rra = best_part_rra;
281 rrd_set_error("the RRD does not contain an RRA matching the chosen CF");
287 /* set the wish parameters to their real values */
288 *step = rrd.stat_head->pdp_step * rrd.rra_def[chosen_rra].pdp_cnt;
289 *start -= (*start % *step);
290 if (*end % *step) *end += (*step - *end % *step);
291 rows = (*end - *start) / *step;
294 fprintf(stderr,"We found: start %10lu end %10lu step %5lu rows %lu\n",
295 *start,*end,*step,rows);
298 /* Start and end are now multiples of the step size. The amount of
299 ** steps we want is (end-start)/step and *not* an extra one.
300 ** Reasoning: if step is s and we want to graph from t to t+s,
301 ** we need exactly ((t+s)-t)/s rows. The row to collect from the
302 ** database is the one with time stamp (t+s) which means t to t+s.
304 *ds_cnt = rrd.stat_head->ds_cnt;
305 if (((*data) = malloc(*ds_cnt * rows * sizeof(rrd_value_t)))==NULL){
306 rrd_set_error("malloc fetch data area");
307 for (i=0;(unsigned long)i<*ds_cnt;i++)
317 /* find base address of rra */
318 rra_base=ftell(in_file);
319 for(i=0;i<chosen_rra;i++)
320 rra_base += ( *ds_cnt
321 * rrd.rra_def[i].row_cnt
322 * sizeof(rrd_value_t));
324 /* find start and end offset */
325 rra_end_time = (rrd.live_head->last_up
326 - (rrd.live_head->last_up % *step));
327 rra_start_time = (rra_end_time
328 - ( *step * (rrd.rra_def[chosen_rra].row_cnt-1)));
329 /* here's an error by one if we don't be careful */
330 start_offset =(long)(*start + *step - rra_start_time) / (long)*step;
331 end_offset = (long)(rra_end_time - *end ) / (long)*step;
333 fprintf(stderr,"rra_start %lu, rra_end %lu, start_off %li, end_off %li\n",
334 rra_start_time,rra_end_time,start_offset,end_offset);
337 /* fill the gap at the start if needs be */
339 if (start_offset <= 0)
340 rra_pointer = rrd.rra_ptr[chosen_rra].cur_row+1;
342 rra_pointer = rrd.rra_ptr[chosen_rra].cur_row+1+start_offset;
344 if(fseek(in_file,(rra_base
347 * sizeof(rrd_value_t))),SEEK_SET) != 0){
348 rrd_set_error("seek error in RRA");
349 for (i=0;(unsigned)i<*ds_cnt;i++)
360 fprintf(stderr,"First Seek: rra_base %lu rra_pointer %lu\n",
361 rra_base, rra_pointer);
363 /* step trough the array */
366 i< (signed)rrd.rra_def[chosen_rra].row_cnt - end_offset;
368 /* no valid data yet */
371 fprintf(stderr,"pre fetch %li -- ",i);
373 for(ii=0;(unsigned)ii<*ds_cnt;ii++){
374 *(data_ptr++) = DNAN;
376 fprintf(stderr,"%10.2f ",*(data_ptr-1));
380 /* past the valid data area */
381 else if (i >= (signed)rrd.rra_def[chosen_rra].row_cnt) {
383 fprintf(stderr,"post fetch %li -- ",i);
385 for(ii=0;(unsigned)ii<*ds_cnt;ii++){
386 *(data_ptr++) = DNAN;
388 fprintf(stderr,"%10.2f ",*(data_ptr-1));
392 /* OK we are inside the valid area but the pointer has to
394 if (rra_pointer >= (signed)rrd.rra_def[chosen_rra].row_cnt) {
395 rra_pointer -= rrd.rra_def[chosen_rra].row_cnt;
396 if(fseek(in_file,(rra_base+rra_pointer
398 * sizeof(rrd_value_t)),SEEK_SET) != 0){
399 rrd_set_error("wrap seek in RRA did fail");
400 for (ii=0;(unsigned)ii<*ds_cnt;ii++)
401 free((*ds_namv)[ii]);
410 fprintf(stderr,"wrap seek ...\n");
416 *ds_cnt,in_file) != rrd.stat_head->ds_cnt){
417 rrd_set_error("fetching cdp from rra");
418 for (ii=0;(unsigned)ii<*ds_cnt;ii++)
419 free((*ds_namv)[ii]);
428 fprintf(stderr,"post fetch %li -- ",i);
429 for(ii=0;ii<*ds_cnt;ii++)
430 fprintf(stderr,"%10.2f ",*(data_ptr+ii));
436 fprintf(stderr,"\n");