1 /* $NetBSD: txtwalk.h,v 1.1 2014/07/26 19:30:44 dholland Exp $ */ 2 3 /* 4 * Copyright 1997 Piermont Information Systems Inc. 5 * All rights reserved. 6 * 7 * Written by Philip A. Nelson for Piermont Information Systems Inc. 8 * 9 * Redistribution and use in source and binary forms, with or without 10 * modification, are permitted provided that the following conditions 11 * are met: 12 * 1. Redistributions of source code must retain the above copyright 13 * notice, this list of conditions and the following disclaimer. 14 * 2. Redistributions in binary form must reproduce the above copyright 15 * notice, this list of conditions and the following disclaimer in the 16 * documentation and/or other materials provided with the distribution. 17 * 3. The name of Piermont Information Systems Inc. may not be used to endorse 18 * or promote products derived from this software without specific prior 19 * written permission. 20 * 21 * THIS SOFTWARE IS PROVIDED BY PIERMONT INFORMATION SYSTEMS INC. ``AS IS'' 22 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 23 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 24 * ARE DISCLAIMED. IN NO EVENT SHALL PIERMONT INFORMATION SYSTEMS INC. BE 25 * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR 26 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF 27 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS 28 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN 29 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) 30 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF 31 * THE POSSIBILITY OF SUCH DAMAGE. 32 * 33 */ 34 35 /* txtwalk.h - definitions for textwalk to be useful! */ 36 37 /* data extractions */ 38 enum kind {INT, STR}; 39 40 struct data { 41 enum kind what; 42 union udata { 43 int i_val; 44 char *s_val; 45 } u; 46 }; 47 48 /* Strings of interest! */ 49 struct lookfor { 50 const char *head; /* Line starts this way. */ 51 const char *fmt; /* Expected format. */ 52 const char *todo; /* What to do ... */ 53 void *var; /* Possible var */ 54 size_t nument; /* Number of entries in the "array" */ 55 size_t size; /* size of string variables */ 56 int (*func) (struct data *list, size_t num); /* function to call */ 57 }; 58 59 /* Format string for the expected string: 60 * space => skip white space 61 * %ic => skip until you find char c, if c == space, matches any white space 62 * %d => expect an integer 63 * %s => expect a non-white space string 64 * \0 => ignore remainder of line 65 * %% => match a % 66 * 67 */ 68 69 /* What to do .... 70 * 71 * a -- assign to var, $n is data from the expect strings. 72 * c -- call the function 73 * 74 */ 75 76 /* prototypes */ 77 78 int walk(char *, size_t, const struct lookfor *, size_t); 79 80 81 /* Maximum number of matched data elements per line! */ 82 #define MAXDATA 20 83 84