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. vue-cli webpack配置中 如何启动less-loader sass-loader

    在vue-cli中构建的项目是可以使用less的,但是查看package.json可以发现,并没有less相关的插件,所以我们需要自行安装. //第一步:安装 npm install less les ...

  2. poj 2135 Farm Tour【 最小费用最大流 】

    第一道费用流的题目--- 其实---还是不是很懂,只知道沿着最短路找增广路 建图 源点到1连一条容量为2(因为要来回),费用为0的边 n到汇点连一条容量为2,费用为0的边 另外的就是题目中输入的了 另 ...

  3. Clonezilla制作镜像时报错: errextfsclone.c:bitmap free count err

    在检查时选中下面的选项, 如下图: -fsck-src-part Interactively check and  repair source file

  4. 从源码中查看当前android版本

    从文件build/core/version_defaults.mk查找PLATFORM_VERSION例如:PLATFORM_VERSION.OPM1 := 8.1.0

  5. Java开发就业形势和面试技巧

    如果从软件编程的就业来讲,如果你现在不懂架构,那么找到一份好工作还是比较难的,但是这里面有两点需要注意: 传统软件公司,这类公司还会使用最为原始的开发技术(SSH),但是这样的传统软件公司的招聘量已经 ...

  6. Java模拟数据量过大时批量处理数据的两种实现方法

    方法一: 代码如下: import java.util.ArrayList; import java.util.List; /** * 模拟批量处理数据(一) * 当数据量过大过多导致超时等问题可以将 ...

  7. MySQL 关闭 binlog 日志

    [关闭binlog日志] 1.vim /etc/my.cnf 注释如下内容: #log-bin=mysql-bin #binlog_format=mixed #server-id = 1 #expir ...

  8. Day 02 - 01 计算机的操作系统

    操作系统 场景:有以下三个人 1.庄园主 -->相当于人类 2.管家 --> 把人类要传达的信息分配给奴隶,相当于操作系统 3.奴隶 -->为人类干活的机器 1.操作系统做了什么? ...

  9. W3c盒子模型+IE盒子模型+box-sizing属性

    1.盒子模型有两种,标准盒模型和IE盒模型,其中W3C标准的盒模型就是在网页的顶部加上 DOCTYPE 声明. (1)W3C标准的盒模型 W3C盒子模型包括4部分:margin,border,padd ...

  10. codevs 3945 完美拓印 (KMP)

    题目大意:给你一个神奇的印章,他左右下三个面都是直的,上面是凸凹不平的面(凸凹都平行于别的面).然后给你一个轮廓线,如果一个面能与轮廓线完全重合,可以把印章的这个沿着轮廓线拓印,求所有的拓印方案. 把 ...