Beispiele und Screenshots 13.5.2025

20250513/ad-20250513.tex

@@ -150,7 +150,7 @@
       Mehrere Paritäten, geschickt angeordnet,\\
       ermöglichen \newterm{Fehlerkorrektur}
     \item[\boldmath$-$]
-      weniger Leistungsfähig als Reed-Solomon-Code
+      weniger leistungsfähig als Reed-Solomon-Code
     \item[\boldmath$+$]
       benötigt nur XOR-Operationen \textarrow\ in Hardware implementierbar
   \end{itemize}
@@ -565,6 +565,8 @@
   \end{center}
 \end{frame}
 
+\iffalse
+
 \addtocounter{subsection}{-1}
 \subsection{Objekte: Zugriffsrechte}
 
@@ -838,4 +840,6 @@
   \end{itemize}
 \end{frame}
 
+\fi
+
 \end{document}

20250513/const-01.c

+#include <stdio.h>
+
+int main (void)
+{
+  const int n = 5;
+  int prime[n] = { 2, 3, 5, 7, 11 };
+  for (int i = 0; i < n; i++)
+    printf ("%d\n", prime[i]);
+  return 0;
+}

20250513/const-02.c

+#include <stdio.h>
+
+int main (void)
+{
+  const int n = 5;
+  int prime[n];
+  prime[0] = 2;
+  prime[1] = 3;
+  prime[2] = 5;
+  prime[3] = 7;
+  prime[4] = 11;
+  for (int i = 0; i < n; i++)
+    printf ("%d\n", prime[i]);
+  return 0;
+}

20250513/const-02.s

+	.file	"const-02.c"
+	.text
+	.section	.rodata.str1.1,"aMS",@progbits,1
+.LC1:
+	.string	"%d\n"
+	.section	.text.startup,"ax",@progbits
+	.p2align 4
+	.globl	main
+	.type	main, @function
+main:
+.LFB11:
+	.cfi_startproc
+	pushq	%r12
+	.cfi_def_cfa_offset 16
+	.cfi_offset 12, -16
+	pushq	%rbp
+	.cfi_def_cfa_offset 24
+	.cfi_offset 6, -24
+	leaq	.LC1(%rip), %rbp
+	pushq	%rbx
+	.cfi_def_cfa_offset 32
+	.cfi_offset 3, -32
+	subq	$32, %rsp
+	.cfi_def_cfa_offset 64
+	movdqa	.LC0(%rip), %xmm0
+	movl	$11, 16(%rsp)
+	movq	%rsp, %rbx
+	leaq	20(%rsp), %r12
+	movaps	%xmm0, (%rsp)
+	.p2align 4,,10
+	.p2align 3
+.L2:
+	movl	(%rbx), %esi
+	movq	%rbp, %rdi
+	xorl	%eax, %eax
+	addq	$4, %rbx
+	call	printf@PLT
+	cmpq	%r12, %rbx
+	jne	.L2
+	addq	$32, %rsp
+	.cfi_def_cfa_offset 32
+	xorl	%eax, %eax
+	popq	%rbx
+	.cfi_def_cfa_offset 24
+	popq	%rbp
+	.cfi_def_cfa_offset 16
+	popq	%r12
+	.cfi_def_cfa_offset 8
+	ret
+	.cfi_endproc
+.LFE11:
+	.size	main, .-main
+	.section	.rodata.cst16,"aM",@progbits,16
+	.align 16
+.LC0:
+	.long	2
+	.long	3
+	.long	5
+	.long	7
+	.ident	"GCC: (Debian 12.2.0-14) 12.2.0"
+	.section	.note.GNU-stack,"",@progbits

20250513/const-03.c

+#include <stdio.h>
+
+const int n = 5;
+int prime[n];
+
+int main (void)
+{
+  prime[0] = 2;
+  prime[1] = 3;
+  prime[2] = 5;
+  prime[3] = 7;
+  prime[4] = 11;
+  for (int i = 0; i < n; i++)
+    printf ("%d\n", prime[i]);
+  return 0;
+}

20250513/const-04.c

+#include <stdio.h>
+
+const int n = 5;
+
+int main (void)
+{
+  n = 7;
+  int prime[n];
+  prime[0] = 2;
+  prime[1] = 3;
+  prime[2] = 5;
+  prime[3] = 7;
+  prime[4] = 11;
+  for (int i = 0; i < n; i++)
+    printf ("%d\n", prime[i]);
+  return 0;
+}

20250513/const-05.c

+#include <stdio.h>
+
+const int n = 5;
+
+int main (void)
+{
+  int *p = &n;
+  *p = 7;
+  int prime[n];
+  prime[0] = 2;
+  prime[1] = 3;
+  prime[2] = 5;
+  prime[3] = 7;
+  prime[4] = 11;
+  for (int i = 0; i < n; i++)
+    printf ("%d\n", prime[i]);
+  return 0;
+}

20250513/const-06.c

+#include <stdio.h>
+
+#define N 5
+int prime[N] = { 2, 3, 5, 7, 11 };
+
+int main (void)
+{
+  for (int i = 0; i < N; i++)
+    printf ("%d\n", prime[i]);
+  return 0;
+}

20250513/const-07.cpp

+#include <stdio.h>
+
+const int n = 5;
+int prime[n] = { 2, 3, 5, 7, 11 };
+
+int main (void)
+{
+  for (int i = 0; i < n; i++)
+    printf ("%d\n", prime[i]);
+  return 0;
+}

20250513/constexpr-01.c

+#include <stdio.h>
+
+const int answer = 42;
+
+int main (void)
+{
+  printf ("The answer is: %d\n", answer);
+  return 0;
+}

