AviSynth+ thread Vol.2

[feisty2]

you go ahead delete your posts if you want, I won't, I am not a big fan of self-censorship.

edit: for davidh, the definition of self-censorship: the act or action of refraining from expressing something (such as a thought, point of view, or belief) that others could deem objectionable. the perfect word for what you just did.

[wonkey_monkey]

Not what the word means but okay...

Self-censoring is quite distinct from censorship. That's why it has "self-" in front of it.

I deleted my posts not for their objectionality but because they were off-topic.

[pinterf]

O.K., by popular demand I consider integrating brainfuck language elements into Expr

[ChaosKing]

Finally something I can understand easily!

[Myrsloik]

Originally Posted by pinterf

O.K., by popular demand I consider integrating brainfuck language elements into Expr

We'll soon announce a commercial implementation of Expr that uses whitespace as the programming language. It's the only way to ensure nobody can read secret corporate scripts and is one of the most requested features in VapourSynth. The backend will be obviously be based on freepascal.

[wonkey_monkey]

pinterf, do you know if there's any documentation for jitasm? I see references to a "GettingStarted wiki" but I don't know where to find that or if it still exists. I'm slowly grasping it through reading exprfilter.cpp but I could use the context of an actual guide.

[GMJCZP]

Originally Posted by wonkey_monkey

pinterf, do you know if there's any documentation for jitasm? I see references to a "GettingStarted wiki" but I don't know where to find that or if it still exists. I'm slowly grasping it through reading exprfilter.cpp but I could use the context of an actual guide.

Will this do?
Here

[Dogway]

Thanks for the update pinterf. I got the Sorting Network to work, it is not THAT slow though. Given that the top speed one can get with a median in Expr is "undot" (min and max clamp), sorting is only 18% below in performance. It's fine for implementing exotic kernels and use in production. The only problem I see is that unlike ex_boxblur() median Expr can't match removegrain speed, and the only difference is the operator used (min and max), since pixel fetching is shown to give the same performance. I do think there might be room for improvement but can't actually tell as I don't understand CPP.

# 100% removegrain(1,-1)
#  83% ex_median(mode="undot",UV=1)
#  65% ex_median(mode="undot2",UV=1) # 301fps
#  1.2% MedianBlur(1,0,0)

I wanted to implement your median of 3 and 5 kernels, but didn't understand the code. What is the window size, 3x3? So I actually tested it and it matched removegrain(4,-1) (for radius 1). I think there's value for the MedianBlur plugin because it can use bigger kernels and also temporal, but the performance of 6fps struck me a bit.

# mode name prone to change (suggestions welcome :P )
mode == "undot2" ? "x[-1,1] A^ x[0,1] B^ x[1,1] C^ x[-1,0] D^ x[1,0] E^ x[-1,-1] F^ x[0,-1] G^ x[1,-1] H^ "  \
                  +"A C min AA^ A C max CC^ "                                                                \
                  +"B D min BB^ B D max DD^ "                                                                \
                  +"E G min EE^ E G max GG^ "                                                                \
                  +"F H min FF^ F H max HH^ "                                                                \
                  +"AA EE min A^ AA EE max E^ "                                                              \
                  +"BB FF min B^ BB FF max F^ "                                                              \
                  +"CC GG min C^ CC GG max G^ "                                                              \
                  +"DD HH min D^ DD HH max H^ "                                                              \
                  +"A B min AA^ A B max BB^ "                                                                \
                  +"C D min CC^ C D max DD^ "                                                                \
                  +"E F min EE^ E F max FF^ "                                                                \
                  +"G H min GG^ G H max HH^ "                                                                \
                  +"CC EE min C^ CC EE max E^ "                                                              \
                  +"DD FF min D^ DD FF max F^ "                                                              \
                  +"BB E min B^ BB E max EE^ "                                                               \
                  +"D GG min DD^ D GG max G^ "                                                               \
                  +"B C min BB^ B C max CC^ "                                                                \
                  +"DD EE min D^ DD EE max E^ "                                                              \
                  +"F G min FF^ F G max GG^ "                                                                \
                  +"x[0,0] BB GG clip"                                                                     : \

