1*2fe8fb19SBen Gras /* $NetBSD: compat_utimes.c,v 1.2 2009/01/11 02:46:27 christos Exp $ */
2*2fe8fb19SBen Gras
3*2fe8fb19SBen Gras /*-
4*2fe8fb19SBen Gras * Copyright (c) 2008 The NetBSD Foundation, Inc.
5*2fe8fb19SBen Gras * All rights reserved.
6*2fe8fb19SBen Gras *
7*2fe8fb19SBen Gras * This code is derived from software contributed to The NetBSD Foundation
8*2fe8fb19SBen Gras * by Christos Zoulas.
9*2fe8fb19SBen Gras *
10*2fe8fb19SBen Gras * Redistribution and use in source and binary forms, with or without
11*2fe8fb19SBen Gras * modification, are permitted provided that the following conditions
12*2fe8fb19SBen Gras * are met:
13*2fe8fb19SBen Gras * 1. Redistributions of source code must retain the above copyright
14*2fe8fb19SBen Gras * notice, this list of conditions and the following disclaimer.
15*2fe8fb19SBen Gras * 2. Redistributions in binary form must reproduce the above copyright
16*2fe8fb19SBen Gras * notice, this list of conditions and the following disclaimer in the
17*2fe8fb19SBen Gras * documentation and/or other materials provided with the distribution.
18*2fe8fb19SBen Gras *
19*2fe8fb19SBen Gras * THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS
20*2fe8fb19SBen Gras * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
21*2fe8fb19SBen Gras * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
22*2fe8fb19SBen Gras * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS
23*2fe8fb19SBen Gras * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
24*2fe8fb19SBen Gras * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
25*2fe8fb19SBen Gras * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
26*2fe8fb19SBen Gras * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
27*2fe8fb19SBen Gras * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
28*2fe8fb19SBen Gras * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
29*2fe8fb19SBen Gras * POSSIBILITY OF SUCH DAMAGE.
30*2fe8fb19SBen Gras */
31*2fe8fb19SBen Gras
32*2fe8fb19SBen Gras #include <sys/cdefs.h>
33*2fe8fb19SBen Gras #if defined(LIBC_SCCS) && !defined(lint)
34*2fe8fb19SBen Gras __RCSID("$NetBSD: compat_utimes.c,v 1.2 2009/01/11 02:46:27 christos Exp $");
35*2fe8fb19SBen Gras #endif /* LIBC_SCCS and not lint */
36*2fe8fb19SBen Gras
37*2fe8fb19SBen Gras #define __LIBC12_SOURCE__
38*2fe8fb19SBen Gras
39*2fe8fb19SBen Gras #include "namespace.h"
40*2fe8fb19SBen Gras #include <sys/types.h>
41*2fe8fb19SBen Gras #include <sys/time.h>
42*2fe8fb19SBen Gras #include <compat/sys/time.h>
43*2fe8fb19SBen Gras
44*2fe8fb19SBen Gras __warn_references(utimes,
45*2fe8fb19SBen Gras "warning: reference to compatibility utimes(); include <sys/time.h> to generate correct reference")
46*2fe8fb19SBen Gras __warn_references(lutimes,
47*2fe8fb19SBen Gras "warning: reference to compatibility lutimes(); include <sys/time.h> to generate correct reference")
48*2fe8fb19SBen Gras __warn_references(futimes,
49*2fe8fb19SBen Gras "warning: reference to compatibility futimes(); include <sys/time.h> to generate correct reference")
50*2fe8fb19SBen Gras
51*2fe8fb19SBen Gras /*
52*2fe8fb19SBen Gras * libc12 compatible f,l,utimes routine.
53*2fe8fb19SBen Gras */
54*2fe8fb19SBen Gras int
utimes(const char * path,const struct timeval50 * tv50)55*2fe8fb19SBen Gras utimes(const char *path, const struct timeval50 *tv50)
56*2fe8fb19SBen Gras {
57*2fe8fb19SBen Gras struct timeval tv[2];
58*2fe8fb19SBen Gras
59*2fe8fb19SBen Gras if (tv50) {
60*2fe8fb19SBen Gras timeval50_to_timeval(&tv50[0], &tv[0]);
61*2fe8fb19SBen Gras timeval50_to_timeval(&tv50[1], &tv[1]);
62*2fe8fb19SBen Gras }
63*2fe8fb19SBen Gras return __utimes50(path, tv50 ? tv : NULL);
64*2fe8fb19SBen Gras }
65*2fe8fb19SBen Gras
66*2fe8fb19SBen Gras int
lutimes(const char * path,const struct timeval50 * tv50)67*2fe8fb19SBen Gras lutimes(const char *path, const struct timeval50 *tv50)
68*2fe8fb19SBen Gras {
69*2fe8fb19SBen Gras struct timeval tv[2];
70*2fe8fb19SBen Gras
71*2fe8fb19SBen Gras if (tv50) {
72*2fe8fb19SBen Gras timeval50_to_timeval(&tv50[0], &tv[0]);
73*2fe8fb19SBen Gras timeval50_to_timeval(&tv50[1], &tv[1]);
74*2fe8fb19SBen Gras }
75*2fe8fb19SBen Gras return __lutimes50(path, tv50 ? tv : NULL);
76*2fe8fb19SBen Gras }
77*2fe8fb19SBen Gras
78*2fe8fb19SBen Gras int
futimes(int fd,const struct timeval50 * tv50)79*2fe8fb19SBen Gras futimes(int fd, const struct timeval50 *tv50)
80*2fe8fb19SBen Gras {
81*2fe8fb19SBen Gras struct timeval tv[2];
82*2fe8fb19SBen Gras
83*2fe8fb19SBen Gras if (tv50) {
84*2fe8fb19SBen Gras timeval50_to_timeval(&tv50[0], &tv[0]);
85*2fe8fb19SBen Gras timeval50_to_timeval(&tv50[1], &tv[1]);
86*2fe8fb19SBen Gras }
87*2fe8fb19SBen Gras return __futimes50(fd, tv50 ? tv : NULL);
88*2fe8fb19SBen Gras }
89