2 * Copyright (C) 2001 Jason Evans <jasone@freebsd.org>.
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
8 * 1. Redistributions of source code must retain the above copyright
9 * notice(s), this list of conditions and the following disclaimer
10 * unmodified other than the allowable addition of one or more
12 * 2. Redistributions in binary form must reproduce the above copyright
13 * notice(s), this list of conditions and the following disclaimer in
14 * the documentation and/or other materials provided with the
17 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDER(S) ``AS IS'' AND ANY
18 * EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
19 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
20 * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER(S) BE
21 * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
22 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
23 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR
24 * BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
25 * WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE
26 * OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE,
27 * EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
31 * Test thread stack guard functionality.
42 #define FRAME_SIZE 1024
43 #define FRAME_OVERHEAD 40
47 void *top; /* Top of thread's initial stack frame. */
48 int cur; /* Recursion depth. */
49 int max; /* Maximum recursion depth. */
56 struct args *parms = (struct args *)args;
57 char filler[FRAME_SIZE - FRAME_OVERHEAD];
59 /* Touch the memory in this stack frame. */
61 memset(filler, 0xa5, sizeof(filler));
63 if (parms->top == NULL) {
64 /* Initial stack frame. */
65 parms->top = (void*)⊤
69 * Make sure frame size is what we expect. Getting this right involves
70 * hand tweaking, so just print a warning rather than aborting.
72 if (parms->top - (void *)&top != FRAME_SIZE * parms->cur) {
74 "Stack size (%ld) != expected (%ld), frame %ld\n",
75 (long)parms->top - (long)&top,
76 (long)(FRAME_SIZE * parms->cur), (long)parms->cur);
80 if (parms->cur < parms->max)
88 main(int argc, char **argv)
90 size_t def_stacksize, def_guardsize;
91 size_t stacksize, guardsize;
97 fprintf(stderr, "usage: guard_b <stacksize> <guardsize>\n");
100 fprintf(stderr, "Test begin\n");
102 stacksize = strtoul(argv[1], NULL, 10);
103 guardsize = strtoul(argv[2], NULL, 10);
105 assert(pthread_attr_init(&attr) == 0);
107 * Exercise the attribute APIs more thoroughly than is strictly
108 * necessary for the meat of this test program.
110 assert(pthread_attr_getstacksize(&attr, &def_stacksize) == 0);
111 assert(pthread_attr_getguardsize(&attr, &def_guardsize) == 0);
112 if (def_stacksize != stacksize) {
113 assert(pthread_attr_setstacksize(&attr, stacksize) == 0);
114 assert(pthread_attr_getstacksize(&attr, &def_stacksize) == 0);
115 assert(def_stacksize == stacksize);
117 if (def_guardsize != guardsize) {
118 assert(pthread_attr_setguardsize(&attr, guardsize) == 0);
119 assert(pthread_attr_getguardsize(&attr, &def_guardsize) == 0);
120 assert(def_guardsize >= guardsize);
124 * Create a thread that will come just short of overflowing the thread
125 * stack. We need to leave a bit of breathing room in case the thread
126 * is context switched, and we also have to take care not to call any
127 * functions in the deepest stack frame.
131 args.max = (stacksize / FRAME_SIZE) - 1;
132 fprintf(stderr, "No overflow:\n");
133 assert(pthread_create(&thread, &attr, recurse, &args) == 0);
134 assert(pthread_join(thread, NULL) == 0);
137 * Create a thread that will barely of overflow the thread stack. This
138 * should cause a segfault.
142 args.max = (stacksize / FRAME_SIZE) + 1;
143 fprintf(stderr, "Overflow:\n");
144 assert(pthread_create(&thread, &attr, recurse, &args) == 0);
145 assert(pthread_join(thread, NULL) == 0);
148 fprintf(stderr, "Unexpected success\n");