晋太元中,武陵人捕鱼为业。缘溪行,忘路之远近。忽逢桃花林,夹岸数百步,中无杂树,芳草鲜美,落英缤纷。渔人甚异之,复前行,欲穷其林。 林尽水源,便得一山,山有小口,仿佛若有光。便舍船,从口入。初极狭,才通人。复行数十步,豁然开朗。土地平旷,屋舍俨然,有良田、美池、桑竹之属。阡陌交通,鸡犬相闻。其中往来种作,男女衣着,悉如外人。黄发垂髫,并怡然自乐。 见渔人,乃大惊,问所从来。具答之。便要还家,设酒杀鸡作食。村中闻有此人,咸来问讯。自云先世避秦时乱,率妻子邑人来此绝境,不复出焉,遂与外人间隔。问今是何世,乃不知有汉,无论魏晋。此人一一为具言所闻,皆叹惋。余人各复延至其家,皆出酒食。停数日,辞去。此中人语云:“不足为外人道也。”(间隔 一作:隔绝) 既出,得其船,便扶向路,处处志之。及郡下,诣太守,说如此。太守即遣人随其往,寻向所志,遂迷,不复得路。 南阳刘子骥,高尚士也,闻之,欣然规往。未果,寻病终。后遂无问津者。
| DIR:/opt/cloudlinux/alt-php80/root/usr/include/php/ext/swoole/include/ |
| Current File : //opt/cloudlinux/alt-php80/root/usr/include/php/ext/swoole/include/swoole_buffer.h |
/*
+----------------------------------------------------------------------+
| Swoole |
+----------------------------------------------------------------------+
| This source file is subject to version 2.0 of the Apache license, |
| that is bundled with this package in the file LICENSE, and is |
| available through the world-wide-web at the following url: |
| http://www.apache.org/licenses/LICENSE-2.0.html |
| If you did not receive a copy of the Apache2.0 license and are unable|
| to obtain it through the world-wide-web, please send a note to |
| license@php.net so we can mail you a copy immediately. |
+----------------------------------------------------------------------+
| Author: Tianfeng Han <rango@swoole.com> |
+----------------------------------------------------------------------+
*/
#pragma once
#include <queue>
#include <sys/uio.h>
namespace swoole {
struct BufferChunk {
enum Type {
TYPE_DATA,
TYPE_SENDFILE,
TYPE_CLOSE,
};
Type type;
uint32_t length = 0;
uint32_t offset = 0;
union {
char *ptr;
void *object;
struct {
uint32_t val1;
uint32_t val2;
} data;
} value{};
uint32_t size = 0;
BufferChunk(Type type, uint32_t size);
~BufferChunk();
void (*destroy)(BufferChunk *chunk) = nullptr;
};
class Buffer {
private:
// 0: donot use chunk
uint32_t chunk_size;
uint32_t total_length = 0;
std::queue<BufferChunk *> queue_;
public:
explicit Buffer(uint32_t chunk_size);
~Buffer();
BufferChunk *alloc(BufferChunk::Type type, uint32_t size);
BufferChunk *front() {
return queue_.front();
}
void pop();
void append(const void *data, uint32_t size);
void append(const struct iovec *iov, size_t iovcnt, off_t offset);
uint32_t length() const {
return total_length;
}
size_t count() const {
return queue_.size();
}
bool empty() const {
return queue_.empty();
}
static bool empty(Buffer *buffer) {
return buffer == nullptr || buffer->queue_.empty();
}
};
} // namespace swoole
|