@wonkey_monkey: I tested with the ternary option as I thought one ternary might be faster than min+max but I don't think your code example works.

"A C < Q@ A AA^ C CC^ ? Z^ Q C CC^ A AA^ ? Z^ "

I think Expr ternaries don't look for a true or false (in case Q@ catches that at all) but expect a comparison operator.

PD: I had a look at the MSVC compiler size, 40Gb, ouch!

[wonkey_monkey]

Originally Posted by GMJCZP

Will this do?
Here

That's asmjit rather than jitasm, but actually yes, it will make for informative reading, so thanks!

[wonkey_monkey]

Originally Posted by Dogway

@wonkey_monkey: I tested with the ternary option as I thought one ternary might be faster than min+max but I don't think your code example works.

"A C < Q@ A AA^ C CC^ ? Z^ Q C CC^ A AA^ ? Z^ "

I think Expr ternaries don't look for a true or false (in case Q@ catches that at all) but expect a comparison operator.

A quick "fingers" test - lift a finger for each variable that gets added to the stack, lower a finger for each popstore or regular operator, lower two fingers for a "?" - suggests you've only got one item on the stack when you reach the "?"

Remember that everything before the "?" gets executed - all "?" does is select which of the two topmost stack items to remove. Maybe you meant AA@ and CC@, so as not to remove A and C from stack, but in any case both will then be overwritten by the next section anyway, as will the result you would have stored in Z.

So your code says:

Compare A and C (stack contains result)
Store result in Q (stack contains result)
Load A, but immediately store and pop into AA (stack contains result)
Load C, but immediate store and pop into CC (stack contains result)
? - needs three items on the stack so it fails

Also shouldn't the last line be:

                  x[0,0] FF GG clip"

?

[feisty2]

PD: I had a look at the MSVC compiler size, 40Gb, ouch!

GCC 11 (mingw-w64 target) is less than 100MB, and msvc is far less than 40GB if you only need C++ components.

[Dogway]

@wonkey_monkey: true, true, typo (^ for @). I was also overwriting the second ternary.

This thing is tricky, this should do it but it doesn't, so I will leave this here and think in the evening:

+"A C      < Q@ A   AA@ C   CC@ ? Z^ Q C   CC@ A   AA@ ? Z^ "
+"B D      < Q@ B   BB@ D   DD@ ? Z^ Q D   DD@ B   BB@ ? Z^ "
+"E G      < Q@ E   EE@ G   GG@ ? Z^ Q G   GG@ E   EE@ ? Z^ "
+"F H      < Q@ F   FF@ H   HH@ ? Z^ Q H   HH@ F   FF@ ? Z^ "
+"AA EE    < Q@ AA AAA@ EE EEE@ ? Z^ Q EE EEE@ AA AAA@ ? Z^ "
+"BB FF    < Q@ BB BBB@ FF FFF@ ? Z^ Q FF FFF@ BB BBB@ ? Z^ "
+"CC GG    < Q@ CC CCC@ GG GGG@ ? Z^ Q GG GGG@ CC CCC@ ? Z^ "
+"DD HH    < Q@ DD DDD@ HH HHH@ ? Z^ Q HH HHH@ DD DDD@ ? Z^ "
+"AAA BBB  < Q@ AAA  A@ BBB  B@ ? Z^ Q BBB  B@ AAA  A@ ? Z^ "
+"CCC DDD  < Q@ CCC  C@ DDD  D@ ? Z^ Q DDD  D@ CCC  C@ ? Z^ "
+"EEE FFF  < Q@ EEE  E@ FFF  F@ ? Z^ Q FFF  F@ EEE  E@ ? Z^ "
+"GGG HHH  < Q@ GGG  G@ HHH  H@ ? Z^ Q HHH  H@ GGG  G@ ? Z^ "
+"C E      < Q@ C   CC@ E   EE@ ? Z^ Q E   EE@ C   CC@ ? Z^ "
+"D F      < Q@ D   DD@ F   FF@ ? Z^ Q F   FF@ D   DD@ ? Z^ "
+"B EE     < Q@ B   BB@ EE EEE@ ? Z^ Q EE EEE@ B   BB@ ? Z^ "
+"DD G     < Q@ DD DDD@ G   GG@ ? Z^ Q G   GG@ DD DDD@ ? Z^ "
+"BB CC    < Q@ BB BBB@ CC CCC@ ? Z^ Q CC CCC@ BB BBB@ ? Z^ "
+"DDD EEE  < Q@ DDD  D@ EEE  E@ ? Z^ Q EEE  E@ DDD  D@ ? Z^ "
+"FF GG    < Q@ FF FFF@ GG GGG@ ? Z^ Q GG GGG@ FF FFF@ ? Z^ "

