sl@0
|
1 |
/*
|
sl@0
|
2 |
* Copyright (c) 1997-2009 Nokia Corporation and/or its subsidiary(-ies).
|
sl@0
|
3 |
* All rights reserved.
|
sl@0
|
4 |
* This component and the accompanying materials are made available
|
sl@0
|
5 |
* under the terms of "Eclipse Public License v1.0"
|
sl@0
|
6 |
* which accompanies this distribution, and is available
|
sl@0
|
7 |
* at the URL "http://www.eclipse.org/legal/epl-v10.html".
|
sl@0
|
8 |
*
|
sl@0
|
9 |
* Initial Contributors:
|
sl@0
|
10 |
* Nokia Corporation - initial contribution.
|
sl@0
|
11 |
*
|
sl@0
|
12 |
* Contributors:
|
sl@0
|
13 |
*
|
sl@0
|
14 |
* Description:
|
sl@0
|
15 |
* A variant of "Hello World" which reports various bits of its environment
|
sl@0
|
16 |
* and returns an interesting exit status
|
sl@0
|
17 |
*
|
sl@0
|
18 |
*
|
sl@0
|
19 |
*/
|
sl@0
|
20 |
|
sl@0
|
21 |
|
sl@0
|
22 |
|
sl@0
|
23 |
#include <stdio.h>
|
sl@0
|
24 |
#include <stdlib.h>
|
sl@0
|
25 |
#include <unistd.h>
|
sl@0
|
26 |
#include <string.h>
|
sl@0
|
27 |
#include <sys/wait.h>
|
sl@0
|
28 |
#include "CTEST.H"
|
sl@0
|
29 |
|
sl@0
|
30 |
#ifdef __WINS__
|
sl@0
|
31 |
int triangle_recurse(char* prog, char* num, int progress)
|
sl@0
|
32 |
{
|
sl@0
|
33 |
printf("\nBut not under WINS where I'll be told 0\n");
|
sl@0
|
34 |
return 0;
|
sl@0
|
35 |
}
|
sl@0
|
36 |
|
sl@0
|
37 |
int triangle_parallel(char* prog, char* num)
|
sl@0
|
38 |
{
|
sl@0
|
39 |
printf("\nBut not under WINS where I'll be told 0\n");
|
sl@0
|
40 |
return 0;
|
sl@0
|
41 |
}
|
sl@0
|
42 |
|
sl@0
|
43 |
#else
|
sl@0
|
44 |
|
sl@0
|
45 |
int triangle_recurse(char* prog, char* num, int progress)
|
sl@0
|
46 |
{
|
sl@0
|
47 |
int n;
|
sl@0
|
48 |
int pid, ret;
|
sl@0
|
49 |
char cmd[100];
|
sl@0
|
50 |
int fids[3];
|
sl@0
|
51 |
|
sl@0
|
52 |
n = atol(num);
|
sl@0
|
53 |
if (n<1)
|
sl@0
|
54 |
return 0;
|
sl@0
|
55 |
|
sl@0
|
56 |
sprintf(cmd, "%s do_triangle %d", prog, n-1);
|
sl@0
|
57 |
if (progress)
|
sl@0
|
58 |
{
|
sl@0
|
59 |
pid=popen3(cmd, "", 0, fids);
|
sl@0
|
60 |
if (pid<0)
|
sl@0
|
61 |
{
|
sl@0
|
62 |
fprintf(stderr, "Executing %s, ", cmd);
|
sl@0
|
63 |
perror("popen3 failed");
|
sl@0
|
64 |
return -1999999;
|
sl@0
|
65 |
}
|
sl@0
|
66 |
while (1)
|
sl@0
|
67 |
{
|
sl@0
|
68 |
int n=waitpid(pid, &ret, WNOHANG);
|
sl@0
|
69 |
if (n==pid)
|
sl@0
|
70 |
break;
|
sl@0
|
71 |
printf(".");
|
sl@0
|
72 |
fflush(stdout);
|
sl@0
|
73 |
sleep(1);
|
sl@0
|
74 |
}
|
sl@0
|
75 |
}
|
sl@0
|
76 |
else
|
sl@0
|
77 |
ret=system(cmd);
|
sl@0
|
78 |
return n+ret;
|
sl@0
|
79 |
}
|
sl@0
|
80 |
|
sl@0
|
81 |
int triangle_parallel(char* prog, char* num)
|
sl@0
|
82 |
{
|
sl@0
|
83 |
int n;
|
sl@0
|
84 |
int pid, pid1, pid2, ret1, ret2, base, split;
|
sl@0
|
85 |
char cmd[100];
|
sl@0
|
86 |
int fids1[3], fids2[3];
|
sl@0
|
87 |
char* basep;
|
sl@0
|
88 |
|
sl@0
|
89 |
n = atol(num);
|
sl@0
|
90 |
if (n<1)
|
sl@0
|
91 |
return 0;
|
sl@0
|
92 |
basep=getenv("TRIANGLE_BASE");
|
sl@0
|
93 |
if (basep==0)
|
sl@0
|
94 |
return 0;
|
sl@0
|
95 |
base=atol(basep);
|
sl@0
|
96 |
|
sl@0
|
97 |
/* we have to add up the numbers base..n inclusive
|
sl@0
|
98 |
*/
|
sl@0
|
99 |
if (base==n)
|
sl@0
|
100 |
return n;
|
sl@0
|
101 |
if (base+1==n)
|
sl@0
|
102 |
return base+n;
|
sl@0
|
103 |
|
sl@0
|
104 |
/* At least 3 numbers, so split it into subtasks for child processes
|
sl@0
|
105 |
*/
|
sl@0
|
106 |
split = (n-base)/2;
|
sl@0
|
107 |
|
sl@0
|
108 |
sprintf(cmd, "%s do_trianglep %d", prog, base+split);
|
sl@0
|
109 |
pid1=popen3(cmd, "", 0, fids1);
|
sl@0
|
110 |
if (pid1<0)
|
sl@0
|
111 |
{
|
sl@0
|
112 |
fprintf(stderr, "Doing %d..%d of %d..%d", base+split, base, n, base);
|
sl@0
|
113 |
perror("popen3 failed");
|
sl@0
|
114 |
return -1999999;
|
sl@0
|
115 |
}
|
sl@0
|
116 |
|
sl@0
|
117 |
sprintf(cmd, "%d", base+split+1);
|
sl@0
|
118 |
setenv("TRIANGLE_BASE", cmd, 1);
|
sl@0
|
119 |
|
sl@0
|
120 |
sprintf(cmd, "%s do_trianglep %d", prog, n);
|
sl@0
|
121 |
pid2=popen3(cmd, "", 0, fids2);
|
sl@0
|
122 |
if (pid2<0)
|
sl@0
|
123 |
{
|
sl@0
|
124 |
fprintf(stderr, "Doing %d..%d of %d..%d", n, base+split+1, n, base);
|
sl@0
|
125 |
perror("popen3 failed");
|
sl@0
|
126 |
return -1999999;
|
sl@0
|
127 |
}
|
sl@0
|
128 |
|
sl@0
|
129 |
/* Now collect the results */
|
sl@0
|
130 |
ret1=-10000;
|
sl@0
|
131 |
ret2=-10000;
|
sl@0
|
132 |
for (n=0; n<2; n++)
|
sl@0
|
133 |
{
|
sl@0
|
134 |
int ret=-3999999;
|
sl@0
|
135 |
pid=wait(&ret);
|
sl@0
|
136 |
if (pid<0)
|
sl@0
|
137 |
{
|
sl@0
|
138 |
perror("waitpid failed");
|
sl@0
|
139 |
return -2999999;
|
sl@0
|
140 |
}
|
sl@0
|
141 |
if (pid==pid1)
|
sl@0
|
142 |
{
|
sl@0
|
143 |
pid1=-1;
|
sl@0
|
144 |
ret1=ret;
|
sl@0
|
145 |
}
|
sl@0
|
146 |
else if (pid==pid2)
|
sl@0
|
147 |
{
|
sl@0
|
148 |
pid2=-1;
|
sl@0
|
149 |
ret2=ret;
|
sl@0
|
150 |
}
|
sl@0
|
151 |
else
|
sl@0
|
152 |
printf("Unexpected pid %d (not %d or %d)\n", pid, pid1, pid2);
|
sl@0
|
153 |
}
|
sl@0
|
154 |
return ret1+ret2;
|
sl@0
|
155 |
}
|
sl@0
|
156 |
|
sl@0
|
157 |
#endif
|
sl@0
|
158 |
|
sl@0
|
159 |
/**
|
sl@0
|
160 |
Usage: THELLOU [triangle[p] <n>]
|
sl@0
|
161 |
|
sl@0
|
162 |
@SYMTestCaseID SYSLIB-STDLIB-CT-1058
|
sl@0
|
163 |
@SYMTestCaseDesc Tests for printing to standard output stream
|
sl@0
|
164 |
@SYMTestPriority High
|
sl@0
|
165 |
@SYMTestActions Prints some stuff (looks at args, getenv("USER"), cwd) to stdout and stderr.
|
sl@0
|
166 |
Will compute triangle numbers by calling itself recursively, or parallel subdivison
|
sl@0
|
167 |
@SYMTestExpectedResults Test must not fail
|
sl@0
|
168 |
@SYMREQ REQ0000
|
sl@0
|
169 |
*/
|
sl@0
|
170 |
int main (int argc, char *argv[])
|
sl@0
|
171 |
{
|
sl@0
|
172 |
char *user=getenv("USER");
|
sl@0
|
173 |
char cwd[MAXPATHLEN];
|
sl@0
|
174 |
int ret=3, i;
|
sl@0
|
175 |
|
sl@0
|
176 |
start_redirection_server();
|
sl@0
|
177 |
|
sl@0
|
178 |
if (argc==3 && strcmp(argv[1],"do_triangle")==0)
|
sl@0
|
179 |
return triangle_recurse(argv[0], argv[2], 0);
|
sl@0
|
180 |
|
sl@0
|
181 |
if (argc==3 && strcmp(argv[1],"do_trianglep")==0)
|
sl@0
|
182 |
return triangle_parallel(argv[0], argv[2]);
|
sl@0
|
183 |
|
sl@0
|
184 |
if (user)
|
sl@0
|
185 |
{
|
sl@0
|
186 |
printf("Hello %s\n", user);
|
sl@0
|
187 |
ret=4;
|
sl@0
|
188 |
}
|
sl@0
|
189 |
else
|
sl@0
|
190 |
printf("Greetings.\n");
|
sl@0
|
191 |
|
sl@0
|
192 |
printf("I am process %d\n", getpid());
|
sl@0
|
193 |
|
sl@0
|
194 |
if (getcwd(cwd,sizeof(cwd))!=0)
|
sl@0
|
195 |
printf("I am speaking to you from %s\n", cwd);
|
sl@0
|
196 |
|
sl@0
|
197 |
printf("I have %d arguments: ", argc);
|
sl@0
|
198 |
for (i=0; i<argc; i++)
|
sl@0
|
199 |
printf(">%s< ", argv[i]);
|
sl@0
|
200 |
printf("\r\n");
|
sl@0
|
201 |
|
sl@0
|
202 |
printf("In a few moments I shall say %c to stderr:\n", 'a'+argc);
|
sl@0
|
203 |
fflush(stdout);
|
sl@0
|
204 |
|
sl@0
|
205 |
fprintf(stderr, "%c\n", 'a'+argc);
|
sl@0
|
206 |
fflush(stderr);
|
sl@0
|
207 |
|
sl@0
|
208 |
if (argc==3 && strcmp(argv[1],"triangle")==0)
|
sl@0
|
209 |
{
|
sl@0
|
210 |
printf("For my next trick I shall compute the triangle of %s: ", argv[2]);
|
sl@0
|
211 |
fflush(stdout);
|
sl@0
|
212 |
ret=triangle_recurse(argv[0], argv[2], 1);
|
sl@0
|
213 |
printf("it's %d\n", ret);
|
sl@0
|
214 |
}
|
sl@0
|
215 |
|
sl@0
|
216 |
if (argc==3 && strcmp(argv[1],"trianglep")==0)
|
sl@0
|
217 |
{
|
sl@0
|
218 |
printf("I shall now compute the triangle of %s using a parallel algorithm: ", argv[2]);
|
sl@0
|
219 |
fflush(stdout);
|
sl@0
|
220 |
setenv("TRIANGLE_BASE", "1", 0);
|
sl@0
|
221 |
ret=triangle_parallel(argv[0], argv[2]);
|
sl@0
|
222 |
printf("it's %d\n", ret);
|
sl@0
|
223 |
}
|
sl@0
|
224 |
|
sl@0
|
225 |
printf("Farewell...\nPress a key");
|
sl@0
|
226 |
getchar();
|
sl@0
|
227 |
return ret;
|
sl@0
|
228 |
}
|