1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
|
/* This testcase is part of GDB, the GNU debugger.
Copyright 2009, 2010 Free Software Foundation, Inc.
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 3 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, see <http://www.gnu.org/licenses/>.
Do not use threads as we need to exploit a bug in LWP code masked by the
threads code otherwise.
INFERIOR_PTID must point to exited LWP. Here we use the initial LWP as it
is automatically INFERIOR_PTID for GDB.
Finally we need to call target_resume (RESUME_ALL, ...) which we invoke by
NEW_THREAD_EVENT (called from the new LWP as initial LWP is exited now). */
#define _GNU_SOURCE
#include <sched.h>
#include <assert.h>
#include <unistd.h>
#include <stdlib.h>
#define STACK_SIZE 0x1000
static int
fn_return (void *unused)
{
return 0; /* at-fn_return */
}
static int
fn (void *unused)
{
int i;
unsigned char *stack;
int new_pid;
i = sleep (1);
assert (i == 0);
stack = malloc (STACK_SIZE);
assert (stack != NULL);
new_pid = clone (fn_return, stack + STACK_SIZE, CLONE_FILES | CLONE_VM, NULL,
NULL, NULL, NULL);
assert (new_pid > 0);
return 0;
}
int
main (int argc, char **argv)
{
unsigned char *stack;
int new_pid;
stack = malloc (STACK_SIZE);
assert (stack != NULL);
new_pid = clone (fn, stack + STACK_SIZE, CLONE_FILES | CLONE_VM, NULL, NULL,
NULL, NULL);
assert (new_pid > 0);
return 0;
}
|
