1 | // [License]
|
---|
2 | // The Ariba-Underlay Copyright
|
---|
3 | //
|
---|
4 | // Copyright (c) 2008-2009, Institute of Telematics, UniversitÀt Karlsruhe (TH)
|
---|
5 | //
|
---|
6 | // Institute of Telematics
|
---|
7 | // UniversitÀt Karlsruhe (TH)
|
---|
8 | // Zirkel 2, 76128 Karlsruhe
|
---|
9 | // Germany
|
---|
10 | //
|
---|
11 | // Redistribution and use in source and binary forms, with or without
|
---|
12 | // modification, are permitted provided that the following conditions are
|
---|
13 | // met:
|
---|
14 | //
|
---|
15 | // 1. Redistributions of source code must retain the above copyright
|
---|
16 | // notice, this list of conditions and the following disclaimer.
|
---|
17 | // 2. Redistributions in binary form must reproduce the above copyright
|
---|
18 | // notice, this list of conditions and the following disclaimer in the
|
---|
19 | // documentation and/or other materials provided with the distribution.
|
---|
20 | //
|
---|
21 | // THIS SOFTWARE IS PROVIDED BY THE INSTITUTE OF TELEMATICS ``AS IS'' AND
|
---|
22 | // ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
---|
23 | // IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
|
---|
24 | // PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE ARIBA PROJECT OR
|
---|
25 | // CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
|
---|
26 | // EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
|
---|
27 | // PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
|
---|
28 | // PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
|
---|
29 | // LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
|
---|
30 | // NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
|
---|
31 | // SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
---|
32 | //
|
---|
33 | // The views and conclusions contained in the software and documentation
|
---|
34 | // are those of the authors and should not be interpreted as representing
|
---|
35 | // official policies, either expressed or implied, of the Institute of
|
---|
36 | // Telematics.
|
---|
37 | // [License]
|
---|
38 |
|
---|
39 | #include "LinkID.h"
|
---|
40 |
|
---|
41 | #include <boost/unordered_map.hpp>
|
---|
42 |
|
---|
43 | namespace ariba {
|
---|
44 | namespace utility {
|
---|
45 |
|
---|
46 | /// the unspecified link id
|
---|
47 | const LinkID LinkID::UNSPECIFIED;
|
---|
48 |
|
---|
49 | const char* UNSPECIFIED_LINK = "<LINKID-UNSPECIFIED>";
|
---|
50 | const char* UNKNOWN_LINK = "<LINKID-UNKNOWN>";
|
---|
51 | const char* NULL_INFO = "<NO-INFO-AVAILABLE>";
|
---|
52 |
|
---|
53 | boost::unordered_map<uint16_t, const char*> link_ids;
|
---|
54 |
|
---|
55 | bool LinkID::isValid( const LinkID& id ) {
|
---|
56 | return link_ids.count(id.local_id)!=0;
|
---|
57 | }
|
---|
58 |
|
---|
59 | const char* LinkID::getInfo( const LinkID& id ) {
|
---|
60 | if (!id.valid())
|
---|
61 | return UNSPECIFIED_LINK;
|
---|
62 | if ( link_ids.count(id.local_id) == 0 )
|
---|
63 | return UNKNOWN_LINK;
|
---|
64 | const char* info = link_ids.find( id.local_id )->second;
|
---|
65 | if (info == NULL)
|
---|
66 | return NULL_INFO;
|
---|
67 | return info;
|
---|
68 | }
|
---|
69 |
|
---|
70 | /// create a new locally unique link id
|
---|
71 | LinkID LinkID::create( const char* info ) {
|
---|
72 | assert( link_ids.size() != 0xFFFE );
|
---|
73 | uint16_t id;
|
---|
74 | do {
|
---|
75 | id = rand() & 0xFFFF;
|
---|
76 | } while (id == 0 || link_ids.count(id) != 0);
|
---|
77 | link_ids.insert( std::make_pair(id, info) );
|
---|
78 | return LinkID(id);
|
---|
79 | }
|
---|
80 |
|
---|
81 | /// free a locally unique link id
|
---|
82 | void LinkID::destroy( const LinkID& id ) {
|
---|
83 | link_ids.erase(id.local_id);
|
---|
84 | }
|
---|
85 |
|
---|
86 | std::ostream& operator<<(std::ostream& s, const LinkID& id ) {
|
---|
87 | return s << id.toString();
|
---|
88 | }
|
---|
89 |
|
---|
90 | }} // spovnet, common
|
---|