.png/1200px-Flag_map_of_Divided_Korea_(1945_-_1950).png "Division of Korea into North and South")
_k%C3%B6zn%C3%A9l._Harck%C3%A9ptelenn%C3%A9_tett_ISU-152-es_szovjet_rohaml%C3%B6vegek%2C_a_h%C3%A1tt%C3%A9rben_egy_T-34-85_harckocsi._Fortepan_24854.jpg/330px-J%C3%B3zsef_k%C3%B6r%C3%BAt_a_Corvin_(Kisfaludy)_k%C3%B6zn%C3%A9l._Harck%C3%A9ptelenn%C3%A9_tett_ISU-152-es_szovjet_rohaml%C3%B6vegek%2C_a_h%C3%A1tt%C3%A9rben_egy_T-34-85_harckocsi._Fortepan_24854.jpg "Hungarian Revolution 1956")
There was a girl named "Snow White Spinderula", who awaked from a stunned, cryostatic, petrified, paralyzed state, because she ate the forbidden fruit of knowledge from the apple tree in the garden of paradise and a piece of apple got stuck in her throat.
Snow White Spinderula spits out the piece of apple, breathes and feels permeated again by the fresh and active spirit of life, recognizing that 7 dwarves standing around her.
Bit by bit she realizes now that many different things in the current world have disappeared or gone for ever and that this had nothing at all to do with the 7 dwarfs keeping an eye on her.
It's so sad to realize, that so many groups from the left or middle-class spectrum of society disappeared, shut down their internet presence and blogs and let themselves be pushed out and no longer dared to express their opinion freely in public space or on main stream channels of the internet.
Integration of NIS (Network Information Sytem originally called Yellow Pages) in latest apple OS.
Some projects on freshmeat.net sourceforge.net knowledge to use UDP for large - huge amount of data and the intention to develope a symmetric, asymmetric or certificate based standardized encryption for all services based on UDP.
Realization that everything (file transfer, authentication, authorization including claims and bearer tokens, web services instead of old style Sun RPC or modern gRPC, VPN, ...) over HTTPS might not be always the ideal solution and best practice and could be realized more service oriented otherwise.
Development of a more reliable driver and toolkit for mounting btrfs, ext2-4, xfs zfs file systems under Microsoft Windows 10-11.
Full capacity of stell processing industry at voestalpine Linz
https://www.voestalpine.com/highperformancemetals/international/en/
Many other things will be reported soonly.
It is up to everyone to evaluate the opportunities and risks after exploring and learning the scope and hardfacts in detail.
[ ... to be continued ... ]
In einem Anfall von Nostalgie lud ich mir 2 VIC20 Emulatoren herunter.
und programmierte in BASIC ein einfaches Zahlenratespiel:
Common images in western societies from social and economic point of view:
At least one or both parents work most of the year and gain income for family. Family might get money from the state for the children to help getting them educated in public or private school and later an education to get a paid job in our economy.
A pair in a kind of love or sexual relation lives together, because they cannot reproduce or don't want to have children. Normally both work (maybe not fulltime) and earn money.
Hi, I implemented SUPU (SUdoku PUzzle), idea & design by Georg Toth for Windows Desktop.
You can order Supu on Georg Toth Webshop here:
https://www.georg-toth.com/supu
so a little fun project "frogA- frogger Android" is taking some little progress.
https://www.youtube.com/shorts/4FAhYn2c5oU
Orginal posting can be fount here: http://blog.darkstar.work/2012/05/flex-fast-lexical-analyzer-generator.html
Who remember flex: fast lexical analyzer generator?
Here is a short sample, I have written it under gnu linux and ported it to win32 using gnuwin32 flex and getoptwin:
We have this simple c modified code from stack overflow called funcptrtest.c:
include <stdio.h>
/* C code for program funcptrtest.c
=> https://pastebin.com/rUtXfgSG
*/
const int b = 23;
// A normal function with an int parameter and void return type
void fun(int a)
{
if (a < b)
printf("Value of a (%d) is lesser then value of b (%d)\n", a, b);
else if (a == b)
printf("Value of a (%d) is equal value of b (%d)\n", a, b);
else if (a > b)
printf("Value of a (%d) is greater than value of b (%d)\n", a, b);
}
// main => NO KNR style int main(argc, argv) int argc; char **argv
int main(int argc, char **argv)
{
int i = 0;
/* fun_ptr is a pointer to function fun()
void (*fun_ptr)(int) = &fun;
is equivalent of following two
void (*fun_ptr)(int);
fun_ptr = &fun;
*/
void (*fun_ptr)(int) = &fun;
// call once with static int
(*fun_ptr)(b);
// iterate through for loop
for (i = 1; i < 101; i+=11) {
// Invoking fun() using fun_ptr
(*fun_ptr)(i);
}
return 0;
}
We compile it now with gnu c compiler with gcc option -S and generate an assembler file:
gcc -S funcptrtest.c -o funcptrtest.asm
Result will be something like this:
.file "funcptrtest.c"
.text
.globl b
.section .rodata
.align 4
.type b, @object
.size b, 4
b:
.long 23
.align 8
.LC0:
.string "Value of a (%d) is lesser then value of b (%d)\n"
.align 8
.LC1:
.string "Value of a (%d) is equal value of b (%d)\n"
.align 8
.LC2:
.string "Value of a (%d) is greater than value of b (%d)\n"
.text
.globl fun
.type fun, @function
fun:
.LFB0:
.cfi_startproc
endbr64
pushq %rbp
.cfi_def_cfa_offset 16
.cfi_offset 6, -16
movq %rsp, %rbp
.cfi_def_cfa_register 6
subq $16, %rsp
movl %edi, -4(%rbp)
movl $23, %eax
cmpl %eax, -4(%rbp)
jge .L2.L2:
movl $23, %eax
cmpl %eax, -4(%rbp)
jne .L4
movl $23, %edx
movl -4(%rbp), %eax
movl %eax, %esi
leaq .LC1(%rip), %rax
movq %rax, %rdi
movl $0, %eax
call printf@PLT
jmp .L5
.L2:
movl $23, %eax
cmpl %eax, -4(%rbp)
jne .L4
movl $23, %edx
movl -4(%rbp), %eax
movl %eax, %esi
leaq .LC1(%rip), %rax
movq %rax, %rdi
movl $0, %eax
call printf@PLT
.L2:
movl $23, %eax
cmpl %eax, -4(%rbp)
jne .L4
movl $23, %edx
movl -4(%rbp), %eax
movl %eax, %esi
leaq .LC1(%rip), %rax
movq %rax, %rdi
movl $0, %eax
call printf@PLT
jmp .L5
.L4:
movl $23, %eax
cmpl %eax, -4(%rbp)
jle .L5
movl $23, %edx
movl -4(%rbp), %eax
movl %eax, %esi
leaq .LC2(%rip), %rax
movq %rax, %rdi
movl $0, %eax
call printf@PLT
.L5:
nop
leave
.cfi_def_cfa 7, 8
ret
.cfi_endproc
.LFE0:
.size fun, .-fun
.globl main
.type main, @function
main:
.LFB1:
.cfi_startproc
endbr64
pushq %rbp
.cfi_def_cfa_offset 16
.cfi_offset 6, -16
movq %rsp, %rbp
.cfi_def_cfa_register 6
subq $32, %rsp
movl %edi, -20(%rbp)
movq %rsi, -32(%rbp)
movl $0, -12(%rbp)
leaq fun(%rip), %rax
movq %rax, -8(%rbp)
movl $23, %edx
movq -8(%rbp), %rax
movl %edx, %edi
call *%rax
movl $1, -12(%rbp)
jmp .L7
.L8:
movl -12(%rbp), %eax
movq -8(%rbp), %rdx
movl %eax, %edi
call *%rdx
addl $11, -12(%rbp)
.L7:
cmpl $100, -12(%rbp)
jle .L8
movl $0, %eax
leave
.cfi_def_cfa 7, 8
ret
.cfi_endproc
.LFE1:
.size main, .-main
.ident "GCC: (Ubuntu 11.3.0-1ubuntu1~22.04) 11.3.0"
.section .note.GNU-stack,"",@progbits
.section .note.gnu.property,"a"
.align 8
.long 1f - 0f
.long 4f - 1f
.long 5
0:
.string "GNU"
1:
.align 8
.long 0xc0000002
.long 3f - 2f
2:
.long 0x3
3:
.align 8
4:
Lets look, if a simple loop is faster than a function pointer delegate call:
/* program looptest.c */
include <stdio.h>
const int b = 23;
// main
int main(int argc, char **argv)
{
int i = 0;
int a = 23;
/*
if (a < b)
printf("Value of a (%d) is lesser then value of b (%d)\n", a, b);
else if (a == b)
printf("Value of a (%d) is equal value of b (%d)\n", a, b);
else if (a > b)
printf("Value of a (%d) is greater than value of b (%d)\n", a, b);
*/
// iterate through for loop
for (i = 1; i < 4194304; i+=11) {
a = i;
if (a < b)
printf("Value of a (%d) is lesser then value of b (%d)\n", a, b);
else if (a == b)
printf("Value of a (%d) is equal value of b (%d)\n", a, b);
else if (a > b)
printf("Value of a (%d) is greater than value of b (%d)\n", a, b);
}
return 0;
}
/* program funcptrtest.c */
include <stdio.h>
const int b = 23;
// A normal function with an int parameter and void return type
void fun(int a)
{
if (a < b)
printf("Value of a (%d) is lesser then value of b (%d)\n", a, b);
else if (a == b)
printf("Value of a (%d) is equal value of b (%d)\n", a, b);
else if (a > b)
printf("Value of a (%d) is greater than value of b (%d)\n", a, b);
}
// main
int main(int argc, char **argv)
{
int i = 0;
/* fun_ptr is a pointer to function fun()
void (*fun_ptr)(int) = &fun;
is equivalent of following two
void (*fun_ptr)(int);
fun_ptr = &fun;
*/
void (*fun_ptr)(int) = &fun;
// call once with static int
// (*fun_ptr)(b);
// iterate through for loop
for (i = 1; i < 4194304; i+=11) {
// Invoking fun() using fun_ptr
(*fun_ptr)(i);
}
return 0;
}
Well, that's not so deterministic, of course our simple looptest.asm has a shorter assembler.
But execution time is not so huge difference, we have to simulate, that in many scenarios.
[To be continued ...]