sde_kms_utils.c 4.5 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213
  1. // SPDX-License-Identifier: GPL-2.0-only
  2. /*
  3. * Copyright (c) 2015-2019, The Linux Foundation. All rights reserved.
  4. */
  5. #define pr_fmt(fmt) "sde-kms_utils:[%s] " fmt, __func__
  6. #include "sde_kms.h"
  7. void sde_kms_info_reset(struct sde_kms_info *info)
  8. {
  9. if (info) {
  10. info->len = 0;
  11. info->staged_len = 0;
  12. }
  13. }
  14. void sde_kms_info_add_keyint(struct sde_kms_info *info,
  15. const char *key,
  16. int64_t value)
  17. {
  18. uint32_t len;
  19. if (info && key) {
  20. len = snprintf(info->data + info->len,
  21. SDE_KMS_INFO_MAX_SIZE - info->len,
  22. "%s=%lld\n",
  23. key,
  24. value);
  25. /* check if snprintf truncated the string */
  26. if ((info->len + len) < SDE_KMS_INFO_MAX_SIZE)
  27. info->len += len;
  28. }
  29. }
  30. void sde_kms_info_add_keystr(struct sde_kms_info *info,
  31. const char *key,
  32. const char *value)
  33. {
  34. uint32_t len;
  35. if (info && key && value) {
  36. len = snprintf(info->data + info->len,
  37. SDE_KMS_INFO_MAX_SIZE - info->len,
  38. "%s=%s\n",
  39. key,
  40. value);
  41. /* check if snprintf truncated the string */
  42. if ((info->len + len) < SDE_KMS_INFO_MAX_SIZE)
  43. info->len += len;
  44. }
  45. }
  46. void sde_kms_info_start(struct sde_kms_info *info,
  47. const char *key)
  48. {
  49. uint32_t len;
  50. if (info && key) {
  51. len = snprintf(info->data + info->len,
  52. SDE_KMS_INFO_MAX_SIZE - info->len,
  53. "%s=",
  54. key);
  55. info->start = true;
  56. /* check if snprintf truncated the string */
  57. if ((info->len + len) < SDE_KMS_INFO_MAX_SIZE)
  58. info->staged_len = info->len + len;
  59. }
  60. }
  61. void sde_kms_info_append(struct sde_kms_info *info,
  62. const char *str)
  63. {
  64. uint32_t len;
  65. if (info) {
  66. len = snprintf(info->data + info->staged_len,
  67. SDE_KMS_INFO_MAX_SIZE - info->staged_len,
  68. "%s",
  69. str);
  70. /* check if snprintf truncated the string */
  71. if ((info->staged_len + len) < SDE_KMS_INFO_MAX_SIZE) {
  72. info->staged_len += len;
  73. info->start = false;
  74. }
  75. }
  76. }
  77. void sde_kms_info_append_format(struct sde_kms_info *info,
  78. uint32_t pixel_format,
  79. uint64_t modifier)
  80. {
  81. uint32_t len;
  82. if (!info)
  83. return;
  84. if (modifier) {
  85. len = snprintf(info->data + info->staged_len,
  86. SDE_KMS_INFO_MAX_SIZE - info->staged_len,
  87. info->start ?
  88. "%c%c%c%c/%llX/%llX" : " %c%c%c%c/%llX/%llX",
  89. (pixel_format >> 0) & 0xFF,
  90. (pixel_format >> 8) & 0xFF,
  91. (pixel_format >> 16) & 0xFF,
  92. (pixel_format >> 24) & 0xFF,
  93. (modifier >> 56) & 0xFF,
  94. modifier & ((1ULL << 56) - 1));
  95. } else {
  96. len = snprintf(info->data + info->staged_len,
  97. SDE_KMS_INFO_MAX_SIZE - info->staged_len,
  98. info->start ?
  99. "%c%c%c%c" : " %c%c%c%c",
  100. (pixel_format >> 0) & 0xFF,
  101. (pixel_format >> 8) & 0xFF,
  102. (pixel_format >> 16) & 0xFF,
  103. (pixel_format >> 24) & 0xFF);
  104. }
  105. /* check if snprintf truncated the string */
  106. if ((info->staged_len + len) < SDE_KMS_INFO_MAX_SIZE) {
  107. info->staged_len += len;
  108. info->start = false;
  109. }
  110. }
  111. void sde_kms_info_stop(struct sde_kms_info *info)
  112. {
  113. uint32_t len;
  114. if (info) {
  115. /* insert final delimiter */
  116. len = snprintf(info->data + info->staged_len,
  117. SDE_KMS_INFO_MAX_SIZE - info->staged_len,
  118. "\n");
  119. /* check if snprintf truncated the string */
  120. if ((info->staged_len + len) < SDE_KMS_INFO_MAX_SIZE)
  121. info->len = info->staged_len + len;
  122. }
  123. }
  124. void sde_kms_rect_intersect(const struct sde_rect *r1,
  125. const struct sde_rect *r2,
  126. struct sde_rect *result)
  127. {
  128. int l, t, r, b;
  129. if (!r1 || !r2 || !result)
  130. return;
  131. l = max(r1->x, r2->x);
  132. t = max(r1->y, r2->y);
  133. r = min((r1->x + r1->w), (r2->x + r2->w));
  134. b = min((r1->y + r1->h), (r2->y + r2->h));
  135. if (r <= l || b <= t) {
  136. memset(result, 0, sizeof(*result));
  137. } else {
  138. result->x = l;
  139. result->y = t;
  140. result->w = r - l;
  141. result->h = b - t;
  142. }
  143. }
  144. void sde_kms_rect_merge_rectangles(const struct msm_roi_list *rois,
  145. struct sde_rect *result)
  146. {
  147. struct drm_clip_rect clip;
  148. const struct drm_clip_rect *roi_rect;
  149. int i;
  150. if (!rois || !result)
  151. return;
  152. memset(result, 0, sizeof(*result));
  153. /* init to invalid range maxes */
  154. clip.x1 = ~0;
  155. clip.y1 = ~0;
  156. clip.x2 = 0;
  157. clip.y2 = 0;
  158. /* aggregate all clipping rectangles together for overall roi */
  159. for (i = 0; i < rois->num_rects; i++) {
  160. roi_rect = &rois->roi[i];
  161. clip.x1 = min(clip.x1, roi_rect->x1);
  162. clip.y1 = min(clip.y1, roi_rect->y1);
  163. clip.x2 = max(clip.x2, roi_rect->x2);
  164. clip.y2 = max(clip.y2, roi_rect->y2);
  165. SDE_DEBUG("roi%d (%d,%d),(%d,%d) -> crtc (%d,%d),(%d,%d)\n", i,
  166. roi_rect->x1, roi_rect->y1,
  167. roi_rect->x2, roi_rect->y2,
  168. clip.x1, clip.y1,
  169. clip.x2, clip.y2);
  170. }
  171. if (clip.x2 && clip.y2) {
  172. result->x = clip.x1;
  173. result->y = clip.y1;
  174. result->w = clip.x2 - clip.x1;
  175. result->h = clip.y2 - clip.y1;
  176. }
  177. }