1
0
mirror of https://github.com/RPCS3/llvm-mirror.git synced 2024-11-22 18:54:02 +01:00

Fix three typos in comments; "easilly" -> "easily".

llvm-svn: 245379
This commit is contained in:
Nick Lewycky 2015-08-18 22:41:58 +00:00
parent 3ec59b51d4
commit aacc91f91c
3 changed files with 4 additions and 4 deletions

View File

@ -998,7 +998,7 @@ void ScheduleDAGMILive::updatePressureDiffs(ArrayRef<unsigned> LiveUses) {
/// only includes instructions that have DAG nodes, not scheduling boundaries.
///
/// This is a skeletal driver, with all the functionality pushed into helpers,
/// so that it can be easilly extended by experimental schedulers. Generally,
/// so that it can be easily extended by experimental schedulers. Generally,
/// implementing MachineSchedStrategy should be sufficient to implement a new
/// scheduling algorithm. However, if a scheduler further subclasses
/// ScheduleDAGMILive then it will want to override this virtual method in order

View File

@ -828,7 +828,7 @@ bool LoopIdiomRecognize::recognizePopcount() {
return false;
// Counting population are usually conducted by few arithmetic instructions.
// Such instructions can be easilly "absorbed" by vacant slots in a
// Such instructions can be easily "absorbed" by vacant slots in a
// non-compact loop. Therefore, recognizing popcount idiom only makes sense
// in a compact loop.

View File

@ -1124,7 +1124,7 @@ unsigned FilterChooser::getDecoderIndex(DecoderSet &Decoders,
// Using the full decoder string as the key value here is a bit
// heavyweight, but is effective. If the string comparisons become a
// performance concern, we can implement a mangling of the predicate
// data easilly enough with a map back to the actual string. That's
// data easily enough with a map back to the actual string. That's
// overkill for now, though.
// Make sure the predicate is in the table.
@ -1199,7 +1199,7 @@ unsigned FilterChooser::getPredicateIndex(DecoderTableInfo &TableInfo,
// Using the full predicate string as the key value here is a bit
// heavyweight, but is effective. If the string comparisons become a
// performance concern, we can implement a mangling of the predicate
// data easilly enough with a map back to the actual string. That's
// data easily enough with a map back to the actual string. That's
// overkill for now, though.
// Make sure the predicate is in the table.