PHP 8.2.30
Preview: swoole_coroutine_channel.h Size: 4.18 KB
//opt/cloudlinux/alt-php81/root/usr/include/php/ext/swoole/include/swoole_coroutine_channel.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@swoole.com so we can mail you a copy immediately.            |
  +----------------------------------------------------------------------+
  | Author: Tianfeng Han  <rango@swoole.com>                             |
  |         Twosee  <twose@qq.com>                                       |
  +----------------------------------------------------------------------+
*/

#pragma once

#include "swoole.h"
#include "swoole_coroutine.h"

#include <sys/stat.h>

#include <iostream>
#include <string>
#include <list>
#include <queue>

namespace swoole {
namespace coroutine {
//-------------------------------------------------------------------------------
class Channel {
  public:
    enum Opcode {
        PRODUCER = 1,
        CONSUMER = 2,
    };

    enum ErrorCode {
        ERROR_OK = 0,
        ERROR_TIMEOUT = -1,
        ERROR_CLOSED = -2,
        ERROR_CANCELED = -3,
    };

    struct TimeoutMessage {
        Channel *chan;
        Opcode type;
        Coroutine *co;
        bool error;
        TimerNode *timer;
    };

    void *pop(double timeout = -1);
    bool push(void *data, double timeout = -1);
    bool close();

    Channel(size_t _capacity = 1) : capacity(_capacity) {}

    ~Channel() {
        if (!producer_queue.empty()) {
            swoole_error_log(SW_LOG_WARNING,
                             SW_ERROR_CO_HAS_BEEN_DISCARDED,
                             "channel is destroyed, %zu producers will be discarded",
                             producer_queue.size());
        }
        if (!consumer_queue.empty()) {
            swoole_error_log(SW_LOG_WARNING,
                             SW_ERROR_CO_HAS_BEEN_DISCARDED,
                             "channel is destroyed, %zu consumers will be discarded",
                             consumer_queue.size());
        }
    }

    bool is_closed() {
        return closed;
    }

    bool is_empty() {
        return data_queue.size() == 0;
    }

    bool is_full() {
        return data_queue.size() == capacity;
    }

    size_t length() {
        return data_queue.size();
    }

    size_t consumer_num() {
        return consumer_queue.size();
    }

    size_t producer_num() {
        return producer_queue.size();
    }

    void *pop_data() {
        if (data_queue.size() == 0) {
            return nullptr;
        }
        void *data = data_queue.front();
        data_queue.pop();
        return data;
    }

    int get_error() {
        return error_;
    }

  protected:
    size_t capacity = 1;
    bool closed = false;
    int error_ = 0;
    std::list<Coroutine *> producer_queue;
    std::list<Coroutine *> consumer_queue;
    std::queue<void *> data_queue;

    static void timer_callback(Timer *timer, TimerNode *tnode);

    void yield(enum Opcode type);

    void consumer_remove(Coroutine *co) {
        consumer_queue.remove(co);
    }

    void producer_remove(Coroutine *co) {
        producer_queue.remove(co);
    }

    Coroutine *pop_coroutine(enum Opcode type) {
        Coroutine *co;
        if (type == PRODUCER) {
            co = producer_queue.front();
            producer_queue.pop_front();
            swoole_trace_log(SW_TRACE_CHANNEL, "resume producer cid=%ld", co->get_cid());
        } else  // if (type == CONSUMER)
        {
            co = consumer_queue.front();
            consumer_queue.pop_front();
            swoole_trace_log(SW_TRACE_CHANNEL, "resume consumer cid=%ld", co->get_cid());
        }
        return co;
    }
};
//-------------------------------------------------------------------------------
}  // namespace coroutine
}  // namespace swoole

Directory Contents

Dirs: 0 × Files: 52

