Lines Matching defs:Requests

741   std::deque<Request> Requests;           /* GUARDED_BY(Mutex) */
858   assert(Requests.empty() && !CurrentRequest &&
1346       for (auto &R : llvm::reverse(Requests)) {
1379         for (const auto &Req : Requests)
1387     Requests.push_back({std::move(Task), std::string(Name), steady_clock::now(),
1405           if (Requests.empty())
1414         if (!Requests.empty()) {
1415           Ctx.emplace(Requests.front().Ctx.clone());
1417           SPAN_ATTACH(*Tracer, "next_request", Requests.front().Name);
1421               Status.ASTActivity.Name = Requests.front().Name;
1433       // Requests.front(), so prefer them first to preserve LSP order.
1438         CurrentRequest = std::move(Requests.front());
1439         Requests.pop_front();
1469       IsEmpty = Requests.empty() && PreambleRequests.empty();
1485   if (Requests.empty())
1488   for (auto I = Requests.begin(), E = Requests.end(); I != E; ++I) {
1498       Requests.erase(I);
1499       Requests.push_front(std::move(R));
1508     vlog("ASTWorker skipping {0} for {1}", Requests.front().Name, FileName);
1509     Requests.pop_front();
1511   assert(!Requests.empty() && "skipped the whole queue");
1516   for (const auto &R : Requests)
1521   Deadline D(Requests.front().AddTime + UpdateDebounce.compute(RebuildTimes));
1525 // Returns true if Requests.front() is a dead update that can be skipped.
1527   assert(!Requests.empty());
1528   auto Next = Requests.begin();
1535   if (Next == Requests.end() || !Next->Update)
1545     for (; Next != Requests.end(); ++Next)
1557       return PreambleRequests.empty() && Requests.empty() && !CurrentRequest;
1569   assert(Requests.empty() &&