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. 解决有关null闪退及json解析数据中null的问题

    程序在获取某些数据之后莫名崩溃.其实很早就发现了原因: 由于服务器的数据库中有些字段为空, 然后以Json形式返回给客户端时就会出现这样的数据: "somevalue":null ...

  2. Python内置数据结构之字典dict

    1. 字典 字典是Python中唯一的内置映射类型,其中的值不按顺序排列,而是存储在键下.键可能是数(整数索引).字符串或元组.字典(日常生活中的字典和Python字典)旨在让你能够轻松地找到特定的单 ...

  3. 初见UDP_Server

    from socket import *ip_prot = ('192.168.55.1',8080)buffer_size = 1024udp_sever = socket(AF_INET,SOCK ...

  4. fullcalendar日历插件

    https://www.helloweba.net/javascript/231.html

  5. node——服务器根据不同请求作出不同响应+响应html文件等文件

    在浏览器中,不同的请求应该作出不同的响应 我们可以从请求req中的url获得请求的内容 然后我们就可以通过判断请求的url来做响应 代码如下: //根据用户的不同请求,服务器做出不同的响应 // // ...

  6. BZOJ 3676 [Apio2014]回文串 (后缀自动机+manacher/回文自动机)

    题目大意: 给你一个字符串,求其中回文子串的长度*出现次数的最大值 明明是PAM裸题我干嘛要用SAM做 回文子串有一个神奇的性质,一个字符串本质不同的回文子串个数是$O(n)$级别的 用$manach ...

  7. CF1042F Leaf Sets (贪心+树上构造)

    题目大意:给你一棵树,让你对叶节点分组,保证每组中,任意两个叶节点之间的距离不大于K,求最小的组数 手动yy的贪心竟然对的 对于每个节点,维护一个$ma[i]$,表示在$i$节点的子树内 未被分组的叶 ...

  8. vue懒加载实现

  9. 2015 Multi-University Training Contest 3 hdu 5318 The Goddess Of The Moon

    The Goddess Of The Moon Time Limit: 6000/3000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/ ...

  10. .C#-NET开源方向基本

    我的理解,nancyFx是一个.net的微型框架,可以在Linux环境下运行,ServiceStack也是全平台框架,更大一些 owin的概念:Open Web Server Interface Fo ...