Add bgra (z,y,x) sampled transform lookup table api

third_party/qcms/src/transform.c

 /* vim: set ts=8 sw=8 noexpandtab: */
 //  qcms
 //  Copyright (C) 2009 Mozilla Corporation
 //  Copyright (C) 1998-2007 Marti Maria
 //
 // Permission is hereby granted, free of charge, to any person obtaining 
 // a copy of this software and associated documentation files (the "Software"), 
 // to deal in the Software without restriction, including without limitation 
 // the rights to use, copy, modify, merge, publish, distribute, sublicense, 
 // and/or sell copies of the Software, and to permit persons to whom the Software 
@@ skipping 1149 matching lines @@
         if (dest && lut != dest) {
                 free(dest);
         }
 
         if (lut == NULL) {
                 return NULL;
         }
         return transform;
 }
 
+qcms_bool qcms_transform_create_color_cube_zyx_bgra(qcms_profile *in, qcms_profile *out,
+                                                    int samples, unsigned char* cube)
+{
+    uint16_t z,y,x;
+    uint32_t l,index;
+    uint32_t lutSize = 3 * samples * samples * samples;
+
+    float* src = NULL;
+    float* dest = NULL;
+    float* lut = NULL;
+    float inverse;
+
+    src = malloc(lutSize*sizeof(float));
+    dest = malloc(lutSize*sizeof(float));
+
+    if (src && dest) {
+        /* Prepare a list of points we want to sample: z, y, x order */
+        l = 0;
+        inverse = 1 / (float)(samples-1);
+        for (z = 0; z < samples; z++) {
+            for (y = 0; y < samples; y++) {
+                for (x = 0; x < samples; x++) {
+                    src[l++] = x * inverse; // r
+                    src[l++] = y * inverse; // g
+                    src[l++] = z * inverse; // b
+                }
+            }
+        }
+
+        lut = qcms_chain_transform(in, out, src, dest, lutSize);
+
+        if (lut) {
+            index = l = 0;
+            for (z = 0; z < samples; z++) {
+                for (y = 0; y < samples; y++) {
+                    for (x = 0; x < samples; x++) {
+                        cube[index++] = (int)floorf(lut[l + 2] * 255.0f + 0.5f); // b
+                        cube[index++] = (int)floorf(lut[l + 1] * 255.0f + 0.5f); // g
+                        cube[index++] = (int)floorf(lut[l + 0] * 255.0f + 0.5f); // r
+                        cube[index++] = 255;                                     // a
+                        l += 3;
+                    }
+                }
+            }
+        }
+    }
+
+    // XXX: qcms_modular_transform_data may return the lut data in either the src or
+    // dest buffer so free src, dest, and lut with care.
+
+    if (src && lut != src)
+        free(src);
+    if (dest && lut != dest)
+        free(dest);
+
+    if (lut) {
+        free(lut);
+        return true;
+    }
+
+    return false;
+}
+
 #define NO_MEM_TRANSFORM NULL
 
 qcms_transform* qcms_transform_create(
                 qcms_profile *in, qcms_data_type in_type,
                 qcms_profile *out, qcms_data_type out_type,
                 qcms_intent intent)
 {
         bool precache = false;
 
         qcms_transform *transform = transform_alloc();
@@ skipping 183 matching lines @@
         static const struct _qcms_format_type output_bgrx = { 2, 0 };
 
         transform->transform_fn(transform, src, dest, length, type == QCMS_OUTPUT_BGRX ? output_bgrx : output_rgbx);
 }
 
 qcms_bool qcms_supports_iccv4;
 void qcms_enable_iccv4()
 {
         qcms_supports_iccv4 = true;
 }