Sponsored Content
The Lounge What is on Your Mind? Congratulations Neo for 10,000 Post Post 302644111 by Scott on Monday 21st of May 2012 10:15:59 AM
Old 05-21-2012
That takes some doing. Great job by everyone who keeps posting Smilie
 

5 More Discussions You Might Find Interesting

1. News, Links, Events and Announcements

Microsoft "Donates" $3,000,000,000 to Feds

Surreal quote from the news link below: http://www.washingtonpost.com/wp-dyn/articles/A44615-2002Nov12.html (0 Replies)
Discussion started by: Neo
0 Replies

2. What is on Your Mind?

Congratulations to Chile ! Bravo !!

On behalf of the forums, we are so happy to see such an amazingly rescue of the 33 miners. What a great and happy story of human endurance and team work to save miners trapped nearly 700 meters underground. Bravo Chile !! We salute you!!! (5 Replies)
Discussion started by: Neo
5 Replies

3. What is on Your Mind?

Congratulations to Corona688 for 20,000 Posts!

Please join me in congratulating and thanking Corona688 for 20,000 top quality posts at unix.com ! https://www.unix.com/members/1-albums112-picture651.png (11 Replies)
Discussion started by: Neo
11 Replies

4. What is on Your Mind?

Congratulations Scrutinizer for completing 3000 THANKS in the forum.

Hello Scrutinizer, Many Many Many heartily congratulations :b: to you sir(my/our HERO) to complete 3000 THANKS into the forum :b:. This shows how good you are in forums/answering people/helping/guiding people here. You are a true CHAMP, inspiration for LOT of people here. I THANK you for your... (13 Replies)
Discussion started by: RavinderSingh13
13 Replies

5. What is on Your Mind?

Congratulations RudiC for completing 4000+ THANKS in forums.

Hello All forum members, I would like to take this opportunity to THANK RudiC for his tremendous achievement, guidance, help for helping in forums, let us join our hands together for his GREAT achievement :b: @Rudi sir, How are you sir? you ROCK, please keep up the great work sir :b: ... (1 Reply)
Discussion started by: RavinderSingh13
1 Replies
TIMERADD(3)						   BSD Library Functions Manual 					       TIMERADD(3)

NAME
timeradd -- operations on time structure SYNOPSIS
#include <sys/time.h> void timeradd(struct timeval *a, struct timeval *b, struct timeval *res); void timersub(struct timeval *a, struct timeval *b, struct timeval *res); void timerclear(struct timeval *tv); int timerisset(struct timeval *tv); int timercmp(struct timeval *a, struct timeval *b, CMP); void timespecadd(struct timespec *a, struct timespec *b, struct timespec *res); void timespecsub(struct timespec *a, struct timespec *b, struct timespec *res); void timespecclear(struct timespec *ts); int timespecisset(struct timespec *ts); int timespeccmp(struct timespec *a, struct timespec b, CMP); DESCRIPTION
These macros are provided for manipulating the timeval and timespec structures described in timeval(3). The timeradd() and timespecadd() macros add the time information stored in a to b, storing the result in res. With timeradd() the results are simplified such that the value of res->tv_usec is always less than 1,000,000 (1 second). With timespecadd() the res->tv_nsec member of struct timespec is always less than 1,000,000,000. The timersub() and timespecsub() macros subtract the time information stored in b from a and store the resulting structure in res. The timerclear() and timespecclear() macros initialize the structures to midnight (0 hour) January 1st, 1970 (the Epoch). In other words, they set the members of the structure to zero. The timerisset() and timespecisset() macros return true if the input structure is set to any time value other than the Epoch. The timercmp() and timespeccmp() macros compare a to b using the comparison operator given in CMP. The result of the comparison is returned. SEE ALSO
timeval(3) HISTORY
The timeradd() family of macros first appeared in NetBSD 1.1. These were later ported to FreeBSD 2.2.6. The timespec() family of macros first appeared in NetBSD 1.2. BSD
June 7, 2010 BSD
All times are GMT -4. The time now is 12:56 PM.
Unix & Linux Forums Content Copyright 1993-2022. All Rights Reserved.
Privacy Policy