C语言实现用户态线程库案例-6ren

C语言实现用户态线程库案例

转载作者：qq735679552 更新时间：2022-09-28 22:32:09

CFSDN坚持开源创造价值，我们致力于搭建一个资源共享平台，让每一个IT人在这里找到属于你的精彩世界.

这篇CFSDN的博客文章C语言实现用户态线程库案例由作者收集整理，如果你对这篇文章有兴趣，记得点赞哟.

轮子年年有人造，我们也来凑热闹，参考协程实现，大概有以下几种方法:

1）利用setjmp,longjmp 。

2）利用ucontext接口函数。

3）汇编。

（线程无非就是多了个抢占功能，由定时器触发，而非自愿让出运行权限）。

因为我写的时候还没看到其他帖子，如果看到了，铁定会用最直观的ucontext接口写的（注意，在macOSX中已经标注为废除，头文件得换做sys/ucontext.h），结果就是我用了汇编来写，但是尽量不用汇编来写整个switch_to调度函数（这样有个明显的坏处，那就是用gas/nasm的标准汇编格式写的函数在macOSX下不能编译通过，这个与系统自带的编译工具有关），而用经量少的内嵌汇编来写。switch_to函数参考的是minix操作系统中任务切换函数实现的，用软件时钟器每隔1s发信号以激发switch_to函数切换任务。下面直接贴代码了，对外提供了类似pthread的接口（只有两个，分别是threadCreate和threadJoin）。现在的代码还非常的buggy，只能安全地支持在线程函数里头纯计算，其他的行为非常可能引发bus error和segmentation fault。（要更加严谨地研究用户态线程库，请去看gnu pth的实现代码）。

thread.h 。

 
    ? 
   
         #pragma once 
        
         #include < 
         stdio.h 
         > 
        
         #include < 
         stdlib.h 
         > 
        
         #include < 
         unistd.h 
         > 
        
         #include < 
         string.h 
         > 
        
         #include < 
         signal.h 
         > 
        
         #include < 
         assert.h 
         > 
        
         #include < 
         time.h 
         > 
        
         #define JMP(r)  asm volatile \ 
        
         (  "pushl %3\n\t" \ 
        
         "popfd\n\t" \ 
        
         "movl %2, %%ebp\n\t" \ 
        
         "movl %0, %%esp\n\t" \ 
        
         "jmp *%1\n\t" \ 
        
         : \ 
        
         : "m"(r._esp),"m"(r._eip),"m"(r._ebp),"m"(r._eflags) \ 
        
         : \ 
        
         ) 
        
         #define SAVE()         asm volatile \ 
        
         (  "movl %%eax, %0\n\t" \ 
        
         "movl %%ecx, %1\n\t" \ 
        
         "movl %%edx, %2\n\t" \ 
        
         "movl %%ebx, %3\n\t" \ 
        
         "movl %%esp, %4\n\t" \ 
        
         "movl %%ebp, %5\n\t" \ 
        
         "movl %%esi, %6\n\t" \ 
        
         "movl %%edi, %7\n\t" \ 
        
         "pushfd\n\t" \ 
        
         "movl (%%esp), %%eax\n\t" \ 
        
         "movl %%eax, %8\n\t" \ 
        
         "popfd\n\t" \ 
        
         : "=m"(_eax),"=m"(_ecx),"=m"(_edx),"=m"(_ebx) \ 
        
         ,"=m"(_esp),"=m"(_ebp) \ 
        
         , "=m"(_esi),"=m"(_edi),"=m"(_eflags) \ 
        
         : \ 
        
         : "%eax" \ 
        
         ) 
        
         #define RESTORE(r)     asm volatile \ 
        
         (  "movl %0, %%eax\n\t" \ 
        
         "movl %1, %%ecx\n\t" \ 
        
         "movl %1, %%edx\n\t" \ 
        
         "movl %3, %%ebx\n\t" \ 
        
         "movl %4, %%esi\n\t" \ 
        
         "movl %5, %%edi\n\t" \ 
        
         : \ 
        
         :"m"(r._eax),"m"(r._ecx),"m"(r._edx),"m"(r._ebx) \ 
        
         , "m"(r._esi),"m"(r._edi) \ 
        
         ) 
        
         typedef void Func(int); 
        
         /* __timer struct is the real Timer struct we use 
        
         * id is unique to each timer 
        
         * intersec is the inteval seconds to each signal forwarding the this Timer 
        
         * sigactor is the handler for this Timer 
        
         * next is a internal member used for linked list 
        
         */ 
        
         struct __timer 
        
         { 
        
         void *next; 
        
         unsigned int sec; 
        
         unsigned int intersec; 
        
         int id; 
        
         Func *sigactor; 
        
         }; 
        
         /* struct alarm is ugly for the compatibility with early struct. 
        
         * I should have used unnamed member instead of __inner. 
        
         */ 
        
         typedef struct alarm *Timer; 
        
         struct alarm 
        
         { 
        
         union{ 
        
         struct 
        
         { 
        
         Timer next; 
        
         unsigned int sec; 
        
         }; 
        
         struct __timer __inner; 
        
         };  
        
         }; 
        
         typedef struct list *Header; 
        
         struct list 
        
         { 
        
         Timer head; 
        
         }; 
        
         typedef struct __thread_table_regs Regs; 
        
         struct __thread_table_regs 
        
         { 
        
         int _edi; 
        
         int _esi; 
        
         int _ebp; 
        
         int _esp; 
        
         int _ebx; 
        
         int _edx; 
        
         int _ecx; 
        
         int _eax; 
        
         int _eip; 
        
         int _eflags; 
        
         }; 
        
         typedef struct __ez_thread Thread_t; 
        
         struct __ez_thread 
        
         { 
        
         Regs regs; 
        
         int tid; 
        
         sigset_t sigmask; 
        
         unsigned int priority; 
        
         int tick; 
        
         int state; 
        
         int errno; 
        
         unsigned int stacktop; 
        
         unsigned int stacksize; 
        
         void *stack; 
        
         void *retval; 
        
         volatile int __reenter; 
        
         }; 
        
         typedef struct __pnode pNode; 
        
         struct __pnode 
        
         { 
        
         pNode *next; 
        
         pNode *prev; 
        
         Thread_t *data; 
        
         }; 
        
         typedef struct __loopcursor Cursor; 
        
         struct __loopcursor 
        
         { 
        
         int total; 
        
         pNode *current; 
        
         }; 
        
         typedef struct __stack *Stack_t; 
        
         struct __stack 
        
         { 
        
         int __pad[4096]; 
        
         }; 
        
         void switch_to(int); 
        
         extern Header hdr_ptr; 
        
         extern Cursor live; 
        
         extern Cursor dead; 
        
         extern Thread_t pmain;