The last line should be the second from the minimum and second from the maximum, since order is A B C D E F G H, I chose B G. I compared it against removegrain(2) anyway.

[wonkey_monkey]

Originally Posted by Dogway

This thing is tricky, this should do it but it doesn't, so I will leave this here and think in the evening:

I'm afraid you're still misunderstanding how "?" works. Could you start a new thread so we can discuss it there, or I can PM you?

[Dogway]

I have used ternaries for years now, this is rather a stack issue, posted here a simplified code.

[qyot27]

It took several months, but I finally got around to working on a macOS installer package. 3.7.0 is available on the normal Releases page, in two forms:
High Sierra and Mojave builds (10.13 & 10.14)
Catalina and higher builds (10.15+)

And also filesonly tarballs if you'd rather skip the installer (although they do have shell scripts to help users unfamiliar with the process).

[wonkey_monkey]

Is there any way to load the contents of a text file as a string using built-in Avisynth functions? I can't seem to find one but maybe there is a trick.

[StainlessS]

Is there any way to load the contents of a text file as a string

Not that I ever found. [even trying to abuse Import() failed for me].

Only thing I'm aware of,

RT_ReadTxtFromFile(String ,Int "Lines"=0,Int "Start"=0)
 Non-clip function.
 String Filename, Name of text file to load into a string.
 Lines=0=unlimited. Set to number of leading lines in text file to load, eg 1 = load only the first line of text file.
 The return string is n/l ie Chr(10) separated, and carriage returns are removed from the returned string.
 If source file was missing newline on very last line, it will append a newline so that all lines are similarly formatted.
 v1.03, Added Start arg default=0=very first line (relative 0). Would have been nice to have start and lines in reverse
 order but implemented as above to not break scripts.
 Throws an error if your requested Start is >= to the number of lines in the file, or zero len file.
 To fetch the last line of a text file, use eg Start = RT_FileQueryLines(Filename) - 1 (Start is zero relative).
 You could eg get the last line of a d2v file which might look like this:- "FINISHED  100.00% VIDEO"

[pinterf]

Originally Posted by wonkey_monkey

Is there any way to load the contents of a text file as a string using built-in Avisynth functions? I can't seem to find one but maybe there is a trick.

Abusing ConditionalReader?
http://avisynth.nl/index.php/ConditionalReader

[pinterf]

Originally Posted by qyot27

It took several months, but I finally got around to working on a macOS installer package. 3.7.0 is available on the normal Releases page, in two forms:
High Sierra and Mojave builds (10.13 & 10.14)
Catalina and higher builds (10.15+)

And also filesonly tarballs if you'd rather skip the installer (although they do have shell scripts to help users unfamiliar with the process).

Congratulations!

[LigH]

AviSynth+ on Mac? Selur might enjoy that for Hybrid...