Add bare-minimum extension-reaper-macos REAPER extension skeleton

C/C++ extension built directly against the vendored Cockos reaper-sdk
headers (no Rust/reaper-rs wrapper layer). Loads, registers a test
action, and confirms via REAPER's console — confirmed working in
REAPER 2026-07-15.

Co-Authored-By: Claude Sonnet 5 <noreply@anthropic.com>
This commit is contained in:
Paul Lipscomb
2026-07-15 19:12:33 -04:00
parent 7ecc718f5d
commit cd5ebd84d6
512 changed files with 330043 additions and 1 deletions
+133
View File
@@ -0,0 +1,133 @@
/*
WDL - sha.cpp
Copyright (C) 2005 and later, Cockos Incorporated
This software is provided 'as-is', without any express or implied
warranty. In no event will the authors be held liable for any damages
arising from the use of this software.
Permission is granted to anyone to use this software for any purpose,
including commercial applications, and to alter it and redistribute it
freely, subject to the following restrictions:
1. The origin of this software must not be misrepresented; you must not
claim that you wrote the original software. If you use this software
in a product, an acknowledgment in the product documentation would be
appreciated but is not required.
2. Altered source versions must be plainly marked as such, and must not be
misrepresented as being the original software.
3. This notice may not be removed or altered from any source distribution.
*/
/*
This file provides the implementation to the WDL_SHA1 object, which performs SHA-1 hashes
on data.
*/
#include "sha.h"
/// sha
WDL_SHA1::WDL_SHA1()
{
reset();
}
void WDL_SHA1::reset()
{
lenW = 0;
size[0] = size[1] = 0;
H[0] = 0x67452301;
H[1] = 0xefcdab89;
H[2] = 0x98badcfe;
H[3] = 0x10325476;
H[4] = 0xc3d2e1f0;
int x;
for (x = 0; x < (int)(sizeof(W)/sizeof(W[0])); x ++) W[x]=0;
}
#define SHA_ROTL(X,n) ((((X)&0xffffffff) << (n)) | (((X)&0xffffffff) >> (32-(n))))
#define SHUFFLE() E = D; D = C; C = SHA_ROTL(B, 30); B = A; A = TEMP
void WDL_SHA1::add(const void *data, int datalen)
{
int i;
for (i = 0; i < datalen; i++)
{
W[lenW / 4] <<= 8;
W[lenW / 4] |= (unsigned int)((const unsigned char *)data)[i];
if (!(++lenW & 63))
{
int t;
unsigned int A = H[0];
unsigned int B = H[1];
unsigned int C = H[2];
unsigned int D = H[3];
unsigned int E = H[4];
for (t = 16; t < 80; t++) W[t] = SHA_ROTL(W[t-3] ^ W[t-8] ^ W[t-14] ^ W[t-16], 1);
for (t = 0; t < 20; t++)
{
unsigned int TEMP = SHA_ROTL(A,5) + E + W[t] + 0x5a827999 + (((C^D)&B)^D);
SHUFFLE();
}
for (; t < 40; t++)
{
unsigned int TEMP = SHA_ROTL(A,5) + E + W[t] + 0x6ed9eba1 + (B^C^D);
SHUFFLE();
}
for (; t < 60; t++)
{
unsigned int TEMP = SHA_ROTL(A,5) + E + W[t] + 0x8f1bbcdc + ((B&C)|(D&(B|C)));
SHUFFLE();
}
for (; t < 80; t++)
{
unsigned int TEMP = SHA_ROTL(A,5) + E + W[t] + 0xca62c1d6 + (B^C^D);
SHUFFLE();
}
H[0] += A;
H[1] += B;
H[2] += C;
H[3] += D;
H[4] += E;
lenW = 0;
}
size[0] += 8;
if (size[0] < 8) size[1]++;
}
}
void WDL_SHA1::result(void *out)
{
unsigned char pad0x80 = 0x80;
unsigned char pad0x00 = 0x00;
unsigned char padlen[8];
int i;
padlen[0] = (unsigned char)((size[1] >> 24) & 0xff);
padlen[1] = (unsigned char)((size[1] >> 16) & 0xff);
padlen[2] = (unsigned char)((size[1] >> 8) & 0xff);
padlen[3] = (unsigned char)((size[1]) & 0xff);
padlen[4] = (unsigned char)((size[0] >> 24) & 0xff);
padlen[5] = (unsigned char)((size[0] >> 16) & 0xff);
padlen[6] = (unsigned char)((size[0] >> 8) & 0xff);
padlen[7] = (unsigned char)((size[0]) & 0xff);
add(&pad0x80, 1);
while (lenW != 56) add(&pad0x00, 1);
add(padlen, 8);
for (i = 0; i < 20; i++)
{
((unsigned char *)out)[i] = (unsigned char)(H[i / 4] >> 24);
H[i / 4] <<= 8;
}
reset();
}