Lines Matching full:poll
19 // - A "poll" is an explicit check in the generated code to determine if the
22 // routine will be parseable. The (gc & runtime specific) logic of a poll is
27 // implementation, this is done via the insertion of poll sites at method entry
29 // are necessary to ensure a finite period between poll sites. This is not
30 // because the poll itself is expensive in the generated code; it's not. Polls
35 // poll (or otherwise be inspected by the GC). If so, the entire stack
42 // executing code reaches a safepoint poll in a finite amount of time.
103 /// the function which require a safepoint poll to be inserted.
109 /// pointing at the branch) which need a poll inserted.
258 // Given we're inlining this inside of safepoint poll insertion, this in runImpl()
260 // parseable after we inline a poll. in runImpl()
298 // We preserve dominance information when inserting the poll, otherwise in runImpl()
311 // We can sometimes end up with duplicate poll locations. This happens if in runImpl()
316 // Insert a poll at each point the analysis pass identified in runImpl()
317 // The poll location must be the terminator of a loop latch block. in runImpl()
319 // We are inserting a poll, the function is modified in runImpl()
323 // Split the backedge of the loop and insert the poll within that new in runImpl()
326 // optimize in practice than inserting the poll immediately before the in runImpl()
340 assert(!Headers.empty() && "poll location is not a loop latch?"); in runImpl()
366 // not insert a entry safepoint poll. in runImpl()
369 // Now that we've identified all the needed safepoint poll locations, insert in runImpl()
430 // unconditional poll. In practice, this is only a theoretical concern in containsUnconditionalCallSafepoint()
486 "support for invokes in poll code needed"); in scanOneBB()
543 // Conceptually, this poll needs to be on method entry, but in in findLocationForEntrySafepoint()
573 // We need to ensure a safepoint poll occurs before any 'real' call. The in findLocationForEntrySafepoint()
576 // a safepoint. Additionally, we need to ensure a poll before any call in findLocationForEntrySafepoint()
620 // Insert a safepoint poll immediately before the given instruction. Does
631 // Inline the safepoint poll implementation - this will get all the branch, in InsertSafepointPoll()
670 // If your poll function includes an unreachable at the end, that's not in InsertSafepointPoll()
673 "malformed poll function"); in InsertSafepointPoll()
676 assert(!Calls.empty() && "slow path not found for safepoint poll"); in InsertSafepointPoll()
679 // the poll function. This is required so that the runtime knows how to in InsertSafepointPoll()