Personal tools
You are here: Home Projects C++ Cfront releases Release 3.0.3 source demo task triv.C
Document Actions


by Michael L Powell last modified 2007-01-26 03:20

Click here to get the file

Size 2.6 kB - File type text/plain

File contents

/*ident	"@(#)cls4:demo/task/triv.C	1.1" */
C++ source for the C++ Language System, Release 3.0.  This product
is a new release of the original cfront developed in the computer
science research center of AT&T Bell Laboratories.

Copyright (c) 1991 AT&T and UNIX System Laboratories, Inc.
Copyright (c) 1984, 1989, 1990 AT&T.  All Rights Reserved.

Laboratories, Inc.  The copyright notice above does not evidence
any actual or intended publication of such source code.

#include <task.h>

/* trivial task example:
        Make a set of tasks which pass an object round between themselves.
	Each task gets an object from the head of one queue, and puts
	the object on the tail of another queue.
	Main creates each task, then puts the object on a queue.
	Each task quits after getting the object MAX_CYCLES times.

const int NTASKS = 1;
const int MAX_CYCLES = 5;

struct pc : task {				// derive a class from task
        pc(char*, qtail*, qhead*);		// task is not intended to
};						// be used directly

pc::pc(char* n, qtail* t, qhead* h) :task(n)	// task body serves as
{						// "main" program for task
        printf("new pc(%s)\n",n);

        for (int i = 0; i < MAX_CYCLES; i++) {
                object* p = h->get();
                printf("task %s\n",n);
	printf("task %s: done.\n", n);
	resultis(0);		// Always end task constructors with resultis.
				// Behavior of those using return or running
				// off the end of the function is undefined.
				// Alternatively, use an infinite loop in
				// constructor body.

        qhead* hh = new qhead;
        qtail* t = hh->tail();		// hh and t refer to same queue.
        qhead* h;


        for (int i=0; i<NTASKS; i++) {
                char* n = new char[2];	// make a one letter task name
                n[0] = 'a'+i;
                n[1] = 0;

                h = new qhead;
                new pc(n,t,h);		// create a new task and start execution
                printf("main()'s loop\n");
                t = h->tail();

        new pc("first pc",t,hh);	// create another new task
        printf("main: here we go\n");
        t->put(new object);		// put the object on a queue
        printf("main: exit\n");
	thistask->resultis(0);		// main is a task too; it must also
					// end with resultis (to allow any
					// remaining tasks to run, otherwise
					// the whole process would exit).

« June 2018 »
Su Mo Tu We Th Fr Sa
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

Powered by Plone CMS, the Open Source Content Management System

This site conforms to the following standards: