falkTX
/
Carla
mirror of https://github.com/falkTX/Carla
1
0
Fork 0
Code Releases 43 Activity
Audio plugin host https://kx.studio/carla
You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
1933 Commits
17 Branches
992MB
Tree: 98040bd6e7
Branches Tags
${ item.name }
Create branch ${ searchTerm }
from '98040bd6e7'
${ noResults }
Carla/source/tests/CarlaUtils.cpp

793 lines
24KB
Raw Blame History 

  1. /*

  2.  * Carla Utility Tests

  3.  * Copyright (C) 2013-2014 Filipe Coelho <falktx@falktx.com>

  4.  *

  5.  * This program is free software; you can redistribute it and/or

  6.  * modify it under the terms of the GNU General Public License as

  7.  * published by the Free Software Foundation; either version 2 of

  8.  * the License, or any later version.

  9.  *

  10.  * This program is distributed in the hope that it will be useful,

  11.  * but WITHOUT ANY WARRANTY; without even the implied warranty of

  12.  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the

  13.  * GNU General Public License for more details.

  14.  *

  15.  * For a full copy of the GNU General Public License see the doc/GPL.txt file.

  16.  */

  17. 

  18. #ifdef NDEBUG

  19. # error Build this file with debug ON please

  20. #endif

  21. 

  22. #define HAVE_JUCE

  23. #define VESTIGE_HEADER

  24. 

  25. #include "CarlaUtils.hpp"

  26. #include "CarlaMathUtils.hpp"

  27. 

  28. #undef NULL

  29. #define NULL nullptr

  30. 

  31. #include "CarlaBackendUtils.hpp"

  32. #include "CarlaEngineUtils.hpp"

  33. 

  34. #include "CarlaLadspaUtils.hpp"

  35. #include "CarlaDssiUtils.hpp"

  36. #include "CarlaLv2Utils.hpp"

  37. #include "CarlaVstUtils.hpp"

  38. 

  39. #include "CarlaBridgeUtils.hpp"

  40. #include "CarlaLibCounter.hpp"

  41. #include "CarlaShmUtils.hpp"

  42. 

  43. // used in dssi utils

  44. #include "juce_core.h"

  45. #include <QtCore/QDir>

  46. #include <QtCore/QFileInfo>

  47. #include <QtCore/QStringList>

  48. 

  49. // #include "CarlaJuceUtils.hpp"

  50. // #include "CarlaOscUtils.hpp"

  51. // #include "CarlaStateUtils.hpp"

  52. 

  53. #if 0

  54. // -----------------------------------------------------------------------

  55. 

  56. static void test_CarlaUtils()

  57. {

  58.     // -------------------------------------------------------------------

  59.     // misc functions

  60. 

  61.     {

  62.         bool2str(false);

  63.         bool2str(true);

  64.         pass();

  65. 

  66.         char strBuf[1];

  67.         nullStrBuf(strBuf);

  68.     }

  69. 

  70.     // -------------------------------------------------------------------

  71.     // string print functions

  72. 

  73.     {

  74.         carla_debug("DEBUG");

  75.         carla_stdout("STDOUT %s", bool2str(true));

  76.         carla_stderr("STDERR %s", bool2str(false));

  77.         carla_stderr2("STDERR2 " P_UINT64, 0xffffffff); // 4294967295

  78.     }

  79. 

  80.     // -------------------------------------------------------------------

  81.     // carla_*sleep

  82. 

  83.     {

  84.         //carla_sleep(1);

  85.         //carla_msleep(1);

  86.     }

  87. 

  88.     // -------------------------------------------------------------------

  89.     // carla_setenv

  90. 

  91.     {

  92.         carla_setenv("THIS", "THAT");

  93.         assert(std::strcmp(std::getenv("THIS"), "THAT") == 0);

  94.     }

  95. 

  96.     // -------------------------------------------------------------------

  97.     // carla_strdup

  98. 

  99.     {

  100.         // with variables

  101.         const char* const str1(carla_strdup("string1"));

  102.         const char* const strF(carla_strdup_free(strdup("string2")));

  103.         delete[] str1;

  104.         delete[] strF;

  105. 

  106.         // without variables

  107.         delete[] carla_strdup("string3");

  108.         delete[] carla_strdup_free(strdup("string4"));

  109. 

  110.         // common use case in Carla code

  111.         struct TestStruct {

  112.             const char* str1;

  113.             const char* str2;

  114.             const char* str3;

  115.             const char* str4;

  116. 

  117.             TestStruct()

  118.                 : str1(carla_strdup("str1")),

  119.                   str2(carla_strdup("str2")),

  120.                   str3(nullptr),

  121.                   str4(carla_strdup("str4")) {}

  122. 

  123.             ~TestStruct() noexcept

  124.             {

  125.                 if (str1 != nullptr)

  126.                 {

  127.                     delete[] str1;

  128.                     str1 = nullptr;

  129.                 }

  130. 

  131.                 if (str2 != nullptr)

  132.                 {

  133.                     delete[] str2;

  134.                     str2 = nullptr;

  135.                 }

  136. 

  137.                 if (str3 != nullptr)

  138.                 {

  139.                     delete[] str3;

  140.                     str3 = nullptr;

  141.                 }

  142. 

  143.                 if (str4 != nullptr)

  144.                 {

  145.                     delete[] str4;

  146.                     str4 = nullptr;

  147.                 }

  148.             }

  149.         };

  150. 

  151.         TestStruct a, b, c;

  152.     }

  153. 

  154.     // -------------------------------------------------------------------

  155.     // memory functions

  156. 

  157.     {

  158.         int a[] = { 4, 3, 2, 1 };

  159.         int b[] = { 1, 2, 3, 4 };

  160.         carla_add(a, b, 4);

  161.         assert(a[0] == 5);

  162.         assert(a[1] == 5);

  163.         assert(a[2] == 5);

  164.         assert(a[3] == 5);

  165. 

  166.         int c[] = { 4, 3, 2, 1 };

  167.         carla_add(b, c, 4);

  168.         assert(a[0] == b[0]);

  169.         assert(a[1] == b[1]);

  170.         assert(a[2] == b[2]);

  171.         assert(a[3] == b[3]);

  172. 

  173.         carla_copy(a,   c,   2);

  174.         carla_copy(b+2, c+2, 2);

  175.         assert(a[0] == c[0]);

  176.         assert(a[1] == c[1]);

  177.         assert(b[2] == c[2]);

  178.         assert(b[3] == c[3]);

  179.         carla_copy(c, a, 4);

  180.         assert(a[0] == c[0]);

  181.         assert(a[1] == c[1]);

  182.         assert(a[2] == c[2]);

  183.         assert(a[3] == c[3]);

  184. 

  185.         carla_fill(a, 0, 4);

  186.         assert(a[0] == 0);

  187.         assert(a[1] == 0);

  188.         assert(a[2] == 0);

  189.         assert(a[3] == 0);

  190. 

  191.         carla_fill(a, -11, 4);

  192.         assert(a[0] == -11);

  193.         assert(a[1] == -11);

  194.         assert(a[2] == -11);

  195.         assert(a[3] == -11);

  196. 

  197.         carla_fill(a+0, 17, 2);

  198.         carla_fill(a+2, 23, 2);

  199.         assert(a[0] == 17);

  200.         assert(a[1] == 17);

  201.         assert(a[2] == 23);

  202.         assert(a[3] == 23);

  203. 

  204.         carla_zeroBytes(a, sizeof(int)*4);

  205.         assert(a[0] == 0);

  206.         assert(a[1] == 0);

  207.         assert(a[2] == 0);

  208.         assert(a[3] == 0);

  209. 

  210.         char strBuf[501];

  211.         strBuf[0] = strBuf[499] = strBuf[500] = '!';

  212.         carla_zeroChar(strBuf, 501);

  213. 

  214.         for (int i=0; i<501; ++i)

  215.             assert(strBuf[i] == '\0');

  216. 

  217.         int d = 1527, e = 0;

  218.         carla_add(&d, &d, 1);

  219.         carla_add(&d, &e, 1);

  220.         carla_add(&e, &d, 1);

  221.         assert(d == 1527*2);

  222.         assert(d == e);

  223. 

  224.         e = -e;

  225.         carla_add(&d, &e, 1);

  226.         assert(d == 0);

  227. 

  228.         carla_copy(&d, &e, 1);

  229.         assert(d == -1527*2);

  230.         assert(d == e);

  231. 

  232.         carla_fill(&d, 9999, 1);

  233.         carla_fill(&e, 123, 1);

  234.         assert(d == 9999);

  235.         assert(e == 123);

  236. 

  237.         carla_zeroStruct(d);

  238.         assert(d == 0);

  239. 

  240.         carla_copyStruct(d, e);

  241.         assert(d != 0);

  242.         assert(d == e);

  243. 

  244.         carla_fill(a+0, 1, 1);

  245.         carla_fill(a+1, 2, 1);

  246.         carla_fill(a+2, 3, 1);

  247.         carla_fill(a+3, 4, 1);

  248.         assert(a[0] == 1);

  249.         assert(a[1] == 2);

  250.         assert(a[2] == 3);

  251.         assert(a[3] == 4);

  252. 

  253.         carla_copyStruct(c, a, 4);

  254.         assert(c[0] == a[0]);

  255.         assert(c[1] == a[1]);

  256.         assert(c[2] == a[2]);

  257.         assert(c[3] == a[3]);

  258. 

  259.         carla_zeroStruct(c, 4);

  260.         assert(c[0] == 0);

  261.         assert(c[1] == 0);

  262.         assert(c[2] == 0);

  263.         assert(c[3] == 0);

  264. 

  265.         float fl[5];

  266.         carla_fill(fl, 1.11f, 5);

  267.         assert(fl[0] == 1.11f);

  268.         assert(fl[1] == 1.11f);

  269.         assert(fl[2] == 1.11f);

  270.         assert(fl[3] == 1.11f);

  271.         assert(fl[4] == 1.11f);

  272. 

  273.         carla_add(fl, fl, 5);

  274.         assert(fl[0] == 1.11f*2);

  275.         assert(fl[1] == 1.11f*2);

  276.         assert(fl[2] == 1.11f*2);

  277.         assert(fl[3] == 1.11f*2);

  278.         assert(fl[4] == 1.11f*2);

  279. 

  280.         carla_add(fl, fl, 4);

  281.         assert(fl[0] == 1.11f*4);

  282.         assert(fl[1] == 1.11f*4);

  283.         assert(fl[2] == 1.11f*4);

  284.         assert(fl[3] == 1.11f*4);

  285.         assert(fl[4] == 1.11f*2);

  286. 

  287.         carla_add(fl, fl, 3);

  288.         assert(fl[0] == 1.11f*8);

  289.         assert(fl[1] == 1.11f*8);

  290.         assert(fl[2] == 1.11f*8);

  291.         assert(fl[3] == 1.11f*4);

  292.         assert(fl[4] == 1.11f*2);

  293. 

  294.         carla_add(fl, fl, 2);

  295.         assert(fl[0] == 1.11f*16);

  296.         assert(fl[1] == 1.11f*16);

  297.         assert(fl[2] == 1.11f*8);

  298.         assert(fl[3] == 1.11f*4);

  299.         assert(fl[4] == 1.11f*2);

  300. 

  301.         carla_add(fl, fl, 1);

  302.         assert(fl[0] == 1.11f*32);

  303.         assert(fl[1] == 1.11f*16);

  304.         assert(fl[2] == 1.11f*8);

  305.         assert(fl[3] == 1.11f*4);

  306.         assert(fl[4] == 1.11f*2);

  307.     }

  308. }

  309. 

  310. // -----------------------------------------------------------------------

  311. 

  312. static void test_CarlaMathUtils() noexcept

  313. {

  314.     // -------------------------------------------------------------------

  315.     // math functions (base)

  316. 

  317.     // Return the lower of 2 values, with 'min' as the minimum possible value.

  318.     assert(carla_min(0, 0, 0) == 0);

  319.     assert(carla_min(0, 3, 0) == 0);

  320.     assert(carla_min(3, 0, 0) == 0);

  321. 

  322.     assert(carla_min(0, 0, 3) == 3);

  323.     assert(carla_min(0, 1, 3) == 3);

  324.     assert(carla_min(0, 2, 3) == 3);

  325.     assert(carla_min(0, 3, 3) == 3);

  326.     assert(carla_min(0, 4, 3) == 3);

  327. 

  328.     assert(carla_min(5, 0, 3) == 3);

  329.     assert(carla_min(5, 1, 3) == 3);

  330.     assert(carla_min(5, 2, 3) == 3);

  331.     assert(carla_min(5, 3, 3) == 3);

  332.     assert(carla_min(5, 4, 3) == 4);

  333.     assert(carla_min(5, 5, 3) == 5);

  334.     assert(carla_min(5, 6, 3) == 5);

  335. 

  336.     assert(carla_min(2, -2, 0) == 0);

  337.     assert(carla_min(2, -1, 0) == 0);

  338.     assert(carla_min(2,  0, 0) == 0);

  339.     assert(carla_min(2,  1, 0) == 1);

  340.     assert(carla_min(2,  2, 0) == 2);

  341. 

  342.     assert(carla_min(5, -6, 3) == 3);

  343.     assert(carla_min(5, -5, 3) == 3);

  344.     assert(carla_min(5, -4, 3) == 3);

  345.     assert(carla_min(5, -3, 3) == 3);

  346.     assert(carla_min(5, -2, 3) == 3);

  347.     assert(carla_min(5, -1, 3) == 3);

  348.     assert(carla_min(5,  0, 3) == 3);

  349.     assert(carla_min(5,  1, 3) == 3);

  350.     assert(carla_min(5,  2, 3) == 3);

  351.     assert(carla_min(5,  3, 3) == 3);

  352.     assert(carla_min(5,  4, 3) == 4);

  353.     assert(carla_min(5,  5, 3) == 5);

  354.     assert(carla_min(5,  6, 3) == 5);

  355. 

  356.     assert(carla_min(5, -6, -3) == -3);

  357.     assert(carla_min(5, -5, -3) == -3);

  358.     assert(carla_min(5, -4, -3) == -3);

  359.     assert(carla_min(5, -3, -3) == -3);

  360.     assert(carla_min(5, -2, -3) == -2);

  361.     assert(carla_min(5, -1, -3) == -1);

  362.     assert(carla_min(5,  0, -3) == 0);

  363.     assert(carla_min(5,  1, -3) == 1);

  364.     assert(carla_min(5,  2, -3) == 2);

  365.     assert(carla_min(5,  3, -3) == 3);

  366.     assert(carla_min(5,  4, -3) == 4);

  367.     assert(carla_min(5,  5, -3) == 5);

  368.     assert(carla_min(5,  6, -3) == 5);

  369. 

  370.     // Return the lower positive of 2 values.

  371.     assert(carla_minPositive(0, 0) == 0);

  372.     assert(carla_minPositive(0, 1) == 0);

  373.     assert(carla_minPositive(0, 2) == 0);

  374.     assert(carla_minPositive(0, 3) == 0);

  375. 

  376.     assert(carla_minPositive(1, 0) == 0);

  377.     assert(carla_minPositive(1, 1) == 1);

  378.     assert(carla_minPositive(1, 2) == 1);

  379.     assert(carla_minPositive(1, 3) == 1);

  380. 

  381.     assert(carla_minPositive(3, 0) == 0);

  382.     assert(carla_minPositive(3, 1) == 1);

  383.     assert(carla_minPositive(3, 2) == 2);

  384.     assert(carla_minPositive(3, 3) == 3);

  385. 

  386.     assert(carla_minPositive(-1, 0) == 0);

  387.     assert(carla_minPositive(-1, 1) == 1);

  388.     assert(carla_minPositive(-1, 2) == 2);

  389.     assert(carla_minPositive(-1, 3) == 3);

  390. 

  391.     // Return the higher of 2 values, with 'max' as the maximum possible value.

  392.     assert(carla_max(0, 0, 0) == 0);

  393.     assert(carla_max(0, 3, 0) == 0);

  394.     assert(carla_max(3, 0, 0) == 0);

  395. 

  396.     assert(carla_max(0, 0, 3) == 0);

  397.     assert(carla_max(0, 1, 3) == 1);

  398.     assert(carla_max(0, 2, 3) == 2);

  399.     assert(carla_max(0, 3, 3) == 3);

  400.     assert(carla_max(0, 4, 3) == 3);

  401. 

  402.     assert(carla_max(5, 0, 3) == 3);

  403.     assert(carla_max(5, 1, 3) == 3);

  404.     assert(carla_max(5, 2, 3) == 3);

  405.     assert(carla_max(5, 3, 3) == 3);

  406.     assert(carla_max(5, 4, 3) == 3);

  407.     assert(carla_max(5, 5, 3) == 3);

  408.     assert(carla_max(5, 6, 3) == 3);

  409. 

  410.     // Fix bounds of 'value' between 'min' and 'max'.

  411.     assert(carla_fixValue(0, 1, -1) == 0);

  412.     assert(carla_fixValue(0, 1,  0) == 0);

  413.     assert(carla_fixValue(0, 1,  1) == 1);

  414.     assert(carla_fixValue(0, 1,  2) == 1);

  415. 

  416.     assert(carla_fixValue(0.0, 1.0, -1.0) == 0.0);

  417.     assert(carla_fixValue(0.0, 1.0,  0.0) == 0.0);

  418.     assert(carla_fixValue(0.0, 1.0,  1.0) == 1.0);

  419.     assert(carla_fixValue(0.0, 1.0,  2.0) == 1.0);

  420. 

  421.     assert(carla_fixValue(0.0, 1.0, -0.1) == 0.0);

  422.     assert(carla_fixValue(0.0, 1.0,  1.1) == 1.0);

  423. 

  424.     // Get next power of 2.

  425.     assert(carla_nextPowerOf2(0) == 0);

  426.     assert(carla_nextPowerOf2(1) == 1);

  427.     assert(carla_nextPowerOf2(2) == 2);

  428.     assert(carla_nextPowerOf2(4) == 4);

  429.     assert(carla_nextPowerOf2(5) == 8);

  430.     assert(carla_nextPowerOf2(6) == 8);

  431.     assert(carla_nextPowerOf2(7) == 8);

  432.     assert(carla_nextPowerOf2(8) == 8);

  433.     assert(carla_nextPowerOf2(9) == 16);

  434. 

  435.     uint32_t power = 1;

  436.     assert((power = carla_nextPowerOf2(power+1)) == 2);

  437.     assert((power = carla_nextPowerOf2(power+1)) == 4);

  438.     assert((power = carla_nextPowerOf2(power+1)) == 8);

  439.     assert((power = carla_nextPowerOf2(power+1)) == 16);

  440.     assert((power = carla_nextPowerOf2(power+1)) == 32);

  441.     assert((power = carla_nextPowerOf2(power+1)) == 64);

  442.     assert((power = carla_nextPowerOf2(power+1)) == 128);

  443.     assert((power = carla_nextPowerOf2(power+1)) == 256);

  444.     assert((power = carla_nextPowerOf2(power+1)) == 512);

  445.     assert((power = carla_nextPowerOf2(power+1)) == 1024);

  446.     assert((power = carla_nextPowerOf2(power+1)) == 2048);

  447.     assert((power = carla_nextPowerOf2(power+1)) == 4096);

  448.     assert((power = carla_nextPowerOf2(power+1)) == 8192);

  449.     assert((power = carla_nextPowerOf2(power+1)) == 16384);

  450.     assert((power = carla_nextPowerOf2(power+1)) == 32768);

  451.     assert((power = carla_nextPowerOf2(power+1)) == 65536);

  452.     assert((power = carla_nextPowerOf2(power+1)) == 131072);

  453. 

  454.     // -------------------------------------------------------------------

  455.     // math functions (extended)

  456. 

  457.     // carla_addFloat, carla_copyFloat & carla_zeroFloat tests skipped

  458.     // mostly unused due to juce::FloatVectorOperations

  459. }

  460. 

  461. // -----------------------------------------------------------------------

  462. 

  463. static void test_CarlaBackendUtils() noexcept

  464. {

  465.     CARLA_BACKEND_USE_NAMESPACE

  466.     carla_stdout(PluginOption2Str(PLUGIN_OPTION_FIXED_BUFFERS));

  467.     carla_stdout(BinaryType2Str(BINARY_NONE));

  468.     carla_stdout(PluginType2Str(PLUGIN_NONE));

  469.     carla_stdout(PluginCategory2Str(PLUGIN_CATEGORY_NONE));

  470.     carla_stdout(ParameterType2Str(PARAMETER_UNKNOWN));

  471.     carla_stdout(InternalParameterIndex2Str(PARAMETER_NULL));

  472.     carla_stdout(EngineCallbackOpcode2Str(ENGINE_CALLBACK_DEBUG));

  473.     carla_stdout(EngineOption2Str(ENGINE_OPTION_DEBUG));

  474.     carla_stdout(EngineProcessMode2Str(ENGINE_PROCESS_MODE_SINGLE_CLIENT));

  475.     carla_stdout(EngineTransportMode2Str(ENGINE_TRANSPORT_MODE_INTERNAL));

  476.     carla_stdout(FileCallbackOpcode2Str(FILE_CALLBACK_DEBUG));

  477.     carla_stdout(getPluginTypeAsString(PLUGIN_INTERNAL));

  478.     carla_stdout(PatchbayIcon2Str(PATCHBAY_ICON_APPLICATION));

  479.     getPluginTypeFromString("none");

  480.     getPluginCategoryFromName("cat");

  481. }

  482. 

  483. // -----------------------------------------------------------------------

  484. 

  485. static void test_CarlaEngineUtils() noexcept

  486. {

  487.     CARLA_BACKEND_USE_NAMESPACE

  488.     carla_stdout(EngineType2Str(kEngineTypeNull));

  489.     carla_stdout(EnginePortType2Str(kEnginePortTypeNull));

  490.     carla_stdout(EngineEventType2Str(kEngineEventTypeNull));

  491.     carla_stdout(EngineControlEventType2Str(kEngineControlEventTypeNull));

  492. }

  493. 

  494. // -----------------------------------------------------------------------

  495. 

  496. static void test_CarlaLadspaUtils()

  497. {

  498.     LADSPA_Descriptor desc;

  499.     carla_zeroStruct(desc);

  500. 

  501.     LADSPA_RDF_Descriptor rdfDesc;

  502.     delete ladspa_rdf_dup(&rdfDesc);

  503. 

  504.     is_ladspa_port_good(0x0, 0x0);

  505.     is_ladspa_rdf_descriptor_valid(&rdfDesc, &desc);

  506.     get_default_ladspa_port_value(0x0, -1.0f, 1.0f);

  507. }

  508. 

  509. // -----------------------------------------------------------------------

  510. 

  511. namespace dssi_juce {

  512. const char* find_dssi_ui(const char* const filename, const char* const label) noexcept;

  513. #define HAVE_JUCE

  514. #include "CarlaDssiUtils.cpp"

  515. }

  516. 

  517. namespace dssi_qt {

  518. const char* find_dssi_ui(const char* const filename, const char* const label) noexcept;

  519. #undef HAVE_JUCE

  520. #include "CarlaDssiUtils.cpp"

  521. }

  522. 

  523. static void test_CarlaDssiUtils() noexcept

  524. {

  525.     const char* const ui_juce = dssi_juce::find_dssi_ui("/usr/lib/dssi/trivial_sampler.so", "aa");

  526.     const char* const ui_qt   = dssi_qt::find_dssi_ui("/usr/lib/dssi/trivial_sampler.so", "aa");

  527. 

  528.     CARLA_SAFE_ASSERT(ui_juce != nullptr);

  529.     CARLA_SAFE_ASSERT(ui_qt != nullptr);

  530. 

  531.     if (ui_juce != nullptr)

  532.     {

  533.         carla_stdout("%s", ui_juce);

  534.         assert(std::strcmp(ui_juce, "/usr/lib/dssi/trivial_sampler/trivial_sampler_qt") == 0);

  535.         delete[] ui_juce;

  536.     }

  537. 

  538.     if (ui_qt != nullptr)

  539.     {

  540.         carla_stdout("%s", ui_qt);

  541.         assert(std::strcmp(ui_qt, "/usr/lib/dssi/trivial_sampler/trivial_sampler_qt") == 0);

  542.         delete[] ui_qt;

  543.     }

  544. }

  545. 

  546. // -----------------------------------------------------------------------

  547. 

  548. static LV2_URID test_lv2_uridMap(LV2_URID_Map_Handle, const char*)

  549. {

  550.     return 1;

  551. }

  552. 

  553. static void test_CarlaLv2Utils()

  554. {

  555.     Lv2WorldClass& lv2World(Lv2WorldClass::getInstance());

  556.     lv2World.initIfNeeded();

  557. 

  558.     // getPlugin

  559.     const LilvPlugin* const plugin(lv2World.getPlugin("urn:juced:DrumSynth"));

  560.     CARLA_SAFE_ASSERT(plugin != nullptr);

  561. 

  562.     // getState

  563.     LV2_URID_Map uridMap = { nullptr, test_lv2_uridMap };

  564.     LilvState* const state(lv2World.getState("http://arcticanaudio.com/plugins/thefunction#preset001", &uridMap));

  565.     CARLA_SAFE_ASSERT(state != nullptr);

  566.     if (state != nullptr) lilv_state_free(state);

  567. 

  568.     // load a bunch of plugins to stress test lilv

  569.     delete lv2_rdf_new("http://arcticanaudio.com/plugins/thefunction", true);

  570.     delete lv2_rdf_new("http://kunz.corrupt.ch/products/tal-noisemaker", true);

  571.     delete lv2_rdf_new("http://calf.sourceforge.net/plugins/Reverb", true);

  572.     delete lv2_rdf_new("http://www.openavproductions.com/fabla", true);

  573.     delete lv2_rdf_new("http://invadarecords.com/plugins/lv2/meter", true);

  574.     delete lv2_rdf_new("http://gareus.org/oss/lv2/meters#spectr30stereo", true);

  575.     delete lv2_rdf_new("http://plugin.org.uk/swh-plugins/revdelay", true);

  576.     delete lv2_rdf_new("http://lv2plug.in/plugins/eg-scope#Stereo", true);

  577.     delete lv2_rdf_new("http://kxstudio.sf.net/carla/plugins/carlarack", true);

  578.     delete lv2_rdf_new("http://guitarix.sourceforge.net/plugins/gxautowah#autowah", true);

  579.     delete lv2_rdf_new("http://github.com/blablack/ams-lv2/mixer_4ch", true);

  580.     delete lv2_rdf_new("http://drumgizmo.org/lv2", true);

  581.     delete lv2_rdf_new("http://synthv1.sourceforge.net/lv2", true);

  582.     delete lv2_rdf_new("urn:juced:DrumSynth", true);

  583. 

  584.     // misc

  585.     is_lv2_port_supported(0x0);

  586.     is_lv2_feature_supported("test1");

  587.     is_lv2_ui_feature_supported("test2");

  588. }

  589. 

  590. // -----------------------------------------------------------------------

  591. 

  592. static intptr_t test_vst_dispatcher(AEffect*, int, int, intptr_t, void*, float)

  593. {

  594.     return 0;

  595. }

  596. 

  597. static void test_CarlaVstUtils() noexcept

  598. {

  599.     AEffect effect;

  600.     carla_zeroStruct(effect);

  601.     effect.dispatcher = test_vst_dispatcher;

  602. 

  603.     vstPluginCanDo(&effect, "test");

  604.     carla_stdout(vstEffectOpcode2str(effOpen));

  605.     carla_stdout(vstMasterOpcode2str(audioMasterAutomate));

  606. }

  607. #endif

  608. 

  609. // -----------------------------------------------------------------------

  610. 

  611. static void test_CarlaBridgeUtils() noexcept

  612. {

  613.     carla_stdout(PluginBridgeInfoType2str(kPluginBridgePong));

  614.     carla_stdout(PluginBridgeOpcode2str(kPluginBridgeOpcodeNull));

  615. }

  616. 

  617. #if 0

  618. // -----------------------------------------------------------------------

  619. 

  620. static void test_CarlaLibUtils() noexcept

  621. {

  622.     void* const libNot = lib_open("/libzzzzz...");

  623.     assert(libNot == nullptr);

  624.     carla_stdout("Force lib_open fail error results in: %s", lib_error("/libzzzzz..."));

  625. 

  626.     void* const lib = lib_open("/usr/lib/liblo.so");

  627.     CARLA_SAFE_ASSERT_RETURN(lib != nullptr,);

  628. 

  629.     void* const libS = lib_symbol(lib, "lo_server_new");

  630.     CARLA_SAFE_ASSERT(libS != nullptr);

  631. 

  632.     const bool closed = lib_close(lib);

  633.     CARLA_SAFE_ASSERT(closed);

  634. 

  635.     LibCounter lc;

  636.     void* const test1 = lc.open("/usr/lib/liblo.so");

  637.     void* const test2 = lc.open("/usr/lib/liblo.so");

  638.     void* const test3 = lc.open("/usr/lib/liblo.so");

  639.     assert(test1 == test2);

  640.     assert(test2 == test3);

  641.     lc.close(test1); lc.close(test2); lc.close(test3);

  642. 

  643.     // test if the pointer changes after all closed

  644.     void* const test1b = lc.open("/usr/lib/liblo.so");

  645.     assert(test1 != test1b);

  646.     lc.close(test1b);

  647. 

  648.     // test non-delete flag

  649.     void* const test4 = lc.open("/usr/lib/liblrdf.so.0", false);

  650.     lc.close(test4);

  651.     void* const test5 = lc.open("/usr/lib/liblrdf.so.0");

  652.     assert(test4 == test5);

  653.     lc.close(test5);

  654. 

  655.     // open non-delete a few times, tests for cleanup on destruction

  656.     lc.open("/usr/lib/liblrdf.so.0");

  657.     lc.open("/usr/lib/liblrdf.so.0");

  658.     lc.open("/usr/lib/liblrdf.so.0");

  659. }

  660. 

  661. // -----------------------------------------------------------------------

  662. 

  663. struct ShmStruct {

  664.     char stringStart[255];

  665.     bool boolean;

  666.     int integer;

  667.     float floating;

  668.     char stringEnd[255];

  669. };

  670. 

  671. static void test_CarlaShmUtils() noexcept

  672. {

  673.     shm_t shm, shma;

  674.     ShmStruct* shmStruct1;

  675.     ShmStruct* shmStruct2;

  676. 

  677.     // base tests first

  678.     carla_shm_init(shm);

  679.     assert(! carla_is_shm_valid(shm));

  680. 

  681.     shm = carla_shm_create("/carla-shm-test1");

  682.     carla_stdout("test %i", shm);

  683.     assert(carla_is_shm_valid(shm));

  684. 

  685.     carla_shm_close(shm);

  686.     assert(! carla_is_shm_valid(shm));

  687. 

  688.     shm = carla_shm_create("/carla-shm-test1");

  689.     assert(carla_is_shm_valid(shm));

  690. 

  691.     shma = carla_shm_attach("/carla-shm-test1");

  692.     assert(carla_is_shm_valid(shma));

  693. 

  694.     carla_shm_close(shm);

  695.     carla_shm_close(shma);

  696.     assert(! carla_is_shm_valid(shm));

  697.     assert(! carla_is_shm_valid(shma));

  698. 

  699.     // test attach invalid

  700.     shma = carla_shm_attach("/carla-shm-test-NOT");

  701.     assert(! carla_is_shm_valid(shma));

  702. 

  703.     // test memory, start

  704.     shm = carla_shm_create("/carla-shm-test1");

  705.     assert(carla_is_shm_valid(shm));

  706. 

  707.     shma = carla_shm_attach("/carla-shm-test1");

  708.     assert(carla_is_shm_valid(shma));

  709. 

  710.     // test memory, check valid

  711.     shmStruct1 = carla_shm_map<ShmStruct>(shm);

  712.     assert(shmStruct1 != nullptr);

  713. 

  714.     shmStruct2 = carla_shm_map<ShmStruct>(shma);

  715.     assert(shmStruct2 != nullptr);

  716. 

  717.     carla_shm_unmap(shma, shmStruct2);

  718.     assert(shmStruct2 == nullptr);

  719. 

  720.     carla_shm_unmap(shm, shmStruct1);

  721.     assert(shmStruct1 == nullptr);

  722. 

  723.     // test memory, check if write data matches

  724.     shmStruct1 = carla_shm_map<ShmStruct>(shm);

  725.     assert(shmStruct1 != nullptr);

  726. 

  727.     shmStruct2 = carla_shm_map<ShmStruct>(shma);

  728.     assert(shmStruct2 != nullptr);

  729. 

  730.     carla_zeroStruct(*shmStruct1);

  731.     assert(shmStruct1->stringStart[0] == '\0');

  732.     assert(shmStruct2->stringStart[0] == '\0');

  733.     assert(shmStruct1->stringEnd[0] == '\0');

  734.     assert(shmStruct2->stringEnd[0] == '\0');

  735.     assert(! shmStruct1->boolean);

  736.     assert(! shmStruct2->boolean);

  737. 

  738.     shmStruct1->boolean = true;

  739.     shmStruct1->integer = 232312;

  740.     assert(shmStruct1->boolean == shmStruct2->boolean);

  741.     assert(shmStruct1->integer == shmStruct2->integer);

  742. 

  743.     shmStruct2->floating = 2342.231f;

  744.     std::strcpy(shmStruct2->stringStart, "test1start");

  745.     std::strcpy(shmStruct2->stringEnd, "test2end");

  746.     assert(shmStruct1->floating == shmStruct2->floating);

  747.     assert(std::strcmp(shmStruct1->stringStart, "test1start") == 0);

  748.     assert(std::strcmp(shmStruct1->stringStart, shmStruct2->stringStart) == 0);

  749.     assert(std::strcmp(shmStruct1->stringEnd, "test2end") == 0);

  750.     assert(std::strcmp(shmStruct1->stringEnd, shmStruct2->stringEnd) == 0);

  751. 

  752.     carla_shm_unmap(shma, shmStruct2);

  753.     assert(shmStruct2 == nullptr);

  754. 

  755.     carla_shm_unmap(shm, shmStruct1);

  756.     assert(shmStruct1 == nullptr);

  757. 

  758.     // test memory, done

  759.     carla_shm_close(shm);

  760.     carla_shm_close(shma);

  761.     assert(! carla_is_shm_valid(shm));

  762.     assert(! carla_is_shm_valid(shma));

  763. }

  764. #endif

  765. 

  766. // -----------------------------------------------------------------------

  767. // main

  768. 

  769. int main()

  770. {

  771. #if 0

  772.     // already tested, skip for now

  773.     test_CarlaUtils();

  774.     test_CarlaMathUtils();

  775. 

  776.     test_CarlaBackendUtils();

  777.     test_CarlaEngineUtils();

  778. 

  779.     test_CarlaLadspaUtils();

  780.     test_CarlaDssiUtils();

  781.     test_CarlaLv2Utils();

  782.     test_CarlaVstUtils();

  783. #endif

  784. 

  785.     test_CarlaBridgeUtils();

  786.     //test_CarlaLibUtils();

  787.     //test_CarlaShmUtils();

  788. 

  789.     return 0;

  790. }

  791. 

  792. // -----------------------------------------------------------------------