| expand.h (90111) | expand.h (108286) |
|---|---|
| 1/*- 2 * Copyright (c) 1991, 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 * Kenneth Almquist. 7 * 8 * Redistribution and use in source and binary forms, with or without --- 20 unchanged lines hidden (view full) --- 29 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 30 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 31 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 32 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 33 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 34 * SUCH DAMAGE. 35 * 36 * @(#)expand.h 8.2 (Berkeley) 5/4/95 | 1/*- 2 * Copyright (c) 1991, 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 * Kenneth Almquist. 7 * 8 * Redistribution and use in source and binary forms, with or without --- 20 unchanged lines hidden (view full) --- 29 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 30 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 31 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 32 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 33 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 34 * SUCH DAMAGE. 35 * 36 * @(#)expand.h 8.2 (Berkeley) 5/4/95 |
| 37 * $FreeBSD: head/bin/sh/expand.h 90111 2002-02-02 06:50:57Z imp $ | 37 * $FreeBSD: head/bin/sh/expand.h 108286 2002-12-26 14:28:54Z tjr $ |
| 38 */ 39 40struct strlist { 41 struct strlist *next; 42 char *text; 43}; 44 45 --- 14 unchanged lines hidden (view full) --- 60 61union node; 62void expandhere(union node *, int); 63void expandarg(union node *, struct arglist *, int); 64void expari(int); 65int patmatch(char *, char *, int); 66void rmescapes(char *); 67int casematch(union node *, char *); | 38 */ 39 40struct strlist { 41 struct strlist *next; 42 char *text; 43}; 44 45 --- 14 unchanged lines hidden (view full) --- 60 61union node; 62void expandhere(union node *, int); 63void expandarg(union node *, struct arglist *, int); 64void expari(int); 65int patmatch(char *, char *, int); 66void rmescapes(char *); 67int casematch(union node *, char *); |
| 68int wordexpcmd(int, char **); |
|