Quelle lowlevel.xml Sprache: XML

<Chapter Label="Low-level functionality">
  <Heading>Low-level functionality</Heading>

The functionality described in this section should only be used by experts, and even by those only with caution
(especially the parts that relate to the memory model).
<P/>
Not only is it possible to crash or hang the GAP kernel, it can happen in ways that are very difficult to reproduce,
leading to software defects that are discovered only long after deployment of a package and then become difficult to
correct.
<P/>
The performance benefit of using these primitives is generally minimal; while concurrency can induce some overhead, the
benefit from micromanaging concurrency in an interpreted language such as GAP is likely to be small.
<P/>
These low-level primitives exist primarily for the benefit of kernel programmers; it allows them to prototype new kernel
functionality in GAP before implementing it in C.

  <Section Label="Explicit lock and unlock primitives">
    <Heading>Explicit lock and unlock primitives</Heading>

The <Ref Func="LOCK"/> operation combined with <Ref Func="UNLOCK"/>
is a low-level interface for the functionality of the  statement.

<ManSection>
    <Func Name="LOCK"
      Arg='[arg_1, ..., arg_n]'/>

<Description>
<Ref Func="LOCK"/> takes zero or more pairs of parameters, where each is either an object or a boolean value. If an argument is
an object, the region containing it will be locked. If an argument is the boolean value <K>false</K>, all subsequent
locks will be read locks; if it is the boolean value <K>true</K>, all subsequent locks will be write locks. If the first
argument is not a boolean value, all locks until the first boolean value will be write locks.
<P/>
Locks are managed internally as a stack of locked regions; <Ref Func="LOCK"/> returns an integer indicating a pointer to the
top of the stack; this integer is used later by the <Ref Func="UNLOCK"/> operation to unlock locks on the stack up to that
position. If <Ref Func="LOCK"/> should fail for some reason, it will return <K>fail</K>.
<P/>
Calling <Ref Func="LOCK"/> with no parameters returns the current lock stack pointer.
</Description>
</ManSection>

<ManSection>
    <Func Name="TRYLOCK"
      Arg='[arg_1, ..., arg_n]'/>

<Description>
<Ref Func="TRYLOCK"/> works similarly to <Ref Func="LOCK"/>. If it cannot acquire
all region locks, it returns <K>fail</K> and does not lock any regions. Otherwise,
its semantics are identical to <Ref Func="LOCK"/>.
</Description>
</ManSection>

<ManSection>
    <Func Name="UNLOCK"
      Arg='stackpos'/>

<Description>
<Ref Func="UNLOCK"/> unlocks all regions on the stack at <A>stackpos</A>
or higher and sets the stack pointer to <A>stackpos</A>.

<Example><![CDATA[
gap> l1 := ShareObj([1,2,3]);;
gap> l2 := ShareObj([4,5,6]);;
gap> p := LOCK(l1);
0
gap> LOCK(l2);
1
gap> UNLOCK(p); # unlock both RegionOf(l1) and RegionOf(l2)
gap> LOCK(); # current stack pointer
0
]]></Example>
</Description>
</ManSection>

  </Section>
  <Section Label="Hash locks">
    <Heading>Hash locks</Heading>

HPC-GAP supports <E>hash locks</E>; internally, the kernel maintains a fixed size array of locks; objects are mapped to
a lock via hash function. The hash function is based on the object reference, not its contents (except for short
integers and finite field elements).

<Example><![CDATA[
gap> l := [ 1, 2, 3];;
gap> f := l -> Sum(l);;
gap> HASH_LOCK(l);   # lock 'l'
gap> f(l);           # do something with 'l'
6
gap> HASH_UNLOCK(l); # unlock 'l'
]]></Example>

Hash locks should only be used for very short operations, since there is a chance that two concurrently locked objects
map to the same hash value, leading to unnecessary contention.
<P/>
Hash locks are unrelated to the locks used by the <C>atomic</C> statements and
the <Ref Func="LOCK"/> and <Ref Func="UNLOCK"/> primitives.

<ManSection>
    <Func Name="HASH_LOCK"
      Arg='obj'/>

<Description>
<Ref Func="HASH_LOCK"/> obtains the read-write lock for the hash value associated with <C>obj</C>.
</Description>
</ManSection>

<ManSection>
    <Func Name="HASH_UNLOCK"
      Arg='obj'/>

<Description>
<Ref Func="HASH_UNLOCK"/> releases the read-write lock for the hash value associated with <C>obj</C>.
</Description>
</ManSection>

<ManSection>
    <Func Name="HASH_LOCK_SHARED"
      Arg='obj'/>

<Description>
<Ref Func="HASH_LOCK_SHARED"/> obtains the read-only lock for the hash value associated with <C>obj</C>.
</Description>
</ManSection>

<ManSection>
    <Func Name="HASH_UNLOCK_SHARED"
      Arg='obj'/>

<Description>
<Ref Func="HASH_UNLOCK_SHARED"/> releases the read-only lock for the hash value associated with <C>obj</C>.
</Description>
</ManSection>

  </Section>

  <Section Label="Migration to the public region">
    <Heading>Migration to the public region</Heading>

