GCOV - Varnish Cache


/*-
 * Copyright (c) 2006 Verdens Gang AS
 * Copyright (c) 2006-2015 Varnish Software AS
 * All rights reserved.
 *
 * Author: Poul-Henning Kamp <phk@phk.freebsd.dk>
 * Author: Martin Blix Grydeland <martin@varnish-software.com>
 *
 * SPDX-License-Identifier: BSD-2-Clause
 *
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions
 * are met:
 * 1. Redistributions of source code must retain the above copyright
 *    notice, this list of conditions and the following disclaimer.
 * 2. Redistributions in binary form must reproduce the above copyright
 *    notice, this list of conditions and the following disclaimer in the
 *    documentation and/or other materials provided with the distribution.
 *
 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
 * ARE DISCLAIMED.  IN NO EVENT SHALL AUTHOR OR CONTRIBUTORS BE LIABLE
 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
 * SUCH DAMAGE.
 */

#include "config.h"

#include <sys/stat.h>

#include <fnmatch.h>
#include <stdint.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <unistd.h>

#include "vdef.h"
#include "vas.h"
#include "miniobj.h"
#include "vqueue.h"
#include "vjsn.h"
#include "vsb.h"
#include "vsc_priv.h"
#include "vtim.h"

#include "vapi/vsc.h"
#include "vapi/vsm.h"

struct vsc_sf_mode {
        const char              *name;
        unsigned                include;
        unsigned                fail;
        unsigned                append;
};

static const struct vsc_sf_mode VSC_SF_INCLUDE[1] = {{"include", 1, 1, 1}};
static const struct vsc_sf_mode VSC_SF_EXCLUDE[1] = {{"exclude", 0, 0, 1}};
static const struct vsc_sf_mode VSC_SF_REQUIRE[1] = {{"require", 1, 0, 0}};

struct vsc_sf {
        unsigned                        magic;
#define VSC_SF_MAGIC                    0x558478dd
        VTAILQ_ENTRY(vsc_sf)            list;
        char                            *pattern;
        const struct vsc_sf_mode        *mode;
};

VTAILQ_HEAD(vsc_sf_head, vsc_sf);

struct vsc_pt {
        struct VSC_point        point;
        char                    *name;
};

enum vsc_seg_type {
        VSC_SEG_COUNTERS = 1,
        VSC_SEG_DOCS,
};

struct vsc_seg {
        unsigned                magic;
#define VSC_SEG_MAGIC           0x801177d4
        enum vsc_seg_type       type;
        VTAILQ_ENTRY(vsc_seg)   list;
        VTAILQ_ENTRY(vsc_seg)   doc_list;
        struct vsm_fantom       fantom[1];
        const struct vsc_head   *head;
        const char              *body;

        struct vjsn             *vj;

        unsigned                npoints;
        struct vsc_pt           *points;

        int                     mapped;
        int                     exposed;
};
VTAILQ_HEAD(vsc_seg_head, vsc_seg);

struct vsc {
        unsigned                magic;
#define VSC_MAGIC               0x3373554a

        unsigned                raw;
        struct vsc_sf_head      sf_list;
        struct vsc_seg_head     segs;
        struct vsc_seg_head     docs;

        VSC_new_f               *fnew;
        VSC_destroy_f           *fdestroy;
        void                    *priv;
};

/*--------------------------------------------------------------------
 * Build the static level, type and point descriptions
 */

enum vsc_levels {
#define VSC_LEVEL_F(v,l,e,d) v,
#include "tbl/vsc_levels.h"
};

static const struct VSC_level_desc levels[] = {
#define VSC_LEVEL_F(v,l,e,d) [v] = {#v, l, e, d},
#include "tbl/vsc_levels.h"
};

static const ssize_t nlevels = sizeof(levels)/sizeof(*levels);

/*--------------------------------------------------------------------*/

struct vsc *
VSC_New(void)
{
        struct vsc *vsc;

        ALLOC_OBJ(vsc, VSC_MAGIC);
        if (vsc == NULL)
                return (vsc);
        VTAILQ_INIT(&vsc->sf_list);
        VTAILQ_INIT(&vsc->segs);
        VTAILQ_INIT(&vsc->docs);
        return (vsc);
}

/*--------------------------------------------------------------------*/

static int
vsc_sf_arg(struct vsc *vsc, const char *glob, const struct vsc_sf_mode *mode)
{
        struct vsc_sf *sf;

        CHECK_OBJ_NOTNULL(vsc, VSC_MAGIC);
        AN(glob);
        AN(mode);

        ALLOC_OBJ(sf, VSC_SF_MAGIC);
        AN(sf);
        REPLACE(sf->pattern, glob);
        sf->mode = mode;
        AN(mode->name);
        if (mode->append)
                VTAILQ_INSERT_TAIL(&vsc->sf_list, sf, list);
        else
                VTAILQ_INSERT_HEAD(&vsc->sf_list, sf, list);
        return (1);
}

