subnet.cc 22.3 KB
Newer Older
1
// Copyright (C) 2012-2017 Internet Systems Consortium, Inc. ("ISC")
2
//
3
4
5
// This Source Code Form is subject to the terms of the Mozilla Public
// License, v. 2.0. If a copy of the MPL was not distributed with this
// file, You can obtain one at http://mozilla.org/MPL/2.0/.
6

7
8
#include <config.h>

9
#include <asiolink/io_address.h>
10
#include <dhcp/option_space.h>
11
#include <dhcpsrv/addr_utilities.h>
12
#include <dhcpsrv/shared_network.h>
13
#include <dhcpsrv/subnet.h>
14
#include <algorithm>
15
#include <sstream>
16
17

using namespace isc::asiolink;
18
using namespace isc::data;
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
using namespace isc::dhcp;

namespace {

/// @brief Function used in calls to std::upper_bound to check
/// if the specified prefix is lower than the first address a pool.
///
/// @return true if prefix is lower than the first address in the pool.
bool
prefixLessThanFirstAddress(const IOAddress& prefix, const PoolPtr& pool) {
    return (prefix < pool->getFirstAddress());
}

/// @brief Function used in calls to std::sort to compare first
/// prefixes of the two pools.
///
/// @param pool1 First pool.
/// @param pool2 Second pool.
///
/// @return true if first prefix of the first pool is smaller than
/// the first address of the second pool.
bool
comparePoolFirstAddress(const PoolPtr& pool1, const PoolPtr& pool2) {
    return (pool1->getFirstAddress() < pool2->getFirstAddress());
};

}
46
47
48
49

