<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
<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>
<returntype> (<parameter list>)
</pre>
-Where '<tt><parameter list></tt>' is a comma seperated list of type
+Where '<tt><parameter list></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
<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.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
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
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)
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
<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>
// 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.
//
//
// 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.).
//
//===----------------------------------------------------------------------===//
// 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.
//
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.
//
};
-// ConstVector - A list of comma seperated constants.
+// ConstVector - A list of comma separated constants.
ConstVector : ConstVector ',' ConstVal {
($$ = $1)->push_back($3);
}
}
case Type::TypeTyID:
- assert(0 && "Type constants should be handled seperately!!!");
+ assert(0 && "Type constants should be handled separately!!!");
abort();
case Type::ArrayTyID: {
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...
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
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>";
}
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...
// 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.
//
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: ";
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...
// 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.
//
projects / oota-llvm.git / commitdiff