aaron/ispc
1
0
Fork 0
Code Issues Pull Requests Releases Wiki Activity

Doc fixes (Crystal Lemire).

Browse Source
This commit is contained in:
Matt Pharr
2012-07-11 19:51:28 -07:00
parent df18b2a150
commit 2bacebb1fb
1 changed files with 6 additions and 8 deletions
Download Patch File Download Diff File Expand all files Collapse all files

14
docs/ispc.rst
View File

@@ -2084,7 +2084,7 @@ can be declared:
soa<8> Point pts[...]; soa<8> Point pts[...];
The in-memory layout of the ``Point``s has had the SOA transformation The in-memory layout of the ``Point`` instances has had the SOA transformation
applied, such that there are 8 ``x`` values in memory followed by 8 ``y`` applied, such that there are 8 ``x`` values in memory followed by 8 ``y``
values, and so forth. Here is the effective declaration of ``soa<8> values, and so forth. Here is the effective declaration of ``soa<8>
Point``: Point``:
@@ -2266,7 +2266,7 @@ based on C++'s ``new`` and ``delete`` operators:
// use ptr... // use ptr...
delete[] ptr; delete[] ptr;
In the above code, each program instance allocates its own ``count`-sized In the above code, each program instance allocates its own ``count`` sized
array of ``uniform int`` values, uses that memory, and then deallocates array of ``uniform int`` values, uses that memory, and then deallocates
that memory. Uses of ``new`` and ``delete`` in ``ispc`` programs are that memory. Uses of ``new`` and ``delete`` in ``ispc`` programs are
serviced by corresponding calls the system C library's ``malloc()`` and serviced by corresponding calls the system C library's ``malloc()`` and
@@ -2277,9 +2277,7 @@ analogous to the corresponding rules are for pointers (as described in
`Pointer Types`_.) Specifically, if a specific rate qualifier isn't `Pointer Types`_.) Specifically, if a specific rate qualifier isn't
provided with the ``new`` expression, then the default is that a "varying" provided with the ``new`` expression, then the default is that a "varying"
``new`` is performed, where each program instance performs a unique ``new`` is performed, where each program instance performs a unique
allocation. The allocated type, in turn, is by default ``uniform`` for allocation. The allocated type, in turn, is by default ``uniform``.
``varying`` ``new`` expressions, and ``varying`` for ``uniform`` new
expressions.
After a pointer has been deleted, it is illegal to access the memory it After a pointer has been deleted, it is illegal to access the memory it
points to. However, that deletion happens on a per-program-instance basis. points to. However, that deletion happens on a per-program-instance basis.
@@ -3491,7 +3489,7 @@ generates the following output on a four-wide compilation target:
:: ::
i = 10, x = [0.000000,1.000000,2.000000,3.000000] i = 10, x = [0.000000,1.000000,2.000000,3.000000]
added to x = [1.000000,2.000000,((2.000000)),((3.000000)] added to x = [1.000000,2.000000,((2.000000)),((3.000000))]
last print of x = [1.000000,2.000000,2.000000,3.000000] last print of x = [1.000000,2.000000,2.000000,3.000000]
When a varying variable is printed, the values for program instances that When a varying variable is printed, the values for program instances that
@@ -4010,8 +4008,8 @@ Systems Programming Support
Atomic Operations and Memory Fences Atomic Operations and Memory Fences
----------------------------------- -----------------------------------
The standard range of atomic memory operations are provided by the standard The standard set of atomic memory operations are provided by the standard
library``ispc``, including variants to handle both uniform and varying library, including variants to handle both uniform and varying
types as well as "local" and "global" atomics. types as well as "local" and "global" atomics.
Local atomics provide atomic behavior across the program instances in a Local atomics provide atomic behavior across the program instances in a