1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380
|
/* utimecmp.c -- compare file time stamps
Copyright (C) 2004-2007, 2009-2012 Free Software Foundation, Inc.
This program is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 3 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program. If not, see <http://www.gnu.org/licenses/>. */
/* Written by Paul Eggert. */
#include <config.h>
#include "utimecmp.h"
#include <limits.h>
#include <stdbool.h>
#include <stdint.h>
#include <stdlib.h>
#include <time.h>
#include <unistd.h>
#include "hash.h"
#include "intprops.h"
#include "stat-time.h"
#include "utimens.h"
#include "verify.h"
#ifndef MAX
# define MAX(a, b) ((a) > (b) ? (a) : (b))
#endif
#define BILLION (1000 * 1000 * 1000)
/* Best possible resolution that utimens can set and stat can return,
due to system-call limitations. It must be a power of 10 that is
no greater than 1 billion. */
#if HAVE_UTIMENSAT
enum { SYSCALL_RESOLUTION = 1 };
#elif ((HAVE_FUTIMESAT || HAVE_WORKING_UTIMES) \
&& (defined HAVE_STRUCT_STAT_ST_ATIM_TV_NSEC \
|| defined HAVE_STRUCT_STAT_ST_ATIMESPEC_TV_NSEC \
|| defined HAVE_STRUCT_STAT_ST_ATIMENSEC \
|| defined HAVE_STRUCT_STAT_ST_ATIM_ST__TIM_TV_NSEC \
|| defined HAVE_STRUCT_STAT_ST_SPARE1))
enum { SYSCALL_RESOLUTION = 1000 };
#else
enum { SYSCALL_RESOLUTION = BILLION };
#endif
/* Describe a file system and its time stamp resolution in nanoseconds. */
struct fs_res
{
/* Device number of file system. */
dev_t dev;
/* An upper bound on the time stamp resolution of this file system,
ignoring any resolution that cannot be set via utimens. It is
represented by an integer count of nanoseconds. It must be
either 2 billion, or a power of 10 that is no greater than a
billion and is no less than SYSCALL_RESOLUTION. */
int resolution;
/* True if RESOLUTION is known to be exact, and is not merely an
upper bound on the true resolution. */
bool exact;
};
/* Hash some device info. */
static size_t
dev_info_hash (void const *x, size_t table_size)
{
struct fs_res const *p = x;
/* Beware signed arithmetic gotchas. */
if (TYPE_SIGNED (dev_t) && SIZE_MAX < MAX (INT_MAX, TYPE_MAXIMUM (dev_t)))
{
uintmax_t dev = p->dev;
return dev % table_size;
}
return p->dev % table_size;
}
/* Compare two dev_info structs. */
static bool
dev_info_compare (void const *x, void const *y)
{
struct fs_res const *a = x;
struct fs_res const *b = y;
return a->dev == b->dev;
}
/* Return -1, 0, 1 based on whether the destination file (with name
DST_NAME and status DST_STAT) is older than SRC_STAT, the same age
as SRC_STAT, or newer than SRC_STAT, respectively.
DST_NAME may be NULL if OPTIONS is 0.
If OPTIONS & UTIMECMP_TRUNCATE_SOURCE, do the comparison after SRC is
converted to the destination's timestamp resolution as filtered through
utimens. In this case, return -2 if the exact answer cannot be
determined; this can happen only if the time stamps are very close and
there is some trouble accessing the file system (e.g., the user does not
have permission to futz with the destination's time stamps). */
int
utimecmp (char const *dst_name,
struct stat const *dst_stat,
struct stat const *src_stat,
int options)
{
/* Things to watch out for:
The code uses a static hash table internally and is not safe in the
presence of signals, multiple threads, etc. However, memory pressure
that prevents use of the hash table is not fatal - we just fall back
to redoing the computations on every call in that case.
int and long int might be 32 bits. Many of the calculations store
numbers up to 2 billion, and multiply by 10; they have to avoid
multiplying 2 billion by 10, as this exceeds 32-bit capabilities.
time_t might be unsigned. */
verify (TYPE_IS_INTEGER (time_t));
verify (TYPE_TWOS_COMPLEMENT (int));
/* Destination and source time stamps. */
time_t dst_s = dst_stat->st_mtime;
time_t src_s = src_stat->st_mtime;
int dst_ns = get_stat_mtime_ns (dst_stat);
int src_ns = get_stat_mtime_ns (src_stat);
if (options & UTIMECMP_TRUNCATE_SOURCE)
{
/* Look up the time stamp resolution for the destination device. */
/* Hash table for caching information learned about devices. */
static Hash_table *ht;
/* Information about the destination file system. */
static struct fs_res *new_dst_res;
struct fs_res *dst_res = NULL;
struct fs_res tmp_dst_res;
/* Time stamp resolution in nanoseconds. */
int res;
/* Quick exit, if possible. Since the worst resolution is 2
seconds, anything that differs by more than that does not
needs source truncation. */
if (dst_s == src_s && dst_ns == src_ns)
return 0;
if (dst_s <= src_s - 2)
return -1;
if (src_s <= dst_s - 2)
return 1;
/* Try to do a hash lookup, but fall back to stack variables and
recomputation on low memory situations. */
if (! ht)
ht = hash_initialize (16, NULL, dev_info_hash, dev_info_compare, free);
if (ht)
{
if (! new_dst_res)
{
new_dst_res = malloc (sizeof *new_dst_res);
if (!new_dst_res)
goto low_memory;
new_dst_res->resolution = 2 * BILLION;
new_dst_res->exact = false;
}
new_dst_res->dev = dst_stat->st_dev;
dst_res = hash_insert (ht, new_dst_res);
if (! dst_res)
goto low_memory;
if (dst_res == new_dst_res)
{
/* NEW_DST_RES is now in use in the hash table, so allocate a
new entry next time. */
new_dst_res = NULL;
}
}
else
{
low_memory:
if (ht)
{
tmp_dst_res.dev = dst_stat->st_dev;
dst_res = hash_lookup (ht, &tmp_dst_res);
}
if (!dst_res)
{
dst_res = &tmp_dst_res;
dst_res->resolution = 2 * BILLION;
dst_res->exact = false;
}
}
res = dst_res->resolution;
#ifdef _PC_TIMESTAMP_RESOLUTION
/* If the system will tell us the resolution, we're set! */
if (! dst_res->exact)
{
res = pathconf (dst_name, _PC_TIMESTAMP_RESOLUTION);
if (0 < res)
{
dst_res->resolution = res;
dst_res->exact = true;
}
}
#endif
if (! dst_res->exact)
{
/* This file system's resolution is not known exactly.
Deduce it, and store the result in the hash table. */
time_t dst_a_s = dst_stat->st_atime;
time_t dst_c_s = dst_stat->st_ctime;
time_t dst_m_s = dst_s;
int dst_a_ns = get_stat_atime_ns (dst_stat);
int dst_c_ns = get_stat_ctime_ns (dst_stat);
int dst_m_ns = dst_ns;
/* Set RES to an upper bound on the file system resolution
(after truncation due to SYSCALL_RESOLUTION) by inspecting
the atime, ctime and mtime of the existing destination.
We don't know of any file system that stores atime or
ctime with a higher precision than mtime, so it's valid to
look at them too. */
{
bool odd_second = (dst_a_s | dst_c_s | dst_m_s) & 1;
if (SYSCALL_RESOLUTION == BILLION)
{
if (odd_second | dst_a_ns | dst_c_ns | dst_m_ns)
res = BILLION;
}
else
{
int a = dst_a_ns;
int c = dst_c_ns;
int m = dst_m_ns;
/* Write it this way to avoid mistaken GCC warning
about integer overflow in constant expression. */
int SR10 = SYSCALL_RESOLUTION; SR10 *= 10;
if ((a % SR10 | c % SR10 | m % SR10) != 0)
res = SYSCALL_RESOLUTION;
else
for (res = SR10, a /= SR10, c /= SR10, m /= SR10;
(res < dst_res->resolution
&& (a % 10 | c % 10 | m % 10) == 0);
res *= 10, a /= 10, c /= 10, m /= 10)
if (res == BILLION)
{
if (! odd_second)
res *= 2;
break;
}
}
dst_res->resolution = res;
}
if (SYSCALL_RESOLUTION < res)
{
struct timespec timespec[2];
struct stat dst_status;
/* Ignore source time stamp information that must necessarily
be lost when filtered through utimens. */
src_ns -= src_ns % SYSCALL_RESOLUTION;
/* If the time stamps disagree widely enough, there's no need
to interrogate the file system to deduce the exact time
stamp resolution; return the answer directly. */
{
time_t s = src_s & ~ (res == 2 * BILLION);
if (src_s < dst_s || (src_s == dst_s && src_ns <= dst_ns))
return 1;
if (dst_s < s
|| (dst_s == s && dst_ns < src_ns - src_ns % res))
return -1;
}
/* Determine the actual time stamp resolution for the
destination file system (after truncation due to
SYSCALL_RESOLUTION) by setting the access time stamp of the
destination to the existing access time, except with
trailing nonzero digits. */
timespec[0].tv_sec = dst_a_s;
timespec[0].tv_nsec = dst_a_ns;
timespec[1].tv_sec = dst_m_s | (res == 2 * BILLION);
timespec[1].tv_nsec = dst_m_ns + res / 9;
/* Set the modification time. But don't try to set the
modification time of symbolic links; on many hosts this sets
the time of the pointed-to file. */
if ((S_ISLNK (dst_stat->st_mode)
? lutimens (dst_name, timespec)
: utimens (dst_name, timespec)) != 0)
return -2;
/* Read the modification time that was set. */
{
int stat_result = (S_ISLNK (dst_stat->st_mode)
? lstat (dst_name, &dst_status)
: stat (dst_name, &dst_status));
if (stat_result
| (dst_status.st_mtime ^ dst_m_s)
| (get_stat_mtime_ns (&dst_status) ^ dst_m_ns))
{
/* The modification time changed, or we can't tell whether
it changed. Change it back as best we can. */
timespec[1].tv_sec = dst_m_s;
timespec[1].tv_nsec = dst_m_ns;
if (S_ISLNK (dst_stat->st_mode))
lutimens (dst_name, timespec);
else
utimens (dst_name, timespec);
}
if (stat_result != 0)
return -2;
}
/* Determine the exact resolution from the modification time
that was read back. */
{
int old_res = res;
int a = (BILLION * (dst_status.st_mtime & 1)
+ get_stat_mtime_ns (&dst_status));
res = SYSCALL_RESOLUTION;
for (a /= res; a % 10 == 0; a /= 10)
{
if (res == BILLION)
{
res *= 2;
break;
}
res *= 10;
if (res == old_res)
break;
}
}
}
dst_res->resolution = res;
dst_res->exact = true;
}
/* Truncate the source's time stamp according to the resolution. */
src_s &= ~ (res == 2 * BILLION);
src_ns -= src_ns % res;
}
/* Compare the time stamps and return -1, 0, 1 accordingly. */
return (dst_s < src_s ? -1
: dst_s > src_s ? 1
: dst_ns < src_ns ? -1
: dst_ns > src_ns);
}
|