static int
vsc_f_arg(struct vsc *vsc, const char *opt)
{

        CHECK_OBJ_NOTNULL(vsc, VSC_MAGIC);
        AN(opt);

        if (opt[0] == '^')
                return (vsc_sf_arg(vsc, opt + 1, VSC_SF_EXCLUDE));
        return (vsc_sf_arg(vsc, opt, VSC_SF_INCLUDE));
}

/*--------------------------------------------------------------------*/

int
VSC_Arg(struct vsc *vsc, char arg, const char *opt)
{

        CHECK_OBJ_NOTNULL(vsc, VSC_MAGIC);

        switch (arg) {
        case 'I': return (vsc_sf_arg(vsc, opt, VSC_SF_INCLUDE));
        case 'X': return (vsc_sf_arg(vsc, opt, VSC_SF_EXCLUDE));
        case 'R': return (vsc_sf_arg(vsc, opt, VSC_SF_REQUIRE));
        case 'f': return (vsc_f_arg(vsc, opt));
        case 'r': vsc->raw = !vsc->raw; return (1);
        default: return (0);
        }
}

unsigned
VSC_IsRaw(const struct vsc *vsc)
{

        CHECK_OBJ_NOTNULL(vsc, VSC_MAGIC);
        return (vsc->raw);
}

/*--------------------------------------------------------------------
 */

static int
vsc_filter(const struct vsc *vsc, const char *nm)
{
        struct vsc_sf *sf;
        unsigned res = 0;

        CHECK_OBJ_NOTNULL(vsc, VSC_MAGIC);
        VTAILQ_FOREACH(sf, &vsc->sf_list, list) {
                if (!fnmatch(sf->pattern, nm, 0))
                        return (!sf->mode->include);
                res |= sf->mode->fail;
        }
        return (res);
}

/*--------------------------------------------------------------------
 */

static void
vsc_clean_point(struct vsc_pt *point)
{
        REPLACE(point->name, NULL);
}

static void
vsc_fill_point(const struct vsc *vsc, const struct vsc_seg *seg,
    const struct vjsn_val *vv, struct vsb *vsb, struct vsc_pt *point)
{
        struct vjsn_val *vt;

        CHECK_OBJ_NOTNULL(vsc, VSC_MAGIC);
        memset(point, 0, sizeof *point);

        vt = vjsn_child(vv, "name");
        AN(vt);
        assert(vjsn_is_string(vt));

        VSB_clear(vsb);
        VSB_printf(vsb, "%s.%s", seg->fantom->ident, vt->value);
        AZ(VSB_finish(vsb));

        if (vsc_filter(vsc, VSB_data(vsb)))
                return;

        point->name = strdup(VSB_data(vsb));
        AN(point->name);
        point->point.name = point->name;

#define DOF(n, k)                               \
        vt = vjsn_child(vv, k);                 \
        AN(vt);                                 \
        assert(vjsn_is_string(vt));             \
        point->point.n = vt->value;

        DOF(ctype, "ctype");
        DOF(sdesc, "oneliner");
        DOF(ldesc, "docs");
#undef DOF
        vt = vjsn_child(vv, "type");
        AN(vt);
        assert(vjsn_is_string(vt));

        if (!strcmp(vt->value, "counter")) {
                point->point.semantics = 'c';
        } else if (!strcmp(vt->value, "gauge")) {
                point->point.semantics = 'g';
        } else if (!strcmp(vt->value, "bitmap")) {
                point->point.semantics = 'b';
        } else {
                point->point.semantics = '?';
        }

        vt = vjsn_child(vv, "format");
        AN(vt);
        assert(vjsn_is_string(vt));

        if (!strcmp(vt->value, "integer")) {
                point->point.format = 'i';
        } else if (!strcmp(vt->value, "bytes")) {
                point->point.format = 'B';
        } else if (!strcmp(vt->value, "bitmap")) {
                point->point.format = 'b';
        } else if (!strcmp(vt->value, "duration")) {
                point->point.format = 'd';
        } else {
                point->point.format = '?';
        }

        vt = vjsn_child(vv, "level");
        AN(vt);
        assert(vjsn_is_string(vt));

        if (!strcmp(vt->value, "info"))  {
                point->point.level = &levels[info];
        } else if (!strcmp(vt->value, "diag")) {
                point->point.level = &levels[diag];
        } else if (!strcmp(vt->value, "debug")) {
                point->point.level = &levels[debug];
        } else {
                WRONG("Illegal level");
        }

        vt = vjsn_child(vv, "index");
        AN(vt);

        point->point.ptr = (volatile const void*)(seg->body + atoi(vt->value));
        point->point.raw = vsc->raw;
}

static struct vsc_seg *
vsc_new_seg(const struct vsm_fantom *fp, enum vsc_seg_type type)
{
        struct vsc_seg *sp;

        ALLOC_OBJ(sp, VSC_SEG_MAGIC);
        AN(sp);
        *sp->fantom = *fp;
        sp->type = type;

        return (sp);
}

