This repository has been archived on 2020-05-25. You can view files and clone it, but cannot push or open issues or pull requests.
tdlib-fork/tdutils/td/utils/find_boundary.cpp
levlam eb9ead582f Remove unneded includes of td/utils/loggging.h.
GitOrigin-RevId: 82a3b506dba5c9d5267dc0e2504a7093a7fa87db
2019-02-12 23:48:16 +03:00

52 lines
1.4 KiB
C++

//
// Copyright Aliaksei Levin (levlam@telegram.org), Arseny Smirnov (arseny30@gmail.com) 2014-2019
//
// Distributed under the Boost Software License, Version 1.0. (See accompanying
// file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
//
#include "td/utils/find_boundary.h"
#include <cstring>
namespace td {
bool find_boundary(ChainBufferReader range, Slice boundary, size_t &already_read) {
range.advance(already_read);
const int MAX_BOUNDARY_LENGTH = 70;
CHECK(boundary.size() <= MAX_BOUNDARY_LENGTH + 4);
while (!range.empty()) {
Slice ready = range.prepare_read();
if (ready[0] == boundary[0]) {
if (range.size() < boundary.size()) {
return false;
}
auto save_range = range.clone();
char x[MAX_BOUNDARY_LENGTH + 4];
range.advance(boundary.size(), {x, sizeof(x)});
if (std::memcmp(x, boundary.data(), boundary.size()) == 0) {
return true;
}
// not a boundary, restoring previous state and skip one symbol
range = std::move(save_range);
range.advance(1);
already_read++;
} else {
const char *ptr = static_cast<const char *>(std::memchr(ready.data(), boundary[0], ready.size()));
size_t shift;
if (ptr == nullptr) {
shift = ready.size();
} else {
shift = ptr - ready.data();
}
already_read += shift;
range.advance(shift);
}
}
return false;
}
} // namespace td