//
// The LLVM Compiler Infrastructure
//
-// This file was developed by Chris Lattner and is distributed under the
-// University of Illinois Open Source License. See LICENSE.TXT for details.
+// This file is distributed under the University of Illinois Open Source
+// License. See LICENSE.TXT for details.
//
//===----------------------------------------------------------------------===//
//
#include "llvm/InlineAsm.h"
#include "llvm/DerivedTypes.h"
+#include <algorithm>
#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.
InlineAsm::InlineAsm(const FunctionType *Ty, const std::string &asmString,
const std::string &constraints, bool hasSideEffects)
- : Value(PointerType::get(Ty), Value::InlineAsmVal), AsmString(asmString),
+ : Value(PointerType::getUnqual(Ty),
+ Value::InlineAsmVal),
+ AsmString(asmString),
Constraints(constraints), HasSideEffects(hasSideEffects) {
// Do various checks on the constraint string and type.
return cast<FunctionType>(getType()->getElementType());
}
-std::vector<std::pair<InlineAsm::ConstraintPrefix, std::string> >
-InlineAsm::ParseConstraints(const std::string &Constraints) {
- std::vector<std::pair<InlineAsm::ConstraintPrefix, std::string> > Result;
+/// 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,
+ std::vector<InlineAsm::ConstraintInfo> &ConstraintsSoFar) {
+ std::string::const_iterator I = Str.begin(), E = Str.end();
- // Scan the constraints string.
- for (std::string::const_iterator I = Constraints.begin(),
- E = Constraints.end(); I != E; ) {
- if (*I == ',') { Result.clear(); break; } // Empty constraint like ",,"
-
- // Parse the prefix.
- ConstraintPrefix ConstraintType = isInput;
+ // Initialize
+ Type = isInput;
+ isEarlyClobber = false;
+ MatchingInput = -1;
+ isCommutative = false;
+ isIndirect = false;
+
+ // Parse prefixes.
+ if (*I == '~') {
+ Type = isClobber;
+ ++I;
+ } else if (*I == '=') {
+ ++I;
+ Type = isOutput;
+ }
+
+ if (*I == '*') {
+ isIndirect = true;
+ ++I;
+ }
+
+ if (I == E) return true; // Just a prefix, like "==" or "~".
+
+ // Parse the modifiers.
+ bool DoneWithModifiers = false;
+ while (!DoneWithModifiers) {
+ switch (*I) {
+ default:
+ DoneWithModifiers = true;
+ break;
+ 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 (*I == '~') {
- ConstraintType = isClobber;
+ if (!DoneWithModifiers) {
++I;
- } else if (*I == '=') {
- ++I;
- if (I != E && *I == '=') {
- ConstraintType = isIndirectOutput;
- ++I;
- } else {
- ConstraintType = isOutput;
- }
+ if (I == E) return true; // Just prefixes and modifiers!
}
-
- if (I == E) { Result.clear(); break; } // Just a prefix, like "==" or "~".
-
- std::string::const_iterator IdStart = I;
+ }
+
+ // Parse the various constraints.
+ while (I != E) {
+ if (*I == '{') { // Physical register reference.
+ // Find the end of the register name.
+ std::string::const_iterator ConstraintEnd = std::find(I+1, E, '}');
+ if (ConstraintEnd == E) return true; // "{foo"
+ Codes.push_back(std::string(I, ConstraintEnd+1));
+ I = ConstraintEnd+1;
+ } 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.
- // Parse the id. We accept [a-zA-Z0-9] currently.
- while (I != E && isalnum(*I)) ++I;
-
- if (IdStart == I) { // Requires more than just a prefix
- Result.clear();
+ // If Operand N already has a matching input, reject this. An output
+ // can't be constrained to the same value as multiple inputs.
+ if (ConstraintsSoFar[N].hasMatchingInput())
+ return true;
+
+ // Note that operand #n has a matching input.
+ ConstraintsSoFar[N].MatchingInput = ConstraintsSoFar.size();
+ } else {
+ // Single letter constraint.
+ Codes.push_back(std::string(I, I+1));
+ ++I;
+ }
+ }
+
+ return false;
+}
+
+std::vector<InlineAsm::ConstraintInfo>
+InlineAsm::ParseConstraints(const std::string &Constraints) {
+ std::vector<ConstraintInfo> Result;
+
+ // Scan the constraints string.
+ for (std::string::const_iterator I = Constraints.begin(),
+ E = Constraints.end(); I != E; ) {
+ ConstraintInfo Info;
+
+ // Find the end of this constraint.
+ std::string::const_iterator ConstraintEnd = std::find(I, E, ',');
+
+ if (ConstraintEnd == I || // Empty constraint like ",,"
+ Info.Parse(std::string(I, ConstraintEnd), Result)) {
+ Result.clear(); // Erroneous constraint?
break;
}
+
+ Result.push_back(Info);
- // Remember this constraint.
- Result.push_back(std::make_pair(ConstraintType, std::string(IdStart, I)));
-
- // If we reached the end of the ID, we must have the end of the string or a
- // comma, which we skip now.
+ // ConstraintEnd may be either the next comma or the end of the string. In
+ // the former case, we skip the comma.
+ I = ConstraintEnd;
if (I != E) {
- if (*I != ',') { Result.clear(); break; }
++I;
if (I == E) { Result.clear(); break; } // don't allow "xyz,"
}
bool InlineAsm::Verify(const FunctionType *Ty, const std::string &ConstStr) {
if (Ty->isVarArg()) return false;
- std::vector<std::pair<ConstraintPrefix, std::string> >
- Constraints = ParseConstraints(ConstStr);
+ std::vector<ConstraintInfo> Constraints = ParseConstraints(ConstStr);
// Error parsing constraints.
if (Constraints.empty() && !ConstStr.empty()) return false;
unsigned NumOutputs = 0, NumInputs = 0, NumClobbers = 0;
+ unsigned NumIndirect = 0;
for (unsigned i = 0, e = Constraints.size(); i != e; ++i) {
- switch (Constraints[i].first) {
- case isOutput:
- if (NumInputs || NumClobbers) return false; // outputs come first.
- ++NumOutputs;
- break;
- case isInput:
- case isIndirectOutput:
+ switch (Constraints[i].Type) {
+ case InlineAsm::isOutput:
+ if ((NumInputs-NumIndirect) != 0 || NumClobbers != 0)
+ return false; // outputs before inputs and clobbers.
+ if (!Constraints[i].isIndirect) {
+ ++NumOutputs;
+ break;
+ }
+ ++NumIndirect;
+ // FALLTHROUGH for Indirect Outputs.
+ case InlineAsm::isInput:
if (NumClobbers) return false; // inputs before clobbers.
++NumInputs;
break;
- case isClobber:
+ case InlineAsm::isClobber:
++NumClobbers;
break;
}
}
-
- if (NumOutputs > 1) return false; // Only one result allowed so far.
- if ((Ty->getReturnType() != Type::VoidTy) != NumOutputs)
- return false; // NumOutputs = 1 iff has a result type.
+ switch (NumOutputs) {
+ case 0:
+ if (Ty->getReturnType() != Type::VoidTy) return false;
+ break;
+ case 1:
+ if (isa<StructType>(Ty->getReturnType())) return false;
+ break;
+ default:
+ const StructType *STy = dyn_cast<StructType>(Ty->getReturnType());
+ if (STy == 0 || STy->getNumElements() != NumOutputs)
+ return false;
+ break;
+ }
if (Ty->getNumParams() != NumInputs) return false;
return true;
}
+
projects / oota-llvm.git / blobdiff