Annotation of 43BSDReno/bin/ls/cmp.c, revision 1.1.1.1

1.1       root        1: /*
                      2:  * Copyright (c) 1989 The Regents of the University of California.
                      3:  * All rights reserved.
                      4:  *
                      5:  * This code is derived from software contributed to Berkeley by
                      6:  * Michael Fischbein.
                      7:  *
                      8:  * Redistribution and use in source and binary forms are permitted
                      9:  * provided that: (1) source distributions retain this entire copyright
                     10:  * notice and comment, and (2) distributions including binaries display
                     11:  * the following acknowledgement:  ``This product includes software
                     12:  * developed by the University of California, Berkeley and its contributors''
                     13:  * in the documentation or other materials provided with the distribution
                     14:  * and in all advertising materials mentioning features or use of this
                     15:  * software. Neither the name of the University nor the names of its
                     16:  * contributors may be used to endorse or promote products derived
                     17:  * from this software without specific prior written permission.
                     18:  * THIS SOFTWARE IS PROVIDED ``AS IS'' AND WITHOUT ANY EXPRESS OR
                     19:  * IMPLIED WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED
                     20:  * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.
                     21:  */
                     22: 
                     23: #ifndef lint
                     24: static char sccsid[] = "@(#)cmp.c      5.2 (Berkeley) 4/8/90";
                     25: #endif /* not lint */
                     26: 
                     27: #include <sys/types.h>
                     28: #include <sys/stat.h>
                     29: #include "ls.h"
                     30: 
                     31: namecmp(a, b)
                     32:        LS *a, *b;
                     33: {
                     34:        return(strcmp(a->name, b->name));
                     35: }
                     36: 
                     37: revnamecmp(a, b)
                     38:        LS *a, *b;
                     39: {
                     40:        return(strcmp(b->name, a->name));
                     41: }
                     42: 
                     43: modcmp(a, b)
                     44:        LS *a, *b;
                     45: {
                     46:        return(a->lstat.st_mtime < b->lstat.st_mtime);
                     47: }
                     48: 
                     49: revmodcmp(a, b)
                     50:        LS *a, *b;
                     51: {
                     52:        return(b->lstat.st_mtime < a->lstat.st_mtime);
                     53: }
                     54: 
                     55: acccmp(a, b)
                     56:        LS *a, *b;
                     57: {
                     58:        return(a->lstat.st_atime < b->lstat.st_atime);
                     59: }
                     60: 
                     61: revacccmp(a, b)
                     62:        LS *a, *b;
                     63: {
                     64:        return(b->lstat.st_atime < a->lstat.st_atime);
                     65: }
                     66: 
                     67: statcmp(a, b)
                     68:        LS *a, *b;
                     69: {
                     70:        return(a->lstat.st_ctime < b->lstat.st_ctime);
                     71: }
                     72: 
                     73: revstatcmp(a, b)
                     74:        LS *a, *b;
                     75: {
                     76:        return(b->lstat.st_ctime < a->lstat.st_ctime);
                     77: }

unix.superglobalmegacorp.com

This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.