aboutsummaryrefslogtreecommitdiff
path: root/src/libexpr/attr-set.cc
blob: 9ac5e603199ae5ff053d9c3159ef4a75a67f45b5 (plain)
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
#include "attr-set.hh"
#include "eval.hh"

#include <algorithm>


namespace nix {


static void * allocBytes(size_t n)
{
    void * p;
#if HAVE_BOEHMGC
    p = GC_malloc(n);
#else
    p = malloc(n);
#endif
    if (!p) throw std::bad_alloc();
    return p;
}


/* Allocate a new array of attributes for an attribute set with a specific
   capacity. The space is implicitly reserved after the Bindings
   structure. */
Bindings * EvalState::allocBindings(Bindings::size_t capacity)
{
    return new (allocBytes(sizeof(Bindings) + sizeof(Attr) * capacity)) Bindings(capacity);
}


void EvalState::mkAttrs(Value & v, unsigned int expected)
{
    clearValue(v);
    v.type = tAttrs;
    v.attrs = allocBindings(expected);
    nrAttrsets++;
    nrAttrsInAttrsets += expected;
}


/* Create a new attribute named 'name' on an existing attribute set stored
   in 'vAttrs' and return the newly allocated Value which is associated with
   this attribute. */
Value * EvalState::allocAttr(Value & vAttrs, const Symbol & name)
{
    Value * v = allocValue();
    vAttrs.attrs->push_back(Attr(name, v));
    return v;
}


void Bindings::sort()
{
    std::sort(begin(), end());
}


}