HPC-GAP allows migration of arbitrary objects to the public region. This functionality is potentially dangerous; for
example, if two threads try resize a plain list simultaneously, this can result in memory corruption.
<P/>
Accordingly, such data should never be accessed except through operations that protect accesses through locks, memory
barriers, or other mechanisms.

<ManSection>
    <Func Name="MAKE_PUBLIC"
      Arg='obj'/>

<Description>
<Ref Func="MAKE_PUBLIC"/> makes <A>obj</A> and all its subobjects members of the public region.
</Description>
</ManSection>

<ManSection>
    <Func Name="MAKE_PUBLIC_NORECURSE"
      Arg='obj'/>

<Description>
<Ref Func="MAKE_PUBLIC_NORECURSE"/> makes <A>obj</A>, but not any of its subobjects members of the public region.
</Description>
</ManSection>
  </Section>

  <Section Label="Memory barriers">
    <Heading>Memory barriers</Heading>

The memory models of some processors do no guarantee that read and writes reflect accesses to main memory in the same
order in which the processor performed them; for example, code may write variable <C>v1</C> first, and <C>v2</C> second; but the cache
line containing <C>v2</C> is flushed to main memory first so that other processors see the change to <C>v2</C> before the change to
<C>v1</C>.
<P/>
Memory barriers can be used to prevent such counter-intuitive reordering of memory accesses.

<ManSection>
    <Func Name="ORDERED_WRITE"
      Arg='expr'/>

<Description>
The <Ref Func="ORDERED_WRITE"/> function guarantees that all writes that occur prior to its execution or during the evaluation
of <A>expr</A> become visible to other processors before any of the code executed after.
<P/>
Example:

<Example><![CDATA[
gap> y:=0;; f := function() y := 1; return 2; end;;
gap> x := ORDERED_WRITE(f());
2
]]></Example>

Here, the write barrier ensure that the assignment to <C>y</C> that occurs during the call of <C>f()</C> becomes visible
to other processors before or at the same time as the assignment to <C>x</C>.
<P/>
This can also be done differently, with the same semantics:

<Example><![CDATA[
gap> t := f();; # temporary variable
gap> ORDERED_WRITE(0);; # dummy argument
gap> x := t;
2
]]></Example>

</Description>
</ManSection>

<ManSection>
    <Func Name="ORDERED_READ"
      Arg='expr'/>

<Description>
Conversely, the <Ref Func="ORDERED_READ"/> function ensures that reads that occur before its call or during the evaluation of
<A>expr</A> are not reordered with respects to memory reads occurring after it.
</Description>
</ManSection>
  </Section>

  <Section Label="Object manipulation">
    <Heading>Object manipulation</Heading>

There are two new functions to exchange a pair of objects.

<ManSection>
    <Func Name="SWITCH_OBJ"
      Arg='obj1, obj2'/>

<Description>
<Ref Func="SWITCH_OBJ"/> exchanges its two arguments. All variables currently referencing <A>obj1</A> will reference
<A>obj2</A> instead after the operation completes, and vice versa. Both objects stay within their previous regions.

<Example><![CDATA[
gap> a := [ 1, 2, 3];;
gap> b := [ 4, 5, 6];;
gap> SWITCH_OBJ(a, b);
gap> a;
[ 4, 5, 6 ]
gap> b;
[ 1, 2, 3 ]
]]></Example>

The function requires exclusive access to both objects, which may necessitate using an atomic statement, e.g.:

<Example><![CDATA[
gap> a := ShareObj([ 1, 2, 3]);;
gap> b := ShareObj([ 4, 5, 6]);;
gap> atomic a, b do SWITCH_OBJ(a, b); od;
gap> atomic readonly a do Display(a); od;
[ 4, 5, 6 ]
gap> atomic readonly b do Display(b); od;
[ 1, 2, 3 ]
]]></Example>

</Description>
</ManSection>

<ManSection>
    <Func Name="FORCE_SWITCH_OBJ"
      Arg='obj1, obj2'/>

<Description>
<Ref Func="FORCE_SWITCH_OBJ"/> works like <Ref Func="SWITCH_OBJ"/>, except that it can also exchange objects in the public
region:

<Example><![CDATA[
gap> a := ShareObj([ 1, 2, 3]);;
gap> b := MakeImmutable([ 4, 5, 6]);;
gap> atomic a do FORCE_SWITCH_OBJ(a, b); od;
gap> a;
[ 4, 5, 6 ]
]]></Example>

This function should be used with extreme caution and only with public objects for which only the current thread has a
reference. Otherwise, undefined behavior and crashes can result from other threads accessing the public object
concurrently.

</Description>
</ManSection>
  </Section>
</Chapter>

quality98%

¤ Dauer der Verarbeitung: 0.23 Sekunden (vorverarbeitet) ¤

Wurzel

Suchen

Beweissystem der NASA

Beweissystem Isabelle

NIST Cobol Testsuite

Cephes Mathematical Library

Wiener Entwicklungsmethode

Haftungshinweis

Die Informationen auf dieser Webseite wurden nach bestem Wissen sorgfältig zusammengestellt. Es wird jedoch weder Vollständigkeit, noch Richtigkeit, noch Qualität der bereit gestellten Informationen zugesichert.

Bemerkung:

Die farbliche Syntaxdarstellung ist noch experimentell.