static void
vsc_unmap_seg(const struct vsc *vsc, struct vsm *vsm, struct vsc_seg *sp)
{
        unsigned u;
        struct vsc_pt *pp;

        CHECK_OBJ_NOTNULL(vsc, VSC_MAGIC);
        AN(vsm);
        CHECK_OBJ_NOTNULL(sp, VSC_SEG_MAGIC);

        AZ(sp->exposed);
        if (!sp->mapped)
                return;

        if (sp->type == VSC_SEG_COUNTERS) {
                pp = sp->points;
                for (u = 0; u < sp->npoints; u++, pp++)
                        vsc_clean_point(pp);
                free(sp->points);
                sp->points = NULL;
                sp->npoints = 0;
                AZ(sp->vj);
        } else if (sp->type == VSC_SEG_DOCS) {
                if (sp->vj != NULL)
                        vjsn_delete(&sp->vj);
                AZ(sp->vj);
                AZ(sp->points);
        } else {
                WRONG("Invalid segment type");
        }

        AZ(VSM_Unmap(vsm, sp->fantom));
        sp->head = NULL;
        sp->body = NULL;
        sp->mapped = 0;
}

static int
vsc_map_seg(const struct vsc *vsc, struct vsm *vsm, struct vsc_seg *sp)
{
        const struct vsc_head *head;
        struct vsc_seg *spd;
        const char *e;
        struct vjsn_val *vv, *vve;
        struct vsb *vsb;
        struct vsc_pt *pp;
        int retry;

        CHECK_OBJ_NOTNULL(vsc, VSC_MAGIC);
        AN(vsm);
        CHECK_OBJ_NOTNULL(sp, VSC_SEG_MAGIC);

        if (sp->mapped)
                return (0);

        AZ(sp->exposed);

        if (VSM_Map(vsm, sp->fantom))
                return (-1);
        head = sp->fantom->b;

        /* It isn't ready yet. Sleep and try again. If it still
         * isn't ready, fail the mapping. The transitions inside
         * varnishd that we are waiting for are just some memcpy()
         * operations, so there is no reason to allow a long retry
         * time. */
        for (retry = 10; retry > 0 && head->ready == 0; retry--)
                VTIM_sleep(0.01);

        if (head->ready == 0) {
                AZ(VSM_Unmap(vsm, sp->fantom));
                return (-1);
        }

        sp->head = head;
        sp->body = (char*)sp->fantom->b + sp->head->body_offset;
        sp->mapped = 1;

        if (sp->type == VSC_SEG_DOCS) {
                /* Parse the DOCS json */
                sp->vj = vjsn_parse(sp->body, &e);
                XXXAZ(e);
                AN(sp->vj);
                return (0);
        }

        assert(sp->type == VSC_SEG_COUNTERS);

        /* Find the corresponding DOCS seg. We are not able to
         * read and match on the doc_id until the DOCS section is
         * mapped. Iterate over all the DOCS sections, attempt to
         * map if needed, and then check the doc_id. */
        VTAILQ_FOREACH(spd, &vsc->docs, doc_list) {
                CHECK_OBJ_NOTNULL(spd, VSC_SEG_MAGIC);
                assert(spd->type == VSC_SEG_DOCS);
                if (!spd->mapped && vsc_map_seg(vsc, vsm, spd))
                        continue; /* Failed to map it */
                AN(spd->mapped);
                if (spd->head->doc_id == sp->head->doc_id)
                        break; /* We have a match */
        }
        if (spd == NULL) {
                /* Could not find the right DOCS seg. Leave this
                 * seg as unmapped. */
                vsc_unmap_seg(vsc, vsm, sp);
                return (-1);
        }

        /* Create the VSC points list */
        vve = vjsn_child(spd->vj->value, "elements");
        AN(vve);
        sp->npoints = strtoul(vve->value, NULL, 0);
        sp->points = calloc(sp->npoints, sizeof *sp->points);
        AN(sp->points);
        vsb = VSB_new_auto();
        AN(vsb);
        vve = vjsn_child(spd->vj->value, "elem");
        AN(vve);
        pp = sp->points;
        VTAILQ_FOREACH(vv, &vve->children, list) {
                vsc_fill_point(vsc, sp, vv, vsb, pp);
                pp++;
        }
        VSB_destroy(&vsb);
        return (0);
}

/*--------------------------------------------------------------------
 */

static void
vsc_expose(const struct vsc *vsc, struct vsc_seg *sp, int del)
{
        struct vsc_pt *pp;
        unsigned u;
        int expose;

        if (!sp->mapped) {
                AZ(sp->exposed);
                return;
        }

        if (vsc->fnew != NULL && !sp->exposed &&
            !del && sp->head->ready == 1)
                expose = 1;
        else if (vsc->fdestroy != NULL && sp->exposed &&
            (del || sp->head->ready == 2))
                expose = 0;
        else
                return;

        pp = sp->points;
        for (u = 0; u < sp->npoints; u++, pp++) {
                if (pp->name == NULL)
                        continue;
                if (expose)
                        pp->point.priv = vsc->fnew(vsc->priv, &pp->point);
                else
                        vsc->fdestroy(vsc->priv, &pp->point);
        }
        sp->exposed = expose;
}

/*--------------------------------------------------------------------
 */

