JBR-8608 Vulkan: Cleanup capability checks

Author: YaaZ

src/java.desktop/share/classes/sun/java2d/vulkan/VKBlitLoops.java

@@ -546,7 +546,7 @@ private static int encode3Byte(int r, int g, int b) {
     }
 
     private static boolean hasCap(VKSurfaceData dst, int cap) {
-        return (dst.getGraphicsConfig().getGPU().getCaps() & cap) != 0;
+        return dst.getGraphicsConfig().getGPU().hasCap(cap);
     }
 
     /**

src/java.desktop/share/classes/sun/java2d/vulkan/VKEnv.java

@@ -80,7 +80,7 @@ public static synchronized void init(long nativePtr) {
                         Options.deviceNumber : 0];
                 // Check whether the presentation is supported.
                 for (VKGPU device : devices) {
-                    if ((device.getCaps() & VKGPU.CAP_PRESENTABLE_BIT) != 0 &&
+                    if (device.hasCap(VKGPU.CAP_PRESENTABLE_BIT) &&
                             device.getPresentableGraphicsConfigs().findAny().isPresent()) {
                         newState |= PRESENT_BIT;
                         break;

src/java.desktop/share/classes/sun/java2d/vulkan/VKGPU.java

@@ -39,6 +39,7 @@
 public class VKGPU {
 
     @Native public static final int CAP_PRESENTABLE_BIT = 0x80000000;
+    @Native public static final int CAP_LOGIC_OP_BIT    = 0x40000000;
     @Native public static final int CAP_SAMPLED_4BYTE_BIT = 0; // Considered always supported.
     @Native public static final int CAP_SAMPLED_3BYTE_BIT = 1;
     @Native public static final int CAP_SAMPLED_565_BIT   = 2;
@@ -98,6 +99,10 @@ public int getCaps() {
         return caps;
     }
 
+    public boolean hasCap(int cap) {
+        return (caps & cap) == cap;
+    }
+
     /**
      * Initialize the device and return its native handle.
      */

src/java.desktop/share/native/common/java2d/vulkan/VKCapabilityUtil.h

@@ -0,0 +1,87 @@
+/*
+ * Copyright (c) 2023, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2023, JetBrains s.r.o.. All rights reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.  Oracle designates this
+ * particular file as subject to the "Classpath" exception as provided
+ * by Oracle in the LICENSE file that accompanied this code.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ */
+
+#ifndef VKCapabilityUtil_h_Included
+#define VKCapabilityUtil_h_Included
+#include "VKUtil.h"
+
+#define VK_KHR_VALIDATION_LAYER_NAME "VK_LAYER_KHRONOS_validation"
+
+// Named entries are layers or extensions, arragned into on-stack linked list.
+typedef struct VKNamedEntry {
+    pchar       name;
+    const void* found; // Pointer to the found struct.
+    struct VKNamedEntry* next; // Pointer to the next entry.
+} VKNamedEntry;
+
+#define DEF_NAMED_ENTRY(LIST, NAME) VKNamedEntry NAME = { NAME ## _NAME, NULL, (LIST) }; \
+    if (NAME.name != NULL) (LIST) = &(NAME)
+
+static void VKNamedEntry_LogAll(pchar what, pchar all, uint32_t count, size_t stride) {
+    J2dRlsTraceLn1(J2D_TRACE_VERBOSE, "    Supported %s:", what)
+    for (uint32_t i = 0; i < count; i++) {
+        if (i == 0) J2dRlsTrace(J2D_TRACE_VERBOSE, "            ")
+        else J2dRlsTrace(J2D_TRACE_VERBOSE, ", ")
+        J2dRlsTrace(J2D_TRACE_VERBOSE, all)
+        all += stride;
+    }
+    J2dRlsTrace(J2D_TRACE_VERBOSE, "\n")
+}
+
+static void VKNamedEntry_LogFound(const VKNamedEntry* list) {
+    for (; list != NULL; list = list->next) {
+        J2dRlsTraceLn2(J2D_TRACE_INFO, "    %s = %s", list->name, list->found ? "true" : "false")
+    }
+}
+
+static void VKNamedEntry_Match(VKNamedEntry* list, pchar all, uint32_t count, size_t stride) {
+    for (; list != NULL; list = list->next) {
+        pchar check = all;
+        for (uint32_t i = 0; i < count; i++) {
+            if (strcmp(list->name, check) == 0) {
+                list->found = check;
+                break;
+            }
+            check += stride;
+        }
+    }
+}
+
+static ARRAY(pchar) VKNamedEntry_CollectNames(const VKNamedEntry* list) {
+    ARRAY(pchar) result = NULL;
+    for (; list != NULL; list = list->next) {
+        if (list->found) ARRAY_PUSH_BACK(result) = list->name;
+    }
+    return result;
+}
+
+static void VKCapabilityUtil_LogErrors(int level, ARRAY(pchar) errors) {
+    for (uint32_t i = 0; i < ARRAY_SIZE(errors); i++) {
+        J2dRlsTraceLn1(level, "        %s", errors[i])
+    }
+}
+
+#endif //VKCapabilityUtil_h_Included