drm_displayid.c 4.4 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204
  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. enum {
  10. QUIRK_IGNORE_CHECKSUM,
  11. };
  12. struct displayid_quirk {
  13. const struct drm_edid_ident ident;
  14. u8 quirks;
  15. };
  16. static const struct displayid_quirk quirks[] = {
  17. {
  18. .ident = DRM_EDID_IDENT_INIT('C', 'S', 'O', 5142, "MNE007ZA1-5"),
  19. .quirks = BIT(QUIRK_IGNORE_CHECKSUM),
  20. },
  21. };
  22. static u8 get_quirks(const struct drm_edid *drm_edid)
  23. {
  24. int i;
  25. for (i = 0; i < ARRAY_SIZE(quirks); i++) {
  26. if (drm_edid_match(drm_edid, &quirks[i].ident))
  27. return quirks[i].quirks;
  28. }
  29. return 0;
  30. }
  31. static const struct displayid_header *
  32. displayid_get_header(const u8 *displayid, int length, int index)
  33. {
  34. const struct displayid_header *base;
  35. if (sizeof(*base) > length - index)
  36. return ERR_PTR(-EINVAL);
  37. base = (const struct displayid_header *)&displayid[index];
  38. return base;
  39. }
  40. static const struct displayid_header *
  41. validate_displayid(const u8 *displayid, int length, int idx, bool ignore_checksum)
  42. {
  43. int i, dispid_length;
  44. u8 csum = 0;
  45. const struct displayid_header *base;
  46. base = displayid_get_header(displayid, length, idx);
  47. if (IS_ERR(base))
  48. return base;
  49. /* +1 for DispID checksum */
  50. dispid_length = sizeof(*base) + base->bytes + 1;
  51. if (dispid_length > length - idx)
  52. return ERR_PTR(-EINVAL);
  53. for (i = 0; i < dispid_length; i++)
  54. csum += displayid[idx + i];
  55. if (csum) {
  56. DRM_NOTE("DisplayID checksum invalid, remainder is %d%s\n", csum,
  57. ignore_checksum ? " (ignoring)" : "");
  58. if (!ignore_checksum)
  59. return ERR_PTR(-EINVAL);
  60. }
  61. return base;
  62. }
  63. static const u8 *find_next_displayid_extension(struct displayid_iter *iter)
  64. {
  65. const struct displayid_header *base;
  66. const u8 *displayid;
  67. bool ignore_checksum = iter->quirks & BIT(QUIRK_IGNORE_CHECKSUM);
  68. displayid = drm_edid_find_extension(iter->drm_edid, DISPLAYID_EXT, &iter->ext_index);
  69. if (!displayid)
  70. return NULL;
  71. /* EDID extensions block checksum isn't for us */
  72. iter->length = EDID_LENGTH - 1;
  73. iter->idx = 1;
  74. base = validate_displayid(displayid, iter->length, iter->idx, ignore_checksum);
  75. if (IS_ERR(base))
  76. return NULL;
  77. iter->length = iter->idx + sizeof(*base) + base->bytes;
  78. return displayid;
  79. }
  80. void displayid_iter_edid_begin(const struct drm_edid *drm_edid,
  81. struct displayid_iter *iter)
  82. {
  83. memset(iter, 0, sizeof(*iter));
  84. iter->drm_edid = drm_edid;
  85. iter->quirks = get_quirks(drm_edid);
  86. }
  87. static const struct displayid_block *
  88. displayid_iter_block(const struct displayid_iter *iter)
  89. {
  90. const struct displayid_block *block;
  91. if (!iter->section)
  92. return NULL;
  93. block = (const struct displayid_block *)&iter->section[iter->idx];
  94. if (iter->idx + sizeof(*block) <= iter->length &&
  95. iter->idx + sizeof(*block) + block->num_bytes <= iter->length)
  96. return block;
  97. return NULL;
  98. }
  99. const struct displayid_block *
  100. __displayid_iter_next(struct displayid_iter *iter)
  101. {
  102. const struct displayid_block *block;
  103. if (!iter->drm_edid)
  104. return NULL;
  105. if (iter->section) {
  106. /* current block should always be valid */
  107. block = displayid_iter_block(iter);
  108. if (WARN_ON(!block)) {
  109. iter->section = NULL;
  110. iter->drm_edid = NULL;
  111. return NULL;
  112. }
  113. /* next block in section */
  114. iter->idx += sizeof(*block) + block->num_bytes;
  115. block = displayid_iter_block(iter);
  116. if (block)
  117. return block;
  118. }
  119. for (;;) {
  120. /* The first section we encounter is the base section */
  121. bool base_section = !iter->section;
  122. iter->section = find_next_displayid_extension(iter);
  123. if (!iter->section) {
  124. iter->drm_edid = NULL;
  125. return NULL;
  126. }
  127. /* Save the structure version and primary use case. */
  128. if (base_section) {
  129. const struct displayid_header *base;
  130. base = displayid_get_header(iter->section, iter->length,
  131. iter->idx);
  132. if (!IS_ERR(base)) {
  133. iter->version = base->rev;
  134. iter->primary_use = base->prod_id;
  135. }
  136. }
  137. iter->idx += sizeof(struct displayid_header);
  138. block = displayid_iter_block(iter);
  139. if (block)
  140. return block;
  141. }
  142. }
  143. void displayid_iter_end(struct displayid_iter *iter)
  144. {
  145. memset(iter, 0, sizeof(*iter));
  146. }
  147. /* DisplayID Structure Version/Revision from the Base Section. */
  148. u8 displayid_version(const struct displayid_iter *iter)
  149. {
  150. return iter->version;
  151. }
  152. /*
  153. * DisplayID Primary Use Case (2.0+) or Product Type Identifier (1.0-1.3) from
  154. * the Base Section.
  155. */
  156. u8 displayid_primary_use(const struct displayid_iter *iter)
  157. {
  158. return iter->primary_use;
  159. }