File: sax_stack.h

package info (click to toggle)
ruby-ox 2.14.23-1
  • links: PTS, VCS
  • area: main
  • in suites: forky, sid
  • size: 3,504 kB
  • sloc: xml: 39,683; ansic: 9,626; ruby: 6,441; sh: 47; makefile: 2
file content (113 lines) | stat: -rw-r--r-- 2,903 bytes parent folder | download | duplicates (2)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
/* sax_stack.h
 * Copyright (c) 2011, Peter Ohler
 * All rights reserved.
 */

#ifndef OX_SAX_STACK_H
#define OX_SAX_STACK_H

#include <stdlib.h>

#include "intern.h"
#include "sax_hint.h"

#define STACK_INC 32
#define NV_BUF_MAX 64

typedef struct _nv {
    char        name_buf[NV_BUF_MAX];
    const char *name;
    VALUE       val;
    int         childCnt;
    Hint        hint;
} *Nv;

typedef struct _nStack {
    struct _nv base[STACK_INC];
    Nv         head; /* current stack */
    Nv         end;  /* stack end */
    Nv         tail; /* pointer to one past last element name on stack */
} *NStack;

inline static void stack_init(NStack stack) {
    stack->head = stack->base;
    stack->end  = stack->base + sizeof(stack->base) / sizeof(struct _nv);
    stack->tail = stack->head;
}

inline static int stack_empty(NStack stack) {
    return (stack->head == stack->tail);
}

inline static void stack_cleanup(NStack stack) {
    if (stack->base != stack->head) {
        xfree(stack->head);
    }
}

inline static void stack_push(NStack stack, const char *name, size_t nlen, VALUE val, Hint hint) {
    if (stack->end <= stack->tail) {
        size_t len  = stack->end - stack->head;
        size_t toff = stack->tail - stack->head;

        if (stack->base == stack->head) {
            stack->head = ALLOC_N(struct _nv, len + STACK_INC);
            memcpy(stack->head, stack->base, sizeof(struct _nv) * len);
        } else {
            REALLOC_N(stack->head, struct _nv, len + STACK_INC);
        }
        stack->tail = stack->head + toff;
        stack->end  = stack->head + len + STACK_INC;
    }
    if (NV_BUF_MAX <= nlen) {
        stack->tail->name = ox_strndup(name, nlen);
    } else {
        strncpy(stack->tail->name_buf, name, nlen);
        stack->tail->name_buf[nlen] = '\0';
        stack->tail->name           = NULL;
    }
    stack->tail->val      = val;
    stack->tail->hint     = hint;
    stack->tail->childCnt = 0;
    stack->tail++;
}

inline static Nv stack_peek(NStack stack) {
    if (stack->head < stack->tail) {
        return stack->tail - 1;
    }
    return NULL;
}

inline static Nv stack_pop(NStack stack) {
    if (stack->head < stack->tail) {
        stack->tail--;
        if (NULL != stack->tail->name) {
            xfree((char *)(stack->tail->name));
        }
        return stack->tail;
    }
    return NULL;
}

inline static const char *nv_name(Nv nv) {
    if (NULL == nv->name) {
        return nv->name_buf;
    }
    return nv->name;
}

inline static int nv_same_name(Nv nv, const char *name, bool smart) {
    if (smart) {
        if (NULL == nv->name) {
            return (0 == strcasecmp(name, nv->name_buf));
        }
        return (0 == strcasecmp(name, nv->name));
    }
    if (NULL == nv->name) {
        return (0 == strcmp(name, nv->name_buf));
    }
    return (0 == strcmp(name, nv->name));
}

#endif /* OX_SAX_STACK_H */