1*8a272653SPeter Holm /*-
2*8a272653SPeter Holm * Copyright (c) 2008 Peter Holm <pho@FreeBSD.org>
3*8a272653SPeter Holm * All rights reserved.
4*8a272653SPeter Holm *
5*8a272653SPeter Holm * Redistribution and use in source and binary forms, with or without
6*8a272653SPeter Holm * modification, are permitted provided that the following conditions
7*8a272653SPeter Holm * are met:
8*8a272653SPeter Holm * 1. Redistributions of source code must retain the above copyright
9*8a272653SPeter Holm * notice, this list of conditions and the following disclaimer.
10*8a272653SPeter Holm * 2. Redistributions in binary form must reproduce the above copyright
11*8a272653SPeter Holm * notice, this list of conditions and the following disclaimer in the
12*8a272653SPeter Holm * documentation and/or other materials provided with the distribution.
13*8a272653SPeter Holm *
14*8a272653SPeter Holm * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
15*8a272653SPeter Holm * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
16*8a272653SPeter Holm * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
17*8a272653SPeter Holm * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
18*8a272653SPeter Holm * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
19*8a272653SPeter Holm * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
20*8a272653SPeter Holm * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
21*8a272653SPeter Holm * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
22*8a272653SPeter Holm * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
23*8a272653SPeter Holm * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
24*8a272653SPeter Holm * SUCH DAMAGE.
25*8a272653SPeter Holm *
26*8a272653SPeter Holm */
27*8a272653SPeter Holm
28*8a272653SPeter Holm /* Test PTYs */
29*8a272653SPeter Holm
30*8a272653SPeter Holm #include <sys/types.h>
31*8a272653SPeter Holm #include <sys/ioctl.h>
32*8a272653SPeter Holm #include <err.h>
33*8a272653SPeter Holm #include <libutil.h>
34*8a272653SPeter Holm #include <stdio.h>
35*8a272653SPeter Holm #include <stdlib.h>
36*8a272653SPeter Holm #include <termios.h>
37*8a272653SPeter Holm #include <unistd.h>
38*8a272653SPeter Holm
39*8a272653SPeter Holm #include "stress.h"
40*8a272653SPeter Holm
41*8a272653SPeter Holm #define TXT "Hello, world!"
42*8a272653SPeter Holm
43*8a272653SPeter Holm int
setup(int nb __unused)44*8a272653SPeter Holm setup(int nb __unused)
45*8a272653SPeter Holm {
46*8a272653SPeter Holm return (0);
47*8a272653SPeter Holm }
48*8a272653SPeter Holm
49*8a272653SPeter Holm void
cleanup(void)50*8a272653SPeter Holm cleanup(void)
51*8a272653SPeter Holm {
52*8a272653SPeter Holm }
53*8a272653SPeter Holm
54*8a272653SPeter Holm int
test(void)55*8a272653SPeter Holm test(void)
56*8a272653SPeter Holm {
57*8a272653SPeter Holm struct termios tios;
58*8a272653SPeter Holm int i, master, slave;
59*8a272653SPeter Holm int s[32], m[32];
60*8a272653SPeter Holm char buf[512], slname[1025];
61*8a272653SPeter Holm
62*8a272653SPeter Holm for (i = 0; i < 32; i++) {
63*8a272653SPeter Holm if (openpty(&m[i], &s[i], slname, NULL, NULL) == -1)
64*8a272653SPeter Holm err(1, "openpty");
65*8a272653SPeter Holm }
66*8a272653SPeter Holm for (i = 0; i < 32; i++) {
67*8a272653SPeter Holm close(m[i]);
68*8a272653SPeter Holm close(s[i]);
69*8a272653SPeter Holm }
70*8a272653SPeter Holm
71*8a272653SPeter Holm for (i = 0; i < 1024; i++) {
72*8a272653SPeter Holm if (openpty(&m[0], &s[0], slname, NULL, NULL) == -1)
73*8a272653SPeter Holm err(1, "openpty");
74*8a272653SPeter Holm close(m[0]);
75*8a272653SPeter Holm close(s[0]);
76*8a272653SPeter Holm }
77*8a272653SPeter Holm
78*8a272653SPeter Holm for (i = 0; i < 10 && done_testing == 0; i++) {
79*8a272653SPeter Holm if (openpty(&master, &slave, slname, NULL, NULL) == -1)
80*8a272653SPeter Holm err(1, "openpty");
81*8a272653SPeter Holm if ((i & 1) == 0) {
82*8a272653SPeter Holm if (close(master) == -1)
83*8a272653SPeter Holm err(1, "close(master)");
84*8a272653SPeter Holm if (close(slave) == -1)
85*8a272653SPeter Holm err(1, "close(%s)", slname);
86*8a272653SPeter Holm } else {
87*8a272653SPeter Holm if (close(slave) == -1)
88*8a272653SPeter Holm err(1, "close(%s)", slname);
89*8a272653SPeter Holm if (close(master) == -1)
90*8a272653SPeter Holm err(1, "close(master)");
91*8a272653SPeter Holm }
92*8a272653SPeter Holm }
93*8a272653SPeter Holm
94*8a272653SPeter Holm if (openpty(&master, &slave, slname, NULL, NULL) == -1)
95*8a272653SPeter Holm err(1, "openpty");
96*8a272653SPeter Holm if (tcgetattr(slave, &tios) < 0)
97*8a272653SPeter Holm err(1, "tcgetattr(%s)", slname);
98*8a272653SPeter Holm cfmakeraw(&tios);
99*8a272653SPeter Holm if (tcsetattr(slave, TCSAFLUSH, &tios) < 0)
100*8a272653SPeter Holm err(1, "tcsetattr(%s)", slname);
101*8a272653SPeter Holm
102*8a272653SPeter Holm for (i = 0; i < 64 && done_testing == 0; i++) {
103*8a272653SPeter Holm if (write(master, TXT, sizeof(TXT)) == -1)
104*8a272653SPeter Holm err(1, "write");
105*8a272653SPeter Holm if (read(slave, buf, sizeof(TXT)) == -1)
106*8a272653SPeter Holm err(1, "read(%s)", slname);
107*8a272653SPeter Holm }
108*8a272653SPeter Holm close(master);
109*8a272653SPeter Holm close(slave);
110*8a272653SPeter Holm return (0);
111*8a272653SPeter Holm }
112