|
@@ -268,7 +268,7 @@ int _ttail_search_files_binary_search(ttail_t* t, const struct tm* in,
|
268
|
268
|
/* found at EOF */
|
269
|
269
|
if(min)
|
270
|
270
|
{
|
271
|
|
- *off = _ttail_from_search_from_end(t, *id, in);
|
|
271
|
+ *off = _ttail_file_search_from_end(t, *id, in);
|
272
|
272
|
if(*off < 0)
|
273
|
273
|
{
|
274
|
274
|
*off = 0;
|
|
@@ -343,7 +343,7 @@ running binary search algorithm in '%s'\n", t->logfile_name[*id]);
|
343
|
343
|
return 0;
|
344
|
344
|
}
|
345
|
345
|
/* the answer is somewhere in *id file */
|
346
|
|
- *off = _ttail_from_search_from_end(t, *id, in);
|
|
346
|
+ *off = _ttail_file_search_from_end(t, *id, in);
|
347
|
347
|
return 0;
|
348
|
348
|
}
|
349
|
349
|
|
|
@@ -721,7 +721,7 @@ inline long _ttail_file_start_line(FILE* f)
|
721
|
721
|
return res;
|
722
|
722
|
}
|
723
|
723
|
|
724
|
|
-inline off_t _ttail_from_search_from_end(ttail_t* t , size_t id ,
|
|
724
|
+inline off_t _ttail_file_search_from_end(ttail_t* t , size_t id ,
|
725
|
725
|
const struct tm* tm)
|
726
|
726
|
{
|
727
|
727
|
FILE *f;
|