rpl.c 3.2 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125
  1. // SPDX-License-Identifier: GPL-2.0-only
  2. /*
  3. * Authors:
  4. * (C) 2020 Alexander Aring <[email protected]>
  5. */
  6. #include <net/ipv6.h>
  7. #include <net/rpl.h>
  8. #define IPV6_PFXTAIL_LEN(x) (sizeof(struct in6_addr) - (x))
  9. #define IPV6_RPL_BEST_ADDR_COMPRESSION 15
  10. static void ipv6_rpl_addr_decompress(struct in6_addr *dst,
  11. const struct in6_addr *daddr,
  12. const void *post, unsigned char pfx)
  13. {
  14. memcpy(dst, daddr, pfx);
  15. memcpy(&dst->s6_addr[pfx], post, IPV6_PFXTAIL_LEN(pfx));
  16. }
  17. static void ipv6_rpl_addr_compress(void *dst, const struct in6_addr *addr,
  18. unsigned char pfx)
  19. {
  20. memcpy(dst, &addr->s6_addr[pfx], IPV6_PFXTAIL_LEN(pfx));
  21. }
  22. static void *ipv6_rpl_segdata_pos(const struct ipv6_rpl_sr_hdr *hdr, int i)
  23. {
  24. return (void *)&hdr->rpl_segdata[i * IPV6_PFXTAIL_LEN(hdr->cmpri)];
  25. }
  26. size_t ipv6_rpl_srh_size(unsigned char n, unsigned char cmpri,
  27. unsigned char cmpre)
  28. {
  29. return sizeof(struct ipv6_rpl_sr_hdr) + (n * IPV6_PFXTAIL_LEN(cmpri)) +
  30. IPV6_PFXTAIL_LEN(cmpre);
  31. }
  32. void ipv6_rpl_srh_decompress(struct ipv6_rpl_sr_hdr *outhdr,
  33. const struct ipv6_rpl_sr_hdr *inhdr,
  34. const struct in6_addr *daddr, unsigned char n)
  35. {
  36. int i;
  37. outhdr->nexthdr = inhdr->nexthdr;
  38. outhdr->hdrlen = (((n + 1) * sizeof(struct in6_addr)) >> 3);
  39. outhdr->pad = 0;
  40. outhdr->type = inhdr->type;
  41. outhdr->segments_left = inhdr->segments_left;
  42. outhdr->cmpri = 0;
  43. outhdr->cmpre = 0;
  44. for (i = 0; i < n; i++)
  45. ipv6_rpl_addr_decompress(&outhdr->rpl_segaddr[i], daddr,
  46. ipv6_rpl_segdata_pos(inhdr, i),
  47. inhdr->cmpri);
  48. ipv6_rpl_addr_decompress(&outhdr->rpl_segaddr[n], daddr,
  49. ipv6_rpl_segdata_pos(inhdr, n),
  50. inhdr->cmpre);
  51. }
  52. static unsigned char ipv6_rpl_srh_calc_cmpri(const struct ipv6_rpl_sr_hdr *inhdr,
  53. const struct in6_addr *daddr,
  54. unsigned char n)
  55. {
  56. unsigned char plen;
  57. int i;
  58. for (plen = 0; plen < sizeof(*daddr); plen++) {
  59. for (i = 0; i < n; i++) {
  60. if (daddr->s6_addr[plen] !=
  61. inhdr->rpl_segaddr[i].s6_addr[plen])
  62. return plen;
  63. }
  64. }
  65. return IPV6_RPL_BEST_ADDR_COMPRESSION;
  66. }
  67. static unsigned char ipv6_rpl_srh_calc_cmpre(const struct in6_addr *daddr,
  68. const struct in6_addr *last_segment)
  69. {
  70. unsigned int plen;
  71. for (plen = 0; plen < sizeof(*daddr); plen++) {
  72. if (daddr->s6_addr[plen] != last_segment->s6_addr[plen])
  73. return plen;
  74. }
  75. return IPV6_RPL_BEST_ADDR_COMPRESSION;
  76. }
  77. void ipv6_rpl_srh_compress(struct ipv6_rpl_sr_hdr *outhdr,
  78. const struct ipv6_rpl_sr_hdr *inhdr,
  79. const struct in6_addr *daddr, unsigned char n)
  80. {
  81. unsigned char cmpri, cmpre;
  82. size_t seglen;
  83. int i;
  84. cmpri = ipv6_rpl_srh_calc_cmpri(inhdr, daddr, n);
  85. cmpre = ipv6_rpl_srh_calc_cmpre(daddr, &inhdr->rpl_segaddr[n]);
  86. outhdr->nexthdr = inhdr->nexthdr;
  87. seglen = (n * IPV6_PFXTAIL_LEN(cmpri)) + IPV6_PFXTAIL_LEN(cmpre);
  88. outhdr->hdrlen = seglen >> 3;
  89. if (seglen & 0x7) {
  90. outhdr->hdrlen++;
  91. outhdr->pad = 8 - (seglen & 0x7);
  92. } else {
  93. outhdr->pad = 0;
  94. }
  95. outhdr->type = inhdr->type;
  96. outhdr->segments_left = inhdr->segments_left;
  97. outhdr->cmpri = cmpri;
  98. outhdr->cmpre = cmpre;
  99. for (i = 0; i < n; i++)
  100. ipv6_rpl_addr_compress(ipv6_rpl_segdata_pos(outhdr, i),
  101. &inhdr->rpl_segaddr[i], cmpri);
  102. ipv6_rpl_addr_compress(ipv6_rpl_segdata_pos(outhdr, n),
  103. &inhdr->rpl_segaddr[n], cmpre);
  104. }