2009-07-08 18:44:05 +00:00
|
|
|
//===- FileCheck.cpp - Check that File's Contents match what is expected --===//
|
|
|
|
//
|
|
|
|
// The LLVM Compiler Infrastructure
|
|
|
|
//
|
|
|
|
// This file is distributed under the University of Illinois Open Source
|
|
|
|
// License. See LICENSE.TXT for details.
|
|
|
|
//
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
//
|
|
|
|
// FileCheck does a line-by line check of a file that validates whether it
|
|
|
|
// contains the expected content. This is useful for regression tests etc.
|
|
|
|
//
|
|
|
|
// This program exits with an error status of 2 on error, exit status of 0 if
|
|
|
|
// the file matched the expected contents, and exit status of 1 if it did not
|
|
|
|
// contain the expected contents.
|
|
|
|
//
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
|
|
|
#include "llvm/Support/CommandLine.h"
|
|
|
|
#include "llvm/Support/MemoryBuffer.h"
|
|
|
|
#include "llvm/Support/PrettyStackTrace.h"
|
|
|
|
#include "llvm/Support/SourceMgr.h"
|
|
|
|
#include "llvm/Support/raw_ostream.h"
|
|
|
|
#include "llvm/System/Signals.h"
|
|
|
|
using namespace llvm;
|
|
|
|
|
|
|
|
static cl::opt<std::string>
|
|
|
|
CheckFilename(cl::Positional, cl::desc("<check-file>"), cl::Required);
|
|
|
|
|
|
|
|
static cl::opt<std::string>
|
|
|
|
InputFilename("input-file", cl::desc("File to check (defaults to stdin)"),
|
|
|
|
cl::init("-"), cl::value_desc("filename"));
|
|
|
|
|
|
|
|
static cl::opt<std::string>
|
|
|
|
CheckPrefix("check-prefix", cl::init("CHECK"),
|
|
|
|
cl::desc("Prefix to use from check file (defaults to 'CHECK')"));
|
|
|
|
|
2009-07-11 18:58:15 +00:00
|
|
|
static cl::opt<bool>
|
|
|
|
NoCanonicalizeWhiteSpace("strict-whitespace",
|
|
|
|
cl::desc("Do not treat all horizontal whitespace as equivalent"));
|
|
|
|
|
2009-08-15 17:41:04 +00:00
|
|
|
/// CheckString - This is a check that we found in the input file.
|
|
|
|
struct CheckString {
|
|
|
|
/// Str - The string to match.
|
|
|
|
std::string Str;
|
|
|
|
|
|
|
|
/// Loc - The location in the match file that the check string was specified.
|
|
|
|
SMLoc Loc;
|
|
|
|
|
2009-08-15 18:32:21 +00:00
|
|
|
/// IsCheckNext - This is true if this is a CHECK-NEXT: directive (as opposed
|
|
|
|
/// to a CHECK: directive.
|
|
|
|
bool IsCheckNext;
|
|
|
|
|
2009-09-20 22:35:26 +00:00
|
|
|
/// NotStrings - These are all of the strings that are disallowed from
|
|
|
|
/// occurring between this match string and the previous one (or start of
|
|
|
|
/// file).
|
|
|
|
std::vector<std::pair<SMLoc, std::string> > NotStrings;
|
|
|
|
|
2009-08-15 18:32:21 +00:00
|
|
|
CheckString(const std::string &S, SMLoc L, bool isCheckNext)
|
|
|
|
: Str(S), Loc(L), IsCheckNext(isCheckNext) {}
|
2009-08-15 17:41:04 +00:00
|
|
|
};
|
|
|
|
|
2009-07-08 18:44:05 +00:00
|
|
|
|
|
|
|
/// ReadCheckFile - Read the check file, which specifies the sequence of
|
|
|
|
/// expected strings. The strings are added to the CheckStrings vector.
|
|
|
|
static bool ReadCheckFile(SourceMgr &SM,
|
2009-08-15 17:41:04 +00:00
|
|
|
std::vector<CheckString> &CheckStrings) {
|
2009-07-08 18:44:05 +00:00
|
|
|
// Open the check file, and tell SourceMgr about it.
|
|
|
|
std::string ErrorStr;
|
|
|
|
MemoryBuffer *F =
|
|
|
|
MemoryBuffer::getFileOrSTDIN(CheckFilename.c_str(), &ErrorStr);
|
|
|
|
if (F == 0) {
|
|
|
|
errs() << "Could not open check file '" << CheckFilename << "': "
|
|
|
|
<< ErrorStr << '\n';
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
SM.AddNewSourceBuffer(F, SMLoc());
|
|
|
|
|
2009-08-15 18:00:42 +00:00
|
|
|
// Find all instances of CheckPrefix followed by : in the file.
|
2009-09-20 22:11:44 +00:00
|
|
|
StringRef Buffer = F->getBuffer();
|
2009-07-08 18:44:05 +00:00
|
|
|
|
2009-09-20 22:35:26 +00:00
|
|
|
std::vector<std::pair<SMLoc, std::string> > NotMatches;
|
|
|
|
|
2009-07-08 18:44:05 +00:00
|
|
|
while (1) {
|
|
|
|
// See if Prefix occurs in the memory buffer.
|
2009-09-20 22:11:44 +00:00
|
|
|
Buffer = Buffer.substr(Buffer.find(CheckPrefix));
|
2009-07-08 18:44:05 +00:00
|
|
|
|
|
|
|
// If we didn't find a match, we're done.
|
2009-09-20 22:11:44 +00:00
|
|
|
if (Buffer.empty())
|
2009-07-08 18:44:05 +00:00
|
|
|
break;
|
|
|
|
|
2009-09-20 22:11:44 +00:00
|
|
|
const char *CheckPrefixStart = Buffer.data();
|
2009-08-15 18:32:21 +00:00
|
|
|
|
|
|
|
// When we find a check prefix, keep track of whether we find CHECK: or
|
|
|
|
// CHECK-NEXT:
|
2009-09-20 22:35:26 +00:00
|
|
|
bool IsCheckNext = false, IsCheckNot = false;
|
2009-08-15 18:32:21 +00:00
|
|
|
|
2009-08-15 18:00:42 +00:00
|
|
|
// Verify that the : is present after the prefix.
|
2009-09-20 22:11:44 +00:00
|
|
|
if (Buffer[CheckPrefix.size()] == ':') {
|
|
|
|
Buffer = Buffer.substr(CheckPrefix.size()+1);
|
|
|
|
} else if (Buffer.size() > CheckPrefix.size()+6 &&
|
|
|
|
memcmp(Buffer.data()+CheckPrefix.size(), "-NEXT:", 6) == 0) {
|
|
|
|
Buffer = Buffer.substr(CheckPrefix.size()+7);
|
2009-08-15 18:32:21 +00:00
|
|
|
IsCheckNext = true;
|
2009-09-20 22:35:26 +00:00
|
|
|
} else if (Buffer.size() > CheckPrefix.size()+5 &&
|
|
|
|
memcmp(Buffer.data()+CheckPrefix.size(), "-NOT:", 5) == 0) {
|
|
|
|
Buffer = Buffer.substr(CheckPrefix.size()+6);
|
|
|
|
IsCheckNot = true;
|
2009-08-15 18:32:21 +00:00
|
|
|
} else {
|
2009-09-20 22:11:44 +00:00
|
|
|
Buffer = Buffer.substr(1);
|
2009-08-15 18:00:42 +00:00
|
|
|
continue;
|
|
|
|
}
|
|
|
|
|
2009-07-08 18:44:05 +00:00
|
|
|
// Okay, we found the prefix, yay. Remember the rest of the line, but
|
|
|
|
// ignore leading and trailing whitespace.
|
2009-09-20 22:35:26 +00:00
|
|
|
Buffer = Buffer.substr(Buffer.find_first_not_of(" \t"));
|
2009-07-08 18:44:05 +00:00
|
|
|
|
|
|
|
// Scan ahead to the end of line.
|
2009-09-20 22:11:44 +00:00
|
|
|
size_t EOL = Buffer.find_first_of("\n\r");
|
|
|
|
if (EOL == StringRef::npos) EOL = Buffer.size();
|
2009-07-08 18:44:05 +00:00
|
|
|
|
|
|
|
// Ignore trailing whitespace.
|
2009-09-20 22:11:44 +00:00
|
|
|
while (EOL && (Buffer[EOL-1] == ' ' || Buffer[EOL-1] == '\t'))
|
|
|
|
--EOL;
|
2009-07-08 18:44:05 +00:00
|
|
|
|
|
|
|
// Check that there is something on the line.
|
2009-09-20 22:11:44 +00:00
|
|
|
if (EOL == 0) {
|
|
|
|
SM.PrintMessage(SMLoc::getFromPointer(Buffer.data()),
|
2009-08-15 18:00:42 +00:00
|
|
|
"found empty check string with prefix '"+CheckPrefix+":'",
|
2009-07-08 18:44:05 +00:00
|
|
|
"error");
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
2009-09-20 22:35:26 +00:00
|
|
|
StringRef PatternStr = Buffer.substr(0, EOL);
|
|
|
|
|
|
|
|
// Handle CHECK-NOT.
|
|
|
|
if (IsCheckNot) {
|
|
|
|
NotMatches.push_back(std::make_pair(SMLoc::getFromPointer(Buffer.data()),
|
|
|
|
PatternStr.str()));
|
|
|
|
Buffer = Buffer.substr(EOL);
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
|
2009-08-15 18:32:21 +00:00
|
|
|
// Verify that CHECK-NEXT lines have at least one CHECK line before them.
|
|
|
|
if (IsCheckNext && CheckStrings.empty()) {
|
|
|
|
SM.PrintMessage(SMLoc::getFromPointer(CheckPrefixStart),
|
|
|
|
"found '"+CheckPrefix+"-NEXT:' without previous '"+
|
|
|
|
CheckPrefix+ ": line", "error");
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
2009-07-08 18:44:05 +00:00
|
|
|
// Okay, add the string we captured to the output vector and move on.
|
2009-09-20 22:35:26 +00:00
|
|
|
CheckStrings.push_back(CheckString(PatternStr.str(),
|
2009-09-20 22:11:44 +00:00
|
|
|
SMLoc::getFromPointer(Buffer.data()),
|
2009-08-15 18:32:21 +00:00
|
|
|
IsCheckNext));
|
2009-09-20 22:35:26 +00:00
|
|
|
std::swap(NotMatches, CheckStrings.back().NotStrings);
|
2009-09-20 22:11:44 +00:00
|
|
|
|
|
|
|
Buffer = Buffer.substr(EOL);
|
2009-07-08 18:44:05 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
if (CheckStrings.empty()) {
|
2009-08-15 18:00:42 +00:00
|
|
|
errs() << "error: no check strings found with prefix '" << CheckPrefix
|
|
|
|
<< ":'\n";
|
2009-07-08 18:44:05 +00:00
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
2009-09-20 22:35:26 +00:00
|
|
|
if (!NotMatches.empty()) {
|
|
|
|
errs() << "error: '" << CheckPrefix
|
|
|
|
<< "-NOT:' not supported after last check line.\n";
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
2009-07-08 18:44:05 +00:00
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
2009-07-11 18:58:15 +00:00
|
|
|
// CanonicalizeCheckStrings - Replace all sequences of horizontal whitespace in
|
|
|
|
// the check strings with a single space.
|
2009-08-15 17:41:04 +00:00
|
|
|
static void CanonicalizeCheckStrings(std::vector<CheckString> &CheckStrings) {
|
2009-07-11 18:58:15 +00:00
|
|
|
for (unsigned i = 0, e = CheckStrings.size(); i != e; ++i) {
|
2009-08-15 17:41:04 +00:00
|
|
|
std::string &Str = CheckStrings[i].Str;
|
2009-07-11 18:58:15 +00:00
|
|
|
|
|
|
|
for (unsigned C = 0; C != Str.size(); ++C) {
|
|
|
|
// If C is not a horizontal whitespace, skip it.
|
|
|
|
if (Str[C] != ' ' && Str[C] != '\t')
|
|
|
|
continue;
|
|
|
|
|
|
|
|
// Replace the character with space, then remove any other space
|
|
|
|
// characters after it.
|
|
|
|
Str[C] = ' ';
|
|
|
|
|
|
|
|
while (C+1 != Str.size() &&
|
|
|
|
(Str[C+1] == ' ' || Str[C+1] == '\t'))
|
|
|
|
Str.erase(Str.begin()+C+1);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/// CanonicalizeInputFile - Remove duplicate horizontal space from the specified
|
|
|
|
/// memory buffer, free it, and return a new one.
|
|
|
|
static MemoryBuffer *CanonicalizeInputFile(MemoryBuffer *MB) {
|
2009-08-02 01:21:22 +00:00
|
|
|
SmallVector<char, 16> NewFile;
|
2009-07-11 18:58:15 +00:00
|
|
|
NewFile.reserve(MB->getBufferSize());
|
|
|
|
|
|
|
|
for (const char *Ptr = MB->getBufferStart(), *End = MB->getBufferEnd();
|
|
|
|
Ptr != End; ++Ptr) {
|
|
|
|
// If C is not a horizontal whitespace, skip it.
|
|
|
|
if (*Ptr != ' ' && *Ptr != '\t') {
|
|
|
|
NewFile.push_back(*Ptr);
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
|
|
|
|
// Otherwise, add one space and advance over neighboring space.
|
|
|
|
NewFile.push_back(' ');
|
|
|
|
while (Ptr+1 != End &&
|
|
|
|
(Ptr[1] == ' ' || Ptr[1] == '\t'))
|
|
|
|
++Ptr;
|
|
|
|
}
|
|
|
|
|
|
|
|
// Free the old buffer and return a new one.
|
|
|
|
MemoryBuffer *MB2 =
|
2009-08-02 01:21:22 +00:00
|
|
|
MemoryBuffer::getMemBufferCopy(NewFile.data(),
|
|
|
|
NewFile.data() + NewFile.size(),
|
2009-07-11 18:58:15 +00:00
|
|
|
MB->getBufferIdentifier());
|
|
|
|
|
|
|
|
delete MB;
|
|
|
|
return MB2;
|
|
|
|
}
|
|
|
|
|
2009-07-08 18:44:05 +00:00
|
|
|
|
2009-08-15 18:32:21 +00:00
|
|
|
static void PrintCheckFailed(const SourceMgr &SM, const CheckString &CheckStr,
|
2009-09-20 22:11:44 +00:00
|
|
|
StringRef Buffer) {
|
2009-08-15 18:32:21 +00:00
|
|
|
// Otherwise, we have an error, emit an error message.
|
|
|
|
SM.PrintMessage(CheckStr.Loc, "expected string not found in input",
|
|
|
|
"error");
|
|
|
|
|
|
|
|
// Print the "scanning from here" line. If the current position is at the
|
|
|
|
// end of a line, advance to the start of the next line.
|
2009-09-20 22:11:44 +00:00
|
|
|
Buffer = Buffer.substr(Buffer.find_first_not_of(" \t\n\r"));
|
2009-08-15 18:32:21 +00:00
|
|
|
|
2009-09-20 22:11:44 +00:00
|
|
|
SM.PrintMessage(SMLoc::getFromPointer(Buffer.data()), "scanning from here",
|
2009-08-15 18:32:21 +00:00
|
|
|
"note");
|
|
|
|
}
|
|
|
|
|
2009-09-20 22:42:44 +00:00
|
|
|
/// CountNumNewlinesBetween - Count the number of newlines in the specified
|
|
|
|
/// range.
|
|
|
|
static unsigned CountNumNewlinesBetween(StringRef Range) {
|
2009-08-15 18:32:21 +00:00
|
|
|
unsigned NumNewLines = 0;
|
2009-09-20 22:42:44 +00:00
|
|
|
while (1) {
|
2009-08-15 18:32:21 +00:00
|
|
|
// Scan for newline.
|
2009-09-20 22:42:44 +00:00
|
|
|
Range = Range.substr(Range.find_first_of("\n\r"));
|
|
|
|
if (Range.empty()) return NumNewLines;
|
2009-08-15 18:32:21 +00:00
|
|
|
|
|
|
|
++NumNewLines;
|
|
|
|
|
|
|
|
// Handle \n\r and \r\n as a single newline.
|
2009-09-20 22:42:44 +00:00
|
|
|
if (Range.size() > 1 &&
|
|
|
|
(Range[1] == '\n' || Range[1] == '\r') &&
|
|
|
|
(Range[0] != Range[1]))
|
|
|
|
Range = Range.substr(1);
|
|
|
|
Range = Range.substr(1);
|
2009-08-15 18:32:21 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2009-07-08 18:44:05 +00:00
|
|
|
int main(int argc, char **argv) {
|
|
|
|
sys::PrintStackTraceOnErrorSignal();
|
|
|
|
PrettyStackTraceProgram X(argc, argv);
|
|
|
|
cl::ParseCommandLineOptions(argc, argv);
|
|
|
|
|
|
|
|
SourceMgr SM;
|
|
|
|
|
|
|
|
// Read the expected strings from the check file.
|
2009-08-15 17:41:04 +00:00
|
|
|
std::vector<CheckString> CheckStrings;
|
2009-07-08 18:44:05 +00:00
|
|
|
if (ReadCheckFile(SM, CheckStrings))
|
|
|
|
return 2;
|
|
|
|
|
2009-07-11 18:58:15 +00:00
|
|
|
// Remove duplicate spaces in the check strings if requested.
|
|
|
|
if (!NoCanonicalizeWhiteSpace)
|
|
|
|
CanonicalizeCheckStrings(CheckStrings);
|
|
|
|
|
2009-07-08 18:44:05 +00:00
|
|
|
// Open the file to check and add it to SourceMgr.
|
|
|
|
std::string ErrorStr;
|
|
|
|
MemoryBuffer *F =
|
|
|
|
MemoryBuffer::getFileOrSTDIN(InputFilename.c_str(), &ErrorStr);
|
|
|
|
if (F == 0) {
|
|
|
|
errs() << "Could not open input file '" << InputFilename << "': "
|
|
|
|
<< ErrorStr << '\n';
|
|
|
|
return true;
|
|
|
|
}
|
2009-07-11 18:58:15 +00:00
|
|
|
|
|
|
|
// Remove duplicate spaces in the input file if requested.
|
|
|
|
if (!NoCanonicalizeWhiteSpace)
|
|
|
|
F = CanonicalizeInputFile(F);
|
|
|
|
|
2009-07-08 18:44:05 +00:00
|
|
|
SM.AddNewSourceBuffer(F, SMLoc());
|
|
|
|
|
|
|
|
// Check that we have all of the expected strings, in order, in the input
|
|
|
|
// file.
|
2009-09-20 22:11:44 +00:00
|
|
|
StringRef Buffer = F->getBuffer();
|
2009-07-08 18:44:05 +00:00
|
|
|
|
2009-09-20 22:35:26 +00:00
|
|
|
const char *LastMatch = Buffer.data();
|
|
|
|
|
2009-07-08 18:44:05 +00:00
|
|
|
for (unsigned StrNo = 0, e = CheckStrings.size(); StrNo != e; ++StrNo) {
|
2009-08-15 17:41:04 +00:00
|
|
|
const CheckString &CheckStr = CheckStrings[StrNo];
|
2009-07-08 18:44:05 +00:00
|
|
|
|
2009-09-20 22:11:44 +00:00
|
|
|
StringRef SearchFrom = Buffer;
|
|
|
|
|
2009-07-08 18:44:05 +00:00
|
|
|
// Find StrNo in the file.
|
2009-09-20 22:11:44 +00:00
|
|
|
Buffer = Buffer.substr(Buffer.find(CheckStr.Str));
|
2009-07-08 18:44:05 +00:00
|
|
|
|
2009-08-15 18:32:21 +00:00
|
|
|
// If we didn't find a match, reject the input.
|
2009-09-20 22:11:44 +00:00
|
|
|
if (Buffer.empty()) {
|
|
|
|
PrintCheckFailed(SM, CheckStr, SearchFrom);
|
2009-08-15 18:32:21 +00:00
|
|
|
return 1;
|
2009-07-08 18:44:05 +00:00
|
|
|
}
|
2009-09-20 22:42:44 +00:00
|
|
|
|
|
|
|
StringRef SkippedRegion(LastMatch, Buffer.data()-LastMatch);
|
|
|
|
|
2009-08-15 18:32:21 +00:00
|
|
|
// If this check is a "CHECK-NEXT", verify that the previous match was on
|
|
|
|
// the previous line (i.e. that there is one newline between them).
|
|
|
|
if (CheckStr.IsCheckNext) {
|
|
|
|
// Count the number of newlines between the previous match and this one.
|
2009-09-20 22:35:26 +00:00
|
|
|
assert(LastMatch != F->getBufferStart() &&
|
|
|
|
"CHECK-NEXT can't be the first check in a file");
|
2009-08-15 18:32:21 +00:00
|
|
|
|
2009-09-20 22:42:44 +00:00
|
|
|
unsigned NumNewLines = CountNumNewlinesBetween(SkippedRegion);
|
2009-08-15 18:32:21 +00:00
|
|
|
if (NumNewLines == 0) {
|
2009-08-16 02:22:31 +00:00
|
|
|
SM.PrintMessage(CheckStr.Loc,
|
2009-08-15 18:32:21 +00:00
|
|
|
CheckPrefix+"-NEXT: is on the same line as previous match",
|
|
|
|
"error");
|
2009-09-20 22:11:44 +00:00
|
|
|
SM.PrintMessage(SMLoc::getFromPointer(Buffer.data()),
|
2009-08-16 02:22:31 +00:00
|
|
|
"'next' match was here", "note");
|
2009-08-15 18:32:21 +00:00
|
|
|
SM.PrintMessage(SMLoc::getFromPointer(LastMatch),
|
|
|
|
"previous match was here", "note");
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (NumNewLines != 1) {
|
2009-08-16 02:22:31 +00:00
|
|
|
SM.PrintMessage(CheckStr.Loc,
|
2009-08-15 18:32:21 +00:00
|
|
|
CheckPrefix+
|
|
|
|
"-NEXT: is not on the line after the previous match",
|
|
|
|
"error");
|
2009-09-20 22:11:44 +00:00
|
|
|
SM.PrintMessage(SMLoc::getFromPointer(Buffer.data()),
|
2009-08-16 02:22:31 +00:00
|
|
|
"'next' match was here", "note");
|
2009-08-15 18:32:21 +00:00
|
|
|
SM.PrintMessage(SMLoc::getFromPointer(LastMatch),
|
|
|
|
"previous match was here", "note");
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
}
|
2009-09-20 22:35:26 +00:00
|
|
|
|
|
|
|
// If this match had "not strings", verify that they don't exist in the
|
|
|
|
// skipped region.
|
|
|
|
for (unsigned i = 0, e = CheckStr.NotStrings.size(); i != e; ++i) {
|
|
|
|
size_t Pos = SkippedRegion.find(CheckStr.NotStrings[i].second);
|
|
|
|
if (Pos == StringRef::npos) continue;
|
|
|
|
|
|
|
|
SM.PrintMessage(SMLoc::getFromPointer(LastMatch+Pos),
|
|
|
|
CheckPrefix+"-NOT: string occurred!", "error");
|
|
|
|
SM.PrintMessage(CheckStr.NotStrings[i].first,
|
|
|
|
CheckPrefix+"-NOT: pattern specified here", "note");
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
|
2009-08-15 18:32:21 +00:00
|
|
|
|
2009-09-21 02:30:42 +00:00
|
|
|
// Otherwise, everything is good. Step over the matched text and remember
|
|
|
|
// the position after the match as the end of the last match.
|
2009-09-20 22:11:44 +00:00
|
|
|
Buffer = Buffer.substr(CheckStr.Str.size());
|
2009-09-21 02:30:42 +00:00
|
|
|
LastMatch = Buffer.data();
|
2009-07-08 18:44:05 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|