sde_kms_utils.c 6.1 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269
  1. // SPDX-License-Identifier: GPL-2.0-only
  2. /*
  3. * Copyright (c) 2015-2021, 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_add_list(struct sde_kms_info *info, const char *key, uint32_t *value, size_t size)
  78. {
  79. uint32_t i, len;
  80. if (!info || !key || !value || !size)
  81. return;
  82. sde_kms_info_start(info, key);
  83. for (i = 0; i < size; i++) {
  84. len = scnprintf(info->data + info->staged_len,
  85. SDE_KMS_INFO_MAX_SIZE - info->len, "%d ",
  86. value[i]);
  87. /* check if snprintf truncated the string */
  88. if ((info->staged_len + len) < SDE_KMS_INFO_MAX_SIZE) {
  89. info->staged_len += len;
  90. info->start = false;
  91. }
  92. }
  93. sde_kms_info_stop(info);
  94. }
  95. void sde_kms_info_append_format(struct sde_kms_info *info,
  96. uint32_t pixel_format,
  97. uint64_t modifier)
  98. {
  99. uint32_t len;
  100. if (!info)
  101. return;
  102. if (modifier) {
  103. len = snprintf(info->data + info->staged_len,
  104. SDE_KMS_INFO_MAX_SIZE - info->staged_len,
  105. info->start ?
  106. "%c%c%c%c/%llX/%llX" : " %c%c%c%c/%llX/%llX",
  107. (pixel_format >> 0) & 0xFF,
  108. (pixel_format >> 8) & 0xFF,
  109. (pixel_format >> 16) & 0xFF,
  110. (pixel_format >> 24) & 0xFF,
  111. (modifier >> 56) & 0xFF,
  112. modifier & ((1ULL << 56) - 1));
  113. } else {
  114. len = snprintf(info->data + info->staged_len,
  115. SDE_KMS_INFO_MAX_SIZE - info->staged_len,
  116. info->start ?
  117. "%c%c%c%c" : " %c%c%c%c",
  118. (pixel_format >> 0) & 0xFF,
  119. (pixel_format >> 8) & 0xFF,
  120. (pixel_format >> 16) & 0xFF,
  121. (pixel_format >> 24) & 0xFF);
  122. }
  123. /* check if snprintf truncated the string */
  124. if ((info->staged_len + len) < SDE_KMS_INFO_MAX_SIZE) {
  125. info->staged_len += len;
  126. info->start = false;
  127. }
  128. }
  129. void sde_kms_info_stop(struct sde_kms_info *info)
  130. {
  131. uint32_t len;
  132. if (info) {
  133. /* insert final delimiter */
  134. len = snprintf(info->data + info->staged_len,
  135. SDE_KMS_INFO_MAX_SIZE - info->staged_len,
  136. "\n");
  137. /* check if snprintf truncated the string */
  138. if ((info->staged_len + len) < SDE_KMS_INFO_MAX_SIZE)
  139. info->len = info->staged_len + len;
  140. }
  141. }
  142. void sde_kms_info_append_dnsc_blur_filter_info(struct sde_kms_info *info,
  143. struct sde_dnsc_blur_filter_info *filter_info)
  144. {
  145. int i;
  146. uint32_t len, cur_len;
  147. if (!info)
  148. return;
  149. len = snprintf(info->data + info->staged_len, SDE_KMS_INFO_MAX_SIZE - info->staged_len,
  150. info->start ?
  151. "%c/%c/%c/%c/%c/%c/%c/%c/%c/" : " %c/%c/%c/%c/%c/%c/%c/%c/%c/",
  152. filter_info->filter & 0xFF, filter_info->src_min & 0xFF,
  153. filter_info->src_max & 0xFF, filter_info->dst_min & 0xFF,
  154. filter_info->dst_max & 0xFF, filter_info->min_ratio & 0xFF,
  155. filter_info->max_ratio & 0xFF, filter_info->fraction_support & 0xFF,
  156. filter_info->ratio_count & 0xFF);
  157. cur_len = len;
  158. for (i = 0; i < filter_info->ratio_count; i++) {
  159. len = snprintf(info->data + (info->staged_len + cur_len),
  160. SDE_KMS_INFO_MAX_SIZE - (info->staged_len + cur_len),
  161. (i == filter_info->ratio_count - 1) ? "%c" : "%c,",
  162. filter_info->ratio[i]);
  163. cur_len += len;
  164. }
  165. /* check if snprintf truncated the string */
  166. if ((info->staged_len + cur_len) < SDE_KMS_INFO_MAX_SIZE) {
  167. info->staged_len += cur_len;
  168. info->start = false;
  169. }
  170. }
  171. void sde_kms_rect_intersect(const struct sde_rect *r1,
  172. const struct sde_rect *r2,
  173. struct sde_rect *result)
  174. {
  175. int l, t, r, b;
  176. if (!r1 || !r2 || !result)
  177. return;
  178. l = max(r1->x, r2->x);
  179. t = max(r1->y, r2->y);
  180. r = min((r1->x + r1->w), (r2->x + r2->w));
  181. b = min((r1->y + r1->h), (r2->y + r2->h));
  182. if (r <= l || b <= t) {
  183. memset(result, 0, sizeof(*result));
  184. } else {
  185. result->x = l;
  186. result->y = t;
  187. result->w = r - l;
  188. result->h = b - t;
  189. }
  190. }
  191. void sde_kms_rect_merge_rectangles(const struct msm_roi_list *rois,
  192. struct sde_rect *result)
  193. {
  194. struct drm_clip_rect clip;
  195. const struct drm_clip_rect *roi_rect;
  196. int i;
  197. if (!rois || !result)
  198. return;
  199. memset(result, 0, sizeof(*result));
  200. /* init to invalid range maxes */
  201. clip.x1 = ~0;
  202. clip.y1 = ~0;
  203. clip.x2 = 0;
  204. clip.y2 = 0;
  205. /* aggregate all clipping rectangles together for overall roi */
  206. for (i = 0; i < rois->num_rects; i++) {
  207. roi_rect = &rois->roi[i];
  208. clip.x1 = min(clip.x1, roi_rect->x1);
  209. clip.y1 = min(clip.y1, roi_rect->y1);
  210. clip.x2 = max(clip.x2, roi_rect->x2);
  211. clip.y2 = max(clip.y2, roi_rect->y2);
  212. SDE_DEBUG("roi%d (%d,%d),(%d,%d) -> crtc (%d,%d),(%d,%d)\n", i,
  213. roi_rect->x1, roi_rect->y1,
  214. roi_rect->x2, roi_rect->y2,
  215. clip.x1, clip.y1,
  216. clip.x2, clip.y2);
  217. }
  218. if (clip.x2 && clip.y2) {
  219. result->x = clip.x1;
  220. result->y = clip.y1;
  221. result->w = clip.x2 - clip.x1;
  222. result->h = clip.y2 - clip.y1;
  223. }
  224. }