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

📄 chared.c

📁 asterisk 是一个很有知名度开源软件
💻 C
📖 第 1 页 / 共 2 页
字号:
/*	$NetBSD: chared.c,v 1.15 2002/03/18 16:00:50 christos Exp $	*//*- * Copyright (c) 1992, 1993 *	The Regents of the University of California.  All rights reserved. * * This code is derived from software contributed to Berkeley by * Christos Zoulas of Cornell University. * * Redistribution and use in source and binary forms, with or without * modification, are permitted provided that the following conditions * are met: * 1. Redistributions of source code must retain the above copyright *    notice, this list of conditions and the following disclaimer. * 2. Redistributions in binary form must reproduce the above copyright *    notice, this list of conditions and the following disclaimer in the *    documentation and/or other materials provided with the distribution. * 3. All advertising materials mentioning features or use of this software *    must display the following acknowledgement: *	This product includes software developed by the University of *	California, Berkeley and its contributors. * 4. Neither the name of the University nor the names of its contributors *    may be used to endorse or promote products derived from this software *    without specific prior written permission. * * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF * SUCH DAMAGE. */#include "config.h"#if !defined(lint) && !defined(SCCSID)#if 0static char sccsid[] = "@(#)chared.c	8.1 (Berkeley) 6/4/93";#else__RCSID("$NetBSD: chared.c,v 1.15 2002/03/18 16:00:50 christos Exp $");#endif#endif /* not lint && not SCCSID *//* * chared.c: Character editor utilities */#include <stdlib.h>#include "el.h"/* value to leave unused in line buffer */#define	EL_LEAVE	2/* cv_undo(): *	Handle state for the vi undo command */protected voidcv_undo(EditLine *el,int action, size_t size, char *ptr){	c_undo_t *vu = &el->el_chared.c_undo;	vu->action = action;	vu->ptr    = ptr;	vu->isize  = size;	(void) memcpy(vu->buf, vu->ptr, size);#ifdef DEBUG_UNDO	(void) fprintf(el->el_errfile, "Undo buffer \"%s\" size = +%d -%d\n",	       vu->ptr, vu->isize, vu->dsize);#endif}/* c_insert(): *	Insert num characters */protected voidc_insert(EditLine *el, int num){	char *cp;	if (el->el_line.lastchar + num >= el->el_line.limit)		return;			/* can't go past end of buffer */	if (el->el_line.cursor < el->el_line.lastchar) {		/* if I must move chars */		for (cp = el->el_line.lastchar; cp >= el->el_line.cursor; cp--)			cp[num] = *cp;	}	el->el_line.lastchar += num;}/* c_delafter(): *	Delete num characters after the cursor */protected voidc_delafter(EditLine *el, int num){	if (el->el_line.cursor + num > el->el_line.lastchar)		num = el->el_line.lastchar - el->el_line.cursor;	if (num > 0) {		char *cp;		if (el->el_map.current != el->el_map.emacs)			cv_undo(el, INSERT, (size_t)num, el->el_line.cursor);		for (cp = el->el_line.cursor; cp <= el->el_line.lastchar; cp++)			*cp = cp[num];		el->el_line.lastchar -= num;	}}/* c_delbefore(): *	Delete num characters before the cursor */protected voidc_delbefore(EditLine *el, int num){	if (el->el_line.cursor - num < el->el_line.buffer)		num = el->el_line.cursor - el->el_line.buffer;	if (num > 0) {		char *cp;		if (el->el_map.current != el->el_map.emacs)			cv_undo(el, INSERT, (size_t)num,			    el->el_line.cursor - num);		for (cp = el->el_line.cursor - num;		    cp <= el->el_line.lastchar;		    cp++)			*cp = cp[num];		el->el_line.lastchar -= num;	}}/* ce__isword(): *	Return if p is part of a word according to emacs */protected intce__isword(int p){	return (isalpha(p) || isdigit(p) || strchr("*?_-.[]~=", p) != NULL);}/* cv__isword(): *	Return if p is part of a word according to vi */protected intcv__isword(int p){	return (!isspace(p));}/* c__prev_word(): *	Find the previous word */protected char *c__prev_word(char *p, char *low, int n, int (*wtest)(int)){	p--;	while (n--) {		while ((p >= low) && !(*wtest)((unsigned char) *p))			p--;		while ((p >= low) && (*wtest)((unsigned char) *p))			p--;	}	/* cp now points to one character before the word */	p++;	if (p < low)		p = low;	/* cp now points where we want it */	return (p);}/* c__next_word(): *	Find the next word */protected char *c__next_word(char *p, char *high, int n, int (*wtest)(int)){	while (n--) {		while ((p < high) && !(*wtest)((unsigned char) *p))			p++;		while ((p < high) && (*wtest)((unsigned char) *p))			p++;	}	if (p > high)		p = high;	/* p now points where we want it */	return (p);}/* cv_next_word(): *	Find the next word vi style */protected char *cv_next_word(EditLine *el, char *p, char *high, int n, int (*wtest)(int)){	int test;	while (n--) {		test = (*wtest)((unsigned char) *p);		while ((p < high) && (*wtest)((unsigned char) *p) == test)			p++;		/*		 * vi historically deletes with cw only the word preserving the		 * trailing whitespace! This is not what 'w' does..		 */		if (el->el_chared.c_vcmd.action != (DELETE|INSERT))			while ((p < high) && isspace((unsigned char) *p))				p++;	}	/* p now points where we want it */	if (p > high)		return (high);	else		return (p);}/* cv_prev_word(): *	Find the previous word vi style */protected char *cv_prev_word(EditLine *el, char *p, char *low, int n, int (*wtest)(int)){	int test;	while (n--) {		p--;		/*		 * vi historically deletes with cb only the word preserving the		 * leading whitespace! This is not what 'b' does..		 */		if (el->el_chared.c_vcmd.action != (DELETE|INSERT))			while ((p > low) && isspace((unsigned char) *p))				p--;		test = (*wtest)((unsigned char) *p);		while ((p >= low) && (*wtest)((unsigned char) *p) == test)			p--;		p++;		while (isspace((unsigned char) *p))			p++;	}	/* p now points where we want it */	if (p < low)		return (low);	else		return (p);}#ifdef notdef/* c__number(): *	Ignore character p points to, return number appearing after that. * 	A '$' by itself means a big number; "$-" is for negative; '^' means 1. * 	Return p pointing to last char used. */protected char *c__number(    char *p,	/* character position */    int *num,	/* Return value	*/    int dval)	/* dval is the number to subtract from like $-3 */{	int i;	int sign = 1;	if (*++p == '^') {		*num = 1;		return (p);	}	if (*p == '$') {		if (*++p != '-') {			*num = 0x7fffffff;	/* Handle $ */			return (--p);		}		sign = -1;			/* Handle $- */		++p;	}	for (i = 0; isdigit((unsigned char) *p); i = 10 * i + *p++ - '0')		continue;	*num = (sign < 0 ? dval - i : i);	return (--p);}#endif/* cv_delfini(): *	Finish vi delete action */protected voidcv_delfini(EditLine *el){	int size;	int oaction;	if (el->el_chared.c_vcmd.action & INSERT)		el->el_map.current = el->el_map.key;	oaction = el->el_chared.c_vcmd.action;	el->el_chared.c_vcmd.action = NOP;	if (el->el_chared.c_vcmd.pos == 0)		return;	if (el->el_line.cursor > el->el_chared.c_vcmd.pos) {		size = (int) (el->el_line.cursor - el->el_chared.c_vcmd.pos);		c_delbefore(el, size);		el->el_line.cursor = el->el_chared.c_vcmd.pos;		re_refresh_cursor(el);	} else if (el->el_line.cursor < el->el_chared.c_vcmd.pos) {		size = (int)(el->el_chared.c_vcmd.pos - el->el_line.cursor);		c_delafter(el, size);	} else {		size = 1;		c_delafter(el, size);	}	switch (oaction) {	case DELETE|INSERT:		el->el_chared.c_undo.action = DELETE|INSERT;		break;	case DELETE:		el->el_chared.c_undo.action = INSERT;		break;	case NOP:	case INSERT:	default:		EL_ABORT((el->el_errfile, "Bad oaction %d\n", oaction));		break;	}

⌨️ 快捷键说明

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