funcs.c revision d1419d5a02eaedd520f925cd465fd62f3950ae43
2N/A * The contents of this file are subject to the terms of the 2N/A * Common Development and Distribution License (the "License"). 2N/A * You may not use this file except in compliance with the License. 2N/A * See the License for the specific language governing permissions 2N/A * and limitations under the License. 2N/A * When distributing Covered Code, include this CDDL HEADER in each 2N/A * If applicable, add the following below this CDDL HEADER, with the 2N/A * fields enclosed by brackets "[]" replaced with your own identifying 2N/A * information: Portions Copyright [yyyy] [name of copyright owner] 2N/A * Copyright 2009 Sun Microsystems, Inc. All rights reserved. 2N/A * Use is subject to license terms. 2N/A/* Copyright (c) 1984, 1986, 1987, 1988, 1989 AT&T */ 2N/A/* All Rights Reserved */ 2N/A#
define CANTCD "can't change directory to the at directory" n = n*
10 + (**
ptr -
'0');
static int dom[
12] = {
31,
28,
31,
30,
31,
30,
31,
31,
30,
31,
30,
31};
* calculate the number of "full" days in between * NOTE: there should not be more than a year separation in the * dates. also, m should be in 0 to 11, and d should be in 1 to 31. * In case of d2==29 ,d1==28 and m1==m2==Feb and year is not * a leap year, this function should return the days till the * the next Feb 29.See Bug 4257355. return (p*
365 +
d2-
d1-
1);
/* the remaining dates are on different months */ * returns the number of days in month m of year y * NOTE: m should be in the range 0 to 11 " be running - call your system" "error in message queue open\n"));
else if (i !=
sizeof (
struct message))
"error in message send: Premature EOF\n"));
return (0);
/* didn't start with a number */ return (0);
/* followed by a period */ return (0);
/* followed by a queue name */