Capability.hpp 17 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496
  1. /*
  2. * ZeroTier One - Network Virtualization Everywhere
  3. * Copyright (C) 2011-2019 ZeroTier, Inc. https://www.zerotier.com/
  4. *
  5. * This program is free software: you can redistribute it and/or modify
  6. * it under the terms of the GNU General Public License as published by
  7. * the Free Software Foundation, either version 3 of the License, or
  8. * (at your option) any later version.
  9. *
  10. * This program is distributed in the hope that it will be useful,
  11. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  12. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  13. * GNU General Public License for more details.
  14. *
  15. * You should have received a copy of the GNU General Public License
  16. * along with this program. If not, see <http://www.gnu.org/licenses/>.
  17. *
  18. * --
  19. *
  20. * You can be released from the requirements of the license by purchasing
  21. * a commercial license. Buying such a license is mandatory as soon as you
  22. * develop commercial closed-source software that incorporates or links
  23. * directly against ZeroTier software without disclosing the source code
  24. * of your own application.
  25. */
  26. #ifndef ZT_CAPABILITY_HPP
  27. #define ZT_CAPABILITY_HPP
  28. #include <stdio.h>
  29. #include <stdlib.h>
  30. #include <string.h>
  31. #include "Constants.hpp"
  32. #include "Credential.hpp"
  33. #include "Address.hpp"
  34. #include "C25519.hpp"
  35. #include "Utils.hpp"
  36. #include "Buffer.hpp"
  37. #include "Identity.hpp"
  38. #include "../include/ZeroTierOne.h"
  39. namespace ZeroTier {
  40. class RuntimeEnvironment;
  41. /**
  42. * A set of grouped and signed network flow rules
  43. *
  44. * On the sending side the sender does the following for each packet:
  45. *
  46. * (1) Evaluates its capabilities in ascending order of ID to determine
  47. * which capability allows it to transmit this packet.
  48. * (2) If it has not done so lately, it then sends this capability to the
  49. * receiving peer ("presents" it).
  50. * (3) The sender then sends the packet.
  51. *
  52. * On the receiving side the receiver evaluates the capabilities presented
  53. * by the sender. If any valid un-expired capability allows this packet it
  54. * is accepted.
  55. *
  56. * Note that this is after evaluation of network scope rules and only if
  57. * network scope rules do not deliver an explicit match.
  58. *
  59. * Capabilities support a chain of custody. This is currently unused but
  60. * in the future would allow the publication of capabilities that can be
  61. * handed off between nodes. Limited transferability of capabilities is
  62. * a feature of true capability based security.
  63. */
  64. class Capability : public Credential
  65. {
  66. public:
  67. static inline Credential::Type credentialType() { return Credential::CREDENTIAL_TYPE_CAPABILITY; }
  68. Capability() :
  69. _nwid(0),
  70. _ts(0),
  71. _id(0),
  72. _maxCustodyChainLength(0),
  73. _ruleCount(0)
  74. {
  75. }
  76. /**
  77. * @param id Capability ID
  78. * @param nwid Network ID
  79. * @param ts Timestamp (at controller)
  80. * @param mccl Maximum custody chain length (1 to create non-transferable capability)
  81. * @param rules Network flow rules for this capability
  82. * @param ruleCount Number of flow rules
  83. */
  84. Capability(uint32_t id,uint64_t nwid,int64_t ts,unsigned int mccl,const ZT_VirtualNetworkRule *rules,unsigned int ruleCount) :
  85. _nwid(nwid),
  86. _ts(ts),
  87. _id(id),
  88. _maxCustodyChainLength((mccl > 0) ? ((mccl < ZT_MAX_CAPABILITY_CUSTODY_CHAIN_LENGTH) ? mccl : (unsigned int)ZT_MAX_CAPABILITY_CUSTODY_CHAIN_LENGTH) : 1),
  89. _ruleCount((ruleCount < ZT_MAX_CAPABILITY_RULES) ? ruleCount : ZT_MAX_CAPABILITY_RULES)
  90. {
  91. if (_ruleCount > 0)
  92. memcpy(_rules,rules,sizeof(ZT_VirtualNetworkRule) * _ruleCount);
  93. }
  94. /**
  95. * @return Rules -- see ruleCount() for size of array
  96. */
  97. inline const ZT_VirtualNetworkRule *rules() const { return _rules; }
  98. /**
  99. * @return Number of rules in rules()
  100. */
  101. inline unsigned int ruleCount() const { return _ruleCount; }
  102. /**
  103. * @return ID and evaluation order of this capability in network
  104. */
  105. inline uint32_t id() const { return _id; }
  106. /**
  107. * @return Network ID for which this capability was issued
  108. */
  109. inline uint64_t networkId() const { return _nwid; }
  110. /**
  111. * @return Timestamp
  112. */
  113. inline int64_t timestamp() const { return _ts; }
  114. /**
  115. * @return Last 'to' address in chain of custody
  116. */
  117. inline Address issuedTo() const
  118. {
  119. Address i2;
  120. for(unsigned int i=0;i<ZT_MAX_CAPABILITY_CUSTODY_CHAIN_LENGTH;++i) {
  121. if (!_custody[i].to)
  122. return i2;
  123. else i2 = _custody[i].to;
  124. }
  125. return i2;
  126. }
  127. /**
  128. * Sign this capability and add signature to its chain of custody
  129. *
  130. * If this returns false, this object should be considered to be
  131. * in an undefined state and should be discarded. False can be returned
  132. * if there is no more room for signatures (max chain length reached)
  133. * or if the 'from' identity does not include a secret key to allow
  134. * it to sign anything.
  135. *
  136. * @param from Signing identity (must have secret)
  137. * @param to Recipient of this signature
  138. * @return True if signature successful and chain of custody appended
  139. */
  140. inline bool sign(const Identity &from,const Address &to)
  141. {
  142. try {
  143. for(unsigned int i=0;((i<_maxCustodyChainLength)&&(i<ZT_MAX_CAPABILITY_CUSTODY_CHAIN_LENGTH));++i) {
  144. if (!(_custody[i].to)) {
  145. Buffer<(sizeof(Capability) * 2)> tmp;
  146. this->serialize(tmp,true);
  147. _custody[i].to = to;
  148. _custody[i].from = from.address();
  149. _custody[i].signature = from.sign(tmp.data(),tmp.size());
  150. return true;
  151. }
  152. }
  153. } catch ( ... ) {}
  154. return false;
  155. }
  156. /**
  157. * Verify this capability's chain of custody and signatures
  158. *
  159. * @param RR Runtime environment to provide for peer lookup, etc.
  160. * @return 0 == OK, 1 == waiting for WHOIS, -1 == BAD signature or chain
  161. */
  162. int verify(const RuntimeEnvironment *RR,void *tPtr) const;
  163. template<unsigned int C>
  164. static inline void serializeRules(Buffer<C> &b,const ZT_VirtualNetworkRule *rules,unsigned int ruleCount)
  165. {
  166. for(unsigned int i=0;i<ruleCount;++i) {
  167. // Each rule consists of its 8-bit type followed by the size of that type's
  168. // field followed by field data. The inclusion of the size will allow non-supported
  169. // rules to be ignored but still parsed.
  170. b.append((uint8_t)rules[i].t);
  171. switch((ZT_VirtualNetworkRuleType)(rules[i].t & 0x3f)) {
  172. default:
  173. b.append((uint8_t)0);
  174. break;
  175. case ZT_NETWORK_RULE_ACTION_TEE:
  176. case ZT_NETWORK_RULE_ACTION_WATCH:
  177. case ZT_NETWORK_RULE_ACTION_REDIRECT:
  178. b.append((uint8_t)14);
  179. b.append((uint64_t)rules[i].v.fwd.address);
  180. b.append((uint32_t)rules[i].v.fwd.flags);
  181. b.append((uint16_t)rules[i].v.fwd.length); // unused for redirect
  182. break;
  183. case ZT_NETWORK_RULE_MATCH_SOURCE_ZEROTIER_ADDRESS:
  184. case ZT_NETWORK_RULE_MATCH_DEST_ZEROTIER_ADDRESS:
  185. b.append((uint8_t)5);
  186. Address(rules[i].v.zt).appendTo(b);
  187. break;
  188. case ZT_NETWORK_RULE_MATCH_VLAN_ID:
  189. b.append((uint8_t)2);
  190. b.append((uint16_t)rules[i].v.vlanId);
  191. break;
  192. case ZT_NETWORK_RULE_MATCH_VLAN_PCP:
  193. b.append((uint8_t)1);
  194. b.append((uint8_t)rules[i].v.vlanPcp);
  195. break;
  196. case ZT_NETWORK_RULE_MATCH_VLAN_DEI:
  197. b.append((uint8_t)1);
  198. b.append((uint8_t)rules[i].v.vlanDei);
  199. break;
  200. case ZT_NETWORK_RULE_MATCH_MAC_SOURCE:
  201. case ZT_NETWORK_RULE_MATCH_MAC_DEST:
  202. b.append((uint8_t)6);
  203. b.append(rules[i].v.mac,6);
  204. break;
  205. case ZT_NETWORK_RULE_MATCH_IPV4_SOURCE:
  206. case ZT_NETWORK_RULE_MATCH_IPV4_DEST:
  207. b.append((uint8_t)5);
  208. b.append(&(rules[i].v.ipv4.ip),4);
  209. b.append((uint8_t)rules[i].v.ipv4.mask);
  210. break;
  211. case ZT_NETWORK_RULE_MATCH_IPV6_SOURCE:
  212. case ZT_NETWORK_RULE_MATCH_IPV6_DEST:
  213. b.append((uint8_t)17);
  214. b.append(rules[i].v.ipv6.ip,16);
  215. b.append((uint8_t)rules[i].v.ipv6.mask);
  216. break;
  217. case ZT_NETWORK_RULE_MATCH_IP_TOS:
  218. b.append((uint8_t)3);
  219. b.append((uint8_t)rules[i].v.ipTos.mask);
  220. b.append((uint8_t)rules[i].v.ipTos.value[0]);
  221. b.append((uint8_t)rules[i].v.ipTos.value[1]);
  222. break;
  223. case ZT_NETWORK_RULE_MATCH_IP_PROTOCOL:
  224. b.append((uint8_t)1);
  225. b.append((uint8_t)rules[i].v.ipProtocol);
  226. break;
  227. case ZT_NETWORK_RULE_MATCH_ETHERTYPE:
  228. b.append((uint8_t)2);
  229. b.append((uint16_t)rules[i].v.etherType);
  230. break;
  231. case ZT_NETWORK_RULE_MATCH_ICMP:
  232. b.append((uint8_t)3);
  233. b.append((uint8_t)rules[i].v.icmp.type);
  234. b.append((uint8_t)rules[i].v.icmp.code);
  235. b.append((uint8_t)rules[i].v.icmp.flags);
  236. break;
  237. case ZT_NETWORK_RULE_MATCH_IP_SOURCE_PORT_RANGE:
  238. case ZT_NETWORK_RULE_MATCH_IP_DEST_PORT_RANGE:
  239. b.append((uint8_t)4);
  240. b.append((uint16_t)rules[i].v.port[0]);
  241. b.append((uint16_t)rules[i].v.port[1]);
  242. break;
  243. case ZT_NETWORK_RULE_MATCH_CHARACTERISTICS:
  244. b.append((uint8_t)8);
  245. b.append((uint64_t)rules[i].v.characteristics);
  246. break;
  247. case ZT_NETWORK_RULE_MATCH_FRAME_SIZE_RANGE:
  248. b.append((uint8_t)4);
  249. b.append((uint16_t)rules[i].v.frameSize[0]);
  250. b.append((uint16_t)rules[i].v.frameSize[1]);
  251. break;
  252. case ZT_NETWORK_RULE_MATCH_RANDOM:
  253. b.append((uint8_t)4);
  254. b.append((uint32_t)rules[i].v.randomProbability);
  255. break;
  256. case ZT_NETWORK_RULE_MATCH_TAGS_DIFFERENCE:
  257. case ZT_NETWORK_RULE_MATCH_TAGS_BITWISE_AND:
  258. case ZT_NETWORK_RULE_MATCH_TAGS_BITWISE_OR:
  259. case ZT_NETWORK_RULE_MATCH_TAGS_BITWISE_XOR:
  260. case ZT_NETWORK_RULE_MATCH_TAGS_EQUAL:
  261. case ZT_NETWORK_RULE_MATCH_TAG_SENDER:
  262. case ZT_NETWORK_RULE_MATCH_TAG_RECEIVER:
  263. b.append((uint8_t)8);
  264. b.append((uint32_t)rules[i].v.tag.id);
  265. b.append((uint32_t)rules[i].v.tag.value);
  266. break;
  267. case ZT_NETWORK_RULE_MATCH_INTEGER_RANGE:
  268. b.append((uint8_t)19);
  269. b.append((uint64_t)rules[i].v.intRange.start);
  270. b.append((uint64_t)(rules[i].v.intRange.start + (uint64_t)rules[i].v.intRange.end)); // more future-proof
  271. b.append((uint16_t)rules[i].v.intRange.idx);
  272. b.append((uint8_t)rules[i].v.intRange.format);
  273. break;
  274. }
  275. }
  276. }
  277. template<unsigned int C>
  278. static inline void deserializeRules(const Buffer<C> &b,unsigned int &p,ZT_VirtualNetworkRule *rules,unsigned int &ruleCount,const unsigned int maxRuleCount)
  279. {
  280. while ((ruleCount < maxRuleCount)&&(p < b.size())) {
  281. rules[ruleCount].t = (uint8_t)b[p++];
  282. const unsigned int fieldLen = (unsigned int)b[p++];
  283. switch((ZT_VirtualNetworkRuleType)(rules[ruleCount].t & 0x3f)) {
  284. default:
  285. break;
  286. case ZT_NETWORK_RULE_ACTION_TEE:
  287. case ZT_NETWORK_RULE_ACTION_WATCH:
  288. case ZT_NETWORK_RULE_ACTION_REDIRECT:
  289. rules[ruleCount].v.fwd.address = b.template at<uint64_t>(p);
  290. rules[ruleCount].v.fwd.flags = b.template at<uint32_t>(p + 8);
  291. rules[ruleCount].v.fwd.length = b.template at<uint16_t>(p + 12);
  292. break;
  293. case ZT_NETWORK_RULE_MATCH_SOURCE_ZEROTIER_ADDRESS:
  294. case ZT_NETWORK_RULE_MATCH_DEST_ZEROTIER_ADDRESS:
  295. rules[ruleCount].v.zt = Address(b.field(p,ZT_ADDRESS_LENGTH),ZT_ADDRESS_LENGTH).toInt();
  296. break;
  297. case ZT_NETWORK_RULE_MATCH_VLAN_ID:
  298. rules[ruleCount].v.vlanId = b.template at<uint16_t>(p);
  299. break;
  300. case ZT_NETWORK_RULE_MATCH_VLAN_PCP:
  301. rules[ruleCount].v.vlanPcp = (uint8_t)b[p];
  302. break;
  303. case ZT_NETWORK_RULE_MATCH_VLAN_DEI:
  304. rules[ruleCount].v.vlanDei = (uint8_t)b[p];
  305. break;
  306. case ZT_NETWORK_RULE_MATCH_MAC_SOURCE:
  307. case ZT_NETWORK_RULE_MATCH_MAC_DEST:
  308. memcpy(rules[ruleCount].v.mac,b.field(p,6),6);
  309. break;
  310. case ZT_NETWORK_RULE_MATCH_IPV4_SOURCE:
  311. case ZT_NETWORK_RULE_MATCH_IPV4_DEST:
  312. memcpy(&(rules[ruleCount].v.ipv4.ip),b.field(p,4),4);
  313. rules[ruleCount].v.ipv4.mask = (uint8_t)b[p + 4];
  314. break;
  315. case ZT_NETWORK_RULE_MATCH_IPV6_SOURCE:
  316. case ZT_NETWORK_RULE_MATCH_IPV6_DEST:
  317. memcpy(rules[ruleCount].v.ipv6.ip,b.field(p,16),16);
  318. rules[ruleCount].v.ipv6.mask = (uint8_t)b[p + 16];
  319. break;
  320. case ZT_NETWORK_RULE_MATCH_IP_TOS:
  321. rules[ruleCount].v.ipTos.mask = (uint8_t)b[p];
  322. rules[ruleCount].v.ipTos.value[0] = (uint8_t)b[p+1];
  323. rules[ruleCount].v.ipTos.value[1] = (uint8_t)b[p+2];
  324. break;
  325. case ZT_NETWORK_RULE_MATCH_IP_PROTOCOL:
  326. rules[ruleCount].v.ipProtocol = (uint8_t)b[p];
  327. break;
  328. case ZT_NETWORK_RULE_MATCH_ETHERTYPE:
  329. rules[ruleCount].v.etherType = b.template at<uint16_t>(p);
  330. break;
  331. case ZT_NETWORK_RULE_MATCH_ICMP:
  332. rules[ruleCount].v.icmp.type = (uint8_t)b[p];
  333. rules[ruleCount].v.icmp.code = (uint8_t)b[p+1];
  334. rules[ruleCount].v.icmp.flags = (uint8_t)b[p+2];
  335. break;
  336. case ZT_NETWORK_RULE_MATCH_IP_SOURCE_PORT_RANGE:
  337. case ZT_NETWORK_RULE_MATCH_IP_DEST_PORT_RANGE:
  338. rules[ruleCount].v.port[0] = b.template at<uint16_t>(p);
  339. rules[ruleCount].v.port[1] = b.template at<uint16_t>(p + 2);
  340. break;
  341. case ZT_NETWORK_RULE_MATCH_CHARACTERISTICS:
  342. rules[ruleCount].v.characteristics = b.template at<uint64_t>(p);
  343. break;
  344. case ZT_NETWORK_RULE_MATCH_FRAME_SIZE_RANGE:
  345. rules[ruleCount].v.frameSize[0] = b.template at<uint16_t>(p);
  346. rules[ruleCount].v.frameSize[1] = b.template at<uint16_t>(p + 2);
  347. break;
  348. case ZT_NETWORK_RULE_MATCH_RANDOM:
  349. rules[ruleCount].v.randomProbability = b.template at<uint32_t>(p);
  350. break;
  351. case ZT_NETWORK_RULE_MATCH_TAGS_DIFFERENCE:
  352. case ZT_NETWORK_RULE_MATCH_TAGS_BITWISE_AND:
  353. case ZT_NETWORK_RULE_MATCH_TAGS_BITWISE_OR:
  354. case ZT_NETWORK_RULE_MATCH_TAGS_BITWISE_XOR:
  355. case ZT_NETWORK_RULE_MATCH_TAGS_EQUAL:
  356. case ZT_NETWORK_RULE_MATCH_TAG_SENDER:
  357. case ZT_NETWORK_RULE_MATCH_TAG_RECEIVER:
  358. rules[ruleCount].v.tag.id = b.template at<uint32_t>(p);
  359. rules[ruleCount].v.tag.value = b.template at<uint32_t>(p + 4);
  360. break;
  361. case ZT_NETWORK_RULE_MATCH_INTEGER_RANGE:
  362. rules[ruleCount].v.intRange.start = b.template at<uint64_t>(p);
  363. rules[ruleCount].v.intRange.end = (uint32_t)(b.template at<uint64_t>(p + 8) - rules[ruleCount].v.intRange.start);
  364. rules[ruleCount].v.intRange.idx = b.template at<uint16_t>(p + 16);
  365. rules[ruleCount].v.intRange.format = (uint8_t)b[p + 18];
  366. break;
  367. }
  368. p += fieldLen;
  369. ++ruleCount;
  370. }
  371. }
  372. template<unsigned int C>
  373. inline void serialize(Buffer<C> &b,const bool forSign = false) const
  374. {
  375. if (forSign) b.append((uint64_t)0x7f7f7f7f7f7f7f7fULL);
  376. // These are the same between Tag and Capability
  377. b.append(_nwid);
  378. b.append(_ts);
  379. b.append(_id);
  380. b.append((uint16_t)_ruleCount);
  381. serializeRules(b,_rules,_ruleCount);
  382. b.append((uint8_t)_maxCustodyChainLength);
  383. if (!forSign) {
  384. for(unsigned int i=0;;++i) {
  385. if ((i < _maxCustodyChainLength)&&(i < ZT_MAX_CAPABILITY_CUSTODY_CHAIN_LENGTH)&&(_custody[i].to)) {
  386. _custody[i].to.appendTo(b);
  387. _custody[i].from.appendTo(b);
  388. b.append((uint8_t)1); // 1 == Ed25519 signature
  389. b.append((uint16_t)ZT_C25519_SIGNATURE_LEN); // length of signature
  390. b.append(_custody[i].signature.data,ZT_C25519_SIGNATURE_LEN);
  391. } else {
  392. b.append((unsigned char)0,ZT_ADDRESS_LENGTH); // zero 'to' terminates chain
  393. break;
  394. }
  395. }
  396. }
  397. // This is the size of any additional fields, currently 0.
  398. b.append((uint16_t)0);
  399. if (forSign) b.append((uint64_t)0x7f7f7f7f7f7f7f7fULL);
  400. }
  401. template<unsigned int C>
  402. inline unsigned int deserialize(const Buffer<C> &b,unsigned int startAt = 0)
  403. {
  404. memset(this,0,sizeof(Capability));
  405. unsigned int p = startAt;
  406. _nwid = b.template at<uint64_t>(p); p += 8;
  407. _ts = b.template at<uint64_t>(p); p += 8;
  408. _id = b.template at<uint32_t>(p); p += 4;
  409. const unsigned int rc = b.template at<uint16_t>(p); p += 2;
  410. if (rc > ZT_MAX_CAPABILITY_RULES)
  411. throw ZT_EXCEPTION_INVALID_SERIALIZED_DATA_OVERFLOW;
  412. deserializeRules(b,p,_rules,_ruleCount,rc);
  413. _maxCustodyChainLength = (unsigned int)b[p++];
  414. if ((_maxCustodyChainLength < 1)||(_maxCustodyChainLength > ZT_MAX_CAPABILITY_CUSTODY_CHAIN_LENGTH))
  415. throw ZT_EXCEPTION_INVALID_SERIALIZED_DATA_OVERFLOW;
  416. for(unsigned int i=0;;++i) {
  417. const Address to(b.field(p,ZT_ADDRESS_LENGTH),ZT_ADDRESS_LENGTH); p += ZT_ADDRESS_LENGTH;
  418. if (!to)
  419. break;
  420. if ((i >= _maxCustodyChainLength)||(i >= ZT_MAX_CAPABILITY_CUSTODY_CHAIN_LENGTH))
  421. throw ZT_EXCEPTION_INVALID_SERIALIZED_DATA_OVERFLOW;
  422. _custody[i].to = to;
  423. _custody[i].from.setTo(b.field(p,ZT_ADDRESS_LENGTH),ZT_ADDRESS_LENGTH); p += ZT_ADDRESS_LENGTH;
  424. if (b[p++] == 1) {
  425. if (b.template at<uint16_t>(p) != ZT_C25519_SIGNATURE_LEN)
  426. throw ZT_EXCEPTION_INVALID_SERIALIZED_DATA_INVALID_CRYPTOGRAPHIC_TOKEN;
  427. p += 2;
  428. memcpy(_custody[i].signature.data,b.field(p,ZT_C25519_SIGNATURE_LEN),ZT_C25519_SIGNATURE_LEN); p += ZT_C25519_SIGNATURE_LEN;
  429. } else {
  430. p += 2 + b.template at<uint16_t>(p);
  431. }
  432. }
  433. p += 2 + b.template at<uint16_t>(p);
  434. if (p > b.size())
  435. throw ZT_EXCEPTION_INVALID_SERIALIZED_DATA_OVERFLOW;
  436. return (p - startAt);
  437. }
  438. // Provides natural sort order by ID
  439. inline bool operator<(const Capability &c) const { return (_id < c._id); }
  440. inline bool operator==(const Capability &c) const { return (memcmp(this,&c,sizeof(Capability)) == 0); }
  441. inline bool operator!=(const Capability &c) const { return (memcmp(this,&c,sizeof(Capability)) != 0); }
  442. private:
  443. uint64_t _nwid;
  444. int64_t _ts;
  445. uint32_t _id;
  446. unsigned int _maxCustodyChainLength;
  447. unsigned int _ruleCount;
  448. ZT_VirtualNetworkRule _rules[ZT_MAX_CAPABILITY_RULES];
  449. struct {
  450. Address to;
  451. Address from;
  452. C25519::Signature signature;
  453. } _custody[ZT_MAX_CAPABILITY_CUSTODY_CHAIN_LENGTH];
  454. };
  455. } // namespace ZeroTier
  456. #endif