线程共享代码、数据段和堆，但不共享堆栈。

您说得很对，但是线程共享除堆栈之外的所有段。线程有独立的调用堆栈，但是其他线程堆栈中的内存仍然是可访问的，理论上你可以在其他线程的本地堆栈框架中保存内存指针(尽管你可能应该找到一个更好的地方来放置内存!)。

线程共享堆(有一个关于线程特定堆的研究)，但当前的实现共享堆。(当然还有代码)

线程共享数据和代码，而进程不共享。栈不是为两者共享的。

进程也可以共享内存，更精确的代码，例如Fork()之后，但这是一个实现细节和(操作系统)优化。由多个进程共享的代码将(希望)在第一次写入代码时复制—这被称为写时复制。我不确定线程代码的确切语义，但我假设是共享代码。

           Process   Thread

   Stack   private   private
   Data    private   shared
   Code    private1  shared2

代码在逻辑上是私有的，但出于性能原因可能会被共享。 我不能百分之百肯定。

来自维基百科(我认为这对面试官来说是个很好的回答:P)

Threads differ from traditional multitasking operating system processes in that: processes are typically independent, while threads exist as subsets of a process processes carry considerable state information, whereas multiple threads within a process share state as well as memory and other resources processes have separate address spaces, whereas threads share their address space processes interact only through system-provided inter-process communication mechanisms. Context switching between threads in the same process is typically faster than context switching between processes.

线程共享所有内容[1]。整个进程只有一个地址空间。

每个线程都有自己的堆栈和寄存器，但所有线程的堆栈都在共享地址空间中可见。

如果一个线程在它的堆栈上分配了某个对象，并将该地址发送给另一个线程，它们对该对象的访问权是相等的。

实际上，我刚刚注意到一个更广泛的问题:我认为你混淆了segment这个词的两种用法。

可执行文件(如ELF)的文件格式有不同的部分，可以称为段，包含编译的代码(文本)、初始化的数据、链接器符号、调试信息等。这里没有堆段或堆栈段，因为它们是仅运行时结构。

这些二进制文件段可以分别映射到进程地址空间，具有不同的权限(例如，对于代码/文本，只读可执行;对于初始化的数据，写时复制不可执行)。

根据约定(由语言运行库强制执行)，这个地址空间的区域用于不同的目的，如堆分配和线程堆栈。不过，这些都只是内存，并且可能没有分段，除非您在虚拟8086模式下运行。每个线程的堆栈是在线程创建时分配的内存块，当前堆栈顶部地址存储在堆栈指针寄存器中，每个线程保留自己的堆栈指针和其他寄存器。

好的，我知道:信号掩码，TSS/TSD等。地址空间，包括它所有映射的程序段，仍然是共享的。

告诉面试官这完全取决于操作系统的实现。

以Windows x86为例。只有两个段[1]，代码和数据。它们都被映射到整个2GB(线性，用户)地址空间。基础= 0,限制= 2 gb。他们本来可以做一个，但x86不允许一个段同时读/写和执行。所以他们做了两个，并设置CS指向代码描述符，其余(DS, ES, SS等)指向另一个[2]。但两者都指向同样的东西!

面试你的人做了一个隐藏的假设，他/她没有说出来，这是一个愚蠢的伎俩。

所以关于

问:告诉我是哪个线段 分享吗?

细分市场与问题无关，至少在Windows上是这样。线程共享整个地址空间。只有一个堆栈段SS，它指向DS ES CS做的完全一样的东西[2]。比如整个用户空间。0-2GB。当然，这并不意味着线程只有一个堆栈。当然，每个都有自己的堆栈，但x86段并不用于此目的。

也许*nix做一些不同的事情。谁知道呢。这个问题的前提被打破了。

至少对于用户空间是这样的。 从ntsd记事本:cs=001b ss=0023 ds=0023 es=0023

In an x86 framework, one can divide as many segments (up to 2^16-1). The ASM directives SEGMENT/ENDS allows this, and the operators SEG and OFFSET allows initialization of segment registers. CS:IP are usually initialized by the loader, but for DS, ES, SS the application is responsible with initialization. Many environments allow the so-called "simplified segment definitions" like .code, .data, .bss, .stack etc. and, depending also on the "memory model" (small, large, compact etc.) the loader initializes segment registers accordingly. Usually .data, .bss, .stack and other usual segments (I haven't done this since 20 years so I don't remember all) are grouped in one single group - that is why usually DS, ES and SS points to teh same area, but this is only to simplify things.

