HomeSort by relevance Sort by last modified time
    Searched defs:Schedule (Results 1 - 8 of 8) sorted by null

  /external/chromium/chrome/browser/net/
sdch_dictionary_fetcher.cc 24 void SdchDictionaryFetcher::Schedule(const GURL& dictionary_url) {
  /external/chromium/chrome/browser/password_manager/
password_store.cc 69 return Schedule(&PasswordStore::GetLoginsImpl, consumer, form);
74 return Schedule(&PasswordStore::GetAutofillableLoginsImpl, consumer);
79 return Schedule(&PasswordStore::GetBlacklistLoginsImpl, consumer);
111 CancelableRequestProvider::Handle PasswordStore::Schedule(
122 CancelableRequestProvider::Handle PasswordStore::Schedule(
  /external/llvm/lib/CodeGen/SelectionDAG/
ScheduleDAGList.cpp 11 // The basic approach uses a priority queue of available nodes to schedule.
13 // order), checked for legality to schedule, and emitted if legal.
15 // Nodes may not be legal to schedule either due to structural hazards (e.g.
78 void Schedule();
88 /// Schedule - Schedule the DAG using list scheduling.
89 void ScheduleDAGList::Schedule() {
140 /// ScheduleNodeTopDown - Add the node to the schedule. Decrement the pending
174 // priority. If it is not ready put it back. Schedule the node.
224 // If we found a node to schedule, do it now
    [all...]
ScheduleDAGFast.cpp 78 void Schedule();
110 /// Schedule - Schedule the DAG using list scheduling.
111 void ScheduleDAGFast::Schedule() {
174 /// ScheduleNodeBottomUp - Add the node to the schedule. Decrement the pending
462 /// If the specific node is the last one that's available to schedule, do
536 // priority. If it is not ready put it back. Schedule the node.
ScheduleDAGRRList.cpp 12 // queue of available nodes to schedule. One at a time, nodes are taken from
14 // schedule, and emitted if legal.
185 void Schedule();
317 /// Schedule - Schedule the DAG using list scheduling.
318 void ScheduleDAGRRList::Schedule() {
586 /// ScheduleNodeBottomUp - Add the node to the schedule. Decrement the pending
670 /// UnscheduleNodeBottomUp - Remove the node from the schedule, update its and
742 /// BTCycle in order to schedule a specific node.
    [all...]
  /external/chromium/chrome/browser/history/
history.h 615 // Called by the HistoryURLProvider class to schedule an autocomplete, it
686 // Call to schedule a given task for running on the history thread with the
690 // Schedule ------------------------------------------------------------------
697 Handle Schedule(SchedulePriority priority,
712 Handle Schedule(SchedulePriority priority,
    [all...]
  /external/llvm/lib/CodeGen/
PostRASchedulerList.cpp 11 // The basic approach uses a priority queue of available nodes to schedule.
13 // order), checked for legality to schedule, and emitted if legal.
15 // Nodes may not be legal to schedule either due to structural hazards (e.g.
68 // If DebugDiv > 0 then only schedule MBB with (ID % DebugDiv) == DebugMod
151 /// Schedule - Schedule the instruction range using list scheduling.
153 void Schedule();
246 // If DebugDiv > 0 then only schedule MBB with (ID % DebugDiv) == DebugMod
259 // Schedule each sequence of instructions not interrupted by a label
304 /// Schedule - Schedule the instruction range using list scheduling
    [all...]
  /external/v8/src/
debug.cc     [all...]

Completed in 207 milliseconds