Displaying 3 results from an estimated 3 matches for "strno".
Did you mean:
stano
2012 Sep 07
1
[LLVMdev] teaching FileCheck to handle variations in order
...NotMatches, CheckStrings.back().NotStrings);
}
@@ -686,10 +761,32 @@ int main(int argc, char **argv) {
StringRef Buffer = F->getBuffer();
const char *LastMatch = Buffer.data();
+ std::vector<StringRef> BufferStack;
+ StringRef BufferHighWaterMark = Buffer;
for (unsigned StrNo = 0, e = CheckStrings.size(); StrNo != e; ++StrNo) {
const CheckString &CheckStr = CheckStrings[StrNo];
+ if (CheckStr.PopPos == -1) {
+ if (Buffer.data() < BufferHighWaterMark.data()) {
+ Buffer = BufferHighWaterMark;
+ LastMatch = Buffer.data();
+ }
+ }...
2012 Sep 07
5
[LLVMdev] teaching FileCheck to handle variations in order
...NextCheckPopLoc= SMLoc();
std::swap(NotMatches, CheckStrings.back().NotStrings);
}
@@ -686,10 +745,22 @@ int main(int argc, char **argv) {
StringRef Buffer = F->getBuffer();
const char *LastMatch = Buffer.data();
+ std::vector<StringRef> BufferStack;
for (unsigned StrNo = 0, e = CheckStrings.size(); StrNo != e; ++StrNo) {
const CheckString &CheckStr = CheckStrings[StrNo];
+ for (int i = CheckStr.PopPos; i; --i) {
+ if (BufferStack.empty()) {
+ SM.PrintMessage(CheckStr.PopLoc, SourceMgr::DK_Error,
+ "attempting...
2012 Sep 07
0
[LLVMdev] teaching FileCheck to handle variations in order
On 9/7/2012 7:20 AM, Matthew Curtis wrote:
>
> The attached patch implements one possible solution. It introduces a
> position stack and a couple of directives:
>
> * 'CHECK-PUSH:' pushes the current match position onto the stack.
> * 'CHECK-POP:' pops the top value off of the stack and uses it to set
> the current match position.
>
> The above