| fastfind.c (195839) | fastfind.c (229403) |
|---|---|
| 1/* 2 * Copyright (c) 1995 Wolfram Schneider <wosch@FreeBSD.org>. Berlin. 3 * Copyright (c) 1989, 1993 4 * The Regents of the University of California. All rights reserved. 5 * 6 * This code is derived from software contributed to Berkeley by 7 * James A. Woods. 8 * --- 20 unchanged lines hidden (view full) --- 29 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 30 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 31 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 32 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 33 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 34 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 35 * SUCH DAMAGE. 36 * | 1/* 2 * Copyright (c) 1995 Wolfram Schneider <wosch@FreeBSD.org>. Berlin. 3 * Copyright (c) 1989, 1993 4 * The Regents of the University of California. All rights reserved. 5 * 6 * This code is derived from software contributed to Berkeley by 7 * James A. Woods. 8 * --- 20 unchanged lines hidden (view full) --- 29 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 30 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 31 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 32 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 33 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 34 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 35 * SUCH DAMAGE. 36 * |
| 37 * $FreeBSD: head/usr.bin/locate/locate/fastfind.c 195839 2009-07-24 13:40:25Z jhb $ | 37 * $FreeBSD: head/usr.bin/locate/locate/fastfind.c 229403 2012-01-03 18:51:58Z ed $ |
| 38 */ 39 40 41#ifndef _LOCATE_STATISTIC_ 42#define _LOCATE_STATISTIC_ 43 44void 45statistic (fp, path_fcodes) --- 116 unchanged lines hidden (view full) --- 162 for (c = 0, p = bigram1, s = bigram2; c < NBG; c++) { 163 p[c] = check_bigram_char(getc(fp)); 164 s[c] = check_bigram_char(getc(fp)); 165 } 166#endif /* FF_MMAP */ 167 168 /* find optimal (last) char for searching */ 169 for (p = pathpart; *p != '\0'; p++) | 38 */ 39 40 41#ifndef _LOCATE_STATISTIC_ 42#define _LOCATE_STATISTIC_ 43 44void 45statistic (fp, path_fcodes) --- 116 unchanged lines hidden (view full) --- 162 for (c = 0, p = bigram1, s = bigram2; c < NBG; c++) { 163 p[c] = check_bigram_char(getc(fp)); 164 s[c] = check_bigram_char(getc(fp)); 165 } 166#endif /* FF_MMAP */ 167 168 /* find optimal (last) char for searching */ 169 for (p = pathpart; *p != '\0'; p++) |
| 170 if (index(LOCATE_REG, *p) != NULL) | 170 if (strchr(LOCATE_REG, *p) != NULL) |
| 171 break; 172 173 if (*p == '\0') 174 globflag = 0; 175 else 176 globflag = 1; 177 178 p = pathpart; --- 151 unchanged lines hidden --- | 171 break; 172 173 if (*p == '\0') 174 globflag = 0; 175 else 176 globflag = 1; 177 178 p = pathpart; --- 151 unchanged lines hidden --- |