src/common/string_match.c

   1 /*
   2  * Claws Mail -- regexp pattern matching utilities
   3  * Copyright (C) 2001 Thomas Link, Hiroyuki Yamamoto
   4  *                    Modified by Melvin Hadasht.
   5  *
   6  * This program is free software; you can redistribute it and/or modify
   7  * it under the terms of the GNU General Public License as published by
   8  * the Free Software Foundation; either version 3 of the License, or
   9  * (at your option) any later version.
  10  *
  11  * This program is distributed in the hope that it will be useful,
  12  * but WITHOUT ANY WARRANTY; without even the implied warranty of
  13  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  14  * GNU General Public License for more details.
  15  *
  16  * You should have received a copy of the GNU General Public License
  17  * along with this program. If not, see <http://www.gnu.org/licenses/>.
  18  *
  19  */
  20
  21 #ifdef HAVE_CONFIG_H
  22 #  include "config.h"
  23 #include "claws-features.h"
  24 #endif
  25
  26 #include <glib.h>
  27 #ifdef ENABLE_NLS
  28 #include <glib/gi18n.h>
  29 #else
  30 #define _(a) (a)
  31 #define N_(a) (a)
  32 #endif
  33 #include <string.h>
  34
  35 #include "string_match.h"
  36 #include "utils.h"
  37
  38 int string_match_precompile (gchar *rexp, regex_t *preg, int cflags)
  39 {
  40         int problem = 0;
  41
  42         cm_return_val_if_fail(rexp, -1);
  43         cm_return_val_if_fail(*rexp, -1);
  44
  45         problem = regcomp(preg, rexp, cflags);
  46
  47         return problem;
  48 }
  49
  50
  51 gchar *string_remove_match(gchar *buf, gint buflen, gchar * txt, regex_t *preg)
  52 {
  53         regmatch_t match;
  54         int notfound;
  55         gint i, j ,k;
  56
  57         if (!preg)
  58                 return txt;
  59         if (*txt != 0x00) {
  60                 i = 0;
  61                 j = 0;
  62                 do {
  63                         notfound = regexec(preg, txt+j, 1, &match, (j ? REG_NOTBOL : 0));
  64                         if (notfound) {
  65                                 while (txt[j] && i < buflen -1)
  66                                         buf[i++] = txt[j++];
  67                         } else {
  68                                 if ( match.rm_so == match.rm_eo)
  69                                         buf[i++] = txt[j++];
  70                                 else {
  71                                         k = j;
  72                                         while (txt[j] &&  j != k + match.rm_so)
  73                                                 buf[i++] = txt[j++];
  74                                         if (txt[j])
  75                                                 j = k + match.rm_eo;
  76                                 }
  77                         }
  78                 } while (txt[j] && i < buflen - 1);
  79                 buf[i] = 0x00;
  80                 if (buf[0] == 0x00) {
  81                         strncpy(buf, _("(Subject cleared by RegExp)"),
  82                                         buflen - 1);
  83                         buf[buflen - 1] = 0x00;
  84                 }
  85                 return buf;
  86         }
  87         return txt;
  88 }
  89