1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
|
/*-
* Copyright (c) 1992, 1993, 1994
* The Regents of the University of California. All rights reserved.
*
* 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.
*/
#ifndef lint
static char sccsid[] = "@(#)ex_at.c 8.27 (Berkeley) 8/17/94";
#endif /* not lint */
#include <sys/types.h>
#include <sys/queue.h>
#include <sys/time.h>
#include <bitstring.h>
#include <ctype.h>
#include <limits.h>
#include <signal.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <termios.h>
#include "compat.h"
#include <db.h>
#include <regex.h>
#include "vi.h"
#include "excmd.h"
/*
* ex_at -- :@[@ | buffer]
* :*[* | buffer]
*
* Execute the contents of the buffer.
*/
int
ex_at(sp, ep, cmdp)
SCR *sp;
EXF *ep;
EXCMDARG *cmdp;
{
CB *cbp;
EX_PRIVATE *exp;
TEXT *tp;
int name;
exp = EXP(sp);
/*
* !!!
* Historically, [@*]<carriage-return> and [@*][@*] executed the most
* recently executed buffer in ex mode. In vi mode, only @@ repeated
* the last buffer. We change historic practice and make @* work from
* vi mode as well, it's simpler and more consistent.
*/
name = F_ISSET(cmdp, E_BUFFER) ? cmdp->buffer : '@';
if (name == '@' || name == '*') {
if (!exp->at_lbuf_set) {
msgq(sp, M_ERR, "No previous buffer to execute");
return (1);
}
name = exp->at_lbuf;
}
CBNAME(sp, cbp, name);
if (cbp == NULL) {
msgq(sp, M_ERR, "Buffer %s is empty", KEY_NAME(sp, name));
return (1);
}
/* Save for reuse. */
exp->at_lbuf = name;
exp->at_lbuf_set = 1;
/*
* !!!
* Historic practice is that if the buffer was cut in line mode,
* <newlines> were appended to each line as it was pushed onto
* the stack. If the buffer was cut in character mode, <newlines>
* were appended to all lines but the last one.
*/
for (tp = cbp->textq.cqh_last;
tp != (void *)&cbp->textq; tp = tp->q.cqe_prev)
if ((F_ISSET(cbp, CB_LMODE) ||
tp->q.cqe_next != (void *)&cbp->textq) &&
term_push(sp, "\n", 1, 0) ||
term_push(sp, tp->lb, tp->len, 0))
return (1);
return (0);
}
|