thread.c 。

 
    ? 
   
         /* MIT License 
        
         Copyright (c) 2017 Yuandong-Chen 
        
         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 "thread.h" 
        
         /************************* Alarm facility *************************/ 
        
         struct list linkedlist; 
        
         Header hdr_ptr = &linkedlist; 
        
         Timer mallocTimer(int id, Func *actor,unsigned int sec, unsigned int interval) 
        
         { 
        
         Timer ret = (Timer)malloc(sizeof(struct alarm)); 
        
         assert(ret); 
        
         ret->__inner.id = id; 
        
         ret->__inner.sigactor = actor; 
        
         ret->__inner.intersec = interval; 
        
         ret->sec = sec; 
        
         return ret; 
        
         } 
        
         /* find Timer in linked list which id is id. 
        
         * return: return NULL if not found, -1 if it's header link,  
        
         * otherwise prev which is the previous Timer member to this Timer 
        
         */ 
        
         Timer findTimerPrev(Header h, int id) 
        
         { 
        
         assert(h); 
        
         if(h->head == NULL) 
        
         return NULL; 
        
         Timer t = h->head; 
        
         Timer prev = NULL; 
        
         while(t) 
        
         { 
        
         if(t->__inner.id == id){ 
        
         if(prev == NULL) 
        
         return (Timer)-1; 
        
         else 
        
         return prev; 
        
         } 
        
         prev = t; 
        
         t = t->next; 
        
         } 
        
         return NULL; 
        
         } 
        
         /* delete Timer in linked list. 
        
         * return: nothing, we ensure this t is deleted in the linked list. 
        
         */ 
        
         void delTimer(Header h, Timer t) 
        
         { 
        
         assert(h); 
        
         assert(t); 
        
         Timer prevtodel = findTimerPrev(h, t->__inner.id); 
        
         unsigned int base = 0; 
        
         if(prevtodel) 
        
         { 
        
         if(prevtodel == (Timer)-1){ 
        
         unsigned int res = (h->head)->sec; 
        
         if(res != 0) 
        
         { 
        
         base = res; 
        
         } 
        
         else 
        
         { 
        
         kill(getpid(),SIGALRM); 
        
         return; 
        
         } 
        
         h->head = (h->head)->next; 
        
         Timer tmp = (h->head); 
        
         while(tmp){ 
        
         tmp->sec += base; 
        
         tmp = tmp->next; 
        
         } 
        
         return; 
        
         } 
        
         else 
        
         { 
        
         base = (prevtodel->next)->sec; 
        
         prevtodel->next = (prevtodel->next)->next; 
        
         Timer tmp = (prevtodel->next); 
        
         while(tmp){ 
        
         tmp->sec += base; 
        
         tmp = tmp->next; 
        
         } 
        
         return; 
        
         } 
        
         } 
        
         return; 
        
         } 
        
         /* append Timer in appropriate place in linked list. 
        
         * the appropriate place means all timers in linked list are arranged  
        
         * according their next alarm seconds. 
        
         * The algorithm we use here is that the real left alarm seconds for this Timer  
        
         * is the sum of all the sec member in Timer in linked list prev to this Timer 
        
         * plus its sec member. For example, we add 3 Timers to the linked list, 
        
         * whose sec are 4, 3, 2 respectively. Then the linked list looks like: 
        
         * 2 (real sec = 2) --> 1 (real sec = 2+1 = 3) --> 1 (real sec = 2+1+1 = 4) 
        
         * The advantage is obviously, we dont need to remember how many seconds passed. 
        
         * We always fetch the header to respond the alarm signal and set next alarm sec  
        
         * as the next timer in the linked list. (The real situation is a little bit more  
        
         * complex, for example if upcoming timers' sec equals 0, we need to call their 
        
         * handler right away all together in a certain sequence. If its intersec is not  
        
         * zero, we need to append it to the linked list again as quick as possible) 
        
         * note: delTimer also address this problem. If we delete any Timer, we need to  
        
         * recalculate the secs after this timer in the linked list.(simply to add sec to  
        
         * the next timer and delete this timer node) 
        
         * return: only 0 if success, otherwise the hole process failed. 
        
         */ 
        
         int appendTimer(Header h, Timer t) 
        
         { 
        
         assert(h); 
        
         assert(t); 
        
         delTimer(h, t); 
        
         if(h->head == NULL) 
        
         { 
        
         h->head = t; 
        
         return 0; 
        
         } 
        
         Timer tmp = h->head; 
        
         Timer prev = NULL; 
        
         unsigned int prevbase = 0; 
        
         unsigned int base = 0; 
        
         while(tmp) 
        
         { 
        
         prevbase = base; 
        
         base += tmp->sec; 
        
         if(t->sec <  
         base 
         ){ 
        
         break; 
        
         } 
        
         else{ 
        
         prev 
         =  
         tmp 
         ; 
        
         tmp 
         = tmp->next; 
        
         } 
        
         } 
        
         if(prev == NULL) 
        
         { 
        
         (h->head)->sec -= t->sec; 
        
         t->next = h->head; 
        
         h->head = t; 
        
         return 0; 
        
         } 
        
         if(tmp == NULL) 
        
         t->sec -=base; 
        
         else 
        
         t->sec -=prevbase; 
        
         prev->next = t; 
        
         t->next = tmp; 
        
         if(tmp) 
        
         tmp->sec -= t->sec; 
        
         return 0; 
        
         } 
        
         /* pop header timer in linked list. 
        
         * return: its hander 
        
         */ 
        
         Func* popTimer(Header h) 
        
         { 
        
         assert(h); 
        
         if(h->head == NULL) 
        
         return (Func *)-1; 
        
         Func *ret = (h->head)->__inner.sigactor; 
        
         Timer todel = h->head; 
        
         h->head = (h->head)->next; 
        
         // if its intersec greater than 0, we append it right away to the linked list 
        
         if(todel->__inner.intersec > 0) 
        
         { 
        
         todel->sec = todel->__inner.intersec; 
        
         appendTimer(h, todel); 
        
         } 
        
         return ret; 
        
         } 
        
         void printList(Header h) 
        
         { 
        
         assert(h); 
        
         if(h->head == NULL) 
        
         return; 
        
         Timer tmp = h->head; 
        
         while(tmp) 
        
         { 
        
         printf("timer[%d] = %u saved %u\n", tmp->__inner.id, tmp->sec, tmp->__inner.intersec); 
        
         tmp = tmp->next; 
        
         } 
        
         } 
        
         /* it's the real signal handler responding to every SIGALRM. 
        
         */ 
        
         void sig_alarm_internal(int signo) 
        
         {  
        
         void funcWrapper(int signo, Func *func); 
        
         if(hdr_ptr->head == NULL) 
        
         return; 
        
         Func *recv; 
        
         if((recv = popTimer(hdr_ptr)) == (Func *)-1){ 
        
         funcWrapper(SIGALRM, recv); 
        
         }  
        
         else 
        
         { 
        
         // signal ourself if next timer's sec = 0 
        
         if(hdr_ptr->head){ 
        
         ((hdr_ptr->head)->sec > 0?alarm((hdr_ptr->head)->sec):kill(getpid(), SIGALRM)); 
        
         } 
        
         funcWrapper(SIGALRM, recv); 
        
         } 
        
         } 
        
         /* Alarm function simulates native alarm function. 
        
         * what if SIGALRM arrives when process is running in Alarm? 
        
         * we just block the signal since there is no slow function in Alarm, 
        
         * sig_alarm_internal will for sure address the signal very soon. 
        
         */ 
        
         unsigned int Alarm(Header h, Timer mtimer) 
        
         { 
        
         sigset_t mask; 
        
         sigset_t old; 
        
         sigemptyset(&mask); 
        
         sigaddset(&mask, SIGALRM); 
        
         sigprocmask(SIG_BLOCK, &mask, &old); 
        
         unsigned int res = 0; 
        
         Timer t; 
        
         if((t = findTimerPrev(h, mtimer->__inner.id)) == NULL) 
        
         goto LL; 
        
         t = h->head; 
        
         while(t) 
        
         { 
        
         res += t->sec; // it's not precise, we should use alarm(0) for the first sec. 
        
         // However, its simple enough to implement.  
        
         if(t->__inner.id == mtimer->__inner.id) 
        
         break; 
        
         t = t->next; 
        
         } 
        
         LL: 
        
         if(mtimer->sec == 0) 
        
         { 
        
         delTimer(h, mtimer); 
        
         sigprocmask(SIG_SETMASK, &old, NULL); 
        
         return res; 
        
         } 
        
         appendTimer(h, mtimer); 
        
         if(mtimer->__inner.id == (h->head)->__inner.id) 
        
         ((h->head)->sec > 0?alarm((h->head)->sec):kill(getpid(), SIGALRM)); 
        
         sigprocmask(SIG_SETMASK, &old, NULL); 
        
         return res; 
        
         } 
        
         void initTimer() 
        
         { 
        
         struct sigaction act; 
        
         act.sa_handler = sig_alarm_internal; 
        
         act.sa_flags = SA_RESTART|SA_NODEFER; 
        
         sigemptyset(&act.sa_mask); 
        
         sigaction(SIGALRM, &act, NULL); 
        
         } 
        
         void funcWrapper(int signo, Func *func) 
        
         { 
        
         sigset_t mask; 
        
         sigset_t old; 
        
         sigemptyset(&mask); 
        
         sigaddset(&mask, SIGALRM); 
        
         sigprocmask(SIG_UNBLOCK, &mask, &old); 
        
         func(signo); 
        
         sigprocmask(SIG_SETMASK, &old, NULL); 
        
         } 
        
         /************************* Thread facility *************************/ 
        
         Cursor live; 
        
         Cursor dead; 
        
         Thread_t pmain; 
        
         void initCursor(Cursor *cur) 
        
         { 
        
         cur->total = 0; 
        
         cur->current = NULL; 
        
         } 
        
         Thread_t *findThread(Cursor *cur, int tid) 
        
         { 
        
         sigset_t mask,old; 
        
         sigemptyset(&mask); 
        
         sigaddset(&mask, SIGALRM); 
        
         sigprocmask(SIG_BLOCK, &mask, &old); 
        
         int counter = cur->total; 
        
         if(counter == 0){ 
        
         sigprocmask(SIG_SETMASK, &old, NULL); 
        
         return NULL; 
        
         } 
        
         int i; 
        
         pNode *tmp = cur->current; 
        
         for (int i = 0; i <  
         counter 
         ; ++i) 
        
         { 
        
         if((tmp->data)->tid == tid){ 
        
         sigprocmask(SIG_SETMASK, &old, NULL); 
        
         return tmp->data; 
        
         } 
        
         tmp = tmp->next; 
        
         } 
        
         sigprocmask(SIG_SETMASK, &old, NULL); 
        
         return NULL; 
        
         } 
        
         int appendThread(Cursor *cur, Thread_t *pth) 
        
         { 
        
         sigset_t mask,old; 
        
         sigemptyset(&mask); 
        
         sigaddset(&mask, SIGALRM); 
        
         sigprocmask(SIG_BLOCK, &mask, &old); 
        
         if(cur->total == 0) 
        
         { 
        
         //note this never freed for simple implementation 
        
         cur->current = (pNode *)malloc(sizeof(pNode)); 
        
         assert(cur->current); 
        
         (cur->current)->data = pth; 
        
         (cur->current)->prev = cur->current; 
        
         (cur->current)->next = cur->current; 
        
         cur->total++; 
        
         sigprocmask(SIG_SETMASK, &old, NULL); 
        
         return 0; 
        
         } 
        
         else 
        
         { 
        
         #define MAXTHREADS 5 
        
         if(cur->total > MAXTHREADS) 
        
         { 
        
         assert((cur->total == MAXTHREADS)); 
        
         sigprocmask(SIG_SETMASK, &old, NULL); 
        
         return -1; 
        
         } 
        
         //freed at threadJoin for simple implementation 
        
         pNode *tmp = malloc(sizeof(pNode)); 
        
         assert(tmp); 
        
         tmp->data = pth; 
        
         tmp->prev = cur->current; 
        
         tmp->next = (cur->current)->next; 
        
         ((cur->current)->next)->prev = tmp; 
        
         (cur->current)->next = tmp; 
        
         cur->total++; 
        
         sigprocmask(SIG_SETMASK, &old, NULL); 
        
         return 0; 
        
         } 
        
         } 
        
         pNode *deleteThread(Cursor *cur, int tid) 
        
         { 
        
         sigset_t mask,old; 
        
         sigemptyset(&mask); 
        
         sigaddset(&mask, SIGALRM); 
        
         sigprocmask(SIG_BLOCK, &mask, &old); 
        
         int counter = cur->total; 
        
         int i; 
        
         pNode *tmp = cur->current; 
        
         for (int i = 0; i <  
         counter 
         ; ++i) 
        
         { 
        
         if((tmp->data)->tid == tid){ 
        
         (tmp->prev)->next = tmp->next; 
        
         (tmp->next)->prev = tmp->prev; 
        
         if(tmp == cur->current) 
        
         { 
        
         cur->current = cur->current->next; 
        
         }  
        
         //free(tmp); 
        
         cur->total--; 
        
         assert(cur->total); 
        
         sigprocmask(SIG_SETMASK, &old, NULL); 
        
         return tmp; 
        
         } 
        
         tmp = tmp->next; 
        
         } 
        
         sigprocmask(SIG_SETMASK, &old, NULL); 
        
         return NULL; 
        
         } 
        
         void printThread(Thread_t *pth) 
        
         { 
        
         printf("pth tid: %d\n", pth->tid); 
        
         printf("pth stack top: %x\n", pth->stacktop); 
        
         printf("pth stack size: %u\n", pth->stacksize); 
        
         printf("pth state: %d\n", pth->state); 
        
         printf("pth errno: %d\n", pth->errno); 
        
         printf("pth retval: %p\n", pth->retval); 
        
         printf("pth sigmask: %u\n", pth->sigmask); 
        
         printf("pth priority: %d\n", pth->priority); 
        
         printf("pth tick: %d\n", pth->tick); 
        
         printf("EFLAGS: %x\t", pth->regs._eflags); 
        
         printf("EIP: %x\t", pth->regs._eip); 
        
         printf("EAX: %x\t", pth->regs._eax); 
        
         printf("ECX: %x\n", pth->regs._ecx); 
        
         printf("EDX: %x\t", pth->regs._edx); 
        
         printf("EBX: %x\t", pth->regs._ebx); 
        
         printf("ESP: %x\t", pth->regs._esp); 
        
         printf("EBP: %x\n", pth->regs._ebp); 
        
         printf("ESI: %x\t", pth->regs._esi); 
        
         printf("EDI: %x\n", pth->regs._edi); 
        
         } 
        
         void printLoop(Cursor *cur) 
        
         { 
        
         int count = 0; 
        
         pNode *tmp = cur->current; 
        
         assert(tmp); 
        
         do{ 
        
         printThread(tmp->data); 
        
         tmp = tmp->next; 
        
         count ++;  
        
         }while(tmp != cur->current); 
        
         printf("real total: %d\n", count); 
        
         printf("total record:%d\n", cur->total); 
        
         assert(count == cur->total); 
        
         } 
        
         int fetchTID() 
        
         { 
        
         static int tid; 
        
         return ++tid; 
        
         } 
        
         void real_entry(Thread_t *pth, void *(*start_rtn)(void *), void* args) 
        
         { 
        
         //printf("in real entry: %p\n", start_rtn); 
        
         pth->retval = (*start_rtn)(args); 
        
         //deleteThread(&live, pth->tid); 
        
         /* some clean job here */ 
        
         //free(pth->stack); 
        
         //pth->stack = NULL; 
        
         //pth->stacktop = 0; 
        
         //pth->stacksize = 0; 
        
         #define DETACHED 1 
        
         deleteThread(&live, pth->tid); 
        
         appendThread(&dead, pth); 
        
         if(pth->state == DETACHED) 
        
         threadJoin(pth, NULL); 
        
         switch_to(-1); 
        
         } 
        
         int threadCreat(Thread_t **pth, void *(*start_rtn)(void *), void *arg) 
        
         { 
        
         sigset_t mask,old; 
        
         sigemptyset(&mask); 
        
         sigaddset(&mask, SIGALRM); 
        
         sigprocmask(SIG_BLOCK, &mask, &old); 
        
         //freed at threadJoin for simple implementation 
        
         *pth = malloc(sizeof(Thread_t)); 
        
         #define PTHREAD_STACK_MIN 4096 
        
         //freed at threadJoin for simple implementation 
        
         (*pth)->stack = malloc(PTHREAD_STACK_MIN); 
        
         assert((*pth)->stack); 
        
         (*pth)->stacktop = (((int)(*pth)->stack + PTHREAD_STACK_MIN)&(0xfffff000)); 
        
         (*pth)->stacksize = PTHREAD_STACK_MIN - (((int)(*pth)->stack + PTHREAD_STACK_MIN) - (*pth)->stacktop); 
        
         (*pth)->state = 0; // 0 JOINABLE 1 DETACHED 
        
         (*pth)->priority = 1; //one seconds 
        
         (*pth)->tick = (*pth)->priority; 
        
         (*pth)->tid = fetchTID(); 
        
         sigprocmask(0,NULL,&((*pth)->sigmask)); 
        
         /* set params */ 
        
         void *dest = (*pth)->stacktop - 12; 
        
         memcpy(dest, pth, 4); 
        
         dest += 4; 
        
         memcpy(dest, &start_rtn, 4); 
        
         dest += 4; 
        
         memcpy(dest, &arg, 4); 
        
         (*pth)->regs._eip = &real_entry; 
        
         (*pth)->regs._esp = (*pth)->stacktop - 16; 
        
         (*pth)->regs._edi = 0; 
        
         (*pth)->regs._esi = 0; 
        
         (*pth)->regs._ebp = 0; 
        
         (*pth)->regs._eax = 0; 
        
         (*pth)->regs._ebx = 0; 
        
         (*pth)->regs._ecx = 0; 
        
         (*pth)->regs._edx = 0; 
        
         (*pth)->regs._eflags = 0; 
        
         appendThread(&live, (*pth)); 
        
         sigprocmask(SIG_SETMASK, &old, NULL); 
        
         return 0; 
        
         } 
        
         int threadJoin(Thread_t *pth, void **rval_ptr) 
        
         { 
        
         sigset_t mask,old; 
        
         sigemptyset(&mask); 
        
         sigaddset(&mask, SIGALRM); 
        
         sigprocmask(SIG_BLOCK, &mask, &old); 
        
         Thread_t *find1, *find2; 
        
         find1 = findThread(&live, pth->tid); 
        
         find2 = findThread(&dead, pth->tid); 
        
         if((find1 == NULL)&&(find2 == NULL)){ 
        
         sigprocmask(SIG_SETMASK, &old, NULL); 
        
         return -1; 
        
         } 
        
         if(find2){ 
        
         if(rval_ptr != NULL) 
        
         *rval_ptr = find2->retval; 
        
         sigprocmask(SIG_SETMASK, &old, NULL); 
        
         return 0; 
        
         } 
        
         sigprocmask(SIG_SETMASK, &old, NULL); 
        
         while(1) 
        
         { 
        
         if((find2 = findThread(&dead, pth->tid))!= NULL){ 
        
         if(rval_ptr!= NULL) 
        
         *rval_ptr = find2->retval; 
        
         pNode *tmp = deleteThread(&dead, pth->tid); 
        
         free(tmp); 
        
         free((Stack_t)find2->stack); 
        
         free(find2); 
        
         return 0; 
        
         } 
        
         } 
        
         return -1; 
        
         } 
        
         void init() 
        
         { 
        
         initTimer(); 
        
         initCursor(&live); 
        
         initCursor(&dead); 
        
         appendThread(&live, &pmain); 
        
         Alarm(hdr_ptr,mallocTimer(1, switch_to, 1, 1)); 
        
         } 
        
         void switch_to(int signo) 
        
         { 
        
         sigset_t mask,old; 
        
         sigemptyset(&mask); 
        
         sigaddset(&mask, SIGALRM); 
        
         sigprocmask(SIG_BLOCK, &mask, &old); 
        
         Regs regs; 
        
         //printf(""); 
        
         if(signo == -1) 
        
         { 
        
         regs = live.current->data->regs; 
        
         sigprocmask(SIG_SETMASK, &old, NULL); 
        
         JMP(regs); 
        
         assert(0); 
        
         } 
        
         int _edi; 
        
         int _esi; 
        
         int _ebp; 
        
         int _esp; 
        
         int _ebx; 
        
         int _edx; 
        
         int _ecx; 
        
         int _eax; 
        
         int _eip = &&_REENTERPOINT; 
        
         int _eflags; 
        
         live.current->data->__reenter = 0;  
        
         /* save current context */ 
        
         SAVE(); 
        
         /* save context in current thread */ 
        
         live.current->data->regs._eflags = _eflags; 
        
         live.current->data->regs._eip = _eip; 
        
         live.current->data->regs._eax = _eax; 
        
         live.current->data->regs._ecx = _ecx; 
        
         live.current->data->regs._edx = _edx; 
        
         live.current->data->regs._ebx = _ebx; 
        
         live.current->data->regs._esp = _esp; 
        
         live.current->data->regs._ebp = _ebp; 
        
         live.current->data->regs._esi = _esi; 
        
         live.current->data->regs._edi = _edi; 
        
         if(!live.current->data->__reenter) 
        
         { 
        
         goto _END; 
        
         } 
        
         _REENTERPOINT: 
        
         regs = live.current->data->regs; 
        
         if(live.current->data->__reenter){ 
        
         live.current->data->__reenter = 0; 
        
         sigprocmask(SIG_SETMASK, &old, NULL); 
        
         return; 
        
         }  
        
         _END: 
        
         live.current->data->__reenter = 1; 
        
         regs = live.current->next->data->regs; 
        
         live.current = live.current->next; 
        
         sigprocmask(SIG_SETMASK, &old, NULL); 
        
         JMP(regs); 
        
         assert(0); 
        
         } 
        
         /************************* Test *************************/ 
        
         /** 
        
         * Note: The implementation is really bugy, right now only support compute in thread. 
        
         * Even standard I/O in the thread will cause I/O bus error or segmentation error because 
        
         * all pthread-reentrant function is not guaranteed in our thread model. 
        
         * (pthread_mutex_t cannot block thread in our model cause we modify eip directly) 
        
         */ 
        
         void *sum1tod(void *d) 
        
         { 
        
         int i, k, j=0; 
        
         for (i = 0; i <= (int)d; ++i) 
        
         { 
        
         /* code */ 
        
         j+=i;    
        
         } 
        
         return ((void *)j); 
        
         } 
        
         int main(int argc, char const *argv[]) 
        
         { 
        
         int res = 0; 
        
         int i; 
        
         init(); 
        
         Thread_t *tid1, *tid2; 
        
         int *res1, *res2; 
        
         threadCreat(&tid1, sum1tod, 100); 
        
         threadCreat(&tid2, sum1tod, 100); 
        
         for (i = 0; i <= 100; ++i){ 
        
         res+=i; 
        
         } 
        
         threadJoin(tid1, &res1); 
        
         threadJoin(tid2, &res2); 
        
         printf("parallel compute: %d = 5050 * 3\n", (int)res1+(int)res2+(int)res); 
        
         return 0; 
        
         }