static void
vsc_del_segs(struct vsc *vsc, struct vsm *vsm, struct vsc_seg_head *head)
{
        struct vsc_seg *sp, *sp2;

        VTAILQ_FOREACH_SAFE(sp, head, list, sp2) {
                CHECK_OBJ(sp, VSC_SEG_MAGIC);
                VTAILQ_REMOVE(head, sp, list);
                if (sp->type == VSC_SEG_DOCS)
                        VTAILQ_REMOVE(&vsc->docs, sp, doc_list);
                vsc_expose(vsc, sp, 1);
                vsc_unmap_seg(vsc, vsm, sp);
                FREE_OBJ(sp);
        }
}

/*--------------------------------------------------------------------
 */

static int
vsc_iter_seg(const struct vsc *vsc, const struct vsc_seg *sp,
    VSC_iter_f *fiter, void *priv)
{
        unsigned u;
        int i = 0;
        struct vsc_pt *pp;

        CHECK_OBJ_NOTNULL(vsc, VSC_MAGIC);
        CHECK_OBJ_NOTNULL(sp, VSC_SEG_MAGIC);
        AN(fiter);
        pp = sp->points;
        for (u = 0; u < sp->npoints && i == 0; u++, pp++) {
                if (pp->name != NULL)
                        i = fiter(priv, &pp->point);
        }
        return (i);
}

int
VSC_Iter(struct vsc *vsc, struct vsm *vsm, VSC_iter_f *fiter, void *priv)
{
        enum vsc_seg_type type;
        struct vsm_fantom ifantom;
        struct vsc_seg *sp, *sp2;
        struct vsc_seg_head removed;
        int i = 0;

        CHECK_OBJ_NOTNULL(vsc, VSC_MAGIC);
        AN(vsm);

        /* First walk the VSM segment list and consolidate with the shadow
         * VSC seg list. We avoid calling any of the callback functions
         * while iterating the VSMs. This removes any headaches wrt to
         * callbacks calling VSM_Status(). */
        VTAILQ_INIT(&removed);
        sp = VTAILQ_FIRST(&vsc->segs);
        VSM_FOREACH(&ifantom, vsm) {
                AN(ifantom.category);
                if (!strcmp(ifantom.category, VSC_CLASS))
                        type = VSC_SEG_COUNTERS;
                else if (!strcmp(ifantom.category, VSC_DOC_CLASS))
                        type = VSC_SEG_DOCS;
                else {
                        /* Not one of the categories we care about */
                        continue;
                }

                while (sp != NULL) {
                        CHECK_OBJ_NOTNULL(sp, VSC_SEG_MAGIC);
                        if (VSM_StillValid(vsm, sp->fantom) == VSM_valid &&
                            !strcmp(ifantom.ident, sp->fantom->ident)) {
                                /* sp matches the expected value */
                                break;
                        }

                        /* sp is no longer in the VSM list. Remove it from
                         * our list. */
                        sp2 = sp;
                        sp = VTAILQ_NEXT(sp, list);
                        VTAILQ_REMOVE(&vsc->segs, sp2, list);
                        VTAILQ_INSERT_TAIL(&removed, sp2, list);
                }

                if (sp == NULL) {
                        /* New entries are always appended last in the VSM
                         * list. Since we have iterated past all the
                         * entries in our shadow list, the VSM entry is a
                         * new entry we have not seen before. */
                        sp = vsc_new_seg(&ifantom, type);
                        AN(sp);
                        VTAILQ_INSERT_TAIL(&vsc->segs, sp, list);
                        if (type == VSC_SEG_DOCS)
                                VTAILQ_INSERT_TAIL(&vsc->docs, sp, doc_list);
                }

                assert(sp->type == type);
                sp = VTAILQ_NEXT(sp, list);
        }
        while (sp != NULL) {
                /* Clean up the tail end of the shadow list. */
                CHECK_OBJ_NOTNULL(sp, VSC_SEG_MAGIC);
                sp2 = sp;
                sp = VTAILQ_NEXT(sp, list);

                VTAILQ_REMOVE(&vsc->segs, sp2, list);
                VTAILQ_INSERT_TAIL(&removed, sp2, list);
        }

        vsc_del_segs(vsc, vsm, &removed);

        /* Iterate our shadow list, reporting on each pointer value */
        VTAILQ_FOREACH(sp, &vsc->segs, list) {
                CHECK_OBJ_NOTNULL(sp, VSC_SEG_MAGIC);

                if (sp->type != VSC_SEG_COUNTERS)
                        continue;

                /* Attempt to map the VSM. This is a noop if it was
                 * already mapped. If we fail we skip this seg on this
                 * call to VSC_Iter(), but will attempt again the next
                 * time VSC_Iter() is called. */
                if (vsc_map_seg(vsc, vsm, sp))
                        continue;

                /* Expose the counters if necessary */
                vsc_expose(vsc, sp, 0);

                if (fiter != NULL && sp->head->ready == 1)
                        i = vsc_iter_seg(vsc, sp, fiter, priv);
                if (i)
                        break;
        }

        return (i);
}

/*--------------------------------------------------------------------
 */

