| 1 | // [Licence] | 
|---|
| 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 | // [Licence] | 
|---|
| 38 |  | 
|---|
| 39 | #ifndef NODE_LISTING_REPLY_H__ | 
|---|
| 40 | #define NODE_LISTING_REPLY_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 NodeListingReply : public Message { | 
|---|
| 61 | VSERIALIZEABLE; | 
|---|
| 62 | public: | 
|---|
| 63 | NodeListingReply(); | 
|---|
| 64 | virtual ~NodeListingReply(); | 
|---|
| 65 |  | 
|---|
| 66 | typedef pair<NodeID,EndpointDescriptor*> NodeEndpoint; | 
|---|
| 67 | typedef vector<NodeEndpoint> NodeEndpointList; | 
|---|
| 68 |  | 
|---|
| 69 | void add(const NodeID& node, EndpointDescriptor* endp); | 
|---|
| 70 | const NodeEndpointList& getList(); | 
|---|
| 71 |  | 
|---|
| 72 | private: | 
|---|
| 73 | NodeEndpointList descriptors; | 
|---|
| 74 | }; | 
|---|
| 75 |  | 
|---|
| 76 | }} // ariba::overlay | 
|---|
| 77 |  | 
|---|
| 78 | sznBeginDefault( ariba::overlay::NodeListingReply, X ) { | 
|---|
| 79 | uint16_t len = X.isSerializer() ? descriptors.size() : 0; | 
|---|
| 80 | X && len; | 
|---|
| 81 | if (X.isDeserializer()) { | 
|---|
| 82 | descriptors.resize(len); | 
|---|
| 83 | } | 
|---|
| 84 | for (int i=0; i<len; i++) { | 
|---|
| 85 | if (X.isDeserializer()) descriptors[i].second = new EndpointDescriptor(); | 
|---|
| 86 | X && &descriptors[i].first && reinterpret_cast<VSerializeable*>(descriptors[i].second); | 
|---|
| 87 | } | 
|---|
| 88 | } sznEnd(); | 
|---|
| 89 |  | 
|---|
| 90 | #endif // NODE_LISTING_REPLY_H__ | 
|---|