e1e0fd634b
git-svn-id: svn://svn.savannah.gnu.org/nano/trunk/nano@1489 35c25a1d-7b9e-4130-9fde-d3aeb78583b8
374 строки
9.5 KiB
C
374 строки
9.5 KiB
C
/* $Id$ */
|
|
/**************************************************************************
|
|
* utils.c *
|
|
* *
|
|
* Copyright (C) 1999-2003 Chris Allegretta *
|
|
* This program is free software; you can redistribute it and/or modify *
|
|
* it under the terms of the GNU General Public License as published by *
|
|
* the Free Software Foundation; either version 2, or (at your option) *
|
|
* any later version. *
|
|
* *
|
|
* This program is distributed in the hope that it will be useful, *
|
|
* but WITHOUT ANY WARRANTY; without even the implied warranty of *
|
|
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the *
|
|
* GNU General Public License for more details. *
|
|
* *
|
|
* You should have received a copy of the GNU General Public License *
|
|
* along with this program; if not, write to the Free Software *
|
|
* Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. *
|
|
* *
|
|
**************************************************************************/
|
|
|
|
#include "config.h"
|
|
|
|
#include <stdio.h>
|
|
#include <unistd.h>
|
|
#include <stdlib.h>
|
|
#include <string.h>
|
|
#include <ctype.h>
|
|
#include <assert.h>
|
|
#include "proto.h"
|
|
#include "nano.h"
|
|
|
|
#ifdef BROKEN_REGEXEC
|
|
#undef regexec
|
|
int regexec_safe(const regex_t *preg, const char *string, size_t nmatch,
|
|
regmatch_t pmatch[], int eflags)
|
|
{
|
|
if (string != NULL && *string != '\0')
|
|
return regexec(preg, string, nmatch, pmatch, eflags);
|
|
return REG_NOMATCH;
|
|
}
|
|
#define regexec(preg, string, nmatch, pmatch, eflags) regexec_safe(preg, string, nmatch, pmatch, eflags)
|
|
#endif
|
|
|
|
int is_cntrl_char(int c)
|
|
{
|
|
return (-128 <= c && c < -96) || (0 <= c && c < 32) ||
|
|
(127 <= c && c < 160);
|
|
}
|
|
|
|
int num_of_digits(int n)
|
|
{
|
|
int i = 1;
|
|
|
|
if (n < 0)
|
|
n = -n;
|
|
|
|
while (n > 10) {
|
|
n /= 10;
|
|
i++;
|
|
}
|
|
|
|
return i;
|
|
}
|
|
|
|
/* Fix the memory allocation for a string. */
|
|
void align(char **strp)
|
|
{
|
|
if (strp != NULL)
|
|
*strp = nrealloc(*strp, strlen(*strp) + 1);
|
|
}
|
|
|
|
/* Null a string at a certain index and align it. */
|
|
void null_at(char **data, size_t index)
|
|
{
|
|
assert(data != NULL);
|
|
*data = charealloc(*data, index + 1);
|
|
(*data)[index] = '\0';
|
|
}
|
|
|
|
/* For non-null-terminated lines. A line, by definition, shouldn't
|
|
* normally have newlines in it, so encode its nulls as newlines. */
|
|
void unsunder(char *str, size_t true_len)
|
|
{
|
|
assert(str != NULL);
|
|
for(; true_len > 0; true_len--, str++)
|
|
if (*str == '\0')
|
|
*str = '\n';
|
|
}
|
|
|
|
/* For non-null-terminated lines. A line, by definition, shouldn't
|
|
* normally have newlines in it, so decode its newlines into nulls. */
|
|
void sunder(char *str)
|
|
{
|
|
assert(str != NULL);
|
|
for(; *str != '\0'; str++)
|
|
if (*str == '\n')
|
|
*str = '\0';
|
|
}
|
|
|
|
/* None of this is needed if we're using NANO_SMALL! */
|
|
#ifndef NANO_SMALL
|
|
const char *revstrstr(const char *haystack, const char *needle,
|
|
const char *rev_start)
|
|
{
|
|
for(; rev_start >= haystack ; rev_start--) {
|
|
const char *r, *q;
|
|
|
|
for (r = rev_start, q = needle ; *q == *r && *q != '\0'; r++, q++)
|
|
;
|
|
if (*q == '\0')
|
|
return rev_start;
|
|
}
|
|
return NULL;
|
|
}
|
|
|
|
const char *revstristr(const char *haystack, const char *needle,
|
|
const char *rev_start)
|
|
{
|
|
for (; rev_start >= haystack; rev_start--) {
|
|
const char *r = rev_start, *q = needle;
|
|
|
|
for (; (tolower(*q) == tolower(*r)) && (*q != '\0') ; r++, q++)
|
|
;
|
|
if (*q == '\0')
|
|
return rev_start;
|
|
}
|
|
return NULL;
|
|
}
|
|
#endif /* !NANO_SMALL */
|
|
|
|
/* This is now mutt's version (called mutt_stristr) because it doesn't
|
|
* use memory allocation to do a simple search (yuck). */
|
|
const char *stristr(const char *haystack, const char *needle)
|
|
{
|
|
const char *p, *q;
|
|
|
|
if (haystack == NULL)
|
|
return NULL;
|
|
if (needle == NULL)
|
|
return haystack;
|
|
|
|
while (*(p = haystack) != '\0') {
|
|
for (q = needle; *p != 0 && *q != 0 && tolower(*p) == tolower(*q); p++, q++)
|
|
;
|
|
if (*q == 0)
|
|
return haystack;
|
|
haystack++;
|
|
}
|
|
return NULL;
|
|
}
|
|
|
|
/* If we are searching backwards, we will find the last match
|
|
* that starts no later than rev_start. If we are doing a regexp search,
|
|
* then line_pos should be 0 if haystack starts at the beginning of a
|
|
* line, and positive otherwise. In the regexp case, we fill in the
|
|
* global variable regmatches with at most 9 subexpression matches. Also,
|
|
* all .rm_so elements are relative to the start of the whole match, so
|
|
* regmatches[0].rm_so == 0. */
|
|
const char *strstrwrapper(const char *haystack, const char *needle,
|
|
const char *rev_start, int line_pos)
|
|
{
|
|
#ifdef HAVE_REGEX_H
|
|
if (ISSET(USE_REGEXP)) {
|
|
#ifndef NANO_SMALL
|
|
if (ISSET(REVERSE_SEARCH)) {
|
|
/* When doing a backwards search, haystack is a whole line. */
|
|
if (!regexec(&search_regexp, haystack, 1, regmatches, 0) &&
|
|
haystack + regmatches[0].rm_so <= rev_start) {
|
|
const char *retval = haystack + regmatches[0].rm_so;
|
|
|
|
/* Search forward until there is no more match. */
|
|
while (!regexec(&search_regexp, retval + 1, 1, regmatches,
|
|
REG_NOTBOL) &&
|
|
retval + 1 + regmatches[0].rm_so <= rev_start)
|
|
retval += 1 + regmatches[0].rm_so;
|
|
/* Finally, put the subexpression matches in global
|
|
* variable regmatches. The REG_NOTBOL flag doesn't
|
|
* matter now. */
|
|
regexec(&search_regexp, retval, 10, regmatches, 0);
|
|
return retval;
|
|
}
|
|
} else
|
|
#endif /* !NANO_SMALL */
|
|
if (!regexec(&search_regexp, haystack, 10, regmatches,
|
|
line_pos > 0 ? REG_NOTBOL : 0)) {
|
|
const char *retval = haystack + regmatches[0].rm_so;
|
|
|
|
regexec(&search_regexp, retval, 10, regmatches, 0);
|
|
return retval;
|
|
}
|
|
return NULL;
|
|
}
|
|
#endif /* HAVE_REGEX_H */
|
|
#ifndef NANO_SMALL
|
|
if (ISSET(CASE_SENSITIVE)) {
|
|
if (ISSET(REVERSE_SEARCH))
|
|
return revstrstr(haystack, needle, rev_start);
|
|
else
|
|
return strstr(haystack, needle);
|
|
} else if (ISSET(REVERSE_SEARCH))
|
|
return revstristr(haystack, needle, rev_start);
|
|
#endif
|
|
return stristr(haystack, needle);
|
|
}
|
|
|
|
/* This is a wrapper for the perror function. The wrapper takes care of
|
|
* ncurses, calls perror (which writes to STDERR), then refreshes the
|
|
* screen. Note that nperror causes the window to flicker once. */
|
|
void nperror(const char *s)
|
|
{
|
|
/* leave ncurses mode, go to the terminal */
|
|
if (endwin() != ERR) {
|
|
perror(s); /* print the error */
|
|
total_refresh(); /* return to ncurses and repaint */
|
|
}
|
|
}
|
|
|
|
/* Thanks BG, many ppl have been asking for this... */
|
|
void *nmalloc(size_t howmuch)
|
|
{
|
|
void *r = malloc(howmuch);
|
|
|
|
if (r == NULL && howmuch != 0)
|
|
die(_("nano is out of memory!"));
|
|
|
|
return r;
|
|
}
|
|
|
|
void *nrealloc(void *ptr, size_t howmuch)
|
|
{
|
|
void *r = realloc(ptr, howmuch);
|
|
|
|
if (r == NULL && howmuch != 0)
|
|
die(_("nano is out of memory!"));
|
|
|
|
return r;
|
|
}
|
|
|
|
/* Copy one malloc()ed string to another pointer. Should be used as:
|
|
* dest = mallocstrcpy(dest, src); */
|
|
char *mallocstrcpy(char *dest, const char *src)
|
|
{
|
|
if (src == dest)
|
|
return dest;
|
|
|
|
if (dest != NULL)
|
|
free(dest);
|
|
|
|
if (src == NULL)
|
|
return NULL;
|
|
|
|
dest = charalloc(strlen(src) + 1);
|
|
strcpy(dest, src);
|
|
|
|
return dest;
|
|
}
|
|
|
|
/* Append a new magic-line to filebot. */
|
|
void new_magicline(void)
|
|
{
|
|
filebot->next = nmalloc(sizeof(filestruct));
|
|
filebot->next->data = charalloc(1);
|
|
filebot->next->data[0] = '\0';
|
|
filebot->next->prev = filebot;
|
|
filebot->next->next = NULL;
|
|
filebot->next->lineno = filebot->lineno + 1;
|
|
filebot = filebot->next;
|
|
totlines++;
|
|
totsize++;
|
|
}
|
|
|
|
#ifndef DISABLE_TABCOMP
|
|
/*
|
|
* Routine to see if a text string is matched by a wildcard pattern.
|
|
* Returns TRUE if the text is matched, or FALSE if it is not matched
|
|
* or if the pattern is invalid.
|
|
* * matches zero or more characters
|
|
* ? matches a single character
|
|
* [abc] matches 'a', 'b' or 'c'
|
|
* \c quotes character c
|
|
* Adapted from code written by Ingo Wilken, and
|
|
* then taken from sash, Copyright (c) 1999 by David I. Bell
|
|
* Permission is granted to use, distribute, or modify this source,
|
|
* provided that this copyright notice remains intact.
|
|
* Permission to distribute this code under the GPL has been granted.
|
|
*/
|
|
int check_wildcard_match(const char *text, const char *pattern)
|
|
{
|
|
const char *retrypat;
|
|
const char *retrytext;
|
|
int ch;
|
|
int found;
|
|
int len;
|
|
|
|
retrypat = NULL;
|
|
retrytext = NULL;
|
|
|
|
while (*text != '\0' || *pattern != '\0') {
|
|
ch = *pattern++;
|
|
|
|
switch (ch) {
|
|
case '*':
|
|
retrypat = pattern;
|
|
retrytext = text;
|
|
break;
|
|
|
|
case '[':
|
|
found = FALSE;
|
|
|
|
while ((ch = *pattern++) != ']') {
|
|
if (ch == '\\')
|
|
ch = *pattern++;
|
|
|
|
if (ch == '\0')
|
|
return FALSE;
|
|
|
|
if (*text == ch)
|
|
found = TRUE;
|
|
}
|
|
len = strlen(text);
|
|
if (found == FALSE && len != 0) {
|
|
return FALSE;
|
|
}
|
|
if (found == TRUE) {
|
|
if (strlen(pattern) == 0 && len == 1) {
|
|
return TRUE;
|
|
}
|
|
if (len != 0) {
|
|
text++;
|
|
continue;
|
|
}
|
|
}
|
|
|
|
/* fall into next case */
|
|
|
|
case '?':
|
|
if (*text++ == '\0')
|
|
return FALSE;
|
|
|
|
break;
|
|
|
|
case '\\':
|
|
ch = *pattern++;
|
|
|
|
if (ch == '\0')
|
|
return FALSE;
|
|
|
|
/* fall into next case */
|
|
|
|
default:
|
|
if (*text == ch) {
|
|
if (*text != '\0')
|
|
text++;
|
|
break;
|
|
}
|
|
|
|
if (*text != '\0') {
|
|
pattern = retrypat;
|
|
text = ++retrytext;
|
|
break;
|
|
}
|
|
|
|
return FALSE;
|
|
}
|
|
|
|
if (pattern == NULL)
|
|
return FALSE;
|
|
}
|
|
|
|
return TRUE;
|
|
}
|
|
#endif
|