drm_displayid.c 3.8 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176
  1. // SPDX-License-Identifier: MIT
  2. /*
  3. * Copyright © 2021 Intel Corporation
  4. */
  5. #include <drm/drm_edid.h>
  6. #include <drm/drm_print.h>
  7. #include "drm_crtc_internal.h"
  8. #include "drm_displayid_internal.h"
  9. static const struct displayid_header *
  10. displayid_get_header(const u8 *displayid, int length, int index)
  11. {
  12. const struct displayid_header *base;
  13. if (sizeof(*base) > length - index)
  14. return ERR_PTR(-EINVAL);
  15. base = (const struct displayid_header *)&displayid[index];
  16. return base;
  17. }
  18. static const struct displayid_header *
  19. validate_displayid(const u8 *displayid, int length, int idx)
  20. {
  21. int i, dispid_length;
  22. u8 csum = 0;
  23. const struct displayid_header *base;
  24. base = displayid_get_header(displayid, length, idx);
  25. if (IS_ERR(base))
  26. return base;
  27. /* +1 for DispID checksum */
  28. dispid_length = sizeof(*base) + base->bytes + 1;
  29. if (dispid_length > length - idx)
  30. return ERR_PTR(-EINVAL);
  31. for (i = 0; i < dispid_length; i++)
  32. csum += displayid[idx + i];
  33. if (csum) {
  34. DRM_NOTE("DisplayID checksum invalid, remainder is %d\n", csum);
  35. return ERR_PTR(-EINVAL);
  36. }
  37. return base;
  38. }
  39. static const u8 *drm_find_displayid_extension(const struct drm_edid *drm_edid,
  40. int *length, int *idx,
  41. int *ext_index)
  42. {
  43. const struct displayid_header *base;
  44. const u8 *displayid;
  45. displayid = drm_edid_find_extension(drm_edid, DISPLAYID_EXT, ext_index);
  46. if (!displayid)
  47. return NULL;
  48. /* EDID extensions block checksum isn't for us */
  49. *length = EDID_LENGTH - 1;
  50. *idx = 1;
  51. base = validate_displayid(displayid, *length, *idx);
  52. if (IS_ERR(base))
  53. return NULL;
  54. *length = *idx + sizeof(*base) + base->bytes;
  55. return displayid;
  56. }
  57. void displayid_iter_edid_begin(const struct drm_edid *drm_edid,
  58. struct displayid_iter *iter)
  59. {
  60. memset(iter, 0, sizeof(*iter));
  61. iter->drm_edid = drm_edid;
  62. }
  63. static const struct displayid_block *
  64. displayid_iter_block(const struct displayid_iter *iter)
  65. {
  66. const struct displayid_block *block;
  67. if (!iter->section)
  68. return NULL;
  69. block = (const struct displayid_block *)&iter->section[iter->idx];
  70. if (iter->idx + sizeof(*block) <= iter->length &&
  71. iter->idx + sizeof(*block) + block->num_bytes <= iter->length)
  72. return block;
  73. return NULL;
  74. }
  75. const struct displayid_block *
  76. __displayid_iter_next(struct displayid_iter *iter)
  77. {
  78. const struct displayid_block *block;
  79. if (!iter->drm_edid)
  80. return NULL;
  81. if (iter->section) {
  82. /* current block should always be valid */
  83. block = displayid_iter_block(iter);
  84. if (WARN_ON(!block)) {
  85. iter->section = NULL;
  86. iter->drm_edid = NULL;
  87. return NULL;
  88. }
  89. /* next block in section */
  90. iter->idx += sizeof(*block) + block->num_bytes;
  91. block = displayid_iter_block(iter);
  92. if (block)
  93. return block;
  94. }
  95. for (;;) {
  96. /* The first section we encounter is the base section */
  97. bool base_section = !iter->section;
  98. iter->section = drm_find_displayid_extension(iter->drm_edid,
  99. &iter->length,
  100. &iter->idx,
  101. &iter->ext_index);
  102. if (!iter->section) {
  103. iter->drm_edid = NULL;
  104. return NULL;
  105. }
  106. /* Save the structure version and primary use case. */
  107. if (base_section) {
  108. const struct displayid_header *base;
  109. base = displayid_get_header(iter->section, iter->length,
  110. iter->idx);
  111. if (!IS_ERR(base)) {
  112. iter->version = base->rev;
  113. iter->primary_use = base->prod_id;
  114. }
  115. }
  116. iter->idx += sizeof(struct displayid_header);
  117. block = displayid_iter_block(iter);
  118. if (block)
  119. return block;
  120. }
  121. }
  122. void displayid_iter_end(struct displayid_iter *iter)
  123. {
  124. memset(iter, 0, sizeof(*iter));
  125. }
  126. /* DisplayID Structure Version/Revision from the Base Section. */
  127. u8 displayid_version(const struct displayid_iter *iter)
  128. {
  129. return iter->version;
  130. }
  131. /*
  132. * DisplayID Primary Use Case (2.0+) or Product Type Identifier (1.0-1.3) from
  133. * the Base Section.
  134. */
  135. u8 displayid_primary_use(const struct displayid_iter *iter)
  136. {
  137. return iter->primary_use;
  138. }