llvm-project/polly
Gabriel Ravier ea540bc210
[polly] Fixed a number of typos. NFC
I went over the output of the following mess of a command:

`(ulimit -m 2000000; ulimit -v 2000000; git ls-files -z | parallel --xargs -0 cat | aspell list --mode=none --ignore-case | grep -E '^[A-Za-z][a-z]*$' | sort | uniq -c | sort -n | grep -vE '.{25}' | aspell pipe -W3 | grep : | cut -d' ' -f2 | less)`

and proceeded to spend a few days looking at it to find probable typos
and fixed a few hundred of them in all of the llvm project (note, the
ones I found are not anywhere near all of them, but it seems like a
good start).

Reviewed By: inclyc

Differential Revision: https://reviews.llvm.org/D131167
2022-08-07 22:56:07 +08:00
..
cmake
docs [polly] Fixed a number of typos. NFC 2022-08-07 22:56:07 +08:00
include/polly [polly] Fixed a number of typos. NFC 2022-08-07 22:56:07 +08:00
lib [polly] Fixed a number of typos. NFC 2022-08-07 22:56:07 +08:00
test [polly] Fixed a number of typos. NFC 2022-08-07 22:56:07 +08:00
tools [polly] Fixed a number of typos. NFC 2022-08-07 22:56:07 +08:00
unittests
utils
www [polly] Fixed a number of typos. NFC 2022-08-07 22:56:07 +08:00
.arclint
.gitattributes
.gitignore
CMakeLists.txt
CREDITS.txt
LICENSE.TXT
README

Polly - Polyhedral optimizations for LLVM
-----------------------------------------
http://polly.llvm.org/

Polly uses a mathematical representation, the polyhedral model, to represent and
transform loops and other control flow structures. Using an abstract
representation it is possible to reason about transformations in a more general
way and to use highly optimized linear programming libraries to figure out the
optimal loop structure. These transformations can be used to do constant
propagation through arrays, remove dead loop iterations, optimize loops for
cache locality, optimize arrays, apply advanced automatic parallelization, drive
vectorization, or they can be used to do software pipelining.