-
Notifications
You must be signed in to change notification settings - Fork 5.1k
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
move http parseRequest to HttpContext class
- Loading branch information
1 parent
90a5866
commit c245ae7
Showing
5 changed files
with
131 additions
and
125 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,117 @@ | ||
// Copyright 2010, Shuo Chen. All rights reserved. | ||
// http://code.google.com/p/muduo/ | ||
// | ||
// Use of this source code is governed by a BSD-style license | ||
// that can be found in the License file. | ||
|
||
// Author: Shuo Chen (chenshuo at chenshuo dot com) | ||
// | ||
|
||
#include <muduo/net/Buffer.h> | ||
#include <muduo/net/http/HttpContext.h> | ||
|
||
using namespace muduo; | ||
using namespace muduo::net; | ||
|
||
bool HttpContext::processRequestLine(const char* begin, const char* end) | ||
{ | ||
bool succeed = false; | ||
const char* start = begin; | ||
const char* space = std::find(start, end, ' '); | ||
if (space != end && request_.setMethod(start, space)) | ||
{ | ||
start = space+1; | ||
space = std::find(start, end, ' '); | ||
if (space != end) | ||
{ | ||
const char* question = std::find(start, space, '?'); | ||
if (question != space) | ||
{ | ||
request_.setPath(start, question); | ||
request_.setQuery(question, space); | ||
} | ||
else | ||
{ | ||
request_.setPath(start, space); | ||
} | ||
start = space+1; | ||
succeed = end-start == 8 && std::equal(start, end-1, "HTTP/1."); | ||
if (succeed) | ||
{ | ||
if (*(end-1) == '1') | ||
{ | ||
request_.setVersion(HttpRequest::kHttp11); | ||
} | ||
else if (*(end-1) == '0') | ||
{ | ||
request_.setVersion(HttpRequest::kHttp10); | ||
} | ||
else | ||
{ | ||
succeed = false; | ||
} | ||
} | ||
} | ||
} | ||
return succeed; | ||
} | ||
|
||
// return false if any error | ||
bool HttpContext::parseRequest(Buffer* buf, Timestamp receiveTime) | ||
{ | ||
bool ok = true; | ||
bool hasMore = true; | ||
while (hasMore) | ||
{ | ||
if (expectRequestLine()) | ||
{ | ||
const char* crlf = buf->findCRLF(); | ||
if (crlf) | ||
{ | ||
ok = processRequestLine(buf->peek(), crlf); | ||
if (ok) | ||
{ | ||
request_.setReceiveTime(receiveTime); | ||
buf->retrieveUntil(crlf + 2); | ||
receiveRequestLine(); | ||
} | ||
else | ||
{ | ||
hasMore = false; | ||
} | ||
} | ||
else | ||
{ | ||
hasMore = false; | ||
} | ||
} | ||
else if (expectHeaders()) | ||
{ | ||
const char* crlf = buf->findCRLF(); | ||
if (crlf) | ||
{ | ||
const char* colon = std::find(buf->peek(), crlf, ':'); | ||
if (colon != crlf) | ||
{ | ||
request_.addHeader(buf->peek(), colon, crlf); | ||
} | ||
else | ||
{ | ||
// empty line, end of header | ||
receiveHeaders(); | ||
hasMore = !gotAll(); | ||
} | ||
buf->retrieveUntil(crlf + 2); | ||
} | ||
else | ||
{ | ||
hasMore = false; | ||
} | ||
} | ||
else if (expectBody()) | ||
{ | ||
// FIXME: | ||
} | ||
} | ||
return ok; | ||
} |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters