bin/ls/ls.h

   1 /*-
   2  * Copyright (c) 1989, 1993
   3  *      The Regents of the University of California.  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, with or without
   9  * modification, are permitted provided that the following conditions
  10  * are met:
  11  * 1. Redistributions of source code must retain the above copyright
  12  *    notice, this list of conditions and the following disclaimer.
  13  * 2. Redistributions in binary form must reproduce the above copyright
  14  *    notice, this list of conditions and the following disclaimer in the
  15  *    documentation and/or other materials provided with the distribution.
  16  * 3. Neither the name of the University nor the names of its contributors
  17  *    may be used to endorse or promote products derived from this software
  18  *    without specific prior written permission.
  19  *
  20  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
  21  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
  22  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
  23  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
  24  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
  25  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
  26  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
  27  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
  28  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
  29  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
  30  * SUCH DAMAGE.
  31  *
  32  *      from: @(#)ls.h  8.1 (Berkeley) 5/31/93
  33  * $FreeBSD: src/bin/ls/ls.h,v 1.21 2005/01/10 08:39:23 imp Exp $
  34  */
  35
  36 #define NO_PRINT        1
  37
  38 extern long blocksize;          /* block size units */
  39
  40 extern int f_accesstime;        /* use time of last access */
  41 extern int f_flags;             /* show flags associated with a file */
  42 extern int f_fsmid;             /* show FSMID associated with a file */
  43 extern int f_humanval;          /* show human-readable file sizes */
  44 extern int f_inode;             /* print inode */
  45 extern int f_longform;          /* long listing format */
  46 extern int f_octal;             /* print unprintables in octal */
  47 extern int f_octal_escape;      /* like f_octal but use C escapes if possible */
  48 extern int f_nanotime;          /* include nanotime in long format */
  49 extern int f_nonprint;          /* show unprintables as ? */
  50 extern int f_sectime;           /* print the real time for all files */
  51 extern int f_size;              /* list size in short listing */
  52 extern int f_slash;             /* append a '/' if the file is a directory */
  53 extern int f_sortacross;        /* sort across rows, not down columns */
  54 extern int f_statustime;        /* use time of last mode change */
  55 extern const char *f_timeformat;        /* user-specified time format */
  56 extern int f_notabs;            /* don't use tab-separated multi-col output */
  57 extern int f_type;              /* add type character for non-regular files */
  58 #ifdef COLORLS
  59 extern int f_color;             /* add type in color for non-regular files */
  60 #endif
  61
  62 typedef struct {
  63         FTSENT *list;
  64         u_long btotal;
  65         int bcfile;
  66         int entries;
  67         int maxlen;
  68         u_int s_block;
  69         u_int s_flags;
  70         u_int s_fsmid;
  71         u_int s_group;
  72         u_int s_inode;
  73         u_int s_nlink;
  74         u_int s_size;
  75         u_int s_user;
  76 } DISPLAY;
  77
  78 typedef struct {
  79         char *user;
  80         char *group;
  81         char *flags;
  82         char *fsmid;
  83         char data[1];
  84 } NAMES;