Subversion Repositories HelenOS-doc

      internal fragmentation.</para>

      internal fragmentation.</para>

      <indexterm>

      <indexterm>

        <primary>slab allocator</primary>

        <primary>slab allocator</primary>

      </indexterm>

      </indexterm>

      <para>Slabs of one object type are organized in a structure called slab

      <para>Slabs of one object type are organized in a structure called slab

      cache. There are ususally more slabs in the slab cache, depending on

      cache. There are ususally more slabs in the slab cache, depending on

      previous allocations. If the the slab cache runs out of available slabs,

      previous allocations. If the the slab cache runs out of available slabs,

      magazines.</para>

      magazines.</para>

      <indexterm>

      <indexterm>

        <primary>slab allocator</primary>

        <primary>slab allocator</primary>

      </indexterm>

      </indexterm>

      <para>Each object begins its life in a slab. When it is allocated from

      <para>Each object begins its life in a slab. When it is allocated from

      there, the slab allocator calls a constructor that is registered in the

      there, the slab allocator calls a constructor that is registered in the

      respective slab cache. The constructor initializes and brings the object

      respective slab cache. The constructor initializes and brings the object

      into a known state. The object is then used by the user. When the user

      into a known state. The object is then used by the user. When the user

      later frees the object, the slab allocator puts it into a processor

      later frees the object, the slab allocator puts it into a processor

      private <indexterm>

      private <indexterm>

          <primary>slab allocator</primary>

          <primary>slab allocator</primary>

        </indexterm>magazine cache, from where it can be precedently allocated

        </indexterm>magazine cache, from where it can be precedently allocated

      again. Note that allocations satisfied from a magazine are already

      again. Note that allocations satisfied from a magazine are already

      initialized by the constructor. When both of the processor cached

      initialized by the constructor. When both of the processor cached

      magazines get full, the allocator will move one of the magazines to the

      magazines get full, the allocator will move one of the magazines to the

      list of full magazines. Similarily, when allocating from an empty

      list of full magazines. Similarily, when allocating from an empty

      <section>

      <section>

        <indexterm>

        <indexterm>

          <primary>address space</primary>

          <primary>address space</primary>

        </indexterm>

        </indexterm>

        <title>Address space areas</title>

        <title>Address space areas</title>

        <para>Each address space consists of mutually disjunctive continuous

        <para>Each address space consists of mutually disjunctive continuous

      <section>

      <section>

        <indexterm>

        <indexterm>

          <primary>address space</primary>

          <primary>address space</primary>

        </indexterm>

        </indexterm>

        <title>Address Space ID (ASID)</title>

        <title>Address Space ID (ASID)</title>

        <para>When switching to the different task, kernel also require to

        <para>When switching to the different task, kernel also require to

        to the active task.</para>

        to the active task.</para>

        <indexterm>

        <indexterm>

          <primary>address space</primary>

          <primary>address space</primary>

        </indexterm>

        </indexterm>

        <para>

        <para>

          <classname>ASID stealing algoritm here.</classname>

          <classname>ASID stealing algoritm here.</classname>

        </para>

        </para>

      <section id="page_tables">

      <section id="page_tables">

        <indexterm>

        <indexterm>

          <primary>page tables</primary>

          <primary>page tables</primary>

        </indexterm>

        </indexterm>

        <title>Hierarchical 4-level page tables</title>

        <title>Hierarchical 4-level page tables</title>

        <para>Hierarchical 4-level page tables are the generalization of the

        <para>Hierarchical 4-level page tables are the generalization of the

      <section>

      <section>

        <indexterm>

        <indexterm>

          <primary>page tables</primary>

          <primary>page tables</primary>

        </indexterm>

        </indexterm>

        <title>Global hash table</title>

        <title>Global hash table</title>

        <para>Implementation of the global hash table was encouraged by the

        <para>Implementation of the global hash table was encouraged by the

      <section id="tlb_shootdown">

      <section id="tlb_shootdown">

        <indexterm>

        <indexterm>

          <primary>TLB</primary>

          <primary>TLB</primary>

        </indexterm>

        </indexterm>

        <title>TLB consistency. TLB shootdown algorithm.</title>

        <title>TLB consistency. TLB shootdown algorithm.</title>

        <para>Operating system is responsible for keeping TLB consistent by

        <para>Operating system is responsible for keeping TLB consistent by