forked from pool/ninja
94dd2c0e8d
* %e and %r work again in dumb terminals (#1146, #1148) * `-t browse` now HTML-escapes rule names (#1157) * an edge may now have 0 explicit outputs if it has implicit outputs (#1159) * make misc/measure.py python 3-compatible * misc/write_fake_manifest.py now optionally writes source files, use it to quickly produce large, buildable projects for testing (#1109, #1198) * on newer FreeBSDs, use ppoll() - Refresh ninja-disable-maxprocs-test.patch OBS-URL: https://build.opensuse.org/package/show/devel:tools:building/ninja?expand=0&rev=30
42 lines
1.3 KiB
Diff
42 lines
1.3 KiB
Diff
Index: src/subprocess_test.cc
|
|
===================================================================
|
|
--- src/subprocess_test.cc.orig
|
|
+++ src/subprocess_test.cc
|
|
@@ -214,36 +214,6 @@ TEST_F(SubprocessTest, SetWithMulti) {
|
|
}
|
|
}
|
|
|
|
-#if defined(USE_PPOLL)
|
|
-TEST_F(SubprocessTest, SetWithLots) {
|
|
- // Arbitrary big number; needs to be over 1024 to confirm we're no longer
|
|
- // hostage to pselect.
|
|
- const unsigned kNumProcs = 1025;
|
|
-
|
|
- // Make sure [ulimit -n] isn't going to stop us from working.
|
|
- rlimit rlim;
|
|
- ASSERT_EQ(0, getrlimit(RLIMIT_NOFILE, &rlim));
|
|
- if (rlim.rlim_cur < kNumProcs) {
|
|
- printf("Raise [ulimit -n] above %u (currently %lu) to make this test go\n",
|
|
- kNumProcs, rlim.rlim_cur);
|
|
- return;
|
|
- }
|
|
-
|
|
- vector<Subprocess*> procs;
|
|
- for (size_t i = 0; i < kNumProcs; ++i) {
|
|
- Subprocess* subproc = subprocs_.Add("/bin/echo");
|
|
- ASSERT_NE((Subprocess *) 0, subproc);
|
|
- procs.push_back(subproc);
|
|
- }
|
|
- while (!subprocs_.running_.empty())
|
|
- subprocs_.DoWork();
|
|
- for (size_t i = 0; i < procs.size(); ++i) {
|
|
- ASSERT_EQ(ExitSuccess, procs[i]->Finish());
|
|
- ASSERT_NE("", procs[i]->GetOutput());
|
|
- }
|
|
- ASSERT_EQ(kNumProcs, subprocs_.finished_.size());
|
|
-}
|
|
-#endif // !__APPLE__ && !_WIN32
|
|
|
|
// TODO: this test could work on Windows, just not sure how to simply
|
|
// read stdin.
|