Hexley Ball
NetTribute library with debug turned on in FShandler Donatien Garner -> Segundo Equipo -> this version
services/http/client/data/HTTPMap.cpp@0:281d6ff68967, 2010-11-19 (annotated)
- Committer:
- hexley
- Date:
- Fri Nov 19 01:54:45 2010 +0000
- Revision:
- 0:281d6ff68967
Who changed what in which revision?
| User | Revision | Line number | New contents of line |
|---|---|---|---|
| hexley | 0:281d6ff68967 | 1 | |
| hexley | 0:281d6ff68967 | 2 | /* |
| hexley | 0:281d6ff68967 | 3 | Copyright (c) 2010 Donatien Garnier (donatiengar [at] gmail [dot] com) |
| hexley | 0:281d6ff68967 | 4 | |
| hexley | 0:281d6ff68967 | 5 | Permission is hereby granted, free of charge, to any person obtaining a copy |
| hexley | 0:281d6ff68967 | 6 | of this software and associated documentation files (the "Software"), to deal |
| hexley | 0:281d6ff68967 | 7 | in the Software without restriction, including without limitation the rights |
| hexley | 0:281d6ff68967 | 8 | to use, copy, modify, merge, publish, distribute, sublicense, and/or sell |
| hexley | 0:281d6ff68967 | 9 | copies of the Software, and to permit persons to whom the Software is |
| hexley | 0:281d6ff68967 | 10 | furnished to do so, subject to the following conditions: |
| hexley | 0:281d6ff68967 | 11 | |
| hexley | 0:281d6ff68967 | 12 | The above copyright notice and this permission notice shall be included in |
| hexley | 0:281d6ff68967 | 13 | all copies or substantial portions of the Software. |
| hexley | 0:281d6ff68967 | 14 | |
| hexley | 0:281d6ff68967 | 15 | THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR |
| hexley | 0:281d6ff68967 | 16 | IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, |
| hexley | 0:281d6ff68967 | 17 | FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE |
| hexley | 0:281d6ff68967 | 18 | AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER |
| hexley | 0:281d6ff68967 | 19 | LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, |
| hexley | 0:281d6ff68967 | 20 | OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN |
| hexley | 0:281d6ff68967 | 21 | THE SOFTWARE. |
| hexley | 0:281d6ff68967 | 22 | */ |
| hexley | 0:281d6ff68967 | 23 | |
| hexley | 0:281d6ff68967 | 24 | #include "HTTPMap.h" |
| hexley | 0:281d6ff68967 | 25 | #include "../../util/url.h" |
| hexley | 0:281d6ff68967 | 26 | |
| hexley | 0:281d6ff68967 | 27 | //#define __DEBUG |
| hexley | 0:281d6ff68967 | 28 | #include "dbg/dbg.h" |
| hexley | 0:281d6ff68967 | 29 | |
| hexley | 0:281d6ff68967 | 30 | HTTPMap::HTTPMap(const string& keyValueSep /*= "="*/, const string& pairSep /*= "&"*/) : |
| hexley | 0:281d6ff68967 | 31 | HTTPData(), Dictionary(), m_buf(), m_len(0), m_chunked(false), m_keyValueSep(keyValueSep), m_pairSep(pairSep) |
| hexley | 0:281d6ff68967 | 32 | { |
| hexley | 0:281d6ff68967 | 33 | |
| hexley | 0:281d6ff68967 | 34 | } |
| hexley | 0:281d6ff68967 | 35 | |
| hexley | 0:281d6ff68967 | 36 | HTTPMap::~HTTPMap() |
| hexley | 0:281d6ff68967 | 37 | { |
| hexley | 0:281d6ff68967 | 38 | |
| hexley | 0:281d6ff68967 | 39 | } |
| hexley | 0:281d6ff68967 | 40 | |
| hexley | 0:281d6ff68967 | 41 | void HTTPMap::clear() |
| hexley | 0:281d6ff68967 | 42 | { |
| hexley | 0:281d6ff68967 | 43 | m_buf.clear(); |
| hexley | 0:281d6ff68967 | 44 | } |
| hexley | 0:281d6ff68967 | 45 | |
| hexley | 0:281d6ff68967 | 46 | int HTTPMap::read(char* buf, int len) |
| hexley | 0:281d6ff68967 | 47 | { |
| hexley | 0:281d6ff68967 | 48 | memcpy( (void*)buf, (void*)m_buf.data(), len ); |
| hexley | 0:281d6ff68967 | 49 | m_buf.erase(0, len); //Erase these chars |
| hexley | 0:281d6ff68967 | 50 | return len; |
| hexley | 0:281d6ff68967 | 51 | } |
| hexley | 0:281d6ff68967 | 52 | |
| hexley | 0:281d6ff68967 | 53 | int HTTPMap::write(const char* buf, int len) |
| hexley | 0:281d6ff68967 | 54 | { |
| hexley | 0:281d6ff68967 | 55 | m_buf.append( buf, len ); |
| hexley | 0:281d6ff68967 | 56 | if( ( m_chunked && !len ) || |
| hexley | 0:281d6ff68967 | 57 | ( !m_chunked && ( m_buf.length() >= m_len ) ) ) //Last chunk or EOF |
| hexley | 0:281d6ff68967 | 58 | { |
| hexley | 0:281d6ff68967 | 59 | parseString(); |
| hexley | 0:281d6ff68967 | 60 | } |
| hexley | 0:281d6ff68967 | 61 | return len; |
| hexley | 0:281d6ff68967 | 62 | } |
| hexley | 0:281d6ff68967 | 63 | |
| hexley | 0:281d6ff68967 | 64 | string HTTPMap::getDataType() //Internet media type for Content-Type header |
| hexley | 0:281d6ff68967 | 65 | { |
| hexley | 0:281d6ff68967 | 66 | return "application/x-www-form-urlencoded"; |
| hexley | 0:281d6ff68967 | 67 | } |
| hexley | 0:281d6ff68967 | 68 | |
| hexley | 0:281d6ff68967 | 69 | void HTTPMap::setDataType(const string& type) //Internet media type from Content-Type header |
| hexley | 0:281d6ff68967 | 70 | { |
| hexley | 0:281d6ff68967 | 71 | //Do not really care here |
| hexley | 0:281d6ff68967 | 72 | } |
| hexley | 0:281d6ff68967 | 73 | |
| hexley | 0:281d6ff68967 | 74 | int HTTPMap::getDataLen() //For Content-Length header |
| hexley | 0:281d6ff68967 | 75 | { |
| hexley | 0:281d6ff68967 | 76 | //This will be called before any read occurs, so let's generate our string object |
| hexley | 0:281d6ff68967 | 77 | //Generate string |
| hexley | 0:281d6ff68967 | 78 | generateString(); |
| hexley | 0:281d6ff68967 | 79 | return m_len; |
| hexley | 0:281d6ff68967 | 80 | } |
| hexley | 0:281d6ff68967 | 81 | |
| hexley | 0:281d6ff68967 | 82 | bool HTTPMap::getIsChunked() //For Transfer-Encoding header |
| hexley | 0:281d6ff68967 | 83 | { |
| hexley | 0:281d6ff68967 | 84 | return false; //We don't want to chunk this |
| hexley | 0:281d6ff68967 | 85 | } |
| hexley | 0:281d6ff68967 | 86 | |
| hexley | 0:281d6ff68967 | 87 | void HTTPMap::setIsChunked(bool chunked) //From Transfer-Encoding header |
| hexley | 0:281d6ff68967 | 88 | { |
| hexley | 0:281d6ff68967 | 89 | m_chunked = chunked; |
| hexley | 0:281d6ff68967 | 90 | } |
| hexley | 0:281d6ff68967 | 91 | |
| hexley | 0:281d6ff68967 | 92 | void HTTPMap::setDataLen(int len) //From Content-Length header, or if the transfer is chunked, next chunk length |
| hexley | 0:281d6ff68967 | 93 | { |
| hexley | 0:281d6ff68967 | 94 | m_len += len; //Useful so that we can parse string when last byte is written if not chunked |
| hexley | 0:281d6ff68967 | 95 | m_buf.reserve( m_len ); |
| hexley | 0:281d6ff68967 | 96 | } |
| hexley | 0:281d6ff68967 | 97 | |
| hexley | 0:281d6ff68967 | 98 | void HTTPMap::generateString() |
| hexley | 0:281d6ff68967 | 99 | { |
| hexley | 0:281d6ff68967 | 100 | Dictionary::iterator it; |
| hexley | 0:281d6ff68967 | 101 | bool first = true; |
| hexley | 0:281d6ff68967 | 102 | while( !Dictionary::empty() ) |
| hexley | 0:281d6ff68967 | 103 | { |
| hexley | 0:281d6ff68967 | 104 | if(!first) |
| hexley | 0:281d6ff68967 | 105 | { |
| hexley | 0:281d6ff68967 | 106 | m_buf.append( m_pairSep ); |
| hexley | 0:281d6ff68967 | 107 | } |
| hexley | 0:281d6ff68967 | 108 | else |
| hexley | 0:281d6ff68967 | 109 | { |
| hexley | 0:281d6ff68967 | 110 | first = false; |
| hexley | 0:281d6ff68967 | 111 | } |
| hexley | 0:281d6ff68967 | 112 | it = Dictionary::begin(); |
| hexley | 0:281d6ff68967 | 113 | m_buf.append( Url::encode( (*it).first ) ); |
| hexley | 0:281d6ff68967 | 114 | m_buf.append( m_keyValueSep ); |
| hexley | 0:281d6ff68967 | 115 | m_buf.append( Url::encode( (*it).second ) ); |
| hexley | 0:281d6ff68967 | 116 | Dictionary::erase(it); //Free memory as we process data |
| hexley | 0:281d6ff68967 | 117 | } |
| hexley | 0:281d6ff68967 | 118 | m_len = m_buf.length(); |
| hexley | 0:281d6ff68967 | 119 | DBG("\r\nData [len %d]:\r\n%s\r\n", m_len, m_buf.c_str()); |
| hexley | 0:281d6ff68967 | 120 | } |
| hexley | 0:281d6ff68967 | 121 | |
| hexley | 0:281d6ff68967 | 122 | void HTTPMap::parseString() |
| hexley | 0:281d6ff68967 | 123 | { |
| hexley | 0:281d6ff68967 | 124 | string key; |
| hexley | 0:281d6ff68967 | 125 | string value; |
| hexley | 0:281d6ff68967 | 126 | |
| hexley | 0:281d6ff68967 | 127 | int pos = 0; |
| hexley | 0:281d6ff68967 | 128 | |
| hexley | 0:281d6ff68967 | 129 | int key_pos; |
| hexley | 0:281d6ff68967 | 130 | int key_len; |
| hexley | 0:281d6ff68967 | 131 | |
| hexley | 0:281d6ff68967 | 132 | int value_pos; |
| hexley | 0:281d6ff68967 | 133 | int value_len; |
| hexley | 0:281d6ff68967 | 134 | |
| hexley | 0:281d6ff68967 | 135 | bool eof = false; |
| hexley | 0:281d6ff68967 | 136 | while(!eof) |
| hexley | 0:281d6ff68967 | 137 | { |
| hexley | 0:281d6ff68967 | 138 | key_pos = pos; |
| hexley | 0:281d6ff68967 | 139 | value_pos = m_buf.find(m_keyValueSep, pos); |
| hexley | 0:281d6ff68967 | 140 | if(value_pos < 0) |
| hexley | 0:281d6ff68967 | 141 | { |
| hexley | 0:281d6ff68967 | 142 | //Parse error, break |
| hexley | 0:281d6ff68967 | 143 | break; |
| hexley | 0:281d6ff68967 | 144 | } |
| hexley | 0:281d6ff68967 | 145 | |
| hexley | 0:281d6ff68967 | 146 | key_len = value_pos - key_pos; |
| hexley | 0:281d6ff68967 | 147 | |
| hexley | 0:281d6ff68967 | 148 | value_pos+= m_keyValueSep.length(); |
| hexley | 0:281d6ff68967 | 149 | |
| hexley | 0:281d6ff68967 | 150 | pos = m_buf.find( m_pairSep, value_pos ); |
| hexley | 0:281d6ff68967 | 151 | if(pos < 0) //Not found |
| hexley | 0:281d6ff68967 | 152 | { |
| hexley | 0:281d6ff68967 | 153 | pos = m_buf.length(); |
| hexley | 0:281d6ff68967 | 154 | eof = true; |
| hexley | 0:281d6ff68967 | 155 | } |
| hexley | 0:281d6ff68967 | 156 | |
| hexley | 0:281d6ff68967 | 157 | value_len = pos - value_pos; |
| hexley | 0:281d6ff68967 | 158 | |
| hexley | 0:281d6ff68967 | 159 | pos += m_pairSep.length(); |
| hexley | 0:281d6ff68967 | 160 | |
| hexley | 0:281d6ff68967 | 161 | //Append elenent |
| hexley | 0:281d6ff68967 | 162 | Dictionary::operator[]( Url::decode( m_buf.substr(key_pos, key_len) ) ) = Url::decode( m_buf.substr(value_pos, value_len) ); |
| hexley | 0:281d6ff68967 | 163 | } |
| hexley | 0:281d6ff68967 | 164 | |
| hexley | 0:281d6ff68967 | 165 | m_buf.clear(); //Free data |
| hexley | 0:281d6ff68967 | 166 | |
| hexley | 0:281d6ff68967 | 167 | } |