├── LICENSE ├── compile.sh ├── pd_define.h ├── pd_list.h ├── pd_log.c ├── pd_log.h ├── pd_uthread.c ├── pd_uthread.h └── test_uthread.c /LICENSE: -------------------------------------------------------------------------------- 1 | Apache License 2 | Version 2.0, January 2004 3 | http://www.apache.org/licenses/ 4 | 5 | TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION 6 | 7 | 1. Definitions. 8 | 9 | "License" shall mean the terms and conditions for use, reproduction, 10 | and distribution as defined by Sections 1 through 9 of this document. 11 | 12 | "Licensor" shall mean the copyright owner or entity authorized by 13 | the copyright owner that is granting the License. 14 | 15 | "Legal Entity" shall mean the union of the acting entity and all 16 | other entities that control, are controlled by, or are under common 17 | control with that entity. For the purposes of this definition, 18 | "control" means (i) the power, direct or indirect, to cause the 19 | direction or management of such entity, whether by contract or 20 | otherwise, or (ii) ownership of fifty percent (50%) or more of the 21 | outstanding shares, or (iii) beneficial ownership of such entity. 22 | 23 | "You" (or "Your") shall mean an individual or Legal Entity 24 | exercising permissions granted by this License. 25 | 26 | "Source" form shall mean the preferred form for making modifications, 27 | including but not limited to software source code, documentation 28 | source, and configuration files. 29 | 30 | "Object" form shall mean any form resulting from mechanical 31 | transformation or translation of a Source form, including but 32 | not limited to compiled object code, generated documentation, 33 | and conversions to other media types. 34 | 35 | "Work" shall mean the work of authorship, whether in Source or 36 | Object form, made available under the License, as indicated by a 37 | copyright notice that is included in or attached to the work 38 | (an example is provided in the Appendix below). 39 | 40 | "Derivative Works" shall mean any work, whether in Source or Object 41 | form, that is based on (or derived from) the Work and for which the 42 | editorial revisions, annotations, elaborations, or other modifications 43 | represent, as a whole, an original work of authorship. For the purposes 44 | of this License, Derivative Works shall not include works that remain 45 | separable from, or merely link (or bind by name) to the interfaces of, 46 | the Work and Derivative Works thereof. 47 | 48 | "Contribution" shall mean any work of authorship, including 49 | the original version of the Work and any modifications or additions 50 | to that Work or Derivative Works thereof, that is intentionally 51 | submitted to Licensor for inclusion in the Work by the copyright owner 52 | or by an individual or Legal Entity authorized to submit on behalf of 53 | the copyright owner. For the purposes of this definition, "submitted" 54 | means any form of electronic, verbal, or written communication sent 55 | to the Licensor or its representatives, including but not limited to 56 | communication on electronic mailing lists, source code control systems, 57 | and issue tracking systems that are managed by, or on behalf of, the 58 | Licensor for the purpose of discussing and improving the Work, but 59 | excluding communication that is conspicuously marked or otherwise 60 | designated in writing by the copyright owner as "Not a Contribution." 61 | 62 | "Contributor" shall mean Licensor and any individual or Legal Entity 63 | on behalf of whom a Contribution has been received by Licensor and 64 | subsequently incorporated within the Work. 65 | 66 | 2. Grant of Copyright License. Subject to the terms and conditions of 67 | this License, each Contributor hereby grants to You a perpetual, 68 | worldwide, non-exclusive, no-charge, royalty-free, irrevocable 69 | copyright license to reproduce, prepare Derivative Works of, 70 | publicly display, publicly perform, sublicense, and distribute the 71 | Work and such Derivative Works in Source or Object form. 72 | 73 | 3. Grant of Patent License. Subject to the terms and conditions of 74 | this License, each Contributor hereby grants to You a perpetual, 75 | worldwide, non-exclusive, no-charge, royalty-free, irrevocable 76 | (except as stated in this section) patent license to make, have made, 77 | use, offer to sell, sell, import, and otherwise transfer the Work, 78 | where such license applies only to those patent claims licensable 79 | by such Contributor that are necessarily infringed by their 80 | Contribution(s) alone or by combination of their Contribution(s) 81 | with the Work to which such Contribution(s) was submitted. If You 82 | institute patent litigation against any entity (including a 83 | cross-claim or counterclaim in a lawsuit) alleging that the Work 84 | or a Contribution incorporated within the Work constitutes direct 85 | or contributory patent infringement, then any patent licenses 86 | granted to You under this License for that Work shall terminate 87 | as of the date such litigation is filed. 88 | 89 | 4. Redistribution. You may reproduce and distribute copies of the 90 | Work or Derivative Works thereof in any medium, with or without 91 | modifications, and in Source or Object form, provided that You 92 | meet the following conditions: 93 | 94 | (a) You must give any other recipients of the Work or 95 | Derivative Works a copy of this License; and 96 | 97 | (b) You must cause any modified files to carry prominent notices 98 | stating that You changed the files; and 99 | 100 | (c) You must retain, in the Source form of any Derivative Works 101 | that You distribute, all copyright, patent, trademark, and 102 | attribution notices from the Source form of the Work, 103 | excluding those notices that do not pertain to any part of 104 | the Derivative Works; and 105 | 106 | (d) If the Work includes a "NOTICE" text file as part of its 107 | distribution, then any Derivative Works that You distribute must 108 | include a readable copy of the attribution notices contained 109 | within such NOTICE file, excluding those notices that do not 110 | pertain to any part of the Derivative Works, in at least one 111 | of the following places: within a NOTICE text file distributed 112 | as part of the Derivative Works; within the Source form or 113 | documentation, if provided along with the Derivative Works; or, 114 | within a display generated by the Derivative Works, if and 115 | wherever such third-party notices normally appear. The contents 116 | of the NOTICE file are for informational purposes only and 117 | do not modify the License. You may add Your own attribution 118 | notices within Derivative Works that You distribute, alongside 119 | or as an addendum to the NOTICE text from the Work, provided 120 | that such additional attribution notices cannot be construed 121 | as modifying the License. 122 | 123 | You may add Your own copyright statement to Your modifications and 124 | may provide additional or different license terms and conditions 125 | for use, reproduction, or distribution of Your modifications, or 126 | for any such Derivative Works as a whole, provided Your use, 127 | reproduction, and distribution of the Work otherwise complies with 128 | the conditions stated in this License. 129 | 130 | 5. Submission of Contributions. Unless You explicitly state otherwise, 131 | any Contribution intentionally submitted for inclusion in the Work 132 | by You to the Licensor shall be under the terms and conditions of 133 | this License, without any additional terms or conditions. 134 | Notwithstanding the above, nothing herein shall supersede or modify 135 | the terms of any separate license agreement you may have executed 136 | with Licensor regarding such Contributions. 137 | 138 | 6. Trademarks. This License does not grant permission to use the trade 139 | names, trademarks, service marks, or product names of the Licensor, 140 | except as required for reasonable and customary use in describing the 141 | origin of the Work and reproducing the content of the NOTICE file. 142 | 143 | 7. Disclaimer of Warranty. Unless required by applicable law or 144 | agreed to in writing, Licensor provides the Work (and each 145 | Contributor provides its Contributions) on an "AS IS" BASIS, 146 | WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or 147 | implied, including, without limitation, any warranties or conditions 148 | of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A 149 | PARTICULAR PURPOSE. You are solely responsible for determining the 150 | appropriateness of using or redistributing the Work and assume any 151 | risks associated with Your exercise of permissions under this License. 152 | 153 | 8. Limitation of Liability. In no event and under no legal theory, 154 | whether in tort (including negligence), contract, or otherwise, 155 | unless required by applicable law (such as deliberate and grossly 156 | negligent acts) or agreed to in writing, shall any Contributor be 157 | liable to You for damages, including any direct, indirect, special, 158 | incidental, or consequential damages of any character arising as a 159 | result of this License or out of the use or inability to use the 160 | Work (including but not limited to damages for loss of goodwill, 161 | work stoppage, computer failure or malfunction, or any and all 162 | other commercial damages or losses), even if such Contributor 163 | has been advised of the possibility of such damages. 164 | 165 | 9. Accepting Warranty or Additional Liability. While redistributing 166 | the Work or Derivative Works thereof, You may choose to offer, 167 | and charge a fee for, acceptance of support, warranty, indemnity, 168 | or other liability obligations and/or rights consistent with this 169 | License. However, in accepting such obligations, You may act only 170 | on Your own behalf and on Your sole responsibility, not on behalf 171 | of any other Contributor, and only if You agree to indemnify, 172 | defend, and hold each Contributor harmless for any liability 173 | incurred by, or claims asserted against, such Contributor by reason 174 | of your accepting any such warranty or additional liability. 175 | 176 | END OF TERMS AND CONDITIONS 177 | 178 | APPENDIX: How to apply the Apache License to your work. 179 | 180 | To apply the Apache License to your work, attach the following 181 | boilerplate notice, with the fields enclosed by brackets "{}" 182 | replaced with your own identifying information. (Don't include 183 | the brackets!) The text should be enclosed in the appropriate 184 | comment syntax for the file format. We also recommend that a 185 | file or class name and description of purpose be included on the 186 | same "printed page" as the copyright notice for easier 187 | identification within third-party archives. 188 | 189 | Copyright {yyyy} {name of copyright owner} 190 | 191 | Licensed under the Apache License, Version 2.0 (the "License"); 192 | you may not use this file except in compliance with the License. 193 | You may obtain a copy of the License at 194 | 195 | http://www.apache.org/licenses/LICENSE-2.0 196 | 197 | Unless required by applicable law or agreed to in writing, software 198 | distributed under the License is distributed on an "AS IS" BASIS, 199 | WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. 200 | See the License for the specific language governing permissions and 201 | limitations under the License. 202 | 203 | -------------------------------------------------------------------------------- /compile.sh: -------------------------------------------------------------------------------- 1 | #!/bin/sh 2 | 3 | includes="./" 4 | 5 | libs="-lpthread" 6 | 7 | objs=" 8 | pd_uthread 9 | pd_log 10 | " 11 | 12 | mains=" 13 | test_uthread 14 | " 15 | 16 | opt="" 17 | opt="$opt -O3" 18 | 19 | ########## 20 | compile() 21 | { 22 | echo $@ 23 | `$@` 24 | if [ $? -ne 0 ] 25 | then 26 | exit -1 27 | fi 28 | } 29 | 30 | ########## 31 | modules="" 32 | for o in $objs 33 | do 34 | compile "gcc -g $opt -c $o.c -I $includes" 35 | modules=`echo $modules $o.o` 36 | done 37 | 38 | ########## 39 | for m in $mains 40 | do 41 | compile "gcc -g $opt -c $m.c -I $includes" 42 | compile "gcc -g $opt -o $m $m.o $modules $libs" 43 | done 44 | 45 | -------------------------------------------------------------------------------- /pd_define.h: -------------------------------------------------------------------------------- 1 | #ifndef PD_DEFINE_H_ 2 | #define PD_DEFINE_H_ 3 | 4 | #define _GNU_SOURCE 5 | #include 6 | #include 7 | #include 8 | 9 | #ifdef __cplusplus 10 | # define PD_CPP_START extern "C" { 11 | # define PD_CPP_END } 12 | #else 13 | # define PD_CPP_START 14 | # define PD_CPP_END 15 | #endif 16 | 17 | #define GETTID() syscall(__NR_gettid) 18 | 19 | #define PD_UTHREAD_STACK_SIZE 65536 20 | 21 | #endif 22 | 23 | -------------------------------------------------------------------------------- /pd_list.h: -------------------------------------------------------------------------------- 1 | #ifndef PD_LIST_H_ 2 | #define PD_LIST_H_ 3 | 4 | #define LIST_PUSH_BACK(head, tail, node) \ 5 | do \ 6 | { \ 7 | if (NULL == tail) \ 8 | { \ 9 | head = node; \ 10 | tail = node; \ 11 | } \ 12 | else \ 13 | { \ 14 | node->prev = tail; \ 15 | node->next = NULL; \ 16 | \ 17 | tail->next = node; \ 18 | tail = node; \ 19 | } \ 20 | } while (0) 21 | 22 | #define LIST_PUSH_FRONT(head, tail, node) \ 23 | do \ 24 | { \ 25 | if (NULL == head) \ 26 | { \ 27 | head = node; \ 28 | tail = node; \ 29 | } \ 30 | else \ 31 | { \ 32 | node->next = head; \ 33 | node->prev = NULL; \ 34 | \ 35 | head->prev = node; \ 36 | head = node; \ 37 | } \ 38 | } while (0) 39 | 40 | #define LIST_POP_FRONT(head, tail, node) \ 41 | do \ 42 | { \ 43 | node = head; \ 44 | head = head->next; \ 45 | if (NULL != head) \ 46 | { \ 47 | head->prev = NULL; \ 48 | } \ 49 | else \ 50 | { \ 51 | tail = NULL; \ 52 | } \ 53 | node->prev = NULL; \ 54 | node->next = NULL; \ 55 | } while (0) 56 | 57 | #define LIST_ERASE_NODE(head, tail, node) \ 58 | do \ 59 | { \ 60 | if (NULL == node->prev) \ 61 | { \ 62 | head = node->next; \ 63 | if (NULL != head) \ 64 | { \ 65 | head->prev = NULL; \ 66 | } \ 67 | } \ 68 | else \ 69 | { \ 70 | node->prev->next = node->next; \ 71 | } \ 72 | if (NULL == node->next) \ 73 | { \ 74 | tail = node->prev; \ 75 | if (NULL != tail) \ 76 | { \ 77 | tail->next = NULL; \ 78 | } \ 79 | } \ 80 | else \ 81 | { \ 82 | node->next->prev = node->prev; \ 83 | } \ 84 | node->prev = NULL; \ 85 | node->next = NULL; \ 86 | } while (0) 87 | 88 | #endif 89 | 90 | -------------------------------------------------------------------------------- /pd_log.c: -------------------------------------------------------------------------------- 1 | #include "pd_log.h" 2 | 3 | static int *pd_log_glevel() 4 | { 5 | static int glevel = INFO; 6 | return &glevel; 7 | } 8 | 9 | //////////////////////////////////////////////////////////////////////////////////////////////////// 10 | 11 | const char* pd_log_print_array(char* buf, int64_t len, int64_t* array, int size) 12 | { 13 | int64_t pos = 0; 14 | int64_t count = 0; 15 | int64_t i = 0; 16 | for(i = 0; i < size; i++) 17 | { 18 | count = snprintf(buf + pos, len - pos, "0x%lx ", array[i]); 19 | if (count >= 0 && pos + count + 1 < len) 20 | { 21 | pos += count; 22 | } 23 | else 24 | { 25 | PD_LOG(WARN, "buf not enough, len=%ld, array_size=%d", len, size); 26 | break; 27 | } 28 | } 29 | buf[pos + 1] = 0; 30 | return buf; 31 | } 32 | 33 | const char* pd_log_print_bt() 34 | { 35 | static __thread void *addrs[100]; 36 | static __thread char buf[1024]; 37 | int size = backtrace(addrs, 100); 38 | return pd_log_print_array(buf, sizeof(buf), (int64_t*)addrs, size); 39 | } 40 | 41 | void pd_log_set_glevel(const int level) 42 | { 43 | *pd_log_glevel() = level; 44 | } 45 | 46 | int pd_log_get_glevel() 47 | { 48 | return *pd_log_glevel(); 49 | } 50 | 51 | -------------------------------------------------------------------------------- /pd_log.h: -------------------------------------------------------------------------------- 1 | #ifndef PD_LOG_H_ 2 | #define PD_LOG_H_ 3 | 4 | #include 5 | #include 6 | #include 7 | #include 8 | #include "pd_define.h" 9 | 10 | #define FATAL 0 11 | #define WARN 1 12 | #define INFO 2 13 | #define TRACE 3 14 | #define DEBUG 4 15 | 16 | #define PD_FATAL "FATAL" 17 | #define PD_WARN "WARN" 18 | #define PD_INFO "INFO" 19 | #define PD_TRACE "TRACE" 20 | #define PD_DEBUG "DEBUG" 21 | 22 | #define PD_LOG(_loglevel_, _fmt_, args...) \ 23 | do \ 24 | { \ 25 | if (pd_log_get_glevel() >= _loglevel_) \ 26 | { \ 27 | struct timeval log_tm;\ 28 | gettimeofday(&log_tm, NULL);\ 29 | fprintf(stderr, \ 30 | "[%s] [%s][%s][%ld] %d [%s][%d][%s] " _fmt_ "\n", \ 31 | PD_##_loglevel_, \ 32 | __DATE__, __TIME__, log_tm.tv_usec, \ 33 | (int)GETTID(), __FILE__, __LINE__, __FUNCTION__, \ 34 | ##args); \ 35 | } \ 36 | } while (0) \ 37 | 38 | #define PD_BACKTRACE(_fmt_, args...) \ 39 | do \ 40 | { \ 41 | PD_LOG(INFO, _fmt_ " BackTrace Start: %s", ##args, pd_log_print_bt()); \ 42 | } while (0) 43 | 44 | extern const char* pd_log_print_array(char* buf, int64_t len, int64_t* array, int size); 45 | 46 | extern const char* pd_log_print_bt(); 47 | 48 | extern void pd_log_set_glevel(const int level); 49 | 50 | extern int pd_log_get_glevel(); 51 | 52 | #endif 53 | 54 | -------------------------------------------------------------------------------- /pd_uthread.c: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | #include 5 | #include "pd_uthread.h" 6 | #include "pd_log.h" 7 | #include "pd_list.h" 8 | 9 | struct PdUThreadMgr; 10 | 11 | struct PdUThreadNode 12 | { 13 | ucontext_t context; 14 | int inited; 15 | jmp_buf jmpbuf; 16 | pd_uthread_func_pt uthread_func; 17 | void *uthread_arg; 18 | struct PdUThreadMgr *host; 19 | struct PdUThreadNode *prev; 20 | struct PdUThreadNode *next; 21 | }; 22 | 23 | struct PdUThreadMgr 24 | { 25 | ucontext_t context; 26 | jmp_buf jmpbuf; 27 | struct PdUThreadNode *waiting_list_head; 28 | struct PdUThreadNode *waiting_list_tail; 29 | struct PdUThreadNode *ready_list_head; 30 | struct PdUThreadNode *ready_list_tail; 31 | }; 32 | 33 | static void pd_uthread_wrapper(struct PdUThreadMgr *uthread_mgr, struct PdUThreadNode *uthread_node) 34 | { 35 | uthread_node->uthread_func(uthread_node, uthread_node->uthread_arg); 36 | pd_uthread_exit(uthread_node); 37 | } 38 | 39 | //////////////////////////////////////////////////////////////////////////////////////////////////// 40 | 41 | struct PdUThreadMgr *pd_uthread_init_mgr() 42 | { 43 | struct PdUThreadMgr *uthread_mgr = (struct PdUThreadMgr*)malloc(sizeof(struct PdUThreadMgr)); 44 | if (NULL != uthread_mgr) 45 | { 46 | uthread_mgr->context.uc_stack.ss_sp = malloc(PD_UTHREAD_STACK_SIZE); 47 | uthread_mgr->context.uc_stack.ss_size = PD_UTHREAD_STACK_SIZE; 48 | uthread_mgr->waiting_list_head = NULL; 49 | uthread_mgr->waiting_list_tail = NULL; 50 | uthread_mgr->ready_list_head = NULL; 51 | uthread_mgr->ready_list_tail = NULL; 52 | } 53 | return uthread_mgr; 54 | } 55 | 56 | extern void pd_uthread_destroy_mgr(struct PdUThreadMgr *uthread_mgr) 57 | { 58 | if (NULL != uthread_mgr) 59 | { 60 | if (NULL != uthread_mgr->context.uc_stack.ss_sp) 61 | { 62 | free(uthread_mgr->context.uc_stack.ss_sp); 63 | } 64 | free(uthread_mgr); 65 | } 66 | } 67 | 68 | struct PdUThreadNode *pd_uthread_init_node(struct PdUThreadMgr *uthread_mgr, pd_uthread_func_pt uthread_func, void *uthread_arg) 69 | { 70 | struct PdUThreadNode *uthread_node = (struct PdUThreadNode*)malloc(sizeof(struct PdUThreadNode)); 71 | if (NULL != uthread_node) 72 | { 73 | uthread_node->context.uc_stack.ss_sp = malloc(PD_UTHREAD_STACK_SIZE); 74 | uthread_node->context.uc_stack.ss_size = PD_UTHREAD_STACK_SIZE; 75 | uthread_node->uthread_func = uthread_func; 76 | uthread_node->uthread_arg = uthread_arg; 77 | uthread_node->host = uthread_mgr; 78 | uthread_node->prev = NULL; 79 | uthread_node->next = NULL; 80 | 81 | uthread_node->inited = 0; 82 | 83 | LIST_PUSH_BACK(uthread_mgr->ready_list_head, uthread_mgr->ready_list_tail, uthread_node); 84 | 85 | getcontext(&uthread_node->context); 86 | makecontext(&uthread_node->context, (void(*)(void))pd_uthread_wrapper, 2, uthread_mgr, uthread_node); 87 | } 88 | return uthread_node; 89 | } 90 | 91 | void pd_uthread_destroy_node(struct PdUThreadNode *uthread_node) 92 | { 93 | if (NULL != uthread_node) 94 | { 95 | if (NULL != uthread_node->context.uc_stack.ss_sp) 96 | { 97 | free(uthread_node->context.uc_stack.ss_sp); 98 | } 99 | free(uthread_node); 100 | } 101 | } 102 | 103 | //////////////////////////////////////////////////////////////////////////////////////////////////// 104 | 105 | void pd_uthread_schedule(struct PdUThreadMgr *uthread_mgr) 106 | { 107 | while (NULL != uthread_mgr->ready_list_head) 108 | { 109 | struct PdUThreadNode *curr_node = NULL; 110 | LIST_POP_FRONT(uthread_mgr->ready_list_head, uthread_mgr->ready_list_tail, curr_node); 111 | 112 | PD_LOG(DEBUG, "schedule node=%p", curr_node); 113 | if (0 == _setjmp(uthread_mgr->jmpbuf)) 114 | { 115 | if (!curr_node->inited) 116 | { 117 | curr_node->inited = 1; 118 | swapcontext(&uthread_mgr->context, &curr_node->context); 119 | } 120 | else 121 | { 122 | _longjmp(curr_node->jmpbuf, 1); 123 | } 124 | } 125 | } 126 | } 127 | 128 | void pd_uthread_yield(struct PdUThreadNode *uthread_node, const int ready) 129 | { 130 | PD_LOG(DEBUG, "swith to scheduler"); 131 | struct PdUThreadMgr *uthread_mgr = uthread_node->host; 132 | if (ready) 133 | { 134 | LIST_PUSH_BACK(uthread_mgr->ready_list_head, uthread_mgr->ready_list_tail, uthread_node); 135 | } 136 | else 137 | { 138 | //LIST_PUSH_BACK(uthread_mgr->waiting_list_head, uthread_mgr->waiting_list_tail, uthread_node); 139 | } 140 | //swapcontext(&uthread_node->context, &uthread_mgr->context); 141 | if (0 == _setjmp(uthread_node->jmpbuf)) 142 | { 143 | _longjmp(uthread_mgr->jmpbuf, 1); 144 | } 145 | } 146 | 147 | void pd_uthread_wakeup(struct PdUThreadNode *uthread_node) 148 | { 149 | struct PdUThreadMgr *uthread_mgr = uthread_node->host; 150 | //LIST_ERASE_NODE(uthread_mgr->waiting_list_head, uthread_mgr->waiting_list_tail, uthread_node); 151 | LIST_PUSH_FRONT(uthread_mgr->ready_list_head, uthread_mgr->ready_list_tail, uthread_node); 152 | } 153 | 154 | void pd_uthread_exit(struct PdUThreadNode *uthread_node) 155 | { 156 | struct PdUThreadMgr *uthread_mgr = uthread_node->host; 157 | //swapcontext(&uthread_node->context, &uthread_mgr->context); 158 | if (0 == _setjmp(uthread_node->jmpbuf)) 159 | { 160 | _longjmp(uthread_mgr->jmpbuf, 1); 161 | } 162 | } 163 | 164 | -------------------------------------------------------------------------------- /pd_uthread.h: -------------------------------------------------------------------------------- 1 | #ifndef PD_UTHREAD_H_ 2 | #define PD_UTHREAD_H_ 3 | 4 | #include "pd_define.h" 5 | 6 | PD_CPP_START 7 | 8 | struct PdUThreadMgr; 9 | struct PdUThreadNode; 10 | 11 | typedef void *(*pd_uthread_func_pt) (struct PdUThreadNode*, void*); 12 | 13 | //////////////////////////////////////////////////////////////////////////////////////////////////// 14 | 15 | extern struct PdUThreadMgr *pd_uthread_init_mgr(); 16 | 17 | extern void pd_uthread_destroy_mgr(struct PdUThreadMgr *uthread_mgr); 18 | 19 | extern struct PdUThreadNode *pd_uthread_init_node(struct PdUThreadMgr *uthread_mgr, pd_uthread_func_pt uthread_func, void *uthread_arg); 20 | 21 | extern void pd_uthread_destroy_node(struct PdUThreadNode *uthread_node); 22 | 23 | //////////////////////////////////////////////////////////////////////////////////////////////////// 24 | 25 | extern void pd_uthread_schedule(struct PdUThreadMgr *uthread_mgr); 26 | 27 | extern void pd_uthread_yield(struct PdUThreadNode *uthread_node, const int ready); 28 | 29 | extern void pd_uthread_wakeup(struct PdUThreadNode *uthread_node); 30 | 31 | extern void pd_uthread_exit(struct PdUThreadNode *uthread_node); 32 | 33 | PD_CPP_END 34 | 35 | #endif 36 | 37 | -------------------------------------------------------------------------------- /test_uthread.c: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | #include "pd_uthread.h" 5 | #include "pd_log.h" 6 | 7 | void *uthread_func(struct PdUThreadNode *uthread_node, void *arg) 8 | { 9 | int64_t ut_num = (int64_t)arg; 10 | 11 | PD_LOG(INFO, "[%ld] uthread_func start", ut_num); 12 | 13 | PD_LOG(INFO, "[%ld] uthread_func step1", ut_num); 14 | pd_uthread_yield(uthread_node, 1); 15 | 16 | PD_LOG(INFO, "[%ld] uthread_func step2", ut_num); 17 | pd_uthread_yield(uthread_node, 1); 18 | 19 | PD_LOG(INFO, "[%ld] uthread_func step3", ut_num); 20 | pd_uthread_yield(uthread_node, 1); 21 | 22 | PD_LOG(INFO, "[%ld] uthread_func end", ut_num); 23 | } 24 | 25 | int main() 26 | { 27 | const int64_t uthread_num = 4; 28 | struct PdUThreadMgr *uthread_mgr; 29 | struct PdUThreadNode *uthread_node[uthread_num]; 30 | 31 | int64_t i = 0; 32 | uthread_mgr = pd_uthread_init_mgr(); 33 | for (i = 0; i < uthread_num; i++) 34 | { 35 | uthread_node[i] = pd_uthread_init_node(uthread_mgr, uthread_func, (void*)i); 36 | } 37 | 38 | pd_uthread_schedule(uthread_mgr); 39 | 40 | for (i = 0; i < uthread_num; i++) 41 | { 42 | pd_uthread_destroy_node(uthread_node[i]); 43 | } 44 | pd_uthread_destroy_mgr(uthread_mgr); 45 | } 46 | 47 | --------------------------------------------------------------------------------