gmgauthier/tk5-c90-projects
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

remove junk test files
Some checks failed
MVS Delete Members / delete-members (push) Successful in 1m45s
Details
MVS Submit & Execute / upload-and-run (push) Failing after 14s
Details

Browse Source
This commit is contained in:
Greg Gauthier 2026-02-06 18:35:27 +00:00
parent 6ad26f6344
commit 0b76e0be9a
18 changed files with 0 additions and 420 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

11
jcl/GCCHELLO.jcl
View File

@ -1,11 +0,0 @@
//GMG0002 JOB (GCC),'C Program Example',
// NOTIFY=@05054,
// CLASS=A,MSGCLASS=H,
// MSGLEVEL=(1,1),
// REGION=4M,TIME=1440
//*
//STEP1 EXEC GCCCG,INFILE='@05054.SRCLIB.C(HELLO)'
//*****************************************************
//* COMPILE.SYSIN ONLY NEEDED IF INFILE ABOVE DOES NOT EXIST
//*****************************************************
//*OMPILE.SYSIN DD DSN=GMGAUTH.SRCLIB(HELLO),DISP=(SHR)

5
jcl/SIEVE03.jcl
View File

@ -1,5 +0,0 @@
//SIEVE03 JOB (GCC),'C Program Example',
// NOTIFY=@05054,CLASS=A,MSGCLASS=H,
// MSGLEVEL=(1,1),REGION=4M,TIME=1440
//STEP1 EXEC GCCCG,INFILE='@05054.SRCLIB.C(SIEVE03)'
//

5
jcl/SIEVE04.jcl
View File

@ -1,5 +0,0 @@
//SIEVE03 JOB (GCC),'C Program Example',
// NOTIFY=@05054,CLASS=A,MSGCLASS=H,
// MSGLEVEL=(1,1),REGION=4M,TIME=1440
//STEP1 EXEC GCCCG,INFILE='@05054.SRCLIB.C(SIEVE04)'
//

6
jcl/SIEVE05.jcl
View File

@ -1,6 +0,0 @@
//SIEVE05 JOB (GCC),'Sieve 5 Example',
// NOTIFY=@05054,CLASS=A,MSGCLASS=H,
// MSGLEVEL=(1,1),REGION=4M,TIME=1440
//* Compile Step
//STEP1 EXEC GCCCG,INFILE='@05054.SRCLIB.C(SIEVE05)'
//

6
jcl/SIEVE07.jcl
View File

@ -1,6 +0,0 @@
//SIEVE07 JOB (GCC),'Sieve 7 Example',
// NOTIFY=@05054,CLASS=A,MSGCLASS=H,
// MSGLEVEL=(1,1),REGION=4M,TIME=1440
//* Compile Step
//STEP1 EXEC GCCCG,INFILE='@05054.SRCLIB.C(SIEVE07)'
//

6
jcl/SIEVE08.jcl
View File

@ -1,6 +0,0 @@
//SIEVE08 JOB (GCC),'Sieve 8 Example',
// NOTIFY=@05054,CLASS=A,MSGCLASS=H,
// MSGLEVEL=(1,1),REGION=4M,TIME=1440
//* Compile Step
//STEP1 EXEC GCCCG,INFILE='@05054.SRCLIB.C(SIEVE08)'
//

6
jcl/SIEVE09.jcl
View File

@ -1,6 +0,0 @@
//SIEVE09 JOB (GCC),'Sieve 9 Example',
// NOTIFY=@05054,CLASS=A,MSGCLASS=H,
// MSGLEVEL=(1,1),REGION=4M,TIME=1440
//* Compile Step
//STEP1 EXEC GCCCG,INFILE='@05054.SRCLIB.C(SIEVE09)'
//

7
jcl/SIMPLE.jcl
View File

@ -1,7 +0,0 @@
//SIMPLE JOB (GCC),'Simple Hello Example',
// NOTIFY=@05054,CLASS=A,MSGCLASS=A,
// MSGLEVEL=(1,1),REGION=4M,TIME=1440
//* Compile Step - comments allowed in JCL!
//STEP1 EXEC GCCCG,INFILE='@05054.SRCLIB.C(SIMPLE)'
//

6
jcl/SIMPLE2.jcl
View File

@ -1,6 +0,0 @@
//SIMPLE2 JOB (GCC),'Simple Hello Example',
// NOTIFY=@05054,CLASS=A,MSGCLASS=A,
// MSGLEVEL=(1,1),REGION=4M,TIME=1440
//* Compile Step - comments allowed in JCL!
//STEP1 EXEC GCCCG,INFILE='@05054.SRCLIB.C(SIMPLE2)'
//

