version 1.20, 2009/02/28 20:13:06 |
version 1.24, 2009/03/02 12:09:32 |
Line 85 static void footer(struct termp *, |
|
Line 85 static void footer(struct termp *, |
|
static void pword(struct termp *, const char *, size_t); |
static void pword(struct termp *, const char *, size_t); |
static void pescape(struct termp *, |
static void pescape(struct termp *, |
const char *, size_t *, size_t); |
const char *, size_t *, size_t); |
|
static void pgraph(struct termp *, char); |
static void nescape(struct termp *, |
static void nescape(struct termp *, |
const char *, size_t); |
const char *, size_t); |
static void chara(struct termp *, char); |
static void chara(struct termp *, char); |
Line 173 flushln(struct termp *p) |
|
Line 174 flushln(struct termp *p) |
|
for (i = 0; i < p->col; i++) { |
for (i = 0; i < p->col; i++) { |
/* |
/* |
* Count up visible word characters. Control sequences |
* Count up visible word characters. Control sequences |
* (starting with the CSI) aren't counted. |
* (starting with the CSI) aren't counted. A space |
|
* generates a non-printing word, which is valid (the |
|
* space is printed according to regular spacing rules). |
*/ |
*/ |
assert( ! xisspace(p->buf[i])); |
|
|
|
/* LINTED */ |
/* LINTED */ |
for (j = i, vsz = 0; j < p->col; j++) { |
for (j = i, vsz = 0; j < p->col; j++) { |
Line 187 flushln(struct termp *p) |
|
Line 189 flushln(struct termp *p) |
|
} else |
} else |
vsz++; |
vsz++; |
} |
} |
assert(vsz > 0); |
|
|
|
/* |
/* |
|
* If we're breaking normally... |
|
* |
* If a word is too long and we're within a line, put it |
* If a word is too long and we're within a line, put it |
* on the next line. Puke if we're being asked to write |
* on the next line. Puke if we're being asked to write |
* something that will exceed the right margin (i.e., |
* something that will exceed the right margin (i.e., |
* from a fresh line or when we're not allowed to break |
* from a fresh line). |
* the line with TERMP_NOBREAK). |
* |
|
* If we're not breaking... |
|
* |
|
* Don't let the visible size exceed the full right |
|
* margin. |
*/ |
*/ |
|
|
/* FIXME: allow selective right-margin breaking. */ |
if ( ! (TERMP_NOBREAK & p->flags)) { |
|
if (vis && vis + vsz > maxvis) { |
if (vis && vis + vsz > maxvis) { |
putchar('\n'); |
if (p->flags & TERMP_NOBREAK) |
for (j = 0; j < p->offset; j++) |
|
putchar(' '); |
|
vis = 0; |
|
} else if (vis + vsz > maxvis) |
errx(1, "word breaks right margin"); |
errx(1, "word breaks right margin"); |
|
} else if (vis + vsz > p->maxrmargin - p->offset) { |
putchar('\n'); |
putchar('\n'); |
for (j = 0; j < p->offset; j++) |
for (j = 0; j < p->rmargin; j++) |
putchar(' '); |
putchar(' '); |
vis = 0; |
vis = p->rmargin; |
} else if (vis + vsz > maxvis) |
} |
errx(1, "word breaks right margin"); |
|
|
|
/* |
/* |
* Write out the word and a trailing space. Omit the |
* Write out the word and a trailing space. Omit the |
Line 226 flushln(struct termp *p) |
|
Line 236 flushln(struct termp *p) |
|
} |
} |
} |
} |
|
|
|
if ((TERMP_NOBREAK & p->flags) && vis >= maxvis) { |
|
putchar('\n'); |
|
for (i = 0; i < p->rmargin; i++) |
|
putchar(' '); |
|
p->col = 0; |
|
return; |
|
} |
|
|
/* |
/* |
* If we're not to right-marginalise it (newline), then instead |
* If we're not to right-marginalise it (newline), then instead |
* pad to the right margin and stay off. |
* pad to the right margin and stay off. |
*/ |
*/ |
|
|
if (p->flags & TERMP_NOBREAK) { |
if (p->flags & TERMP_NOBREAK) { |
if ( ! (p->flags & TERMP_NORPAD)) |
for ( ; vis < maxvis; vis++) |
for ( ; vis < maxvis; vis++) |
putchar(' '); |
putchar(' '); |
|
} else |
} else |
putchar('\n'); |
putchar('\n'); |
|
|
Line 414 nescape(struct termp *p, const char *word, size_t len) |
|
Line 431 nescape(struct termp *p, const char *word, size_t len) |
|
|
|
|
|
static void |
static void |
|
pgraph(struct termp *p, char byte) |
|
{ |
|
int i; |
|
|
|
switch (byte) { |
|
case (' '): |
|
chara(p, ' '); |
|
break; |
|
case ('\t'): |
|
for (i = 0; i < INDENT; i++) |
|
chara(p, ' '); |
|
break; |
|
default: |
|
warnx("unknown non-graphing character"); |
|
break; |
|
} |
|
} |
|
|
|
|
|
static void |
pescape(struct termp *p, const char *word, size_t *i, size_t len) |
pescape(struct termp *p, const char *word, size_t *i, size_t len) |
{ |
{ |
size_t j; |
size_t j; |
Line 465 pescape(struct termp *p, const char *word, size_t *i, |
|
Line 502 pescape(struct termp *p, const char *word, size_t *i, |
|
/* FALLTHROUGH */ |
/* FALLTHROUGH */ |
case ('.'): |
case ('.'): |
chara(p, word[*i]); |
chara(p, word[*i]); |
|
break; |
|
case ('e'): |
|
chara(p, '\\'); |
|
break; |
default: |
default: |
break; |
break; |
} |
} |
Line 484 pword(struct termp *p, const char *word, size_t len) |
|
Line 525 pword(struct termp *p, const char *word, size_t len) |
|
{ |
{ |
size_t i; |
size_t i; |
|
|
/*assert(len > 0);*/ /* Can be, if literal. */ |
|
|
|
/* |
/* |
* Handle pwords, partial words, which may be either a single |
* Handle pwords, partial words, which may be either a single |
* word or a phrase that cannot be broken down (such as a |
* word or a phrase that cannot be broken down (such as a |
Line 512 pword(struct termp *p, const char *word, size_t len) |
|
Line 551 pword(struct termp *p, const char *word, size_t len) |
|
for (i = 0; i < len; i++) { |
for (i = 0; i < len; i++) { |
if ('\\' == word[i]) { |
if ('\\' == word[i]) { |
pescape(p, word, &i, len); |
pescape(p, word, &i, len); |
|
continue; |
|
} |
|
if ( ! isgraph((int)word[i])) { |
|
pgraph(p, word[i]); |
continue; |
continue; |
} |
} |
chara(p, word[i]); |
chara(p, word[i]); |