Zabbix

/*

** Zabbix

** Copyright (C) 2001-2023 Zabbix SIA

**

** 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 of the License, 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., 51 Franklin Street, Fifth Floor, Boston, MA  02110-1301, USA.

**/

​

#include "zbxstr.h"

​

#ifdef HAVE_ICONV

#   include <iconv.h>

#endif

​

/* Has to be rewritten to avoid malloc */

char    *zbx_string_replace(const char *str, const char *sub_str1, const char *sub_str2)

{

    char        *t, *new_str = NULL;

    const char  *p, *q, *r;

    long        len, diff, count = 0;

​

    assert(str);

    assert(sub_str1);

    assert(sub_str2);

​

    len = (long)strlen(sub_str1);

​

    /* count the number of occurrences of sub_str1 */

    for ( p=str; (p = strstr(p, sub_str1)); p+=len, count++ );

​

    if (0 == count)

        return zbx_strdup(NULL, str);

​

    diff = (long)strlen(sub_str2) - len;

​

    /* allocate new memory */

    new_str = (char *)zbx_malloc(new_str, (size_t)(strlen(str) + count*diff + 1)*sizeof(char));

​

    for (q=str,t=new_str,p=str; (p = strstr(p, sub_str1)); )

    {

        /* copy until next occurrence of sub_str1 */

        for ( ; q < p; *t++ = *q++);

        q += len;

        p = q;

        for ( r = sub_str2; (*t++ = *r++); );

        --t;

    }

    /* copy the tail of str */

    for( ; *q ; *t++ = *q++ );

​

    *t = '\0';

​