RPCS3/llvm-mirror
1
0
Fork 0
mirror of https://github.com/RPCS3/llvm-mirror.git synced 2025-02-20 20:30:56 +00:00
Code Issues Actions Packages Projects Releases Wiki Activity

The word separate' only has one e'.

Browse Source 
llvm-svn: 7173
This commit is contained in:
Misha Brukman 2003-07-14 17:20:40 +00:00
parent 227f4d6f54
commit 5de3e14206
16 changed files with 21 additions and 21 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
docs/CommandLine.html
View File

@ -1109,7 +1109,7 @@ specifies that this option is used to capture "interpreter style" arguments. Se
<a name="cl::Prefix">The <b><tt>cl::Prefix</tt></b> modifier specifies that this
option prefixes its value. With 'Prefix' options, there is no equal sign that
seperates the value from the option name specified. This is useful for
separates the value from the option name specified. This is useful for
processing odd arguments like '<tt>-lmalloc -L/usr/lib'</tt> in a linker tool.
Here, the '<tt>l</tt>' and '<tt>L</tt>' options are normal string (list)
options, that have the <a href="#cl::Prefix">cl::Prefix</a> modifier added to
@ -1496,7 +1496,7 @@ line options </b></font></td></tr></table><ul>
<address><a href="mailto:sabre@nondot.org">Chris Lattner</a></address>
<!-- Created: Tue Jan 23 15:19:28 CST 2001 -->
<!-- hhmts start -->
Last modified: Sat Jun 21 16:45:29 CDT 2003
Last modified: Mon Jul 14 12:12:15 CDT 2003
<!-- hhmts end -->
</font>
</body></html>

4
docs/LangRef.html
View File

@ -366,7 +366,7 @@ functions), for indirect function calls, and when defining a function.<p>
&lt;returntype&gt; (&lt;parameter list&gt;)
</pre>
Where '<tt>&lt;parameter list&gt;</tt>' is a comma seperated list of type
Where '<tt>&lt;parameter list&gt;</tt>' is a comma-separated list of type
specifiers. Optionally, the parameter list may include a type <tt>...</tt>,
which indicates that the function takes a variable number of arguments. Note
that there currently is no way to define a function in LLVM that takes a
@ -1811,7 +1811,7 @@ arbitrarily complex and require memory allocation, for example.<p>
<address><a href="mailto:sabre@nondot.org">Chris Lattner</a></address>
<!-- Created: Tue Jan 23 15:19:28 CST 2001 -->
<!-- hhmts start -->
Last modified: Wed Jun 18 16:29:55 CDT 2003
Last modified: Mon Jul 14 12:12:22 CDT 2003
<!-- hhmts end -->
</font>
</body></html>

6
docs/RegisterAllocatorInfo.txt
View File

@ -117,7 +117,7 @@ incoming/call arguments and return values.
6.2. Create Interference graphs
-------------------------------
Once live ranges are constructed, we can build interference graphs for each
register class. Though each register class must have a seperate interference
register class. Though each register class must have a separate interference
graph, building all interference graphs is performed in one pass. Also, the
adjacency list for each live range is built in this phase. Consequently, each
register class has an interference graph (which is a bit matrix) and each
@ -139,7 +139,7 @@ coalesing is given in LiveRangeInfo::coalesceLRs().
6.4. Color all live ranges in each RegClass using graph coloring algo
---------------------------------------------------------------------
Each register class is colored seperately using the graph coloring algo. When
Each register class is colored separately using the graph coloring algo. When
assigning colors, preference is given to live ranges with suggested colors
so that if such a live range receives a color (i.e., not spilled), then
we try to assign the color suggested for that live range. When this phase
@ -157,7 +157,7 @@ alogorithm, we have to make sure that it received the correct color (for
instance the first incoming int argument must be colored to %i0 on Sparc). If
it didn't receive the correct color, we have to insert instruction to to move
the value to the required register. Also, this phase produces the caller
saving code. All adition code produced is kept seperately until the last
saving code. All adition code produced is kept separately until the last
phase (see 6.6)

4
docs/WritingAnLLVMPass.html
View File

@ -1166,7 +1166,7 @@ fast enough: obviously we should allow for a multithreaded compiler. Because of
the semantics defined for passes above (specifically they cannot maintain state
across invocations of their <tt>run*</tt> methods), a nice clean way to
implement a multithreaded compiler would be for the <tt>PassManager</tt> class
to create multiple instances of each pass object, and allow the seperate
to create multiple instances of each pass object, and allow the separate
instances to be hacking on different parts of the program at the same time.<p>
This implementation would prevent each of the passes from having to implement
@ -1223,6 +1223,6 @@ href="#Pass"><tt>Pass</tt></a>, only the other way around.<p>
<address><a href="mailto:sabre@nondot.org">Chris Lattner</a></address>
<!-- Created: Tue Aug 6 15:00:33 CDT 2002 -->
<!-- hhmts start -->
Last modified: Mon Oct 21 14:52:55 CDT 2002
Last modified: Mon Jul 14 12:12:53 CDT 2003
<!-- hhmts end -->
</font></body></html>

