node/src/node_crypto_bio.cc at master · CombatCode/node · GitHub

History

390 lines (309 loc) · 8.58 KB

Raw

100

101

102

103

104

105

106

107

108

109

110

111

112

113

114

115

116

117

118

119

120

121

122

123

124

125

126

127

128

129

130

131

132

133

134

135

136

137

138

139

140

141

142

143

144

145

146

147

148

149

150

151

152

153

154

155

156

157

158

159

160

161

162

163

164

165

166

167

168

169

170

171

172

173

174

175

176

177

178

179

180

181

182

183

184

185

186

187

188

189

190

191

192

193

194

195

196

197

198

199

200

201

202

203

204

205

206

207

208

209

210

211

212

213

214

215

216

217

218

219

220

221

222

223

224

225

226

227

228

229

230

231

232

233

234

235

236

237

238

239

240

241

242

243

244

245

246

247

248

249

250

251

252

253

254

255

256

257

258

259

260

261

262

263

264

265

266

267

268

269

270

271

272

273

274

275

276

277

278

279

280

281

282

283

284

285

286

287

288

289

290

291

292

293

294

295

296

297

298

299

300

301

302

303

304

305

306

307

308

309

310

311

312

313

314

315

316

317

318

319

320

321

322

323

324

325

326

327

328

329

330

331

332

333

334

335

336

337

338

339

340

341

342

343

344

345

346

347

348

349

350

351

352

353

354

355

356

357

358

359

360

361

362

363

364

365

366

367

368

369

370

371

372

373

374

375

376

377

378

379

380

381

382

383

384

385

386

387

388

389

390

// Copyright Joyent, Inc. and other Node contributors.

// Permission is hereby granted, free of charge, to any person obtaining a

// copy of this software and associated documentation files (the

// "Software"), to deal in the Software without restriction, including

// without limitation the rights to use, copy, modify, merge, publish,

// distribute, sublicense, and/or sell copies of the Software, and to permit

// persons to whom the Software is furnished to do so, subject to the

// following conditions:

// The above copyright notice and this permission notice shall be included

// in all copies or substantial portions of the Software.

// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS

// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF

// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN

// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,

// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR

// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE

// USE OR OTHER DEALINGS IN THE SOFTWARE.

#include "node_crypto_bio.h"

#include "openssl/bio.h"

#include <string.h>

