1.\" Copyright (c) 1980, 1991, 1993 2.\" The Regents of the University of California. All rights reserved. 3.\" 4.\" Redistribution and use in source and binary forms, with or without 5.\" modification, are permitted provided that the following conditions 6.\" are met: 7.\" 1. Redistributions of source code must retain the above copyright 8.\" notice, this list of conditions and the following disclaimer. 9.\" 2. Redistributions in binary form must reproduce the above copyright 10.\" notice, this list of conditions and the following disclaimer in the 11.\" documentation and/or other materials provided with the distribution. 12.\" 3. All advertising materials mentioning features or use of this software 13.\" must display the following acknowledgement: 14.\" This product includes software developed by the University of 15.\" California, Berkeley and its contributors. 16.\" 4. 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: @(#)re_comp.3 8.1 (Berkeley) 6/4/93 33.\" $NetBSD: re_comp.3,v 1.8 2002/02/07 07:00:35 ross Exp $ 34.\" 35.Dd June 4, 1993 36.Dt RE_COMP 3 37.Os 38.Sh NAME 39.Nm re_comp , 40.Nm re_exec 41.Nd regular expression handler 42.Sh LIBRARY 43.Lb libcompat 44.Sh SYNOPSIS 45.Fd #include \*[Lt]re_comp.h\*[Gt] 46.Ft char * 47.Fn re_comp "const char *s" 48.Ft int 49.Fn re_exec "const char *s" 50.Sh DESCRIPTION 51.Bf -symbolic 52This interface is made obsolete by 53.Xr regex 3 . 54It is available from the compatibility library, libcompat. 55.Ef 56.Pp 57The 58.Fn re_comp 59function 60compiles a string into an internal form suitable for pattern matching. 61The 62.Fn re_exec 63function 64checks the argument string against the last string passed to 65.Fn re_comp . 66.Pp 67The 68.Fn re_comp 69function 70returns 0 if the string 71.Fa s 72was compiled successfully; otherwise a string containing an 73error message is returned. If 74.Fn re_comp 75is passed 0 or a null string, it returns without changing the currently 76compiled regular expression. 77.Pp 78The 79.Fn re_exec 80function 81returns 1 if the string 82.Fa s 83matches the last compiled regular expression, 0 if the string 84.Fa s 85failed to match the last compiled regular expression, and \-1 if the compiled 86regular expression was invalid (indicating an internal error). 87.Pp 88The strings passed to both 89.Fn re_comp 90and 91.Fn re_exec 92may have trailing or embedded newline characters; 93they are terminated by 94.Dv NUL Ns s . 95The regular expressions recognized are described in the manual entry for 96.Xr ed 1 , 97given the above difference. 98.Sh DIAGNOSTICS 99The 100.Fn re_exec 101function 102returns \-1 for an internal error. 103.Pp 104The 105.Fn re_comp 106function 107returns one of the following strings if an error occurs: 108.Bd -unfilled -offset indent 109No previous regular expression, 110Regular expression too long, 111unmatched \e(, 112missing ], 113too many \e(\e) pairs, 114unmatched \e). 115.Ed 116.Sh SEE ALSO 117.Xr ed 1 , 118.Xr egrep 1 , 119.Xr ex 1 , 120.Xr fgrep 1 , 121.Xr grep 1 , 122.Xr regex 3 123.Sh HISTORY 124The 125.Fn re_comp 126and 127.Fn re_exec 128functions appeared in 129.Bx 4.0 . 130