#include <cctype>
using namespace llvm;
+// Implement the first virtual method in this class in this file so the
+// InlineAsm vtable is emitted here.
+InlineAsm::~InlineAsm() {
+}
+
+
// NOTE: when memoizing the function type, we have to be careful to handle the
// case when the type gets refined.
/// Parse - Analyze the specified string (e.g. "==&{eax}") and fill in the
/// fields in this structure. If the constraint string is not understood,
/// return true, otherwise return false.
-bool InlineAsm::ConstraintInfo::Parse(const std::string &Str) {
+bool InlineAsm::ConstraintInfo::Parse(const std::string &Str,
+ std::vector<InlineAsm::ConstraintInfo> &ConstraintsSoFar) {
std::string::const_iterator I = Str.begin(), E = Str.end();
// Initialize
Type = isInput;
isEarlyClobber = false;
- isIndirectOutput =false;
+ hasMatchingInput = false;
+ isCommutative = false;
+ isIndirect = false;
- // Parse the prefix.
+ // Parse prefixes.
if (*I == '~') {
Type = isClobber;
++I;
} else if (*I == '=') {
++I;
Type = isOutput;
- if (I != E && *I == '=') {
- isIndirectOutput = true;
- ++I;
- }
+ }
+
+ if (*I == '*') {
+ isIndirect = true;
+ ++I;
}
if (I == E) return true; // Just a prefix, like "==" or "~".
default:
DoneWithModifiers = true;
break;
- case '&':
+ case '&': // Early clobber.
if (Type != isOutput || // Cannot early clobber anything but output.
isEarlyClobber) // Reject &&&&&&
return true;
isEarlyClobber = true;
break;
+ case '%': // Commutative.
+ if (Type == isClobber || // Cannot commute clobbers.
+ isCommutative) // Reject %%%%%
+ return true;
+ isCommutative = true;
+ break;
+ case '#': // Comment.
+ case '*': // Register preferencing.
+ return true; // Not supported.
}
if (!DoneWithModifiers) {
if (ConstraintEnd == E) return true; // "{foo"
Codes.push_back(std::string(I, ConstraintEnd+1));
I = ConstraintEnd+1;
- } else if (isdigit(*I)) {
+ } else if (isdigit(*I)) { // Matching Constraint
// Maximal munch numbers.
std::string::const_iterator NumStart = I;
while (I != E && isdigit(*I))
++I;
Codes.push_back(std::string(NumStart, I));
+ unsigned N = atoi(Codes.back().c_str());
+ // Check that this is a valid matching constraint!
+ if (N >= ConstraintsSoFar.size() || ConstraintsSoFar[N].Type != isOutput||
+ Type != isInput)
+ return true; // Invalid constraint number.
+
+ // Note that operand #n has a matching input.
+ ConstraintsSoFar[N].hasMatchingInput = true;
} else {
// Single letter constraint.
Codes.push_back(std::string(I, I+1));
std::string::const_iterator ConstraintEnd = std::find(I, E, ',');
if (ConstraintEnd == I || // Empty constraint like ",,"
- Info.Parse(std::string(I, ConstraintEnd))) { // Erroneous constraint?
- Result.clear();
+ Info.Parse(std::string(I, ConstraintEnd), Result)) {
+ Result.clear(); // Erroneous constraint?
break;
}
for (unsigned i = 0, e = Constraints.size(); i != e; ++i) {
switch (Constraints[i].Type) {
case InlineAsm::isOutput:
- if (!Constraints[i].isIndirectOutput) {
+ if (!Constraints[i].isIndirect) {
if (NumInputs || NumClobbers) return false; // outputs come first.
++NumOutputs;
break;
}
- // FALLTHROUGH for IndirectOutputs.
+ // FALLTHROUGH for Indirect Outputs.
case InlineAsm::isInput:
if (NumClobbers) return false; // inputs before clobbers.
++NumInputs;
if (Ty->getNumParams() != NumInputs) return false;
return true;
}
+
+DEFINING_FILE_FOR(InlineAsm)