2
include/Support/CommandLine.h
View File

@ -374,7 +374,7 @@ struct generic_parser_base {
// In which case, the value is required. Otherwise if an arg str has not
// been specified, we are of the form:
//
// -O2 or O2 or -la (where -l and -a are seperate options)
// -O2 or O2 or -la (where -l and -a are separate options)
//
// If this is the case, we cannot allow a value.
//

2
include/llvm/CodeGen/MachineCodeEmitter.h
View File

@ -2,7 +2,7 @@
//
// This file defines an abstract interface that is used by the machine code
// emission framework to output the code. This allows machine code emission to
// be seperated from concerns such as resolution of call targets, and where the
// be separated from concerns such as resolution of call targets, and where the
// machine code will be written (memory or disk, f.e.).
//
//===----------------------------------------------------------------------===//

2
include/llvm/Target/TargetRegInfo.h
View File

@ -180,7 +180,7 @@ public:
virtual unsigned getReturnAddressReg() const = 0;
// Each register class has a seperate space for register IDs. To convert
// Each register class has a separate space for register IDs. To convert
// a regId in a register class to a common Id, or vice versa,
// we use the folloing two methods.
//

2
lib/AsmParser/llvmAsmParser.y
View File

@ -1105,7 +1105,7 @@ ConstExpr: CAST '(' ConstVal TO Types ')' {
};
// ConstVector - A list of comma seperated constants.
// ConstVector - A list of comma separated constants.
ConstVector : ConstVector ',' ConstVal {
($$ = $1)->push_back($3);
}

2
lib/Bytecode/Reader/ConstantReader.cpp
View File

@ -273,7 +273,7 @@ bool BytecodeParser::parseConstantValue(const unsigned char *&Buf,
}
case Type::TypeTyID:
assert(0 && "Type constants should be handled seperately!!!");
assert(0 && "Type constants should be handled separately!!!");
abort();
case Type::ArrayTyID: {

2
lib/Support/SystemUtils.cpp
View File

@ -96,7 +96,7 @@ std::string FindExecutable(const std::string &ExeName,
const char *PathStr = getenv("PATH");
if (PathStr == 0) return "";
// Now we have a colon seperated list of directories to search... try them...
// Now we have a colon separated list of directories to search... try them...
unsigned PathLen = strlen(PathStr);
while (PathLen) {
// Find the first colon...

2
lib/Target/Sparc/EmitAssembly.cpp
View File

@ -479,7 +479,7 @@ SparcFunctionAsmPrinter::emitBasicBlock(const MachineBasicBlock &MBB)
for (MachineBasicBlock::const_iterator MII = MBB.begin(), MIE = MBB.end();
MII != MIE; ++MII)
emitMachineInst(*MII);
toAsm << "\n"; // Seperate BB's with newlines
toAsm << "\n"; // Separate BB's with newlines
}
void

2
lib/VMCore/AsmWriter.cpp
View File

@ -686,7 +686,7 @@ void AssemblyWriter::printBasicBlock(const BasicBlock *BB) {
int Slot = Table.getValSlot(BB);
Out << "\n; <label>:";
if (Slot >= 0)
Out << Slot; // Extra newline seperates out label's
Out << Slot; // Extra newline separates out label's
else
Out << "<badref>";
}

2
support/lib/Support/SystemUtils.cpp
View File

@ -96,7 +96,7 @@ std::string FindExecutable(const std::string &ExeName,
const char *PathStr = getenv("PATH");
if (PathStr == 0) return "";
// Now we have a colon seperated list of directories to search... try them...
// Now we have a colon separated list of directories to search... try them...
unsigned PathLen = strlen(PathStr);
while (PathLen) {
// Find the first colon...

2
tools/analyze/AnalysisWrappers.cpp
View File

@ -4,7 +4,7 @@
// be passes. It provides a nice standard pass interface to these classes so
// that they can be printed out by analyze.
//
// These classes are seperated out of analyze.cpp so that it is more clear which
// These classes are separated out of analyze.cpp so that it is more clear which
// code is the integral part of the analyze tool, and which part of the code is
// just making it so more passes are available.
//

2
tools/bugpoint/Miscompilation.cpp
View File

@ -61,7 +61,7 @@ ReduceMiscompilingPasses::doTest(std::vector<const PassInfo*> &Prefix,
if (Prefix.empty()) return NoFailure;
// Next, see if the program is broken if we run the "prefix" passes first,
// then seperately run the "kept" passes.
// then separately run the "kept" passes.
std::cout << "Checking to see if '" << getPassesString(Prefix)
<< "' compile correctly: ";

2
tools/bugpoint/SystemUtils.cpp
View File

@ -96,7 +96,7 @@ std::string FindExecutable(const std::string &ExeName,
const char *PathStr = getenv("PATH");
if (PathStr == 0) return "";
// Now we have a colon seperated list of directories to search... try them...
// Now we have a colon separated list of directories to search... try them...
unsigned PathLen = strlen(PathStr);
while (PathLen) {
// Find the first colon...