option.c revision 1.1 1 1.1 cjs /*
2 1.1 cjs * Copyright (c) 1988 Mark Nudleman
3 1.1 cjs * Copyright (c) 1988, 1993
4 1.1 cjs * The Regents of the University of California. All rights reserved.
5 1.1 cjs *
6 1.1 cjs * Redistribution and use in source and binary forms, with or without
7 1.1 cjs * modification, are permitted provided that the following conditions
8 1.1 cjs * are met:
9 1.1 cjs * 1. Redistributions of source code must retain the above copyright
10 1.1 cjs * notice, this list of conditions and the following disclaimer.
11 1.1 cjs * 2. Redistributions in binary form must reproduce the above copyright
12 1.1 cjs * notice, this list of conditions and the following disclaimer in the
13 1.1 cjs * documentation and/or other materials provided with the distribution.
14 1.1 cjs * 3. All advertising materials mentioning features or use of this software
15 1.1 cjs * must display the following acknowledgement:
16 1.1 cjs * This product includes software developed by the University of
17 1.1 cjs * California, Berkeley and its contributors.
18 1.1 cjs * 4. Neither the name of the University nor the names of its contributors
19 1.1 cjs * may be used to endorse or promote products derived from this software
20 1.1 cjs * without specific prior written permission.
21 1.1 cjs *
22 1.1 cjs * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
23 1.1 cjs * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
24 1.1 cjs * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
25 1.1 cjs * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
26 1.1 cjs * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
27 1.1 cjs * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
28 1.1 cjs * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
29 1.1 cjs * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
30 1.1 cjs * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
31 1.1 cjs * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
32 1.1 cjs * SUCH DAMAGE.
33 1.1 cjs */
34 1.1 cjs
35 1.1 cjs #ifndef lint
36 1.1 cjs static char sccsid[] = "@(#)option.c 8.1 (Berkeley) 6/6/93";
37 1.1 cjs #endif /* not lint */
38 1.1 cjs
39 1.1 cjs #include <stdio.h>
40 1.1 cjs #include <less.h>
41 1.1 cjs
42 1.1 cjs int top_scroll; /* Repaint screen from top */
43 1.1 cjs int bs_mode; /* How to process backspaces */
44 1.1 cjs int caseless; /* Do "caseless" searches */
45 1.1 cjs int cbufs = 10; /* Current number of buffers */
46 1.1 cjs int linenums = 1; /* Use line numbers */
47 1.1 cjs int quit_at_eof;
48 1.1 cjs int squeeze; /* Squeeze multiple blank lines into one */
49 1.1 cjs int tabstop = 8; /* Tab settings */
50 1.1 cjs int tagoption;
51 1.1 cjs
52 1.1 cjs char *firstsearch;
53 1.1 cjs extern int sc_height;
54 1.1 cjs
55 1.1 cjs option(argc, argv)
56 1.1 cjs int argc;
57 1.1 cjs char **argv;
58 1.1 cjs {
59 1.1 cjs extern char *optarg;
60 1.1 cjs extern int optind;
61 1.1 cjs static int sc_window_set = 0;
62 1.1 cjs int ch;
63 1.1 cjs char *p;
64 1.1 cjs
65 1.1 cjs /* backward compatible processing for "+/search" */
66 1.1 cjs char **a;
67 1.1 cjs for (a = argv; *a; ++a)
68 1.1 cjs if ((*a)[0] == '+' && (*a)[1] == '/')
69 1.1 cjs (*a)[0] = '-';
70 1.1 cjs
71 1.1 cjs optind = 1; /* called twice, re-init getopt. */
72 1.1 cjs while ((ch = getopt(argc, argv, "0123456789/:ceinst:ux:f")) != EOF)
73 1.1 cjs switch((char)ch) {
74 1.1 cjs case '0': case '1': case '2': case '3': case '4':
75 1.1 cjs case '5': case '6': case '7': case '8': case '9':
76 1.1 cjs /*
77 1.1 cjs * kludge: more was originally designed to take
78 1.1 cjs * a number after a dash.
79 1.1 cjs */
80 1.1 cjs if (!sc_window_set) {
81 1.1 cjs p = argv[optind - 1];
82 1.1 cjs if (p[0] == '-' && p[1] == ch && !p[2])
83 1.1 cjs sc_height = atoi(++p);
84 1.1 cjs else
85 1.1 cjs sc_height = atoi(argv[optind] + 1);
86 1.1 cjs sc_window_set = 1;
87 1.1 cjs }
88 1.1 cjs break;
89 1.1 cjs case '/':
90 1.1 cjs firstsearch = optarg;
91 1.1 cjs break;
92 1.1 cjs case 'c':
93 1.1 cjs top_scroll = 1;
94 1.1 cjs break;
95 1.1 cjs case 'e':
96 1.1 cjs quit_at_eof = 1;
97 1.1 cjs break;
98 1.1 cjs case 'i':
99 1.1 cjs caseless = 1;
100 1.1 cjs break;
101 1.1 cjs case 'n':
102 1.1 cjs linenums = 0;
103 1.1 cjs break;
104 1.1 cjs case 's':
105 1.1 cjs squeeze = 1;
106 1.1 cjs break;
107 1.1 cjs case 't':
108 1.1 cjs tagoption = 1;
109 1.1 cjs findtag(optarg);
110 1.1 cjs break;
111 1.1 cjs case 'u':
112 1.1 cjs bs_mode = 1;
113 1.1 cjs break;
114 1.1 cjs case 'x':
115 1.1 cjs tabstop = atoi(optarg);
116 1.1 cjs if (tabstop <= 0)
117 1.1 cjs tabstop = 8;
118 1.1 cjs break;
119 1.1 cjs case 'f': /* ignore -f, compatability with old more */
120 1.1 cjs break;
121 1.1 cjs case '?':
122 1.1 cjs default:
123 1.1 cjs fprintf(stderr,
124 1.1 cjs "usage: more [-ceinus] [-t tag] [-x tabs] [-/ pattern] [-#] [file ...]\n");
125 1.1 cjs exit(1);
126 1.1 cjs }
127 1.1 cjs return(optind);
128 1.1 cjs }
129