Sha256: d42d885c72ee8891005b166cd613c25724a692e8309bdf1130fb0fe507bc3b8a
Contents?: true
Size: 1.88 KB
Versions: 40
Compression:
Stored size: 1.88 KB
Contents
/* attr.h
* Copyright (c) 2011, Peter Ohler
* All rights reserved.
*/
#ifndef __OX_ATTR_H__
#define __OX_ATTR_H__
#include "ox.h"
#define ATTR_STACK_INC 8
typedef struct _Attr {
const char *name;
const char *value;
} *Attr;
typedef struct _AttrStack {
struct _Attr base[ATTR_STACK_INC];
Attr head; /* current stack */
Attr end; /* stack end */
Attr tail; /* pointer to one past last element name on stack */
} *AttrStack;
inline static void
attr_stack_init(AttrStack stack) {
stack->head = stack->base;
stack->end = stack->base + sizeof(stack->base) / sizeof(struct _Attr);
stack->tail = stack->head;
stack->head->name = 0;
}
inline static int
attr_stack_empty(AttrStack stack) {
return (stack->head == stack->tail);
}
inline static void
attr_stack_cleanup(AttrStack stack) {
if (stack->base != stack->head) {
xfree(stack->head);
stack->head = stack->base;
}
}
inline static void
attr_stack_push(AttrStack stack, const char *name, const char *value) {
if (stack->end <= stack->tail + 1) {
size_t len = stack->end - stack->head;
size_t toff = stack->tail - stack->head;
if (stack->base == stack->head) {
stack->head = ALLOC_N(struct _Attr, len + ATTR_STACK_INC);
memcpy(stack->head, stack->base, sizeof(struct _Attr) * len);
} else {
REALLOC_N(stack->head, struct _Attr, len + ATTR_STACK_INC);
}
stack->tail = stack->head + toff;
stack->end = stack->head + len + ATTR_STACK_INC;
}
stack->tail->name = name;
stack->tail->value = value;
stack->tail++;
stack->tail->name = 0; // terminate
}
inline static Attr
attr_stack_peek(AttrStack stack) {
if (stack->head < stack->tail) {
return stack->tail - 1;
}
return 0;
}
inline static Attr
attr_stack_pop(AttrStack stack) {
if (stack->head < stack->tail) {
stack->tail--;
return stack->tail;
}
return 0;
}
#endif /* __OX_ATTR_H__ */
Version data entries
40 entries across 40 versions & 2 rubygems