This testcase is one of the simple CMA syscalls (process_vm_readv,
process_vm_writev) tests originally written by Chris Yeoh
<[email protected]>. I made some modifications to make it match the code
style in LTP.
Test Assertion and Strategy:
Fork two children, the first one allocates a chunk of memory and the
other one call process_vm_writev to write known data into the first
child. Then first child verifies that the data is as expected.
Signed-off-by: Caspar Zhang <[email protected]>
---
.../kernel/syscalls/cma/process_vm_writev02.c | 202 ++++++++++++++++++++
1 files changed, 202 insertions(+), 0 deletions(-)
create mode 100644 testcases/kernel/syscalls/cma/process_vm_writev02.c
diff --git a/testcases/kernel/syscalls/cma/process_vm_writev02.c b/testcases/kernel/syscalls/cma/process_vm_writev02.c
new file mode 100644
index 0000000..cfcb481
--- /dev/null
+++ b/testcases/kernel/syscalls/cma/process_vm_writev02.c
@@ -0,0 +1,202 @@
+/*
+ * Copyright (c) International Business Machines Corp., 2012
+ * Copyright (c) Linux Test Project, 2012
+ *
+ * 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 2 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, write to the Free Software
+ * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
+ */
+
+#define _GNU_SOURCE
+#include <sys/types.h>
+#include <sys/uio.h>
+#include <sys/wait.h>
+#include <errno.h>
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+#include <unistd.h>
+
+#include "test.h"
+#include "usctest.h"
+#include "safe_macros.h"
+#include "process_vm.h"
+
+char *TCID = "process_vm_writev02";
+int TST_TOTAL = 1;
+
+#define PADDING_SIZE 10
+#define DEFAULT_CHAR 53
+
+static int sflag;
+static char *sz_opt;
+static option_t options[] = {
+ { "s:", &sflag, &sz_opt },
+ { NULL, NULL, NULL }
+};
+
+static long bufsz;
+static int pipe_fd[2];
+static pid_t pids[2];
+
+static void child_init_and_verify(void);
+static void child_write(void);
+static void setup(void);
+static void cleanup(void);
+static void help(void);
+
+int main(int argc, char **argv)
+{
+ int lc, status;
+ char *msg;
+
+ msg = parse_opts(argc, argv, options, &help);
+ if (msg != NULL)
+ tst_brkm(TBROK, tst_exit, "OPTION PARSING ERROR - %s", msg);
+
+ setup();
+ for (lc = 0; TEST_LOOPING(lc); lc++) {
+ Tst_count = 0;
+
+ if (pipe(pipe_fd) < 0)
+ tst_brkm(TBROK|TERRNO, cleanup, "pipe");
+
+ pids[0] = fork();
+ switch (pids[0]) {
+ case -1:
+ tst_brkm(TBROK|TERRNO, cleanup, "fork #0");
+ case 0:
+ child_init_and_verify();
+ exit(0);
+ default:
+ break;
+ }
+
+ pids[1] = fork();
+ switch (pids[1]) {
+ case -1:
+ tst_brkm(TBROK|TERRNO, cleanup, "fork #1");
+ case 0:
+ child_write();
+ exit(0);
+ default:
+ break;
+ }
+ while (waitpid(-1, &status, 0) > 0)
+ if (!WIFEXITED(status) || WEXITSTATUS(status) != 0)
+ tst_resm(TFAIL, "child 1 returns %d", status);
+ }
+
+ cleanup();
+ tst_exit();
+}
+
+static void child_init_and_verify(void)
+{
+ unsigned char *foo;
+ char buf[bufsz];
+ long i, nr_err;
+
+ foo = SAFE_MALLOC(tst_exit, bufsz);
+ for (i = 0; i < bufsz; i++)
+ foo[i] = DEFAULT_CHAR;
+ tst_resm(TINFO, "child 0: memory allocated.");
+
+ /* passing addr of string "foo" via pipe */
+ SAFE_CLOSE(tst_exit, pipe_fd[0]);
+ snprintf(buf, bufsz, "%p", foo);
+ SAFE_WRITE(tst_exit, 1, pipe_fd[1], buf, strlen(buf));
+ SAFE_CLOSE(tst_exit, pipe_fd[1]);
+
+ if (raise(SIGSTOP) < 0)
+ tst_brkm(TBROK|TERRNO, tst_exit, "raise");
+
+ nr_err = 0;
+ for (i = 0; i < bufsz; i++) {
+ if (foo[i] != i % 256) {
+#if DEBUG
+ tst_brkm(TFAIL, tst_exit, "child 0: expected string: "
+ "%s, received string: %s",
+ tst_string, lp);
+#endif
+ nr_err++;
+ }
+ }
+ if (nr_err)
+ tst_brkm(TFAIL, tst_exit, "child 0: got %ld incorrect bytes.",
+ nr_err);
+ else
+ tst_resm(TPASS, "child 0: all bytes are expected.");
+}
+
+static void child_write(void)
+{
+ unsigned char *lp, *rp;
+ char buf[bufsz];
+ struct iovec local, remote;
+ long i;
+
+ /* get addr from pipe */
+ SAFE_CLOSE(tst_exit, pipe_fd[1]);
+ SAFE_READ(tst_exit, 0, pipe_fd[0], buf, bufsz);
+ SAFE_CLOSE(tst_exit, pipe_fd[0]);
+ if (sscanf(buf, "%p", &rp) != 1)
+ tst_brkm(TBROK|TERRNO, tst_exit, "sscanf");
+
+ lp = SAFE_MALLOC(tst_exit, bufsz + PADDING_SIZE * 2);
+
+ for (i = 0; i < bufsz + PADDING_SIZE * 2; i++)
+ lp[i] = DEFAULT_CHAR;
+ for (i = 0; i < bufsz; i++)
+ lp[i+PADDING_SIZE] = i % 256;
+
+ local.iov_base = lp + PADDING_SIZE;
+ local.iov_len = bufsz;
+ remote.iov_base = rp;
+ remote.iov_len = bufsz;
+
+ tst_resm(TINFO, "child 2: write to the same memory location.");
+ TEST(test_process_vm_writev(pids[0], &local, 1, &remote, 1, 0));
+ if (TEST_RETURN != bufsz)
+ tst_brkm(TBROK|TERRNO, tst_exit, "process_vm_readv");
+
+ if (kill(pids[0], SIGCONT) == -1)
+ tst_brkm(TBROK|TERRNO, tst_exit, "kill");
+
+ exit(0);
+}
+
+static void setup(void)
+{
+ tst_require_root(NULL);
+
+ bufsz = sflag ? SAFE_STRTOL(NULL, sz_opt, 1, LONG_MAX-PADDING_SIZE*2)
+ : 100000;
+
+#if !defined(__NR_process_vm_readv)
+ tst_brkm(TCONF, NULL, "process_vm_writev does not exist "
+ "on your system");
+#endif
+
+ TEST_PAUSE;
+}
+
+static void cleanup(void)
+{
+ TEST_CLEANUP;
+}
+
+static void help(void)
+{
+ printf(" -s NUM Set the size of total buffer size.\n");
+}
------------------------------------------------------------------------------
Live Security Virtual Conference
Exclusive live event will cover all the ways today's security and
threat landscape has changed and how IT managers can respond. Discussions
will include endpoint security, mobile security and the latest in malware
threats. http://www.accelacomm.com/jaw/sfrnl04242012/114/50122263/
_______________________________________________
Ltp-list mailing list
[email protected]
https://lists.sourceforge.net/lists/listinfo/ltp-list
