Zabbix

/*

** Copyright (C) 2001-2025 Zabbix SIA

**

** This program is free software: you can redistribute it and/or modify it under the terms of

** the GNU Affero General Public License as published by the Free Software Foundation, version 3.

**

** 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 Affero General Public License for more details.

**

** You should have received a copy of the GNU Affero General Public License along with this program.

** If not, see <https://www.gnu.org/licenses/>.

**/

​

#include "pb_history.h"

#include "proxybuffer.h"

#include "zbx_host_constants.h"

#include "zbx_item_constants.h"

#include "zbxcacheconfig.h"

#include "zbxcachehistory.h"

#include "zbxcommon.h"

#include "zbxdb.h"

#include "zbxdbhigh.h"

#include "zbxjson.h"

#include "zbxnum.h"

#include "zbxproxybuffer.h"

#include "zbxshmem.h"

#include "zbxtime.h"

​

static void pb_history_add_rows_db(zbx_list_t *rows, zbx_list_item_t *next, zbx_uint64_t *lastid);

​

struct zbx_pb_history_data

{

    zbx_pb_state_t  state;

    zbx_list_t  rows;

    int     rows_num;

    zbx_db_insert_t db_insert;

    zbx_uint64_t    handleid;

};

​

void    pb_list_free_history(zbx_list_t *list, zbx_pb_history_t *row)

{

    if (NULL != row->value)

        list->mem_free_func(row->value);

    if (NULL != row->source)

        list->mem_free_func(row->source);

    list->mem_free_func(row);

}

​

/******************************************************************************

 *                                                                            *

 * Purpose: estimate approximate history row size in cache                    *

 *                                                                            *

 ******************************************************************************/

size_t  pb_history_estimate_row_size(const char *value, const char *source)

{

    size_t  size = 0;

​

    size += zbx_shmem_required_chunk_size(sizeof(zbx_pb_history_t));

    size += zbx_shmem_required_chunk_size(sizeof(zbx_list_item_t));

    size += zbx_shmem_required_chunk_size(strlen(value) + 1);

    size += zbx_shmem_required_chunk_size(strlen(source) + 1);

​

    return size;

}

​

static void pb_history_free(zbx_pb_history_t *row)

{

    if (0 == (row->flags & ZBX_PROXY_HISTORY_FLAG_NOVALUE))

    {

        zbx_free(row->value);

        zbx_free(row->source);

    }

​

    zbx_free(row);

}

​

static void pb_history_add_value(zbx_pb_history_data_t *data, zbx_uint64_t itemid, int state, const char *value,

        const zbx_timespec_t *ts, int flags, zbx_uint64_t lastlogsize, int mtime, int timestamp, int logeventid,

        int severity, const char *source, time_t now)

{

    if (PB_MEMORY == data->state)

    {

        zbx_pb_history_t    *row;

​

        row = (zbx_pb_history_t *)zbx_malloc(NULL, sizeof(zbx_pb_history_t));

​

        row->id = 0;

        row->itemid = itemid;

        row->state = state;

        row->ts = *ts;