namespace node {

BIO_METHOD NodeBIO::method_ = {

BIO_TYPE_MEM,

"node.js SSL buffer",

NodeBIO::Write,

NodeBIO::Read,

NodeBIO::Puts,

NodeBIO::Gets,

NodeBIO::Ctrl,

NodeBIO::New,

NodeBIO::Free,

NULL

};

int NodeBIO::New(BIO* bio) {

bio->ptr = new NodeBIO();

// XXX Why am I doing it?!

bio->shutdown = 1;

bio->init = 1;

bio->num = -1;

return 1;

}

int NodeBIO::Free(BIO* bio) {

if (bio == NULL) return 0;

if (bio->shutdown) {

if (bio->init && bio->ptr != NULL) {

delete FromBIO(bio);

bio->ptr = NULL;

}

return 1;

}

int NodeBIO::Read(BIO* bio, char* out, int len) {

int bytes;

BIO_clear_retry_flags(bio);

bytes = FromBIO(bio)->Read(out, len);

if (bytes == 0) {

bytes = bio->num;

if (bytes != 0) {

BIO_set_retry_read(bio);

}

return bytes;

}

char* NodeBIO::Peek(size_t* size) {

*size = read_head_->write_pos_ - read_head_->read_pos_;

return read_head_->data_ + read_head_->read_pos_;

}

int NodeBIO::Write(BIO* bio, const char* data, int len) {

BIO_clear_retry_flags(bio);

FromBIO(bio)->Write(data, len);

return len;

}

int NodeBIO::Puts(BIO* bio, const char* str) {

return Write(bio, str, strlen(str));

}

int NodeBIO::Gets(BIO* bio, char* out, int size) {

NodeBIO* nbio = FromBIO(bio);

if (nbio->Length() == 0)

return 0;

int i = nbio->IndexOf('\n', size);

// Include '\n'

if (i < size) i++;

// Shift `i` a bit to NULL-terminate string later

if (size == i) i--;

// Flush read data

nbio->Read(out, i);

out[i] = 0;

return i;

}

long NodeBIO::Ctrl(BIO* bio, int cmd, long num, void* ptr) {

NodeBIO* nbio;

long ret;

nbio = FromBIO(bio);

ret = 1;

switch (cmd) {

case BIO_CTRL_RESET:

nbio->Reset();

break;

case BIO_CTRL_EOF:

ret = nbio->Length() == 0;

break;

case BIO_C_SET_BUF_MEM_EOF_RETURN:

bio->num = num;

break;

case BIO_CTRL_INFO:

ret = nbio->Length();

if (ptr != NULL)

*reinterpret_cast<void**>(ptr) = NULL;

break;

case BIO_C_SET_BUF_MEM:

assert(0 && "Can't use SET_BUF_MEM_PTR with NodeBIO");

abort();

break;

case BIO_C_GET_BUF_MEM_PTR:

assert(0 && "Can't use GET_BUF_MEM_PTR with NodeBIO");

ret = 0;

break;

case BIO_CTRL_GET_CLOSE:

ret = bio->shutdown;

break;

case BIO_CTRL_SET_CLOSE:

bio->shutdown = num;

break;

case BIO_CTRL_WPENDING:

ret = 0;

break;

case BIO_CTRL_PENDING:

ret = nbio->Length();

break;

case BIO_CTRL_DUP:

case BIO_CTRL_FLUSH:

ret = 1;

break;

case BIO_CTRL_PUSH:

case BIO_CTRL_POP:

default:

ret = 0;

break;

}

return ret;

}

size_t NodeBIO::Read(char* out, size_t size) {

size_t bytes_read = 0;

size_t expected = Length() > size ? size : Length();

size_t offset = 0;

size_t left = size;

while (bytes_read < expected) {

assert(read_head_->read_pos_ <= read_head_->write_pos_);

size_t avail = read_head_->write_pos_ - read_head_->read_pos_;

if (avail > left)

avail = left;

// Copy data

if (out != NULL)

memcpy(out + offset, read_head_->data_ + read_head_->read_pos_, avail);

read_head_->read_pos_ += avail;

// Move pointers

bytes_read += avail;

offset += avail;

left -= avail;

// Move to next buffer

if (read_head_->read_pos_ == read_head_->write_pos_) {

read_head_->read_pos_ = 0;

read_head_->write_pos_ = 0;

// But not get beyond write_head_

if (length_ != bytes_read && read_head_ != write_head_) {

read_head_ = read_head_->next_;

}

assert(expected == bytes_read);

length_ -= bytes_read;

// Free all empty buffers, but write_head's child

FreeEmpty();

return bytes_read;

}

void NodeBIO::FreeEmpty() {

Buffer* child = write_head_->next_;

if (child == write_head_ || child == read_head_)

return;

Buffer* cur = child->next_;

if (cur == write_head_ || cur == read_head_)

return;

while (cur != read_head_) {

// Skip embedded buffer

if (cur == &head_) {

cur = head_.next_;

continue;

}

assert(cur != write_head_);

assert(cur->write_pos_ == cur->read_pos_);

Buffer* next = cur->next_;

child->next_ = next;

delete cur;

cur = next;

}

size_t NodeBIO::IndexOf(char delim, size_t limit) {

size_t bytes_read = 0;

size_t max = Length() > limit ? limit : Length();

size_t left = limit;

Buffer* current = read_head_;

while (bytes_read < max) {

assert(current->read_pos_ <= current->write_pos_);

size_t avail = current->write_pos_ - current->read_pos_;

if (avail > left)

avail = left;

// Walk through data

char* tmp = current->data_ + current->read_pos_;

size_t off = 0;

while (off < avail && *tmp != delim) {

off++;

tmp++;

}

// Move pointers

bytes_read += off;

left -= off;

// Found `delim`

if (off != avail) {

return bytes_read;

}

// Move to next buffer

if (current->read_pos_ + avail == kBufferLength) {

current = current->next_;

}

assert(max == bytes_read);

return max;

}

void NodeBIO::Write(const char* data, size_t size) {

size_t offset = 0;

size_t left = size;

while (left > 0) {

size_t to_write = left;

assert(write_head_->write_pos_ <= kBufferLength);

size_t avail = kBufferLength - write_head_->write_pos_;

if (to_write > avail)

to_write = avail;

// Copy data

memcpy(write_head_->data_ + write_head_->write_pos_,

data + offset,

to_write);

// Move pointers

left -= to_write;

offset += to_write;

length_ += to_write;

write_head_->write_pos_ += to_write;

assert(write_head_->write_pos_ <= kBufferLength);

// Go to next buffer if there still are some bytes to write

if (left != 0) {

assert(write_head_->write_pos_ == kBufferLength);

TryAllocateForWrite();

write_head_ = write_head_->next_;

}

assert(left == 0);

}

char* NodeBIO::PeekWritable(size_t* size) {

size_t available = kBufferLength - write_head_->write_pos_;

if (*size != 0 && available > *size)

available = *size;

else

*size = available;

return write_head_->data_ + write_head_->write_pos_;

}

void NodeBIO::Commit(size_t size) {

write_head_->write_pos_ += size;

length_ += size;

assert(write_head_->write_pos_ <= kBufferLength);

// Allocate new buffer if write head is full,

// and there're no other place to go

TryAllocateForWrite();

if (write_head_->write_pos_ == kBufferLength)

write_head_ = write_head_->next_;

}

void NodeBIO::TryAllocateForWrite() {

// If write head is full, next buffer is either read head or not empty.

if (write_head_->write_pos_ == kBufferLength &&

(write_head_->next_ == read_head_ ||

write_head_->next_->write_pos_ != 0)) {

Buffer* next = new Buffer();

next->next_ = write_head_->next_;

write_head_->next_ = next;

}

void NodeBIO::Reset() {

while (read_head_->read_pos_ != read_head_->write_pos_) {

assert(read_head_->write_pos_ > read_head_->read_pos_);

length_ -= read_head_->write_pos_ - read_head_->read_pos_;

read_head_->write_pos_ = 0;

read_head_->read_pos_ = 0;

read_head_ = read_head_->next_;

}

write_head_ = read_head_;

assert(length_ == 0);

}

NodeBIO::~NodeBIO() {

Buffer* current = head_.next_;

while (current != &head_) {

Buffer* next = current->next_;

delete current;

current = next;

}

read_head_ = NULL;

write_head_ = NULL;

}

} // namespace node

node/src/node_crypto_bio.cc at master · CombatCode/node · GitHub

Expand file tree

Breadcrumbs

node_crypto_bio.cc

Latest commit

History

Breadcrumbs

node_crypto_bio.cc

File metadata and controls