blob: 048bacb4d402245acf66ef0e20b8fad078247c34 (
plain)
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
|
// Copyright 2011 Google Inc. All Rights Reserved.
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS IS" BASIS,
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
// See the License for the specific language governing permissions and
// limitations under the License.
#ifndef NINJA_SUBPROCESS_H_
#define NINJA_SUBPROCESS_H_
#include <string>
#include <vector>
#include <queue>
using namespace std;
/// Subprocess wraps a single async subprocess. It is entirely
/// passive: it expects the caller to notify it when its fds are ready
/// for reading, as well as call Finish() to reap the child once done()
/// is true.
struct Subprocess {
Subprocess();
~Subprocess();
bool Start(const string& command);
void OnFDReady();
/// Returns true on successful process exit.
bool Finish();
bool Done() const;
const string& GetOutput() const;
struct Stream;
Stream* stream_;
pid_t pid_;
};
/// SubprocessSet runs a poll() loop around a set of Subprocesses.
/// DoWork() waits for any state change in subprocesses; finished_
/// is a queue of subprocesses as they finish.
struct SubprocessSet {
void Add(Subprocess* subprocess);
void DoWork();
Subprocess* NextFinished();
vector<Subprocess*> running_;
queue<Subprocess*> finished_;
};
#endif // NINJA_SUBPROCESS_H_
|