void
VSC_State(struct vsc *vsc, VSC_new_f *fn, VSC_destroy_f *fd, void *priv)
{
        struct vsc_seg *sp;

        CHECK_OBJ_NOTNULL(vsc, VSC_MAGIC);
        assert((fn == NULL && fd == NULL) || (fn != NULL && fd != NULL));
        if (fd == NULL) {
                VTAILQ_FOREACH(sp, &vsc->segs, list)
                        vsc_expose(vsc, sp, 1);
        }
        vsc->fnew = fn;
        vsc->fdestroy = fd;
        vsc->priv = priv;
}

/*--------------------------------------------------------------------
 */

const struct VSC_level_desc *
VSC_ChangeLevel(const struct VSC_level_desc *old, int chg)
{
        int i;

        if (old == NULL)
                old = &levels[0];
        for (i = 0; i < nlevels; i++)
                if (old == &levels[i])
                        break;
        if (i == nlevels)
                i = 0;

        i += chg;
        if (i >= nlevels)
                i = nlevels - 1;
        if (i < 0)
                i = 0;
        return (&levels[i]);
}

/*--------------------------------------------------------------------*/

void
VSC_Destroy(struct vsc **vscp, struct vsm *vsm)
{
        struct vsc *vsc;
        struct vsc_sf *sf, *sf2;

        TAKE_OBJ_NOTNULL(vsc, vscp, VSC_MAGIC);

        VTAILQ_FOREACH_SAFE(sf, &vsc->sf_list, list, sf2) {
                CHECK_OBJ_NOTNULL(sf, VSC_SF_MAGIC);
                VTAILQ_REMOVE(&vsc->sf_list, sf, list);
                free(sf->pattern);
                FREE_OBJ(sf);
        }

        vsc_del_segs(vsc, vsm, &vsc->segs);
        assert(VTAILQ_EMPTY(&vsc->docs));
        FREE_OBJ(vsc);
}

		varnish-cache/lib/libvarnishapi/vsc.c