20250513/constexpr-02.c

+#include <stdio.h>
+
+const int answer = 2 * 3 * 7;
+
+int main (void)
+{
+  printf ("The answer is: %d\n", answer);
+  return 0;
+}

20250513/constexpr-03.c

+#include <stdio.h>
+
+int fak (int n)
+{
+  if (n > 1)
+    return n * fak (n - 1);
+  else
+    return 1;
+}
+
+const int answer = fak (3) * 7;
+
+int main (void)
+{
+  printf ("The answer is: %d\n", answer);
+  return 0;
+}

20250513/constexpr-04.c

+#include <stdio.h>
+
+int fak (int n)
+{
+  if (n > 1)
+    return n * fak (n - 1);
+  else
+    return 1;
+}
+
+const int answer = (int) fak (3) * 7;
+
+int main (void)
+{
+  printf ("The answer is: %d\n", answer);
+  return 0;
+}

20250513/constexpr-05.c

+#include <stdio.h>
+
+int fak (int n)
+{
+  if (n > 1)
+    return n * fak (n - 1);
+  else
+    return 1;
+}
+
+const int answer = ((int) fak) * 7;
+
+int main (void)
+{
+  printf ("The answer is: %d\n", answer);
+  return 0;
+}

20250513/constexpr-06.cpp

+#include <stdio.h>
+
+int fak (int n)
+{
+  if (n > 1)
+    return n * fak (n - 1);
+  else
+    return 1;
+}
+
+const int answer = fak (3) * 7;
+
+int main (void)
+{
+  printf ("The answer is: %d\n", answer);
+  return 0;
+}

20250513/constexpr-06.s

+	.file	"constexpr-06.cpp"
+	.text
+	.p2align 4
+	.globl	_Z3faki
+	.type	_Z3faki, @function
+_Z3faki:
+.LFB12:
+	.cfi_startproc
+	movl	$1, %eax
+	cmpl	$1, %edi
+	jle	.L4
+	.p2align 4,,10
+	.p2align 3
+.L3:
+	movl	%edi, %edx
+	subl	$1, %edi
+	imull	%edx, %eax
+	cmpl	$1, %edi
+	jne	.L3
+	ret
+	.p2align 4,,10
+	.p2align 3
+.L4:
+	ret
+	.cfi_endproc
+.LFE12:
+	.size	_Z3faki, .-_Z3faki
+	.section	.rodata.str1.1,"aMS",@progbits,1
+.LC0:
+	.string	"The answer is: %d\n"
+	.section	.text.startup,"ax",@progbits
+	.p2align 4
+	.globl	main
+	.type	main, @function
+main:
+.LFB13:
+	.cfi_startproc
+	subq	$8, %rsp
+	.cfi_def_cfa_offset 16
+	movl	_ZL6answer(%rip), %esi
+	leaq	.LC0(%rip), %rdi
+	xorl	%eax, %eax
+	call	printf@PLT
+	xorl	%eax, %eax
+	addq	$8, %rsp
+	.cfi_def_cfa_offset 8
+	ret
+	.cfi_endproc
+.LFE13:
+	.size	main, .-main
+	.p2align 4
+	.type	_GLOBAL__sub_I__Z3faki, @function
+_GLOBAL__sub_I__Z3faki:
+.LFB15:
+	.cfi_startproc
+	movl	$42, _ZL6answer(%rip)
+	ret
+	.cfi_endproc
+.LFE15:
+	.size	_GLOBAL__sub_I__Z3faki, .-_GLOBAL__sub_I__Z3faki
+	.section	.init_array,"aw"
+	.align 8
+	.quad	_GLOBAL__sub_I__Z3faki
+	.local	_ZL6answer
+	.comm	_ZL6answer,4,4
+	.ident	"GCC: (Debian 12.2.0-14) 12.2.0"
+	.section	.note.GNU-stack,"",@progbits

20250513/constexpr-07.cpp

+#include <stdio.h>
+
+constexpr int fak (int n)
+{
+  if (n > 1)
+    return n * fak (n - 1);
+  else
+    return 1;
+}
+
+const int answer = fak (3) * 7;
+
+int main (void)
+{
+  printf ("The answer is: %d\n", answer);
+  return 0;
+}

20250513/constexpr-07.s

+	.file	"constexpr-07.cpp"
+	.text
+	.section	.rodata.str1.1,"aMS",@progbits,1
+.LC0:
+	.string	"The answer is: %d\n"
+	.section	.text.startup,"ax",@progbits
+	.p2align 4
+	.globl	main
+	.type	main, @function
+main:
+.LFB13:
+	.cfi_startproc
+	subq	$8, %rsp
+	.cfi_def_cfa_offset 16
+	movl	$42, %esi
+	leaq	.LC0(%rip), %rdi
+	xorl	%eax, %eax
+	call	printf@PLT
+	xorl	%eax, %eax
+	addq	$8, %rsp
+	.cfi_def_cfa_offset 8
+	ret
+	.cfi_endproc
+.LFE13:
+	.size	main, .-main
+	.ident	"GCC: (Debian 12.2.0-14) 12.2.0"
+	.section	.note.GNU-stack,"",@progbits

20250513/constexpr-08.cpp

+#include <stdio.h>
+
+constexpr int fak (int n)
+{
+  if (n > 1)
+    return n * fak (n - 1);
+  else
+    return 1;
+}
+
+int prime[fak (3)] = { 2, 3, 5, 7, 11, 13 };
+
+int main (void)
+{
+  for (int i = 0; i < fak (3); i++)
+    printf ("%d\n", prime[i]);
+  return 0;
+}