Name Size Perms Modified Actions
22.85 KB lrw-r--r-- 2025-03-12 13:36:10
Edit Download
3.39 KB lrw-r--r-- 2025-03-12 13:36:10
Edit Download
1.76 KB lrw-r--r-- 2025-03-12 13:36:10
Edit Download
3.70 KB lrw-r--r-- 2025-03-12 13:36:10
Edit Download
2.15 KB lrw-r--r-- 2025-03-12 13:36:10
Edit Download
1.29 KB lrw-r--r-- 2025-03-12 13:36:10
Edit Download
2.28 KB lrw-r--r-- 2025-03-12 13:36:10
Edit Download
2.34 KB lrw-r--r-- 2025-03-12 13:36:10
Edit Download
8.41 KB lrw-r--r-- 2025-03-12 13:36:10
Edit Download
8.84 KB lrw-r--r-- 2025-03-12 13:36:11
Edit Download
8.96 KB lrw-r--r-- 2025-03-12 13:36:11
Edit Download
4.18 KB lrw-r--r-- 2025-03-12 13:36:11
Edit Download
2.59 KB lrw-r--r-- 2025-03-12 13:36:11
Edit Download
4.90 KB lrw-r--r-- 2025-03-12 13:36:11
Edit Download
18.85 KB lrw-r--r-- 2025-03-12 13:36:11
Edit Download
3.48 KB lrw-r--r-- 2025-03-12 13:36:11
Edit Download
2.19 KB lrw-r--r-- 2025-03-12 13:36:10
Edit Download
2.41 KB lrw-r--r-- 2025-03-12 13:36:11
Edit Download
5.85 KB lrw-r--r-- 2025-03-12 13:36:11
Edit Download
4.09 KB lrw-r--r-- 2025-03-12 13:36:11
Edit Download
2.86 KB lrw-r--r-- 2025-03-12 13:36:11
Edit Download
9.69 KB lrw-r--r-- 2025-03-12 13:36:11
Edit Download
1.79 KB lrw-r--r-- 2025-03-12 13:36:11
Edit Download
6.99 KB lrw-r--r-- 2025-03-12 13:36:11
Edit Download
8.38 KB lrw-r--r-- 2025-03-12 13:36:11
Edit Download
2.64 KB lrw-r--r-- 2025-03-12 13:36:12
Edit Download
15.72 KB lrw-r--r-- 2025-03-12 13:36:12
Edit Download
3.17 KB lrw-r--r-- 2025-03-12 13:36:12
Edit Download
2.75 KB lrw-r--r-- 2025-03-12 13:36:12
Edit Download
5.53 KB lrw-r--r-- 2025-03-12 13:36:12
Edit Download
1.44 KB lrw-r--r-- 2025-03-12 13:36:12
Edit Download
2.18 KB lrw-r--r-- 2025-03-12 13:36:12
Edit Download
1.92 KB lrw-r--r-- 2025-03-12 13:36:12
Edit Download
2.64 KB lrw-r--r-- 2025-03-12 13:36:12
Edit Download
8.88 KB lrw-r--r-- 2025-03-12 13:36:12
Edit Download
5.32 KB lrw-r--r-- 2025-03-12 13:36:12
Edit Download
2.14 KB lrw-r--r-- 2025-03-12 13:36:12
Edit Download
11.25 KB lrw-r--r-- 2025-03-12 13:36:12
Edit Download
2.09 KB lrw-r--r-- 2025-03-12 13:36:12
Edit Download
39.62 KB lrw-r--r-- 2025-03-12 13:36:12
Edit Download
1.68 KB lrw-r--r-- 2025-03-12 13:36:13
Edit Download
17.61 KB lrw-r--r-- 2025-03-12 13:36:13
Edit Download
2.23 KB lrw-r--r-- 2025-03-12 13:36:13
Edit Download
4.94 KB lrw-r--r-- 2025-03-12 13:36:13
Edit Download
4.70 KB lrw-r--r-- 2025-03-12 13:36:13
Edit Download
8.06 KB lrw-r--r-- 2025-03-12 13:36:13
Edit Download
7.35 KB lrw-r--r-- 2025-03-12 13:36:13
Edit Download
4.05 KB lrw-r--r-- 2025-03-12 13:36:13
Edit Download
5.58 KB lrw-r--r-- 2025-03-12 13:36:13
Edit Download
2.21 KB lrw-r--r-- 2025-03-12 13:36:13
Edit Download
4.53 KB lrw-r--r-- 2025-03-12 13:36:13
Edit Download
2.48 KB lrw-r--r-- 2025-03-12 13:36:13
Edit Download

If ZipArchive is unavailable, a .tar will be created (no compression).