namespace isc {
namespace dhcp {

50
51
52
// This is an initial value of subnet-id. See comments in subnet.h for details.
SubnetID Subnet::static_id_ = 1;

53
Subnet::Subnet(const isc::asiolink::IOAddress& prefix, uint8_t len,
54
               const SubnetID id)
55
    : id_(id == 0 ? generateNextID() : id), prefix_(prefix),
56
57
58
      prefix_len_(len),
      last_allocated_ia_(lastAddrInPrefix(prefix, len)),
      last_allocated_ta_(lastAddrInPrefix(prefix, len)),
59
      last_allocated_pd_(lastAddrInPrefix(prefix, len)) {
60
61
    if ((prefix.isV6() && len > 128) ||
        (prefix.isV4() && len > 32)) {
62
        isc_throw(BadValue,
63
                  "Invalid prefix length specified for subnet: " << len);
64
65
66
    }
}

67
bool
68
Subnet::inRange(const isc::asiolink::IOAddress& addr) const {
69
70
71
72
73
74
    IOAddress first = firstAddrInPrefix(prefix_, prefix_len_);
    IOAddress last = lastAddrInPrefix(prefix_, prefix_len_);

    return ((first <= addr) && (addr <= last));
}

75
isc::asiolink::IOAddress Subnet::getLastAllocated(Lease::Type type) const {
76
77
78
    // check if the type is valid (and throw if it isn't)
    checkType(type);

79
    switch (type) {
80
81
    case Lease::TYPE_V4:
    case Lease::TYPE_NA:
82
        return last_allocated_ia_;
83
    case Lease::TYPE_TA:
84
        return last_allocated_ta_;
85
    case Lease::TYPE_PD:
86
87
88
89
90
91
        return last_allocated_pd_;
    default:
        isc_throw(BadValue, "Pool type " << type << " not supported");
    }
}

92
void Subnet::setLastAllocated(Lease::Type type,
93
94
95
96
97
                              const isc::asiolink::IOAddress& addr) {

    // check if the type is valid (and throw if it isn't)
    checkType(type);

98
    switch (type) {
99
100
    case Lease::TYPE_V4:
    case Lease::TYPE_NA:
101
102
        last_allocated_ia_ = addr;
        return;
103
    case Lease::TYPE_TA:
104
105
        last_allocated_ta_ = addr;
        return;
106
    case Lease::TYPE_PD:
107
108
109
110
111
112
113
        last_allocated_pd_ = addr;
        return;
    default:
        isc_throw(BadValue, "Pool type " << type << " not supported");
    }
}

114
std::string
115
Subnet::toText() const {
116
    std::stringstream tmp;
117
    tmp << prefix_ << "/" << static_cast<unsigned int>(prefix_len_);
118
119
120
    return (tmp.str());
}

121
uint64_t
Tomek Mrugalski's avatar
Tomek Mrugalski committed
122
Subnet::getPoolCapacity(Lease::Type type) const {
123
124
125
    switch (type) {
    case Lease::TYPE_V4:
    case Lease::TYPE_NA:
Tomek Mrugalski's avatar
Tomek Mrugalski committed
126
        return sumPoolCapacity(pools_);
127
    case Lease::TYPE_TA:
Tomek Mrugalski's avatar
Tomek Mrugalski committed
128
        return sumPoolCapacity(pools_ta_);
129
    case Lease::TYPE_PD:
Tomek Mrugalski's avatar
Tomek Mrugalski committed
130
        return sumPoolCapacity(pools_pd_);
131
132
133
134
135
136
    default:
        isc_throw(BadValue, "Unsupported pool type: "
                  << static_cast<int>(type));
    }
}

137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
uint64_t
Subnet::getPoolCapacity(Lease::Type type,
                        const ClientClasses& client_classes) const {
    switch (type) {
    case Lease::TYPE_V4:
    case Lease::TYPE_NA:
        return sumPoolCapacity(pools_, client_classes);
    case Lease::TYPE_TA:
        return sumPoolCapacity(pools_ta_, client_classes);
    case Lease::TYPE_PD:
        return sumPoolCapacity(pools_pd_, client_classes);
    default:
        isc_throw(BadValue, "Unsupported pool type: "
                  << static_cast<int>(type));
    }
}

154
uint64_t
Tomek Mrugalski's avatar
Tomek Mrugalski committed
155
Subnet::sumPoolCapacity(const PoolCollection& pools) const {
156
157
    uint64_t sum = 0;
    for (PoolCollection::const_iterator p = pools.begin(); p != pools.end(); ++p) {
Tomek Mrugalski's avatar
Tomek Mrugalski committed
158
        uint64_t x = (*p)->getCapacity();
159
160
161
162
163
164
165
166
167
168
169
170
171

        // Check if we can add it. If sum + x > uint64::max, then we would have
        // overflown if we tried to add it.
        if (x > std::numeric_limits<uint64_t>::max() - sum) {
            return (std::numeric_limits<uint64_t>::max());
        }

        sum += x;
    }

    return (sum);
}

172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
uint64_t
Subnet::sumPoolCapacity(const PoolCollection& pools,
                        const ClientClasses& client_classes) const {
    uint64_t sum = 0;
    for (PoolCollection::const_iterator p = pools.begin(); p != pools.end(); ++p) {
        if (!(*p)->clientSupported(client_classes)) {
            continue;
        }
        uint64_t x = (*p)->getCapacity();

        // Check if we can add it. If sum + x > uint64::max, then we would have
        // overflown if we tried to add it.
        if (x > std::numeric_limits<uint64_t>::max() - sum) {
            return (std::numeric_limits<uint64_t>::max());
        }

        sum += x;
    }

    return (sum);
}

194
195
void Subnet4::checkType(Lease::Type type) const {
    if (type != Lease::TYPE_V4) {
196
197
198
199
        isc_throw(BadValue, "Only TYPE_V4 is allowed for Subnet4");
    }
}

200
201
202
Subnet4::Subnet4(const isc::asiolink::IOAddress& prefix, uint8_t length,
                 const Triplet<uint32_t>& t1,
                 const Triplet<uint32_t>& t2,
203
204
                 const Triplet<uint32_t>& valid_lifetime,
                 const SubnetID id)
205
206
    : Subnet(prefix, length, id), Network4(),
      siaddr_(IOAddress("0.0.0.0")) {
207
    if (!prefix.isV4()) {
208
209
210
        isc_throw(BadValue, "Non IPv4 prefix " << prefix.toText()
                  << " specified in subnet4");
    }
211
212
213
214
215
216
    // Relay info.
    setRelayInfo(IOAddress::IPV4_ZERO_ADDRESS());
    // Timers.
    setT1(t1);
    setT2(t2);
    setValid(valid_lifetime);
217
218
}

219
220
221
222
223
224
225
226
227
228
229
Subnet4Ptr
Subnet4::getNextSubnet(const Subnet4Ptr& first_subnet) const {
    SharedNetwork4Ptr network;
    getSharedNetwork(network);
    if (network) {
        return (network->getNextSubnet(first_subnet, getID()));
    }

    return (Subnet4Ptr());
}

230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
Subnet4Ptr
Subnet4::getNextSubnet(const Subnet4Ptr& first_subnet,
                       const ClientClasses& client_classes) const {
    SharedNetwork4Ptr network;
    getSharedNetwork(network);
    // We can only get next subnet if shared network has been defined for
    // the current subnet.
    if (network) {
        Subnet4Ptr subnet;
        do {
            // Use subnet identifier of this subnet if this is the first
            // time we're calling getNextSubnet. Otherwise, use the
            // subnet id of the previously returned subnet.
            SubnetID subnet_id = subnet ? subnet->getID() : getID();
            subnet = network->getNextSubnet(first_subnet, subnet_id);
            // If client classes match the subnet, return it. Otherwise,
            // try another subnet.
            if (subnet && subnet->clientSupported(client_classes)) {
                return (subnet);
            }
        } while (subnet);
    }

    // No subnet found.
    return (Subnet4Ptr());
}


258
259
260
261
262
263
264
265
266
267
268
bool
Subnet4::clientSupported(const isc::dhcp::ClientClasses& client_classes) const {
    NetworkPtr network;
    getSharedNetwork(network);
    if (network && !network->clientSupported(client_classes)) {
        return (false);
    }

    return (Network4::clientSupported(client_classes));
}

269
270
void Subnet4::setSiaddr(const isc::asiolink::IOAddress& siaddr) {
    if (!siaddr.isV4()) {
Tomek Mrugalski's avatar
Tomek Mrugalski committed
271
        isc_throw(BadValue, "Can't set siaddr to non-IPv4 address "
272
                  << siaddr);
273
274
275
276
277
278
279
280
    }
    siaddr_ = siaddr;
}

isc::asiolink::IOAddress Subnet4::getSiaddr() const {
    return (siaddr_);
}

281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
void Subnet4::setSname(const std::string& sname) {
    sname_ = sname;
}

const std::string& Subnet4::getSname() const {
    return (sname_);
}
void Subnet4::setFilename(const std::string& filename) {
    filename_ = filename;
}

const std::string& Subnet4::getFilename() const {
    return (filename_);
}

296
const PoolCollection& Subnet::getPools(Lease::Type type) const {
297
298
299
    // check if the type is valid (and throw if it isn't)
    checkType(type);

300
    switch (type) {
301
302
    case Lease::TYPE_V4:
    case Lease::TYPE_NA:
303
        return (pools_);
304
    case Lease::TYPE_TA:
305
        return (pools_ta_);
306
    case Lease::TYPE_PD:
307
308
        return (pools_pd_);
    default:
Tomek Mrugalski's avatar
Tomek Mrugalski committed
309
310
        isc_throw(BadValue, "Unsupported pool type: "
                  << static_cast<int>(type));
311
    }
312
}
313

Tomek Mrugalski's avatar
Tomek Mrugalski committed
314
PoolCollection& Subnet::getPoolsWritable(Lease::Type type) {
315
316
    // check if the type is valid (and throw if it isn't)
    checkType(type);
317

318
    switch (type) {
319
320
    case Lease::TYPE_V4:
    case Lease::TYPE_NA:
321
        return (pools_);
322
    case Lease::TYPE_TA:
323
        return (pools_ta_);
324
    case Lease::TYPE_PD:
325
        return (pools_pd_);
326
    default:
327
328
        isc_throw(BadValue, "Invalid pool type specified: "
                  << static_cast<int>(type));
329
    }
330
331
}

Tomek Mrugalski's avatar
Tomek Mrugalski committed
332
const PoolPtr Subnet::getPool(Lease::Type type, const isc::asiolink::IOAddress& hint,
333
                              bool anypool /* true */) const {
334
335
336
337
    // check if the type is valid (and throw if it isn't)
    checkType(type);

    const PoolCollection& pools = getPools(type);
338
339

    PoolPtr candidate;
340

341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
    if (!pools.empty()) {
        // Pools are sorted by their first prefixes. For example: 2001::,
        // 2001::db8::, 3000:: etc. If our hint is 2001:db8:5:: we want to
        // find the pool with the longest matching prefix, so: 2001:db8::,
        // rather than 2001::. upper_bound returns the first pool with a prefix
        // that is greater than 2001:db8:5::, i.e. 3000::. To find the longest
        // matching prefix we use decrement operator to go back by one item.
        // If returned iterator points to begin it means that prefixes in all
        // pools are greater than out prefix, and thus there is no match.
        PoolCollection::const_iterator ub =
            std::upper_bound(pools.begin(), pools.end(), hint,
                             prefixLessThanFirstAddress);

        if (ub != pools.begin()) {
            --ub;
            if ((*ub)->inRange(hint)) {
                candidate = *ub;
            }
359
360
        }

361
362
363
        // If we don't find anything better, then let's just use the first pool
        if (!candidate && anypool) {
            candidate = *pools.begin();
364
365
        }
    }
366
367

    // Return a pool or NULL if no match found.
368
369
370
    return (candidate);
}

371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
const PoolPtr Subnet::getPool(Lease::Type type,
                              const ClientClasses& client_classes,
                              const isc::asiolink::IOAddress& hint) const {
    // check if the type is valid (and throw if it isn't)
    checkType(type);

    const PoolCollection& pools = getPools(type);

    PoolPtr candidate;

    if (!pools.empty()) {
        PoolCollection::const_iterator ub =
            std::upper_bound(pools.begin(), pools.end(), hint,
                             prefixLessThanFirstAddress);

        if (ub != pools.begin()) {
            --ub;
            if ((*ub)->inRange(hint) && (*ub)->clientSupported(client_classes)) {
                candidate = *ub;
            }
        }
    }

    // Return a pool or NULL if no match found.
    return (candidate);
}

398
399
void
Subnet::addPool(const PoolPtr& pool) {
400
401
402
    // check if the type is valid (and throw if it isn't)
    checkType(pool->getType());

403
404
405
406
407
408
409
410
411
412
    // Check that the pool is in range with a subnet only if this is
    // not a pool of IPv6 prefixes. The IPv6 prefixes delegated for
    // the particular subnet don't need to match the prefix of the
    // subnet.
    if (pool->getType() != Lease::TYPE_PD) {
        if (!inRange(pool->getFirstAddress()) || !inRange(pool->getLastAddress())) {
            isc_throw(BadValue, "a pool of type "
                      << Lease::typeToText(pool->getType())
                      << ", with the following address range: "
                      << pool->getFirstAddress() << "-"
413
                      << pool->getLastAddress() << " does not match"
414
415
416
                      << " the prefix of a subnet: "
                      << prefix_ << "/" << static_cast<int>(prefix_len_)
                      << " to which it is being added");
417

418
        }
419
420
    }

421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
    bool overlaps = false;
    if (pool->getType() == Lease::TYPE_V4) {
        overlaps = poolOverlaps(Lease::TYPE_V4, pool);

    } else {
        overlaps =
            poolOverlaps(Lease::TYPE_NA, pool) ||
            poolOverlaps(Lease::TYPE_PD, pool) ||
            poolOverlaps(Lease::TYPE_TA, pool);
    }

    if (overlaps) {
        isc_throw(BadValue,"a pool of type "
                  << Lease::typeToText(pool->getType())
                  << ", with the following address range: "
                  << pool->getFirstAddress() << "-"
                  << pool->getLastAddress() << " overlaps with "
                  "an existing pool in the subnet: "
                  << prefix_ << "/" << static_cast<int>(prefix_len_)
                  << " to which it is being added");
    }

    PoolCollection& pools_writable = getPoolsWritable(pool->getType());
444

445
    // Add the pool to the appropriate pools collection
446
447
448
449
450
    pools_writable.push_back(pool);

    // Sort pools by first address.
    std::sort(pools_writable.begin(), pools_writable.end(),
              comparePoolFirstAddress);
451
452
}

453
454
void
Subnet::delPools(Lease::Type type) {
Tomek Mrugalski's avatar
Tomek Mrugalski committed
455
    getPoolsWritable(type).clear();
456
457
}

458
bool
459
Subnet::inPool(Lease::Type type, const isc::asiolink::IOAddress& addr) const {
460
461

    // Let's start with checking if it even belongs to that subnet.
Francis Dupont's avatar
Francis Dupont committed
462
    if ((type != Lease::TYPE_PD) && !inRange(addr)) {
463
464
465
        return (false);
    }

466
467
468
469
    const PoolCollection& pools = getPools(type);

    for (PoolCollection::const_iterator pool = pools.begin();
         pool != pools.end(); ++pool) {
470
471
472
473
        if ((*pool)->inRange(addr)) {
            return (true);
        }
    }
474
    // There's no pool that address belongs to
475
476
477
    return (false);
}

478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
bool
Subnet::inPool(Lease::Type type,
               const isc::asiolink::IOAddress& addr,
               const ClientClasses& client_classes) const {

    // Let's start with checking if it even belongs to that subnet.
    if ((type != Lease::TYPE_PD) && !inRange(addr)) {
        return (false);
    }

    const PoolCollection& pools = getPools(type);

    for (PoolCollection::const_iterator pool = pools.begin();
         pool != pools.end(); ++pool) {
        if (!(*pool)->clientSupported(client_classes)) {
            continue;
        }
        if ((*pool)->inRange(addr)) {
            return (true);
        }
    }
    // There's no pool that address belongs to
    return (false);
}

503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
bool
Subnet::poolOverlaps(const Lease::Type& pool_type, const PoolPtr& pool) const {
    const PoolCollection& pools = getPools(pool_type);

    // If no pools, we don't overlap. Nothing to do.
    if (pools.empty()) {
        return (false);
    }

    // We're going to insert a new pool, likely between two existing pools.
    // So we're going to end up with the following case:
    // |<---- pool1 ---->|    |<-------- pool2 ------>|  |<-- pool3 -->|
    // F1               L1    F2                     L2  F3           L3
    // where pool1 and pool3 are existing pools, pool2 is a pool being
    // inserted and "F"/"L" mark first and last address in the pools
    // respectively. So the following conditions must be fulfilled:
    // F2 > L1 and L2 < F3. Obviously, for any pool: F < L.

    // Search for pool3. We use F2 and upper_bound to find the F3 (upper_bound
    // returns first pool in the sorted container which first address is
    // greater than F2). prefixLessThanPoolAddress with the first argument
    // set to "true" is the custom comparison function for upper_bound, which
    // compares F2 with the first addresses of the existing pools.
    PoolCollection::const_iterator pool3_it =
        std::upper_bound(pools.begin(), pools.end(), pool->getFirstAddress(),
                         prefixLessThanFirstAddress);

    // upper_bound returns a first pool which first address is greater than the
    // address F2. However, it is also possible that there is a pool which first
    // address is equal to F2. Such pool is also in conflict with a new pool.
    // If the returned value is pools.begin() it means that all pools have greater
    // first address than F2, thus none of the pools can have first address equal
    // to F2. Otherwise, we'd need to check them for equality.
    if (pool3_it != pools.begin()) {
        // Go back one pool and check if addresses are equal.
        PoolPtr pool3 = *(pool3_it - 1);
        if (pool3->getFirstAddress() == pool->getFirstAddress()) {
            return (true);
        }
    }

    // If returned value is unequal pools.end() it means that there is a pool3,
    // with F3 > F2.
    if (pool3_it != pools.end()) {
        // Let's store the pointer to this pool.
        PoolPtr pool3 = *pool3_it;
        // F3 must be greater than L2, otherwise pools will overlap.
        if (pool3->getFirstAddress() <= pool->getLastAddress()) {
            return (true);
        }
    }

    // If L2 is ok, we now have to find the pool1. This pool should be
    // right before the pool3 if there is any pool before pool3.
    if (pool3_it != pools.begin()) {
        PoolPtr pool1 = *(pool3_it - 1);
        // F2 must be greater than L1.
        if (pool->getFirstAddress() <= pool1->getLastAddress()) {
            return (true);
        }
    }

    return (false);
}


569
570
571
572
Subnet6::Subnet6(const isc::asiolink::IOAddress& prefix, uint8_t length,
                 const Triplet<uint32_t>& t1,
                 const Triplet<uint32_t>& t2,
                 const Triplet<uint32_t>& preferred_lifetime,
573
574
                 const Triplet<uint32_t>& valid_lifetime,
                 const SubnetID id)
575
    : Subnet(prefix, length, id), Network6() {
576
    if (!prefix.isV6()) {
577
        isc_throw(BadValue, "Non IPv6 prefix " << prefix
578
579
                  << " specified in subnet6");
    }
580
581
582
583
584
585

    // Relay info.
    setRelayInfo(RelayInfo(IOAddress::IPV6_ZERO_ADDRESS()));
    // Timers.
    setT1(t1);
    setT2(t2);
586
    setPreferred(preferred_lifetime);
587
    setValid(valid_lifetime);
588
589
}

590
591
592
593
594
595
void Subnet6::checkType(Lease::Type type) const {
    if ( (type != Lease::TYPE_NA) && (type != Lease::TYPE_TA) &&
         (type != Lease::TYPE_PD)) {
        isc_throw(BadValue, "Invalid Pool type: " << Lease::typeToText(type)
                  << "(" << static_cast<int>(type)
                  << "), must be TYPE_NA, TYPE_TA or TYPE_PD for Subnet6");
596
597
598
    }
}

599
600
601
602
603
604
605
606
607
608
609
Subnet6Ptr
Subnet6::getNextSubnet(const Subnet6Ptr& first_subnet) const {
    SharedNetwork6Ptr network;
    getSharedNetwork(network);
    if (network) {
        return (network->getNextSubnet(first_subnet, getID()));
    }

    return (Subnet6Ptr());
}

610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
Subnet6Ptr
Subnet6::getNextSubnet(const Subnet6Ptr& first_subnet,
                       const ClientClasses& client_classes) const {
    SharedNetwork6Ptr network;
    getSharedNetwork(network);
    // We can only get next subnet if shared network has been defined for
    // the current subnet.
    if (network) {
        Subnet6Ptr subnet;
        do {
            // Use subnet identifier of this subnet if this is the first
            // time we're calling getNextSubnet. Otherwise, use the
            // subnet id of the previously returned subnet.
            SubnetID subnet_id = subnet ? subnet->getID() : getID();
            subnet = network->getNextSubnet(first_subnet, subnet_id);
            // If client classes match the subnet, return it. Otherwise,
            // try another subnet.
            if (subnet && subnet->clientSupported(client_classes)) {
                return (subnet);
            }
        } while (subnet);
    }

    // No subnet found.
    return (Subnet6Ptr());
}

637
638
639
640
641
642
643
644
645
646
647
bool
Subnet6::clientSupported(const isc::dhcp::ClientClasses& client_classes) const {
    NetworkPtr network;
    getSharedNetwork(network);
    if (network && !network->clientSupported(client_classes)) {
        return (false);
    }

    return (Network6::clientSupported(client_classes));
}

648
data::ElementPtr
649
Subnet::toElement() const {
650
    ElementPtr map = Element::createMap();
651

652
653
654
    // Add user-context
    contextToElement(map);

655
656
657
    // Set subnet id
    SubnetID id = getID();
    map->set("id", Element::create(static_cast<long long>(id)));
658

659
660
    // Set subnet
    map->set("subnet", Element::create(toText()));
661
662
663
664
665
666
667
668

    return (map);
}

data::ElementPtr
Subnet4::toElement() const {
    // Prepare the map
    ElementPtr map = Subnet::toElement();
669
    ElementPtr network_map = Network4::toElement();
670

671
    merge(map, network_map);
672
673
674
675
676
677
678
679

    // Set DHCP4o6
    const Cfg4o6& d4o6 = get4o6();
    isc::data::merge(map, d4o6.toElement());

    // Set next-server
    map->set("next-server", Element::create(getSiaddr().toText()));

680
681
682
683
684
685
    // Set server-hostname
    map->set("server-hostname", Element::create(getSname()));

    // Set boot-file-name
    map->set("boot-file-name",Element::create(getFilename()));

686
687
688
689
690
    // Set pools
    const PoolCollection& pools = getPools(Lease::TYPE_V4);
    ElementPtr pool_list = Element::createList();
    for (PoolCollection::const_iterator pool = pools.cbegin();
         pool != pools.cend(); ++pool) {
691
692
        // Add the elementized pool to the list
        pool_list->add((*pool)->toElement());
693
694
695
696
697
698
699
700
701
    }
    map->set("pools", pool_list);

    return (map);
}

data::ElementPtr
Subnet6::toElement() const {
    // Prepare the map
702
    ElementPtr map = Subnet::toElement();
703
    ElementPtr network_map = Network6::toElement();
704

705
    merge(map, network_map);
706

707
708
709
    // Set pools
    const PoolCollection& pools = getPools(Lease::TYPE_NA);
    ElementPtr pool_list = Element::createList();
710
711
    for (auto pool : pools) {
        pool_list->add(pool->toElement());
712
713
    }
    map->set("pools", pool_list);
714

715
716
717
    // Set pd-pools
    const PoolCollection& pdpools = getPools(Lease::TYPE_PD);
    ElementPtr pdpool_list = Element::createList();
718
719
    for (auto pool : pdpools) {
        pdpool_list->add(pool->toElement());
720
    }
721

722
723
724
725
726
727
    map->set("pd-pools", pdpool_list);

    return (map);
}


728
729
} // end of isc::dhcp namespace
} // end of isc namespace