0		/*-
1		* Copyright (c) 2006 Verdens Gang AS
2		* Copyright (c) 2006-2015 Varnish Software AS
3		* All rights reserved.
4		*
5		* Author: Poul-Henning Kamp <phk@phk.freebsd.dk>
6		* Author: Martin Blix Grydeland <martin@varnish-software.com>
7		*
8		* SPDX-License-Identifier: BSD-2-Clause
9		*
10		* Redistribution and use in source and binary forms, with or without
11		* modification, are permitted provided that the following conditions
12		* are met:
13		* 1. Redistributions of source code must retain the above copyright
14		* notice, this list of conditions and the following disclaimer.
15		* 2. Redistributions in binary form must reproduce the above copyright
16		* notice, this list of conditions and the following disclaimer in the
17		* documentation and/or other materials provided with the distribution.
18		*
19		* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
20		* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
21		* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
22		* ARE DISCLAIMED. IN NO EVENT SHALL AUTHOR OR CONTRIBUTORS BE LIABLE
23		* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
24		* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
25		* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
26		* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
27		* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
28		* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
29		* SUCH DAMAGE.
30		*/
31
32		#include "config.h"
33
34		#include <sys/stat.h>
35
36		#include <fnmatch.h>
37		#include <stdint.h>
38		#include <stdio.h>
39		#include <stdlib.h>
40		#include <string.h>
41		#include <unistd.h>
42
43		#include "vdef.h"
44		#include "vas.h"
45		#include "miniobj.h"
46		#include "vqueue.h"
47		#include "vjsn.h"
48		#include "vsb.h"
49		#include "vsc_priv.h"
50		#include "vtim.h"
51
52		#include "vapi/vsc.h"
53		#include "vapi/vsm.h"
54
55		struct vsc_sf_mode {
56		const char *name;
57		unsigned include;
58		unsigned fail;
59		unsigned append;
60		};
61
62		static const struct vsc_sf_mode VSC_SF_INCLUDE[1] = {{"include", 1, 1, 1}};
63		static const struct vsc_sf_mode VSC_SF_EXCLUDE[1] = {{"exclude", 0, 0, 1}};
64		static const struct vsc_sf_mode VSC_SF_REQUIRE[1] = {{"require", 1, 0, 0}};
65
66		struct vsc_sf {
67		unsigned magic;
68		#define VSC_SF_MAGIC 0x558478dd
69		VTAILQ_ENTRY(vsc_sf) list;
70		char *pattern;
71		const struct vsc_sf_mode *mode;
72		};
73
74		VTAILQ_HEAD(vsc_sf_head, vsc_sf);
75
76		struct vsc_pt {
77		struct VSC_point point;
78		char *name;
79		};
80
81		enum vsc_seg_type {
82		VSC_SEG_COUNTERS = 1,
83		VSC_SEG_DOCS,
84		};
85
86		struct vsc_seg {
87		unsigned magic;
88		#define VSC_SEG_MAGIC 0x801177d4
89		enum vsc_seg_type type;
90		VTAILQ_ENTRY(vsc_seg) list;
91		VTAILQ_ENTRY(vsc_seg) doc_list;
92		struct vsm_fantom fantom[1];
93		const struct vsc_head *head;
94		const char *body;
95
96		struct vjsn *vj;
97
98		unsigned npoints;
99		struct vsc_pt *points;
100
101		int mapped;
102		int exposed;
103		};
104		VTAILQ_HEAD(vsc_seg_head, vsc_seg);
105
106		struct vsc {
107		unsigned magic;
108		#define VSC_MAGIC 0x3373554a
109
110		unsigned raw;
111		struct vsc_sf_head sf_list;
112		struct vsc_seg_head segs;
113		struct vsc_seg_head docs;
114
115		VSC_new_f *fnew;
116		VSC_destroy_f *fdestroy;
117		void *priv;
118		};
119
120		/*--------------------------------------------------------------------
121		* Build the static level, type and point descriptions
122		*/
123
124		enum vsc_levels {
125		#define VSC_LEVEL_F(v,l,e,d) v,
126		#include "tbl/vsc_levels.h"
127		};
128
129		static const struct VSC_level_desc levels[] = {
130		#define VSC_LEVEL_F(v,l,e,d) [v] = {#v, l, e, d},
131		#include "tbl/vsc_levels.h"
132		};
133
134		static const ssize_t nlevels = sizeof(levels)/sizeof(*levels);
135
136		/--------------------------------------------------------------------/
137
138		struct vsc *
139	980	VSC_New(void)
140		{
141		struct vsc *vsc;
142
143	980	ALLOC_OBJ(vsc, VSC_MAGIC);
144	980	if (vsc == NULL)
145	0	return (vsc);
146	980	VTAILQ_INIT(&vsc->sf_list);
147	980	VTAILQ_INIT(&vsc->segs);
148	980	VTAILQ_INIT(&vsc->docs);
149	980	return (vsc);
150	980	}
151
152		/--------------------------------------------------------------------/
153
154		static int
155	37	vsc_sf_arg(struct vsc vsc, const char glob, const struct vsc_sf_mode *mode)
156		{
157		struct vsc_sf *sf;
158
159	37	CHECK_OBJ_NOTNULL(vsc, VSC_MAGIC);
160	37	AN(glob);
161	37	AN(mode);
162
163	37	ALLOC_OBJ(sf, VSC_SF_MAGIC);
164	37	AN(sf);
165	37	REPLACE(sf->pattern, glob);
166	37	sf->mode = mode;
167	37	AN(mode->name);
168	37	if (mode->append)
169	29	VTAILQ_INSERT_TAIL(&vsc->sf_list, sf, list);
170		else
171	8	VTAILQ_INSERT_HEAD(&vsc->sf_list, sf, list);
172	37	return (1);
173		}
174
175		static int
176	21	vsc_f_arg(struct vsc vsc, const char opt)
177		{
178
179	21	CHECK_OBJ_NOTNULL(vsc, VSC_MAGIC);
180	21	AN(opt);
181
182	21	if (opt[0] == '^')
183	5	return (vsc_sf_arg(vsc, opt + 1, VSC_SF_EXCLUDE));
184	16	return (vsc_sf_arg(vsc, opt, VSC_SF_INCLUDE));
185	21	}
186
187		/--------------------------------------------------------------------/
188
189		int
190	37	VSC_Arg(struct vsc vsc, char arg, const char opt)
191		{
192
193	37	CHECK_OBJ_NOTNULL(vsc, VSC_MAGIC);
194
195	37	switch (arg) {
196	7	case 'I': return (vsc_sf_arg(vsc, opt, VSC_SF_INCLUDE));
197	1	case 'X': return (vsc_sf_arg(vsc, opt, VSC_SF_EXCLUDE));
198	8	case 'R': return (vsc_sf_arg(vsc, opt, VSC_SF_REQUIRE));
199	21	case 'f': return (vsc_f_arg(vsc, opt));
200	0	case 'r': vsc->raw = !vsc->raw; return (1);
201	0	default: return (0);
202		}
203	37	}
204
205		unsigned
206	7	VSC_IsRaw(const struct vsc *vsc)
207		{
208
209	7	CHECK_OBJ_NOTNULL(vsc, VSC_MAGIC);
210	7	return (vsc->raw);
211		}
212
213		/*--------------------------------------------------------------------
214		*/
215
216		static int
217	54637	vsc_filter(const struct vsc vsc, const char nm)
218		{
219		struct vsc_sf *sf;
220	54637	unsigned res = 0;
221
222	54637	CHECK_OBJ_NOTNULL(vsc, VSC_MAGIC);
223	65889	VTAILQ_FOREACH(sf, &vsc->sf_list, list) {
224	11455	if (!fnmatch(sf->pattern, nm, 0))
225	203	return (!sf->mode->include);
226	11252	res \|= sf->mode->fail;
227	11252	}
228	54434	return (res);
229	54637	}
230
231		/*--------------------------------------------------------------------
232		*/
233
234		static void
235	46721	vsc_clean_point(struct vsc_pt *point)
236		{
237	46721	REPLACE(point->name, NULL);
238	46721	}
239
240		static void
241	54637	vsc_fill_point(const struct vsc vsc, const struct vsc_seg seg,
242		const struct vjsn_val vv, struct vsb vsb, struct vsc_pt *point)
243		{
244		struct vjsn_val *vt;
245
246	54637	CHECK_OBJ_NOTNULL(vsc, VSC_MAGIC);
247	54637	memset(point, 0, sizeof *point);
248
249	54637	vt = vjsn_child(vv, "name");
250	54637	AN(vt);
251	54637	assert(vjsn_is_string(vt));
252
253	54637	VSB_clear(vsb);
254	54637	VSB_printf(vsb, "%s.%s", seg->fantom->ident, vt->value);
255	54637	AZ(VSB_finish(vsb));
256
257	54637	if (vsc_filter(vsc, VSB_data(vsb)))
258	3904	return;
259
260	50733	point->name = strdup(VSB_data(vsb));
261	50733	AN(point->name);
262	50733	point->point.name = point->name;
263
264		#define DOF(n, k) \
265		vt = vjsn_child(vv, k); \
266		AN(vt); \
267		assert(vjsn_is_string(vt)); \
268		point->point.n = vt->value;
269
270	50733	DOF(ctype, "ctype");
271	50733	DOF(sdesc, "oneliner");
272	50733	DOF(ldesc, "docs");
273		#undef DOF
274	50733	vt = vjsn_child(vv, "type");
275	50733	AN(vt);
276	50733	assert(vjsn_is_string(vt));
277
278	50733	if (!strcmp(vt->value, "counter")) {
279	44633	point->point.semantics = 'c';
280	50733	} else if (!strcmp(vt->value, "gauge")) {
281	5960	point->point.semantics = 'g';
282	6100	} else if (!strcmp(vt->value, "bitmap")) {
283	140	point->point.semantics = 'b';
284	140	} else {
285	0	point->point.semantics = '?';
286		}
287
288	50733	vt = vjsn_child(vv, "format");
289	50733	AN(vt);
290	50733	assert(vjsn_is_string(vt));
291
292	50733	if (!strcmp(vt->value, "integer")) {
293	45886	point->point.format = 'i';
294	50733	} else if (!strcmp(vt->value, "bytes")) {
295	4244	point->point.format = 'B';
296	4847	} else if (!strcmp(vt->value, "bitmap")) {
297	140	point->point.format = 'b';
298	603	} else if (!strcmp(vt->value, "duration")) {
299	463	point->point.format = 'd';
300	463	} else {
301	0	point->point.format = '?';
302		}
303
304	50733	vt = vjsn_child(vv, "level");
305	50733	AN(vt);
306	50733	assert(vjsn_is_string(vt));
307
308	50733	if (!strcmp(vt->value, "info")) {
309	23880	point->point.level = &levels[info];
310	50733	} else if (!strcmp(vt->value, "diag")) {
311	15468	point->point.level = &levels[diag];
312	26853	} else if (!strcmp(vt->value, "debug")) {
313	11385	point->point.level = &levels[debug];
314	11385	} else {
315	0	WRONG("Illegal level");
316		}
317
318	50733	vt = vjsn_child(vv, "index");
319	50733	AN(vt);
320
321	50733	point->point.ptr = (volatile const void*)(seg->body + atoi(vt->value));
322	50733	point->point.raw = vsc->raw;
323	54637	}
324
325		static struct vsc_seg *
326	10767	vsc_new_seg(const struct vsm_fantom *fp, enum vsc_seg_type type)
327		{
328		struct vsc_seg *sp;
329
330	10767	ALLOC_OBJ(sp, VSC_SEG_MAGIC);
331	10767	AN(sp);
332	10767	sp->fantom = fp;
333	10767	sp->type = type;
334
335	10767	return (sp);
336		}
337
338		static void
339	9996	vsc_unmap_seg(const struct vsc vsc, struct vsm vsm, struct vsc_seg *sp)
340		{
341		unsigned u;
342		struct vsc_pt *pp;
343
344	9996	CHECK_OBJ_NOTNULL(vsc, VSC_MAGIC);
345	9996	AN(vsm);
346	9996	CHECK_OBJ_NOTNULL(sp, VSC_SEG_MAGIC);
347
348	9996	AZ(sp->exposed);
349	9996	if (!sp->mapped)
350	7227	return;
351
352	2769	if (sp->type == VSC_SEG_COUNTERS) {
353	2081	pp = sp->points;
354	48802	for (u = 0; u < sp->npoints; u++, pp++)
355	46721	vsc_clean_point(pp);
356	2081	free(sp->points);
357	2081	sp->points = NULL;
358	2081	sp->npoints = 0;
359	2081	AZ(sp->vj);
360	2769	} else if (sp->type == VSC_SEG_DOCS) {
361	688	if (sp->vj != NULL)
362	688	vjsn_delete(&sp->vj);
363	688	AZ(sp->vj);
364	688	AZ(sp->points);
365	688	} else {
366	0	WRONG("Invalid segment type");
367		}
368
369	2769	AZ(VSM_Unmap(vsm, sp->fantom));
370	2769	sp->head = NULL;
371	2769	sp->body = NULL;
372	2769	sp->mapped = 0;
373	9996	}
374
375		static int
376	23949	vsc_map_seg(const struct vsc vsc, struct vsm vsm, struct vsc_seg *sp)
377		{
378		const struct vsc_head *head;
379		struct vsc_seg *spd;
380		const char *e;
381		struct vjsn_val vv, vve;
382		struct vsb *vsb;
383		struct vsc_pt *pp;
384		int retry;
385
386	23949	CHECK_OBJ_NOTNULL(vsc, VSC_MAGIC);
387	23949	AN(vsm);
388	23949	CHECK_OBJ_NOTNULL(sp, VSC_SEG_MAGIC);
389
390	23949	if (sp->mapped)
391	20409	return (0);
392
393	3540	AZ(sp->exposed);
394
395	3540	if (VSM_Map(vsm, sp->fantom))
396	0	return (-1);
397	3540	head = sp->fantom->b;
398
399		/* It isn't ready yet. Sleep and try again. If it still
400		* isn't ready, fail the mapping. The transitions inside
401		* varnishd that we are waiting for are just some memcpy()
402		* operations, so there is no reason to allow a long retry
403		* time. */
404	3540	for (retry = 10; retry > 0 && head->ready == 0; retry--)
405	0	VTIM_sleep(0.01);
406
407	3540	if (head->ready == 0) {
408	0	AZ(VSM_Unmap(vsm, sp->fantom));
409	0	return (-1);
410		}
411
412	3540	sp->head = head;
413	3540	sp->body = (char*)sp->fantom->b + sp->head->body_offset;
414	3540	sp->mapped = 1;
415
416	3540	if (sp->type == VSC_SEG_DOCS) {
417		/* Parse the DOCS json */
418	800	sp->vj = vjsn_parse(sp->body, &e);
419	800	XXXAZ(e);
420	800	AN(sp->vj);
421	800	return (0);
422		}
423
424	2740	assert(sp->type == VSC_SEG_COUNTERS);
425
426		/* Find the corresponding DOCS seg. We are not able to
427		* read and match on the doc_id until the DOCS section is
428		* mapped. Iterate over all the DOCS sections, attempt to
429		* map if needed, and then check the doc_id. */
430	8937	VTAILQ_FOREACH(spd, &vsc->docs, doc_list) {
431	8937	CHECK_OBJ_NOTNULL(spd, VSC_SEG_MAGIC);
432	8937	assert(spd->type == VSC_SEG_DOCS);
433	8937	if (!spd->mapped && vsc_map_seg(vsc, vsm, spd))
434	0	continue; /* Failed to map it */
435	8937	AN(spd->mapped);
436	8937	if (spd->head->doc_id == sp->head->doc_id)
437	2740	break; /* We have a match */
438	6197	}
439	2740	if (spd == NULL) {
440		/* Could not find the right DOCS seg. Leave this
441		* seg as unmapped. */
442	0	vsc_unmap_seg(vsc, vsm, sp);
443	0	return (-1);
444		}
445
446		/* Create the VSC points list */
447	2740	vve = vjsn_child(spd->vj->value, "elements");
448	2740	AN(vve);
449	2740	sp->npoints = strtoul(vve->value, NULL, 0);
450	2740	sp->points = calloc(sp->npoints, sizeof *sp->points);
451	2740	AN(sp->points);
452	2740	vsb = VSB_new_auto();
453	2740	AN(vsb);
454	2740	vve = vjsn_child(spd->vj->value, "elem");
455	2740	AN(vve);
456	2740	pp = sp->points;
457	57377	VTAILQ_FOREACH(vv, &vve->children, list) {
458	54637	vsc_fill_point(vsc, sp, vv, vsb, pp);
459	54637	pp++;
460	54637	}
461	2740	VSB_destroy(&vsb);
462	2740	return (0);
463	23949	}
464
465		/*--------------------------------------------------------------------
466		*/
467
468		static void
469	33145	vsc_expose(const struct vsc vsc, struct vsc_seg sp, int del)
470		{
471		struct vsc_pt *pp;
472		unsigned u;
473		int expose;
474
475	33145	if (!sp->mapped) {
476	7227	AZ(sp->exposed);
477	7227	return;
478		}
479
480	26161	if (vsc->fnew != NULL && !sp->exposed &&
481	290	!del && sp->head->ready == 1)
482	243	expose = 1;
483	27385	else if (vsc->fdestroy != NULL && sp->exposed &&
484	1953	(del \|\| sp->head->ready == 2))
485	243	expose = 0;
486		else
487	25432	return;
488
489	486	pp = sp->points;
490	5600	for (u = 0; u < sp->npoints; u++, pp++) {
491	5114	if (pp->name == NULL)
492	692	continue;
493	4422	if (expose)
494	2211	pp->point.priv = vsc->fnew(vsc->priv, &pp->point);
495		else
496	2211	vsc->fdestroy(vsc->priv, &pp->point);
497	4422	}
498	486	sp->exposed = expose;
499	33145	}