以上这篇C语言实现用户态线程库案例就是小编分享给大家的全部内容了，希望能给大家一个参考，也希望大家多多支持我.

最后此篇关于C语言实现用户态线程库案例的文章就讲到这里了,如果你想了解更多关于C语言实现用户态线程库案例的内容请搜索CFSDN的文章或继续浏览相关文章，希望大家以后支持我的博客！。

文章推荐： VMware ESXi 5.5部署与配置图解过程

文章推荐：使用pandas或numpy处理数据中的空值(np.isnan()/pd.isnull())

文章推荐：使用docker制作分布式lnmp 镜像

文章推荐： PyQt5爬取12306车票信息程序的实现

Oracle 案例
这个问题在这里已经有了答案: Oracle: merging two different queries into one, LIKE & IN (1 个回答) 8年前关闭。我有以下代码: case
MYSQL存储过程、案例
我查阅过此页面:http://dev.mysql.com/doc/refman/5.1/en/case.html以及这个，但无法获得一个简单的程序来工作...... 更新:为了明确我想要做什么:我想从
MySQL查询优化总..案例
有什么办法可以优化下面的查询吗？ SELECT DATE_FORMAT(a.duedate,'%d-%b-%y') AS dte, duedate, SUM(CASE WHEN (typeofnoti
MYSQL 案例
我进退两难，以下 SQL 查询的结果是什么以及它是如何工作的: SELECT ... CASE WHEN (a.FIELD=1 AND b.FIELD=2) THEN 1 WHEN
Java基础之打印万年历的简单实现(案例)
问题：输入年，月，打印对应年月的日历。示例：问题分析： 1，首先1970年是Unix系统诞生的时间，1970年成为Unix的元年，1970年1月1号是星期四，现在大多的手机的日历功能只能显
理论+案例，带你掌握Angular依赖注入模式的应用
**摘要：**介绍了Angular中依赖注入是如何查找依赖，如何配置提供商，如何用限定和过滤作用的装饰器拿到想要的实例，进一步通过N个案例分析如何结合依赖注入的知识点来解决开发编程中会遇到的问题。本
scala - (案例)类构造函数上下文中的隐式转换
我想拥有自动伴侣类apply case 类的构造函数来为我执行隐式转换，但无法弄清楚如何这样做。我到处搜索，我能找到的最接近的答案是 this问题(我将解释为什么它不是我在下面寻找的)。我有一个看起
具有多列的 SQL 案例
您好，我已经浏览了“多列案例”问题，但没有看到与此相同的内容，所以我想我应该问一下。基本上我有两个我想要连接的表(都是子查询的结果)。它们具有相同的列名称。如果我加入他们的 ID 和 SELECT
非直觉类型推断的 Kotlin 案例
我发现了一些类型推断的非直觉行为。因此，语义等效代码的工作方式不同，具体取决于编译器推断出的有关函数返回类型的信息。当您在最小单元测试中重现此案例时，或多或少会清楚发生了什么。但我担心在编写框架代码时
SQL Server - 案例
CREATE TABLE test ( sts_id int , [status1] int , [status2] int , [status3] int , [status4] int ) INS
带有内连接的 MYSQL 案例
我有以下声明: SELECT Dag AS Dag, CASE Jaar WHEN 2013 THEN Levering END AS '2013', CASE
mysql - 案例、子查询和连接
我想做的是为所有高于平均时间、平均时间和低于平均时间的游乐设施获取平均tip_portion。所以返回3行。当我运行它时，它显示: ERROR: missing FROM-clause entry
Mysql 案例 - 统计特定时间内的字段数
我正在尝试设置一个包含以下字段的报告: 非常需要报告来显示日期、该日期内的总记录(因此我按日期分组)，然后按小时计算 12 小时工作日(从上午 8 点到晚上 8 点)我需要计算记录在这些时间内出现的时
mysql - 在一个查询中获取所有 WHERE 案例
我有这个查询 SELECT users.name FROM users LEFT JOIN weapon_stats ON users.id = weapon_stats.zp_id WHERE we
计数不同时的 MySQL 案例
我正在尝试按收视率等级获取不同视频的计数。我有下表: vid_id views 1 6 1 10 1 900 2 850 2 125000
mysql - 案例 When 案例之间的联合
假设我有一个如下所示的 SQL 语句: select supplier, case when platform in (5,6) then 'mobile' when p
MySql - 更新/案例
我有一个表测试 TestNumber (int primary key) InactiveBitwise (int) 我执行以下命令: UPDATE tests SET CASE WH
带分组依据的 MySQL 案例
我有一个像这样的表(name=expense): id amount date 1 -1687 2014-01-02 00:00:00.0 2 11000 2014-01-02 0
C++ 案例 multimap
我有一个 multimap 定义 typedef std::pair au_pair; //vertices typedef std::pair acq_pair; //ch qlty specifi
c++ - 将静态常量类实例用于开关/案例
我有一个有点像枚举的类，它的每个实例都有一个唯一的 int 值，该值从 0 开始并在每个新实例时递增。 class MyEnumLikeClass { static int NextId =

qq735679552

个人简介

我是一名优秀的程序员,十分优秀！

作者热门文章

滴滴打车优惠券免费领取

全站热门文章

首页

博学

6Ren·AI

商城

C语言实现用户态线程库案例