⭐ 欢迎来到虫虫下载站! | 📦 资源下载 📁 资源专辑 ℹ️ 关于我们
⭐ 虫虫下载站

📄 bitap.c.orig

📁 linux下阅读源码的好工具
💻 ORIG
📖 第 1 页 / 共 2 页
字号:
						}					}					lasti = i - D_length ;					TRUNCATE = OFF;					r2 = r3 = r1 = Init[0]; 					r1 = r_Init1 & r2;					r3 = ((( r2 >> 1) & CMask) | r1 ) & D_Mask;					if (DELIMITER) CurrentByteOffset += 1*D_length;					else CurrentByteOffset += 1*1;				}   			}			ResidueSize = num_read + Max_record - lasti;			if(ResidueSize > Max_record) {				ResidueSize = Max_record;				TRUNCATE = ON;   			}			strncpy(buffer+Max_record-ResidueSize, buffer+lasti, ResidueSize);			lasti = Max_record - ResidueSize;			if(lasti < 0) {				lasti = 1;			} 			if (((LIMITOUTPUT > 0) && (LIMITOUTPUT <= num_of_matched)) ||			    ((LIMITPERFILE > 0) && (LIMITPERFILE <= num_of_matched - prev_num_of_matched))) {				free_buf(fd, buffer);				return 0;	/* done */			}		}		free_buf(fd, buffer);		return 0;#if	AGREP_POINTER	}	else {		buffer = agrep_inbuffer;		num_read = agrep_inlen;		end = num_read;		/* buffer[end-1] = '\n';*/ /* at end of the text. */		/* buffer[0] = '\n';*/  /* in front of the  text. */		i = 0;		lasti = 1;		if(DELIMITER) {			for(k=0; k<D_length; k++) {				if(old_D_pat[k] != buffer[k]) break;			}			if(k>=D_length) j--;		}			/* An exact copy of the above: BITAP_PROCESS: the while-loop below */			while (i < end)			{				c = buffer[i++];				CurrentByteOffset ++;				CMask = Mask[c];				r1 = r_Init1 & r3;				r2 = (( r3 >> 1 ) & CMask) | r1;				if ( r2 & endpos ) {					j++;					if (DELIMITER) CurrentByteOffset -= D_length;					else CurrentByteOffset -= 1;					if(((AND == 1) && ((r2 & endposition) == endposition)) || ((AND == 0) && (r2 & endposition)) ^ INVERSE )					{ 						if(FILENAMEONLY && (NEW_FILE || !POST_FILTER)) {							num_of_matched++;							if (agrep_finalfp != NULL)								fprintf(agrep_finalfp, "%s", CurrentFileName);							else {								int outindex;								for(outindex=0; (outindex+agrep_outpointer<agrep_outlen) &&										(CurrentFileName[outindex] != '\0'); outindex++) {									agrep_outbuffer[agrep_outpointer+outindex] = CurrentFileName[outindex];								}								if ((CurrentFileName[outindex] != '\0') || (outindex+agrep_outpointer>=agrep_outlen)) {									OUTPUT_OVERFLOW;									free_buf(fd, buffer);									return -1;								}								agrep_outpointer += outindex;							}							if (PRINTFILETIME) {								char *s = aprint_file_time(CurrentFileTime);								if (agrep_finalfp != NULL)									fprintf(agrep_finalfp, "%s", s);								else {									int outindex;									for(outindex=0; (outindex+agrep_outpointer<agrep_outlen) &&											(s[outindex] != '\0'); outindex++) {										agrep_outbuffer[agrep_outpointer+outindex] = s[outindex];									}									if ((s[outindex] != '\0') || (outindex+agrep_outpointer>=agrep_outlen)) {										OUTPUT_OVERFLOW;										free_buf(fd, buffer);										return -1;									}									agrep_outpointer += outindex;								}							}							if (agrep_finalfp != NULL)								fprintf(agrep_finalfp, "\n");							else {								if (agrep_outpointer+1>=agrep_outlen) {									OUTPUT_OVERFLOW;									free_buf(fd, buffer);									return -1;								}								else agrep_outbuffer[agrep_outpointer++] = '\n';							}							free_buf(fd, buffer);							NEW_FILE = OFF;							return 0; 						}						print_end = i - D_length - 1;						if ( ((fd != -1) && !(lasti >= Max_record+num_read - 1)) || ((fd == -1) && !(lasti >= num_read)) )							if (-1 == output(buffer, lasti, print_end, j)) { free_buf(fd, buffer); return -1;} 						if (((LIMITOUTPUT > 0) && (LIMITOUTPUT <= num_of_matched)) ||						    ((LIMITPERFILE > 0) && (LIMITPERFILE <= num_of_matched - prev_num_of_matched))) {							free_buf(fd, buffer);							return 0;	/* done */						}					}					lasti = i - D_length; 					TRUNCATE = OFF;					r2 = r3 = r1 = Init[0];					r1 = r_Init1 & r3;					r2 = ((( r2 >> 1) & CMask) | r1 ) & D_Mask;					if (DELIMITER) CurrentByteOffset += 1*D_length;					else CurrentByteOffset += 1*1;				}				c = buffer[i++];				CurrentByteOffset ++;				CMask = Mask[c];				r1 = r_Init1 & r2;				r3 = (( r2 >> 1 ) & CMask) | r1; 				if ( r3 & endpos ) {					j++;					if (DELIMITER) CurrentByteOffset -= D_length;					else CurrentByteOffset -= 1;					if(((AND == 1) && ((r3 & endposition) == endposition)) || ((AND == 0) && (r3 & endposition)) ^ INVERSE )					{ 						if(FILENAMEONLY && (NEW_FILE || !POST_FILTER)) {							num_of_matched++;							if (agrep_finalfp != NULL)								fprintf(agrep_finalfp, "%s", CurrentFileName);							else {								int outindex;								for(outindex=0; (outindex+agrep_outpointer<agrep_outlen) &&										(CurrentFileName[outindex] != '\0'); outindex++) {									agrep_outbuffer[agrep_outpointer+outindex] = CurrentFileName[outindex];								}								if ((CurrentFileName[outindex] != '\0') || (outindex+agrep_outpointer>=agrep_outlen)) {									OUTPUT_OVERFLOW;									free_buf(fd, buffer);									return -1;								}								agrep_outpointer += outindex;							}							if (PRINTFILETIME) {								char *s = aprint_file_time(CurrentFileTime);								if (agrep_finalfp != NULL)									fprintf(agrep_finalfp, "%s", s);								else {									int outindex;									for(outindex=0; (outindex+agrep_outpointer<agrep_outlen) &&											(s[outindex] != '\0'); outindex++) {										agrep_outbuffer[agrep_outpointer+outindex] = s[outindex];									}									if ((s[outindex] != '\0') || (outindex+agrep_outpointer>=agrep_outlen)) {										OUTPUT_OVERFLOW;										free_buf(fd, buffer);										return -1;									}									agrep_outpointer += outindex;								}							}							if (agrep_finalfp != NULL)								fprintf(agrep_finalfp, "\n");							else {								if (agrep_outpointer+1>=agrep_outlen) {									OUTPUT_OVERFLOW;									free_buf(fd, buffer);									return -1;								}								else agrep_outbuffer[agrep_outpointer++] = '\n';							}							free_buf(fd, buffer);							NEW_FILE = OFF;							return 0; 						}						print_end = i - D_length - 1;						if ( ((fd != -1) && !(lasti >= Max_record+num_read - 1)) || ((fd == -1) && !(lasti >= num_read)) )							if (-1 == output(buffer, lasti, print_end, j)) { free_buf(fd, buffer); return -1;}						if (((LIMITOUTPUT > 0) && (LIMITOUTPUT <= num_of_matched)) ||						    ((LIMITPERFILE > 0) && (LIMITPERFILE <= num_of_matched - prev_num_of_matched))) {							free_buf(fd, buffer);							return 0;	/* done */						}					}					lasti = i - D_length ;					TRUNCATE = OFF;					r2 = r3 = r1 = Init[0]; 					r1 = r_Init1 & r2;					r3 = ((( r2 >> 1) & CMask) | r1 ) & D_Mask;					if (DELIMITER) CurrentByteOffset += 1*D_length;					else CurrentByteOffset += 1*1;				}   			}		return 0;	}#endif	/*AGREP_POINTER*/}fill_buf(fd, buf, record_size)int fd, record_size; unsigned char *buf;{	int num_read=1;	int total_read=0;	extern int glimpse_clientdied;	if (fd >= 0) {		while(total_read < record_size && num_read > 0) {			if (glimpse_clientdied) return 0;			num_read = read(fd, buf+total_read, record_size - total_read);			total_read = total_read + num_read;		}	}#if	AGREP_POINTER	else return 0;	/* should not call this function if buffer is a pointer to a user-specified region! */#else	/*AGREP_POINTER*/	else {	/* simulate a file */		total_read = (record_size > (agrep_inlen - agrep_inpointer)) ? (agrep_len - agrep_inpointer) : record_size;		memcpy(buf, agrep_inbuffer + agrep_inpointer, total_read);		agrep_inpointer += total_read;		/* printf("agrep_inpointer %d total_read %d\n", agrep_inpointer, total_read);*/	}#endif	/*AGREP_POINTER*/	if (glimpse_clientdied) return 0;	return(total_read);}/* * In these functions no allocs/copying is done when * fd == -1, i.e., agrep is called to search within memory. */voidalloc_buf(fd, buf, size)	int fd;	char **buf;	int size;{#if	AGREP_POINTER	if (fd != -1)#endif	/*AGREP_POINTER*/		*buf = (char *)malloc(size);}voidfree_buf(fd, buf)	int fd;	char *buf;{#if	AGREP_POINTER	if (fd != -1)#endif	/*AGREP_POINTER*/		free(buf);}

⌨️ 快捷键说明

复制代码 Ctrl + C
搜索代码 Ctrl + F
全屏模式 F11
切换主题 Ctrl + Shift + D
显示快捷键 ?
增大字号 Ctrl + =
减小字号 Ctrl + -