job.h revision 1.78
11.78Srillig/*	$NetBSD: job.h,v 1.78 2023/12/19 19:33:39 rillig Exp $	*/
21.4Schristos
31.1Scgd/*
41.1Scgd * Copyright (c) 1988, 1989, 1990 The Regents of the University of California.
51.20Sagc * All rights reserved.
61.20Sagc *
71.20Sagc * This code is derived from software contributed to Berkeley by
81.20Sagc * Adam de Boor.
91.20Sagc *
101.20Sagc * Redistribution and use in source and binary forms, with or without
111.20Sagc * modification, are permitted provided that the following conditions
121.20Sagc * are met:
131.20Sagc * 1. Redistributions of source code must retain the above copyright
141.20Sagc *    notice, this list of conditions and the following disclaimer.
151.20Sagc * 2. Redistributions in binary form must reproduce the above copyright
161.20Sagc *    notice, this list of conditions and the following disclaimer in the
171.20Sagc *    documentation and/or other materials provided with the distribution.
181.20Sagc * 3. Neither the name of the University nor the names of its contributors
191.20Sagc *    may be used to endorse or promote products derived from this software
201.20Sagc *    without specific prior written permission.
211.20Sagc *
221.20Sagc * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
231.20Sagc * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
241.20Sagc * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
251.20Sagc * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
261.20Sagc * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
271.20Sagc * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
281.20Sagc * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
291.20Sagc * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
301.20Sagc * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
311.20Sagc * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
321.20Sagc * SUCH DAMAGE.
331.20Sagc *
341.20Sagc *	from: @(#)job.h	8.1 (Berkeley) 6/6/93
351.20Sagc */
361.20Sagc
371.20Sagc/*
381.1Scgd * Copyright (c) 1988, 1989 by Adam de Boor
391.1Scgd * Copyright (c) 1989 by Berkeley Softworks
401.1Scgd * All rights reserved.
411.1Scgd *
421.1Scgd * This code is derived from software contributed to Berkeley by
431.1Scgd * Adam de Boor.
441.1Scgd *
451.1Scgd * Redistribution and use in source and binary forms, with or without
461.1Scgd * modification, are permitted provided that the following conditions
471.1Scgd * are met:
481.1Scgd * 1. Redistributions of source code must retain the above copyright
491.1Scgd *    notice, this list of conditions and the following disclaimer.
501.1Scgd * 2. Redistributions in binary form must reproduce the above copyright
511.1Scgd *    notice, this list of conditions and the following disclaimer in the
521.1Scgd *    documentation and/or other materials provided with the distribution.
531.1Scgd * 3. All advertising materials mentioning features or use of this software
541.1Scgd *    must display the following acknowledgement:
551.1Scgd *	This product includes software developed by the University of
561.1Scgd *	California, Berkeley and its contributors.
571.1Scgd * 4. Neither the name of the University nor the names of its contributors
581.1Scgd *    may be used to endorse or promote products derived from this software
591.1Scgd *    without specific prior written permission.
601.1Scgd *
611.1Scgd * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
621.1Scgd * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
631.1Scgd * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
641.1Scgd * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
651.1Scgd * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
661.1Scgd * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
671.1Scgd * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
681.1Scgd * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
691.1Scgd * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
701.1Scgd * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
711.1Scgd * SUCH DAMAGE.
721.1Scgd *
731.5Schristos *	from: @(#)job.h	8.1 (Berkeley) 6/6/93
741.1Scgd */
751.1Scgd
761.78Srillig/* Run jobs in parallel mode. */
771.52Srillig
781.44Srillig#ifndef MAKE_JOB_H
791.44Srillig#define MAKE_JOB_H
801.1Scgd
811.77Srillig#define TMPPAT	"makeXXXXXX"	/* relative to tmpdir */
821.1Scgd
831.10Ssommerfe#ifdef USE_SELECT
841.1Scgd/*
851.17Sgson * Emulate poll() in terms of select().  This is not a complete
861.17Sgson * emulation but it is sufficient for make's purposes.
871.1Scgd */
881.17Sgson
891.17Sgson#define poll emul_poll
901.17Sgson#define pollfd emul_pollfd
911.17Sgson
921.17Sgsonstruct emul_pollfd {
931.76Srillig	int fd;
941.76Srillig	short events;
951.76Srillig	short revents;
961.17Sgson};
971.17Sgson
981.64Srillig#define POLLIN		0x0001
991.64Srillig#define POLLOUT		0x0004
1001.17Sgson
1011.76Srilligint emul_poll(struct pollfd *, int, int);
1021.17Sgson#endif
1031.17Sgson
1041.10Ssommerfe/*
1051.10Ssommerfe * The POLL_MSEC constant determines the maximum number of milliseconds spent
1061.43Srillig * in poll before coming out to see if a child has finished.
1071.10Ssommerfe */
1081.10Ssommerfe#define POLL_MSEC	5000
1091.1Scgd
1101.9Schristosstruct pollfd;
1111.9Schristos
1121.40Ssjg
1131.40Ssjg#ifdef USE_META
1141.40Ssjg# include "meta.h"
1151.40Ssjg#endif
1161.40Ssjg
1171.62Srilligtypedef enum JobStatus {
1181.70Srillig	JOB_ST_FREE	= 0,	/* Job is available */
1191.70Srillig	JOB_ST_SET_UP	= 1,	/* Job is allocated but otherwise invalid */
1201.70Srillig	/* XXX: What about the 2? */
1211.70Srillig	JOB_ST_RUNNING	= 3,	/* Job is running, pid valid */
1221.70Srillig	JOB_ST_FINISHED	= 4	/* Job is done (ie after SIGCHILD) */
1231.62Srillig} JobStatus;
1241.57Srillig
1251.71Srillig/*
1261.71Srillig * A Job manages the shell commands that are run to create a single target.
1271.52Srillig * Each job is run in a separate subprocess by a shell.  Several jobs can run
1281.52Srillig * in parallel.
1291.52Srillig *
1301.52Srillig * The shell commands for the target are written to a temporary file,
1311.52Srillig * then the shell is run with the temporary file as stdin, and the output
1321.52Srillig * of that shell is captured via a pipe.
1331.52Srillig *
1341.52Srillig * When a job is finished, Make_Update updates all parents of the node
1351.52Srillig * that was just remade, marking them as ready to be made next if all
1361.71Srillig * other dependencies are finished as well.
1371.71Srillig */
1381.1Scgdtypedef struct Job {
1391.70Srillig	/* The process ID of the shell running the commands */
1401.70Srillig	int pid;
1411.52Srillig
1421.70Srillig	/* The target the child is making */
1431.70Srillig	GNode *node;
1441.52Srillig
1451.77Srillig	/*
1461.77Srillig	 * If one of the shell commands is "...", all following commands are
1471.77Srillig	 * delayed until the .END node is made.  This list node points to the
1481.77Srillig	 * first of these commands, if any.
1491.77Srillig	 */
1501.70Srillig	StringListNode *tailCmds;
1511.52Srillig
1521.70Srillig	/* This is where the shell commands go. */
1531.70Srillig	FILE *cmdFILE;
1541.52Srillig
1551.70Srillig	int exit_status;	/* from wait4() in signal handler */
1561.52Srillig
1571.70Srillig	JobStatus status;
1581.52Srillig
1591.73Srillig	bool suspended;
1601.52Srillig
1611.70Srillig	/* Ignore non-zero exits */
1621.73Srillig	bool ignerr;
1631.70Srillig	/* Output the command before or instead of running it. */
1641.73Srillig	bool echo;
1651.70Srillig	/* Target is a special one. */
1661.73Srillig	bool special;
1671.15Ssjg
1681.70Srillig	int inPipe;		/* Pipe for reading output from job */
1691.70Srillig	int outPipe;		/* Pipe for writing control commands */
1701.70Srillig	struct pollfd *inPollfd; /* pollfd associated with inPipe */
1711.52Srillig
1721.52Srillig#define JOB_BUFSIZE	1024
1731.70Srillig	/* Buffer for storing the output of the job, line by line. */
1741.70Srillig	char outBuf[JOB_BUFSIZE + 1];
1751.70Srillig	size_t curPos;		/* Current position in outBuf. */
1761.40Ssjg
1771.40Ssjg#ifdef USE_META
1781.70Srillig	struct BuildMon bm;
1791.40Ssjg#endif
1801.1Scgd} Job;
1811.1Scgd
1821.19Ssjgextern const char *shellPath;
1831.19Ssjgextern const char *shellName;
1841.42Ssjgextern char *shellErrFlag;
1851.19Ssjg
1861.54Srilligextern int jobTokensRunning;	/* tokens currently "out" */
1871.11Ssommerfe
1881.19Ssjgvoid Shell_Init(void);
1891.74Srilligconst char *Shell_GetNewline(void) MAKE_ATTR_USE;
1901.73Srilligvoid Job_Touch(GNode *, bool);
1911.74Srilligbool Job_CheckCommands(GNode *, void (*abortProc)(const char *, ...))
1921.74Srillig    MAKE_ATTR_USE;
1931.32Sdslvoid Job_CatchChildren(void);
1941.16Swizvoid Job_CatchOutput(void);
1951.16Swizvoid Job_Make(GNode *);
1961.27Sdslvoid Job_Init(void);
1971.74Srilligbool Job_ParseShell(char *) MAKE_ATTR_USE;
1981.16Swizint Job_Finish(void);
1991.16Swizvoid Job_End(void);
2001.16Swizvoid Job_Wait(void);
2011.16Swizvoid Job_AbortAll(void);
2021.16Swizvoid Job_TokenReturn(void);
2031.74Srilligbool Job_TokenWithdraw(void) MAKE_ATTR_USE;
2041.33Sdslvoid Job_ServerStart(int, int, int);
2051.34Ssjgvoid Job_SetPrefix(void);
2061.73Srilligbool Job_RunTarget(const char *, const char *);
2071.66Srilligvoid Job_FlagsToString(const Job *, char *, size_t);
2081.74Srilligint Job_TempFile(const char *, char *, size_t) MAKE_ATTR_USE;
2091.3Scgd
2101.75Srillig#endif
211