49
src/SIEVE01.c
View File

@ -1,49 +0,0 @@
#include<stdio.h>
#define LIMIT 10000
#define PRIMES 1000
// Sieve of Eratosthenes
// Author: Greg Gauthier
// Date: 2016-01-20
int main()
{
int i,j,numbers[LIMIT];
int primes[PRIMES];
for (i=0;i<LIMIT;i++)
{
numbers[i]=i+2;
}
for (i=0;i<LIMIT;i++)
{
if (numbers[i]!=-1)
{
for (j=2*numbers[i]-2;j<LIMIT;j+=numbers[i])
numbers[j]=-1;
}
}
j = 0;
for (i=0;i<LIMIT&&j<PRIMES;i++)
if (numbers[i]!=-1)
primes[j++] = numbers[i];
printf("\n");
printf("PRIME NUMBERS BETWEEN 1 AND %d\n",LIMIT);
printf("TOTAL PRIMES FOUND: %d\n\n",PRIMES);
printf("LIST OF PRIMES:\n\n");
for (i=0;i<PRIMES;i++)
if (i % 20 == 0)
{
printf("\n %4d ",primes[i]);
}
else
{
printf("%4d ",primes[i]);
}
return 0;
}

53
src/SIEVE03.c
View File

@ -1,53 +0,0 @@
#include<stdio.h>
#define LIMIT 10000
#define PRIMES 1000
/* Sieve of Eratosthenes
* Author: Greg Gauthier
* Date: 2016-01-20
* NOTE: cannot use single-line comments in these C files because
* of the fact that the MVS SYSIN is interpreting them as
* JCL operands.
*/
int main()
{
int i,j,numbers[LIMIT];
int primes[PRIMES];
for (i=0;i<LIMIT;i++)
{
numbers[i]=i+2;
}
for (i=0;i<LIMIT;i++)
{
if (numbers[i]!=-1)
{
for (j=2*numbers[i]-2;j<LIMIT;j+=numbers[i])
numbers[j]=-1;
}
}
j = 0;
for (i=0;i<LIMIT&&j<PRIMES;i++)
if (numbers[i]!=-1)
primes[j++] = numbers[i];
printf("\n");
printf("PRIME NUMBERS BETWEEN 1 AND %d\n",LIMIT);
printf("TOTAL PRIMES FOUND: %d\n\n",PRIMES);
printf("LIST OF PRIMES:\n\n");
for (i=0;i<PRIMES;i++)
if (i % 20 == 0)
{
printf("\n %4d ",primes[i]);
}
else
{
printf("%4d ",primes[i]);
}
return 0;
}

46
src/SIEVE04.c
View File

@ -1,46 +0,0 @@
#include<stdio.h>
#define LIMIT 10000
#define PRIMES 1000
int main()
{
int i,j,numbers[LIMIT];
int primes[PRIMES];
for (i=0;i<LIMIT;i++)
{
numbers[i]=i+2;
}
for (i=0;i<LIMIT;i++)
{
if (numbers[i]!=-1)
{
for (j=2*numbers[i]-2;j<LIMIT;j+=numbers[i])
numbers[j]=-1;
}
}
j = 0;
for (i=0;i<LIMIT&&j<PRIMES;i++)
if (numbers[i]!=-1)
primes[j++] = numbers[i];
printf("\n");
printf("PRIME NUMBERS BETWEEN 1 AND %d\n",LIMIT);
printf("TOTAL PRIMES FOUND: %d\n\n",PRIMES);
printf("LIST OF PRIMES:\n\n");
for (i=0;i<PRIMES;i++)
if (i % 20 == 0)
{
printf("\n %4d ",primes[i]);
}
else
{
printf("%4d ",primes[i]);
}
return 0;
}

47
src/SIEVE05.c
View File

@ -1,47 +0,0 @@
#include<stdio.h>
#define LIMIT 10000
#define PRIMES 1000
int main()
{
int i,j,numbers[LIMIT];
int primes[PRIMES];
for (i=0;i<LIMIT;i++)
{
numbers[i]=i+2;
}
for (i=0;i<LIMIT;i++)
{
if (numbers[i]!=-1)
{
for (j=2*numbers[i]-2;j<LIMIT;j+=numbers[i])
numbers[j]=-1;
}
}
j = 0;
for (i=0;i<LIMIT&&j<PRIMES;i++)
if (numbers[i]!=-1)
primes[j++] = numbers[i];
printf("\n");
printf("PRIME NUMBERS BETWEEN 1 AND %d\n",LIMIT);
printf("TOTAL PRIMES FOUND: %d\n\n",PRIMES);
printf("LIST OF PRIMES:\n\n");
for (i=0;i<PRIMES;i++)
if (i % 20 == 0)
{
printf("\n %4d ",primes[i]);
}
else
{
printf("%4d ",primes[i]);
}
return 0;
}

47
src/SIEVE07.c
View File

@ -1,47 +0,0 @@
#include<stdio.h>
#define LIMIT 10000
#define PRIMES 1000
int main()
{
int i,j,numbers[LIMIT];
int primes[PRIMES];
for (i=0;i<LIMIT;i++)
{
numbers[i]=i+2;
}
for (i=0;i<LIMIT;i++)
{
if (numbers[i]!=-1)
{
for (j=2*numbers[i]-2;j<LIMIT;j+=numbers[i])
numbers[j]=-1;
}
}
j = 0;
for (i=0;i<LIMIT&&j<PRIMES;i++)
if (numbers[i]!=-1)
primes[j++] = numbers[i];
printf("\n");
printf("PRIME NUMBERS BETWEEN 1 AND %d\n",LIMIT);
printf("TOTAL PRIMES FOUND: %d\n\n",PRIMES);
printf("LIST OF PRIMES:\n\n");
for (i=0;i<PRIMES;i++)
if (i % 20 == 0)
{
printf("\n %4d ",primes[i]);
}
else
{
printf("%4d ",primes[i]);
}
return 0;
}

47
src/SIEVE08.c
View File

@ -1,47 +0,0 @@
#include<stdio.h>
#define LIMIT 10000
#define PRIMES 1000
int main()
{
int i,j,numbers[LIMIT];
int primes[PRIMES];
for (i=0;i<LIMIT;i++)
{
numbers[i]=i+2;
}
for (i=0;i<LIMIT;i++)
{
if (numbers[i]!=-1)
{
for (j=2*numbers[i]-2;j<LIMIT;j+=numbers[i])
numbers[j]=-1;
}
}
j = 0;
for (i=0;i<LIMIT&&j<PRIMES;i++)
if (numbers[i]!=-1)
primes[j++] = numbers[i];
printf("\n");
printf("PRIME NUMBERS BETWEEN 1 AND %d\n",LIMIT);
printf("TOTAL PRIMES FOUND: %d\n\n",PRIMES);
printf("LIST OF PRIMES:\n\n");
for (i=0;i<PRIMES;i++)
if (i % 20 == 0)
{
printf("\n %4d ",primes[i]);
}
else
{
printf("%4d ",primes[i]);
}
return 0;
}

47
src/SIEVE09.c
View File

@ -1,47 +0,0 @@
#include<stdio.h>
#define LIMIT 10000
#define PRIMES 1000
int main()
{
int i,j,numbers[LIMIT];
int primes[PRIMES];
for (i=0;i<LIMIT;i++)
{
numbers[i]=i+2;
}
for (i=0;i<LIMIT;i++)
{
if (numbers[i]!=-1)
{
for (j=2*numbers[i]-2;j<LIMIT;j+=numbers[i])
numbers[j]=-1;
}
}
j = 0;
for (i=0;i<LIMIT&&j<PRIMES;i++)
if (numbers[i]!=-1)
primes[j++] = numbers[i];
printf("\n");
printf("PRIME NUMBERS BETWEEN 1 AND %d\n",LIMIT);
printf("TOTAL PRIMES FOUND: %d\n\n",PRIMES);
printf("LIST OF PRIMES:\n\n");
for (i=0;i<PRIMES;i++)
if (i % 20 == 0)
{
printf("\n %4d ",primes[i]);
}
else
{
printf("%4d ",primes[i]);
}
return 0;
}

13
src/SIMPLE.c
View File

@ -1,13 +0,0 @@
//
// Created by Gregory Gauthier on 06/02/2026.
//
# include <stdio.h>
#ifndef HELLO_STRING
#define HELLO_STRING "Hello, World!"
#endif
int main() {
printf("%s\n", HELLO_STRING);
return 0;
}

13
src/SIMPLE2.c
View File

@ -1,13 +0,0 @@
//
// SIMPLE 2 SAMPLE
//
# include <stdio.h>
#ifndef HELLO_STRING
#define HELLO_STRING "Hello, World!"
#endif
int main() {
printf("%s\n", HELLO_STRING);
return 0;
}