一般来说，所有段寄存器在运行时都可以有不同的值。 所以，面试的问题是正确的:CODE、DATA和STACK中的哪一个在线程之间共享。堆管理是另一回事——它只是对操作系统的一系列调用。但是如果你根本没有操作系统，比如在嵌入式系统中，你还能在你的代码中新建/删除吗?

我给年轻人的建议是——读一些好的汇编编程书。似乎大学的课程在这方面相当贫乏。

通常，线程被称为轻量级进程。如果我们把内存分成三个部分，那么它将是:代码，数据和堆栈。 每个进程都有自己的代码、数据和堆栈部分，由于这种上下文切换时间有点高。为了减少上下文切换的时间，人们提出了线程的概念，它与其他线程/进程共享数据和代码段，并拥有自己的堆栈段。

A process has code, data, heap and stack segments. Now, the Instruction Pointer (IP) of a thread OR threads points to the code segment of the process. The data and heap segments are shared by all the threads. Now what about the stack area? What is actually the stack area? Its an area created by the process just for its thread to use... because stacks can be used in a much faster way than heaps etc. The stack area of the process is divided among threads, i.e. if there are 3 threads, then the stack area of the process is divided into 3 parts and each is given to the 3 threads. In other words, when we say that each thread has its own stack, that stack is actually a part of the process stack area allocated to each thread. When a thread finishes its execution, the stack of the thread is reclaimed by the process. In fact, not only the stack of a process is divided among threads, but all the set of registers that a thread uses like SP, PC and state registers are the registers of the process. So when it comes to sharing, the code, data and heap areas are shared, while the stack area is just divided among threads.

真正需要指出的是，这个问题有两个方面——理论方面和实现方面。

首先，让我们看看理论方面。您需要从概念上理解进程是什么，才能理解进程和线程之间的区别以及它们之间共享的内容。

我们从Tanenbaum的2.2.2节现代操作系统3e中的经典线程模型中获得以下内容:

流程模型基于两个独立的概念:资源 分组和执行。有时把它们分开是有用的; 这就是线程....的由来

他继续说:

One way of looking at a process is that it is a way to group related resources together. A process has an address space containing program text and data, as well as other resources. These resource may include open files, child processes, pending alarms, signal handlers, accounting information, and more. By putting them together in the form of a process, they can be managed more easily. The other concept a process has is a thread of execution, usually shortened to just thread. The thread has a program counter that keeps track of which instruc­tion to execute next. It has registers, which hold its current working variables. It has a stack, which contains the execution history, with one frame for each proce­dure called but not yet returned from. Although a thread must execute in some process, the thread and its process are different concepts and can be treated sepa­rately. Processes are used to group resources together; threads are the entities scheduled for execution on the CPU.

他进一步提供了以下表格:

Per process items             | Per thread items
------------------------------|-----------------
Address space                 | Program counter
Global variables              | Registers
Open files                    | Stack
Child processes               | State
Pending alarms                |
Signals and signal handlers   |
Accounting information        |

以上就是线程工作所需要的。正如其他人指出的那样，像段这样的东西是依赖于操作系统的实现细节的。

在进程中，所有线程共享系统资源，如堆内存等，而线程有自己的堆栈

所以你的ans应该是一个进程中所有线程共享的堆内存。

Besides global memory, threads also share a number of other attributes (i.e., these attributes are global to a process, rather than specific to a thread). These attributes include the following: process ID and parent process ID; process group ID and session ID; controlling terminal; process credentials (user and group IDs); open file descriptors; record locks created using fcntl(); signal dispositions; file system–related information: umask, current working directory, and root directory; interval timers (setitimer()) and POSIX timers (timer_create()); System V semaphore undo (semadj) values (Section 47.8); resource limits; CPU time consumed (as returned by times()); resources consumed (as returned by getrusage()); and nice value (set by setpriority() and nice()). Among the attributes that are distinct for each thread are the following: thread ID (Section 29.5); signal mask; thread-specific data (Section 31.3); alternate signal stack (sigaltstack()); the errno variable; floating-point environment (see fenv(3)); realtime scheduling policy and priority (Sections 35.2 and 35.3); CPU affinity (Linux-specific, described in Section 35.4); capabilities (Linux-specific, described in Chapter 39); and stack (local variables and function call linkage information).

摘自:《Linux编程接口:Linux和UNIX系统编程手册》，Michael Kerrisk，第619页