src/mesa/main/tests/mesa_extensions.cpp

   1 /*
   2  * Copyright © 2015 Intel Corporation
   3  *
   4  * Permission is hereby granted, free of charge, to any person obtaining a
   5  * copy of this software and associated documentation files (the "Software"),
   6  * to deal in the Software without restriction, including without limitation
   7  * the rights to use, copy, modify, merge, publish, distribute, sublicense,
   8  * and/or sell copies of the Software, and to permit persons to whom the
   9  * Software is furnished to do so, subject to the following conditions:
  10  *
  11  * The above copyright notice and this permission notice (including the next
  12  * paragraph) shall be included in all copies or substantial portions of the
  13  * Software.
  14  *
  15  * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
  16  * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
  17  * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.  IN NO EVENT SHALL
  18  * THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
  19  * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
  20  * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
  21  * DEALINGS IN THE SOFTWARE.
  22  */
  23
  24 /**
  25  * \name mesa_extensions.cpp
  26  *
  27  * Verify that the extensions table is sorted.
  28  */
  29
  30 #include <gtest/gtest.h>
  31 #include "util/macros.h"
  32
  33 /**
  34  * Debug/test: verify the extension table is alphabetically sorted.
  35  */
  36 TEST(MesaExtensionsTest, AlphabeticallySorted)
  37 {
  38    const char *ext_names[] = {
  39    #define EXT(name_str, ...) #name_str,
  40    #include "main/extensions_table.h"
  41    #undef EXT
  42    };
  43
  44    for (unsigned i = 0; i < ARRAY_SIZE(ext_names) - 1; ++i) {
  45       const char *current_str = ext_names[i];
  46       const char *next_str = ext_names[i+1];
  47
  48       /* We expect the extension table to be alphabetically sorted */
  49       ASSERT_LT(strcmp(current_str, next_str), 0);
  50    }
  51 }