| 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 | #ifndef DISCOVERY_H__
|
---|
| 40 | #define DISCOVERY_H__
|
---|
| 41 |
|
---|
| 42 | #include <vector>
|
---|
| 43 | #include "ariba/utility/messages.h"
|
---|
| 44 | #include "ariba/utility/serialization.h"
|
---|
| 45 | #include "ariba/utility/types/NodeID.h"
|
---|
| 46 | #include "ariba/communication/EndpointDescriptor.h"
|
---|
| 47 |
|
---|
| 48 | using std::pair;
|
---|
| 49 | using std::make_pair;
|
---|
| 50 | using std::vector;
|
---|
| 51 | using ariba::utility::Message;
|
---|
| 52 | using ariba::utility::NodeID;
|
---|
| 53 | using ariba::communication::EndpointDescriptor;
|
---|
| 54 |
|
---|
| 55 | namespace ariba {
|
---|
| 56 | namespace overlay {
|
---|
| 57 |
|
---|
| 58 | using_serialization;
|
---|
| 59 |
|
---|
| 60 | class Discovery : public Message {
|
---|
| 61 | VSERIALIZEABLE;
|
---|
| 62 | public:
|
---|
| 63 | enum follow_type_ {
|
---|
| 64 | normal = 0,
|
---|
| 65 | successor = 1,
|
---|
| 66 | predecessor = 2
|
---|
| 67 | };
|
---|
| 68 |
|
---|
| 69 | Discovery( const Discovery& msg ) {
|
---|
| 70 | this->follow_type = msg.follow_type;
|
---|
| 71 | this->ttl = msg.ttl;
|
---|
| 72 | this->source_endpoint = new EndpointDescriptor( *msg.source_endpoint );
|
---|
| 73 | }
|
---|
| 74 | explicit Discovery();
|
---|
| 75 | virtual ~Discovery();
|
---|
| 76 | /*
|
---|
| 77 | typedef pair<NodeID,EndpointDescriptor*> NodeEndpoint;
|
---|
| 78 | typedef vector<NodeEndpoint> NodeEndpointList;
|
---|
| 79 |
|
---|
| 80 | void add(const NodeID& node, EndpointDescriptor* endp);
|
---|
| 81 |
|
---|
| 82 | const NodeEndpointList& getList();
|
---|
| 83 | */
|
---|
| 84 |
|
---|
| 85 | EndpointDescriptor* getSourceEndpoint() const {
|
---|
| 86 | return source_endpoint;
|
---|
| 87 | }
|
---|
| 88 |
|
---|
| 89 | void setSourceEndpoint( const EndpointDescriptor* endpoint ) {
|
---|
| 90 | source_endpoint = const_cast<EndpointDescriptor*>(endpoint);
|
---|
| 91 | }
|
---|
| 92 |
|
---|
| 93 | inline uint8_t getTTL() const {
|
---|
| 94 | return ttl;
|
---|
| 95 | }
|
---|
| 96 |
|
---|
| 97 | inline void setTTL( uint8_t ttl ) {
|
---|
| 98 | this->ttl = ttl;
|
---|
| 99 | }
|
---|
| 100 |
|
---|
| 101 | inline follow_type_ getFollowType() const {
|
---|
| 102 | return (follow_type_)follow_type;
|
---|
| 103 | }
|
---|
| 104 |
|
---|
| 105 | inline void setFollowType( follow_type_ type ) {
|
---|
| 106 | follow_type = (uint8_t)type;
|
---|
| 107 | }
|
---|
| 108 |
|
---|
| 109 | private:
|
---|
| 110 | uint8_t follow_type;
|
---|
| 111 | uint8_t ttl;
|
---|
| 112 | EndpointDescriptor* source_endpoint;
|
---|
| 113 | // NodeEndpointList descriptors;
|
---|
| 114 | };
|
---|
| 115 |
|
---|
| 116 | }} // ariba::overlay
|
---|
| 117 |
|
---|
| 118 | sznBeginDefault( ariba::overlay::Discovery, X ) {
|
---|
| 119 |
|
---|
| 120 | /// serialize follow-type and time-to-live
|
---|
| 121 | X && follow_type && ttl;
|
---|
| 122 |
|
---|
| 123 | // serialize end-point
|
---|
| 124 | X && VO(source_endpoint);
|
---|
| 125 | /*
|
---|
| 126 | // serialize length of descriptor list
|
---|
| 127 | uint16_t len = descriptors.size();
|
---|
| 128 | X && len;
|
---|
| 129 | if (X.isDeserializer()) descriptors.resize(len);
|
---|
| 130 |
|
---|
| 131 | // serialize descriptors
|
---|
| 132 | for (int i=0; i<len; i++)
|
---|
| 133 | X && &descriptors[i].first && VO(descriptors[i].second);
|
---|
| 134 |
|
---|
| 135 | // serialize payload
|
---|
| 136 | X && Payload();
|
---|
| 137 | */
|
---|
| 138 | } sznEnd();
|
---|
| 139 |
|
---|
| 140 | #endif // DISCOVERY_H__
|
---|