summaryrefslogtreecommitdiff
path: root/schulung_tools/pgflt/func.c
diff options
context:
space:
mode:
authorJohn Ogness <john.ogness@linutronix.de>2018-02-20 15:03:14 +0100
committerJohn Ogness <john.ogness@linutronix.de>2018-02-20 15:03:14 +0100
commit021b32acd3cec8e255dd47681939797ec64b8206 (patch)
treef6aa8e57b5bbc8045ae9ec87f4cebac764149ebf /schulung_tools/pgflt/func.c
parentdba99eeb7689d594f9d704d8b7de15432279aa82 (diff)
tools: rename 'rtex' tool to 'pgflt'
The rtex tool only demonstrates prefaultingn to avoid runtime page faults. It makes more sense to call it pgflt. Signed-off-by: John Ogness <john.ogness@linutronix.de>
Diffstat (limited to 'schulung_tools/pgflt/func.c')
-rw-r--r--schulung_tools/pgflt/func.c69
1 files changed, 69 insertions, 0 deletions
diff --git a/schulung_tools/pgflt/func.c b/schulung_tools/pgflt/func.c
new file mode 100644
index 0000000..4b88166
--- /dev/null
+++ b/schulung_tools/pgflt/func.c
@@ -0,0 +1,69 @@
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+#include <time.h>
+#include <sys/time.h>
+#include <sys/resource.h>
+
+void timestamp(const char *msg, int val)
+{
+ static struct timespec tsl;
+ static long minfltl;
+
+ struct timespec ts;
+ unsigned long diff;
+ struct rusage r;
+ long rdiff;
+
+ clock_gettime(CLOCK_MONOTONIC, &ts);
+ getrusage(RUSAGE_SELF, &r);
+
+ if (tsl.tv_sec != 0) {
+ diff = (ts.tv_sec - tsl.tv_sec) * 1000000000;
+ diff += ts.tv_nsec - tsl.tv_nsec;
+
+ rdiff = r.ru_minflt - minfltl;
+
+ printf("% 10d ns % 5ld faults : %s", diff, rdiff, msg);
+ if (val >= 0)
+ printf(" (%d)", val);
+ printf("\n");
+ }
+
+ tsl = ts;
+ minfltl = r.ru_minflt;
+}
+
+/* 10 MiB */
+#define SIZE (10 * 1024 * 1024)
+
+void testfunc_malloc(void)
+{
+ char *p;
+
+ p = malloc(SIZE);
+ if (!p) {
+ fprintf(stderr, "MALLOC FAILED: %s:%d\n", __FILE__, __LINE__);
+ return;
+ }
+
+ memset(p, 42, SIZE);
+
+ if (p[SIZE - 1] != 42)
+ fprintf(stderr, "MEMSET FAILED: %s:%d\n", __FILE__, __LINE__);
+
+ free(p);
+}
+
+void recursive_stack(int i)
+{
+ char buf[1024];
+ if (i > 0)
+ recursive_stack(i - 1);
+}
+
+void testfunc_deepstack(void)
+{
+ char buf[1024];
+ recursive_stack(7 * 1024);
+}