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的更多相关文章

  1. checking for event2/thread.h... no libevent_pthreads required, failing

    /********************************************************************************** * checking for e ...

  2. 初识chromium thread的实现

    接触chromium已有一段时间,写点东西学习一下吧. 首先说一下用法,如何利用chromium封装好的thread类来开一个线程.在base里有一个封装该类的头文件thread.h,include它 ...

  3. 封装Thread的两种方法 via C++ in Linux

    方法一: 代理线程函数(proxyThreadFunc)作为类的静态成员函数, 回调函数指针作为类的私有成员变量 方法二: 代理线程函数(proxyThreadFunc)作为全局函数,  回调函数指针 ...

  4. Android native thread相关

    几个主要的source code路径: /system/core/include/utils/threads.h /system/core/include/utils/Thread.h /system ...

  5. Android Framework中的线程Thread及它的threadLoop方法

    当初跟踪Camera的代码中的时候一直追到了HAL层,而在Framework中的代码看见了许很多多的Thread.它们普遍的特点就是有一个threadLoop方法.依照字面的意思应该是这个线程能够循环 ...

  6. Libevent源码学习笔记一:event2/event.h

    一.libevent标准使用方法: 每个程序使用Libevent必须include <event2/event.h> 头文件,并 传给 -levent  链接器.如果只是想使用主要的eve ...

  7. c++11 thread (目前我使用的ZThread库)

    目前为止(2014-11-30),GCC其实已经基本上完全支持C++11的所有功能了,事实上从GCC4.7之后,就支持了-std=c++11选项,在4.7版本之前,也开始支持-std=c++0x的选项 ...

  8. 使用C++11的function/bind组件封装Thread以及回调函数的使用

    之前在http://www.cnblogs.com/inevermore/p/4008572.html中采用面向对象的方式,封装了Posix的线程,那里采用的是虚函数+继承的方式,用户通过重写Thre ...

  9. Linux组件封装(三)使用面向对象编程封装Thread

    C++11提供了thread,但是过于复杂,我们还是倾向于在项目中编写自己的Thread. Posix Thread的使用这里不再赘述. 重点是这个函数: #include <pthread.h ...

随机推荐

  1. js面向对象概念解析

    ECMAScript有两种开发模式: 1.函数式(过程化) 2.面向对象(OOP). 面向对象的语言有一个标志,那就是类的概念,而通过类可以创建任意多个具有相同属性和方法的对象.但是,ECMAScri ...

  2. Sybase to Oracle Golden Gate

    Sybase 安装Golden Gate: 下载,然后create subdirs.并且在两端配置好mgr,设置好端口7809 创建golden gate用户ogguser,并且给它授权sa和repl ...

  3. CodeIgniter 相关资源

    CodeIgniter ci 如果需要扩展多个base Controller,譬如一个 core/MY_Controller表示基本Controller,一个  core/MY_AuthControl ...

  4. 优动漫PAINT中设置横排文字

    初次启动优动漫PAINT使用文本工具时,软件默认是直排文字效果,如果您想更改为横排文字,或者切换横排竖排文本,如何设置,本文做简单介绍. 在工具箱中单击“文本工具”. 在绘图页面的任意位置单击鼠标,输 ...

  5. 扩大缩小Linux物理分区大小

    由于产品在不同的标段,设备硬盘也不同, 有些500G,有些320G有些200G,开始在大硬盘上做的配置,想把自己定制好的Linux克隆到小硬盘上,再生龙会纠结空间大小的问题, 因此需要做一些分区的改变 ...

  6. day12 字符编码

    计算机基础 启动应用程序 双击QQ 操作系统接受指令然后把该操作转化成0和1发送给CPU CPU接受指令然后把指令发送给内存 内存接受指令把指令发送给硬盘读取数据 QQ在内存中运行 写文本的流程 在记 ...

  7. 工作流Activiti学习地址

    http://blog.csdn.net/xnf1991/article/details/52610277

  8. 算法27-----第N个数字

    1.题目: 在无限的整数序列 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, ...中找到第 n 个数字. 注意: n 是正数且在32为整形范围内 ( n < 231). ...

  9. 关于libnmap 的一些应用

    随笔描述 nmap 可以进行端口的扫描,在安全或运维中可以说是一款不错的神奇吧,在大部分LINUX 里面都自带了nmap 这款工具,他不仅仅是端口扫描,自身还提供许多插件可以使用. 官方文档 nmap ...

  10. vue 表格数据编辑,点击取消或者完成按钮后,关闭编辑状态没有及时生效

    点击编辑按钮: 编辑状态下,表格可以编辑.但是点击“确认”或者“取消”按钮,列数据编辑状态已经修改,但是视图没有改变. 页面代码: 获取当前行的index,并直接修改当前行用于判断是否编辑状态的数据为 ...