Searched refs:Want (Results 1 - 4 of 4) sorted by relevance
| /third_party/json/tests/thirdparty/Fuzzer/test/ |
| H A D | SimpleHashTest.cpp | 33 uint32_t Want = reinterpret_cast<const uint32_t *>(&Data[Size - 4])[0]; in LLVMFuzzerTestOneInput() local
34 if (Hash != Want) in LLVMFuzzerTestOneInput()
37 (unsigned int)Want); in LLVMFuzzerTestOneInput()
|
| /third_party/ninja/src/ |
| H A D | build.h | 98 enum Want
enum
111 bool EdgeMaybeReady(std::map<Edge*, Want>::iterator want_e, std::string* err);
116 void ScheduleWork(std::map<Edge*, Want>::iterator want_e);
122 std::map<Edge*, Want> want_;
|
| H A D | build.cc | 121 pair<map<Edge*, Want>::iterator, bool> want_ins =
in AddSubTarget()
123 Want& want = want_ins.first->second;
in AddSubTarget()
171 void Plan::ScheduleWork(map<Edge*, Want>::iterator want_e) {
in ScheduleWork()
194 map<Edge*, Want>::iterator e = want_.find(edge);
in EdgeFinished()
233 map<Edge*, Want>::iterator want_e = want_.find(*oe);
in NodeFinished()
244 bool Plan::EdgeMaybeReady(map<Edge*, Want>::iterator want_e, string* err) {
in EdgeMaybeReady()
265 map<Edge*, Want>::iterator want_e = want_.find(*oe);
in CleanNode()
340 map<Edge*, Want>::iterator want_e = want_.find(edge);
in DyndepsLoaded()
368 map<Edge*, Want>::iterator want_e = want_.find(*oe);
in DyndepsLoaded()
377 map<Edge*, Want> in DyndepsLoaded()
[all...] |
| /third_party/node/test/parallel/ |
| H A D | test-util-types.js | 54 assert(types[method](value), `Want ${inspect(value)} to match ${method}`);
|
Completed in 3 milliseconds