| fastfind.c (19134) | fastfind.c (19214) |
|---|---|
| 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 * $Id: fastfind.c,v 1.4 1996/10/20 16:54:51 wosch Exp $ | 37 * $Id: fastfind.c,v 1.5 1996/10/23 16:46:47 ache Exp $ |
| 38 */ 39 40 41#ifndef _LOCATE_STATISTIC_ 42#define _LOCATE_STATISTIC_ 43 44void 45statistic (fp, path_fcodes) --- 103 unchanged lines hidden (view full) --- 149 u_char table[UCHAR_MAX + 1]; 150 151 tolower_word(pathpart); 152#endif /* FF_ICASE*/ 153 154 /* init bigram table */ 155#ifdef FF_MMAP 156 if (len < (2*NBG)) { | 38 */ 39 40 41#ifndef _LOCATE_STATISTIC_ 42#define _LOCATE_STATISTIC_ 43 44void 45statistic (fp, path_fcodes) --- 103 unchanged lines hidden (view full) --- 149 u_char table[UCHAR_MAX + 1]; 150 151 tolower_word(pathpart); 152#endif /* FF_ICASE*/ 153 154 /* init bigram table */ 155#ifdef FF_MMAP 156 if (len < (2*NBG)) { |
| 157 (void)fprintf(stderr, "database to small: %s\n", database); | 157 (void)fprintf(stderr, "database too small: %s\n", database); |
| 158 exit(1); 159 } 160 161 for (c = 0, p = bigram1, s = bigram2; c < NBG; c++, len-= 2) { 162 p[c] = check_bigram_char(*paddr++); 163 s[c] = check_bigram_char(*paddr++); 164 } 165#else --- 164 unchanged lines hidden --- | 158 exit(1); 159 } 160 161 for (c = 0, p = bigram1, s = bigram2; c < NBG; c++, len-= 2) { 162 p[c] = check_bigram_char(*paddr++); 163 s[c] = check_bigram_char(*paddr++); 164 } 165#else --- 164 unchanged lines hidden --- |