initial import
29
README.md
@ -1,2 +1,27 @@
|
||||
# asid
|
||||
Orastron A-SID
|
||||
# A-SID
|
||||
|
||||
Turn your C64 into a wah effect.
|
||||
|
||||
You can find information and instructions [here](https://www.orastron.com/asid).
|
||||
|
||||
## Subfolders
|
||||
|
||||
* c64: the C64 program source;
|
||||
* img2c64: browser-based tool that converts regular images to C64 hi-res bitmaps and colormaps and lets you quickly swap foreground/background color choice for each 8x8 tile;
|
||||
* measure: BASIC program to control the C64 filter and output gain stage - actual measurements of the MOS 8580 chip in our C64 (C64C, ser. no. HB41416598E, made in Hong Kong) are available [here](TBD);
|
||||
* octave: various GNU Octave scripts to generate program data, extract IRs, and simulate the MOS 8580 SID analog filter, output gain stange, and output buffer;
|
||||
* spice: LTspice schematics of the MOS 8580 SID analog filter, output gain stage, and output buffer;
|
||||
* src: A-SID sound engine with a full virtual analog model of the MOS 8580 analog filter, output gain stage, and output buffer, both implemented in C;
|
||||
* vst3: VST3-related part of A-SID, using a code and build script template to develop and build VST3 plugins outisde the original SDK.
|
||||
|
||||
## Legal
|
||||
|
||||
Copyright (C) 2021, 2022 Orastron srl unipersonale.
|
||||
|
||||
Authors: Stefano D'Angelo, Paolo Marrone.
|
||||
|
||||
All the code in the repo is released under GPLv3. See the COPYING file.
|
||||
|
||||
VST is a registered trademark of Steinberg Media Technologies GmbH.
|
||||
|
||||
All trademarks and registered marks are properties of their respective owners. All company, product, and service names used are for identification purposes only. Use of these names, trademarks, and brands does not imply endorsement.
|
||||
|
8
c64/Makefile
Normal file
@ -0,0 +1,8 @@
|
||||
asid.prg: asid.asm boot.prg barmapping.dat cutoffmapping.dat lfoscaling.dat bitmap.dat colormap1.dat colormap2.dat colormap3.dat colormap4.dat
|
||||
acme asid.asm
|
||||
|
||||
boot.prg: boot.bas
|
||||
bas2prg < boot.bas > boot.prg
|
||||
|
||||
%.dat: ../octave/%.m
|
||||
octave $<
|
564
c64/asid.asm
Normal file
@ -0,0 +1,564 @@
|
||||
; A-SID - C64 bandpass filter + LFO
|
||||
;
|
||||
; Copyright (C) 2022 Orastron srl unipersonale
|
||||
;
|
||||
; A-SID is free software: you can redistribute it and/or modify
|
||||
; it under the terms of the GNU General Public License as published by
|
||||
; the Free Software Foundation, version 3 of the License.
|
||||
;
|
||||
; A-SID 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 for more details.
|
||||
;
|
||||
; You should have received a copy of the GNU General Public License
|
||||
; along with A-SID. If not, see <http://www.gnu.org/licenses/>.
|
||||
;
|
||||
; File author: Stefano D'Angelo
|
||||
|
||||
!cpu 6502
|
||||
!to "asid.prg",cbm
|
||||
|
||||
; memory map
|
||||
; $fb,$fc: used for indirect Y addressing
|
||||
; $0801-$1fff: BASIC code
|
||||
; $2000-$2eff: machine language code
|
||||
; $2f00-$2fff: machine code paddle read routine
|
||||
; $3000-$3fff: lfo scaling data (16 sets of 256 elements)
|
||||
; $4000-$43e7: colormap 1 (green)
|
||||
; $4400-$47e7: colormap 2 (blue)
|
||||
; $4800-$4be7: colormap 3 (violet)
|
||||
; $4c00-$4fe7: colormap 4 (red)
|
||||
; $6000-$7f3f: bitmap
|
||||
; $7f40-$7f43: parameter colors
|
||||
; $7f50-$7f5f: lfo phase increments
|
||||
; $8000-$80ff: paddle mapping data (256 elements, set by boot program)
|
||||
; $8100-$81ff: bar length in pixels, lookup data (256 elements)
|
||||
; $8200-$83ff: cutoff to SID mapping lookup table (256 low byte entries followed by corresponding 256 high byte entries)
|
||||
; $c000: cutoff frequency parameter (0-15)
|
||||
; $c001: lfo amount parameter (0-15)
|
||||
; $c002: lfo speed parameter (0-15)
|
||||
; $c003: current parameter index (0-2)
|
||||
; $c004: current number of update iterations in main loop
|
||||
; $c005: number of iterations left to trigger left joystick event
|
||||
; $c006: number of iterations left to trigger right joystick event
|
||||
; $c008-$c00a: parameters for routines
|
||||
; $c00c: current modulated cutoff value (0-255)
|
||||
; $c00e: current colormap index
|
||||
; $c00f: current parameter color
|
||||
; $c010: lfo phase (0-255)
|
||||
; $c011: lfo output (signed)
|
||||
; $c014: 1 if paddle is present, 0 if not (set by boot program)
|
||||
; $c015: paddle min value (set by boot program)
|
||||
; $c016: paddle max value (set by boot program)
|
||||
; $c017: mapped paddle value [-127,127]
|
||||
; $c018: bar length in pixels
|
||||
; $c019: number of bar lines left to draw
|
||||
; $c01a: unmapped paddle value
|
||||
|
||||
* = $0801 ; BASIC code
|
||||
!binary "boot.prg",,2
|
||||
|
||||
* = $2000 ; machine language code
|
||||
|
||||
.vic_setup:
|
||||
; set hi res mode
|
||||
lda #$3b
|
||||
sta $d011
|
||||
lda #$08
|
||||
sta $d016
|
||||
; set VIC bank
|
||||
lda $dd00
|
||||
and #%11111100
|
||||
ora #%00000010
|
||||
sta $dd00
|
||||
|
||||
.sid_setup:
|
||||
; full volume, bp filter mode
|
||||
lda #$2f
|
||||
sta $d418
|
||||
; res=15, external input to filter
|
||||
lda #$f8
|
||||
sta $d417
|
||||
|
||||
.initial_setup:
|
||||
lda #$f
|
||||
sta $c000 ; default cutoff frequency = 15
|
||||
lda #$0
|
||||
sta $c001 ; default lfo amount = 0
|
||||
lda #$7
|
||||
sta $c002 ; default lfo speed = 7
|
||||
lda #$00
|
||||
sta $c003 ; default parameter = 0 (cutoff)
|
||||
lda #$00
|
||||
sta $c010 ; intiial lfo phase = 0
|
||||
; set 8 iterations left per left/right joystick events
|
||||
lda #$03
|
||||
sta $c005
|
||||
sta $c006
|
||||
|
||||
.main_loop:
|
||||
ldy $dc01 ; read joystick port 1
|
||||
|
||||
.joystick_left:
|
||||
tya ; put joystick byte in A
|
||||
and #$04 ; zero if left
|
||||
bne .joystick_left_reset ; if != 0 reset and skip
|
||||
dec $c005 ; decrement event counter
|
||||
bne .joystick_right ; if != 0 skip
|
||||
lda $c003 ; get current parameter index -> A
|
||||
beq .joystick_left_wrap ; if = 0, see below...
|
||||
sec
|
||||
sbc #$01 ; if != 0, subtract 1
|
||||
jmp .joystick_left_end
|
||||
.joystick_left_wrap:
|
||||
lda #$02 ; ... wrap
|
||||
.joystick_left_end:
|
||||
sta $c003 ; save current parameter index
|
||||
.joystick_left_reset:
|
||||
lda #$03
|
||||
sta $c005 ; reset event counter
|
||||
|
||||
.joystick_right:
|
||||
tya ; put joystick byte in A
|
||||
and #$08 ; zero if right
|
||||
bne .joystick_right_reset ; if != 0 reset and skip
|
||||
dec $c006 ; decrement event counter
|
||||
bne .joystick_up ; if != 0 skip
|
||||
lda $c003 ; get current parameter index -> A
|
||||
cmp #$02
|
||||
beq .joystick_right_wrap ; if = 2, see below...
|
||||
clc
|
||||
adc #$01 ; if != 2, add 1
|
||||
jmp .joystick_right_end
|
||||
.joystick_right_wrap:
|
||||
lda #$00 ; ... wrap
|
||||
.joystick_right_end:
|
||||
sta $c003 ; save current parameter index
|
||||
.joystick_right_reset:
|
||||
lda #$03
|
||||
sta $c006 ; reset event counter
|
||||
|
||||
.joystick_up:
|
||||
tya ; put joystick byte in A
|
||||
and #$01 ; zero if up
|
||||
bne .joystick_down ; if non-zero skip
|
||||
ldx $c003 ; get current parameter index -> X
|
||||
lda $c000,X ; get current value -> A
|
||||
cmp #$f
|
||||
beq .joystick_down ; if max skip
|
||||
inc $c000,X ; increment parameter value
|
||||
|
||||
.joystick_down:
|
||||
tya ; put joystick byte in A
|
||||
and #$02 ; zero if down
|
||||
bne .paddle ; if non-zero skip
|
||||
ldx $c003 ; get current parameter index -> X
|
||||
lda $c000,X ; get current value
|
||||
beq .paddle ; if zero skip
|
||||
dec $c000,X ; decrement parameter value
|
||||
|
||||
.paddle:
|
||||
lda #$0
|
||||
sta $c017 ; store 0 as paddle value
|
||||
lda $c014 ; get paddle is present -> A
|
||||
beq .io_end ; if not present skip
|
||||
|
||||
jsr $2f00 ; call paddle read routine
|
||||
lda $c01a ; get paddle x value -> A
|
||||
|
||||
.paddle_min:
|
||||
cmp $c015 ; compare with minimum
|
||||
bcs .paddle_max ; if >= minimum jump ahead
|
||||
lda $c015 ; put minimum -> A
|
||||
jmp .paddle_map ; jump to mapping code
|
||||
.paddle_max:
|
||||
cmp $c016 ; compare with maximum
|
||||
bcc .paddle_map ; if < maximum jump ahead
|
||||
lda $c016 ; put maximum -> A
|
||||
.paddle_map:
|
||||
tax ; copy A -> X
|
||||
lda $8000,X ; get mapped value -> A
|
||||
sta $c017 ; store mapped paddle value
|
||||
|
||||
.io_end:
|
||||
lda #$04
|
||||
sta $c004 ; set 4 number of update iterations in main loop
|
||||
|
||||
.lfo:
|
||||
lda $c010 ; get lfo phase -> A
|
||||
ldx $c002 ; get lfo speed -> X
|
||||
clc
|
||||
adc $7f50,X ; add lfo phase increment
|
||||
sta $c010 ; store lfo phase
|
||||
tay ; and also store it in Y
|
||||
lda $c001 ; get lfo amount -> A
|
||||
clc
|
||||
adc #$30 ; add #$30
|
||||
sta $fc ; and store result into $fc
|
||||
lda #$0
|
||||
sta $fb ; store 0 into $fb
|
||||
lda ($fb),Y ; get scaled lfo -> A
|
||||
sta $c011 ; and store it into $c011
|
||||
|
||||
.cutoff_compute:
|
||||
lda $c000 ; get cutoff frequency parameter -> A
|
||||
asl
|
||||
asl
|
||||
asl
|
||||
asl ; << 4
|
||||
ora #$08 ; | 8
|
||||
tax ; copy A -> X
|
||||
|
||||
.cutoff_compute_paddle:
|
||||
lda $c017 ; get mapped paddle value -> A
|
||||
cmp #$80 ; compare with #$80
|
||||
bcs .cutoff_compute_paddle_neg ; if gte then paddle is negative and jump below
|
||||
txa ; copy X -> A
|
||||
clc
|
||||
adc $c017 ; add paddle value
|
||||
bcc .cutoff_compute_paddle_end ; if no overflow jump below
|
||||
lda #$ff ; put #$ff -> A
|
||||
jmp .cutoff_compute_paddle_end ; jump below
|
||||
.cutoff_compute_paddle_neg:
|
||||
txa ; copy X -> A
|
||||
clc
|
||||
adc $c017 ; add paddle value
|
||||
bcs .cutoff_compute_paddle_end ; if overflow jump below
|
||||
lda #$00 ; put 0 -> A
|
||||
.cutoff_compute_paddle_end:
|
||||
tax ; copy A -> X
|
||||
|
||||
.cutoff_compute_lfo:
|
||||
lda $c011 ; get lfo output -> A
|
||||
cmp #$80 ; compare with #$80
|
||||
bcs .cutoff_compute_lfo_neg ; if gte then lfo is negative and jump below
|
||||
txa ; copy X -> A
|
||||
clc
|
||||
adc $c011 ; add lfo output
|
||||
bcc .cutoff_compute_end ; if no overflow jump to end
|
||||
lda #$ff ; put #$ff -> A
|
||||
jmp .cutoff_compute_end ; jump to end
|
||||
.cutoff_compute_lfo_neg:
|
||||
txa ; copy X -> A
|
||||
clc
|
||||
adc $c011 ; add lfo output
|
||||
bcs .cutoff_compute_end ; if overflow jump to end
|
||||
lda #$00 ; put 0 -> A
|
||||
|
||||
.cutoff_compute_end:
|
||||
sta $c00c ; put result in $c00c
|
||||
|
||||
.bar_draw:
|
||||
ldx $c00c ; get current modulated cutoff -> X
|
||||
lda $8100,X ; get bar length in pixels -> A
|
||||
sta $c018 ; store value in $c018
|
||||
ldx #$60
|
||||
stx $fb
|
||||
ldx #$66
|
||||
stx $fc ; put upper left corner=$6660, in $fb, $fc
|
||||
lda #$78 ; put 120 -> A
|
||||
sta $c019 ; put A -> $c019
|
||||
|
||||
.bar_draw_clear_loop:
|
||||
cmp $c018 ; compare with bar length
|
||||
beq .bar_draw_fill_loop ; if A = $c018 then jump below
|
||||
sec
|
||||
sbc #$8 ; A - 8 -> A
|
||||
bcc .color_compute ; if overflow, done, move to next task
|
||||
cmp $c018 ; compare with bar length
|
||||
sta $c019 ; put number of lines left -> $c019
|
||||
bcc .bar_draw_mixed ; if A < $c018 then jump below
|
||||
|
||||
ldy #$8 ; put 8 -> Y
|
||||
lda #$40 ; put $40 -> A
|
||||
.bar_draw_clear_inner_loop:
|
||||
dey
|
||||
sta ($fb),y
|
||||
bne .bar_draw_clear_inner_loop ; loop
|
||||
|
||||
; update memory pointer
|
||||
lda $fb ; get low byte of memory pointer -> A
|
||||
clc
|
||||
adc #$40 ; add $40
|
||||
sta $fb ; store low byte
|
||||
lda $fc ; get high byte -> A
|
||||
adc #$01 ; add 1 + carry
|
||||
sta $fc ; store high byte
|
||||
|
||||
lda $c019 ; get back number of lines left -> A
|
||||
jmp .bar_draw_clear_loop ; loop
|
||||
|
||||
.bar_draw_mixed:
|
||||
lda $c018 ; put bar length -> A
|
||||
sec
|
||||
sbc $c019 ; subtract number of lines left (-8)
|
||||
tax ; copy A -> X
|
||||
|
||||
ldy #$8 ; put 8 -> Y
|
||||
lda #$5f ; put $5f -> A
|
||||
.bar_draw_mixed_fill_loop:
|
||||
dey
|
||||
dex
|
||||
sta ($fb),y
|
||||
bne .bar_draw_mixed_fill_loop ; loop
|
||||
|
||||
lda #$40 ; put $40 -> A
|
||||
.bar_draw_mixed_clear_loop:
|
||||
dey
|
||||
sta ($fb),y
|
||||
bne .bar_draw_mixed_clear_loop ; loop
|
||||
|
||||
; update memory pointer
|
||||
lda $fb ; get low byte of memory pointer -> A
|
||||
clc
|
||||
adc #$40 ; add $40
|
||||
sta $fb ; store low byte
|
||||
lda $fc ; get high byte -> A
|
||||
adc #$01 ; add 1 + carry
|
||||
sta $fc ; store high byte
|
||||
|
||||
.bar_draw_fill_loop:
|
||||
lda $c019 ; get number of lines left -> A
|
||||
beq .color_compute ; if A = 0, then done, move to next task
|
||||
sec
|
||||
sbc #$8 ; A - 8 -> A
|
||||
sta $c019 ; put number of lines left -> $c019
|
||||
|
||||
ldy #$8 ; put 8 -> Y
|
||||
lda #$5f ; put $5f -> A
|
||||
.bar_draw_fill_inner_loop:
|
||||
dey
|
||||
sta ($fb),y
|
||||
bne .bar_draw_fill_inner_loop ; loop
|
||||
|
||||
; update memory pointer
|
||||
lda $fb ; get low byte of memory pointer -> A
|
||||
clc
|
||||
adc #$40 ; add $40
|
||||
sta $fb ; store low byte
|
||||
lda $fc ; get high byte -> A
|
||||
adc #$01 ; add 1 + carry
|
||||
sta $fc ; store high byte
|
||||
|
||||
lda $c019 ; get back number of lines left -> A
|
||||
jmp .bar_draw_fill_loop ; loop
|
||||
|
||||
.color_compute:
|
||||
lda $c00c ; get current modulated cutoff -> A
|
||||
lsr
|
||||
lsr
|
||||
lsr
|
||||
lsr
|
||||
lsr
|
||||
lsr ; >> 6
|
||||
sta $c00e ; store current colormap index
|
||||
tax ; copy A -> X
|
||||
lda $7f40,X ; get current parameter color
|
||||
sta $c00f ; and store it
|
||||
|
||||
.cutoff_update:
|
||||
ldy $c00f ; parameter color -> Y
|
||||
lda $c003 ; get current parameter index -> A
|
||||
beq .cutoff_update_color_ok ; if selected don't set to grey
|
||||
ldy #$b1 ; grey color -> Y
|
||||
.cutoff_update_color_ok:
|
||||
sty $c008 ; set Y -> color
|
||||
lda #$00
|
||||
sta $c009 ; set 0 -> x offset
|
||||
lda $c000 ; get cutoff parameter value -> A
|
||||
sta $c00a ; set A -> parameter value
|
||||
jsr .param_update
|
||||
|
||||
.lfo_amount_update:
|
||||
ldy $c00f ; parameter color -> Y
|
||||
lda $c003 ; get current parameter index -> A
|
||||
sec
|
||||
sbc #$01 ; subtract 1
|
||||
beq .lfo_amount_update_color_ok ; if selected don't set to grey
|
||||
ldy #$b1 ; grey color -> Y
|
||||
.lfo_amount_update_color_ok:
|
||||
sty $c008 ; set Y -> color
|
||||
lda #$09
|
||||
sta $c009 ; set 9 -> x offset
|
||||
lda $c001 ; get lfo amount parameter value -> A
|
||||
sta $c00a ; set A -> parameter value
|
||||
jsr .param_update
|
||||
|
||||
.lfo_speed_update:
|
||||
ldy $c00f ; parameter color -> Y
|
||||
lda $c003 ; get current parameter index -> A
|
||||
sec
|
||||
sbc #$02 ; subtract 2
|
||||
beq .lfo_speed_update_color_ok ; if selected don't set to grey
|
||||
ldy #$b1 ; grey color -> Y
|
||||
.lfo_speed_update_color_ok:
|
||||
sty $c008 ; set Y -> color
|
||||
lda #$12
|
||||
sta $c009 ; set 18 -> x offset
|
||||
lda $c002 ; get lfo speed parameter value -> A
|
||||
sta $c00a ; set A -> parameter value
|
||||
jsr .param_update
|
||||
|
||||
.sid_update:
|
||||
ldx $c00c ; get current modulated cutoff -> X
|
||||
lda $8200,X ; get mapped low byte -> A
|
||||
sta $d415 ; set low byte
|
||||
lda $8300,X ; get mapped high byte -> A
|
||||
sta $d416 ; set high byte
|
||||
|
||||
; doing it here to get colormap updated before showing it (avoids giltches)
|
||||
.vic_update:
|
||||
; set bitmap addresses
|
||||
lda $c00c ; get current modulated cutoff -> A
|
||||
lsr
|
||||
lsr ; >> 2
|
||||
ora #$08 ; A | 8
|
||||
sta $d018 ; set colormap address
|
||||
|
||||
.main_loop_end:
|
||||
dec $c004 ; decrement number of update iterations
|
||||
beq .main_loop_loop ; if == 0 restart main loop (needed because far jump)
|
||||
jmp .lfo ; otherwise update again
|
||||
.main_loop_loop:
|
||||
jmp .main_loop
|
||||
|
||||
; routine that updates colormap for parameter
|
||||
; inputs:
|
||||
; $c008: color byte
|
||||
; $c009: x offset (number of cells)
|
||||
; $c00a: parameter value (0-15)
|
||||
.param_update:
|
||||
; upper left corner of first parameter = 40a0/44a0/48a0/4ca0
|
||||
; here we put 40a0 + x offset into $fb, $fc for indirect addressing
|
||||
lda $c009 ; put x offset -> A
|
||||
clc
|
||||
adc #$a0 ; add low byte
|
||||
sta $fb ; store low byte in $fb
|
||||
lda $c00e ; get current colormap index -> A
|
||||
asl
|
||||
asl ; * 4
|
||||
adc #$40 ; add 40 (with carry)
|
||||
sta $fc ; store high byte in $fc
|
||||
|
||||
ldx #$15 ; 21 lines left -> X
|
||||
|
||||
; $c00a = 15 - $c00a (number of white cells)
|
||||
lda #$0f
|
||||
sec
|
||||
sbc $c00a
|
||||
sta $c00a
|
||||
|
||||
.param_update_loop:
|
||||
lda $c008 ; get color byte -> A
|
||||
|
||||
; put color data in 3 consecutive bytes
|
||||
ldy #$00 ; put 0 -> Y
|
||||
sta ($fb),y ; 1
|
||||
iny
|
||||
sta ($fb),y ; 2
|
||||
iny
|
||||
sta ($fb),y ; 3
|
||||
iny
|
||||
|
||||
; put color data or all white for middle cell
|
||||
cpx #$15
|
||||
beq .param_update_mcell ; if first line use color data
|
||||
lda $c00a ; get number of white cells -> A
|
||||
bne .param_update_mdec ; if !=0 jump
|
||||
lda $c008 ; get color byte -> A
|
||||
jmp .param_update_mcell ; jump
|
||||
.param_update_mdec:
|
||||
dec $c00a ; decrement
|
||||
lda #$11 ; use white
|
||||
.param_update_mcell:
|
||||
sta ($fb),y ; 4
|
||||
iny
|
||||
|
||||
lda $c008 ; get color byte -> A
|
||||
|
||||
; put color data in 3 consecutive bytes
|
||||
sta ($fb),y ; 5
|
||||
iny
|
||||
sta ($fb),y ; 6
|
||||
iny
|
||||
sta ($fb),y ; 7
|
||||
|
||||
dex ; decrement lines left
|
||||
beq .param_update_end ; end loop if no lines left
|
||||
|
||||
; update memory pointer
|
||||
lda $fb ; get low byte of memory pointer -> A
|
||||
clc
|
||||
adc #$28 ; add 40
|
||||
sta $fb ; store low byte
|
||||
lda $fc ; get high byte -> A
|
||||
adc #$00 ; add carry
|
||||
sta $fc ; store high byte
|
||||
|
||||
jmp .param_update_loop ; loop
|
||||
|
||||
.param_update_end:
|
||||
rts ; return
|
||||
|
||||
; routines that reads paddle x value in port 2
|
||||
; adapted from C64 programming reference, essentially a normal read with some waiting
|
||||
* = $2f00
|
||||
.paddle_read:
|
||||
sei ; disable interrupts
|
||||
lda $dc02 ; get CIA 1 data direction port A
|
||||
tay ; copy it in Y
|
||||
lda #$c0
|
||||
sta $dc02 ; put #$c0 -> CIA 1 data direction port A
|
||||
lda #$80
|
||||
sta $dc00 ; put #$80 -> CIA 1 data port A (choose paddle in port 2)
|
||||
ldx #$80 ; put #$80 -> X
|
||||
.paddle_read_wait_loop:
|
||||
nop
|
||||
dex
|
||||
bpl .paddle_read_wait_loop ; loop
|
||||
lda $d419 ; get value -> A
|
||||
sta $c01a ; store it in $c01a
|
||||
sty $dc02 ; restore CIA 1 data direction port A
|
||||
cli ; re-enable interrupts
|
||||
rts
|
||||
|
||||
; lfo scaling
|
||||
* = $3000
|
||||
!binary "lfoscaling.dat"
|
||||
|
||||
; colormap 1 (green)
|
||||
* = $4000
|
||||
!binary "colormap1.dat"
|
||||
|
||||
; colormap 2 (blue)
|
||||
* = $4400
|
||||
!binary "colormap2.dat"
|
||||
|
||||
; colormap 3 (violet)
|
||||
* = $4800
|
||||
!binary "colormap3.dat"
|
||||
|
||||
; colormap 4 (red)
|
||||
* = $4c00
|
||||
!binary "colormap4.dat"
|
||||
|
||||
; bitmap
|
||||
* = $6000
|
||||
!binary "bitmap.dat"
|
||||
|
||||
; parameter colors
|
||||
* = $7f40
|
||||
!8 $51, $61, $41, $21
|
||||
|
||||
; lfo increments
|
||||
* = $7f50
|
||||
!8 1, 2, 3, 4, 5, 6, 7, 8, 9, 12, 16, 21, 28, 37, 49, 64
|
||||
|
||||
; bar mapping
|
||||
* = $8100
|
||||
!binary "barmapping.dat"
|
||||
|
||||
; cutoff mapping
|
||||
* = $8200
|
||||
!binary "cutoffmapping.dat"
|
BIN
c64/asid.prg
Normal file
BIN
c64/barmapping.dat
Normal file
BIN
c64/bitmap.dat
Normal file
61
c64/boot.bas
Normal file
@ -0,0 +1,61 @@
|
||||
0 POKE 770,131:POKE 771,164: REM AUTORUN
|
||||
10 POKE 53280,1:POKE 53281,1:POKE 646,2:REM COLORS
|
||||
20 SYS 58692:REM CLEAR SCREEN
|
||||
30 PRINT:PRINT " ORASTRON A-SID V 1.0.0":PRINT:PRINT
|
||||
40 PRINT:PRINT:PRINT:PRINT:PRINT
|
||||
50 PRINT " PLEASE DO NOT USE THIS SOFTWARE"
|
||||
60 PRINT " IF YOU SUFFER FROM EPILEPSY, MIGRAINE,"
|
||||
70 PRINT " OR OTHER PHOTOSENSITIVE CONDITIONS.":PRINT:PRINT:PRINT:PRINT
|
||||
80 PRINT " INSERT JOYSTICK IN PORT 1"
|
||||
90 PRINT " AND PRESS FIRE TO CONTINUE."
|
||||
110 J=PEEK(56321):IF (J AND 16) THEN 110
|
||||
111 J=PEEK(56321):IF (J AND 16)=0 THEN 111
|
||||
200 SYS 58692
|
||||
210 PRINT:PRINT " ORASTRON A-SID V 1.0.0":PRINT:PRINT
|
||||
220 PRINT:PRINT:PRINT:PRINT
|
||||
230 PRINT " YOU CAN INSERT A PADDLE IN PORT 2"
|
||||
240 PRINT " OR CONNECT THE OUTPUT PORT OF AN"
|
||||
250 PRINT " EXPRESSION PEDAL TO A JACK-TO-CONTROL"
|
||||
260 PRINT " PORT ADAPTER ATTACHED TO PORT 2, AND"
|
||||
270 PRINT " TURN EITHER TO THE MINIMUM.":PRINT:PRINT:PRINT
|
||||
280 PRINT " IF ANY SUCH DEVICE IS DETECTED"
|
||||
290 PRINT " WE WILL THEN CALIBRATE IT.":PRINT:PRINT:PRINT
|
||||
300 PRINT " PRESS FIRE TO CONTINUE."
|
||||
310 J=PEEK(56321):IF (J AND 16) THEN 310
|
||||
311 J=PEEK(56321):IF (J AND 16)=0 THEN 311
|
||||
400 SYS 12032:L=PEEK(49178):REM GET PADDLE X VALUE
|
||||
440 P=0
|
||||
450 IF L>=244 THEN 1000
|
||||
460 P=1
|
||||
500 SYS 58692
|
||||
510 PRINT:PRINT " ORASTRON A-SID V 1.0.0":PRINT:PRINT
|
||||
515 PRINT:PRINT
|
||||
520 PRINT "MIN: ",L:PRINT
|
||||
530 PRINT "NOW SET TO MAXIMUM AND PRESS FIRE.":PRINT
|
||||
540 J=PEEK(56321):IF (J AND 16) THEN 540
|
||||
541 J=PEEK(56321):IF (J AND 16)=0 THEN 541
|
||||
550 SYS 12032:H=PEEK(49178)
|
||||
560 PRINT "MAX: ",H:PRINT
|
||||
570 PRINT "AND NOW TO THE MIDDLE AND PRESS FIRE.":PRINT
|
||||
580 J=PEEK(56321):IF (J AND 16) THEN 580
|
||||
581 J=PEEK(56321):IF (J AND 16)=0 THEN 581
|
||||
590 SYS 12032:M=PEEK(49178)
|
||||
600 PRINT "MID: ",M:PRINT
|
||||
610 PRINT "GIVE ME A SEC TO COMPUTE SOME STUFF...":PRINT:PRINT:PRINT
|
||||
620 FOR I=0 TO 255
|
||||
630 POKE 32768+I,0
|
||||
640 NEXT I
|
||||
650 IF L=M THEN 690
|
||||
660 FOR I=L TO M-1
|
||||
670 POKE 32768+I,(256-INT(127*(I-M)/(L-M))) AND 255
|
||||
680 NEXT I
|
||||
690 IF M=H THEN 800
|
||||
700 FOR I=M TO H
|
||||
710 POKE 32768+I,INT(127*(I-M)/(H-M))
|
||||
720 NEXT I
|
||||
800 PRINT " OK, READY TO GO.":PRINT
|
||||
810 PRINT " PRESS FIRE TO CONTINUE."
|
||||
820 J=PEEK(56321):IF (J AND 16) THEN 820
|
||||
821 J=PEEK(56321):IF (J AND 16)=0 THEN 821
|
||||
1000 POKE 49172,P:POKE 49173,L:POKE 49174,H
|
||||
1010 SYS 8192
|
BIN
c64/boot.prg
Normal file
1
c64/colormap1.dat
Normal file
@ -0,0 +1 @@
|
||||
!!!!!!Q<15><>aaA!!!!!!QQaaAA!!QQ!!!<11><><EFBFBD><11><><EFBFBD><11><><EFBFBD><11><><11><><EFBFBD><11><><EFBFBD><11><><EFBFBD><11><1D><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><11><><EFBFBD><11><><EFBFBD><11><><EFBFBD><11><1D><><EFBFBD>]<5D><>]<5D><11><><EFBFBD><11><><EFBFBD><11><><EFBFBD><1D><><EFBFBD>]<5D><><EFBFBD><EFBFBD><11><><EFBFBD><11><><EFBFBD><11><><EFBFBD><11><><EFBFBD><EFBFBD><EFBFBD>]<5D><><EFBFBD>]<5D><11><><EFBFBD><11><><EFBFBD><11><><EFBFBD><11><1D>]<5D>]]<5D><><EFBFBD>]]<11><><EFBFBD><11><><EFBFBD><11><><EFBFBD>]]]<5D>]]]]]]]<11><><EFBFBD><11><><EFBFBD><11><><EFBFBD><11><><EFBFBD>]]<5D><>]]<5D><><EFBFBD><11><><EFBFBD><11><><EFBFBD><11><><EFBFBD><11>U<EFBFBD>]]]<5D>UUUUU<11><><EFBFBD><11><><EFBFBD><11><><EFBFBD>UU<55>U<EFBFBD><55>UUUUU<11><><EFBFBD><11><><EFBFBD><11><><EFBFBD>QUUU<55><55>UUUUU<11><><EFBFBD><11><><EFBFBD><11><><EFBFBD>QU<><55>]<5D><><EFBFBD><EFBFBD><EFBFBD><11><><EFBFBD><11><><EFBFBD><11><><EFBFBD><11><><EFBFBD><19><><EFBFBD><EFBFBD><EFBFBD><11><><EFBFBD><11><><EFBFBD><11><><EFBFBD><11>xxxx<78><78><11><><EFBFBD><11><><EFBFBD><11><><EFBFBD>q<17><>xxxx<11><><EFBFBD><11><><EFBFBD><11><><EFBFBD>q<17><><EFBFBD>xx<78><78><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><11><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><11><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><17><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><11><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><11><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><17><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><11><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><11><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>qq<17><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><11><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><11><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>qqqq<17>qqqq<71><71><17>
|
1
c64/colormap2.dat
Normal file
@ -0,0 +1 @@
|
||||
!!!!!!a<16><>AA!QQ!!!!aaAA!!QQaa!!!<11><><EFBFBD><11><><EFBFBD><11><><EFBFBD><11><><11><><EFBFBD><11><><EFBFBD><11><><EFBFBD><11><1E><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><11><><EFBFBD><11><><EFBFBD><11><><EFBFBD><11><1E><><EFBFBD>n<EFBFBD><6E>n<EFBFBD><11><><EFBFBD><11><><EFBFBD><11><><EFBFBD><1E><><EFBFBD>n<EFBFBD><6E><EFBFBD><EFBFBD><11><><EFBFBD><11><><EFBFBD><11><><EFBFBD><11><><EFBFBD><EFBFBD><EFBFBD>n<EFBFBD><6E><EFBFBD>n<EFBFBD><11><><EFBFBD><11><><EFBFBD><11><><EFBFBD><11><1E>n<EFBFBD>nn<6E><6E><EFBFBD>nn<11><><EFBFBD><11><><EFBFBD><11><><EFBFBD>nnn<6E>nnnnnnn<11><><EFBFBD><11><><EFBFBD><11><><EFBFBD><11><><EFBFBD>nn<6E><6E>nn<6E><6E><EFBFBD><11><><EFBFBD><11><><EFBFBD><11><><EFBFBD><11>f<EFBFBD>nnn<6E>fffff<11><><EFBFBD><11><><EFBFBD><11><><EFBFBD>ff<66>f<EFBFBD><66>fffff<11><><EFBFBD><11><><EFBFBD><11><><EFBFBD>afff<66><66>fffff<11><><EFBFBD><11><><EFBFBD><11><><EFBFBD>af<><66>n<EFBFBD><6E><EFBFBD><EFBFBD><EFBFBD><11><><EFBFBD><11><><EFBFBD><11><><EFBFBD><11><><EFBFBD><19><><EFBFBD><EFBFBD><EFBFBD><11><><EFBFBD><11><><EFBFBD><11><><EFBFBD><11>xxxx<78><78><11><><EFBFBD><11><><EFBFBD><11><><EFBFBD>q<17><>xxxx<11><><EFBFBD><11><><EFBFBD><11><><EFBFBD>q<17><><EFBFBD>xx<78><78><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><11><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><11><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><17><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><11><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><11><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><17><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><11><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><11><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>qq<17><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><11><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><11><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>qqqq<17>qqqq<71><71><17>
|
1
c64/colormap3.dat
Normal file
@ -0,0 +1 @@
|
||||
!!!!!!A±±!!Qaa!!!!AA!!QQaaAA!!!±±±±±±±±±11±±±±±±±±±1333333±±±±±±±±±1333C34C3±±±±±±±±±333C3333±±±±±±±±±13333C333C3±±±±±±±±±13C3CC333CC±±±±±±±±±CCC3CCCCCCC±±±±±±±±±444CC44CC444±±±±±±±±±4D4CCC4DDDDD±±±±±±±±±DD4D44DDDDD±±±±±±±±±ADDD44DDDDD±±±±±±±±±AD44C44444±±±±±±±±±‘‘‘™™™™™±±±±±±±±±<11>xxxx˜˜±±±±±±±±±q‡‡xxxx±±±±±±±»±q‡‡‡xx±±±±±±±±±±±±±±±±±±±±±‡‡±±±±±±±»»±±±»»»»±±±»»‡‡±±±±±±»±±±±±±±»±±±±±»qq‡±±±±±±±±±±±±±±±±±±±±±qqqq‡qqqq‡‡‡
|
1
c64/colormap4.dat
Normal file
@ -0,0 +1 @@
|
||||
!!!!!!!<12><>QQaAA!!!!!!QQaaAA!!!!!<11><><EFBFBD><11><><EFBFBD><11><><EFBFBD><11><><11><><EFBFBD><11><><EFBFBD><11><><EFBFBD><11><1A><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><11><><EFBFBD><11><><EFBFBD><11><><EFBFBD><11><1A><><EFBFBD>*<2A><>*<2A><11><><EFBFBD><11><><EFBFBD><11><><EFBFBD><1A><><EFBFBD>*<2A><><EFBFBD><EFBFBD><11><><EFBFBD><11><><EFBFBD><11><><EFBFBD><11><><EFBFBD><EFBFBD><EFBFBD>*<2A><><EFBFBD>*<2A><11><><EFBFBD><11><><EFBFBD><11><><EFBFBD><11><1A>*<2A>**<2A><><EFBFBD>**<11><><EFBFBD><11><><EFBFBD><11><><EFBFBD>***<2A>*******<11><><EFBFBD><11><><EFBFBD><11><><EFBFBD><11><><EFBFBD>**<2A><>**<2A><><EFBFBD><11><><EFBFBD><11><><EFBFBD><11><><EFBFBD><11>"<22>***<2A>"""""<11><><EFBFBD><11><><EFBFBD><11><><EFBFBD>""<22>"<22><>"""""<11><><EFBFBD><11><><EFBFBD><11><><EFBFBD>!"""<22><>"""""<11><><EFBFBD><11><><EFBFBD><11><><EFBFBD>!"<22><>*<2A><><EFBFBD><EFBFBD><EFBFBD><11><><EFBFBD><11><><EFBFBD><11><><EFBFBD><11><><EFBFBD><19><><EFBFBD><EFBFBD><EFBFBD><11><><EFBFBD><11><><EFBFBD><11><><EFBFBD><11>xxxx<78><78><11><><EFBFBD><11><><EFBFBD><11><><EFBFBD>q<17><>xxxx<11><><EFBFBD><11><><EFBFBD><11><><EFBFBD>q<17><><EFBFBD>xx<78><78><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><11><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><11><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><17><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><11><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><11><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><17><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><11><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><11><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>qq<17><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><11><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><11><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>qqqq<17>qqqq<71><71><17>
|
BIN
c64/cutoffmapping.dat
Normal file
BIN
c64/lfoscaling.dat
Normal file
BIN
img2c64/hover.png
Normal file
After Width: | Height: | Size: 617 B |
408
img2c64/img2c64.html
Normal file
@ -0,0 +1,408 @@
|
||||
<!DOCTYPE html>
|
||||
<!--
|
||||
|
||||
img2c64 - converts images to C64 bitmaps and colormaps
|
||||
|
||||
Copyright (C) 2022 Orastron srl unipersonale
|
||||
|
||||
This program is free software: you can redistribute it and/or modify
|
||||
it under the terms of the GNU General Public License as published by
|
||||
the Free Software Foundation, either version 3 of the License.
|
||||
|
||||
This progarm 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 for more details.
|
||||
|
||||
You should have received a copy of the GNU General Public License
|
||||
along with A-SID. If not, see <http://www.gnu.org/licenses/>.
|
||||
|
||||
File author: Stefano D'Angelo
|
||||
|
||||
-->
|
||||
<html lang="en">
|
||||
<head>
|
||||
<meta charset="utf-8">
|
||||
<title>Image to C64</title>
|
||||
<style>
|
||||
canvas { border: 1px solid black }
|
||||
</style>
|
||||
<script>
|
||||
// from https://www.c64-wiki.com/wiki/Color
|
||||
var palette = [
|
||||
{ r: 0, g: 0, b: 0 }, // black
|
||||
{ r: 255, g: 255, b: 255 }, // white
|
||||
{ r: 136, g: 0, b: 0 }, // red
|
||||
{ r: 170, g: 255, b: 238 }, // cyan
|
||||
{ r: 204, g: 68, b: 204 }, // violet / purple
|
||||
{ r: 0, g: 204, b: 85 }, // green
|
||||
{ r: 0, g: 0, b: 170 }, // blue
|
||||
{ r: 238, g: 238, b: 119 }, // yellow
|
||||
{ r: 221, g: 136, b: 85 }, // orange
|
||||
{ r: 102, g: 68, b: 0 }, // brown
|
||||
{ r: 255, g: 119, b: 119 }, // light red
|
||||
{ r: 51, g: 51, b: 51 }, // dark grey / grey 1
|
||||
{ r: 119, g: 119, b: 119 }, // grey 2
|
||||
{ r: 170, g: 255, b: 102 }, // light green
|
||||
{ r: 0, g: 136, b: 255 }, // light blue
|
||||
{ r: 187, g: 187, b: 187 }, // light grey / grey 3
|
||||
];
|
||||
|
||||
function closestColorIndex(r, g, b, palette) {
|
||||
var dCur = 3 * 255 * 255;
|
||||
var k = 0;
|
||||
for (var j = 0; j < palette.length; j++) {
|
||||
var dr = r - palette[j].r;
|
||||
var dg = g - palette[j].g;
|
||||
var db = b - palette[j].b;
|
||||
var d = dr * dr + dg * dg + db * db;
|
||||
if (d < dCur) {
|
||||
dCur = d;
|
||||
k = j;
|
||||
}
|
||||
}
|
||||
return k;
|
||||
}
|
||||
|
||||
function reduceToPalette(data) {
|
||||
var bitmap = new Uint8Array(320 * 200);
|
||||
for (var i = 0; i < 320 * 200; i ++) {
|
||||
var r = data[4 * i];
|
||||
var g = data[4 * i + 1];
|
||||
var b = data[4 * i + 2];
|
||||
bitmap[i] = closestColorIndex(r, g, b, palette);
|
||||
}
|
||||
return bitmap;
|
||||
}
|
||||
|
||||
window.onload = function () {
|
||||
var ctxInputHidden = document.getElementById("inputCanvasHidden").getContext("2d");
|
||||
var ctxInput = document.getElementById("inputCanvas").getContext("2d");
|
||||
|
||||
document.getElementById("inputFile").onchange = function (e) {
|
||||
var img = new Image();
|
||||
img.onload = function () {
|
||||
ctxInputHidden.drawImage(this, 0, 0, 320, 200);
|
||||
ctxInput.imageSmoothingEnabled = false;
|
||||
ctxInput.drawImage(this, 0, 0, 1280, 800);
|
||||
};
|
||||
img.onerror = function() {
|
||||
alert("Couldn't load file as image");
|
||||
};
|
||||
img.src = URL.createObjectURL(this.files[0]);
|
||||
};
|
||||
|
||||
var canvasReduceToPaletteHidden = document.getElementById("reduceToPaletteCanvasHidden");
|
||||
var ctxReduceToPaletteHidden = canvasReduceToPaletteHidden.getContext("2d");
|
||||
var ctxReduceToPalette = document.getElementById("reduceToPaletteCanvas").getContext("2d");
|
||||
|
||||
document.getElementById("reduceToPalette").onclick = function (e) {
|
||||
var srcData = ctxInputHidden.getImageData(0, 0, 320, 200);
|
||||
var destHiddenData = ctxReduceToPaletteHidden.createImageData(320, 200);
|
||||
|
||||
var bitmap = reduceToPalette(srcData.data);
|
||||
for (var i = 0; i < 320 * 200; i++) {
|
||||
var p = palette[bitmap[i]];
|
||||
destHiddenData.data[4 * i] = p.r;
|
||||
destHiddenData.data[4 * i + 1] = p.g;
|
||||
destHiddenData.data[4 * i + 2] = p.b;
|
||||
destHiddenData.data[4 * i + 3] = 255;
|
||||
}
|
||||
|
||||
ctxReduceToPaletteHidden.putImageData(destHiddenData, 0, 0);
|
||||
ctxReduceToPalette.imageSmoothingEnabled = false;
|
||||
ctxReduceToPalette.drawImage(canvasReduceToPaletteHidden, 0, 0, 1280, 800);
|
||||
};
|
||||
|
||||
document.getElementById("reduceToPaletteDownload").onclick = function (e) {
|
||||
var a = document.createElement("a");
|
||||
a.download = "reduced.png";
|
||||
a.href = canvasReduceToPaletteHidden.toDataURL();
|
||||
a.click();
|
||||
};
|
||||
|
||||
var canvasFinalHidden = document.getElementById("finalCanvasHidden");
|
||||
var ctxFinalHidden = canvasFinalHidden.getContext("2d");
|
||||
var ctxFinal = document.getElementById("finalCanvas").getContext("2d");
|
||||
var canvasBitmapHidden = document.getElementById("bitmapCanvasHidden");
|
||||
var ctxBitmapHidden = canvasBitmapHidden.getContext("2d");
|
||||
var ctxBitmap = document.getElementById("bitmapCanvas").getContext("2d");
|
||||
var canvasColormapHidden = document.getElementById("colormapCanvasHidden");
|
||||
var ctxColormapHidden = canvasColormapHidden.getContext("2d");
|
||||
var ctxColormap = document.getElementById("colormapCanvas").getContext("2d");
|
||||
|
||||
function maxIndex(array) {
|
||||
var r = 0;
|
||||
var v = -Infinity;
|
||||
for (var i = 0; i < array.length; i++)
|
||||
if (array[i] > v) {
|
||||
v = array[i];
|
||||
r = i;
|
||||
}
|
||||
return r;
|
||||
}
|
||||
|
||||
document.getElementById("separate").onclick = function (e) {
|
||||
var srcData = ctxReduceToPaletteHidden.getImageData(0, 0, 320, 200);
|
||||
var finalData = ctxFinalHidden.createImageData(320, 200);
|
||||
var bitmapData = ctxBitmapHidden.createImageData(320, 200);
|
||||
var colormapData = ctxColormapHidden.createImageData(320, 200);
|
||||
|
||||
var bitmap = reduceToPalette(srcData.data);
|
||||
var background = new Array(320 / 8 * 200 / 8);
|
||||
var foreground = new Array(320 / 8 * 200 / 8);
|
||||
|
||||
var count = new Array(16);
|
||||
for (var i = 0; i < 320; i += 8) {
|
||||
for (var j = 0; j < 200; j += 8) {
|
||||
count.fill(0);
|
||||
|
||||
for (var y = 0; y < 8; y++)
|
||||
for (var x = 0; x < 8; x++)
|
||||
count[bitmap[320 * (j + y) + i + x]]++;
|
||||
|
||||
var c1 = maxIndex(count);
|
||||
count[c1] = 0;
|
||||
var c2 = count.reduce(function(s, a) { return s + a; }) == 0 ? c1 : maxIndex(count);
|
||||
|
||||
var idx8 = 320 / 64 * j + i / 8;
|
||||
background[idx8] = c1;
|
||||
foreground[idx8] = c2;
|
||||
|
||||
var p = [palette[c1], palette[c2]];
|
||||
for (var y = 0; y < 8; y++)
|
||||
for (var x = 0; x < 8; x++) {
|
||||
var idx = 320 * (j + y) + i + x;
|
||||
var c = palette[bitmap[idx]];
|
||||
var k = closestColorIndex(c.r, c.g, c.b, p);
|
||||
bitmap[idx] = k;
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
for (var i = 0; i < 320; i++) {
|
||||
for (var j = 0; j < 200; j++) {
|
||||
var idx = 320 * j + i;
|
||||
var bp = palette[1 - bitmap[idx]];
|
||||
bitmapData.data[4 * idx] = bp.r;
|
||||
bitmapData.data[4 * idx + 1] = bp.g;
|
||||
bitmapData.data[4 * idx + 2] = bp.b;
|
||||
bitmapData.data[4 * idx + 3] = 255;
|
||||
|
||||
var idx8 = 320 / 8 * Math.floor(j / 8) + Math.floor(i / 8);
|
||||
var fp = palette[bitmap[idx] ? foreground[idx8] : background[idx8]];
|
||||
finalData.data[4 * idx] = fp.r;
|
||||
finalData.data[4 * idx + 1] = fp.g;
|
||||
finalData.data[4 * idx + 2] = fp.b;
|
||||
finalData.data[4 * idx + 3] = 255;
|
||||
}
|
||||
}
|
||||
|
||||
for (var i = 0; i < 320; i += 8) {
|
||||
for (var j = 0; j < 200; j += 8) {
|
||||
var idx8 = 320 / 8 * Math.floor(j / 8) + Math.floor(i / 8);
|
||||
var f = palette[foreground[idx8]];
|
||||
var b = palette[background[idx8]];
|
||||
for (var x = 0; x < 8; x++) {
|
||||
for (var y = 0; y < 4; y++) {
|
||||
var idx = 320 * (j + y) + i + x;
|
||||
colormapData.data[4 * idx] = f.r;
|
||||
colormapData.data[4 * idx + 1] = f.g;
|
||||
colormapData.data[4 * idx + 2] = f.b;
|
||||
colormapData.data[4 * idx + 3] = 255;
|
||||
}
|
||||
for (var y = 4; y < 8; y++) {
|
||||
var idx = 320 * (j + y) + i + x;
|
||||
colormapData.data[4 * idx] = b.r;
|
||||
colormapData.data[4 * idx + 1] = b.g;
|
||||
colormapData.data[4 * idx + 2] = b.b;
|
||||
colormapData.data[4 * idx + 3] = 255;
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
ctxFinalHidden.putImageData(finalData, 0, 0);
|
||||
ctxFinal.imageSmoothingEnabled = false;
|
||||
ctxFinal.drawImage(canvasFinalHidden, 0, 0, 1280, 800);
|
||||
ctxBitmapHidden.putImageData(bitmapData, 0, 0);
|
||||
ctxBitmap.imageSmoothingEnabled = false;
|
||||
ctxBitmap.drawImage(canvasBitmapHidden, 0, 0, 1280, 800);
|
||||
ctxColormapHidden.putImageData(colormapData, 0, 0);
|
||||
ctxColormap.imageSmoothingEnabled = false;
|
||||
ctxColormap.drawImage(canvasColormapHidden, 0, 0, 1280, 800);
|
||||
};
|
||||
|
||||
var hover = document.getElementById("hover");
|
||||
|
||||
var bcmousemove = function (e) {
|
||||
var rect = e.currentTarget.getBoundingClientRect();
|
||||
var x = 32 * Math.floor((e.clientX - rect.left) / 32) + rect.left;
|
||||
var y = 32 * Math.floor((e.clientY - rect.top) / 32) + rect.top;
|
||||
hover.style.display = "block";
|
||||
hover.style.left = x + window.pageXOffset + "px";
|
||||
hover.style.top = y + window.pageYOffset + "px";
|
||||
};
|
||||
|
||||
var bcmouseenter = function (e) {
|
||||
hover.style.display = "block";
|
||||
};
|
||||
|
||||
var bcmouseleave = function (e) {
|
||||
hover.style.display = "none";
|
||||
};
|
||||
|
||||
var bcclick = function (e) {
|
||||
var rect = e.currentTarget.getBoundingClientRect();
|
||||
var x = Math.floor((e.clientX - rect.left) / 32);
|
||||
var y = Math.floor((e.clientY - rect.top) / 32);
|
||||
var bitmapData = ctxBitmapHidden.getImageData(0, 0, 320, 200);
|
||||
var colormapData = ctxColormapHidden.getImageData(0, 0, 320, 200);
|
||||
|
||||
for (var i = 8 * x; i < 8 * x + 8; i++) {
|
||||
for (var j = 8 * y; j < 8 * y + 8; j++) {
|
||||
var idx = 320 * j + i;
|
||||
bitmapData.data[4 * idx] = 255 - bitmapData.data[4 * idx];
|
||||
bitmapData.data[4 * idx + 1] = 255 - bitmapData.data[4 * idx + 1];
|
||||
bitmapData.data[4 * idx + 2] = 255 - bitmapData.data[4 * idx + 2];
|
||||
}
|
||||
}
|
||||
|
||||
for (var i = 8 * x; i < 8 * x + 8; i++) {
|
||||
for (var j = 8 * y; j < 8 * y + 4; j++) {
|
||||
var idx1 = 320 * j + i;
|
||||
var idx2 = 320 * (j + 4) + i;
|
||||
var tr = colormapData.data[4 * idx1];
|
||||
var tg = colormapData.data[4 * idx1 + 1];
|
||||
var tb = colormapData.data[4 * idx1 + 2];
|
||||
colormapData.data[4 * idx1] = colormapData.data[4 * idx2];
|
||||
colormapData.data[4 * idx1 + 1] = colormapData.data[4 * idx2 + 1];
|
||||
colormapData.data[4 * idx1 + 2] = colormapData.data[4 * idx2 + 2];
|
||||
colormapData.data[4 * idx2] = tr;
|
||||
colormapData.data[4 * idx2 + 1] = tg;
|
||||
colormapData.data[4 * idx2 + 2] = tb;
|
||||
}
|
||||
}
|
||||
|
||||
ctxBitmapHidden.putImageData(bitmapData, 0, 0);
|
||||
ctxBitmap.imageSmoothingEnabled = false;
|
||||
ctxBitmap.drawImage(canvasBitmapHidden, 0, 0, 1280, 800);
|
||||
ctxColormapHidden.putImageData(colormapData, 0, 0);
|
||||
ctxColormap.imageSmoothingEnabled = false;
|
||||
ctxColormap.drawImage(canvasColormapHidden, 0, 0, 1280, 800);
|
||||
};
|
||||
|
||||
document.getElementById("bitmapCanvas").onmousemove = bcmousemove;
|
||||
document.getElementById("bitmapCanvas").onmouseenter = bcmouseenter;
|
||||
document.getElementById("bitmapCanvas").onmouseleave = bcmouseleave;
|
||||
document.getElementById("bitmapCanvas").onclick = bcclick;
|
||||
|
||||
document.getElementById("colormapCanvas").onmousemove = bcmousemove;
|
||||
document.getElementById("colormapCanvas").onmouseenter = bcmouseenter;
|
||||
document.getElementById("colormapCanvas").onmouseleave = bcmouseleave;
|
||||
document.getElementById("colormapCanvas").onclick = bcclick;
|
||||
|
||||
document.getElementById("bitmapDownload").onclick = function (e) {
|
||||
var a = document.createElement("a");
|
||||
a.download = "bitmap.png";
|
||||
a.href = canvasBitmapHidden.toDataURL();
|
||||
a.click();
|
||||
};
|
||||
|
||||
document.getElementById("colormapDownload").onclick = function (e) {
|
||||
var a = document.createElement("a");
|
||||
a.download = "colormap.png";
|
||||
a.href = canvasColormapHidden.toDataURL();
|
||||
a.click();
|
||||
};
|
||||
|
||||
document.getElementById("bitmapDataDownload").onclick = function (e) {
|
||||
var bitmapData = ctxBitmapHidden.getImageData(0, 0, 320, 200);
|
||||
var b = bitmapData.data;
|
||||
var data = new Uint8Array(8000);
|
||||
var k = 0;
|
||||
for (var j = 0; j < 200; j += 8) {
|
||||
for (var i = 0; i < 320; i += 8) {
|
||||
for (var y = 0; y < 8; y++) {
|
||||
var idx = 320 * (j + y) + i;
|
||||
data[k] =
|
||||
(b[4 * idx] ? 0 : 0x80)
|
||||
| (b[4 * idx + 4] ? 0 : 0x40)
|
||||
| (b[4 * idx + 8] ? 0 : 0x20)
|
||||
| (b[4 * idx + 12] ? 0 : 0x10)
|
||||
| (b[4 * idx + 16] ? 0 : 0x8)
|
||||
| (b[4 * idx + 20] ? 0 : 0x4)
|
||||
| (b[4 * idx + 24] ? 0 : 0x2)
|
||||
| (b[4 * idx + 28] ? 0 : 0x1);
|
||||
k++;
|
||||
}
|
||||
}
|
||||
}
|
||||
var a = document.createElement("a");
|
||||
a.download = "bitmap.dat";
|
||||
a.href = "data:text/plain;base64," + btoa(String.fromCharCode.apply(null, data));
|
||||
a.click();
|
||||
};
|
||||
|
||||
document.getElementById("colormapDataDownload").onclick = function (e) {
|
||||
var colormapData = ctxColormapHidden.getImageData(0, 0, 320, 200);
|
||||
var data = new Uint8Array(1000);
|
||||
var k = 0;
|
||||
for (var j = 0; j < 200; j += 8) {
|
||||
for (var i = 0; i < 320; i += 8) {
|
||||
var idx1 = 320 * j + i;
|
||||
var idx2 = 320 * (j + 4) + i;
|
||||
var f = closestColorIndex(colormapData.data[4 * idx1], colormapData.data[4 * idx1 + 1], colormapData.data[4 * idx1 + 2], palette);
|
||||
var b = closestColorIndex(colormapData.data[4 * idx2], colormapData.data[4 * idx2 + 1], colormapData.data[4 * idx2 + 2], palette);
|
||||
data[k] = (f << 4) | b;
|
||||
k++;
|
||||
}
|
||||
}
|
||||
var a = document.createElement("a");
|
||||
a.download = "colormap.dat";
|
||||
a.href = "data:text/plain;base64," + btoa(String.fromCharCode.apply(null, data));
|
||||
a.click();
|
||||
};
|
||||
|
||||
document.getElementById("finalDownload").onclick = function (e) {
|
||||
var a = document.createElement("a");
|
||||
a.download = "final.png";
|
||||
a.href = canvasFinalHidden.toDataURL();
|
||||
a.click();
|
||||
};
|
||||
};
|
||||
</script>
|
||||
</head>
|
||||
<body>
|
||||
<h1>Image to C64</h1>
|
||||
<p>Converts a 320x200 image to C64 hi-res bitmap + colormap.</p>
|
||||
<h2>Step #1: Choose image</h2>
|
||||
<input id="inputFile" type="file" value="Choose image"><br>
|
||||
<canvas id="inputCanvasHidden" width="320" height="200" style="display: none"></canvas>
|
||||
<canvas id="inputCanvas" width="1280" height="800"></canvas>
|
||||
<h2>Step #2: Choose palette</h2>
|
||||
<p>Right now we're just using <a href="https://www.c64-wiki.com/wiki/Color">this one</a>.</p>
|
||||
<h2>Step #3: Reduce colors to palette</h2>
|
||||
<input id="reduceToPalette" type="button" value="Go"><br>
|
||||
<canvas id="reduceToPaletteCanvasHidden" width="320" height="200" style="display: none"></canvas>
|
||||
<canvas id="reduceToPaletteCanvas" width="1280" height="800"></canvas><br>
|
||||
<input id="reduceToPaletteDownload" type="button" value="Download">
|
||||
<h2>Step #4: Separate bitamp and colormap</h2>
|
||||
<input id="separate" type="button" value="Go"><br>
|
||||
<h3>Bitmap</h3>
|
||||
<canvas id="bitmapCanvasHidden" width="320" height="200" style="display: none"></canvas>
|
||||
<canvas id="bitmapCanvas" width="1280" height="800"></canvas>
|
||||
<h3>Colormap</h3>
|
||||
<canvas id="colormapCanvasHidden" width="320" height="200" style="display: none"></canvas>
|
||||
<canvas id="colormapCanvas" width="1280" height="800"></canvas>
|
||||
<h3>Final</h3>
|
||||
<canvas id="finalCanvasHidden" width="320" height="200" style="display: none"></canvas>
|
||||
<canvas id="finalCanvas" width="1280" height="800"></canvas><br>
|
||||
<input id="bitmapDownload" type="button" value="Download bitmap as image">
|
||||
<input id="colormapDownload" type="button" value="Download colormap as image">
|
||||
<input id="bitmapDataDownload" type="button" value="Download bitmap as C64 data">
|
||||
<input id="colormapDataDownload" type="button" value="Download colormap as C64 data">
|
||||
<input id="finalDownload" type="button" value="Download final image">
|
||||
<img id="hover" src="hover.png" style="position: absolute; z-index: 1; pointer-events: none">
|
||||
</body>
|
||||
</html>
|
2
measure/Makefile
Normal file
@ -0,0 +1,2 @@
|
||||
measure.prg: measure.bas
|
||||
bas2prg < measure.bas > measure.prg
|
51
measure/measure.bas
Normal file
@ -0,0 +1,51 @@
|
||||
0 POKE 770,131:POKE 771,164: REM AUTORUN
|
||||
1 REM SETUP PARAMETERS
|
||||
10 F=2047 : REM CUTOFF
|
||||
20 R=0 : REM RESONANCE
|
||||
30 V=15 : REM VOLUME
|
||||
40 M=1 : REM MODE
|
||||
100 REM PRINT FIXED STUFF
|
||||
110 PRINT CHR$(147)
|
||||
120 PRINT " F1: CUTOFF (0-2047) "F : PRINT
|
||||
130 PRINT " F3: RESONANCE (0-15) "R : PRINT
|
||||
140 PRINT " F5: VOLUME (0-15) "V : PRINT
|
||||
150 PRINT " F7: MODE (0-7) "M : PRINT
|
||||
160 PRINT " (MODE BIT 0 = LP, 1 = BP, 2 = HP)"
|
||||
200 REM UPDATE SID
|
||||
210 POKE 54293,F AND 7 : REM CUTOFF LOW
|
||||
220 POKE 54294,INT(F/8) : REM CUTOFF HIGH
|
||||
230 POKE 54295,(R*16) OR 8 : REM RESONANCE
|
||||
240 POKE 54296,(M*16) OR V : REM MODE AND VOLUME
|
||||
250 REM SAW FROM VOICE 1 VARIATION
|
||||
251 REM POKE 54272+5,0
|
||||
252 REM POKE 54272+6,240
|
||||
253 REM POKE 54272+4,33
|
||||
254 REM POKE 54272+0,0
|
||||
255 REM POKE 54272+1,16
|
||||
256 REM POKE 54295,(R*16) OR 9 : REM RESONANCE
|
||||
260 REM FILTER BYPASS VARIATION
|
||||
261 REM POKE 54296,R*16
|
||||
300 REM GET F KEY
|
||||
310 GET A$ : IF A$="" THEN 310
|
||||
320 IF A$=CHR$(133) THEN C=0
|
||||
330 IF A$=CHR$(134) THEN C=1
|
||||
340 IF A$=CHR$(135) THEN C=2
|
||||
350 IF A$=CHR$(136) THEN C=3
|
||||
400 REM GET NUMBER
|
||||
410 PRINT : PRINT
|
||||
420 IF C=0 THEN PRINT "NEW CUTOFF"
|
||||
430 IF C=1 THEN PRINT "NEW RESONANCE"
|
||||
440 IF C=2 THEN PRINT "NEW VOLUME"
|
||||
450 IF C=3 THEN PRINT "NEW MODE"
|
||||
460 INPUT A
|
||||
470 A=INT(A)
|
||||
480 IF A<0 THEN A=0
|
||||
490 IF C=0 AND A>2047 THEN A=2047
|
||||
500 IF (C=1 OR C=2) AND A>15 THEN A=15
|
||||
510 IF C=3 AND A>7 THEN A=7
|
||||
520 IF C=0 THEN F=A
|
||||
530 IF C=1 THEN R=A
|
||||
540 IF C=2 THEN V=A
|
||||
550 IF C=3 THEN M=A
|
||||
600 REM LOOP
|
||||
610 GOTO 100
|
BIN
measure/measure.prg
Normal file
5
octave/barmapping.m
Normal file
@ -0,0 +1,5 @@
|
||||
y=linspace(0,120,256);
|
||||
r=round(y);
|
||||
f=fopen("barmapping.dat","w");
|
||||
fwrite(f,r(:),"uchar");
|
||||
fclose(f);
|
157
octave/c64_filter_8580.m
Normal file
@ -0,0 +1,157 @@
|
||||
%
|
||||
% c64_filter_8580.m - MOS 8580 filter simulation
|
||||
%
|
||||
% Copyright (C) Orastron srl unipersonale 2022
|
||||
%
|
||||
% This program is free software: you can redistribute it and/or modify
|
||||
% it under the terms of the GNU General Public License as published by
|
||||
% the Free Software Foundation, version 3 of the License.
|
||||
%
|
||||
% This program 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 for more details.
|
||||
%
|
||||
% You should have received a copy of the GNU General Public License
|
||||
% along with A-SID. If not, see <http://www.gnu.org/licenses/>.
|
||||
%
|
||||
% File author: Stefano D'Angelo
|
||||
|
||||
% x: input
|
||||
% fs: sample rate (Hz)
|
||||
% bypass: bypass mix in [0, 1]
|
||||
% hp: hp mix in [0, 1]
|
||||
% bp: bp mix in [0, 1]
|
||||
% lp: lp mix in [0, 1]
|
||||
% cutoff: value in [0, 2047]
|
||||
% resonance: value in [0, 15]
|
||||
% volume: value in [0, 1]
|
||||
% y: output
|
||||
function y = c64_filter_8580(x, fs, bypass, hp, bp, lp, cutoff, resonance, volume)
|
||||
|
||||
% absolute constants
|
||||
|
||||
kin = 5.838280339378168e-1;
|
||||
Vmin = -4.757;
|
||||
Vmax = 4.243;
|
||||
Ve_k = 0.026 * omega(159.6931258945051);
|
||||
|
||||
% sample-rate dependent
|
||||
|
||||
in_B0 = fs / (fs + 13.55344121872543);
|
||||
in_mA1 = (fs - 13.55344121872543) / (fs + 13.55344121872543);
|
||||
|
||||
out_B0 = tan(50e3 / fs) / (1 + tan(50e3 / fs));
|
||||
out_mA1 = (1 - tan(50e3 / fs)) / (1 + tan(50e3 / fs));
|
||||
|
||||
dc_B0 = fs / (fs + 3.141592653589793);
|
||||
dc_mA1 = (fs - 3.141592653589793) / (fs + 3.141592653589793);
|
||||
|
||||
B0_low = fs + fs;
|
||||
k1_low = 1 / B0_low;
|
||||
pi_fs = 3.141592653589793 / fs;
|
||||
|
||||
% control rate
|
||||
|
||||
% cutoff
|
||||
|
||||
freq = 6.430966835743548 * cutoff;
|
||||
if (freq >= 1)
|
||||
B0 = (6.283185307179586 * freq) / tan(pi_fs * freq);
|
||||
k1 = 1 / B0;
|
||||
else
|
||||
B0 = B0_low;
|
||||
k1 = k1_low;
|
||||
endif
|
||||
k2 = 6.283185307179586 * freq;
|
||||
|
||||
% resonance
|
||||
|
||||
k = -1.254295325783559 + resonance * (9.443329173578159e-2 + resonance * -2.369572413355313e-3);
|
||||
|
||||
% cutoff or resonance
|
||||
|
||||
Vhp_x1 = k1 * (k1 * k2 - k);
|
||||
Vhp_den = 1 / (k2 * Vhp_x1 + 1);
|
||||
|
||||
Vhp_dVbp_xxz1 = Vhp_den * Vhp_x1;
|
||||
Vhp_dVlp_xxz1 = Vhp_den * -k1;
|
||||
Vhp_dVbypass = Vhp_den * -kin;
|
||||
|
||||
% volume
|
||||
|
||||
kvol = -1.0435 * volume;
|
||||
|
||||
% initial states
|
||||
|
||||
in_z1 = 0;
|
||||
Vbp_z1 = 0;
|
||||
dVbp_z1 = 0;
|
||||
Vlp_z1 = 0;
|
||||
dVlp_z1 = 0;
|
||||
out_z1 = 0;
|
||||
dc_z1 = 0;
|
||||
|
||||
% audio rate
|
||||
|
||||
y = 0 * x;
|
||||
for i=1:length(y)
|
||||
Vin = x(i);
|
||||
|
||||
% input
|
||||
|
||||
in_x1 = in_B0 * Vin;
|
||||
Vbypass = in_x1 + in_z1;
|
||||
in_z1 = in_mA1 * Vbypass - in_x1;
|
||||
|
||||
% filter
|
||||
|
||||
dVbp_xxz1 = B0 * Vbp_z1 + dVbp_z1;
|
||||
dVlp_xxz1 = B0 * Vlp_z1 + dVlp_z1;
|
||||
Vhp = Vhp_dVbp_xxz1 * dVbp_xxz1 + Vhp_dVlp_xxz1 * dVlp_xxz1 + Vhp_dVbypass * Vbypass;
|
||||
Vbp = k1 * (dVbp_xxz1 - k2 * Vhp);
|
||||
Vlp = k1 * (dVlp_xxz1 - k2 * Vbp);
|
||||
dVbp = B0 * Vbp - dVbp_xxz1;
|
||||
dVlp = B0 * Vlp - dVlp_xxz1;
|
||||
|
||||
Vbp_z1 = Vbp;
|
||||
dVbp_z1 = dVbp;
|
||||
Vlp_z1 = Vlp;
|
||||
dVlp_z1 = dVlp;
|
||||
|
||||
% mix
|
||||
|
||||
Vmix = min(max(-1.59074074074074 * (hp * Vhp + bp * Vbp + lp * Vlp) + -0.8653168127329506 * bypass * Vbypass, Vmin), Vmax);
|
||||
|
||||
% volume
|
||||
|
||||
Vvol = min(max(kvol * Vmix, Vmin), Vmax);
|
||||
|
||||
% out lowpass
|
||||
|
||||
out_x1 = out_B0 * Vvol;
|
||||
Vb = out_x1 + out_z1;
|
||||
out_z1 = out_x1 + out_mA1 * Vb;
|
||||
|
||||
% out buffer
|
||||
|
||||
Ve = 0.026 * omega(38.46153846153846 * Vb + 159.6931258945051) - Ve_k;
|
||||
|
||||
% dc block
|
||||
|
||||
dc_x1 = dc_B0 * Ve;
|
||||
Vout = dc_x1 + dc_z1;
|
||||
dc_z1 = dc_mA1 * Ve - dc_x1;
|
||||
|
||||
y(i) = Vout;
|
||||
endfor
|
||||
|
||||
endfunction
|
||||
|
||||
function y = omega(x)
|
||||
if(x <= 400)
|
||||
y = lambertw(exp(x));
|
||||
else
|
||||
y = x - log(x);
|
||||
endif
|
||||
endfunction
|
8
octave/cutoffmapping.m
Normal file
@ -0,0 +1,8 @@
|
||||
freq=400+(2200-400).*(linspace(0,1,256).^3);
|
||||
cutoff=round(0.1554976142066175*freq);
|
||||
low=bitand(cutoff,7);
|
||||
high=bitshift(cutoff,-3);
|
||||
f=fopen("cutoffmapping.dat","w");
|
||||
fwrite(f,low(:),"uchar");
|
||||
fwrite(f,high(:),"uchar");
|
||||
fclose(f);
|
64
octave/getIR.m
Normal file
@ -0,0 +1,64 @@
|
||||
%
|
||||
% getIR.m - extracts the IR from a logsweep output (input 20 to 20kHz, 10 s
|
||||
% long, 2 s silence before and after)
|
||||
%
|
||||
% Copyright (C) Orastron srl unipersonale 2022
|
||||
%
|
||||
% This program is free software: you can redistribute it and/or modify
|
||||
% it under the terms of the GNU General Public License as published by
|
||||
% the Free Software Foundation, version 3 of the License.
|
||||
%
|
||||
% This program 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 for more details.
|
||||
%
|
||||
% You should have received a copy of the GNU General Public License
|
||||
% along with A-SID. If not, see <http://www.gnu.org/licenses/>.
|
||||
%
|
||||
% File author: Stefano D'Angelo
|
||||
%
|
||||
% Based on the theory in
|
||||
%
|
||||
% A.Farina, "Simultaneous measurement of impulse response and distortion with
|
||||
% a swept-sine technique", 108th AES Convention, Paris, France, February 2000.
|
||||
|
||||
% y: logsweep output
|
||||
% fs: sample rate (Hz)
|
||||
% h: IR
|
||||
function h = getIR(y, fs)
|
||||
|
||||
fstart=20;
|
||||
fend=20e3;
|
||||
silence=2;
|
||||
T=10;
|
||||
|
||||
% sweep generation
|
||||
t=[0:round(T*fs)-1];
|
||||
t1=round(fs*silence);
|
||||
t2=round(T*fs+silence*fs);
|
||||
t3=round(T*fs+2*silence*fs);
|
||||
w1 = 2*pi*fstart/fs;
|
||||
w2 = 2*pi*fend/fs;
|
||||
K = T*fs*w1/log(w2/w1);
|
||||
L = T*fs/log(w2/w1);
|
||||
sweep(1:t1-1)=0;
|
||||
sweep(t1:t2-1)=sin(K.*(exp(t./L)-1));
|
||||
sweep(t2:t3-1)=0;
|
||||
|
||||
% inverse filter
|
||||
w = w1*exp(t./(T*fs).*log(w2/w1));
|
||||
env = 10.^(-6/20.*log2(w./w1));
|
||||
sweep_inv(1:t1-1)=0;
|
||||
sweep_inv(t1:t2-1)=fliplr(sweep(t1:t2-1)).*env;
|
||||
sweep_inv(t2:t3-1)=0;
|
||||
|
||||
% deconvolution
|
||||
h=fftconv(sweep_inv,y);
|
||||
|
||||
% extract IR
|
||||
[a,i]=max(abs(h));
|
||||
i -= round(fs/2);
|
||||
h=h(i:i+fs-1);
|
||||
|
||||
endfunction
|
6
octave/lfoscaling.m
Normal file
@ -0,0 +1,6 @@
|
||||
x=linspace(1/256,1,256);
|
||||
y=linspace(0,1,16);
|
||||
r=round(127*sin(2*pi*x')*y);
|
||||
f=fopen("lfoscaling.dat","w");
|
||||
fwrite(f,r(:),"schar");
|
||||
fclose(f);
|
1531
spice/8580.asc
Normal file
129
src/asid.c
Normal file
41
src/asid.h
Normal file
@ -0,0 +1,41 @@
|
||||
/*
|
||||
* A-SID - C64 bandpass filter + LFO
|
||||
*
|
||||
* Copyright (C) 2022 Orastron srl unipersonale
|
||||
*
|
||||
* A-SID is free software: you can redistribute it and/or modify
|
||||
* it under the terms of the GNU General Public License as published by
|
||||
* the Free Software Foundation, version 3 of the License.
|
||||
*
|
||||
* A-SID 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 for more details.
|
||||
*
|
||||
* You should have received a copy of the GNU General Public License
|
||||
*
|
||||
* File author: Stefano D'Angelo
|
||||
*/
|
||||
|
||||
#ifndef _ASID_H
|
||||
#define _ASID_H
|
||||
|
||||
#ifdef __cplusplus
|
||||
extern "C" {
|
||||
#endif
|
||||
|
||||
typedef struct _asid* asid;
|
||||
|
||||
asid asid_new();
|
||||
void asid_free(asid instance);
|
||||
void asid_set_sample_rate(asid instance, float sample_rate);
|
||||
void asid_reset(asid instance);
|
||||
void asid_process(asid instance, const float** x, float** y, int n_samples);
|
||||
void asid_set_parameter(asid instance, int index, float value);
|
||||
float asid_get_cutoff_modulated(asid instance);
|
||||
|
||||
#ifdef __cplusplus
|
||||
}
|
||||
#endif
|
||||
|
||||
#endif
|
38
src/common.h
Normal file
@ -0,0 +1,38 @@
|
||||
/*
|
||||
* A-SID - C64 bandpass filter + LFO
|
||||
*
|
||||
* Copyright (C) 2022 Orastron srl unipersonale
|
||||
*
|
||||
* A-SID is free software: you can redistribute it and/or modify
|
||||
* it under the terms of the GNU General Public License as published by
|
||||
* the Free Software Foundation, version 3 of the License.
|
||||
*
|
||||
* A-SID 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 for more details.
|
||||
*
|
||||
* You should have received a copy of the GNU General Public License
|
||||
*
|
||||
* File author: Stefano D'Angelo
|
||||
*/
|
||||
|
||||
#ifndef _ORDSP_COMMON_H
|
||||
#define _ORDSP_COMMON_H
|
||||
|
||||
#include <stdlib.h>
|
||||
#ifndef INFINITY
|
||||
# include <math.h>
|
||||
#endif
|
||||
|
||||
#ifndef ORDSP_MALLOC
|
||||
# define ORDSP_MALLOC malloc
|
||||
#endif
|
||||
#ifndef ORDSP_REALLOC
|
||||
# define ORDSP_REALLOC realloc
|
||||
#endif
|
||||
#ifndef ORDSP_FREE
|
||||
# define ORDSP_FREE free
|
||||
#endif
|
||||
|
||||
#endif
|
223
src/mos_8580_filter.c
Normal file
@ -0,0 +1,223 @@
|
||||
/*
|
||||
* A-SID - C64 bandpass filter + LFO
|
||||
*
|
||||
* Copyright (C) 2022 Orastron srl unipersonale
|
||||
*
|
||||
* A-SID is free software: you can redistribute it and/or modify
|
||||
* it under the terms of the GNU General Public License as published by
|
||||
* the Free Software Foundation, version 3 of the License.
|
||||
*
|
||||
* A-SID 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 for more details.
|
||||
*
|
||||
* You should have received a copy of the GNU General Public License
|
||||
*
|
||||
* File author: Stefano D'Angelo
|
||||
*/
|
||||
|
||||
#include "mos_8580_filter.h"
|
||||
|
||||
#include "common.h"
|
||||
#include "ormath.h"
|
||||
|
||||
struct _ordsp_mos_8580_filter {
|
||||
// Constants
|
||||
// (these should actually be static const in the global (local) scope,
|
||||
// but since we need to do some calculations we define them here to avoid potential race conditions)
|
||||
float Ve_k;
|
||||
|
||||
// Coefficients
|
||||
float in_B0;
|
||||
float in_mA1;
|
||||
float out_B0;
|
||||
float out_mA1;
|
||||
float dc_B0;
|
||||
float dc_mA1;
|
||||
float B0_low;
|
||||
float k1_low;
|
||||
float pi_fs;
|
||||
|
||||
float B0;
|
||||
float k1;
|
||||
float k2;
|
||||
float k;
|
||||
float Vhp_dVbp_xxz1;
|
||||
float Vhp_dVlp_xxz1;
|
||||
float Vhp_dVbypass;
|
||||
|
||||
// Parameters
|
||||
float cutoff;
|
||||
float resonance;
|
||||
float volume;
|
||||
float bypass;
|
||||
float lp;
|
||||
float bp;
|
||||
float hp;
|
||||
int param_changed;
|
||||
|
||||
// States
|
||||
float in_z1;
|
||||
float Vbp_z1;
|
||||
float dVbp_z1;
|
||||
float Vlp_z1;
|
||||
float dVlp_z1;
|
||||
float out_z1;
|
||||
float dc_z1;
|
||||
};
|
||||
|
||||
static const float kin = 5.838280339378168e-1f;
|
||||
static const float Vmin = -4.757f;
|
||||
static const float Vmax = 4.243f;
|
||||
|
||||
ordsp_mos_8580_filter ordsp_mos_8580_filter_new() {
|
||||
ordsp_mos_8580_filter instance = (ordsp_mos_8580_filter)ORDSP_MALLOC(sizeof(struct _ordsp_mos_8580_filter));
|
||||
if (instance != NULL) {
|
||||
instance->Ve_k = 0.026f * ormath_omega_3log(159.6931258945051f);
|
||||
|
||||
instance->cutoff = 1.f;
|
||||
instance->resonance = 0.f;
|
||||
}
|
||||
return instance;
|
||||
}
|
||||
|
||||
void ordsp_mos_8580_filter_free(ordsp_mos_8580_filter instance) {
|
||||
ORDSP_FREE(instance);
|
||||
}
|
||||
|
||||
void ordsp_mos_8580_filter_set_sample_rate(ordsp_mos_8580_filter instance, float sample_rate) {
|
||||
instance->in_B0 = sample_rate / (sample_rate + 13.55344121872543f);
|
||||
instance->in_mA1 = (sample_rate - 13.55344121872543f) / (sample_rate + 13.55344121872543f);
|
||||
|
||||
instance->out_B0 = ormath_tanf_div_3(50e3f / sample_rate) / (1.f + ormath_tanf_div_3(50e3 / sample_rate));
|
||||
instance->out_mA1 = (1.f - ormath_tanf_div_3(50e3f / sample_rate)) / (1.f + ormath_tanf_div_3(50e3f / sample_rate));
|
||||
|
||||
instance->dc_B0 = sample_rate / (sample_rate + 3.141592653589793f);
|
||||
instance->dc_mA1 = (sample_rate - 3.141592653589793f) / (sample_rate + 3.141592653589793f);
|
||||
|
||||
instance->B0_low = sample_rate + sample_rate;
|
||||
instance->k1_low = 1.f / instance->B0_low;
|
||||
instance->pi_fs = 3.141592653589793f / sample_rate;
|
||||
}
|
||||
|
||||
void ordsp_mos_8580_filter_reset(ordsp_mos_8580_filter instance) {
|
||||
instance->param_changed = ~0;
|
||||
|
||||
instance->in_z1 = 0.f;
|
||||
instance->Vbp_z1 = 0.f;
|
||||
instance->dVbp_z1 = 0.f;
|
||||
instance->Vlp_z1 = 0.f;
|
||||
instance->dVlp_z1 = 0.f;
|
||||
instance->out_z1 = 0.f;
|
||||
instance->dc_z1 = 0.f;
|
||||
}
|
||||
|
||||
#define PARAM_CUTOFF 1
|
||||
#define PARAM_RESONANCE (1<<1)
|
||||
|
||||
void ordsp_mos_8580_filter_process(ordsp_mos_8580_filter instance, const float* x, float* y, int n_samples) {
|
||||
if (instance->param_changed) {
|
||||
if (instance->param_changed & (PARAM_CUTOFF | PARAM_RESONANCE)) {
|
||||
if (instance->param_changed & PARAM_CUTOFF) {
|
||||
const float freq = 13164.18911276704f * instance->cutoff;
|
||||
if (freq >= 1.f) {
|
||||
instance->B0 = (6.283185307179586f * freq) / ormath_tanf_div_3(instance->pi_fs * freq);
|
||||
instance->k1 = 1.f / instance->B0;
|
||||
}
|
||||
else {
|
||||
instance->B0 = instance->B0_low;
|
||||
instance->k1 = instance->k1_low;
|
||||
}
|
||||
instance->k2 = 6.283185307179586f * freq;
|
||||
}
|
||||
if (instance->param_changed & PARAM_RESONANCE)
|
||||
instance->k = -1.254295325783559f + instance->resonance * (1.416499376036724f + instance->resonance * -0.5331537930049455f);
|
||||
|
||||
const float Vhp_x1 = instance->k1 * (instance->k1 * instance->k2 - instance->k);
|
||||
const float Vhp_den = 1.f / (instance->k2 * Vhp_x1 + 1.f);
|
||||
|
||||
instance->Vhp_dVbp_xxz1 = Vhp_den * Vhp_x1;
|
||||
instance->Vhp_dVlp_xxz1 = Vhp_den * -instance->k1;
|
||||
instance->Vhp_dVbypass = Vhp_den * -kin;
|
||||
}
|
||||
}
|
||||
const float kvol = -1.0435f * instance->volume;
|
||||
const float kbypass = -0.8653168127329506f * instance->bypass;
|
||||
|
||||
for (int i = 0; i < n_samples; i++) {
|
||||
const float Vin = x[i];
|
||||
|
||||
// input
|
||||
|
||||
const float in_x1 = instance->in_B0 * Vin;
|
||||
const float Vbypass = in_x1 + instance->in_z1;
|
||||
instance->in_z1 = instance->in_mA1 * Vbypass - in_x1;
|
||||
|
||||
// filter
|
||||
|
||||
const float dVbp_xxz1 = instance->B0 * instance->Vbp_z1 + instance->dVbp_z1;
|
||||
const float dVlp_xxz1 = instance->B0 * instance->Vlp_z1 + instance->dVlp_z1;
|
||||
const float Vhp = instance->Vhp_dVbp_xxz1 * dVbp_xxz1 + instance->Vhp_dVlp_xxz1 * dVlp_xxz1 + instance->Vhp_dVbypass * Vbypass;
|
||||
const float Vbp = instance->k1 * (dVbp_xxz1 - instance->k2 * Vhp);
|
||||
const float Vlp = instance->k1 * (dVlp_xxz1 - instance->k2 * Vbp);
|
||||
const float dVbp = instance->B0 * Vbp - dVbp_xxz1;
|
||||
const float dVlp = instance->B0 * Vlp - dVlp_xxz1;
|
||||
|
||||
instance->Vbp_z1 = Vbp;
|
||||
instance->dVbp_z1 = dVbp;
|
||||
instance->Vlp_z1 = Vlp;
|
||||
instance->dVlp_z1 = dVlp;
|
||||
|
||||
// mix
|
||||
|
||||
const float Vmix = ormath_clipf(-1.59074074074074f * (instance->hp * Vhp + instance->bp * Vbp + instance->lp * Vlp) + kbypass * Vbypass, Vmin, Vmax);
|
||||
|
||||
// volume
|
||||
|
||||
const float Vvol = ormath_clipf(kvol * Vmix, Vmin, Vmax);
|
||||
|
||||
// out lowpass
|
||||
|
||||
const float out_x1 = instance->out_B0 * Vvol;
|
||||
const float Vb = out_x1 + instance->out_z1;
|
||||
instance->out_z1 = out_x1 + instance->out_mA1 * Vb;
|
||||
|
||||
// out buffer
|
||||
|
||||
const float Ve = 0.026f * ormath_omega_3log(38.46153846153846f * Vb + 159.6931258945051f) - instance->Ve_k;
|
||||
|
||||
// dc block
|
||||
|
||||
const float dc_x1 = instance->dc_B0 * Ve;
|
||||
const float Vout = dc_x1 + instance->dc_z1;
|
||||
instance->dc_z1 = instance->dc_mA1 * Ve - dc_x1;
|
||||
|
||||
y[i] = Vout;
|
||||
}
|
||||
}
|
||||
|
||||
void ordsp_mos_8580_filter_set_cutoff(ordsp_mos_8580_filter instance, float value) {
|
||||
if (instance->cutoff != value) {
|
||||
instance->cutoff = value;
|
||||
instance->param_changed |= PARAM_CUTOFF;
|
||||
}
|
||||
}
|
||||
|
||||
void ordsp_mos_8580_filter_set_resonance(ordsp_mos_8580_filter instance, float value) {
|
||||
if (instance->resonance != value) {
|
||||
instance->resonance = value;
|
||||
instance->param_changed |= PARAM_RESONANCE;
|
||||
}
|
||||
}
|
||||
|
||||
void ordsp_mos_8580_filter_set_volume(ordsp_mos_8580_filter instance, float value) {
|
||||
instance->volume = value;
|
||||
}
|
||||
|
||||
void ordsp_mos_8580_filter_set_mode(ordsp_mos_8580_filter instance, float bypass, float lp, float bp, float hp) {
|
||||
instance->bypass = bypass;
|
||||
instance->lp = lp;
|
||||
instance->bp = bp;
|
||||
instance->hp = hp;
|
||||
}
|
43
src/mos_8580_filter.h
Normal file
@ -0,0 +1,43 @@
|
||||
/*
|
||||
* A-SID - C64 bandpass filter + LFO
|
||||
*
|
||||
* Copyright (C) 2022 Orastron srl unipersonale
|
||||
*
|
||||
* A-SID is free software: you can redistribute it and/or modify
|
||||
* it under the terms of the GNU General Public License as published by
|
||||
* the Free Software Foundation, version 3 of the License.
|
||||
*
|
||||
* A-SID 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 for more details.
|
||||
*
|
||||
* You should have received a copy of the GNU General Public License
|
||||
*
|
||||
* File author: Stefano D'Angelo
|
||||
*/
|
||||
|
||||
#ifndef _ORDSP_MOS_8580_FILTER_H
|
||||
#define _ORDSP_MOS_8580_FILTER_H
|
||||
|
||||
#ifdef __cplusplus
|
||||
extern "C" {
|
||||
#endif
|
||||
|
||||
typedef struct _ordsp_mos_8580_filter* ordsp_mos_8580_filter;
|
||||
|
||||
ordsp_mos_8580_filter ordsp_mos_8580_filter_new();
|
||||
void ordsp_mos_8580_filter_free(ordsp_mos_8580_filter instance);
|
||||
void ordsp_mos_8580_filter_set_sample_rate(ordsp_mos_8580_filter instance, float sample_rate);
|
||||
void ordsp_mos_8580_filter_reset(ordsp_mos_8580_filter instance);
|
||||
void ordsp_mos_8580_filter_process(ordsp_mos_8580_filter instance, const float* x, float* y, int n_samples);
|
||||
void ordsp_mos_8580_filter_set_cutoff(ordsp_mos_8580_filter instance, float value); // value in [0, 1], corresponds to original range [0, 2047]
|
||||
void ordsp_mos_8580_filter_set_resonance(ordsp_mos_8580_filter instance, float value); // value in [0, 1], corresponds to original range [0, 15]
|
||||
void ordsp_mos_8580_filter_set_volume(ordsp_mos_8580_filter instance, float value); // value in [0, 1], corresponds to original range [0, 15]
|
||||
void ordsp_mos_8580_filter_set_mode(ordsp_mos_8580_filter instance, float bypass, float lp, float bp, float hp); // values 0, 1 correspond to originals (either 0 or 1)
|
||||
|
||||
#ifdef __cplusplus
|
||||
}
|
||||
#endif
|
||||
|
||||
#endif
|
194
src/ormath.h
Normal file
@ -0,0 +1,194 @@
|
||||
/*
|
||||
* A-SID - C64 bandpass filter + LFO
|
||||
*
|
||||
* Copyright (C) 2021, 2022 Orastron srl unipersonale
|
||||
*
|
||||
* A-SID is free software: you can redistribute it and/or modify
|
||||
* it under the terms of the GNU General Public License as published by
|
||||
* the Free Software Foundation, version 3 of the License.
|
||||
*
|
||||
* A-SID 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 for more details.
|
||||
*
|
||||
* You should have received a copy of the GNU General Public License
|
||||
*
|
||||
* File author: Stefano D'Angelo
|
||||
*
|
||||
* Part of the code in this file is derived from omega.h by Stefano D'Angelo,
|
||||
* which is released under the following conditions:
|
||||
*
|
||||
* Copyright (C) 2019 Stefano D'Angelo
|
||||
*
|
||||
* 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 is
|
||||
* furnished to do so, subject to the following conditions:
|
||||
*
|
||||
* The above copyright notice and this permission notice shall be included in
|
||||
* all copies or substantial portions of the Software.
|
||||
*
|
||||
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
|
||||
* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
|
||||
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
|
||||
* AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
|
||||
* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
|
||||
* OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
|
||||
* THE SOFTWARE.
|
||||
*
|
||||
* Such part is itself based on the theory in
|
||||
*
|
||||
* S. D'Angelo, L. Gabrielli, and L. Turchet, "Fast Approximation of the
|
||||
* Lambert W Function for Virtual Analog Modeling", 22nd Intl. Conf. Digital
|
||||
* Audio Effects (DAFx-19), Birmingham, UK, September 2019.
|
||||
*/
|
||||
|
||||
#ifndef _ORMATH_H
|
||||
#define _ORMATH_H
|
||||
|
||||
#ifdef __cplusplus
|
||||
extern "C" {
|
||||
#endif
|
||||
|
||||
#include <stdint.h>
|
||||
|
||||
typedef union {
|
||||
float f;
|
||||
int32_t i;
|
||||
} ormath_floatint;
|
||||
|
||||
// I hope the target architecture and compiler will use conditional ops here
|
||||
|
||||
static inline int32_t ormath_signexti32(int32_t x) {
|
||||
return x < 0 ? ~0 : 0;
|
||||
}
|
||||
|
||||
static inline int32_t ormath_mini32(int32_t a, int32_t b) {
|
||||
return a < b ? a : b;
|
||||
}
|
||||
|
||||
static inline int32_t ormath_maxi32(int32_t a, int32_t b) {
|
||||
return a > b ? a : b;
|
||||
}
|
||||
|
||||
static inline int32_t ormath_clipi32(int32_t x, int32_t m, int32_t M) {
|
||||
return x < m ? m : (x > M ? M : x);
|
||||
}
|
||||
|
||||
// Here instead I don't trust C semantics to get close to conditional ops for
|
||||
// floating point numbers
|
||||
|
||||
static inline float ormath_signf(float x) {
|
||||
ormath_floatint v = {.f = x};
|
||||
ormath_floatint one = {.f = 1.f};
|
||||
one.i |= v.i & 0x80000000;
|
||||
return one.f;
|
||||
}
|
||||
|
||||
static inline float ormath_absf(float x) {
|
||||
ormath_floatint v = {.f = x};
|
||||
v.i = v.i & 0x7fffffff;
|
||||
return v.f;
|
||||
}
|
||||
|
||||
static inline float ormath_min0xf(float x) {
|
||||
return 0.5f * (x - ormath_absf(x));
|
||||
}
|
||||
|
||||
static inline float ormath_max0xf(float x) {
|
||||
return 0.5f * (x + ormath_absf(x));
|
||||
}
|
||||
|
||||
static inline float ormath_minf(float a, float b) {
|
||||
return a + ormath_min0xf(b - a);
|
||||
}
|
||||
|
||||
static inline float ormath_maxf(float a, float b) {
|
||||
return a + ormath_max0xf(b - a);
|
||||
}
|
||||
|
||||
static inline float ormath_clipf(float x, float m, float M) {
|
||||
return ormath_minf(ormath_maxf(x, m), M);
|
||||
}
|
||||
|
||||
static inline float ormath_truncf(float x) {
|
||||
ormath_floatint v = {.f = x};
|
||||
v.f = x;
|
||||
int32_t ex = (v.i & 0x7f800000) >> 23;
|
||||
int32_t m = (~0) << ormath_clipi32(150 - ex, 0, 23);
|
||||
m &= ormath_signexti32(126 - ex) | 0x80000000;
|
||||
v.i &= m;
|
||||
return v.f;
|
||||
}
|
||||
|
||||
static inline float ormath_roundf(float x) {
|
||||
ormath_floatint v = {.f = x};
|
||||
int32_t ex = (v.i & 0x7f800000) >> 23;
|
||||
int32_t sh = ormath_clipi32(150 - ex, 0, 23);
|
||||
int32_t mt = (~0) << sh;
|
||||
mt &= ormath_signexti32(126 - ex) | 0x80000000;
|
||||
int32_t mr = (1 << sh) >> 1;
|
||||
mr &= ormath_signexti32(125 - ex);
|
||||
ormath_floatint s = {.f = ormath_signf(x)};
|
||||
int32_t ms = ormath_signexti32((v.i & mr) << (32 - sh));
|
||||
v.i &= mt;
|
||||
s.i &= ms;
|
||||
return v.f + s.f;
|
||||
}
|
||||
|
||||
static inline float ormath_floorf(float x) {
|
||||
ormath_floatint t = {.f = ormath_truncf(x)}; // first bit set when t < 0
|
||||
ormath_floatint y = {.f = x - t.f}; // first bit set when t > x
|
||||
ormath_floatint s = {.f = 1.f};
|
||||
s.i &= ormath_signexti32(t.i & y.i);
|
||||
return t.f - s.f;
|
||||
}
|
||||
|
||||
static inline float ormath_sinf_3(float x) {
|
||||
x = 0.1591549430918953f * x;
|
||||
x = x - ormath_floorf(x);
|
||||
float xp1 = x + x - 1.f;
|
||||
float xp2 = ormath_absf(xp1);
|
||||
float xp = 1.570796326794897f - 1.570796326794897f * ormath_absf(xp2 + xp2 - 1.f);
|
||||
return -ormath_signf(xp1) * (xp + xp * xp * (-0.05738534102710938f - 0.1107398163618408f * xp));
|
||||
}
|
||||
|
||||
static inline float ormath_cosf_3(float x) {
|
||||
return ormath_sinf_3(x + 1.570796326794896f);
|
||||
}
|
||||
|
||||
static inline float ormath_tanf_div_3(float x) {
|
||||
return ormath_sinf_3(x) / ormath_cosf_3(x);
|
||||
}
|
||||
|
||||
static inline float ormath_log2f_3(float x) {
|
||||
ormath_floatint v = {.f = x};
|
||||
int ex = v.i & 0x7f800000;
|
||||
int e = (ex >> 23) - 127;
|
||||
v.i = (v.i - ex) | 0x3f800000;
|
||||
return (float)e - 2.213475204444817f + v.f * (3.148297929334117f + v.f * (-1.098865286222744f + v.f * 0.1640425613334452f));
|
||||
}
|
||||
|
||||
static inline float ormath_logf_3(float x) {
|
||||
return 0.693147180559945f * ormath_log2f_3(x);
|
||||
}
|
||||
|
||||
static inline float ormath_omega_3log(float x) {
|
||||
static const float x1 = -3.341459552768620f;
|
||||
static const float x2 = 8.f;
|
||||
static const float a = -1.314293149877800e-3f;
|
||||
static const float b = 4.775931364975583e-2f;
|
||||
static const float c = 3.631952663804445e-1f;
|
||||
static const float d = 6.313183464296682e-1f;
|
||||
x = ormath_maxf(x, x1);
|
||||
return x <= x2 ? d + x * (c + x * (b + x * a)) : x - ormath_logf_3(x);
|
||||
}
|
||||
|
||||
#ifdef __cplusplus
|
||||
}
|
||||
#endif
|
||||
|
||||
#endif
|
After Width: | Height: | Size: 5.2 KiB |
After Width: | Height: | Size: 7.7 KiB |
674
vst3/asid.vst3/Contents/Resources/gpl-3.0.txt
Normal file
@ -0,0 +1,674 @@
|
||||
GNU GENERAL PUBLIC LICENSE
|
||||
Version 3, 29 June 2007
|
||||
|
||||
Copyright (C) 2007 Free Software Foundation, Inc. <https://fsf.org/>
|
||||
Everyone is permitted to copy and distribute verbatim copies
|
||||
of this license document, but changing it is not allowed.
|
||||
|
||||
Preamble
|
||||
|
||||
The GNU General Public License is a free, copyleft license for
|
||||
software and other kinds of works.
|
||||
|
||||
The licenses for most software and other practical works are designed
|
||||
to take away your freedom to share and change the works. By contrast,
|
||||
the GNU General Public License is intended to guarantee your freedom to
|
||||
share and change all versions of a program--to make sure it remains free
|
||||
software for all its users. We, the Free Software Foundation, use the
|
||||
GNU General Public License for most of our software; it applies also to
|
||||
any other work released this way by its authors. You can apply it to
|
||||
your programs, too.
|
||||
|
||||
When we speak of free software, we are referring to freedom, not
|
||||
price. Our General Public Licenses are designed to make sure that you
|
||||
have the freedom to distribute copies of free software (and charge for
|
||||
them if you wish), that you receive source code or can get it if you
|
||||
want it, that you can change the software or use pieces of it in new
|
||||
free programs, and that you know you can do these things.
|
||||
|
||||
To protect your rights, we need to prevent others from denying you
|
||||
these rights or asking you to surrender the rights. Therefore, you have
|
||||
certain responsibilities if you distribute copies of the software, or if
|
||||
you modify it: responsibilities to respect the freedom of others.
|
||||
|
||||
For example, if you distribute copies of such a program, whether
|
||||
gratis or for a fee, you must pass on to the recipients the same
|
||||
freedoms that you received. You must make sure that they, too, receive
|
||||
or can get the source code. And you must show them these terms so they
|
||||
know their rights.
|
||||
|
||||
Developers that use the GNU GPL protect your rights with two steps:
|
||||
(1) assert copyright on the software, and (2) offer you this License
|
||||
giving you legal permission to copy, distribute and/or modify it.
|
||||
|
||||
For the developers' and authors' protection, the GPL clearly explains
|
||||
that there is no warranty for this free software. For both users' and
|
||||
authors' sake, the GPL requires that modified versions be marked as
|
||||
changed, so that their problems will not be attributed erroneously to
|
||||
authors of previous versions.
|
||||
|
||||
Some devices are designed to deny users access to install or run
|
||||
modified versions of the software inside them, although the manufacturer
|
||||
can do so. This is fundamentally incompatible with the aim of
|
||||
protecting users' freedom to change the software. The systematic
|
||||
pattern of such abuse occurs in the area of products for individuals to
|
||||
use, which is precisely where it is most unacceptable. Therefore, we
|
||||
have designed this version of the GPL to prohibit the practice for those
|
||||
products. If such problems arise substantially in other domains, we
|
||||
stand ready to extend this provision to those domains in future versions
|
||||
of the GPL, as needed to protect the freedom of users.
|
||||
|
||||
Finally, every program is threatened constantly by software patents.
|
||||
States should not allow patents to restrict development and use of
|
||||
software on general-purpose computers, but in those that do, we wish to
|
||||
avoid the special danger that patents applied to a free program could
|
||||
make it effectively proprietary. To prevent this, the GPL assures that
|
||||
patents cannot be used to render the program non-free.
|
||||
|
||||
The precise terms and conditions for copying, distribution and
|
||||
modification follow.
|
||||
|
||||
TERMS AND CONDITIONS
|
||||
|
||||
0. Definitions.
|
||||
|
||||
"This License" refers to version 3 of the GNU General Public License.
|
||||
|
||||
"Copyright" also means copyright-like laws that apply to other kinds of
|
||||
works, such as semiconductor masks.
|
||||
|
||||
"The Program" refers to any copyrightable work licensed under this
|
||||
License. Each licensee is addressed as "you". "Licensees" and
|
||||
"recipients" may be individuals or organizations.
|
||||
|
||||
To "modify" a work means to copy from or adapt all or part of the work
|
||||
in a fashion requiring copyright permission, other than the making of an
|
||||
exact copy. The resulting work is called a "modified version" of the
|
||||
earlier work or a work "based on" the earlier work.
|
||||
|
||||
A "covered work" means either the unmodified Program or a work based
|
||||
on the Program.
|
||||
|
||||
To "propagate" a work means to do anything with it that, without
|
||||
permission, would make you directly or secondarily liable for
|
||||
infringement under applicable copyright law, except executing it on a
|
||||
computer or modifying a private copy. Propagation includes copying,
|
||||
distribution (with or without modification), making available to the
|
||||
public, and in some countries other activities as well.
|
||||
|
||||
To "convey" a work means any kind of propagation that enables other
|
||||
parties to make or receive copies. Mere interaction with a user through
|
||||
a computer network, with no transfer of a copy, is not conveying.
|
||||
|
||||
An interactive user interface displays "Appropriate Legal Notices"
|
||||
to the extent that it includes a convenient and prominently visible
|
||||
feature that (1) displays an appropriate copyright notice, and (2)
|
||||
tells the user that there is no warranty for the work (except to the
|
||||
extent that warranties are provided), that licensees may convey the
|
||||
work under this License, and how to view a copy of this License. If
|
||||
the interface presents a list of user commands or options, such as a
|
||||
menu, a prominent item in the list meets this criterion.
|
||||
|
||||
1. Source Code.
|
||||
|
||||
The "source code" for a work means the preferred form of the work
|
||||
for making modifications to it. "Object code" means any non-source
|
||||
form of a work.
|
||||
|
||||
A "Standard Interface" means an interface that either is an official
|
||||
standard defined by a recognized standards body, or, in the case of
|
||||
interfaces specified for a particular programming language, one that
|
||||
is widely used among developers working in that language.
|
||||
|
||||
The "System Libraries" of an executable work include anything, other
|
||||
than the work as a whole, that (a) is included in the normal form of
|
||||
packaging a Major Component, but which is not part of that Major
|
||||
Component, and (b) serves only to enable use of the work with that
|
||||
Major Component, or to implement a Standard Interface for which an
|
||||
implementation is available to the public in source code form. A
|
||||
"Major Component", in this context, means a major essential component
|
||||
(kernel, window system, and so on) of the specific operating system
|
||||
(if any) on which the executable work runs, or a compiler used to
|
||||
produce the work, or an object code interpreter used to run it.
|
||||
|
||||
The "Corresponding Source" for a work in object code form means all
|
||||
the source code needed to generate, install, and (for an executable
|
||||
work) run the object code and to modify the work, including scripts to
|
||||
control those activities. However, it does not include the work's
|
||||
System Libraries, or general-purpose tools or generally available free
|
||||
programs which are used unmodified in performing those activities but
|
||||
which are not part of the work. For example, Corresponding Source
|
||||
includes interface definition files associated with source files for
|
||||
the work, and the source code for shared libraries and dynamically
|
||||
linked subprograms that the work is specifically designed to require,
|
||||
such as by intimate data communication or control flow between those
|
||||
subprograms and other parts of the work.
|
||||
|
||||
The Corresponding Source need not include anything that users
|
||||
can regenerate automatically from other parts of the Corresponding
|
||||
Source.
|
||||
|
||||
The Corresponding Source for a work in source code form is that
|
||||
same work.
|
||||
|
||||
2. Basic Permissions.
|
||||
|
||||
All rights granted under this License are granted for the term of
|
||||
copyright on the Program, and are irrevocable provided the stated
|
||||
conditions are met. This License explicitly affirms your unlimited
|
||||
permission to run the unmodified Program. The output from running a
|
||||
covered work is covered by this License only if the output, given its
|
||||
content, constitutes a covered work. This License acknowledges your
|
||||
rights of fair use or other equivalent, as provided by copyright law.
|
||||
|
||||
You may make, run and propagate covered works that you do not
|
||||
convey, without conditions so long as your license otherwise remains
|
||||
in force. You may convey covered works to others for the sole purpose
|
||||
of having them make modifications exclusively for you, or provide you
|
||||
with facilities for running those works, provided that you comply with
|
||||
the terms of this License in conveying all material for which you do
|
||||
not control copyright. Those thus making or running the covered works
|
||||
for you must do so exclusively on your behalf, under your direction
|
||||
and control, on terms that prohibit them from making any copies of
|
||||
your copyrighted material outside their relationship with you.
|
||||
|
||||
Conveying under any other circumstances is permitted solely under
|
||||
the conditions stated below. Sublicensing is not allowed; section 10
|
||||
makes it unnecessary.
|
||||
|
||||
3. Protecting Users' Legal Rights From Anti-Circumvention Law.
|
||||
|
||||
No covered work shall be deemed part of an effective technological
|
||||
measure under any applicable law fulfilling obligations under article
|
||||
11 of the WIPO copyright treaty adopted on 20 December 1996, or
|
||||
similar laws prohibiting or restricting circumvention of such
|
||||
measures.
|
||||
|
||||
When you convey a covered work, you waive any legal power to forbid
|
||||
circumvention of technological measures to the extent such circumvention
|
||||
is effected by exercising rights under this License with respect to
|
||||
the covered work, and you disclaim any intention to limit operation or
|
||||
modification of the work as a means of enforcing, against the work's
|
||||
users, your or third parties' legal rights to forbid circumvention of
|
||||
technological measures.
|
||||
|
||||
4. Conveying Verbatim Copies.
|
||||
|
||||
You may convey verbatim copies of the Program's source code as you
|
||||
receive it, in any medium, provided that you conspicuously and
|
||||
appropriately publish on each copy an appropriate copyright notice;
|
||||
keep intact all notices stating that this License and any
|
||||
non-permissive terms added in accord with section 7 apply to the code;
|
||||
keep intact all notices of the absence of any warranty; and give all
|
||||
recipients a copy of this License along with the Program.
|
||||
|
||||
You may charge any price or no price for each copy that you convey,
|
||||
and you may offer support or warranty protection for a fee.
|
||||
|
||||
5. Conveying Modified Source Versions.
|
||||
|
||||
You may convey a work based on the Program, or the modifications to
|
||||
produce it from the Program, in the form of source code under the
|
||||
terms of section 4, provided that you also meet all of these conditions:
|
||||
|
||||
a) The work must carry prominent notices stating that you modified
|
||||
it, and giving a relevant date.
|
||||
|
||||
b) The work must carry prominent notices stating that it is
|
||||
released under this License and any conditions added under section
|
||||
7. This requirement modifies the requirement in section 4 to
|
||||
"keep intact all notices".
|
||||
|
||||
c) You must license the entire work, as a whole, under this
|
||||
License to anyone who comes into possession of a copy. This
|
||||
License will therefore apply, along with any applicable section 7
|
||||
additional terms, to the whole of the work, and all its parts,
|
||||
regardless of how they are packaged. This License gives no
|
||||
permission to license the work in any other way, but it does not
|
||||
invalidate such permission if you have separately received it.
|
||||
|
||||
d) If the work has interactive user interfaces, each must display
|
||||
Appropriate Legal Notices; however, if the Program has interactive
|
||||
interfaces that do not display Appropriate Legal Notices, your
|
||||
work need not make them do so.
|
||||
|
||||
A compilation of a covered work with other separate and independent
|
||||
works, which are not by their nature extensions of the covered work,
|
||||
and which are not combined with it such as to form a larger program,
|
||||
in or on a volume of a storage or distribution medium, is called an
|
||||
"aggregate" if the compilation and its resulting copyright are not
|
||||
used to limit the access or legal rights of the compilation's users
|
||||
beyond what the individual works permit. Inclusion of a covered work
|
||||
in an aggregate does not cause this License to apply to the other
|
||||
parts of the aggregate.
|
||||
|
||||
6. Conveying Non-Source Forms.
|
||||
|
||||
You may convey a covered work in object code form under the terms
|
||||
of sections 4 and 5, provided that you also convey the
|
||||
machine-readable Corresponding Source under the terms of this License,
|
||||
in one of these ways:
|
||||
|
||||
a) Convey the object code in, or embodied in, a physical product
|
||||
(including a physical distribution medium), accompanied by the
|
||||
Corresponding Source fixed on a durable physical medium
|
||||
customarily used for software interchange.
|
||||
|
||||
b) Convey the object code in, or embodied in, a physical product
|
||||
(including a physical distribution medium), accompanied by a
|
||||
written offer, valid for at least three years and valid for as
|
||||
long as you offer spare parts or customer support for that product
|
||||
model, to give anyone who possesses the object code either (1) a
|
||||
copy of the Corresponding Source for all the software in the
|
||||
product that is covered by this License, on a durable physical
|
||||
medium customarily used for software interchange, for a price no
|
||||
more than your reasonable cost of physically performing this
|
||||
conveying of source, or (2) access to copy the
|
||||
Corresponding Source from a network server at no charge.
|
||||
|
||||
c) Convey individual copies of the object code with a copy of the
|
||||
written offer to provide the Corresponding Source. This
|
||||
alternative is allowed only occasionally and noncommercially, and
|
||||
only if you received the object code with such an offer, in accord
|
||||
with subsection 6b.
|
||||
|
||||
d) Convey the object code by offering access from a designated
|
||||
place (gratis or for a charge), and offer equivalent access to the
|
||||
Corresponding Source in the same way through the same place at no
|
||||
further charge. You need not require recipients to copy the
|
||||
Corresponding Source along with the object code. If the place to
|
||||
copy the object code is a network server, the Corresponding Source
|
||||
may be on a different server (operated by you or a third party)
|
||||
that supports equivalent copying facilities, provided you maintain
|
||||
clear directions next to the object code saying where to find the
|
||||
Corresponding Source. Regardless of what server hosts the
|
||||
Corresponding Source, you remain obligated to ensure that it is
|
||||
available for as long as needed to satisfy these requirements.
|
||||
|
||||
e) Convey the object code using peer-to-peer transmission, provided
|
||||
you inform other peers where the object code and Corresponding
|
||||
Source of the work are being offered to the general public at no
|
||||
charge under subsection 6d.
|
||||
|
||||
A separable portion of the object code, whose source code is excluded
|
||||
from the Corresponding Source as a System Library, need not be
|
||||
included in conveying the object code work.
|
||||
|
||||
A "User Product" is either (1) a "consumer product", which means any
|
||||
tangible personal property which is normally used for personal, family,
|
||||
or household purposes, or (2) anything designed or sold for incorporation
|
||||
into a dwelling. In determining whether a product is a consumer product,
|
||||
doubtful cases shall be resolved in favor of coverage. For a particular
|
||||
product received by a particular user, "normally used" refers to a
|
||||
typical or common use of that class of product, regardless of the status
|
||||
of the particular user or of the way in which the particular user
|
||||
actually uses, or expects or is expected to use, the product. A product
|
||||
is a consumer product regardless of whether the product has substantial
|
||||
commercial, industrial or non-consumer uses, unless such uses represent
|
||||
the only significant mode of use of the product.
|
||||
|
||||
"Installation Information" for a User Product means any methods,
|
||||
procedures, authorization keys, or other information required to install
|
||||
and execute modified versions of a covered work in that User Product from
|
||||
a modified version of its Corresponding Source. The information must
|
||||
suffice to ensure that the continued functioning of the modified object
|
||||
code is in no case prevented or interfered with solely because
|
||||
modification has been made.
|
||||
|
||||
If you convey an object code work under this section in, or with, or
|
||||
specifically for use in, a User Product, and the conveying occurs as
|
||||
part of a transaction in which the right of possession and use of the
|
||||
User Product is transferred to the recipient in perpetuity or for a
|
||||
fixed term (regardless of how the transaction is characterized), the
|
||||
Corresponding Source conveyed under this section must be accompanied
|
||||
by the Installation Information. But this requirement does not apply
|
||||
if neither you nor any third party retains the ability to install
|
||||
modified object code on the User Product (for example, the work has
|
||||
been installed in ROM).
|
||||
|
||||
The requirement to provide Installation Information does not include a
|
||||
requirement to continue to provide support service, warranty, or updates
|
||||
for a work that has been modified or installed by the recipient, or for
|
||||
the User Product in which it has been modified or installed. Access to a
|
||||
network may be denied when the modification itself materially and
|
||||
adversely affects the operation of the network or violates the rules and
|
||||
protocols for communication across the network.
|
||||
|
||||
Corresponding Source conveyed, and Installation Information provided,
|
||||
in accord with this section must be in a format that is publicly
|
||||
documented (and with an implementation available to the public in
|
||||
source code form), and must require no special password or key for
|
||||
unpacking, reading or copying.
|
||||
|
||||
7. Additional Terms.
|
||||
|
||||
"Additional permissions" are terms that supplement the terms of this
|
||||
License by making exceptions from one or more of its conditions.
|
||||
Additional permissions that are applicable to the entire Program shall
|
||||
be treated as though they were included in this License, to the extent
|
||||
that they are valid under applicable law. If additional permissions
|
||||
apply only to part of the Program, that part may be used separately
|
||||
under those permissions, but the entire Program remains governed by
|
||||
this License without regard to the additional permissions.
|
||||
|
||||
When you convey a copy of a covered work, you may at your option
|
||||
remove any additional permissions from that copy, or from any part of
|
||||
it. (Additional permissions may be written to require their own
|
||||
removal in certain cases when you modify the work.) You may place
|
||||
additional permissions on material, added by you to a covered work,
|
||||
for which you have or can give appropriate copyright permission.
|
||||
|
||||
Notwithstanding any other provision of this License, for material you
|
||||
add to a covered work, you may (if authorized by the copyright holders of
|
||||
that material) supplement the terms of this License with terms:
|
||||
|
||||
a) Disclaiming warranty or limiting liability differently from the
|
||||
terms of sections 15 and 16 of this License; or
|
||||
|
||||
b) Requiring preservation of specified reasonable legal notices or
|
||||
author attributions in that material or in the Appropriate Legal
|
||||
Notices displayed by works containing it; or
|
||||
|
||||
c) Prohibiting misrepresentation of the origin of that material, or
|
||||
requiring that modified versions of such material be marked in
|
||||
reasonable ways as different from the original version; or
|
||||
|
||||
d) Limiting the use for publicity purposes of names of licensors or
|
||||
authors of the material; or
|
||||
|
||||
e) Declining to grant rights under trademark law for use of some
|
||||
trade names, trademarks, or service marks; or
|
||||
|
||||
f) Requiring indemnification of licensors and authors of that
|
||||
material by anyone who conveys the material (or modified versions of
|
||||
it) with contractual assumptions of liability to the recipient, for
|
||||
any liability that these contractual assumptions directly impose on
|
||||
those licensors and authors.
|
||||
|
||||
All other non-permissive additional terms are considered "further
|
||||
restrictions" within the meaning of section 10. If the Program as you
|
||||
received it, or any part of it, contains a notice stating that it is
|
||||
governed by this License along with a term that is a further
|
||||
restriction, you may remove that term. If a license document contains
|
||||
a further restriction but permits relicensing or conveying under this
|
||||
License, you may add to a covered work material governed by the terms
|
||||
of that license document, provided that the further restriction does
|
||||
not survive such relicensing or conveying.
|
||||
|
||||
If you add terms to a covered work in accord with this section, you
|
||||
must place, in the relevant source files, a statement of the
|
||||
additional terms that apply to those files, or a notice indicating
|
||||
where to find the applicable terms.
|
||||
|
||||
Additional terms, permissive or non-permissive, may be stated in the
|
||||
form of a separately written license, or stated as exceptions;
|
||||
the above requirements apply either way.
|
||||
|
||||
8. Termination.
|
||||
|
||||
You may not propagate or modify a covered work except as expressly
|
||||
provided under this License. Any attempt otherwise to propagate or
|
||||
modify it is void, and will automatically terminate your rights under
|
||||
this License (including any patent licenses granted under the third
|
||||
paragraph of section 11).
|
||||
|
||||
However, if you cease all violation of this License, then your
|
||||
license from a particular copyright holder is reinstated (a)
|
||||
provisionally, unless and until the copyright holder explicitly and
|
||||
finally terminates your license, and (b) permanently, if the copyright
|
||||
holder fails to notify you of the violation by some reasonable means
|
||||
prior to 60 days after the cessation.
|
||||
|
||||
Moreover, your license from a particular copyright holder is
|
||||
reinstated permanently if the copyright holder notifies you of the
|
||||
violation by some reasonable means, this is the first time you have
|
||||
received notice of violation of this License (for any work) from that
|
||||
copyright holder, and you cure the violation prior to 30 days after
|
||||
your receipt of the notice.
|
||||
|
||||
Termination of your rights under this section does not terminate the
|
||||
licenses of parties who have received copies or rights from you under
|
||||
this License. If your rights have been terminated and not permanently
|
||||
reinstated, you do not qualify to receive new licenses for the same
|
||||
material under section 10.
|
||||
|
||||
9. Acceptance Not Required for Having Copies.
|
||||
|
||||
You are not required to accept this License in order to receive or
|
||||
run a copy of the Program. Ancillary propagation of a covered work
|
||||
occurring solely as a consequence of using peer-to-peer transmission
|
||||
to receive a copy likewise does not require acceptance. However,
|
||||
nothing other than this License grants you permission to propagate or
|
||||
modify any covered work. These actions infringe copyright if you do
|
||||
not accept this License. Therefore, by modifying or propagating a
|
||||
covered work, you indicate your acceptance of this License to do so.
|
||||
|
||||
10. Automatic Licensing of Downstream Recipients.
|
||||
|
||||
Each time you convey a covered work, the recipient automatically
|
||||
receives a license from the original licensors, to run, modify and
|
||||
propagate that work, subject to this License. You are not responsible
|
||||
for enforcing compliance by third parties with this License.
|
||||
|
||||
An "entity transaction" is a transaction transferring control of an
|
||||
organization, or substantially all assets of one, or subdividing an
|
||||
organization, or merging organizations. If propagation of a covered
|
||||
work results from an entity transaction, each party to that
|
||||
transaction who receives a copy of the work also receives whatever
|
||||
licenses to the work the party's predecessor in interest had or could
|
||||
give under the previous paragraph, plus a right to possession of the
|
||||
Corresponding Source of the work from the predecessor in interest, if
|
||||
the predecessor has it or can get it with reasonable efforts.
|
||||
|
||||
You may not impose any further restrictions on the exercise of the
|
||||
rights granted or affirmed under this License. For example, you may
|
||||
not impose a license fee, royalty, or other charge for exercise of
|
||||
rights granted under this License, and you may not initiate litigation
|
||||
(including a cross-claim or counterclaim in a lawsuit) alleging that
|
||||
any patent claim is infringed by making, using, selling, offering for
|
||||
sale, or importing the Program or any portion of it.
|
||||
|
||||
11. Patents.
|
||||
|
||||
A "contributor" is a copyright holder who authorizes use under this
|
||||
License of the Program or a work on which the Program is based. The
|
||||
work thus licensed is called the contributor's "contributor version".
|
||||
|
||||
A contributor's "essential patent claims" are all patent claims
|
||||
owned or controlled by the contributor, whether already acquired or
|
||||
hereafter acquired, that would be infringed by some manner, permitted
|
||||
by this License, of making, using, or selling its contributor version,
|
||||
but do not include claims that would be infringed only as a
|
||||
consequence of further modification of the contributor version. For
|
||||
purposes of this definition, "control" includes the right to grant
|
||||
patent sublicenses in a manner consistent with the requirements of
|
||||
this License.
|
||||
|
||||
Each contributor grants you a non-exclusive, worldwide, royalty-free
|
||||
patent license under the contributor's essential patent claims, to
|
||||
make, use, sell, offer for sale, import and otherwise run, modify and
|
||||
propagate the contents of its contributor version.
|
||||
|
||||
In the following three paragraphs, a "patent license" is any express
|
||||
agreement or commitment, however denominated, not to enforce a patent
|
||||
(such as an express permission to practice a patent or covenant not to
|
||||
sue for patent infringement). To "grant" such a patent license to a
|
||||
party means to make such an agreement or commitment not to enforce a
|
||||
patent against the party.
|
||||
|
||||
If you convey a covered work, knowingly relying on a patent license,
|
||||
and the Corresponding Source of the work is not available for anyone
|
||||
to copy, free of charge and under the terms of this License, through a
|
||||
publicly available network server or other readily accessible means,
|
||||
then you must either (1) cause the Corresponding Source to be so
|
||||
available, or (2) arrange to deprive yourself of the benefit of the
|
||||
patent license for this particular work, or (3) arrange, in a manner
|
||||
consistent with the requirements of this License, to extend the patent
|
||||
license to downstream recipients. "Knowingly relying" means you have
|
||||
actual knowledge that, but for the patent license, your conveying the
|
||||
covered work in a country, or your recipient's use of the covered work
|
||||
in a country, would infringe one or more identifiable patents in that
|
||||
country that you have reason to believe are valid.
|
||||
|
||||
If, pursuant to or in connection with a single transaction or
|
||||
arrangement, you convey, or propagate by procuring conveyance of, a
|
||||
covered work, and grant a patent license to some of the parties
|
||||
receiving the covered work authorizing them to use, propagate, modify
|
||||
or convey a specific copy of the covered work, then the patent license
|
||||
you grant is automatically extended to all recipients of the covered
|
||||
work and works based on it.
|
||||
|
||||
A patent license is "discriminatory" if it does not include within
|
||||
the scope of its coverage, prohibits the exercise of, or is
|
||||
conditioned on the non-exercise of one or more of the rights that are
|
||||
specifically granted under this License. You may not convey a covered
|
||||
work if you are a party to an arrangement with a third party that is
|
||||
in the business of distributing software, under which you make payment
|
||||
to the third party based on the extent of your activity of conveying
|
||||
the work, and under which the third party grants, to any of the
|
||||
parties who would receive the covered work from you, a discriminatory
|
||||
patent license (a) in connection with copies of the covered work
|
||||
conveyed by you (or copies made from those copies), or (b) primarily
|
||||
for and in connection with specific products or compilations that
|
||||
contain the covered work, unless you entered into that arrangement,
|
||||
or that patent license was granted, prior to 28 March 2007.
|
||||
|
||||
Nothing in this License shall be construed as excluding or limiting
|
||||
any implied license or other defenses to infringement that may
|
||||
otherwise be available to you under applicable patent law.
|
||||
|
||||
12. No Surrender of Others' Freedom.
|
||||
|
||||
If conditions are imposed on you (whether by court order, agreement or
|
||||
otherwise) that contradict the conditions of this License, they do not
|
||||
excuse you from the conditions of this License. If you cannot convey a
|
||||
covered work so as to satisfy simultaneously your obligations under this
|
||||
License and any other pertinent obligations, then as a consequence you may
|
||||
not convey it at all. For example, if you agree to terms that obligate you
|
||||
to collect a royalty for further conveying from those to whom you convey
|
||||
the Program, the only way you could satisfy both those terms and this
|
||||
License would be to refrain entirely from conveying the Program.
|
||||
|
||||
13. Use with the GNU Affero General Public License.
|
||||
|
||||
Notwithstanding any other provision of this License, you have
|
||||
permission to link or combine any covered work with a work licensed
|
||||
under version 3 of the GNU Affero General Public License into a single
|
||||
combined work, and to convey the resulting work. The terms of this
|
||||
License will continue to apply to the part which is the covered work,
|
||||
but the special requirements of the GNU Affero General Public License,
|
||||
section 13, concerning interaction through a network will apply to the
|
||||
combination as such.
|
||||
|
||||
14. Revised Versions of this License.
|
||||
|
||||
The Free Software Foundation may publish revised and/or new versions of
|
||||
the GNU General Public License from time to time. Such new versions will
|
||||
be similar in spirit to the present version, but may differ in detail to
|
||||
address new problems or concerns.
|
||||
|
||||
Each version is given a distinguishing version number. If the
|
||||
Program specifies that a certain numbered version of the GNU General
|
||||
Public License "or any later version" applies to it, you have the
|
||||
option of following the terms and conditions either of that numbered
|
||||
version or of any later version published by the Free Software
|
||||
Foundation. If the Program does not specify a version number of the
|
||||
GNU General Public License, you may choose any version ever published
|
||||
by the Free Software Foundation.
|
||||
|
||||
If the Program specifies that a proxy can decide which future
|
||||
versions of the GNU General Public License can be used, that proxy's
|
||||
public statement of acceptance of a version permanently authorizes you
|
||||
to choose that version for the Program.
|
||||
|
||||
Later license versions may give you additional or different
|
||||
permissions. However, no additional obligations are imposed on any
|
||||
author or copyright holder as a result of your choosing to follow a
|
||||
later version.
|
||||
|
||||
15. Disclaimer of Warranty.
|
||||
|
||||
THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY
|
||||
APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT
|
||||
HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY
|
||||
OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO,
|
||||
THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
|
||||
PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM
|
||||
IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF
|
||||
ALL NECESSARY SERVICING, REPAIR OR CORRECTION.
|
||||
|
||||
16. Limitation of Liability.
|
||||
|
||||
IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
|
||||
WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS
|
||||
THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY
|
||||
GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE
|
||||
USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF
|
||||
DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD
|
||||
PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS),
|
||||
EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF
|
||||
SUCH DAMAGES.
|
||||
|
||||
17. Interpretation of Sections 15 and 16.
|
||||
|
||||
If the disclaimer of warranty and limitation of liability provided
|
||||
above cannot be given local legal effect according to their terms,
|
||||
reviewing courts shall apply local law that most closely approximates
|
||||
an absolute waiver of all civil liability in connection with the
|
||||
Program, unless a warranty or assumption of liability accompanies a
|
||||
copy of the Program in return for a fee.
|
||||
|
||||
END OF TERMS AND CONDITIONS
|
||||
|
||||
How to Apply These Terms to Your New Programs
|
||||
|
||||
If you develop a new program, and you want it to be of the greatest
|
||||
possible use to the public, the best way to achieve this is to make it
|
||||
free software which everyone can redistribute and change under these terms.
|
||||
|
||||
To do so, attach the following notices to the program. It is safest
|
||||
to attach them to the start of each source file to most effectively
|
||||
state the exclusion of warranty; and each file should have at least
|
||||
the "copyright" line and a pointer to where the full notice is found.
|
||||
|
||||
<one line to give the program's name and a brief idea of what it does.>
|
||||
Copyright (C) <year> <name of author>
|
||||
|
||||
This program is free software: you can redistribute it and/or modify
|
||||
it under the terms of the GNU General Public License as published by
|
||||
the Free Software Foundation, either version 3 of the License, or
|
||||
(at your option) any later version.
|
||||
|
||||
This program 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 for more details.
|
||||
|
||||
You should have received a copy of the GNU General Public License
|
||||
along with this program. If not, see <https://www.gnu.org/licenses/>.
|
||||
|
||||
Also add information on how to contact you by electronic and paper mail.
|
||||
|
||||
If the program does terminal interaction, make it output a short
|
||||
notice like this when it starts in an interactive mode:
|
||||
|
||||
<program> Copyright (C) <year> <name of author>
|
||||
This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
|
||||
This is free software, and you are welcome to redistribute it
|
||||
under certain conditions; type `show c' for details.
|
||||
|
||||
The hypothetical commands `show w' and `show c' should show the appropriate
|
||||
parts of the General Public License. Of course, your program's commands
|
||||
might be different; for a GUI interface, you would use an "about box".
|
||||
|
||||
You should also get your employer (if you work as a programmer) or school,
|
||||
if any, to sign a "copyright disclaimer" for the program, if necessary.
|
||||
For more information on this, and how to apply and follow the GNU GPL, see
|
||||
<https://www.gnu.org/licenses/>.
|
||||
|
||||
The GNU General Public License does not permit incorporating your program
|
||||
into proprietary programs. If your program is a subroutine library, you
|
||||
may consider it more useful to permit linking proprietary applications with
|
||||
the library. If this is what you want to do, use the GNU Lesser General
|
||||
Public License instead of this License. But first, please read
|
||||
<https://www.gnu.org/licenses/why-not-lgpl.html>.
|
BIN
vst3/asid.vst3/Plugin.ico
Normal file
After Width: | Height: | Size: 18 KiB |
2
vst3/asid.vst3/desktop.ini
Normal file
@ -0,0 +1,2 @@
|
||||
[.ShellClassInfo]
|
||||
IconResource=Plugin.ico,0
|
BIN
vst3/build/asid-1.0.0.vst3.zip
Normal file
After Width: | Height: | Size: 5.2 KiB |
After Width: | Height: | Size: 7.7 KiB |
674
vst3/build/asid.vst3/Contents/Resources/gpl-3.0.txt
Normal file
@ -0,0 +1,674 @@
|
||||
GNU GENERAL PUBLIC LICENSE
|
||||
Version 3, 29 June 2007
|
||||
|
||||
Copyright (C) 2007 Free Software Foundation, Inc. <https://fsf.org/>
|
||||
Everyone is permitted to copy and distribute verbatim copies
|
||||
of this license document, but changing it is not allowed.
|
||||
|
||||
Preamble
|
||||
|
||||
The GNU General Public License is a free, copyleft license for
|
||||
software and other kinds of works.
|
||||
|
||||
The licenses for most software and other practical works are designed
|
||||
to take away your freedom to share and change the works. By contrast,
|
||||
the GNU General Public License is intended to guarantee your freedom to
|
||||
share and change all versions of a program--to make sure it remains free
|
||||
software for all its users. We, the Free Software Foundation, use the
|
||||
GNU General Public License for most of our software; it applies also to
|
||||
any other work released this way by its authors. You can apply it to
|
||||
your programs, too.
|
||||
|
||||
When we speak of free software, we are referring to freedom, not
|
||||
price. Our General Public Licenses are designed to make sure that you
|
||||
have the freedom to distribute copies of free software (and charge for
|
||||
them if you wish), that you receive source code or can get it if you
|
||||
want it, that you can change the software or use pieces of it in new
|
||||
free programs, and that you know you can do these things.
|
||||
|
||||
To protect your rights, we need to prevent others from denying you
|
||||
these rights or asking you to surrender the rights. Therefore, you have
|
||||
certain responsibilities if you distribute copies of the software, or if
|
||||
you modify it: responsibilities to respect the freedom of others.
|
||||
|
||||
For example, if you distribute copies of such a program, whether
|
||||
gratis or for a fee, you must pass on to the recipients the same
|
||||
freedoms that you received. You must make sure that they, too, receive
|
||||
or can get the source code. And you must show them these terms so they
|
||||
know their rights.
|
||||
|
||||
Developers that use the GNU GPL protect your rights with two steps:
|
||||
(1) assert copyright on the software, and (2) offer you this License
|
||||
giving you legal permission to copy, distribute and/or modify it.
|
||||
|
||||
For the developers' and authors' protection, the GPL clearly explains
|
||||
that there is no warranty for this free software. For both users' and
|
||||
authors' sake, the GPL requires that modified versions be marked as
|
||||
changed, so that their problems will not be attributed erroneously to
|
||||
authors of previous versions.
|
||||
|
||||
Some devices are designed to deny users access to install or run
|
||||
modified versions of the software inside them, although the manufacturer
|
||||
can do so. This is fundamentally incompatible with the aim of
|
||||
protecting users' freedom to change the software. The systematic
|
||||
pattern of such abuse occurs in the area of products for individuals to
|
||||
use, which is precisely where it is most unacceptable. Therefore, we
|
||||
have designed this version of the GPL to prohibit the practice for those
|
||||
products. If such problems arise substantially in other domains, we
|
||||
stand ready to extend this provision to those domains in future versions
|
||||
of the GPL, as needed to protect the freedom of users.
|
||||
|
||||
Finally, every program is threatened constantly by software patents.
|
||||
States should not allow patents to restrict development and use of
|
||||
software on general-purpose computers, but in those that do, we wish to
|
||||
avoid the special danger that patents applied to a free program could
|
||||
make it effectively proprietary. To prevent this, the GPL assures that
|
||||
patents cannot be used to render the program non-free.
|
||||
|
||||
The precise terms and conditions for copying, distribution and
|
||||
modification follow.
|
||||
|
||||
TERMS AND CONDITIONS
|
||||
|
||||
0. Definitions.
|
||||
|
||||
"This License" refers to version 3 of the GNU General Public License.
|
||||
|
||||
"Copyright" also means copyright-like laws that apply to other kinds of
|
||||
works, such as semiconductor masks.
|
||||
|
||||
"The Program" refers to any copyrightable work licensed under this
|
||||
License. Each licensee is addressed as "you". "Licensees" and
|
||||
"recipients" may be individuals or organizations.
|
||||
|
||||
To "modify" a work means to copy from or adapt all or part of the work
|
||||
in a fashion requiring copyright permission, other than the making of an
|
||||
exact copy. The resulting work is called a "modified version" of the
|
||||
earlier work or a work "based on" the earlier work.
|
||||
|
||||
A "covered work" means either the unmodified Program or a work based
|
||||
on the Program.
|
||||
|
||||
To "propagate" a work means to do anything with it that, without
|
||||
permission, would make you directly or secondarily liable for
|
||||
infringement under applicable copyright law, except executing it on a
|
||||
computer or modifying a private copy. Propagation includes copying,
|
||||
distribution (with or without modification), making available to the
|
||||
public, and in some countries other activities as well.
|
||||
|
||||
To "convey" a work means any kind of propagation that enables other
|
||||
parties to make or receive copies. Mere interaction with a user through
|
||||
a computer network, with no transfer of a copy, is not conveying.
|
||||
|
||||
An interactive user interface displays "Appropriate Legal Notices"
|
||||
to the extent that it includes a convenient and prominently visible
|
||||
feature that (1) displays an appropriate copyright notice, and (2)
|
||||
tells the user that there is no warranty for the work (except to the
|
||||
extent that warranties are provided), that licensees may convey the
|
||||
work under this License, and how to view a copy of this License. If
|
||||
the interface presents a list of user commands or options, such as a
|
||||
menu, a prominent item in the list meets this criterion.
|
||||
|
||||
1. Source Code.
|
||||
|
||||
The "source code" for a work means the preferred form of the work
|
||||
for making modifications to it. "Object code" means any non-source
|
||||
form of a work.
|
||||
|
||||
A "Standard Interface" means an interface that either is an official
|
||||
standard defined by a recognized standards body, or, in the case of
|
||||
interfaces specified for a particular programming language, one that
|
||||
is widely used among developers working in that language.
|
||||
|
||||
The "System Libraries" of an executable work include anything, other
|
||||
than the work as a whole, that (a) is included in the normal form of
|
||||
packaging a Major Component, but which is not part of that Major
|
||||
Component, and (b) serves only to enable use of the work with that
|
||||
Major Component, or to implement a Standard Interface for which an
|
||||
implementation is available to the public in source code form. A
|
||||
"Major Component", in this context, means a major essential component
|
||||
(kernel, window system, and so on) of the specific operating system
|
||||
(if any) on which the executable work runs, or a compiler used to
|
||||
produce the work, or an object code interpreter used to run it.
|
||||
|
||||
The "Corresponding Source" for a work in object code form means all
|
||||
the source code needed to generate, install, and (for an executable
|
||||
work) run the object code and to modify the work, including scripts to
|
||||
control those activities. However, it does not include the work's
|
||||
System Libraries, or general-purpose tools or generally available free
|
||||
programs which are used unmodified in performing those activities but
|
||||
which are not part of the work. For example, Corresponding Source
|
||||
includes interface definition files associated with source files for
|
||||
the work, and the source code for shared libraries and dynamically
|
||||
linked subprograms that the work is specifically designed to require,
|
||||
such as by intimate data communication or control flow between those
|
||||
subprograms and other parts of the work.
|
||||
|
||||
The Corresponding Source need not include anything that users
|
||||
can regenerate automatically from other parts of the Corresponding
|
||||
Source.
|
||||
|
||||
The Corresponding Source for a work in source code form is that
|
||||
same work.
|
||||
|
||||
2. Basic Permissions.
|
||||
|
||||
All rights granted under this License are granted for the term of
|
||||
copyright on the Program, and are irrevocable provided the stated
|
||||
conditions are met. This License explicitly affirms your unlimited
|
||||
permission to run the unmodified Program. The output from running a
|
||||
covered work is covered by this License only if the output, given its
|
||||
content, constitutes a covered work. This License acknowledges your
|
||||
rights of fair use or other equivalent, as provided by copyright law.
|
||||
|
||||
You may make, run and propagate covered works that you do not
|
||||
convey, without conditions so long as your license otherwise remains
|
||||
in force. You may convey covered works to others for the sole purpose
|
||||
of having them make modifications exclusively for you, or provide you
|
||||
with facilities for running those works, provided that you comply with
|
||||
the terms of this License in conveying all material for which you do
|
||||
not control copyright. Those thus making or running the covered works
|
||||
for you must do so exclusively on your behalf, under your direction
|
||||
and control, on terms that prohibit them from making any copies of
|
||||
your copyrighted material outside their relationship with you.
|
||||
|
||||
Conveying under any other circumstances is permitted solely under
|
||||
the conditions stated below. Sublicensing is not allowed; section 10
|
||||
makes it unnecessary.
|
||||
|
||||
3. Protecting Users' Legal Rights From Anti-Circumvention Law.
|
||||
|
||||
No covered work shall be deemed part of an effective technological
|
||||
measure under any applicable law fulfilling obligations under article
|
||||
11 of the WIPO copyright treaty adopted on 20 December 1996, or
|
||||
similar laws prohibiting or restricting circumvention of such
|
||||
measures.
|
||||
|
||||
When you convey a covered work, you waive any legal power to forbid
|
||||
circumvention of technological measures to the extent such circumvention
|
||||
is effected by exercising rights under this License with respect to
|
||||
the covered work, and you disclaim any intention to limit operation or
|
||||
modification of the work as a means of enforcing, against the work's
|
||||
users, your or third parties' legal rights to forbid circumvention of
|
||||
technological measures.
|
||||
|
||||
4. Conveying Verbatim Copies.
|
||||
|
||||
You may convey verbatim copies of the Program's source code as you
|
||||
receive it, in any medium, provided that you conspicuously and
|
||||
appropriately publish on each copy an appropriate copyright notice;
|
||||
keep intact all notices stating that this License and any
|
||||
non-permissive terms added in accord with section 7 apply to the code;
|
||||
keep intact all notices of the absence of any warranty; and give all
|
||||
recipients a copy of this License along with the Program.
|
||||
|
||||
You may charge any price or no price for each copy that you convey,
|
||||
and you may offer support or warranty protection for a fee.
|
||||
|
||||
5. Conveying Modified Source Versions.
|
||||
|
||||
You may convey a work based on the Program, or the modifications to
|
||||
produce it from the Program, in the form of source code under the
|
||||
terms of section 4, provided that you also meet all of these conditions:
|
||||
|
||||
a) The work must carry prominent notices stating that you modified
|
||||
it, and giving a relevant date.
|
||||
|
||||
b) The work must carry prominent notices stating that it is
|
||||
released under this License and any conditions added under section
|
||||
7. This requirement modifies the requirement in section 4 to
|
||||
"keep intact all notices".
|
||||
|
||||
c) You must license the entire work, as a whole, under this
|
||||
License to anyone who comes into possession of a copy. This
|
||||
License will therefore apply, along with any applicable section 7
|
||||
additional terms, to the whole of the work, and all its parts,
|
||||
regardless of how they are packaged. This License gives no
|
||||
permission to license the work in any other way, but it does not
|
||||
invalidate such permission if you have separately received it.
|
||||
|
||||
d) If the work has interactive user interfaces, each must display
|
||||
Appropriate Legal Notices; however, if the Program has interactive
|
||||
interfaces that do not display Appropriate Legal Notices, your
|
||||
work need not make them do so.
|
||||
|
||||
A compilation of a covered work with other separate and independent
|
||||
works, which are not by their nature extensions of the covered work,
|
||||
and which are not combined with it such as to form a larger program,
|
||||
in or on a volume of a storage or distribution medium, is called an
|
||||
"aggregate" if the compilation and its resulting copyright are not
|
||||
used to limit the access or legal rights of the compilation's users
|
||||
beyond what the individual works permit. Inclusion of a covered work
|
||||
in an aggregate does not cause this License to apply to the other
|
||||
parts of the aggregate.
|
||||
|
||||
6. Conveying Non-Source Forms.
|
||||
|
||||
You may convey a covered work in object code form under the terms
|
||||
of sections 4 and 5, provided that you also convey the
|
||||
machine-readable Corresponding Source under the terms of this License,
|
||||
in one of these ways:
|
||||
|
||||
a) Convey the object code in, or embodied in, a physical product
|
||||
(including a physical distribution medium), accompanied by the
|
||||
Corresponding Source fixed on a durable physical medium
|
||||
customarily used for software interchange.
|
||||
|
||||
b) Convey the object code in, or embodied in, a physical product
|
||||
(including a physical distribution medium), accompanied by a
|
||||
written offer, valid for at least three years and valid for as
|
||||
long as you offer spare parts or customer support for that product
|
||||
model, to give anyone who possesses the object code either (1) a
|
||||
copy of the Corresponding Source for all the software in the
|
||||
product that is covered by this License, on a durable physical
|
||||
medium customarily used for software interchange, for a price no
|
||||
more than your reasonable cost of physically performing this
|
||||
conveying of source, or (2) access to copy the
|
||||
Corresponding Source from a network server at no charge.
|
||||
|
||||
c) Convey individual copies of the object code with a copy of the
|
||||
written offer to provide the Corresponding Source. This
|
||||
alternative is allowed only occasionally and noncommercially, and
|
||||
only if you received the object code with such an offer, in accord
|
||||
with subsection 6b.
|
||||
|
||||
d) Convey the object code by offering access from a designated
|
||||
place (gratis or for a charge), and offer equivalent access to the
|
||||
Corresponding Source in the same way through the same place at no
|
||||
further charge. You need not require recipients to copy the
|
||||
Corresponding Source along with the object code. If the place to
|
||||
copy the object code is a network server, the Corresponding Source
|
||||
may be on a different server (operated by you or a third party)
|
||||
that supports equivalent copying facilities, provided you maintain
|
||||
clear directions next to the object code saying where to find the
|
||||
Corresponding Source. Regardless of what server hosts the
|
||||
Corresponding Source, you remain obligated to ensure that it is
|
||||
available for as long as needed to satisfy these requirements.
|
||||
|
||||
e) Convey the object code using peer-to-peer transmission, provided
|
||||
you inform other peers where the object code and Corresponding
|
||||
Source of the work are being offered to the general public at no
|
||||
charge under subsection 6d.
|
||||
|
||||
A separable portion of the object code, whose source code is excluded
|
||||
from the Corresponding Source as a System Library, need not be
|
||||
included in conveying the object code work.
|
||||
|
||||
A "User Product" is either (1) a "consumer product", which means any
|
||||
tangible personal property which is normally used for personal, family,
|
||||
or household purposes, or (2) anything designed or sold for incorporation
|
||||
into a dwelling. In determining whether a product is a consumer product,
|
||||
doubtful cases shall be resolved in favor of coverage. For a particular
|
||||
product received by a particular user, "normally used" refers to a
|
||||
typical or common use of that class of product, regardless of the status
|
||||
of the particular user or of the way in which the particular user
|
||||
actually uses, or expects or is expected to use, the product. A product
|
||||
is a consumer product regardless of whether the product has substantial
|
||||
commercial, industrial or non-consumer uses, unless such uses represent
|
||||
the only significant mode of use of the product.
|
||||
|
||||
"Installation Information" for a User Product means any methods,
|
||||
procedures, authorization keys, or other information required to install
|
||||
and execute modified versions of a covered work in that User Product from
|
||||
a modified version of its Corresponding Source. The information must
|
||||
suffice to ensure that the continued functioning of the modified object
|
||||
code is in no case prevented or interfered with solely because
|
||||
modification has been made.
|
||||
|
||||
If you convey an object code work under this section in, or with, or
|
||||
specifically for use in, a User Product, and the conveying occurs as
|
||||
part of a transaction in which the right of possession and use of the
|
||||
User Product is transferred to the recipient in perpetuity or for a
|
||||
fixed term (regardless of how the transaction is characterized), the
|
||||
Corresponding Source conveyed under this section must be accompanied
|
||||
by the Installation Information. But this requirement does not apply
|
||||
if neither you nor any third party retains the ability to install
|
||||
modified object code on the User Product (for example, the work has
|
||||
been installed in ROM).
|
||||
|
||||
The requirement to provide Installation Information does not include a
|
||||
requirement to continue to provide support service, warranty, or updates
|
||||
for a work that has been modified or installed by the recipient, or for
|
||||
the User Product in which it has been modified or installed. Access to a
|
||||
network may be denied when the modification itself materially and
|
||||
adversely affects the operation of the network or violates the rules and
|
||||
protocols for communication across the network.
|
||||
|
||||
Corresponding Source conveyed, and Installation Information provided,
|
||||
in accord with this section must be in a format that is publicly
|
||||
documented (and with an implementation available to the public in
|
||||
source code form), and must require no special password or key for
|
||||
unpacking, reading or copying.
|
||||
|
||||
7. Additional Terms.
|
||||
|
||||
"Additional permissions" are terms that supplement the terms of this
|
||||
License by making exceptions from one or more of its conditions.
|
||||
Additional permissions that are applicable to the entire Program shall
|
||||
be treated as though they were included in this License, to the extent
|
||||
that they are valid under applicable law. If additional permissions
|
||||
apply only to part of the Program, that part may be used separately
|
||||
under those permissions, but the entire Program remains governed by
|
||||
this License without regard to the additional permissions.
|
||||
|
||||
When you convey a copy of a covered work, you may at your option
|
||||
remove any additional permissions from that copy, or from any part of
|
||||
it. (Additional permissions may be written to require their own
|
||||
removal in certain cases when you modify the work.) You may place
|
||||
additional permissions on material, added by you to a covered work,
|
||||
for which you have or can give appropriate copyright permission.
|
||||
|
||||
Notwithstanding any other provision of this License, for material you
|
||||
add to a covered work, you may (if authorized by the copyright holders of
|
||||
that material) supplement the terms of this License with terms:
|
||||
|
||||
a) Disclaiming warranty or limiting liability differently from the
|
||||
terms of sections 15 and 16 of this License; or
|
||||
|
||||
b) Requiring preservation of specified reasonable legal notices or
|
||||
author attributions in that material or in the Appropriate Legal
|
||||
Notices displayed by works containing it; or
|
||||
|
||||
c) Prohibiting misrepresentation of the origin of that material, or
|
||||
requiring that modified versions of such material be marked in
|
||||
reasonable ways as different from the original version; or
|
||||
|
||||
d) Limiting the use for publicity purposes of names of licensors or
|
||||
authors of the material; or
|
||||
|
||||
e) Declining to grant rights under trademark law for use of some
|
||||
trade names, trademarks, or service marks; or
|
||||
|
||||
f) Requiring indemnification of licensors and authors of that
|
||||
material by anyone who conveys the material (or modified versions of
|
||||
it) with contractual assumptions of liability to the recipient, for
|
||||
any liability that these contractual assumptions directly impose on
|
||||
those licensors and authors.
|
||||
|
||||
All other non-permissive additional terms are considered "further
|
||||
restrictions" within the meaning of section 10. If the Program as you
|
||||
received it, or any part of it, contains a notice stating that it is
|
||||
governed by this License along with a term that is a further
|
||||
restriction, you may remove that term. If a license document contains
|
||||
a further restriction but permits relicensing or conveying under this
|
||||
License, you may add to a covered work material governed by the terms
|
||||
of that license document, provided that the further restriction does
|
||||
not survive such relicensing or conveying.
|
||||
|
||||
If you add terms to a covered work in accord with this section, you
|
||||
must place, in the relevant source files, a statement of the
|
||||
additional terms that apply to those files, or a notice indicating
|
||||
where to find the applicable terms.
|
||||
|
||||
Additional terms, permissive or non-permissive, may be stated in the
|
||||
form of a separately written license, or stated as exceptions;
|
||||
the above requirements apply either way.
|
||||
|
||||
8. Termination.
|
||||
|
||||
You may not propagate or modify a covered work except as expressly
|
||||
provided under this License. Any attempt otherwise to propagate or
|
||||
modify it is void, and will automatically terminate your rights under
|
||||
this License (including any patent licenses granted under the third
|
||||
paragraph of section 11).
|
||||
|
||||
However, if you cease all violation of this License, then your
|
||||
license from a particular copyright holder is reinstated (a)
|
||||
provisionally, unless and until the copyright holder explicitly and
|
||||
finally terminates your license, and (b) permanently, if the copyright
|
||||
holder fails to notify you of the violation by some reasonable means
|
||||
prior to 60 days after the cessation.
|
||||
|
||||
Moreover, your license from a particular copyright holder is
|
||||
reinstated permanently if the copyright holder notifies you of the
|
||||
violation by some reasonable means, this is the first time you have
|
||||
received notice of violation of this License (for any work) from that
|
||||
copyright holder, and you cure the violation prior to 30 days after
|
||||
your receipt of the notice.
|
||||
|
||||
Termination of your rights under this section does not terminate the
|
||||
licenses of parties who have received copies or rights from you under
|
||||
this License. If your rights have been terminated and not permanently
|
||||
reinstated, you do not qualify to receive new licenses for the same
|
||||
material under section 10.
|
||||
|
||||
9. Acceptance Not Required for Having Copies.
|
||||
|
||||
You are not required to accept this License in order to receive or
|
||||
run a copy of the Program. Ancillary propagation of a covered work
|
||||
occurring solely as a consequence of using peer-to-peer transmission
|
||||
to receive a copy likewise does not require acceptance. However,
|
||||
nothing other than this License grants you permission to propagate or
|
||||
modify any covered work. These actions infringe copyright if you do
|
||||
not accept this License. Therefore, by modifying or propagating a
|
||||
covered work, you indicate your acceptance of this License to do so.
|
||||
|
||||
10. Automatic Licensing of Downstream Recipients.
|
||||
|
||||
Each time you convey a covered work, the recipient automatically
|
||||
receives a license from the original licensors, to run, modify and
|
||||
propagate that work, subject to this License. You are not responsible
|
||||
for enforcing compliance by third parties with this License.
|
||||
|
||||
An "entity transaction" is a transaction transferring control of an
|
||||
organization, or substantially all assets of one, or subdividing an
|
||||
organization, or merging organizations. If propagation of a covered
|
||||
work results from an entity transaction, each party to that
|
||||
transaction who receives a copy of the work also receives whatever
|
||||
licenses to the work the party's predecessor in interest had or could
|
||||
give under the previous paragraph, plus a right to possession of the
|
||||
Corresponding Source of the work from the predecessor in interest, if
|
||||
the predecessor has it or can get it with reasonable efforts.
|
||||
|
||||
You may not impose any further restrictions on the exercise of the
|
||||
rights granted or affirmed under this License. For example, you may
|
||||
not impose a license fee, royalty, or other charge for exercise of
|
||||
rights granted under this License, and you may not initiate litigation
|
||||
(including a cross-claim or counterclaim in a lawsuit) alleging that
|
||||
any patent claim is infringed by making, using, selling, offering for
|
||||
sale, or importing the Program or any portion of it.
|
||||
|
||||
11. Patents.
|
||||
|
||||
A "contributor" is a copyright holder who authorizes use under this
|
||||
License of the Program or a work on which the Program is based. The
|
||||
work thus licensed is called the contributor's "contributor version".
|
||||
|
||||
A contributor's "essential patent claims" are all patent claims
|
||||
owned or controlled by the contributor, whether already acquired or
|
||||
hereafter acquired, that would be infringed by some manner, permitted
|
||||
by this License, of making, using, or selling its contributor version,
|
||||
but do not include claims that would be infringed only as a
|
||||
consequence of further modification of the contributor version. For
|
||||
purposes of this definition, "control" includes the right to grant
|
||||
patent sublicenses in a manner consistent with the requirements of
|
||||
this License.
|
||||
|
||||
Each contributor grants you a non-exclusive, worldwide, royalty-free
|
||||
patent license under the contributor's essential patent claims, to
|
||||
make, use, sell, offer for sale, import and otherwise run, modify and
|
||||
propagate the contents of its contributor version.
|
||||
|
||||
In the following three paragraphs, a "patent license" is any express
|
||||
agreement or commitment, however denominated, not to enforce a patent
|
||||
(such as an express permission to practice a patent or covenant not to
|
||||
sue for patent infringement). To "grant" such a patent license to a
|
||||
party means to make such an agreement or commitment not to enforce a
|
||||
patent against the party.
|
||||
|
||||
If you convey a covered work, knowingly relying on a patent license,
|
||||
and the Corresponding Source of the work is not available for anyone
|
||||
to copy, free of charge and under the terms of this License, through a
|
||||
publicly available network server or other readily accessible means,
|
||||
then you must either (1) cause the Corresponding Source to be so
|
||||
available, or (2) arrange to deprive yourself of the benefit of the
|
||||
patent license for this particular work, or (3) arrange, in a manner
|
||||
consistent with the requirements of this License, to extend the patent
|
||||
license to downstream recipients. "Knowingly relying" means you have
|
||||
actual knowledge that, but for the patent license, your conveying the
|
||||
covered work in a country, or your recipient's use of the covered work
|
||||
in a country, would infringe one or more identifiable patents in that
|
||||
country that you have reason to believe are valid.
|
||||
|
||||
If, pursuant to or in connection with a single transaction or
|
||||
arrangement, you convey, or propagate by procuring conveyance of, a
|
||||
covered work, and grant a patent license to some of the parties
|
||||
receiving the covered work authorizing them to use, propagate, modify
|
||||
or convey a specific copy of the covered work, then the patent license
|
||||
you grant is automatically extended to all recipients of the covered
|
||||
work and works based on it.
|
||||
|
||||
A patent license is "discriminatory" if it does not include within
|
||||
the scope of its coverage, prohibits the exercise of, or is
|
||||
conditioned on the non-exercise of one or more of the rights that are
|
||||
specifically granted under this License. You may not convey a covered
|
||||
work if you are a party to an arrangement with a third party that is
|
||||
in the business of distributing software, under which you make payment
|
||||
to the third party based on the extent of your activity of conveying
|
||||
the work, and under which the third party grants, to any of the
|
||||
parties who would receive the covered work from you, a discriminatory
|
||||
patent license (a) in connection with copies of the covered work
|
||||
conveyed by you (or copies made from those copies), or (b) primarily
|
||||
for and in connection with specific products or compilations that
|
||||
contain the covered work, unless you entered into that arrangement,
|
||||
or that patent license was granted, prior to 28 March 2007.
|
||||
|
||||
Nothing in this License shall be construed as excluding or limiting
|
||||
any implied license or other defenses to infringement that may
|
||||
otherwise be available to you under applicable patent law.
|
||||
|
||||
12. No Surrender of Others' Freedom.
|
||||
|
||||
If conditions are imposed on you (whether by court order, agreement or
|
||||
otherwise) that contradict the conditions of this License, they do not
|
||||
excuse you from the conditions of this License. If you cannot convey a
|
||||
covered work so as to satisfy simultaneously your obligations under this
|
||||
License and any other pertinent obligations, then as a consequence you may
|
||||
not convey it at all. For example, if you agree to terms that obligate you
|
||||
to collect a royalty for further conveying from those to whom you convey
|
||||
the Program, the only way you could satisfy both those terms and this
|
||||
License would be to refrain entirely from conveying the Program.
|
||||
|
||||
13. Use with the GNU Affero General Public License.
|
||||
|
||||
Notwithstanding any other provision of this License, you have
|
||||
permission to link or combine any covered work with a work licensed
|
||||
under version 3 of the GNU Affero General Public License into a single
|
||||
combined work, and to convey the resulting work. The terms of this
|
||||
License will continue to apply to the part which is the covered work,
|
||||
but the special requirements of the GNU Affero General Public License,
|
||||
section 13, concerning interaction through a network will apply to the
|
||||
combination as such.
|
||||
|
||||
14. Revised Versions of this License.
|
||||
|
||||
The Free Software Foundation may publish revised and/or new versions of
|
||||
the GNU General Public License from time to time. Such new versions will
|
||||
be similar in spirit to the present version, but may differ in detail to
|
||||
address new problems or concerns.
|
||||
|
||||
Each version is given a distinguishing version number. If the
|
||||
Program specifies that a certain numbered version of the GNU General
|
||||
Public License "or any later version" applies to it, you have the
|
||||
option of following the terms and conditions either of that numbered
|
||||
version or of any later version published by the Free Software
|
||||
Foundation. If the Program does not specify a version number of the
|
||||
GNU General Public License, you may choose any version ever published
|
||||
by the Free Software Foundation.
|
||||
|
||||
If the Program specifies that a proxy can decide which future
|
||||
versions of the GNU General Public License can be used, that proxy's
|
||||
public statement of acceptance of a version permanently authorizes you
|
||||
to choose that version for the Program.
|
||||
|
||||
Later license versions may give you additional or different
|
||||
permissions. However, no additional obligations are imposed on any
|
||||
author or copyright holder as a result of your choosing to follow a
|
||||
later version.
|
||||
|
||||
15. Disclaimer of Warranty.
|
||||
|
||||
THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY
|
||||
APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT
|
||||
HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY
|
||||
OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO,
|
||||
THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
|
||||
PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM
|
||||
IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF
|
||||
ALL NECESSARY SERVICING, REPAIR OR CORRECTION.
|
||||
|
||||
16. Limitation of Liability.
|
||||
|
||||
IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
|
||||
WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS
|
||||
THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY
|
||||
GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE
|
||||
USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF
|
||||
DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD
|
||||
PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS),
|
||||
EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF
|
||||
SUCH DAMAGES.
|
||||
|
||||
17. Interpretation of Sections 15 and 16.
|
||||
|
||||
If the disclaimer of warranty and limitation of liability provided
|
||||
above cannot be given local legal effect according to their terms,
|
||||
reviewing courts shall apply local law that most closely approximates
|
||||
an absolute waiver of all civil liability in connection with the
|
||||
Program, unless a warranty or assumption of liability accompanies a
|
||||
copy of the Program in return for a fee.
|
||||
|
||||
END OF TERMS AND CONDITIONS
|
||||
|
||||
How to Apply These Terms to Your New Programs
|
||||
|
||||
If you develop a new program, and you want it to be of the greatest
|
||||
possible use to the public, the best way to achieve this is to make it
|
||||
free software which everyone can redistribute and change under these terms.
|
||||
|
||||
To do so, attach the following notices to the program. It is safest
|
||||
to attach them to the start of each source file to most effectively
|
||||
state the exclusion of warranty; and each file should have at least
|
||||
the "copyright" line and a pointer to where the full notice is found.
|
||||
|
||||
<one line to give the program's name and a brief idea of what it does.>
|
||||
Copyright (C) <year> <name of author>
|
||||
|
||||
This program is free software: you can redistribute it and/or modify
|
||||
it under the terms of the GNU General Public License as published by
|
||||
the Free Software Foundation, either version 3 of the License, or
|
||||
(at your option) any later version.
|
||||
|
||||
This program 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 for more details.
|
||||
|
||||
You should have received a copy of the GNU General Public License
|
||||
along with this program. If not, see <https://www.gnu.org/licenses/>.
|
||||
|
||||
Also add information on how to contact you by electronic and paper mail.
|
||||
|
||||
If the program does terminal interaction, make it output a short
|
||||
notice like this when it starts in an interactive mode:
|
||||
|
||||
<program> Copyright (C) <year> <name of author>
|
||||
This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
|
||||
This is free software, and you are welcome to redistribute it
|
||||
under certain conditions; type `show c' for details.
|
||||
|
||||
The hypothetical commands `show w' and `show c' should show the appropriate
|
||||
parts of the General Public License. Of course, your program's commands
|
||||
might be different; for a GUI interface, you would use an "about box".
|
||||
|
||||
You should also get your employer (if you work as a programmer) or school,
|
||||
if any, to sign a "copyright disclaimer" for the program, if necessary.
|
||||
For more information on this, and how to apply and follow the GNU GPL, see
|
||||
<https://www.gnu.org/licenses/>.
|
||||
|
||||
The GNU General Public License does not permit incorporating your program
|
||||
into proprietary programs. If your program is a subroutine library, you
|
||||
may consider it more useful to permit linking proprietary applications with
|
||||
the library. If this is what you want to do, use the GNU Lesser General
|
||||
Public License instead of this License. But first, please read
|
||||
<https://www.gnu.org/licenses/why-not-lgpl.html>.
|
BIN
vst3/build/asid.vst3/Contents/x86_64-win/asid.vst3
Normal file
BIN
vst3/build/asid.vst3/Plugin.ico
Normal file
After Width: | Height: | Size: 18 KiB |
2
vst3/build/asid.vst3/desktop.ini
Normal file
@ -0,0 +1,2 @@
|
||||
[.ShellClassInfo]
|
||||
IconResource=Plugin.ico,0
|
50
vst3/buildLinux.sh
Executable file
@ -0,0 +1,50 @@
|
||||
#!/bin/bash
|
||||
|
||||
VST_SDK_DIR=../../VST_SDK
|
||||
|
||||
rm -rf build
|
||||
|
||||
mkdir -p build
|
||||
cp -R asid.vst3 build
|
||||
|
||||
mkdir -p build/asid.vst3/Contents/x86_64-linux
|
||||
|
||||
g++ \
|
||||
src/vst3/entry.cpp \
|
||||
src/vst3/plugin.cpp \
|
||||
src/vst3/controllerLinux.cpp \
|
||||
$VST_SDK_DIR/vst3sdk/base/source/fobject.cpp \
|
||||
$VST_SDK_DIR/vst3sdk/base/source/baseiids.cpp \
|
||||
$VST_SDK_DIR/vst3sdk/base/source/fstreamer.cpp \
|
||||
$VST_SDK_DIR/vst3sdk/base/source/fstring.cpp \
|
||||
$VST_SDK_DIR/vst3sdk/pluginterfaces/base/coreiids.cpp \
|
||||
$VST_SDK_DIR/vst3sdk/pluginterfaces/base/funknown.cpp \
|
||||
$VST_SDK_DIR/vst3sdk/pluginterfaces/base/ustring.cpp \
|
||||
$VST_SDK_DIR/vst3sdk/pluginterfaces/base/conststringtable.cpp \
|
||||
$VST_SDK_DIR/vst3sdk/public.sdk/source/main/linuxmain.cpp \
|
||||
$VST_SDK_DIR/vst3sdk/public.sdk/source/main/pluginfactory.cpp \
|
||||
$VST_SDK_DIR/vst3sdk/public.sdk/source/main/moduleinit.cpp \
|
||||
$VST_SDK_DIR/vst3sdk/public.sdk/source/common/commoniids.cpp \
|
||||
$VST_SDK_DIR/vst3sdk/public.sdk/source/common/pluginview.cpp \
|
||||
$VST_SDK_DIR/vst3sdk/public.sdk/source/vst/vstcomponentbase.cpp \
|
||||
$VST_SDK_DIR/vst3sdk/public.sdk/source/vst/vstcomponent.cpp \
|
||||
$VST_SDK_DIR/vst3sdk/public.sdk/source/vst/vstaudioeffect.cpp \
|
||||
$VST_SDK_DIR/vst3sdk/public.sdk/source/vst/vstinitiids.cpp \
|
||||
$VST_SDK_DIR/vst3sdk/public.sdk/source/vst/vstbus.cpp \
|
||||
$VST_SDK_DIR/vst3sdk/public.sdk/source/vst/vsteditcontroller.cpp \
|
||||
$VST_SDK_DIR/vst3sdk/public.sdk/source/vst/vstparameters.cpp \
|
||||
\
|
||||
../src/asid.c \
|
||||
../src/mos_8580_filter.c \
|
||||
src/asid_gui.c \
|
||||
src/gui-x.c \
|
||||
\
|
||||
-DDEVELOPMENT=1 \
|
||||
-I../src \
|
||||
-Isrc \
|
||||
-I$VST_SDK_DIR/vst3sdk/ \
|
||||
-fPIC -shared \
|
||||
-ldl \
|
||||
-rdynamic \
|
||||
-o build/asid.vst3/Contents/x86_64-linux/asid.so
|
||||
# -DRELEASE=1
|
57
vst3/buildWin.sh
Normal file
@ -0,0 +1,57 @@
|
||||
#!/bin/bash
|
||||
|
||||
VST_SDK_DIR=../../VST_SDK
|
||||
|
||||
rm -rf build
|
||||
|
||||
mkdir -p build
|
||||
cp -R asid.vst3 build
|
||||
|
||||
mkdir -p build/asid.vst3/Contents/x86_64-win
|
||||
|
||||
g++ \
|
||||
src/vst3/entry.cpp \
|
||||
src/vst3/plugin.cpp \
|
||||
src/vst3/controllerWin.cpp \
|
||||
$VST_SDK_DIR/vst3sdk/base/source/fobject.cpp \
|
||||
$VST_SDK_DIR/vst3sdk/base/source/baseiids.cpp \
|
||||
$VST_SDK_DIR/vst3sdk/base/source/fstreamer.cpp \
|
||||
$VST_SDK_DIR/vst3sdk/base/source/fstring.cpp \
|
||||
$VST_SDK_DIR/vst3sdk/pluginterfaces/base/coreiids.cpp \
|
||||
$VST_SDK_DIR/vst3sdk/pluginterfaces/base/funknown.cpp \
|
||||
$VST_SDK_DIR/vst3sdk/pluginterfaces/base/ustring.cpp \
|
||||
$VST_SDK_DIR/vst3sdk/pluginterfaces/base/conststringtable.cpp \
|
||||
$VST_SDK_DIR/vst3sdk/public.sdk/source/main/linuxmain.cpp \
|
||||
$VST_SDK_DIR/vst3sdk/public.sdk/source/main/pluginfactory.cpp \
|
||||
$VST_SDK_DIR/vst3sdk/public.sdk/source/main/moduleinit.cpp \
|
||||
$VST_SDK_DIR/vst3sdk/public.sdk/source/common/commoniids.cpp \
|
||||
$VST_SDK_DIR/vst3sdk/public.sdk/source/common/pluginview.cpp \
|
||||
$VST_SDK_DIR/vst3sdk/public.sdk/source/vst/vstcomponentbase.cpp \
|
||||
$VST_SDK_DIR/vst3sdk/public.sdk/source/vst/vstcomponent.cpp \
|
||||
$VST_SDK_DIR/vst3sdk/public.sdk/source/vst/vstaudioeffect.cpp \
|
||||
$VST_SDK_DIR/vst3sdk/public.sdk/source/vst/vstinitiids.cpp \
|
||||
$VST_SDK_DIR/vst3sdk/public.sdk/source/vst/vstbus.cpp \
|
||||
$VST_SDK_DIR/vst3sdk/public.sdk/source/vst/vsteditcontroller.cpp \
|
||||
$VST_SDK_DIR/vst3sdk/public.sdk/source/vst/vstparameters.cpp \
|
||||
$VST_SDK_DIR/vst3sdk/base/source/fdebug.cpp \
|
||||
$VST_SDK_DIR/vst3sdk/base/source/updatehandler.cpp \
|
||||
$VST_SDK_DIR/vst3sdk/base/thread/source/flock.cpp \
|
||||
$VST_SDK_DIR/vst3sdk/base/source/fbuffer.cpp \
|
||||
\
|
||||
../src/asid.c \
|
||||
../src/mos_8580_filter.c \
|
||||
src/asid_gui.c \
|
||||
src/gui-win32.c \
|
||||
\
|
||||
-DRELEASE=1 \
|
||||
-I../src \
|
||||
-Isrc \
|
||||
-I$VST_SDK_DIR/vst3sdk/ \
|
||||
-lole32 \
|
||||
-fPIC -shared \
|
||||
-mwindows \
|
||||
-static \
|
||||
-static-libgcc \
|
||||
-static-libstdc++ \
|
||||
-o build/asid.vst3/Contents/x86_64-win/asid.vst3 \
|
||||
-O3
|
882
vst3/src/asid_gui.c
Normal file
@ -0,0 +1,882 @@
|
||||
/*
|
||||
* A-SID - C64 bandpass filter + LFO
|
||||
*
|
||||
* Copyright (C) 2022 Orastron srl unipersonale
|
||||
*
|
||||
* A-SID is free software: you can redistribute it and/or modify
|
||||
* it under the terms of the GNU General Public License as published by
|
||||
* the Free Software Foundation, version 3 of the License.
|
||||
*
|
||||
* A-SID 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 for more details.
|
||||
*
|
||||
* You should have received a copy of the GNU General Public License
|
||||
*
|
||||
* File author: Paolo Marrone
|
||||
*/
|
||||
|
||||
#include "asid_gui.h"
|
||||
#include <cstdio>
|
||||
|
||||
#include <sys/time.h>
|
||||
|
||||
#include "vst3/controller.h"
|
||||
|
||||
#ifdef __cplusplus
|
||||
extern "C" {
|
||||
#endif
|
||||
|
||||
|
||||
#define PIXELED
|
||||
#ifdef PIXELED
|
||||
#define RESIZE_FUNC pixeled_resize
|
||||
#else
|
||||
#define RESIZE_FUNC bilinear_interpolation_resize
|
||||
#endif
|
||||
|
||||
static const uint32_t width_default = 404;
|
||||
static const uint32_t height_default = 284;
|
||||
|
||||
static const uint32_t inner_width_default = 320;
|
||||
static const uint32_t inner_height_default = 200;
|
||||
static const uint32_t inner_size_pixel = inner_width_default * inner_height_default * 4;
|
||||
|
||||
static const float imgrate = 1.422535211267606f;
|
||||
static const float innerImgrate = 1.6f;
|
||||
|
||||
static const uint32_t padding_default = 42;
|
||||
|
||||
// Default slider positions
|
||||
static const uint32_t param_cutoff_x1 = 22; // left border
|
||||
static const uint32_t param_cutoff_x2 = 33; // right border
|
||||
static const uint32_t param_lfoamt_x1 = 94;
|
||||
static const uint32_t param_lfoamt_x2 = 105;
|
||||
static const uint32_t param_lfospd_x1 = 166;
|
||||
static const uint32_t param_lfospd_x2 = 177;
|
||||
static const uint32_t params_y1 = 38; // top border
|
||||
static const uint32_t params_y2 = 161; // bottom border
|
||||
static const uint32_t params_w = 10; // without borders
|
||||
static const uint32_t params_h = 122; // without borders
|
||||
static const uint32_t params_inner_h = 121; // Just the content
|
||||
static const uint32_t params_inner_y = 40;
|
||||
|
||||
// Default parameter BOX positions
|
||||
static const uint32_t parambox_cutoff_x1 = 0;
|
||||
static const uint32_t parambox_cutoff_x2 = 57;
|
||||
static const uint32_t parambox_lfoamt_x1 = 72;
|
||||
static const uint32_t parambox_lfoamt_x2 = 129;
|
||||
static const uint32_t parambox_lfospd_x1 = 144;
|
||||
static const uint32_t parambox_lfospd_x2 = 201;
|
||||
static const uint32_t paramboxs_y1 = 38;
|
||||
static const uint32_t paramboxs_y2 = 187;
|
||||
static const uint32_t paramboxs_w = 58;
|
||||
static const uint32_t paramboxs_h = 152;
|
||||
|
||||
// Default modulated cutoff slider position
|
||||
static const uint32_t modCutoff_x1 = 35;
|
||||
static const uint32_t modCutoff_x2 = 39;
|
||||
static const uint32_t modCutoff_y1 = 40;
|
||||
static const uint32_t modCutoff_y2 = 159;
|
||||
static const uint32_t modCutoff_w = 5;
|
||||
static const uint32_t modCutoff_h = 120;
|
||||
|
||||
static uint8_t colors_default[4][3] = {
|
||||
{102, 204, 0},
|
||||
{170, 0, 0},
|
||||
{204, 68, 204},
|
||||
{0, 0, 136}
|
||||
};
|
||||
|
||||
static uint8_t color_grey[3] = {51, 51, 51};
|
||||
|
||||
|
||||
#include "screens.h"
|
||||
|
||||
static const uint8_t* screen_map_defaults[] = {screen1_map_default, screen2_map_default, screen3_map_default, screen4_map_default};
|
||||
|
||||
struct _asid_gui {
|
||||
void *handle;
|
||||
|
||||
asid_gui_view window; // Main window
|
||||
|
||||
|
||||
unsigned char* screen_maps[4];
|
||||
|
||||
unsigned char* resized[4];
|
||||
|
||||
float scaleFactor;
|
||||
float scaleFactorInv;
|
||||
|
||||
uint32_t w;
|
||||
uint32_t h;
|
||||
|
||||
uint32_t xWhite;
|
||||
uint32_t yWhite;
|
||||
uint32_t wWhite;
|
||||
uint32_t hWhite;
|
||||
|
||||
uint32_t xContent;
|
||||
uint32_t yContent;
|
||||
uint32_t wContent;
|
||||
uint32_t hContent;
|
||||
|
||||
uint32_t xCutoff;
|
||||
uint32_t xAmount;
|
||||
uint32_t xSpeed;
|
||||
uint32_t yParams;
|
||||
uint32_t wParams;
|
||||
uint32_t hParams;
|
||||
|
||||
uint32_t xBoxCutoff;
|
||||
uint32_t xBoxAmount;
|
||||
uint32_t xBoxSpeed;
|
||||
uint32_t yBoxParams;
|
||||
uint32_t wBoxParams;
|
||||
uint32_t hBoxParams;
|
||||
|
||||
uint32_t xModCutoff;
|
||||
uint32_t yModCutoff;
|
||||
uint32_t wModCutoff;
|
||||
uint32_t hModCutoff;
|
||||
|
||||
// Params state
|
||||
float paramValues[3];
|
||||
float paramMappedValues[3];
|
||||
|
||||
// Hover state
|
||||
char param_hover; // -1 = None, 0 = cutoff, 1 = amount, 2 = speed
|
||||
|
||||
// Mouse selection state
|
||||
char param_selected; // -1 = None, 0 = cutoff, 1 = amount, 2 = speed
|
||||
int mouse_old_y;
|
||||
|
||||
// Screen map default
|
||||
char screen_map_selected_old;
|
||||
char screen_map_selected;
|
||||
|
||||
// Mod cutoff
|
||||
float modCutoffValue;
|
||||
|
||||
// Redrawing state
|
||||
char paramToRedraw[3];
|
||||
char modCutoffToRedraw;
|
||||
char toResize;
|
||||
};
|
||||
|
||||
|
||||
static uint32_t floorI(float x) {
|
||||
return (uint32_t) x;
|
||||
}
|
||||
|
||||
static uint32_t ceilI(float x) {
|
||||
uint32_t f = floorI(x);
|
||||
return f + (x - (float) f <= 0.000001f ? 0 : 1);
|
||||
}
|
||||
|
||||
static void floorceilI(float x, uint32_t* floor, uint32_t* ceil) {
|
||||
*floor = (uint32_t) x;
|
||||
*ceil = *floor + (x - (float) *floor <= 0.000001f ? 0 : 1);
|
||||
}
|
||||
|
||||
static uint32_t minI(uint32_t x1, uint32_t x2) {
|
||||
return x1 <= x2 ? x1 : x2;
|
||||
}
|
||||
|
||||
static float minF(float x1, float x2) {
|
||||
return x1 < x2 ? x1 : x2;
|
||||
}
|
||||
|
||||
static float maxF(float x1, float x2) {
|
||||
return x1 > x2 ? x1 : x2;
|
||||
}
|
||||
|
||||
static float clipF(float x, float min, float max) {
|
||||
return minF(max, maxF(min, x));
|
||||
}
|
||||
|
||||
|
||||
static void pixeled_resize (
|
||||
unsigned char *src, unsigned char *dest,
|
||||
uint32_t src_w, uint32_t src_h,
|
||||
uint32_t src_target_x, uint32_t src_target_y, uint32_t src_target_w, uint32_t src_target_h,
|
||||
uint32_t dest_w, uint32_t dest_h,
|
||||
uint32_t dest_target_x, uint32_t dest_target_y, uint32_t dest_target_w, uint32_t dest_target_h)
|
||||
{
|
||||
const float w_scale_factor = (float) src_target_w / (float) dest_target_w;
|
||||
const float h_scale_factor = (float) src_target_h / (float) dest_target_h;
|
||||
|
||||
const uint32_t wOffset = (dest_w - dest_target_w) << 2;
|
||||
uint32_t newIndex = (dest_target_y * dest_w + dest_target_x) << 2;
|
||||
|
||||
for (uint32_t ri = 0; ri < dest_target_h; ri++) {
|
||||
const float y = (float) ri * h_scale_factor + src_target_y;
|
||||
uint32_t y_floor, y_ceil;
|
||||
floorceilI(y, &y_floor, &y_ceil);
|
||||
y_ceil = minI(src_h - 1, y_ceil);
|
||||
|
||||
const uint32_t yFall = y - y_floor < 0.5f ? y_floor : y_ceil;
|
||||
|
||||
for (uint32_t ci = 0; ci < dest_target_w; ci++) {
|
||||
|
||||
const float x = (float) ci * w_scale_factor + src_target_x;
|
||||
uint32_t x_floor, x_ceil;
|
||||
floorceilI(x, &x_floor, &x_ceil);
|
||||
x_ceil = minI(src_w - 1, x_ceil);
|
||||
|
||||
const uint32_t xFall = x - x_floor < 0.5f ? x_floor : x_ceil;
|
||||
|
||||
const uint32_t pixelIndex = (yFall * src_w + xFall) << 2;
|
||||
|
||||
dest[newIndex++] = src[pixelIndex + 0];;
|
||||
dest[newIndex++] = src[pixelIndex + 1];;
|
||||
dest[newIndex++] = src[pixelIndex + 2];;
|
||||
dest[newIndex++] = 0;
|
||||
}
|
||||
newIndex += wOffset;
|
||||
}
|
||||
}
|
||||
|
||||
|
||||
static void bilinear_interpolation_resize (
|
||||
unsigned char *src, unsigned char *dest,
|
||||
uint32_t src_w, uint32_t src_h,
|
||||
uint32_t src_target_x, uint32_t src_target_y, uint32_t src_target_w, uint32_t src_target_h,
|
||||
uint32_t dest_w, uint32_t dest_h,
|
||||
uint32_t dest_target_x, uint32_t dest_target_y, uint32_t dest_target_w, uint32_t dest_target_h)
|
||||
{
|
||||
const float w_scale_factor = (float) src_target_w / (float) dest_target_w;
|
||||
const float h_scale_factor = (float) src_target_h / (float) dest_target_h;
|
||||
|
||||
const uint32_t wOffset = (dest_w - dest_target_w) << 2;
|
||||
uint32_t newIndex = (dest_target_y * dest_w + dest_target_x) << 2;
|
||||
|
||||
for (uint32_t ri = 0; ri < dest_target_h; ri++) {
|
||||
const float y = (float) ri * h_scale_factor + src_target_y;
|
||||
uint32_t y_floor, y_ceil;
|
||||
floorceilI(y, &y_floor, &y_ceil);
|
||||
y_ceil = minI(src_h - 1, y_ceil);
|
||||
const int B = (int) ((y - (float) y_floor) * 255.f);
|
||||
|
||||
for (uint32_t ci = 0; ci < dest_target_w; ci++) {
|
||||
|
||||
const float x = (float) ci * w_scale_factor + src_target_x;
|
||||
uint32_t x_floor, x_ceil;
|
||||
floorceilI(x, &x_floor, &x_ceil);
|
||||
x_ceil = minI(src_w - 1, x_ceil);
|
||||
|
||||
unsigned char a, b, c;
|
||||
|
||||
if (x_ceil == x_floor && y_ceil == y_floor) {
|
||||
const uint32_t pixelIndex = (y_floor * src_w + x_floor) << 2;
|
||||
a = src[pixelIndex + 0];
|
||||
b = src[pixelIndex + 1];
|
||||
c = src[pixelIndex + 2];
|
||||
}
|
||||
|
||||
else if (x_ceil == x_floor) {
|
||||
const uint32_t pixelIndex1 = (y_floor * src_w + x_floor) << 2;
|
||||
const uint32_t pixelIndex2 = pixelIndex1 + (src_w << 2);
|
||||
|
||||
a = (unsigned char) ((int) src[pixelIndex1 + 0] + ((B * ((int) src[pixelIndex2 + 0] - (int) src[pixelIndex1 + 0])) >> 8));
|
||||
b = (unsigned char) ((int) src[pixelIndex1 + 1] + ((B * ((int) src[pixelIndex2 + 1] - (int) src[pixelIndex1 + 1])) >> 8));
|
||||
c = (unsigned char) ((int) src[pixelIndex1 + 2] + ((B * ((int) src[pixelIndex2 + 2] - (int) src[pixelIndex1 + 2])) >> 8));
|
||||
}
|
||||
|
||||
else if (y_ceil == y_floor) {
|
||||
const uint32_t pixelIndex1 = (y_floor * src_w + x_floor) << 2;
|
||||
const uint32_t pixelIndex2 = pixelIndex1 + 4;
|
||||
|
||||
const int A = (int) ((x - (float) x_floor) * 255.f);
|
||||
|
||||
a = (unsigned char) ((int) src[pixelIndex1 + 0] + ((A * ((int) src[pixelIndex2 + 0] - (int) src[pixelIndex1 + 0])) >> 8));
|
||||
b = (unsigned char) ((int) src[pixelIndex1 + 1] + ((A * ((int) src[pixelIndex2 + 1] - (int) src[pixelIndex1 + 1])) >> 8));
|
||||
c = (unsigned char) ((int) src[pixelIndex1 + 2] + ((A * ((int) src[pixelIndex2 + 2] - (int) src[pixelIndex1 + 2])) >> 8));
|
||||
}
|
||||
|
||||
else {
|
||||
const uint32_t pixelIndex1 = (y_floor * src_w + x_floor) << 2;
|
||||
const uint32_t pixelIndex2 = pixelIndex1 + 4;
|
||||
const uint32_t pixelIndex3 = pixelIndex1 + (src_w << 2);
|
||||
const uint32_t pixelIndex4 = pixelIndex3 + 4;
|
||||
|
||||
const int A = (int) ((x - (float) x_floor) * 255.f);
|
||||
|
||||
const int a1 = (int) src[pixelIndex1 + 0] + ((A * ((int) src[pixelIndex2 + 0] - (int) src[pixelIndex1 + 0])) >> 8);
|
||||
const int b1 = (int) src[pixelIndex1 + 1] + ((A * ((int) src[pixelIndex2 + 1] - (int) src[pixelIndex1 + 1])) >> 8);
|
||||
const int c1 = (int) src[pixelIndex1 + 2] + ((A * ((int) src[pixelIndex2 + 2] - (int) src[pixelIndex1 + 2])) >> 8);
|
||||
|
||||
const int a2 = (int) src[pixelIndex3 + 0] + ((A * ((int) src[pixelIndex4 + 0] - (int) src[pixelIndex3 + 0])) >> 8);
|
||||
const int b2 = (int) src[pixelIndex3 + 1] + ((A * ((int) src[pixelIndex4 + 1] - (int) src[pixelIndex3 + 1])) >> 8);
|
||||
const int c2 = (int) src[pixelIndex3 + 2] + ((A * ((int) src[pixelIndex4 + 2] - (int) src[pixelIndex3 + 2])) >> 8);
|
||||
|
||||
a = (unsigned char) (a1 + ((B * (a2 - a1)) >> 8));
|
||||
b = (unsigned char) (b1 + ((B * (b2 - b1)) >> 8));
|
||||
c = (unsigned char) (c1 + ((B * (c2 - c1)) >> 8));
|
||||
}
|
||||
|
||||
dest[newIndex++] = a;
|
||||
dest[newIndex++] = b;
|
||||
dest[newIndex++] = c;
|
||||
dest[newIndex++] = 0;
|
||||
}
|
||||
newIndex += wOffset;
|
||||
}
|
||||
}
|
||||
|
||||
static void draw_parameter_fixed(asid_gui gui, char p) {
|
||||
uint32_t pb_x1, pb_x2, yValue;
|
||||
uint32_t p_x1, p_x2;
|
||||
|
||||
if (p == 0) {
|
||||
pb_x1 = parambox_cutoff_x1;
|
||||
pb_x2 = parambox_cutoff_x2;
|
||||
p_x1 = param_cutoff_x1;
|
||||
p_x2 = param_cutoff_x2;
|
||||
yValue = (uint32_t) ((1.f - gui->paramMappedValues[p]) * (float) params_inner_h) + params_inner_y;
|
||||
}
|
||||
else if (p == 1) {
|
||||
pb_x1 = parambox_lfoamt_x1;
|
||||
pb_x2 = parambox_lfoamt_x2;
|
||||
p_x1 = param_lfoamt_x1;
|
||||
p_x2 = param_lfoamt_x2;
|
||||
yValue = (uint32_t) ((1.f - gui->paramMappedValues[p]) * (float) params_inner_h) + params_inner_y;
|
||||
}
|
||||
else if (p == 2) {
|
||||
pb_x1 = parambox_lfospd_x1;
|
||||
pb_x2 = parambox_lfospd_x2;
|
||||
p_x1 = param_lfospd_x1;
|
||||
p_x2 = param_lfospd_x2;
|
||||
yValue = (uint32_t) ((1.f - gui->paramMappedValues[p]) * (float) params_inner_h) + params_inner_y;
|
||||
}
|
||||
else
|
||||
return;
|
||||
|
||||
uint32_t index = ((paramboxs_y1) * inner_width_default + pb_x1) << 2;
|
||||
uint32_t wOffset = (inner_width_default - paramboxs_w) << 2;
|
||||
|
||||
if (gui->param_hover == p) { // isHover
|
||||
for (uint32_t c = paramboxs_y1; c <= paramboxs_y2; c++) {
|
||||
for (int r = pb_x1; r <= pb_x2; r++) {
|
||||
if (screen_map_defaults[0][index] != 255) {
|
||||
for (char i = 0; i < 4; i++) {
|
||||
gui->screen_maps[i][index + 0] = colors_default[i][0];
|
||||
gui->screen_maps[i][index + 1] = colors_default[i][1];
|
||||
gui->screen_maps[i][index + 2] = colors_default[i][2];
|
||||
}
|
||||
}
|
||||
index += 4;
|
||||
}
|
||||
index += wOffset;
|
||||
}
|
||||
}
|
||||
else {
|
||||
for (uint32_t c = paramboxs_y1; c <= paramboxs_y2; c++) {
|
||||
for (int r = pb_x1; r <= pb_x2; r++) {
|
||||
if (screen_map_defaults[0][index] != 255) {
|
||||
for (char i = 0; i < 4; i++) {
|
||||
gui->screen_maps[i][index + 0] = screen_map_defaults[0][index + 0];
|
||||
gui->screen_maps[i][index + 1] = screen_map_defaults[0][index + 1];
|
||||
gui->screen_maps[i][index + 2] = screen_map_defaults[0][index + 2];
|
||||
}
|
||||
}
|
||||
index += 4;
|
||||
}
|
||||
index += wOffset;
|
||||
}
|
||||
}
|
||||
index = (params_inner_y * inner_width_default + p_x1 + 1) << 2;
|
||||
wOffset = (inner_width_default - params_w) << 2;
|
||||
for (uint32_t c = params_inner_y; c < yValue; c++) {
|
||||
for (int r = p_x1 + 1; r < p_x2; r++) {
|
||||
for (char i = 0; i < 4; i++) {
|
||||
gui->screen_maps[i][index + 0] = 255;
|
||||
gui->screen_maps[i][index + 1] = 255;
|
||||
gui->screen_maps[i][index + 2] = 255;
|
||||
}
|
||||
index += 4;
|
||||
}
|
||||
index += wOffset;
|
||||
}
|
||||
}
|
||||
|
||||
static void draw_parameter_resized(asid_gui gui, char p) {
|
||||
uint32_t pb_x1, resized_x1;
|
||||
if (p == 0) {
|
||||
pb_x1 = parambox_cutoff_x1;
|
||||
resized_x1 = gui->xBoxCutoff;
|
||||
}
|
||||
else if (p == 1) {
|
||||
pb_x1 = parambox_lfoamt_x1;
|
||||
resized_x1 = gui->xBoxAmount;
|
||||
}
|
||||
else if (p == 2) {
|
||||
pb_x1 = parambox_lfospd_x1;
|
||||
resized_x1 = gui->xBoxSpeed;
|
||||
}
|
||||
else
|
||||
return;
|
||||
|
||||
for (int ri = 0; ri < 4; ri++) {
|
||||
RESIZE_FUNC(
|
||||
gui->screen_maps[ri], gui->resized[ri],
|
||||
inner_width_default, inner_height_default,
|
||||
pb_x1, paramboxs_y1, paramboxs_w, paramboxs_h,
|
||||
gui->w, gui->h,
|
||||
resized_x1, gui->yBoxParams, gui->wBoxParams, gui->hBoxParams);
|
||||
}
|
||||
}
|
||||
|
||||
static void update_gui_parameter(asid_gui gui, char p) {
|
||||
uint32_t resized_x1;
|
||||
if (p == 0) {
|
||||
resized_x1 = gui->xBoxCutoff;
|
||||
}
|
||||
else if (p == 1) {
|
||||
resized_x1 = gui->xBoxAmount;
|
||||
}
|
||||
else if (p == 2) {
|
||||
resized_x1 = gui->xBoxSpeed;
|
||||
}
|
||||
else
|
||||
return;
|
||||
|
||||
gui_window_draw (gui->window, gui->resized[gui->screen_map_selected],
|
||||
resized_x1, gui->yBoxParams, gui->w, gui->h,
|
||||
resized_x1, gui->yBoxParams, gui->wBoxParams, gui->hBoxParams);
|
||||
}
|
||||
|
||||
static void draw_modCutoff_slider_fixed (asid_gui gui) {
|
||||
static const uint32_t indexStart = (modCutoff_y1 * inner_width_default + modCutoff_x1) << 2;
|
||||
static const uint32_t wOffset = (inner_width_default - modCutoff_w) << 2;
|
||||
const uint32_t yMid = modCutoff_y1 + (uint32_t) ((1.f - gui->modCutoffValue) * modCutoff_h);
|
||||
uint8_t* colors = color_grey;
|
||||
for (int ri = 0; ri < 4; ri++) {
|
||||
if (gui->param_selected == 0 || gui->param_hover == 0)
|
||||
colors = colors_default[ri];
|
||||
uint32_t index = indexStart;
|
||||
uint32_t r = modCutoff_y1;
|
||||
for (; r < yMid; r++) {
|
||||
for (uint32_t c = modCutoff_x1; c <= modCutoff_x2; c++) {
|
||||
gui->screen_maps[ri][index + 0] = 255; // Optimize: see array of char as array of int32.
|
||||
gui->screen_maps[ri][index + 1] = 255;
|
||||
gui->screen_maps[ri][index + 2] = 255;
|
||||
index += 4;
|
||||
}
|
||||
index += wOffset;
|
||||
}
|
||||
for (; r <= modCutoff_y2; r++) {
|
||||
for (uint32_t c = modCutoff_x1; c <= modCutoff_x2; c++) {
|
||||
gui->screen_maps[ri][index + 0] = colors[0];
|
||||
gui->screen_maps[ri][index + 1] = colors[1];
|
||||
gui->screen_maps[ri][index + 2] = colors[2];
|
||||
index += 4;
|
||||
}
|
||||
index += wOffset;
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
static void draw_padding (unsigned char* img, uint32_t xBlack, uint32_t yBlack, uint32_t wBlack, uint32_t hBlack,
|
||||
uint32_t xWhite, uint32_t yWhite, uint32_t wWhite, uint32_t hWhite) {
|
||||
memset(img, 0, (wBlack * hBlack) << 2);
|
||||
|
||||
uint32_t index = (yWhite * wBlack + xWhite) << 2;
|
||||
for (uint32_t i = 0; i < hWhite; i++) {
|
||||
memset(&(img[index]), 255, wWhite << 2);
|
||||
index += wBlack << 2;
|
||||
}
|
||||
}
|
||||
|
||||
void asid_gui_view_resize(asid_gui gui, asid_gui_view view, uint32_t width, uint32_t height) {
|
||||
float newrate = (float)width / (float) height;
|
||||
|
||||
if (newrate >= imgrate) {
|
||||
gui->wWhite = (uint32_t) (imgrate * (float) height);
|
||||
gui->hWhite = height;
|
||||
gui->xWhite = (width - gui->wWhite) >> 1;
|
||||
gui->yWhite = 0;
|
||||
}
|
||||
else {
|
||||
gui->wWhite = width;
|
||||
gui->hWhite = (uint32_t) (((float) width) / imgrate);
|
||||
gui->xWhite = 0;
|
||||
gui->yWhite = (height - gui->hWhite) >> 1;
|
||||
}
|
||||
|
||||
gui->scaleFactor = (float) gui->wWhite / (float) width_default;
|
||||
gui->scaleFactorInv = 1.f / gui->scaleFactor;
|
||||
uint32_t newPadding = (uint32_t) (((float) padding_default) * gui->scaleFactor);
|
||||
|
||||
gui->xContent = gui->xWhite + newPadding;
|
||||
gui->yContent = gui->yWhite + newPadding;
|
||||
gui->wContent = gui->wWhite - (newPadding << 1);
|
||||
gui->hContent = gui->hWhite - (newPadding << 1);
|
||||
|
||||
gui->xCutoff = (uint32_t) (gui->xContent + ((float) (param_cutoff_x1 + 1)) * gui->scaleFactor);
|
||||
gui->xAmount = (uint32_t) (gui->xContent + ((float) (param_lfoamt_x1 + 1)) * gui->scaleFactor);
|
||||
gui->xSpeed = (uint32_t) (gui->xContent + ((float) (param_lfospd_x1 + 1)) * gui->scaleFactor);
|
||||
gui->yParams = (uint32_t) (gui->yContent + ((float) (params_y1 + 1)) * gui->scaleFactor);
|
||||
gui->wParams = (uint32_t) (((float) params_w) * gui->scaleFactor);
|
||||
gui->hParams = (uint32_t) (((float) params_h) * gui->scaleFactor);
|
||||
|
||||
gui->xBoxCutoff = (uint32_t) (gui->xContent + ((float) (parambox_cutoff_x1)) * gui->scaleFactor); // Forse round è meglio
|
||||
gui->xBoxAmount = (uint32_t) (gui->xContent + ((float) (parambox_lfoamt_x1)) * gui->scaleFactor);
|
||||
gui->xBoxSpeed = (uint32_t) (gui->xContent + ((float) (parambox_lfospd_x1)) * gui->scaleFactor);
|
||||
gui->yBoxParams = (uint32_t) (gui->yContent + ((float) (paramboxs_y1)) * gui->scaleFactor);
|
||||
gui->wBoxParams = ceilI (((float) paramboxs_w) * gui->scaleFactor);
|
||||
gui->hBoxParams = ceilI (((float) paramboxs_h) * gui->scaleFactor);
|
||||
|
||||
gui->xModCutoff = gui->xContent + (uint32_t) (((float) modCutoff_x1) * gui->scaleFactor);
|
||||
gui->yModCutoff = gui->yContent + (uint32_t) (((float) modCutoff_y1) * gui->scaleFactor);
|
||||
gui->wModCutoff = ceilI (((float) modCutoff_w) * gui->scaleFactor);
|
||||
gui->hModCutoff = ceilI (((float) modCutoff_h) * gui->scaleFactor);
|
||||
|
||||
gui->w = width;
|
||||
gui->h = height;
|
||||
|
||||
gui->toResize = 1;
|
||||
}
|
||||
|
||||
static void draw_resized (asid_gui gui) {
|
||||
const uint32_t size = (gui->w * gui->h) << 2;
|
||||
gui->resized[0] = (unsigned char*) realloc(gui->resized[0], size);
|
||||
gui->resized[1] = (unsigned char*) realloc(gui->resized[1], size);
|
||||
gui->resized[2] = (unsigned char*) realloc(gui->resized[2], size);
|
||||
gui->resized[3] = (unsigned char*) realloc(gui->resized[3], size);
|
||||
|
||||
if (gui->resized[0] == NULL || gui->resized[1] == NULL || gui->resized[2] == NULL || gui->resized[3] == NULL) {
|
||||
return;
|
||||
}
|
||||
|
||||
for (int ri = 0; ri < 4; ri++) {
|
||||
draw_padding(gui->resized[ri], 0, 0, gui->w, gui->h, gui->xWhite, gui->yWhite, gui->wWhite, gui->hWhite);
|
||||
RESIZE_FUNC(
|
||||
gui->screen_maps[ri], gui->resized[ri],
|
||||
inner_width_default, inner_height_default,
|
||||
0, 0, inner_width_default, inner_height_default,
|
||||
gui->w, gui->h,
|
||||
gui->xContent, gui->yContent, gui->wContent, gui->hContent);
|
||||
}
|
||||
}
|
||||
|
||||
static void update_gui_resize (asid_gui gui) {
|
||||
gui_window_resize(gui->window, gui->w, gui->h);
|
||||
gui_window_draw (gui->window, gui->resized[gui->screen_map_selected], 0, 0, gui->w, gui->h, 0, 0, gui->w, gui->h);
|
||||
}
|
||||
|
||||
static void piggyback_draw(asid_gui gui) {
|
||||
if (gui == NULL || gui->window == NULL) {
|
||||
return;
|
||||
}
|
||||
|
||||
for (int i = 0; i < 3; i++) {
|
||||
if (gui->paramToRedraw[i])
|
||||
draw_parameter_fixed(gui, i);
|
||||
}
|
||||
if (gui->modCutoffToRedraw)
|
||||
draw_modCutoff_slider_fixed(gui);
|
||||
|
||||
if (gui->toResize) {
|
||||
draw_resized(gui);
|
||||
update_gui_resize(gui);
|
||||
for (int i = 0; i < 3; i++)
|
||||
gui->paramToRedraw[i] = 1;
|
||||
gui->modCutoffToRedraw = 0;
|
||||
gui->toResize = 0;
|
||||
}
|
||||
else {
|
||||
for (int i = 0; i < 3; i++) {
|
||||
if (gui->paramToRedraw[i])
|
||||
draw_parameter_resized(gui, i);
|
||||
}
|
||||
if (gui->paramToRedraw[0] == 0 && gui->modCutoffToRedraw)
|
||||
draw_parameter_resized(gui, 0);
|
||||
|
||||
if (gui->screen_map_selected != gui->screen_map_selected_old) {
|
||||
gui_window_draw (gui->window, gui->resized[gui->screen_map_selected],
|
||||
gui->xContent, gui->yContent, gui->w, gui->h,
|
||||
gui->xContent, gui->yContent, gui->wContent, gui->hContent);
|
||||
gui->screen_map_selected_old = gui->screen_map_selected;
|
||||
}
|
||||
else {
|
||||
for (int i = 0; i < 3; i++) {
|
||||
if (gui->paramToRedraw[i])
|
||||
update_gui_parameter(gui, i);
|
||||
}
|
||||
if (gui->paramToRedraw[0] == 0 && gui->modCutoffToRedraw)
|
||||
update_gui_parameter(gui, 0);
|
||||
}
|
||||
|
||||
gui->paramToRedraw[0] = 0;
|
||||
gui->paramToRedraw[1] = 0;
|
||||
gui->paramToRedraw[2] = 0;
|
||||
gui->modCutoffToRedraw = 0;
|
||||
}
|
||||
}
|
||||
|
||||
asid_gui asid_gui_new(void *handle) {
|
||||
asid_gui gui = (asid_gui)malloc(sizeof(struct _asid_gui));
|
||||
if (gui == NULL)
|
||||
return NULL;
|
||||
|
||||
gui->handle = handle;
|
||||
gui->window = NULL; // Main and only window
|
||||
|
||||
gui_init();
|
||||
|
||||
gui->screen_maps[0] = (unsigned char*) malloc(inner_size_pixel);
|
||||
gui->screen_maps[1] = (unsigned char*) malloc(inner_size_pixel);
|
||||
gui->screen_maps[2] = (unsigned char*) malloc(inner_size_pixel);
|
||||
gui->screen_maps[3] = (unsigned char*) malloc(inner_size_pixel);
|
||||
|
||||
memcpy(gui->screen_maps[0], screen_map_defaults[0], inner_size_pixel);
|
||||
memcpy(gui->screen_maps[1], screen_map_defaults[1], inner_size_pixel);
|
||||
memcpy(gui->screen_maps[2], screen_map_defaults[2], inner_size_pixel);
|
||||
memcpy(gui->screen_maps[3], screen_map_defaults[3], inner_size_pixel);
|
||||
|
||||
gui->resized[0] = NULL;
|
||||
gui->resized[1] = NULL;
|
||||
gui->resized[2] = NULL;
|
||||
gui->resized[3] = NULL;
|
||||
|
||||
gui->scaleFactor = 1.f;
|
||||
gui->scaleFactorInv = 1.f;
|
||||
|
||||
gui->w = width_default;
|
||||
gui->h = height_default;
|
||||
|
||||
gui->xWhite = 0;
|
||||
gui->yWhite = 0;
|
||||
gui->wWhite = width_default;
|
||||
gui->hWhite = height_default;
|
||||
|
||||
gui->xContent = padding_default;
|
||||
gui->yContent = padding_default;
|
||||
gui->wContent = inner_width_default;
|
||||
gui->hContent = inner_height_default;
|
||||
|
||||
gui->xCutoff = param_cutoff_x1;
|
||||
gui->xAmount = param_lfoamt_x1;
|
||||
gui->xSpeed = param_lfospd_x1;
|
||||
gui->yParams = params_y1;
|
||||
gui->wParams = params_w;
|
||||
gui->hParams = params_h;
|
||||
|
||||
gui->xBoxCutoff = parambox_cutoff_x1;
|
||||
gui->xBoxAmount = parambox_lfoamt_x1;
|
||||
gui->xBoxSpeed = parambox_lfospd_x1;
|
||||
gui->yBoxParams = paramboxs_y1;
|
||||
gui->wBoxParams = paramboxs_w;
|
||||
gui->hBoxParams = paramboxs_h;
|
||||
|
||||
gui->xModCutoff = modCutoff_x1;
|
||||
gui->yModCutoff = modCutoff_y1;
|
||||
gui->wModCutoff = modCutoff_w;
|
||||
gui->hModCutoff = modCutoff_h;
|
||||
|
||||
gui->paramValues[0] = 1.f;
|
||||
gui->paramValues[1] = 0.f;
|
||||
gui->paramValues[2] = 0.5f;
|
||||
|
||||
gui->paramMappedValues[0] = 1.f;
|
||||
gui->paramMappedValues[1] = 0.f;
|
||||
gui->paramMappedValues[2] = 0.46666666666666f;
|
||||
|
||||
gui->param_hover = -1; // -1 = None, 0 = cutoff, 1 = amount, 2 = speed
|
||||
gui->param_selected = -1; // -1 = None, 0 = cutoff, 1 = amount, 2 = speed
|
||||
gui->mouse_old_y = 0;
|
||||
|
||||
gui->screen_map_selected = 3;
|
||||
|
||||
gui->modCutoffValue = 0.f;
|
||||
|
||||
// Redrawing state
|
||||
gui->paramToRedraw[0] = 0;
|
||||
gui->paramToRedraw[1] = 0;
|
||||
gui->paramToRedraw[2] = 0;
|
||||
gui->modCutoffToRedraw = 0;
|
||||
gui->toResize = 0;
|
||||
|
||||
return gui;
|
||||
}
|
||||
|
||||
void asid_gui_free(asid_gui gui) {
|
||||
gui_fini();
|
||||
|
||||
for (int i = 0; i < 4; i++) {
|
||||
free(gui->screen_maps[i]);
|
||||
free(gui->resized[i]);
|
||||
}
|
||||
free(gui);
|
||||
}
|
||||
|
||||
asid_gui_view asid_gui_view_new(asid_gui gui, void *parent) {
|
||||
asid_gui_view view = gui_window_new (parent, width_default, height_default, gui);
|
||||
if (view == NULL)
|
||||
return NULL;
|
||||
gui->window = view;
|
||||
|
||||
gui_window_show (view);
|
||||
|
||||
asid_gui_view_resize(gui, view, 403, 283);
|
||||
draw_parameter_fixed(gui, 0);
|
||||
draw_parameter_fixed(gui, 1);
|
||||
draw_parameter_fixed(gui, 2);
|
||||
|
||||
gui_set_timeout (view, 10);
|
||||
|
||||
return view;
|
||||
}
|
||||
|
||||
void asid_gui_view_free(asid_gui gui, asid_gui_view view) {
|
||||
gui_window_free(view);
|
||||
}
|
||||
|
||||
void asid_gui_on_param_set(asid_gui gui, uint32_t id, float value) {
|
||||
if (id == 3) {
|
||||
gui->modCutoffValue = value;
|
||||
char screen_map_selected_new;
|
||||
if (value < 0.25f) {
|
||||
screen_map_selected_new = 0;
|
||||
}
|
||||
else if (value < 0.5f) {
|
||||
screen_map_selected_new = 1;
|
||||
}
|
||||
else if (value < 0.75f) {
|
||||
screen_map_selected_new = 2;
|
||||
}
|
||||
else {
|
||||
screen_map_selected_new = 3;
|
||||
}
|
||||
|
||||
gui->screen_map_selected = screen_map_selected_new;
|
||||
gui->modCutoffToRedraw = 1;
|
||||
}
|
||||
|
||||
else {
|
||||
if (gui->paramToRedraw[id] == -1) // Set by the gui
|
||||
gui->paramToRedraw[id] = 1;
|
||||
return;
|
||||
gui->paramValues[id] = clipF(value, 0.f, 1.f);
|
||||
float newMappedV = floorI(gui->paramValues[id] * 15.f) * 0.0666666666666666f;
|
||||
if (gui->paramMappedValues[id] != newMappedV) {
|
||||
gui->paramMappedValues[id] = newMappedV;
|
||||
gui->paramToRedraw[id] = 1;
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
uint32_t asid_gui_view_get_width(asid_gui gui, asid_gui_view view) {
|
||||
return gui_window_get_width(view);
|
||||
}
|
||||
|
||||
uint32_t asid_gui_view_get_height(asid_gui gui, asid_gui_view view) {
|
||||
return gui_window_get_height(view);
|
||||
}
|
||||
|
||||
uint32_t asid_gui_view_get_default_width(asid_gui gui) {
|
||||
return width_default;
|
||||
}
|
||||
|
||||
uint32_t asid_gui_view_get_default_height(asid_gui gui) {
|
||||
return height_default;
|
||||
}
|
||||
|
||||
|
||||
void asid_on_mouse_press (asid_gui gui, int x, int y) {
|
||||
x = (int) (((float) (x - (int) gui->xContent)) * gui->scaleFactorInv);
|
||||
y = (int) (((float) (y - (int) gui->yContent)) * gui->scaleFactorInv);
|
||||
|
||||
if (y >= paramboxs_y1 && y <= paramboxs_y2) {
|
||||
if (x >= parambox_cutoff_x1 && x <= parambox_cutoff_x2) {
|
||||
gui->param_selected = 0;
|
||||
}
|
||||
else if (x >= parambox_lfoamt_x1 && x <= parambox_lfoamt_x2) {
|
||||
gui->param_selected = 1;
|
||||
}
|
||||
else if (x >= parambox_lfospd_x1 && x <= parambox_lfospd_x2) {
|
||||
gui->param_selected = 2;
|
||||
}
|
||||
else {
|
||||
gui->param_selected = -1;
|
||||
}
|
||||
gui->mouse_old_y = y;
|
||||
}
|
||||
}
|
||||
|
||||
void asid_on_mouse_release (asid_gui gui) {
|
||||
gui->param_selected = -1;
|
||||
//gui->mouse_old_y = 0; // Maybe something better
|
||||
}
|
||||
|
||||
void asid_on_mouse_move (asid_gui gui, int x, int y, uint32_t mouseState) {
|
||||
x = (int) (((float) (x - (int) gui->xContent)) * gui->scaleFactorInv);
|
||||
y = (int) (((float) (y - (int) gui->yContent)) * gui->scaleFactorInv);
|
||||
|
||||
// Hover
|
||||
if (gui->param_selected == -1) {
|
||||
char old_param_hover = gui->param_hover;
|
||||
if (y >= paramboxs_y1 && y <= paramboxs_y2) {
|
||||
if (x >= parambox_cutoff_x1 && x <= parambox_cutoff_x2)
|
||||
gui->param_hover = 0;
|
||||
else if (x >= parambox_lfoamt_x1 && x <= parambox_lfoamt_x2)
|
||||
gui->param_hover = 1;
|
||||
else if (x >= parambox_lfospd_x1 && x <= parambox_lfospd_x2)
|
||||
gui->param_hover = 2;
|
||||
else
|
||||
gui->param_hover = -1;
|
||||
}
|
||||
else
|
||||
gui->param_hover = -1;
|
||||
|
||||
if (old_param_hover == gui->param_hover)
|
||||
;
|
||||
else {
|
||||
if (old_param_hover != -1)
|
||||
gui->paramToRedraw[old_param_hover] = 1;
|
||||
if (gui->param_hover != -1)
|
||||
gui->paramToRedraw[gui->param_hover] = 1;
|
||||
if (gui->paramToRedraw[0])
|
||||
gui->modCutoffToRedraw = 1;
|
||||
}
|
||||
}
|
||||
// Mouse diff
|
||||
if (gui->param_selected != -1 && mouseState > 0) {
|
||||
float diff = ((float) (gui->mouse_old_y - y)) / (float) params_h;
|
||||
|
||||
if (diff != 0.f) {
|
||||
gui->paramValues[gui->param_selected] = clipF(gui->paramValues[gui->param_selected] + diff, 0.f, 1.f);
|
||||
float newMappedV = floorI(gui->paramValues[gui->param_selected] * 15.f) * 0.0666666666666666f;
|
||||
if (gui->paramMappedValues[gui->param_selected] != newMappedV) {
|
||||
gui->paramMappedValues[gui->param_selected] = newMappedV;
|
||||
gui->paramToRedraw[gui->param_selected] = -1;
|
||||
EditController *c = (EditController *) gui->handle;
|
||||
c->beginEdit(gui->param_selected);
|
||||
c->performEdit(gui->param_selected, gui->paramMappedValues[gui->param_selected]);
|
||||
c->endEdit(gui->param_selected);
|
||||
}
|
||||
}
|
||||
}
|
||||
gui->mouse_old_y = y;
|
||||
}
|
||||
|
||||
void asid_on_timeout (asid_gui gui) {
|
||||
struct timeval stop, start;
|
||||
gettimeofday(&start, NULL);
|
||||
|
||||
if (gui != NULL)
|
||||
piggyback_draw(gui);
|
||||
|
||||
gettimeofday(&stop, NULL);
|
||||
|
||||
const time_t elapsed = ((stop.tv_sec - start.tv_sec) * 1000000 + stop.tv_usec - start.tv_usec) / 1000;
|
||||
uint32_t nextMs = elapsed < 20 ? 20 - elapsed : 1;
|
||||
|
||||
gui_set_timeout (gui->window, nextMs);
|
||||
}
|
||||
|
||||
#ifdef __cplusplus
|
||||
}
|
||||
#endif
|
68
vst3/src/asid_gui.h
Normal file
@ -0,0 +1,68 @@
|
||||
/*
|
||||
* A-SID - C64 bandpass filter + LFO
|
||||
*
|
||||
* Copyright (C) 2022 Orastron srl unipersonale
|
||||
*
|
||||
* A-SID is free software: you can redistribute it and/or modify
|
||||
* it under the terms of the GNU General Public License as published by
|
||||
* the Free Software Foundation, version 3 of the License.
|
||||
*
|
||||
* A-SID 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 for more details.
|
||||
*
|
||||
* You should have received a copy of the GNU General Public License
|
||||
*
|
||||
* File authors: Stefano D'Angelo, Paolo Marrone
|
||||
*/
|
||||
|
||||
|
||||
#ifndef _ASID_GUI_H
|
||||
#define _ASID_GUI_H
|
||||
|
||||
#ifdef __cplusplus
|
||||
extern "C" {
|
||||
#endif
|
||||
|
||||
#include <stdint.h>
|
||||
|
||||
typedef struct _asid_gui* asid_gui;
|
||||
|
||||
#ifdef _WIN32
|
||||
|
||||
#include "gui-win32.h"
|
||||
|
||||
#endif
|
||||
|
||||
#ifdef linux
|
||||
|
||||
#include "gui-x.h"
|
||||
|
||||
#endif
|
||||
|
||||
asid_gui asid_gui_new(void *handle);
|
||||
void asid_gui_free(asid_gui gui);
|
||||
void asid_gui_set_set_parameter(asid_gui gui, void (*set_parameter)(void *handle, uint32_t id, float value));
|
||||
void asid_gui_on_param_set(asid_gui gui, uint32_t id, float value);
|
||||
|
||||
typedef window asid_gui_view;
|
||||
|
||||
asid_gui_view asid_gui_view_new(asid_gui gui, void *parent);
|
||||
void asid_gui_view_free(asid_gui gui, asid_gui_view view);
|
||||
uint32_t asid_gui_view_get_width(asid_gui gui, asid_gui_view view);
|
||||
uint32_t asid_gui_view_get_height(asid_gui gui, asid_gui_view view);
|
||||
void asid_gui_view_resize(asid_gui gui, asid_gui_view view, uint32_t width, uint32_t height);
|
||||
uint32_t asid_gui_view_get_default_width(asid_gui gui);
|
||||
uint32_t asid_gui_view_get_default_height(asid_gui gui);
|
||||
|
||||
void asid_on_mouse_press (asid_gui gui, int x, int y);
|
||||
void asid_on_mouse_release (asid_gui gui);
|
||||
void asid_on_mouse_move (asid_gui gui, int x, int y, uint32_t mouseState);
|
||||
void asid_on_timeout (asid_gui gui);
|
||||
|
||||
#ifdef __cplusplus
|
||||
}
|
||||
#endif
|
||||
|
||||
#endif
|
390
vst3/src/gui-win32.c
Normal file
@ -0,0 +1,390 @@
|
||||
/*
|
||||
* A-SID - C64 bandpass filter + LFO
|
||||
*
|
||||
* Copyright (C) 2022 Orastron srl unipersonale
|
||||
*
|
||||
* A-SID is free software: you can redistribute it and/or modify
|
||||
* it under the terms of the GNU General Public License as published by
|
||||
* the Free Software Foundation, version 3 of the License.
|
||||
*
|
||||
* A-SID 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 for more details.
|
||||
*
|
||||
* You should have received a copy of the GNU General Public License
|
||||
*
|
||||
* File author: Paolo Marrone
|
||||
*/
|
||||
|
||||
extern "C" {
|
||||
|
||||
#include <stdio.h>
|
||||
#include <stdlib.h>
|
||||
|
||||
#include "gui-win32.h"
|
||||
#include "asid_gui.h"
|
||||
|
||||
static const char g_szClassName[] = "guiWindowClass";
|
||||
static char keep_running;
|
||||
|
||||
static TRACKMOUSEEVENT tme = {0}; // Tmp
|
||||
static char m_bMouseTracking = 0; // Tmp
|
||||
|
||||
static window firstWindow;
|
||||
|
||||
int instanceCounter = 0;
|
||||
|
||||
struct _window {
|
||||
window next;
|
||||
HWND handle;
|
||||
asid_gui gui;
|
||||
unsigned char* argb;
|
||||
HBITMAP map;
|
||||
uint32_t width, height;
|
||||
};
|
||||
|
||||
static window findWin(HWND handle) {
|
||||
window winCur = firstWindow;
|
||||
while (winCur) {
|
||||
if (winCur->handle == handle)
|
||||
return winCur;
|
||||
winCur = winCur->next;
|
||||
}
|
||||
return NULL;
|
||||
}
|
||||
|
||||
static void window_draw_ (HWND w, HBITMAP map, uint32_t srcX, uint32_t srcY, uint32_t destX, uint32_t destY, uint32_t width, uint32_t height) {
|
||||
// Temp HDC to copy picture
|
||||
HDC tmp = GetDC(NULL);
|
||||
HDC src = CreateCompatibleDC(tmp); // hdc - Device context for window
|
||||
SelectObject(src, map); // Inserting picture into our temp HDC
|
||||
HDC dest = GetDC(w);
|
||||
// Copy image from temp HDC to window
|
||||
BitBlt(
|
||||
dest, // Destination
|
||||
(int) destX, // x and
|
||||
(int) destY, // y - upper-left corner of place, where we'd like to copy
|
||||
(int) width, // width of the region
|
||||
(int) height,
|
||||
src, // source
|
||||
(int) srcX, // x and
|
||||
(int) srcY, // y of upper left corner of part of the source, from where we'd like to copy
|
||||
SRCCOPY // Defined DWORD to juct copy pixels. Watch more on msdn;
|
||||
);
|
||||
ReleaseDC(w, dest);
|
||||
DeleteDC(src); // Deleting temp HDC
|
||||
DeleteDC(tmp);
|
||||
}
|
||||
|
||||
static uint32_t get_mouse_state(WPARAM wParam) {
|
||||
return
|
||||
(wParam & (MK_LBUTTON | MK_RBUTTON))
|
||||
| ((wParam & MK_MBUTTON) >> 2);
|
||||
}
|
||||
|
||||
|
||||
static LRESULT CALLBACK WndProc (HWND hwnd, UINT msg, WPARAM wParam, LPARAM lParam) {
|
||||
window w = findWin(hwnd);
|
||||
if (w == NULL)
|
||||
return 1;
|
||||
|
||||
DWORD pos;
|
||||
uint32_t wt, ht;
|
||||
POINTS points;
|
||||
switch(msg)
|
||||
{
|
||||
case WM_LBUTTONDOWN:
|
||||
case WM_MBUTTONDOWN:
|
||||
case WM_RBUTTONDOWN:
|
||||
points = MAKEPOINTS(lParam);
|
||||
SetCapture(hwnd);
|
||||
asid_on_mouse_press(w->gui, points.x, points.y);
|
||||
//MessageBox(NULL, "Click", "Click!", MB_OK);
|
||||
break;
|
||||
case WM_LBUTTONUP:
|
||||
case WM_MBUTTONUP:
|
||||
case WM_RBUTTONUP:
|
||||
points = MAKEPOINTS(lParam);
|
||||
wt = get_mouse_state(wParam);
|
||||
if (wt == 0)
|
||||
ReleaseCapture();
|
||||
asid_on_mouse_release(w->gui);
|
||||
break;
|
||||
case WM_MOUSEMOVE:
|
||||
if (!m_bMouseTracking)
|
||||
{
|
||||
// Enable mouse tracking.
|
||||
tme.cbSize = sizeof(tme);
|
||||
tme.hwndTrack = hwnd;
|
||||
tme.dwFlags = TME_HOVER | TME_LEAVE;
|
||||
tme.dwHoverTime = HOVER_DEFAULT;
|
||||
TrackMouseEvent(&tme);
|
||||
m_bMouseTracking = 1;
|
||||
}
|
||||
|
||||
points = MAKEPOINTS(lParam);
|
||||
asid_on_mouse_move(w->gui, points.x, points.y, get_mouse_state(wParam));
|
||||
break;
|
||||
case WM_MOUSELEAVE:
|
||||
points = MAKEPOINTS(lParam);
|
||||
m_bMouseTracking = 0;
|
||||
break;
|
||||
case WM_KEYDOWN:
|
||||
break;
|
||||
case WM_KEYUP:
|
||||
break;
|
||||
case WM_CLOSE:
|
||||
DestroyWindow(hwnd);
|
||||
break;
|
||||
case WM_DESTROY:
|
||||
PostQuitMessage(0);
|
||||
break;
|
||||
case WM_SIZE:
|
||||
wt = (uint32_t) LOWORD(lParam);
|
||||
ht = (uint32_t) HIWORD(lParam);
|
||||
if (wt > 0 && ht > 0) {
|
||||
//w->width = wt;
|
||||
//w->height = ht;
|
||||
//on_window_resize(ww, wt, ht);
|
||||
}
|
||||
break;
|
||||
case WM_PAINT:
|
||||
BeginPaint(hwnd, NULL);
|
||||
if (w != NULL && w->map != NULL) {
|
||||
window_draw_(hwnd, w->map, 0, 0, 0, 0, w->width, w->height);
|
||||
}
|
||||
EndPaint(hwnd, NULL);
|
||||
break;
|
||||
default:
|
||||
return DefWindowProc(hwnd, msg, wParam, lParam);
|
||||
}
|
||||
return 0;
|
||||
}
|
||||
|
||||
|
||||
int32_t gui_init () {
|
||||
instanceCounter++;
|
||||
|
||||
WNDCLASSEX wc;
|
||||
|
||||
wc.cbSize = sizeof(wc);
|
||||
wc.style = 0; // CS_HREDRAW | CS_VREDRAW; // redraw if size changes
|
||||
wc.lpfnWndProc = WndProc;
|
||||
wc.cbClsExtra = 0;
|
||||
wc.cbWndExtra = 0;
|
||||
wc.hInstance = NULL;
|
||||
wc.hIcon = LoadIcon(NULL, IDI_APPLICATION);
|
||||
wc.hCursor = LoadCursor(NULL, IDC_ARROW);
|
||||
wc.hbrBackground = (HBRUSH)(WHITE_BRUSH);
|
||||
wc.lpszMenuName = NULL;
|
||||
wc.lpszClassName = g_szClassName;
|
||||
wc.hIconSm = LoadIcon(NULL, IDI_APPLICATION);
|
||||
|
||||
ATOM wcATOM = RegisterClassEx(&wc);
|
||||
if(!wcATOM) {
|
||||
// Probably it got already registered
|
||||
return 1;
|
||||
}
|
||||
|
||||
firstWindow = NULL;
|
||||
|
||||
return 0;
|
||||
}
|
||||
|
||||
/*
|
||||
static uint32_t count_windows() {
|
||||
uint32_t counter = 0;
|
||||
if (firstWindow != NULL) {
|
||||
counter++;
|
||||
window winCur = firstWindow;
|
||||
while (winCur->next != NULL) {
|
||||
counter++;
|
||||
winCur = winCur->next;
|
||||
}
|
||||
}
|
||||
return counter;
|
||||
}
|
||||
*/
|
||||
|
||||
void gui_fini () {
|
||||
instanceCounter--;
|
||||
|
||||
if (instanceCounter <= 0) { // Concurrency problem?
|
||||
instanceCounter = 0;
|
||||
UnregisterClass(g_szClassName, NULL);
|
||||
}
|
||||
}
|
||||
|
||||
|
||||
window gui_window_new (void* parent, uint32_t width, uint32_t height, asid_gui gui) {
|
||||
|
||||
HWND* hwndParent = (HWND*) parent;
|
||||
|
||||
HWND hwnd = CreateWindowEx(
|
||||
WS_EX_CLIENTEDGE,
|
||||
g_szClassName,
|
||||
"ASID",
|
||||
WS_OVERLAPPEDWINDOW,
|
||||
CW_USEDEFAULT, CW_USEDEFAULT, width, height,
|
||||
NULL, NULL, NULL, NULL
|
||||
);
|
||||
|
||||
if(hwnd == NULL)
|
||||
{
|
||||
MessageBox(NULL, "Window Creation Failed!", "Error!", MB_ICONEXCLAMATION | MB_OK);
|
||||
return NULL;
|
||||
}
|
||||
|
||||
SetWindowLong(hwnd, GWL_STYLE, GetWindowLong(hwnd, GWL_STYLE) & ! WS_BORDER & ! WS_SIZEBOX & ! WS_DLGFRAME );
|
||||
SetWindowPos(hwnd, HWND_TOP, 0, 0, 0, 0, SWP_NOSIZE | SWP_NOZORDER | SWP_FRAMECHANGED);
|
||||
|
||||
|
||||
tme.cbSize = sizeof(TRACKMOUSEEVENT);
|
||||
tme.dwFlags = TME_LEAVE;
|
||||
tme.hwndTrack = hwnd;
|
||||
TrackMouseEvent(&tme);
|
||||
|
||||
UpdateWindow(hwnd);
|
||||
SetParent(hwnd, *hwndParent);
|
||||
|
||||
|
||||
window newWindow = (window) malloc(sizeof(struct _window));
|
||||
if (newWindow == NULL)
|
||||
return NULL;
|
||||
newWindow->next = NULL;
|
||||
newWindow->handle = hwnd;
|
||||
newWindow->width = width;
|
||||
newWindow->height = height;
|
||||
newWindow->argb = NULL; /*(unsigned char*) malloc(4 * newWindow->width * newWindow->height);
|
||||
if (newWindow->argb == NULL) {
|
||||
MessageBox(NULL, "Memory error", "Error!", MB_ICONEXCLAMATION | MB_OK);
|
||||
return NULL;
|
||||
}
|
||||
*/
|
||||
newWindow->map = NULL;
|
||||
newWindow->gui = gui;
|
||||
|
||||
if (firstWindow == NULL)
|
||||
firstWindow = newWindow;
|
||||
else {
|
||||
window winCur = firstWindow;
|
||||
while (winCur->next != NULL)
|
||||
winCur = winCur->next;
|
||||
winCur->next = newWindow;
|
||||
}
|
||||
|
||||
return newWindow;
|
||||
|
||||
}
|
||||
|
||||
void gui_window_free (window w) {
|
||||
if (w == firstWindow)
|
||||
firstWindow = w->next;
|
||||
else {
|
||||
window winCur = firstWindow;
|
||||
while (winCur->next != w)
|
||||
winCur = winCur->next;
|
||||
winCur->next = w->next;
|
||||
}
|
||||
|
||||
//free(w->argb);
|
||||
DeleteObject(w->map);
|
||||
DestroyWindow(w->handle);
|
||||
free(w);
|
||||
}
|
||||
|
||||
|
||||
void gui_window_draw (window win, unsigned char *data,
|
||||
uint32_t dx, uint32_t dy, uint32_t dw, uint32_t dh,
|
||||
uint32_t wx, uint32_t wy, uint32_t width, uint32_t height)
|
||||
{
|
||||
|
||||
win->argb = data;
|
||||
|
||||
DeleteObject(win->map);
|
||||
win->map = CreateBitmap(
|
||||
(int) win->width,
|
||||
(int) win->height,
|
||||
1, // color planes
|
||||
32, // Size of memory for one pixel in bits
|
||||
win->argb // src
|
||||
);
|
||||
|
||||
BeginPaint(win->handle, NULL);
|
||||
window_draw_(win->handle, win->map, wx, wy, wx, wy, width, height);
|
||||
EndPaint(win->handle, NULL);
|
||||
}
|
||||
|
||||
|
||||
void *gui_window_get_handle(window w) {
|
||||
return w->handle;
|
||||
}
|
||||
|
||||
void gui_window_move(window w, uint32_t x, uint32_t y) {
|
||||
SetWindowPos(w->handle, NULL, x, y, 0, 0, SWP_NOSIZE | SWP_NOZORDER);
|
||||
}
|
||||
|
||||
void gui_window_resize(window w, uint32_t width, uint32_t height) {
|
||||
w->width = width;
|
||||
w->height = height;
|
||||
w->map = NULL;
|
||||
/*
|
||||
w->argb = (unsigned char*) realloc(w->argb, 4 * w->width * w->height);
|
||||
if (w->argb == NULL) {
|
||||
MessageBox(NULL, "Resize memory error", "Error!", MB_ICONEXCLAMATION | MB_OK);
|
||||
return;
|
||||
}
|
||||
*/
|
||||
SetWindowPos(w->handle, NULL, 0, 0, width, height, SWP_NOMOVE | SWP_NOZORDER);
|
||||
}
|
||||
|
||||
uint32_t gui_window_get_width(window w) {
|
||||
return w->width;
|
||||
}
|
||||
uint32_t gui_window_get_height(window w) {
|
||||
return w->height;
|
||||
}
|
||||
|
||||
void gui_window_show(window w) {
|
||||
ShowWindow(w->handle, SW_SHOW);
|
||||
}
|
||||
|
||||
void gui_window_hide(window w) {
|
||||
ShowWindow(w->handle, SW_HIDE);
|
||||
}
|
||||
|
||||
void gui_run () {
|
||||
keep_running = 1;
|
||||
MSG Msg;
|
||||
while(keep_running && GetMessage(&Msg, NULL, 0, 0) > 0)
|
||||
{
|
||||
TranslateMessage(&Msg);
|
||||
DispatchMessage(&Msg);
|
||||
}
|
||||
}
|
||||
|
||||
void gui_stop () {
|
||||
keep_running = 0;
|
||||
}
|
||||
|
||||
|
||||
void gui_set_timeout (window w, int32_t value) {
|
||||
SetTimer(
|
||||
w->handle,
|
||||
(UINT_PTR) NULL,
|
||||
(UINT) value,
|
||||
gui_on_timeout
|
||||
);
|
||||
}
|
||||
|
||||
|
||||
void gui_on_timeout (HWND unnamedParam1, UINT unnamedParam2, UINT_PTR unnamedParam3, DWORD unnamedParam4) {
|
||||
window w = findWin(unnamedParam1);
|
||||
if (w == NULL)
|
||||
return;
|
||||
|
||||
asid_on_timeout(w->gui);
|
||||
}
|
||||
|
||||
}
|
48
vst3/src/gui-win32.h
Normal file
@ -0,0 +1,48 @@
|
||||
/*
|
||||
* A-SID - C64 bandpass filter + LFO
|
||||
*
|
||||
* Copyright (C) 2022 Orastron srl unipersonale
|
||||
*
|
||||
* A-SID is free software: you can redistribute it and/or modify
|
||||
* it under the terms of the GNU General Public License as published by
|
||||
* the Free Software Foundation, version 3 of the License.
|
||||
*
|
||||
* A-SID 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 for more details.
|
||||
*
|
||||
* You should have received a copy of the GNU General Public License
|
||||
*
|
||||
* File authors: Stefano D'Angelo, Paolo Marrone
|
||||
*/
|
||||
|
||||
#ifndef _gui_WIN_H
|
||||
#define _gui_WIN_H
|
||||
|
||||
#include <windows.h>
|
||||
#include <stdint.h>
|
||||
|
||||
|
||||
typedef struct _window* window;
|
||||
|
||||
#include "asid_gui.h"
|
||||
|
||||
int32_t gui_init ();
|
||||
void gui_fini ();
|
||||
window gui_window_new (void* wParent, uint32_t width, uint32_t height, asid_gui gui);
|
||||
void gui_window_free (window w);
|
||||
void gui_window_draw (window w, unsigned char *data, uint32_t dx, uint32_t dy, uint32_t dw, uint32_t dh, uint32_t wx, uint32_t wy, uint32_t width, uint32_t height);
|
||||
void *gui_window_get_handle(window w);
|
||||
void gui_window_move(window w, uint32_t x, uint32_t y);
|
||||
void gui_window_resize(window w, uint32_t width, uint32_t height);
|
||||
uint32_t gui_window_get_width(window w);
|
||||
uint32_t gui_window_get_height(window w);
|
||||
void gui_window_show(window w);
|
||||
void gui_window_hide(window w);
|
||||
void gui_run ();
|
||||
void gui_stop ();
|
||||
void gui_set_timeout (window w, int32_t value);
|
||||
void gui_on_timeout (HWND unnamedParam1, UINT unnamedParam2, UINT_PTR unnamedParam3, DWORD unnamedParam4);
|
||||
|
||||
#endif
|
466
vst3/src/gui-x.c
Normal file
@ -0,0 +1,466 @@
|
||||
/*
|
||||
* A-SID - C64 bandpass filter + LFO
|
||||
*
|
||||
* Copyright (C) 2022 Orastron srl unipersonale
|
||||
*
|
||||
* A-SID is free software: you can redistribute it and/or modify
|
||||
* it under the terms of the GNU General Public License as published by
|
||||
* the Free Software Foundation, version 3 of the License.
|
||||
*
|
||||
* A-SID 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 for more details.
|
||||
*
|
||||
* You should have received a copy of the GNU General Public License
|
||||
*
|
||||
* File authors: Stefano D'Angelo, Paolo Marrone
|
||||
*/
|
||||
|
||||
#ifdef __cplusplus
|
||||
extern "C" {
|
||||
#endif
|
||||
|
||||
#include "gui-x.h"
|
||||
|
||||
|
||||
static xcb_connection_t *connection;
|
||||
static xcb_screen_t *screen;
|
||||
static const xcb_setup_t *setup;
|
||||
static xcb_visualtype_t *visual;
|
||||
static xcb_atom_t wm_protocols_atom;
|
||||
static xcb_atom_t wm_delete_atom;
|
||||
static xcb_atom_t xembed_info_atom;
|
||||
static window windows;
|
||||
static char keep_running;
|
||||
static struct timespec ts_timeout;
|
||||
|
||||
int32_t gui_init() {
|
||||
connection = xcb_connect(NULL, NULL);
|
||||
if (xcb_connection_has_error(connection)) {
|
||||
xcb_disconnect(connection);
|
||||
return -1;
|
||||
}
|
||||
screen = xcb_setup_roots_iterator(xcb_get_setup(connection)).data;
|
||||
setup = xcb_get_setup(connection);
|
||||
|
||||
xcb_depth_iterator_t depth_iter = xcb_screen_allowed_depths_iterator(screen);
|
||||
xcb_depth_t *depth = NULL;
|
||||
while (depth_iter.rem) {
|
||||
if (depth_iter.data->depth == 24 && depth_iter.data->visuals_len) {
|
||||
depth = depth_iter.data;
|
||||
break;
|
||||
}
|
||||
xcb_depth_next(&depth_iter);
|
||||
}
|
||||
if (!depth){
|
||||
xcb_disconnect(connection);
|
||||
return -1;
|
||||
}
|
||||
|
||||
xcb_visualtype_iterator_t visual_iter = xcb_depth_visuals_iterator(depth);
|
||||
visual = NULL;
|
||||
while (visual_iter.rem) {
|
||||
if (visual_iter.data->_class == XCB_VISUAL_CLASS_TRUE_COLOR) {
|
||||
visual = visual_iter.data;
|
||||
break;
|
||||
}
|
||||
xcb_visualtype_next(&visual_iter);
|
||||
}
|
||||
if (!visual) {
|
||||
xcb_disconnect(connection);
|
||||
return -1;
|
||||
}
|
||||
|
||||
xcb_intern_atom_reply_t* reply = xcb_intern_atom_reply(connection, xcb_intern_atom(connection, 1, 12, "WM_PROTOCOLS"), NULL);
|
||||
if (!reply) {
|
||||
xcb_disconnect(connection);
|
||||
return -1;
|
||||
}
|
||||
wm_protocols_atom = reply->atom;
|
||||
free(reply);
|
||||
|
||||
reply = xcb_intern_atom_reply(connection, xcb_intern_atom(connection, 0, 16, "WM_DELETE_WINDOW"), NULL);
|
||||
if (!reply) {
|
||||
xcb_disconnect(connection);
|
||||
return -1;
|
||||
}
|
||||
wm_delete_atom = reply->atom;
|
||||
free(reply);
|
||||
|
||||
reply = xcb_intern_atom_reply(connection, xcb_intern_atom(connection, 0, 12, "_XEMBED_INFO"), NULL);
|
||||
if (!reply) {
|
||||
xcb_disconnect(connection);
|
||||
return -1;
|
||||
}
|
||||
xembed_info_atom = reply->atom;
|
||||
free(reply);
|
||||
|
||||
windows = NULL;
|
||||
ts_timeout.tv_sec = -1;
|
||||
|
||||
return 0;
|
||||
|
||||
err:
|
||||
// TBD: report
|
||||
xcb_disconnect(connection);
|
||||
return -1;
|
||||
}
|
||||
|
||||
void gui_fini() {
|
||||
xcb_disconnect(connection);
|
||||
}
|
||||
|
||||
#define XEMBED_MAPPED (1 << 0)
|
||||
|
||||
window gui_window_new(void* p, uint32_t width, uint32_t height, asid_gui gui) { // To fix
|
||||
xcb_window_t *parent = (xcb_window_t *) p;
|
||||
|
||||
window ret = (window) malloc(sizeof(_window));
|
||||
if (ret == NULL)
|
||||
return NULL;
|
||||
|
||||
ret->window = xcb_generate_id(connection);
|
||||
uint32_t mask = XCB_CW_EVENT_MASK;
|
||||
uint32_t values[] = { XCB_EVENT_MASK_EXPOSURE | XCB_EVENT_MASK_STRUCTURE_NOTIFY
|
||||
| XCB_EVENT_MASK_BUTTON_PRESS | XCB_EVENT_MASK_BUTTON_RELEASE
|
||||
| XCB_EVENT_MASK_POINTER_MOTION | XCB_EVENT_MASK_BUTTON_MOTION
|
||||
| XCB_EVENT_MASK_ENTER_WINDOW | XCB_EVENT_MASK_LEAVE_WINDOW
|
||||
| XCB_EVENT_MASK_KEY_PRESS | XCB_EVENT_MASK_KEY_RELEASE };
|
||||
xcb_create_window(connection, 24, ret->window, parent ? *parent : screen->root,
|
||||
0, 0, width, height, 0, XCB_WINDOW_CLASS_INPUT_OUTPUT,
|
||||
visual->visual_id, mask, values);
|
||||
|
||||
xcb_change_property(connection, XCB_PROP_MODE_REPLACE, ret->window, wm_protocols_atom, XCB_ATOM_ATOM, 32, 1, &wm_delete_atom);
|
||||
|
||||
ret->pixmap = xcb_generate_id(connection);
|
||||
xcb_create_pixmap(connection, screen->root_depth, ret->pixmap, ret->window, width, height);
|
||||
ret->gc = xcb_generate_id(connection);
|
||||
xcb_create_gc(connection, ret->gc, ret->pixmap, 0, NULL);
|
||||
|
||||
uint32_t xembed_info[] = { 0, 0 };
|
||||
xcb_change_property(connection, XCB_PROP_MODE_REPLACE, ret->window, xembed_info_atom, xembed_info_atom, 32, 2, xembed_info);
|
||||
|
||||
xcb_flush(connection);
|
||||
|
||||
ret->next = NULL;
|
||||
if (windows == NULL)
|
||||
windows = ret;
|
||||
else {
|
||||
window n = windows;
|
||||
while (n->next)
|
||||
n = (window) n->next;
|
||||
n->next = ret;
|
||||
}
|
||||
|
||||
ret->x = 0;
|
||||
ret->y = 0;
|
||||
ret->width = width;
|
||||
ret->height = height;
|
||||
|
||||
return ret;
|
||||
}
|
||||
|
||||
void gui_window_free(window w) {
|
||||
if (windows == w)
|
||||
windows = w->next;
|
||||
else {
|
||||
window n = windows;
|
||||
while ((window) n->next != w)
|
||||
n = (window) n->next;
|
||||
n->next = w->next;
|
||||
}
|
||||
|
||||
xcb_free_gc(connection, w->gc);
|
||||
xcb_free_pixmap(connection, w->pixmap);
|
||||
xcb_destroy_window(connection, w->window);
|
||||
xcb_flush(connection);
|
||||
free(w);
|
||||
}
|
||||
|
||||
void gui_window_draw(window w, unsigned char *data, uint32_t dx, uint32_t dy, uint32_t dw, uint32_t dh, uint32_t wx, uint32_t wy, uint32_t width, uint32_t height) {
|
||||
uint32_t bytes = 4 * width * height;
|
||||
unsigned char *argb = (unsigned char*) malloc(bytes);
|
||||
if (argb == NULL)
|
||||
return;
|
||||
|
||||
uint32_t i = 0;
|
||||
uint32_t o = (dw * dy + dx) << 2;
|
||||
uint32_t p = (dw - width) << 2;
|
||||
if (setup->image_byte_order == XCB_IMAGE_ORDER_LSB_FIRST) {
|
||||
for (uint32_t y = dy; y < dy + height && y < dh; y++) {
|
||||
for (uint32_t x = dx; x < dx + width; x++, o += 4) {
|
||||
argb[i++] = data[o + 2];
|
||||
argb[i++] = data[o + 1];
|
||||
argb[i++] = data[o];
|
||||
i++;
|
||||
}
|
||||
o += p;
|
||||
}
|
||||
} else {
|
||||
for (uint32_t y = dy; y < dy + height; y++) {
|
||||
for (uint32_t x = dx; x < dx + width; x++, o += 4) {
|
||||
i++;
|
||||
argb[i++] = data[o];
|
||||
argb[i++] = data[o + 1];
|
||||
argb[i++] = data[o + 2];
|
||||
}
|
||||
o += p;
|
||||
}
|
||||
}
|
||||
|
||||
xcb_put_image(connection, XCB_IMAGE_FORMAT_Z_PIXMAP, w->pixmap, w->gc, width, height, wx, wy, 0, screen->root_depth, bytes, argb);
|
||||
free(argb);
|
||||
xcb_copy_area(connection, w->pixmap, w->window, w->gc, wx, wy, wx, wy, width, height);
|
||||
xcb_flush(connection);
|
||||
}
|
||||
|
||||
void *gui_window_get_handle(window w) {
|
||||
return &w->window;
|
||||
}
|
||||
|
||||
uint32_t gui_window_get_width(window w) {
|
||||
return w->width;
|
||||
}
|
||||
uint32_t gui_window_get_height(window w) {
|
||||
return w->height;
|
||||
}
|
||||
|
||||
void gui_window_resize(window w, uint32_t width, uint32_t height) {
|
||||
const uint32_t values[] = { width, height };
|
||||
xcb_configure_window(connection, w->window, XCB_CONFIG_WINDOW_X | XCB_CONFIG_WINDOW_Y, values);
|
||||
xcb_flush(connection);
|
||||
}
|
||||
|
||||
void gui_window_show(window w) {
|
||||
uint32_t xembed_info[] = { 0, XEMBED_MAPPED };
|
||||
xcb_change_property(connection, XCB_PROP_MODE_REPLACE, w->window, xembed_info_atom, xembed_info_atom, 32, 2, xembed_info);
|
||||
xcb_map_window(connection, w->window);
|
||||
xcb_flush(connection);
|
||||
}
|
||||
|
||||
void gui_window_hide(window w) {
|
||||
uint32_t xembed_info[] = { 0, 0 };
|
||||
xcb_change_property(connection, XCB_PROP_MODE_REPLACE, w->window, xembed_info_atom, xembed_info_atom, 32, 2, xembed_info);
|
||||
xcb_unmap_window(connection, w->window);
|
||||
xcb_flush(connection);
|
||||
}
|
||||
|
||||
static window get_window(xcb_window_t xw) {
|
||||
window w = windows;
|
||||
while (w->window != xw)
|
||||
w = (window)w->next;
|
||||
return w;
|
||||
}
|
||||
|
||||
static uint32_t get_mouse_state(uint16_t state, xcb_button_t last) {
|
||||
return (
|
||||
(state & XCB_BUTTON_MASK_1) >> 8
|
||||
| (state & XCB_BUTTON_MASK_2) >> 7
|
||||
| (state & XCB_BUTTON_MASK_3) >> 9 )
|
||||
^ (last == 1 ? 1 : (last == 2 ? 4 : (last == 3 ? 2 : 0)))
|
||||
;
|
||||
}
|
||||
|
||||
void gui_run(uint32_t single) {
|
||||
keep_running = 1;
|
||||
xcb_generic_event_t *ev;
|
||||
struct pollfd pfd;
|
||||
pfd.fd = xcb_get_file_descriptor(connection);
|
||||
pfd.events = POLLIN;
|
||||
struct timespec ts_now;
|
||||
int timeout;
|
||||
while (keep_running) {
|
||||
if (ts_timeout.tv_sec >= 0) {
|
||||
int err = clock_gettime(CLOCK_MONOTONIC, &ts_now);
|
||||
if (err == -1)
|
||||
break; // TODO: error
|
||||
if (ts_timeout.tv_sec < ts_now.tv_sec
|
||||
|| (ts_timeout.tv_sec == ts_now.tv_sec && ts_timeout.tv_nsec <= ts_now.tv_nsec)) {
|
||||
timeout = 0;
|
||||
}
|
||||
else
|
||||
timeout = 1000L * (ts_timeout.tv_sec - ts_now.tv_sec) + (ts_timeout.tv_nsec - ts_now.tv_nsec) / 1000000L;
|
||||
} else
|
||||
timeout = -1;
|
||||
if (timeout == 0) {
|
||||
ts_timeout.tv_sec = -1;
|
||||
//on_timeout();
|
||||
timeout = -1;
|
||||
}
|
||||
int err = poll(&pfd, 1, single ? 0 : timeout);
|
||||
if (err == -1)
|
||||
// TODO: error
|
||||
break;
|
||||
else if (err == 0) {
|
||||
if (single)
|
||||
break;
|
||||
else if (ts_timeout.tv_sec >= 0) {
|
||||
ts_timeout.tv_sec = -1;
|
||||
//on_timeout();
|
||||
}
|
||||
}
|
||||
|
||||
while (keep_running && (ev = xcb_poll_for_event(connection))) {
|
||||
switch (ev->response_type & ~0x80) {
|
||||
case XCB_EXPOSE:
|
||||
{
|
||||
xcb_expose_event_t *x = (xcb_expose_event_t *)ev;
|
||||
window w = get_window(x->window);
|
||||
|
||||
xcb_copy_area(connection, w->pixmap, w->window, w->gc, x->x, x->y, x->x, x->y, x->width, x->height);
|
||||
xcb_flush(connection);
|
||||
}
|
||||
break;
|
||||
|
||||
case XCB_CONFIGURE_NOTIFY:
|
||||
{
|
||||
xcb_configure_notify_event_t *x = (xcb_configure_notify_event_t *)ev;
|
||||
window w = get_window(x->window);
|
||||
|
||||
// FIXME: should translate to parent?
|
||||
xcb_translate_coordinates_reply_t *trans =
|
||||
xcb_translate_coordinates_reply(connection, xcb_translate_coordinates(connection, w->window, screen->root, 0, 0), NULL);
|
||||
if (trans) {
|
||||
if (trans->dst_x != w->x || trans->dst_y != w->y) {
|
||||
w->x = trans->dst_x;
|
||||
w->y = trans->dst_y;
|
||||
//on_window_move(w, w->x, w->y);
|
||||
}
|
||||
free(trans);
|
||||
}
|
||||
|
||||
if (x->width != w->width || x->height != w->height) {
|
||||
w->width = x->width;
|
||||
w->height = x->height;
|
||||
xcb_free_pixmap(connection, w->pixmap);
|
||||
w->pixmap = xcb_generate_id(connection);
|
||||
xcb_create_pixmap(connection, screen->root_depth, w->pixmap, w->window, w->width, w->height);
|
||||
;//on_window_resize(w, w->width, w->height);
|
||||
}
|
||||
}
|
||||
break;
|
||||
|
||||
case XCB_CLIENT_MESSAGE:
|
||||
{
|
||||
xcb_client_message_event_t *x = (xcb_client_message_event_t *)ev;
|
||||
window w = get_window(x->window);
|
||||
|
||||
if (x->data.data32[0] == wm_delete_atom)
|
||||
;//on_window_close(w);
|
||||
}
|
||||
break;
|
||||
|
||||
case XCB_BUTTON_PRESS:
|
||||
{
|
||||
xcb_button_press_event_t *x = (xcb_button_press_event_t *)ev;
|
||||
window w = get_window(x->event);
|
||||
// First three buttons
|
||||
if (x->detail <= 3) {
|
||||
//on_mouse_press(w, x->event_x, x->event_y, get_mouse_state(x->state, x->detail));
|
||||
}
|
||||
// Mouse wheel
|
||||
else {
|
||||
if (x->detail == 4)
|
||||
;//on_wheel(w, x->event_x, x->event_y, 57);
|
||||
else if (x->detail == 5)
|
||||
;//on_wheel(w, x->event_x, x->event_y, -57);
|
||||
}
|
||||
}
|
||||
break;
|
||||
|
||||
case XCB_BUTTON_RELEASE:
|
||||
{
|
||||
xcb_button_release_event_t *x = (xcb_button_release_event_t *)ev;
|
||||
window w = get_window(x->event);
|
||||
|
||||
// First three buttons
|
||||
if (x->detail <= 3) {
|
||||
//on_mouse_release(w, x->event_x, x->event_y, get_mouse_state(x->state, x->detail));
|
||||
}
|
||||
// Mouse wheel
|
||||
else {
|
||||
// Nothing to do
|
||||
}
|
||||
}
|
||||
break;
|
||||
|
||||
case XCB_MOTION_NOTIFY:
|
||||
{
|
||||
xcb_motion_notify_event_t *x = (xcb_motion_notify_event_t *)ev;
|
||||
window w = get_window(x->event);
|
||||
|
||||
//on_mouse_move(w, x->event_x, x->event_y, get_mouse_state(x->state, 0));
|
||||
}
|
||||
break;
|
||||
|
||||
case XCB_ENTER_NOTIFY:
|
||||
{
|
||||
xcb_enter_notify_event_t *x = (xcb_enter_notify_event_t *)ev;
|
||||
window w = get_window(x->event);
|
||||
|
||||
//on_mouse_enter(w, x->event_x, x->event_y, get_mouse_state(x->state, 0));
|
||||
}
|
||||
break;
|
||||
|
||||
case XCB_LEAVE_NOTIFY:
|
||||
{
|
||||
xcb_leave_notify_event_t *x = (xcb_leave_notify_event_t *)ev;
|
||||
window w = get_window(x->event);
|
||||
|
||||
//on_mouse_leave(w, x->event_x, x->event_y, get_mouse_state(x->state, 0));
|
||||
}
|
||||
break;
|
||||
|
||||
case XCB_KEY_PRESS:
|
||||
{
|
||||
xcb_key_press_event_t *x = (xcb_key_press_event_t *)ev;
|
||||
window w = get_window(x->event);
|
||||
|
||||
//on_key_press(w, x->detail, x->state);
|
||||
}
|
||||
break;
|
||||
|
||||
case XCB_KEY_RELEASE:
|
||||
{
|
||||
xcb_key_release_event_t *x = (xcb_key_release_event_t *)ev;
|
||||
window w = get_window(x->event);
|
||||
|
||||
//on_key_release(w, x->detail, x->state);
|
||||
}
|
||||
break;
|
||||
|
||||
default:
|
||||
break;
|
||||
}
|
||||
|
||||
free(ev);
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
void gui_stop() {
|
||||
keep_running = 0;
|
||||
}
|
||||
|
||||
void gui_set_timeout(int32_t value) {
|
||||
int err = clock_gettime(CLOCK_MONOTONIC, &ts_timeout);
|
||||
if (err == -1)
|
||||
return; // TODO: error
|
||||
if (value < 0)
|
||||
ts_timeout.tv_sec = -1;
|
||||
else {
|
||||
long sec = value / 1000L;
|
||||
long nsec = 1000000L * (value - 1000L * sec);
|
||||
ts_timeout.tv_nsec += nsec;
|
||||
while (ts_timeout.tv_nsec >= 1000000000L) {
|
||||
ts_timeout.tv_sec++;
|
||||
ts_timeout.tv_nsec -= 1000000000L;
|
||||
}
|
||||
ts_timeout.tv_sec += sec;
|
||||
}
|
||||
}
|
||||
|
||||
#ifdef __cplusplus
|
||||
}
|
||||
#endif
|
78
vst3/src/gui-x.h
Normal file
@ -0,0 +1,78 @@
|
||||
/*
|
||||
* A-SID - C64 bandpass filter + LFO
|
||||
*
|
||||
* Copyright (C) 2022 Orastron srl unipersonale
|
||||
*
|
||||
* A-SID is free software: you can redistribute it and/or modify
|
||||
* it under the terms of the GNU General Public License as published by
|
||||
* the Free Software Foundation, version 3 of the License.
|
||||
*
|
||||
* A-SID 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 for more details.
|
||||
*
|
||||
* You should have received a copy of the GNU General Public License
|
||||
*
|
||||
* File author: Stefano D'Angelo
|
||||
*/
|
||||
|
||||
#ifdef __cplusplus
|
||||
extern "C" {
|
||||
#endif
|
||||
|
||||
#ifndef gui_X_H
|
||||
#define gui_X_H
|
||||
|
||||
#include <stdlib.h>
|
||||
#include <stdint.h>
|
||||
#include <xcb/xcb.h>
|
||||
#include <poll.h>
|
||||
#include <time.h>
|
||||
|
||||
typedef struct _window {
|
||||
_window *next;
|
||||
xcb_window_t window;
|
||||
xcb_pixmap_t pixmap;
|
||||
xcb_gcontext_t gc;
|
||||
int16_t x;
|
||||
int16_t y;
|
||||
uint16_t width;
|
||||
uint16_t height;
|
||||
} *window;
|
||||
|
||||
#include "asid_gui.h"
|
||||
|
||||
int32_t gui_init();
|
||||
|
||||
void gui_fini();
|
||||
|
||||
window gui_window_new(void* parent, uint32_t width, uint32_t height, asid_gui gui);
|
||||
|
||||
void gui_window_free(window w);
|
||||
|
||||
void gui_window_draw(window w, unsigned char *data, uint32_t dx, uint32_t dy, uint32_t dw, uint32_t dh, uint32_t wx, uint32_t wy, uint32_t width, uint32_t height);
|
||||
|
||||
void *gui_window_get_handle(window w);
|
||||
|
||||
uint32_t gui_window_get_width(window w);
|
||||
uint32_t gui_window_get_height(window w);
|
||||
|
||||
void gui_window_resize(window w, uint32_t width, uint32_t height);
|
||||
|
||||
void gui_window_show(window w);
|
||||
|
||||
void gui_window_hide(window w);
|
||||
|
||||
void gui_run(uint32_t single);
|
||||
|
||||
void gui_stop();
|
||||
|
||||
void gui_set_timeout(int32_t value);
|
||||
|
||||
|
||||
#endif
|
||||
|
||||
#ifdef __cplusplus
|
||||
}
|
||||
#endif
|
832
vst3/src/screens.h
Normal file
831
vst3/src/screensBE.h
Normal file
118
vst3/src/vst3/config.h
Normal file
@ -0,0 +1,118 @@
|
||||
/*
|
||||
* A-SID - C64 bandpass filter + LFO
|
||||
*
|
||||
* Copyright (C) 2022 Orastron srl unipersonale
|
||||
*
|
||||
* A-SID is free software: you can redistribute it and/or modify
|
||||
* it under the terms of the GNU General Public License as published by
|
||||
* the Free Software Foundation, version 3 of the License.
|
||||
*
|
||||
* A-SID 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 for more details.
|
||||
*
|
||||
* You should have received a copy of the GNU General Public License
|
||||
*
|
||||
* File authors: Stefano D'Angelo, Paolo Marrone
|
||||
*/
|
||||
|
||||
#ifndef _VST3_CONFIG_H
|
||||
#define _VST3_CONFIG_H
|
||||
|
||||
// Definitions
|
||||
|
||||
#define IO_MONO 1
|
||||
#define IO_STEREO (1<<1)
|
||||
|
||||
struct config_io_bus {
|
||||
const char *name;
|
||||
char out;
|
||||
char aux;
|
||||
char cv;
|
||||
char configs;
|
||||
};
|
||||
|
||||
struct config_parameter {
|
||||
const char *name;
|
||||
const char *shortName;
|
||||
const char *units;
|
||||
char out;
|
||||
char bypass;
|
||||
int steps;
|
||||
float defaultValueUnmapped;
|
||||
};
|
||||
|
||||
// Data
|
||||
|
||||
#define COMPANY_NAME "Orastron"
|
||||
#define COMPANY_WEBSITE "https://www.orastron.com/"
|
||||
#define COMPANY_MAILTO "mailto:info@orastron.com"
|
||||
|
||||
#define PLUGIN_NAME "ASID"
|
||||
#define PLUGIN_VERSION "1.0.0"
|
||||
#define PLUGIN_SUBCATEGORY "Fx|Filter"
|
||||
|
||||
#define PLUGIN_GUID_1 0x83AB6110
|
||||
#define PLUGIN_GUID_2 0x11950DD3
|
||||
#define PLUGIN_GUID_3 0x00944BFF
|
||||
#define PLUGIN_GUID_4 0xF4F2ABBB
|
||||
|
||||
#define CTRL_GUID_1 0x9956378A
|
||||
#define CTRL_GUID_2 0x7280FAA9
|
||||
#define CTRL_GUID_3 0x286EFBB3
|
||||
#define CTRL_GUID_4 0x99982AAA
|
||||
|
||||
#define NUM_BUSES_IN 1
|
||||
#define NUM_BUSES_OUT 1
|
||||
#define NUM_CHANNELS_IN 1
|
||||
#define NUM_CHANNELS_OUT 1
|
||||
|
||||
static struct config_io_bus config_buses_in[NUM_BUSES_IN] = {
|
||||
{ "Audio in", 0, 0, 0, IO_MONO }
|
||||
};
|
||||
|
||||
static struct config_io_bus config_buses_out[NUM_BUSES_OUT] = {
|
||||
{ "Audio out", 1, 0, 0, IO_MONO }
|
||||
};
|
||||
|
||||
#define NUM_PARAMETERS 4
|
||||
|
||||
static struct config_parameter config_parameters[NUM_PARAMETERS] = {
|
||||
{ "Cutoff", "Ctff", "", 0, 0, 0, 1.f },
|
||||
{ "LFO Amount", "LFO amt", "%", 0, 0, 0, 0.f },
|
||||
{ "LFO Speed", "LFO sp", "", 0, 0, 0, 0.5f },
|
||||
{ "cutoffOut", "cout", "", 1, 0, 0, 0.f },
|
||||
};
|
||||
|
||||
// Internal API
|
||||
|
||||
#include "asid.h"
|
||||
|
||||
#define P_TYPE asid
|
||||
#define P_NEW asid_new
|
||||
#define P_FREE asid_free
|
||||
#define P_SET_SAMPLE_RATE asid_set_sample_rate
|
||||
#define P_RESET asid_reset
|
||||
#define P_PROCESS asid_process
|
||||
#define P_SET_PARAMETER asid_set_parameter
|
||||
|
||||
#include "asid_gui.h"
|
||||
|
||||
#define PGUI_TYPE asid_gui
|
||||
#define PGUI_NEW asid_gui_new
|
||||
#define PGUI_FREE asid_gui_free
|
||||
#define PGUI_PROCESS_EVENTS asid_gui_process_events
|
||||
#define PGUI_SET_SET_PARAMETER asid_gui_set_set_parameter
|
||||
#define PGUI_ON_PARAM_SET asid_gui_on_param_set
|
||||
|
||||
#define PGUIVIEW_TYPE asid_gui_view
|
||||
#define PGUIVIEW_NEW asid_gui_view_new
|
||||
#define PGUIVIEW_FREE asid_gui_view_free
|
||||
#define PGUIVIEW_GET_WIDTH asid_gui_view_get_width
|
||||
#define PGUIVIEW_GET_HEIGHT asid_gui_view_get_height
|
||||
#define PGUIVIEW_RESIZE asid_gui_view_resize
|
||||
#define PGUIVIEW_GET_DEFAULT_WIDTH asid_gui_view_get_default_width
|
||||
#define PGUIVIEW_GET_DEFAULT_HEIGHT asid_gui_view_get_default_height
|
||||
|
||||
#endif
|
46
vst3/src/vst3/controller.h
Normal file
@ -0,0 +1,46 @@
|
||||
/*
|
||||
* A-SID - C64 bandpass filter + LFO
|
||||
*
|
||||
* Copyright (C) 2022 Orastron srl unipersonale
|
||||
*
|
||||
* A-SID is free software: you can redistribute it and/or modify
|
||||
* it under the terms of the GNU General Public License as published by
|
||||
* the Free Software Foundation, version 3 of the License.
|
||||
*
|
||||
* A-SID 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 for more details.
|
||||
*
|
||||
* You should have received a copy of the GNU General Public License
|
||||
*
|
||||
* File author: Stefano D'Angelo
|
||||
*/
|
||||
|
||||
#ifndef _VST3_CONTROLLER_H
|
||||
#define _VST3_CONTROLLER_H
|
||||
|
||||
#include "config.h"
|
||||
|
||||
#include "public.sdk/source/vst/vsteditcontroller.h"
|
||||
|
||||
using namespace Steinberg;
|
||||
using namespace Steinberg::Vst;
|
||||
|
||||
class Controller : EditController {
|
||||
public:
|
||||
static FUnknown *createInstance(void *context) {
|
||||
return (IEditController *) new Controller();
|
||||
}
|
||||
|
||||
tresult PLUGIN_API initialize(FUnknown *context) SMTG_OVERRIDE;
|
||||
tresult PLUGIN_API terminate() SMTG_OVERRIDE;
|
||||
IPlugView * PLUGIN_API createView(const char *name) SMTG_OVERRIDE;
|
||||
tresult PLUGIN_API setComponentState(IBStream *state) SMTG_OVERRIDE;
|
||||
tresult PLUGIN_API setParamNormalized(ParamID tag, ParamValue value) SMTG_OVERRIDE;
|
||||
|
||||
private:
|
||||
PGUI_TYPE pgui;
|
||||
};
|
||||
|
||||
#endif
|
237
vst3/src/vst3/controllerLinux.cpp
Normal file
@ -0,0 +1,237 @@
|
||||
/*
|
||||
* A-SID - C64 bandpass filter + LFO
|
||||
*
|
||||
* Copyright (C) 2022 Orastron srl unipersonale
|
||||
*
|
||||
* A-SID is free software: you can redistribute it and/or modify
|
||||
* it under the terms of the GNU General Public License as published by
|
||||
* the Free Software Foundation, version 3 of the License.
|
||||
*
|
||||
* A-SID 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 for more details.
|
||||
*
|
||||
* You should have received a copy of the GNU General Public License
|
||||
*
|
||||
* File author: Stefano D'Angelo
|
||||
*/
|
||||
|
||||
#include "controller.h"
|
||||
|
||||
#include "pluginterfaces/base/conststringtable.h"
|
||||
#include "base/source/fstreamer.h"
|
||||
|
||||
#include <sys/types.h>
|
||||
#include <sys/socket.h>
|
||||
#include <unistd.h>
|
||||
|
||||
class LinuxEventHandler final : public Linux::IEventHandler {
|
||||
public:
|
||||
void PLUGIN_API onFDIsSet(Linux::FileDescriptor fd) {
|
||||
//PGUI_PROCESS_EVENTS(pgui);
|
||||
}
|
||||
|
||||
void setFD(int fd) {
|
||||
this->fd = fd;
|
||||
}
|
||||
|
||||
void setPGUI(PGUI_TYPE pgui) {
|
||||
this->pgui = pgui;
|
||||
}
|
||||
|
||||
uint32 PLUGIN_API addRef() {
|
||||
refCount++;
|
||||
return refCount;
|
||||
}
|
||||
|
||||
uint32 PLUGIN_API release() {
|
||||
refCount--;
|
||||
if (refCount == 0) {
|
||||
delete this;
|
||||
return 0;
|
||||
}
|
||||
return refCount;
|
||||
}
|
||||
|
||||
tresult PLUGIN_API queryInterface (const Steinberg::TUID, void** obj) {
|
||||
*obj = nullptr;
|
||||
return kNotImplemented;
|
||||
}
|
||||
|
||||
private:
|
||||
uint32 refCount = 1;
|
||||
int fd;
|
||||
PGUI_TYPE pgui;
|
||||
};
|
||||
|
||||
class LinuxTimerHandler final : public Linux::ITimerHandler {
|
||||
public:
|
||||
void PLUGIN_API onTimer() {
|
||||
//PGUI_PROCESS_EVENTS(pgui);
|
||||
}
|
||||
|
||||
void setPGUI(PGUI_TYPE pgui) {
|
||||
this->pgui = pgui;
|
||||
}
|
||||
|
||||
uint32 PLUGIN_API addRef() {
|
||||
refCount++;
|
||||
return refCount;
|
||||
}
|
||||
|
||||
uint32 PLUGIN_API release() {
|
||||
refCount--;
|
||||
if (refCount == 0) {
|
||||
delete this;
|
||||
return 0;
|
||||
}
|
||||
return refCount;
|
||||
}
|
||||
|
||||
tresult PLUGIN_API queryInterface (const Steinberg::TUID, void** obj) {
|
||||
*obj = nullptr;
|
||||
return kNotImplemented;
|
||||
}
|
||||
|
||||
private:
|
||||
uint32 refCount = 1;
|
||||
PGUI_TYPE pgui;
|
||||
};
|
||||
|
||||
class PlugView : public EditorView {
|
||||
public:
|
||||
PlugView(EditController *controller, PGUI_TYPE pgui) : EditorView(controller, nullptr) {
|
||||
this->pgui = pgui;
|
||||
pgui_view_created = 0;
|
||||
}
|
||||
|
||||
~PlugView() {
|
||||
}
|
||||
|
||||
tresult PLUGIN_API isPlatformTypeSupported(FIDString type) {
|
||||
return strcmp(type, kPlatformTypeX11EmbedWindowID) ? kResultFalse : kResultTrue;
|
||||
}
|
||||
|
||||
tresult PLUGIN_API attached(void *parent, FIDString type) {
|
||||
pgui_view = PGUIVIEW_NEW(pgui, &parent);
|
||||
pgui_view_created = 1;
|
||||
plugFrame->queryInterface(Linux::IRunLoop::iid, (void **)&runLoop);
|
||||
int fds[2];
|
||||
pipe(fds);
|
||||
ev.setFD(fds[0]);
|
||||
ev.setPGUI(pgui);
|
||||
runLoop->registerEventHandler(&ev, fds[1]);
|
||||
timer.setPGUI(pgui);
|
||||
runLoop->registerTimer(&timer, 20);
|
||||
return kResultTrue;
|
||||
}
|
||||
|
||||
tresult PLUGIN_API removed() {
|
||||
runLoop->unregisterEventHandler(&ev);
|
||||
runLoop->unregisterTimer(&timer);
|
||||
close(fd);
|
||||
PGUIVIEW_FREE(pgui, pgui_view);
|
||||
pgui_view_created = 0;
|
||||
return kResultTrue;
|
||||
}
|
||||
|
||||
tresult PLUGIN_API getSize(ViewRect *size) {
|
||||
if (!pgui_view_created) {
|
||||
*size = ViewRect(0, 0, PGUIVIEW_GET_DEFAULT_WIDTH(pgui), PGUIVIEW_GET_DEFAULT_HEIGHT(pgui));
|
||||
return kResultTrue;
|
||||
}
|
||||
*size = ViewRect(0, 0, PGUIVIEW_GET_WIDTH(pgui, pgui_view), PGUIVIEW_GET_HEIGHT(pgui, pgui_view));
|
||||
return kResultTrue;
|
||||
}
|
||||
|
||||
tresult PLUGIN_API onSize(ViewRect *newSize) {
|
||||
if (!pgui_view_created)
|
||||
return kResultFalse;
|
||||
if (newSize)
|
||||
PGUIVIEW_RESIZE(pgui, pgui_view, newSize->getWidth(), newSize->getHeight());
|
||||
return kResultTrue;
|
||||
}
|
||||
|
||||
tresult PLUGIN_API canResize() {
|
||||
return kResultTrue;
|
||||
}
|
||||
|
||||
private:
|
||||
PGUI_TYPE pgui;
|
||||
char pgui_view_created;
|
||||
PGUIVIEW_TYPE pgui_view;
|
||||
Linux::IRunLoop* runLoop;
|
||||
int fd;
|
||||
LinuxEventHandler ev;
|
||||
LinuxTimerHandler timer;
|
||||
};
|
||||
|
||||
static void setParameterCb(void *handle, uint32_t id, float value) {
|
||||
EditController *c = (EditController *)handle;
|
||||
c->beginEdit(id);
|
||||
c->performEdit(id, value);
|
||||
c->endEdit(id);
|
||||
}
|
||||
|
||||
tresult PLUGIN_API Controller::initialize(FUnknown *context) {
|
||||
pgui = PGUI_NEW(this);
|
||||
if (pgui == nullptr)
|
||||
return kResultFalse;
|
||||
|
||||
//PGUI_SET_SET_PARAMETER(pgui, setParameterCb);
|
||||
|
||||
tresult r = EditController::initialize(context);
|
||||
|
||||
// add parameters
|
||||
for (int i = 0; i < NUM_PARAMETERS; i++)
|
||||
parameters.addParameter(
|
||||
ConstStringTable::instance()->getString(config_parameters[i].name),
|
||||
config_parameters[i].units ? ConstStringTable::instance()->getString(config_parameters[i].units) : nullptr,
|
||||
config_parameters[i].steps,
|
||||
config_parameters[i].defaultValueUnmapped,
|
||||
(config_parameters[i].out ? ParameterInfo::kIsReadOnly | ParameterInfo::kIsHidden : ParameterInfo::kCanAutomate)
|
||||
| (config_parameters[i].bypass ? ParameterInfo::kIsBypass : 0),
|
||||
i,
|
||||
0,
|
||||
config_parameters[i].shortName ? ConstStringTable::instance()->getString(config_parameters[i].shortName) : nullptr
|
||||
);
|
||||
|
||||
return kResultTrue;
|
||||
}
|
||||
|
||||
tresult PLUGIN_API Controller::terminate() {
|
||||
PGUI_FREE(pgui);
|
||||
|
||||
return EditController::terminate();
|
||||
}
|
||||
|
||||
IPlugView * PLUGIN_API Controller::createView(const char *name) {
|
||||
if (strcmp(name, ViewType::kEditor))
|
||||
return nullptr;
|
||||
|
||||
return new PlugView(this, pgui);
|
||||
}
|
||||
|
||||
tresult PLUGIN_API Controller::setComponentState(IBStream *state) {
|
||||
if (!state)
|
||||
return kResultFalse;
|
||||
|
||||
IBStreamer streamer(state, kLittleEndian);
|
||||
|
||||
float f;
|
||||
for (int i = 0; i < NUM_PARAMETERS; i++) {
|
||||
if (streamer.readFloat(f) == false)
|
||||
return kResultFalse;
|
||||
setParamNormalized(i, f);
|
||||
}
|
||||
|
||||
return kResultTrue;
|
||||
}
|
||||
|
||||
tresult PLUGIN_API Controller::setParamNormalized(ParamID id, ParamValue value) {
|
||||
tresult r = EditController::setParamNormalized(id, value);
|
||||
if (r == kResultTrue)
|
||||
PGUI_ON_PARAM_SET(pgui, id, value);
|
||||
return r;
|
||||
}
|
164
vst3/src/vst3/controllerWin.cpp
Normal file
@ -0,0 +1,164 @@
|
||||
/*
|
||||
* A-SID - C64 bandpass filter + LFO
|
||||
*
|
||||
* Copyright (C) 2022 Orastron srl unipersonale
|
||||
*
|
||||
* A-SID is free software: you can redistribute it and/or modify
|
||||
* it under the terms of the GNU General Public License as published by
|
||||
* the Free Software Foundation, version 3 of the License.
|
||||
*
|
||||
* A-SID 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 for more details.
|
||||
*
|
||||
* You should have received a copy of the GNU General Public License
|
||||
*
|
||||
* File author: Stefano D'Angelo, Paolo Marrone
|
||||
*/
|
||||
|
||||
#include "controller.h"
|
||||
|
||||
#include "pluginterfaces/base/conststringtable.h"
|
||||
#include "base/source/fstreamer.h"
|
||||
|
||||
#include <sys/types.h>
|
||||
#include <unistd.h>
|
||||
|
||||
#include <stdio.h>
|
||||
|
||||
class PlugView : public EditorView {
|
||||
public:
|
||||
PlugView(EditController *controller, PGUI_TYPE pgui) : EditorView(controller, nullptr) {
|
||||
this->pgui = pgui;
|
||||
pgui_view_created = 0;
|
||||
}
|
||||
|
||||
~PlugView() {
|
||||
}
|
||||
|
||||
tresult PLUGIN_API isPlatformTypeSupported(FIDString type) {
|
||||
return strcmp(type, kPlatformTypeHWND) ? kResultFalse : kResultTrue;
|
||||
}
|
||||
|
||||
tresult PLUGIN_API attached(void *parent, FIDString type) {
|
||||
pgui_view = PGUIVIEW_NEW(pgui, &parent);
|
||||
pgui_view_created = 1;
|
||||
|
||||
return kResultTrue;
|
||||
}
|
||||
|
||||
tresult PLUGIN_API removed() {
|
||||
|
||||
PGUIVIEW_FREE(pgui, pgui_view);
|
||||
pgui_view_created = 0;
|
||||
return kResultTrue;
|
||||
}
|
||||
|
||||
tresult PLUGIN_API getSize(ViewRect *size) {
|
||||
if (!pgui_view_created) {
|
||||
*size = ViewRect(0, 0, PGUIVIEW_GET_DEFAULT_WIDTH(pgui), PGUIVIEW_GET_DEFAULT_HEIGHT(pgui));
|
||||
return kResultTrue;
|
||||
}
|
||||
*size = ViewRect(0, 0, PGUIVIEW_GET_WIDTH(pgui, pgui_view), PGUIVIEW_GET_HEIGHT(pgui, pgui_view));
|
||||
return kResultTrue;
|
||||
}
|
||||
|
||||
tresult PLUGIN_API onSize(ViewRect *newSize) {
|
||||
if (!pgui_view_created)
|
||||
return kResultFalse;
|
||||
if (newSize)
|
||||
PGUIVIEW_RESIZE(pgui, pgui_view, newSize->getWidth(), newSize->getHeight());
|
||||
return kResultTrue;
|
||||
}
|
||||
|
||||
tresult PLUGIN_API canResize() {
|
||||
return kResultTrue;
|
||||
}
|
||||
|
||||
private:
|
||||
PGUI_TYPE pgui;
|
||||
char pgui_view_created;
|
||||
PGUIVIEW_TYPE pgui_view;
|
||||
};
|
||||
|
||||
/*
|
||||
static void setParameterCb(void *handle, uint32_t id, float value) {
|
||||
EditController *c = (EditController *)handle;
|
||||
c->beginEdit(id);
|
||||
c->performEdit(id, value);
|
||||
c->endEdit(id);
|
||||
}
|
||||
*/
|
||||
tresult PLUGIN_API Controller::initialize(FUnknown *context) {
|
||||
pgui = PGUI_NEW(this);
|
||||
if (pgui == nullptr)
|
||||
return kResultFalse;
|
||||
|
||||
//PGUI_SET_SET_PARAMETER(pgui, setParameterCb);
|
||||
|
||||
tresult r = EditController::initialize(context);
|
||||
|
||||
// add parameters
|
||||
for (int i = 0; i < NUM_PARAMETERS; i++)
|
||||
parameters.addParameter(
|
||||
ConstStringTable::instance()->getString(config_parameters[i].name),
|
||||
config_parameters[i].units ? ConstStringTable::instance()->getString(config_parameters[i].units) : nullptr,
|
||||
config_parameters[i].steps,
|
||||
config_parameters[i].defaultValueUnmapped,
|
||||
(config_parameters[i].out ? ParameterInfo::kIsReadOnly | ParameterInfo::kIsHidden : ParameterInfo::kCanAutomate)
|
||||
| (config_parameters[i].bypass ? ParameterInfo::kIsBypass : 0),
|
||||
i,
|
||||
0,
|
||||
config_parameters[i].shortName ? ConstStringTable::instance()->getString(config_parameters[i].shortName) : nullptr
|
||||
);
|
||||
|
||||
return kResultTrue;
|
||||
}
|
||||
|
||||
tresult PLUGIN_API Controller::terminate() {
|
||||
PGUI_FREE(pgui);
|
||||
|
||||
return EditController::terminate();
|
||||
}
|
||||
|
||||
IPlugView * PLUGIN_API Controller::createView(const char *name) {
|
||||
if (strcmp(name, ViewType::kEditor))
|
||||
return nullptr;
|
||||
|
||||
return new PlugView(this, pgui);
|
||||
}
|
||||
|
||||
tresult PLUGIN_API Controller::setComponentState(IBStream *state) {
|
||||
if (!state)
|
||||
return kResultFalse;
|
||||
|
||||
IBStreamer streamer(state, kLittleEndian);
|
||||
|
||||
float f;
|
||||
for (int i = 0; i < NUM_PARAMETERS; i++) {
|
||||
if (streamer.readFloat(f) == false)
|
||||
return kResultFalse;
|
||||
setParamNormalized(i, f);
|
||||
}
|
||||
|
||||
return kResultTrue;
|
||||
}
|
||||
|
||||
tresult PLUGIN_API Controller::setParamNormalized(ParamID id, ParamValue value) {
|
||||
tresult r = EditController::setParamNormalized(id, value);
|
||||
if (r == kResultTrue)
|
||||
PGUI_ON_PARAM_SET(pgui, id, value);
|
||||
return r;
|
||||
}
|
||||
|
||||
/*
|
||||
tresult PLUGIN_API Controller::setState (IBStream* state) {
|
||||
return kResultTrue;
|
||||
}
|
||||
|
||||
//------------------------------------------------------------------------
|
||||
tresult PLUGIN_API Controller::getState (IBStream* state) {
|
||||
return kResultTrue;
|
||||
}
|
||||
*/
|
53
vst3/src/vst3/entry.cpp
Normal file
@ -0,0 +1,53 @@
|
||||
/*
|
||||
* A-SID - C64 bandpass filter + LFO
|
||||
*
|
||||
* Copyright (C) 2022 Orastron srl unipersonale
|
||||
*
|
||||
* A-SID is free software: you can redistribute it and/or modify
|
||||
* it under the terms of the GNU General Public License as published by
|
||||
* the Free Software Foundation, version 3 of the License.
|
||||
*
|
||||
* A-SID 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 for more details.
|
||||
*
|
||||
* You should have received a copy of the GNU General Public License
|
||||
*
|
||||
* File author: Stefano D'Angelo
|
||||
*/
|
||||
|
||||
#include "plugin.h"
|
||||
#include "controller.h"
|
||||
|
||||
#include "pluginterfaces/vst/ivstaudioprocessor.h"
|
||||
#include "pluginterfaces/vst/ivsteditcontroller.h"
|
||||
#include "public.sdk/source/main/pluginfactory.h"
|
||||
|
||||
BEGIN_FACTORY_DEF(COMPANY_NAME, COMPANY_WEBSITE, COMPANY_MAILTO)
|
||||
|
||||
DEF_CLASS2(
|
||||
INLINE_UID(PLUGIN_GUID_1, PLUGIN_GUID_2, PLUGIN_GUID_3, PLUGIN_GUID_4), // GUID
|
||||
PClassInfo::kManyInstances, // cardinality
|
||||
kVstAudioEffectClass, // VST component class
|
||||
PLUGIN_NAME, // plugin name
|
||||
Vst::kDistributable, // plugin and controller can work on different computers
|
||||
PLUGIN_SUBCATEGORY, // VST subcategory
|
||||
PLUGIN_VERSION, // plugin version
|
||||
kVstVersionString, // VST version
|
||||
Plugin::createInstance // instatiation function pointer
|
||||
)
|
||||
|
||||
DEF_CLASS2(
|
||||
INLINE_UID(CTRL_GUID_1, CTRL_GUID_2, CTRL_GUID_3, CTRL_GUID_4), // GUID
|
||||
PClassInfo::kManyInstances, // cardinality
|
||||
kVstComponentControllerClass, // VST component class
|
||||
PLUGIN_NAME "Controller", // controller name
|
||||
0, // unused
|
||||
"", // unused
|
||||
PLUGIN_VERSION, // plugin version
|
||||
kVstVersionString, // VST version
|
||||
Controller::createInstance // instatiation function pointer
|
||||
)
|
||||
|
||||
END_FACTORY
|
205
vst3/src/vst3/plugin.cpp
Normal file
@ -0,0 +1,205 @@
|
||||
/*
|
||||
* A-SID - C64 bandpass filter + LFO
|
||||
*
|
||||
* Copyright (C) 2022 Orastron srl unipersonale
|
||||
*
|
||||
* A-SID is free software: you can redistribute it and/or modify
|
||||
* it under the terms of the GNU General Public License as published by
|
||||
* the Free Software Foundation, version 3 of the License.
|
||||
*
|
||||
* A-SID 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 for more details.
|
||||
*
|
||||
* You should have received a copy of the GNU General Public License
|
||||
*
|
||||
* File author: Stefano D'Angelo, Paolo Marrone
|
||||
*/
|
||||
|
||||
|
||||
#include "plugin.h"
|
||||
|
||||
#include "pluginterfaces/base/conststringtable.h"
|
||||
#include "pluginterfaces/vst/ivstparameterchanges.h"
|
||||
#include "base/source/fstreamer.h"
|
||||
|
||||
#include <algorithm>
|
||||
|
||||
#include <xmmintrin.h>
|
||||
#include <pmmintrin.h>
|
||||
|
||||
Plugin::Plugin() {
|
||||
setControllerClass(FUID(CTRL_GUID_1, CTRL_GUID_2, CTRL_GUID_3, CTRL_GUID_4));
|
||||
}
|
||||
|
||||
tresult PLUGIN_API Plugin::initialize(FUnknown *context) {
|
||||
instance = P_NEW();
|
||||
if (instance == nullptr)
|
||||
return kResultFalse;
|
||||
|
||||
tresult r = AudioEffect::initialize(context);
|
||||
if (r != kResultTrue) {
|
||||
P_FREE(instance);
|
||||
return r;
|
||||
}
|
||||
|
||||
// FIXME: vst3 sdk validator always seem to get kDefaultActive even in sdk plugins - it's probably broken, but let's check
|
||||
for (int i = 0; i < NUM_BUSES_IN; i++)
|
||||
addAudioInput(
|
||||
ConstStringTable::instance()->getString(config_buses_in[i].name),
|
||||
config_buses_in[i].configs & IO_STEREO ? SpeakerArr::kStereo : SpeakerArr::kMono,
|
||||
config_buses_in[i].aux ? kAux : kMain,
|
||||
(config_buses_in[i].cv ? BusInfo::kIsControlVoltage : 0)
|
||||
| (config_buses_in[i].aux ? 0 : BusInfo::kDefaultActive)
|
||||
);
|
||||
for (int i = 0; i < NUM_BUSES_OUT; i++)
|
||||
addAudioOutput(
|
||||
ConstStringTable::instance()->getString(config_buses_out[i].name),
|
||||
config_buses_out[i].configs & IO_STEREO ? SpeakerArr::kStereo : SpeakerArr::kMono,
|
||||
config_buses_out[i].aux ? kAux : kMain,
|
||||
(config_buses_out[i].cv ? BusInfo::kIsControlVoltage : 0)
|
||||
| (config_buses_out[i].aux ? 0 : BusInfo::kDefaultActive)
|
||||
);
|
||||
|
||||
minBusesIn = 0;
|
||||
for (int i = 0; i < NUM_BUSES_IN; i++)
|
||||
if (!config_buses_in[i].aux)
|
||||
minBusesIn++;
|
||||
|
||||
minBusesOut = 0;
|
||||
for (int i = 0; i < NUM_BUSES_OUT; i++)
|
||||
if (!config_buses_out[i].aux)
|
||||
minBusesOut++;
|
||||
|
||||
for (int i = 0; i < NUM_PARAMETERS; i++) {
|
||||
parameters[i] = config_parameters[i].defaultValueUnmapped;
|
||||
P_SET_PARAMETER(instance, i, parameters[i]);
|
||||
}
|
||||
|
||||
return kResultTrue;
|
||||
}
|
||||
|
||||
tresult PLUGIN_API Plugin::terminate() {
|
||||
P_FREE(instance);
|
||||
|
||||
return AudioEffect::terminate();
|
||||
}
|
||||
|
||||
tresult PLUGIN_API Plugin::setActive(TBool state) {
|
||||
if (state) {
|
||||
P_SET_SAMPLE_RATE(instance, sampleRate);
|
||||
P_RESET(instance);
|
||||
}
|
||||
return AudioEffect::setActive(state);
|
||||
}
|
||||
|
||||
tresult PLUGIN_API Plugin::setupProcessing(ProcessSetup &setup) {
|
||||
sampleRate = static_cast<float>(setup.sampleRate);
|
||||
return AudioEffect::setupProcessing(setup);
|
||||
}
|
||||
|
||||
tresult PLUGIN_API Plugin::process(ProcessData &data) {
|
||||
if (data.inputParameterChanges) {
|
||||
int32 n = data.inputParameterChanges->getParameterCount();
|
||||
for (int32 i = 0; i < n; i++) {
|
||||
IParamValueQueue *q = data.inputParameterChanges->getParameterData(i);
|
||||
if (!q)
|
||||
continue;
|
||||
ParamValue v;
|
||||
int32 o;
|
||||
if (q->getPoint(q->getPointCount() - 1, o, v) == kResultTrue) {
|
||||
int32 pi = q->getParameterId();
|
||||
parameters[pi] = v;
|
||||
P_SET_PARAMETER(instance, pi, std::min(std::max(static_cast<float>(v), 0.f), 1.f));
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
if (data.numInputs < minBusesIn || data.numOutputs < minBusesOut)
|
||||
return kResultOk;
|
||||
|
||||
int k = 0;
|
||||
for (int i = 0; i < data.numInputs; i++)
|
||||
for (int j = 0; j < data.inputs[i].numChannels; j++, k++)
|
||||
inputs[k] = (const float *)data.inputs[i].channelBuffers32[j];
|
||||
for (; k < NUM_CHANNELS_IN; k++)
|
||||
inputs[k] = nullptr;
|
||||
|
||||
k = 0;
|
||||
for (int i = 0; i < data.numOutputs; i++)
|
||||
for (int j = 0; j < data.outputs[i].numChannels; j++, k++)
|
||||
outputs[k] = data.outputs[i].channelBuffers32[j];
|
||||
for (; k < NUM_CHANNELS_OUT; k++)
|
||||
outputs[k] = nullptr;
|
||||
|
||||
const int flush_zero_mode = _MM_GET_FLUSH_ZERO_MODE();
|
||||
const char denormals_zero_mode = _MM_GET_DENORMALS_ZERO_MODE();
|
||||
|
||||
_MM_SET_FLUSH_ZERO_MODE(_MM_FLUSH_ZERO_ON);
|
||||
_MM_SET_DENORMALS_ZERO_MODE(_MM_DENORMALS_ZERO_ON);
|
||||
|
||||
P_PROCESS(instance, inputs, outputs, data.numSamples);
|
||||
|
||||
_MM_SET_FLUSH_ZERO_MODE(flush_zero_mode);
|
||||
_MM_SET_DENORMALS_ZERO_MODE(denormals_zero_mode);
|
||||
|
||||
// Send cutoff value to host
|
||||
IParameterChanges* outParamChanges = data.outputParameterChanges;
|
||||
if (outParamChanges) {
|
||||
float cutoffValue = asid_get_cutoff_modulated(instance);
|
||||
int32 index = 0;
|
||||
IParamValueQueue* paramQueue = outParamChanges->addParameterData (3, index);
|
||||
if (paramQueue)
|
||||
{
|
||||
int32 index2 = 0;
|
||||
paramQueue->addPoint (0, cutoffValue, index2);
|
||||
}
|
||||
}
|
||||
|
||||
return kResultTrue;
|
||||
}
|
||||
|
||||
tresult PLUGIN_API Plugin::setBusArrangements(SpeakerArrangement *inputs, int32 numIns, SpeakerArrangement *outputs, int32 numOuts) {
|
||||
if (numIns < minBusesIn || numIns > NUM_BUSES_IN)
|
||||
return kResultFalse;
|
||||
if (numIns < minBusesOut || numIns > NUM_BUSES_OUT)
|
||||
return kResultFalse;
|
||||
|
||||
for (int32 i = 0; i < numIns; i++)
|
||||
if ((config_buses_in[i].configs == IO_MONO && inputs[i] != SpeakerArr::kMono)
|
||||
|| inputs[i] != SpeakerArr::kStereo)
|
||||
return kResultFalse;
|
||||
for (int32 i = 0; i < numOuts; i++)
|
||||
if ((config_buses_out[i].configs == IO_MONO && outputs[i] != SpeakerArr::kMono)
|
||||
|| outputs[i] != SpeakerArr::kStereo)
|
||||
return kResultFalse;
|
||||
|
||||
return kResultTrue;
|
||||
}
|
||||
|
||||
tresult PLUGIN_API Plugin::setState(IBStream *state) {
|
||||
if (!state)
|
||||
return kResultFalse;
|
||||
|
||||
IBStreamer streamer(state, kLittleEndian);
|
||||
|
||||
float f;
|
||||
for (int i = 0; i < NUM_PARAMETERS; i++) {
|
||||
if (streamer.readFloat(f) == false)
|
||||
return kResultFalse;
|
||||
parameters[i] = f;
|
||||
P_SET_PARAMETER(instance, i, f);
|
||||
}
|
||||
|
||||
return kResultTrue;
|
||||
}
|
||||
|
||||
tresult PLUGIN_API Plugin::getState(IBStream *state) {
|
||||
IBStreamer streamer(state, kLittleEndian);
|
||||
|
||||
for (int i = 0; i < NUM_PARAMETERS; i++)
|
||||
streamer.writeFloat(parameters[i]);
|
||||
|
||||
return kResultTrue;
|
||||
}
|
58
vst3/src/vst3/plugin.h
Normal file
@ -0,0 +1,58 @@
|
||||
/*
|
||||
* A-SID - C64 bandpass filter + LFO
|
||||
*
|
||||
* Copyright (C) 2022 Orastron srl unipersonale
|
||||
*
|
||||
* A-SID is free software: you can redistribute it and/or modify
|
||||
* it under the terms of the GNU General Public License as published by
|
||||
* the Free Software Foundation, version 3 of the License.
|
||||
*
|
||||
* A-SID 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 for more details.
|
||||
*
|
||||
* You should have received a copy of the GNU General Public License
|
||||
*
|
||||
* File author: Stefano D'Angelo
|
||||
*/
|
||||
|
||||
#ifndef _VST3_PLUGIN_H
|
||||
#define _VST3_PLUGIN_H
|
||||
|
||||
#include "config.h"
|
||||
|
||||
#include "public.sdk/source/vst/vstaudioeffect.h"
|
||||
|
||||
using namespace Steinberg;
|
||||
using namespace Steinberg::Vst;
|
||||
|
||||
class Plugin : AudioEffect {
|
||||
public:
|
||||
Plugin();
|
||||
|
||||
static FUnknown *createInstance(void *context) {
|
||||
return (IAudioProcessor *) new Plugin();
|
||||
}
|
||||
|
||||
tresult PLUGIN_API initialize(FUnknown *context) SMTG_OVERRIDE;
|
||||
tresult PLUGIN_API terminate() SMTG_OVERRIDE;
|
||||
tresult PLUGIN_API setActive(TBool state) SMTG_OVERRIDE;
|
||||
tresult PLUGIN_API setupProcessing(ProcessSetup &setup) SMTG_OVERRIDE;
|
||||
tresult PLUGIN_API process(ProcessData &data) SMTG_OVERRIDE;
|
||||
tresult PLUGIN_API setBusArrangements(SpeakerArrangement *inputs, int32 numIns, SpeakerArrangement *outputs, int32 numOuts) SMTG_OVERRIDE;
|
||||
tresult PLUGIN_API setState(IBStream *state) SMTG_OVERRIDE;
|
||||
tresult PLUGIN_API getState(IBStream *state) SMTG_OVERRIDE;
|
||||
|
||||
private:
|
||||
float sampleRate;
|
||||
|
||||
float parameters[NUM_PARAMETERS];
|
||||
int32 minBusesIn, minBusesOut;
|
||||
|
||||
P_TYPE instance;
|
||||
const float *inputs[NUM_CHANNELS_IN];
|
||||
float *outputs[NUM_CHANNELS_OUT];
|
||||
};
|
||||
|
||||
#endif
|