YourWishes/jerryscript
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Fixes regarding to the JerryScript github.io page

Browse Source 
- fixed lists
- image size correction
- fixed code listings formats
- capital letters are used in titles

JerryScript-DCO-1.0-Signed-off-by: István Kádár ikadar@inf.u-szeged.hu
This commit is contained in:
Istvan Kadar
2016-06-14 14:38:20 +02:00
committed by László Langó
parent a3b8bfa9fb
commit abc29eee34
3 changed files with 157 additions and 57 deletions
Download Patch File Download Diff File Expand all files Collapse all files
04.internals.md
+4 -4
View File
@@ -44,7 +44,7 @@ This section describes the compact byte-code (CBC) byte-code representation. The
CBC is a CISC like instruction set which assigns shorter instructions for frequent operations. Many instructions represent multiple atomic tasks which reduces the byte code size. This technique is basically a data compression method.
## Compiled code format
## Compiled Code Format
The memory layout of the compiled byte code is the following.
@@ -222,7 +222,7 @@ ECMA component of the engine is responsible for the following notions:
* Runtime representation
* Garbage collection (GC)
## Data representation
## Data Representation
The major structure for data representation is `ECMA_value`. The lower two bits of this structure encode value tag, which determines the type of the value:
@@ -290,7 +290,7 @@ A property is 7 bit long and its type field is 2 bit long which consumes 9 bit w
#### Property Hashmap
If the number of property pairs reach a limit (currently this limit is defined to 16), a hash map (called [property hashmap](#Property Hashmap)) is inserted at the first position of the property pair list, in order to find a property using it, instead of finding it by iterating linearly over the property pairs.
If the number of property pairs reach a limit (currently this limit is defined to 16), a hash map (called [Property Hashmap](#Property Hashmap)) is inserted at the first position of the property pair list, in order to find a property using it, instead of finding it by iterating linearly over the property pairs.
Property hashmap contains 2<sup>n</sup> elements, where 2<sup>n</sup> is larger than the number of properties of the object. Each element can have tree types of value:
@@ -326,7 +326,7 @@ Collections are array-like data structures, which are optimized to save memory.
### Exception Handling
In order to implement a sense of exception handling, the return values of JerryScript functions are able to indicate their faulty or "exceptional" operation. The return values are actually ECMA values (see section [Data representation](#data representation)) in which the error bit is set if an erroneous operation is occurred.
In order to implement a sense of exception handling, the return values of JerryScript functions are able to indicate their faulty or "exceptional" operation. The return values are actually ECMA values (see section [Data Representation](#data-representation)) in which the error bit is set if an erroneous operation is occurred.
### Value Management and Ownership