thread.h
https://github.com/wookayin/pintos/blob/master/src/threads/thread.h
#ifndef THREADS_THREAD_H | |
#define THREADS_THREAD_H | |
#include <debug.h> | |
#include <list.h> | |
#include <stdint.h> | |
#ifdef VM | |
#include "vm/page.h" | |
#endif | |
/* States in a thread's life cycle. */ | |
enum thread_status | |
{ | |
THREAD_RUNNING, /* Running thread. */ | |
THREAD_READY, /* Not running but ready to run. */ | |
THREAD_BLOCKED, /* Waiting for an event to trigger. */ | |
THREAD_DYING /* About to be destroyed. */ | |
}; | |
/* Thread identifier type. | |
You can redefine this to whatever type you like. */ | |
typedef int tid_t; | |
#define TID_ERROR ((tid_t) -1) /* Error value for tid_t. */ | |
/* Thread priorities. */ | |
#define PRI_MIN 0 /* Lowest priority. */ | |
#define PRI_DEFAULT 31 /* Default priority. */ | |
#define PRI_MAX 63 /* Highest priority. */ | |
/* A kernel thread or user process. | |
Each thread structure is stored in its own 4 kB page. The | |
thread structure itself sits at the very bottom of the page | |
(at offset 0). The rest of the page is reserved for the | |
thread's kernel stack, which grows downward from the top of | |
the page (at offset 4 kB). Here's an illustration: | |
4 kB +---------------------------------+ | |
| kernel stack | | |
| | | | |
| | | | |
| V | | |
| grows downward | | |
| | | |
| | | |
| | | |
| | | |
| | | |
| | | |
| | | |
| | | |
+---------------------------------+ | |
| magic | | |
| : | | |
| : | | |
| name | | |
| status | | |
0 kB +---------------------------------+ | |
The upshot of this is twofold: | |
1. First, `struct thread' must not be allowed to grow too | |
big. If it does, then there will not be enough room for | |
the kernel stack. Our base `struct thread' is only a | |
few bytes in size. It probably should stay well under 1 | |
kB. | |
2. Second, kernel stacks must not be allowed to grow too | |
large. If a stack overflows, it will corrupt the thread | |
state. Thus, kernel functions should not allocate large | |
structures or arrays as non-static local variables. Use | |
dynamic allocation with malloc() or palloc_get_page() | |
instead. | |
The first symptom of either of these problems will probably be | |
an assertion failure in thread_current(), which checks that | |
the `magic' member of the running thread's `struct thread' is | |
set to THREAD_MAGIC. Stack overflow will normally change this | |
value, triggering the assertion. */ | |
/* The `elem' member has a dual purpose. It can be an element in | |
the run queue (thread.c), or it can be an element in a | |
semaphore wait list (synch.c). It can be used these two ways | |
only because they are mutually exclusive: only a thread in the | |
ready state is on the run queue, whereas only a thread in the | |
blocked state is on a semaphore wait list. */ | |
struct thread | |
{ | |
/* Owned by thread.c. */ | |
tid_t tid; /* Thread identifier. */ | |
enum thread_status status; /* Thread state. */ | |
char name[16]; /* Name (for debugging purposes). */ | |
uint8_t *stack; /* Saved stack pointer. */ | |
int priority; /* Priority. */ | |
int original_priority; /* Priority, before donation */ | |
struct list_elem allelem; /* List element for all threads list. */ | |
struct list_elem waitelem; /* List element, stored in the wait_list queue */ | |
int64_t sleep_endtick; /* The tick after which the thread should awake (if the thread is in sleep) */ | |
/* Shared between thread.c and synch.c. */ | |
struct list_elem elem; /* List element, stored in the ready_list queue */ | |
// needed for priority donations | |
struct lock *waiting_lock; /* The lock object on which this thread is waiting (or NULL if not locked) */ | |
struct list locks; /* List of locks the thread holds (for multiple donations) */ | |
#ifdef USERPROG | |
/* Owned by userprog/process.c. */ | |
uint32_t *pagedir; /* Page directory. */ | |
// Project 2: file descriptors and process table | |
/* Owned by userprog/process.c and userprog/syscall.c */ | |
struct process_control_block *pcb; /* Process Control Block */ | |
struct list child_list; /* List of children processes of this thread, | |
each elem is defined by pcb#elem */ | |
struct list file_descriptors; /* List of file_descriptors the thread contains */ | |
struct file *executing_file; /* The executable file of associated process. */ | |
uint8_t *current_esp; /* The current value of the user program’s stack pointer. | |
A page fault might occur in the kernel, so we might | |
need to store esp on transition to kernel mode. (4.3.3) */ | |
#endif | |
#ifdef VM | |
// Project 3: Supplemental page table. | |
struct supplemental_page_table *supt; /* Supplemental Page Table. */ | |
// Project 3: Memory Mapped Files. | |
struct list mmap_list; /* List of struct mmap_desc. */ | |
#endif | |
// Project 4: CWD. | |
struct dir *cwd; | |
/* Owned by thread.c. */ | |
unsigned magic; /* Detects stack overflow. */ | |
}; | |
/* If false (default), use round-robin scheduler. | |
If true, use multi-level feedback queue scheduler. | |
Controlled by kernel command-line option "-o mlfqs". */ | |
extern bool thread_mlfqs; | |
void thread_init (void); | |
void thread_start (void); | |
void thread_tick (int64_t tick); | |
void thread_print_stats (void); | |
typedef void thread_func (void *aux); | |
tid_t thread_create (const char *name, int priority, thread_func *, void *); | |
void thread_block (void); | |
void thread_unblock (struct thread *); | |
void thread_sleep_until (int64_t wake_tick); | |
struct thread *thread_current (void); | |
tid_t thread_tid (void); | |
const char *thread_name (void); | |
void thread_exit (void) NO_RETURN; | |
void thread_yield (void); | |
/* Performs some operation on thread t, given auxiliary data AUX. */ | |
typedef void thread_action_func (struct thread *t, void *aux); | |
void thread_foreach (thread_action_func *, void *); | |
int thread_get_priority (void); | |
void thread_set_priority (int); | |
void thread_priority_donate(struct thread *, int priority); | |
int thread_get_nice (void); | |
void thread_set_nice (int); | |
int thread_get_recent_cpu (void); | |
int thread_get_load_avg (void); | |
#endif /* threads/thread.h */ |
thread.h的更多相关文章
- checking for event2/thread.h... no libevent_pthreads required, failing
/********************************************************************************** * checking for e ...
- 初识chromium thread的实现
接触chromium已有一段时间,写点东西学习一下吧. 首先说一下用法,如何利用chromium封装好的thread类来开一个线程.在base里有一个封装该类的头文件thread.h,include它 ...
- 封装Thread的两种方法 via C++ in Linux
方法一: 代理线程函数(proxyThreadFunc)作为类的静态成员函数, 回调函数指针作为类的私有成员变量 方法二: 代理线程函数(proxyThreadFunc)作为全局函数, 回调函数指针 ...
- Android native thread相关
几个主要的source code路径: /system/core/include/utils/threads.h /system/core/include/utils/Thread.h /system ...
- Android Framework中的线程Thread及它的threadLoop方法
当初跟踪Camera的代码中的时候一直追到了HAL层,而在Framework中的代码看见了许很多多的Thread.它们普遍的特点就是有一个threadLoop方法.依照字面的意思应该是这个线程能够循环 ...
- Libevent源码学习笔记一:event2/event.h
一.libevent标准使用方法: 每个程序使用Libevent必须include <event2/event.h> 头文件,并 传给 -levent 链接器.如果只是想使用主要的eve ...
- c++11 thread (目前我使用的ZThread库)
目前为止(2014-11-30),GCC其实已经基本上完全支持C++11的所有功能了,事实上从GCC4.7之后,就支持了-std=c++11选项,在4.7版本之前,也开始支持-std=c++0x的选项 ...
- 使用C++11的function/bind组件封装Thread以及回调函数的使用
之前在http://www.cnblogs.com/inevermore/p/4008572.html中采用面向对象的方式,封装了Posix的线程,那里采用的是虚函数+继承的方式,用户通过重写Thre ...
- Linux组件封装(三)使用面向对象编程封装Thread
C++11提供了thread,但是过于复杂,我们还是倾向于在项目中编写自己的Thread. Posix Thread的使用这里不再赘述. 重点是这个函数: #include <pthread.h ...
随机推荐
- input上传文件检测文件大小
前几天在做 input[type='file'] 上传图片时,需要检测上传文件的内存大小,写了一个小demo,在此做一总结: <!DOCTYPE html> <html lang=& ...
- windows 2008 中IIS7.0以上如何设置404错误页面
404错误页面的设置,不仅仅可以提高用户体验度,从SEO方面考虑,也是非常重要的.今天,笔者在这里介绍一下在windows 2008下如何设置404错误页面. 注意:设置404有我这里介绍2种方式,推 ...
- OpenCart 如何安装 vQmod 教程
vQmod (全称 Virtual Quick Mod),是 OpenCart (PHP 开源电商网站系统)上一个可以以虚拟方式修改原文件内容而设计的一个插件系统.它的使用很简单,我们先用 xml 的 ...
- Unity 动画系统(Mecanim)的组成结构
三部分: Model Rigging(直译传动装置,术语翻译绑定)(连接Model与Animations) Animations
- ICMPv6和IPv6 NDP
1. ICMPv6 IPV4使用ICMP做很多事情,诸如目的地不可达等错误消息以及ping和traceroute等诊断功能.ICMPv6也提供了这些功能,但不同的是,它不是独立的第3层协议.ICMPV ...
- SpringMVC框架入门
简介 SpringMVC采用模型(Model)-视图(View)-控制器(controller)的方法把业务逻辑.数据与界面显示分离.用通俗的话来讲,MVC的理念就是把数据处理.数据展示和程序/用户的 ...
- Someing-About-Work
投料分拨次评估1.调试线投料分波次:(由调试厂录入生产计划:按照实际装机计划做二次分拣)1)计划组必须改两次工单:因为使用的是不同的任务号,一次一次分拣,一次二次分拣,2)计划核对数量困难,不能按照制 ...
- HDU 1222 Wolf and Rabbit( 简单拓欧 )
链接:传送门 题意:狼抓兔子,狼从 0 出发沿逆时针寻找兔子,每走一步的距离为 m ,所有洞窟的编号为 0 - n-1 ,问是否存在一个洞窟使得兔子能够安全躲过无数次狼的搜捕. 思路:简单的拓展欧几里 ...
- 51nod 1576 Tree and permutation(树的重心+dfn序)
乍一看我不会. 先不考虑加点. 先考虑没有那个除\(2\). 考虑每一条边的贡献,假设某一条边把这棵树分成大小为x,y的两个部分. 那么这条边最多可以被使用\(min(x,y)*2\)次(因为有进有出 ...
- nginx虚拟主机的配置不生效
这个坑找了好久,今天终于找到了问题所在. 一般虚拟主机配置文件是vhost里面单独写一个网站名.conf,然后在nginx最后include vhosts/*.conf 引用. 但是我这里的vhost ...