Merge pull request #2483 from github/cut-release-v4.5.8

v4.5.8 release
Merge pull request #2180 from pchaigno/inc-extension
2025-10-29 17:50:22 +00:00 · 2015-07-10 22:57:07 +01:00 · 2015-07-08 19:25:50 +01:00 · 2015-07-05 14:45:35 +02:00 · 2015-07-05 12:48:22 +02:00 · 2015-07-05 12:48:12 +02:00
60 changed files with 10030 additions and 55684 deletions
--- a/.gitmodules
+++ b/.gitmodules
@@ -629,6 +629,9 @@
 [submodule "vendor/grammars/jflex.tmbundle"]
 	path = vendor/grammars/jflex.tmbundle
 	url = https://github.com/jflex-de/jflex.tmbundle.git
+[submodule "vendor/grammars/Sublime-Modula-2"]
+	path = vendor/grammars/Sublime-Modula-2
+	url = https://github.com/harogaston/Sublime-Modula-2
 [submodule "vendor/grammars/ada.tmbundle"]
 	path = vendor/grammars/ada.tmbundle
 	url = https://github.com/textmate/ada.tmbundle
@@ -647,3 +650,6 @@
 [submodule "vendor/grammars/atom-fsharp"]
 	path = vendor/grammars/atom-fsharp
 	url = https://github.com/fsprojects/atom-fsharp
+[submodule "vendor/grammars/SMT.tmbundle"]
+	path = vendor/grammars/SMT.tmbundle
+	url = https://github.com/SRI-CSL/SMT.tmbundle.git
--- a/CONTRIBUTING.md
+++ b/CONTRIBUTING.md
@@ -2,9 +2,27 @@

 Hi there! We're thrilled that you'd like to contribute to this project. Your help is essential for keeping it great. The majority of contributions won't need to touch any Ruby code at all.

+
+## Adding an extension to a language
+
+We try only to add new extensions once they have some usage on GitHub. In most cases we prefer that extensions be in use in hundreds of repositories before supporting them in Linguist.
+
+To add support for a new extension:
+
+0. Add your extension to the language entry in [`languages.yml`][languages].
+0. Add at least one sample for your extension to the [samples directory][samples] in the correct subdirectory.
+0. Open a pull request, linking to a [GitHub search result](https://github.com/search?utf8=%E2%9C%93&q=extension%3Aboot+NOT+nothack&type=Code&ref=searchresults) showing in-the-wild usage.
+
+In addition, if this extension is already listed in [`languages.yml`][languages] then sometimes a few more steps will need to be taken:
+
+0. Make sure that example `.yourextension` files are present in the [samples directory][samples] for each language that uses `.yourextension`.
+0. Test the performance of the Bayesian classifier with a relatively large number (1000s) of sample `.yourextension` files. (ping @arfon or @bkeepers to help with this) to ensure we're not misclassifying files.
+0. If the Bayesian classifier does a bad job with the sample `.yourextension` files then a [heuristic](https://github.com/github/linguist/blob/master/lib/linguist/heuristics.rb) may need to be written to help.
+
+
 ## Adding a language

-We try only to add languages once they have some usage on GitHub. In most cases we prefer that languages be in use in hundreds of repositories before supporting them in Linguist.
+We try only to add languages once they have some usage on GitHub. In most cases we prefer that each new file extension be in use in hundreds of repositories before supporting them in Linguist.

 To add support for a new language:

@@ -23,12 +41,14 @@ In addition, if your new language defines an extension that's already listed in

 Remember, the goal here is to try and avoid false positives!

+
 ## Fixing a misclassified language

 Most languages are detected by their file extension defined in [languages.yml][languages].  For disambiguating between files with common extensions, linguist applies some [heuristics](/lib/linguist/heuristics.rb) and a [statistical classifier](lib/linguist/classifier.rb). This process can help differentiate between, for example, `.h` files which could be either C, C++, or Obj-C.

 Misclassifications can often be solved by either adding a new filename or extension for the language or adding more [samples][samples] to make the classifier smarter.

+
 ## Fixing syntax highlighting

 Syntax highlighting in GitHub is performed using TextMate-compatible grammars. These are the same grammars that TextMate, Sublime Text and Atom use. Every language in [languages.yml][languages] is mapped to its corresponding TM `scope`. This scope will be used when picking up a grammar for highlighting.
@@ -55,6 +75,7 @@ Sometimes getting the tests running can be too much work, especially if you don'

 Here's our current build status: [![Build Status](https://secure.travis-ci.org/github/linguist.png?branch=master)](http://travis-ci.org/github/linguist)

+
 ## Releasing

 If you are the current maintainer of this gem:
--- a/grammars.yml
+++ b/grammars.yml
@@ -85,6 +85,8 @@ vendor/grammars/Racket:
 - source.racket
 vendor/grammars/SCSS.tmbundle:
 - source.scss
+vendor/grammars/SMT.tmbundle:
+- source.smt
 vendor/grammars/Scalate.tmbundle:
 - source.scaml
 - text.html.ssp
@@ -107,6 +109,8 @@ vendor/grammars/Sublime-Logos:
 - source.logos
 vendor/grammars/Sublime-Loom:
 - source.loomscript
+vendor/grammars/Sublime-Modula-2/:
+- source.modula2
 vendor/grammars/Sublime-Nit:
 - source.nit
 vendor/grammars/Sublime-QML:
--- a/lib/linguist/generated.rb
+++ b/lib/linguist/generated.rb
@@ -69,8 +69,9 @@ module Linguist
      generated_protocol_buffer? ||
      generated_apache_thrift? ||
      generated_jni_header? ||
-      generated_unity3d_meta? ||
-      vcr_cassette?
+      vcr_cassette? ||
+      generated_module? ||
+      generated_unity3d_meta?
    end

    # Internal: Is the blob an Xcode file?
@@ -324,6 +325,24 @@ module Linguist
      return lines[0].include?("Generated by Cython")
    end

+    # Internal: Is it a KiCAD or GFortran module file?
+    #
+    # KiCAD module files contain:
+    # PCBNEW-LibModule-V1  yyyy-mm-dd h:mm:ss XM
+    # on the first line.
+    #
+    # GFortran module files contain:
+    # GFORTRAN module version 'x' created from 
+    # on the first line.
+    #
+    # Return true of false
+    def generated_module?
+      return false unless extname == '.mod'
+      return false unless lines.count > 1
+      return lines[0].include?("PCBNEW-LibModule-V") || 
+              lines[0].include?("GFORTRAN module version '")
+    end
+
    # Internal: Is this a metadata file from Unity3D?
    #
    # Unity3D Meta files start with:
--- a/lib/linguist/heuristics.rb
+++ b/lib/linguist/heuristics.rb
@@ -274,6 +274,16 @@ module Linguist
      end
    end

+    disambiguate "XML", "Modula-2", "Linux Kernel Module", "AMPL" do |data|
+      if data.include?('<!ENTITY ')
+        Language["XML"]
+      elsif /MODULE\s\w+\s*;/i.match(data) || /^\s*END \w+;$/i.match(data)
+        Language["Modula-2"]
+      else
+        [Language["Linux Kernel Module"], Language["AMPL"]]
+      end
+    end
+
    disambiguate "NL", "NewLisp" do |data|
      if /^(b|g)[0-9]+ /.match(data)
        Language["NL"]
--- a/lib/linguist/languages.yml
+++ b/lib/linguist/languages.yml
@@ -49,6 +49,7 @@ AMPL:
  color: "#E6EFBB"
  extensions:
  - .ampl
+  - .mod
  tm_scope: source.ampl
  ace_mode: text

@@ -225,6 +226,7 @@ Assembly:
  extensions:
  - .asm
  - .a51
+  - .inc
  - .nasm
  tm_scope: source.asm.x86
  ace_mode: assembly_x86
@@ -411,6 +413,7 @@ C++:
  - .hh
  - .hpp
  - .hxx
+  - .inc
  - .inl
  - .ipp
  - .tcc
@@ -1269,6 +1272,7 @@ HTML:
  - .html
  - .htm
  - .html.hl
+  - .inc
  - .st
  - .xht
  - .xhtml
@@ -1475,6 +1479,14 @@ Isabelle:
  tm_scope: source.isabelle.theory
  ace_mode: text

+Isabelle ROOT:
+  type: programming
+  group: Isabelle
+  filenames:
+  - ROOT
+  tm_scope: source.isabelle.root
+  ace_mode: text
+
 J:
  type: programming
  color: "#9EEDFF"
@@ -1759,6 +1771,13 @@ Linker Script:
  tm_scope: none
  ace_mode: text

+Linux Kernel Module:
+  type: data
+  extensions:
+  - .mod
+  tm_scope: none
+  ace_mode: text
+
 Liquid:
  type: markup
  extensions:
@@ -2025,6 +2044,13 @@ Modelica:
  tm_scope: source.modelica
  ace_mode: text

+Modula-2:
+  type: programming
+  extensions:
+  - .mod
+  tm_scope: source.modula2
+  ace_mode: text
+
 Module Management System:
  type: programming
  extensions:
@@ -2357,6 +2383,7 @@ PHP:
  - .aw
  - .ctp
  - .fcgi
+  - .inc
  - .php3
  - .php4
  - .php5
@@ -2444,6 +2471,7 @@ Pascal:
  - .pas
  - .dfm
  - .dpr
+  - .inc
  - .lpr
  - .pp
  ace_mode: pascal
@@ -2919,6 +2947,25 @@ SCSS:
  extensions:
  - .scss

+SMT:
+  type: programming
+  extensions:
+  - .smt2
+  - .smt
+  interpreters:
+  - boolector
+  - cvc4
+  - mathsat5
+  - opensmt
+  - smtinterpol
+  - smt-rat
+  - stp
+  - verit
+  - yices2
+  - z3
+  tm_scope: source.smt
+  ace_mode: text
+
 SPARQL:
  type: data
  tm_scope: source.sparql
@@ -2944,6 +2991,7 @@ SQL:
  - .sql
  - .cql
  - .ddl
+  - .inc
  - .prc
  - .tab
  - .udf
@@ -3142,6 +3190,7 @@ SourcePawn:
  - sourcemod
  extensions:
  - .sp
+  - .inc
  - .sma
  tm_scope: source.sp
  ace_mode: text
@@ -3506,6 +3555,7 @@ XML:
  - .launch
  - .mdpolicy
  - .mm
+  - .mod
  - .mxml
  - .nproj
  - .nuspec
--- a/lib/linguist/repository.rb
+++ b/lib/linguist/repository.rb
@@ -150,9 +150,10 @@ module Linguist
        next if delta.binary

        if [:added, :modified].include? delta.status
-          # Skip submodules
+          # Skip submodules and symlinks
          mode = delta.new_file[:mode]
-          next if (mode & 040000) != 0
+          mode_format = (mode & 0170000)
+          next if mode_format == 0120000 || mode_format == 040000 || mode_format == 0160000

          blob = Linguist::LazyBlob.new(repository, delta.new_file[:oid], new, mode.to_s(8))

--- a/lib/linguist/vendor.yml
+++ b/lib/linguist/vendor.yml
@@ -70,6 +70,7 @@
 - 3rd[-_]?party/
 - vendors?/
 - extern(al)?/
+- (^|/)[Vv]+endor/

 # Debian packaging
 - ^debian/
@@ -172,6 +173,13 @@
 # Sparkle
 - (^|/)Sparkle/

+# Crashlytics
+- Crashlytics.framework/
+
+# Fabric
+- Fabric.framework/
+
+
 ## Groovy ##

 # Gradle
--- a/lib/linguist/version.rb
+++ b/lib/linguist/version.rb
@@ -1,3 +1,3 @@
 module Linguist
-  VERSION = "4.5.7"
+  VERSION = "4.5.8"
 end
--- a/samples/AMPL/CT2.mod
+++ b/samples/AMPL/CT2.mod
@@ -0,0 +1,58 @@
+param num_beams;                  # number of beams
+
+param num_rows >= 1, integer;     # number of rows
+param num_cols >= 1, integer;     # number of columns 
+
+set BEAMS   := 1 .. num_beams;    # set of beams
+
+set ROWS    := 1 .. num_rows;	  # set of rows
+set COLUMNS := 1 .. num_cols;	  # set of columns
+
+# values for entries of each beam
+param beam_values {BEAMS, ROWS, COLUMNS} >= 0; 
+
+# values of tumor
+param tumor_values {ROWS, COLUMNS} >= 0; 
+
+# values of critical area
+param critical_values {ROWS, COLUMNS} >= 0; 
+
+# critical maximum dosage requirement
+param critical_max;
+
+# tumor minimum dosage requirement
+param tumor_min;
+
+# dosage scalar of each beam
+var X {i in BEAMS} >= 0;
+
+
+# define the tumor area which includes the locations where tumor exists
+set tumor_area := {k in ROWS, h in COLUMNS: tumor_values[k,h] > 0};
+
+# define critical area 
+set critical_area := {k in ROWS, h in COLUMNS: critical_values[k,h] > 0};
+
+var S {(k,h) in tumor_area} >= 0;
+var T {(k,h) in critical_area} >= 0;
+
+# maximize total dosage in tumor area
+maximize total_tumor_dosage: sum {i in BEAMS} sum {(k,h) in tumor_area} X[i] * beam_values[i,k,h];
+
+# minimize total dosage in critical area
+minimize total_critical_dosage: sum {i in BEAMS} sum {(k,h) in critical_area} X[i] * beam_values[i,k,h];
+
+# minimize total tumor slack
+minimize total_tumor_slack: sum {(k,h) in tumor_area} S[k,h];
+
+# minimize total critical area slack
+minimize total_critical_slack: sum {(k,h) in critical_area} T[k,h];
+
+# total dosage at each tumor location [k,h] should be >= min tumor dosage with slack variable
+subject to tumor_limit {(k,h) in tumor_area} : sum {i in BEAMS} X[i] * beam_values[i,k,h] == tumor_min - S[k,h];
+
+# total dosage at each critical location [k,h] should be = max critical dosage with slack variable
+subject to critical_limit {(k,h) in critical_area} : sum {i in BEAMS} X[i] * beam_values[i,k,h] == critical_max + T[k,h];
+
+
+
--- a/samples/Assembly/fp_sqr32_160_comba.inc
+++ b/samples/Assembly/fp_sqr32_160_comba.inc
@@ -0,0 +1,245 @@
+
+    push r2
+    dint
+    nop
+    bis #MPYDLYWRTEN,&MPY32CTL0
+    bic #MPYDLY32,&MPY32CTL0
+    mov #SUMEXT,r13
+    clr r12
+
+    mov @r15+,r4
+    mov @r15+,r5
+
+    mov @r15+,r6
+    mov @r15+,r7
+
+    mov @r15+,r8
+    mov @r15+,r9
+
+    mov @r15+,r10
+    mov @r15+,r11
+
+    sub #2*8,r15
+
+    /* SELF_STEP_FIRST */
+    mov r4,&MPY32L
+    mov r5,&MPY32H
+    mov r4,&OP2L
+    mov r5,&OP2H
+
+    /* COLUMN_END */
+    mov &RES0,2*0(r14)
+    mov &RES1,2*(0+1)(r14)
+    mov &RES2,&RES0
+    mov &RES3,&RES1
+    mov r12,&RES2
+    clr &RES3
+
+    /* STEP_1 */
+    mov r4,&MAC32L
+    mov r5,&MAC32H
+    mov r6,&OP2L
+    mov r7,&OP2H
+    add &SUMEXT,r12
+    mov r6,&OP2L
+    mov r7,&OP2H
+
+    /* COLUMN_END */
+    mov &RES0,2*2(r14)
+    add @r13,r12
+    mov &RES1,2*(2+1)(r14)
+    mov &RES2,&RES0
+    mov &RES3,&RES1
+    mov r12,&RES2
+    clr &RES3
+    clr r12
+
+    /* STEP_1 */
+    mov r4,&MAC32L
+    mov r5,&MAC32H
+    mov r8,&OP2L
+    mov r9,&OP2H
+    add &SUMEXT,r12
+    mov r8,&OP2L
+    mov r9,&OP2H
+
+    /* SELF_STEP */
+    mov r6,&MAC32L
+    mov r7,&MAC32H
+    add @r13,r12
+    mov r6,&OP2L
+    mov r7,&OP2H
+
+    /* COLUMN_END */
+    mov &RES0,2*4(r14)
+    add @r13,r12
+    mov &RES1,2*(4+1)(r14)
+    mov &RES2,&RES0
+    mov &RES3,&RES1
+    mov r12,&RES2
+    clr &RES3
+    clr r12
+
+    /* STEP_1 */
+    mov r4,&MAC32L
+    mov r5,&MAC32H
+    mov r10,&OP2L
+    mov r11,&OP2H
+    add &SUMEXT,r12
+    mov r10,&OP2L
+    mov r11,&OP2H
+
+    /* STEP_2MORE */
+    mov r6,&MAC32L
+    mov r7,&MAC32H
+    add @r13,r12
+    mov r8,&OP2L
+    mov r9,&OP2H
+    add &SUMEXT,r12
+    mov r8,&OP2L
+    mov r9,&OP2H
+
+    /* COLUMN_END */
+    mov &RES0,2*6(r14)
+    add @r13,r12
+    mov &RES1,2*(6+1)(r14)
+    mov &RES2,&RES0
+    mov &RES3,&RES1
+    mov r12,&RES2
+    clr &RES3
+    clr r12
+
+    /* STEP_1 */
+    mov r4,&MAC32L
+    mov r5,&MAC32H
+    mov 2*8(r15),&OP2L
+    mov 2*9(r15),&OP2H
+    add &SUMEXT,r12
+    mov 2*8(r15),&OP2L
+    mov 2*9(r15),&OP2H
+
+    /* STEP_2MORE */
+    mov r6,&MAC32L
+    mov r7,&MAC32H
+    add @r13,r12
+    mov r10,&OP2L
+    mov r11,&OP2H
+    add &SUMEXT,r12
+    mov r10,&OP2L
+    mov r11,&OP2H
+
+    /* SELF_STEP */
+    mov r8,&MAC32L
+    mov r9,&MAC32H
+    add @r13,r12
+    mov r8,&OP2L
+    mov r9,&OP2H
+
+    /* COLUMN_END */
+    mov &RES0,2*8(r14)
+    add @r13,r12
+    mov &RES1,2*(8+1)(r14)
+    mov &RES2,&RES0
+    mov &RES3,&RES1
+    mov r12,&RES2
+    clr &RES3
+    clr r12
+
+    mov 2*8(r15),r4
+    mov 2*(8+1)(r15),r5
+
+    /* STEP_1 */
+    mov r6,&MAC32L
+    mov r7,&MAC32H
+    mov r4,&OP2L
+    mov r5,&OP2H
+    add &SUMEXT,r12
+    mov r4,&OP2L
+    mov r5,&OP2H
+
+    /* STEP_2MORE */
+    mov r8,&MAC32L
+    mov r9,&MAC32H
+    add @r13,r12
+    mov r10,&OP2L
+    mov r11,&OP2H
+    add &SUMEXT,r12
+    mov r10,&OP2L
+    mov r11,&OP2H
+
+    /* COLUMN_END */
+    mov &RES0,2*10(r14)
+    add @r13,r12
+    mov &RES1,2*(10+1)(r14)
+    mov &RES2,&RES0
+    mov &RES3,&RES1
+    mov r12,&RES2
+    clr &RES3
+    clr r12
+
+    /* STEP_1 */
+    mov r8,&MAC32L
+    mov r9,&MAC32H
+    mov r4,&OP2L
+    mov r5,&OP2H
+    add &SUMEXT,r12
+    mov r4,&OP2L
+    mov r5,&OP2H
+
+    /* SELF_STEP */
+    mov r10,&MAC32L
+    mov r11,&MAC32H
+    add @r13,r12
+    mov r10,&OP2L
+    mov r11,&OP2H
+
+    /* COLUMN_END */
+    mov &RES0,2*12(r14)
+    add @r13,r12
+    mov &RES1,2*(12+1)(r14)
+    mov &RES2,&RES0
+    mov &RES3,&RES1
+    mov r12,&RES2
+    clr &RES3
+    clr r12
+
+    /* STEP_1 */
+    mov r10,&MAC32L
+    mov r11,&MAC32H
+    mov r4,&OP2L
+    mov r5,&OP2H
+    add &SUMEXT,r12
+    mov r4,&OP2L
+    mov r5,&OP2H
+
+    /* COLUMN_END */
+    mov &RES0,2*14(r14)
+    add @r13,r12
+    mov &RES1,2*(14+1)(r14)
+    mov &RES2,&RES0
+    mov &RES3,&RES1
+    mov r12,&RES2
+    clr &RES3
+    clr r12
+
+    /* SELF_STEP_1 */
+    mov r4,&MAC32L
+    mov r5,&MAC32H
+    mov r4,&OP2L
+    mov r5,&OP2H
+
+    /* COLUMN_END */
+    mov &RES0,2*16(r14)
+    add @r13,r12
+    mov &RES1,2*(16+1)(r14)
+    mov &RES2,&RES0
+    mov &RES3,&RES1
+    mov r12,&RES2
+    clr &RES3
+    clr r12
+
+    /* END */
+    mov &RES0,2*18(r14)
+    mov &RES1,2*(18+1)(r14)
+    pop r2
+    eint
--- a/samples/Assembly/lib.inc
+++ b/samples/Assembly/lib.inc
@@ -0,0 +1,170 @@
+
+; ------------------------------------------------------------------------
+; 显示 AL 中的数字
+; ------------------------------------------------------------------------
+DispAL:
+	push	ecx
+	push	edx
+	push	edi
+
+	mov	edi, [dwDispPos]
+
+	mov	ah, 0Fh			; 0000b: 黑底    1111b: 白字
+	mov	dl, al
+	shr	al, 4
+	mov	ecx, 2
+.begin:
+	and	al, 01111b
+	cmp	al, 9
+	ja	.1
+	add	al, '0'
+	jmp	.2
+.1:
+	sub	al, 0Ah
+	add	al, 'A'
+.2:
+	mov	[gs:edi], ax
+	add	edi, 2
+
+	mov	al, dl
+	loop	.begin
+	;add	edi, 2
+
+	mov	[dwDispPos], edi
+
+	pop	edi
+	pop	edx
+	pop	ecx
+
+	ret
+; DispAL 结束-------------------------------------------------------------
+
+
+; ------------------------------------------------------------------------
+; 显示一个整形数
+; ------------------------------------------------------------------------
+DispInt:
+	mov	eax, [esp + 4]
+	shr	eax, 24
+	call	DispAL
+
+	mov	eax, [esp + 4]
+	shr	eax, 16
+	call	DispAL
+
+	mov	eax, [esp + 4]
+	shr	eax, 8
+	call	DispAL
+
+	mov	eax, [esp + 4]
+	call	DispAL
+
+	mov	ah, 07h			; 0000b: 黑底    0111b: 灰字
+	mov	al, 'h'
+	push	edi
+	mov	edi, [dwDispPos]
+	mov	[gs:edi], ax
+	add	edi, 4
+	mov	[dwDispPos], edi
+	pop	edi
+
+	ret
+; DispInt 结束------------------------------------------------------------
+
+; ------------------------------------------------------------------------
+; 显示一个字符串
+; ------------------------------------------------------------------------
+DispStr:
+	push	ebp
+	mov	ebp, esp
+	push	ebx
+	push	esi
+	push	edi
+
+	mov	esi, [ebp + 8]	; pszInfo
+	mov	edi, [dwDispPos]
+	mov	ah, 0Fh
+.1:
+	lodsb
+	test	al, al
+	jz	.2
+	cmp	al, 0Ah	; 是回车吗?
+	jnz	.3
+	push	eax
+	mov	eax, edi
+	mov	bl, 160
+	div	bl
+	and	eax, 0FFh
+	inc	eax
+	mov	bl, 160
+	mul	bl
+	mov	edi, eax
+	pop	eax
+	jmp	.1
+.3:
+	mov	[gs:edi], ax
+	add	edi, 2
+	jmp	.1
+
+.2:
+	mov	[dwDispPos], edi
+
+	pop	edi
+	pop	esi
+	pop	ebx
+	pop	ebp
+	ret
+; DispStr 结束------------------------------------------------------------
+
+; ------------------------------------------------------------------------
+; 换行
+; ------------------------------------------------------------------------
+DispReturn:
+	push	szReturn
+	call	DispStr			;printf("\n");
+	add	esp, 4
+
+	ret
+; DispReturn 结束---------------------------------------------------------
+
+
+; ------------------------------------------------------------------------
+; 内存拷贝，仿 memcpy
+; ------------------------------------------------------------------------
+; void* MemCpy(void* es:pDest, void* ds:pSrc, int iSize);
+; ------------------------------------------------------------------------
+MemCpy:
+	push	ebp
+	mov	ebp, esp
+
+	push	esi
+	push	edi
+	push	ecx
+
+	mov	edi, [ebp + 8]	; Destination
+	mov	esi, [ebp + 12]	; Source
+	mov	ecx, [ebp + 16]	; Counter
+.1:
+	cmp	ecx, 0		; 判断计数器
+	jz	.2		; 计数器为零时跳出
+
+	mov	al, [ds:esi]		; ┓
+	inc	esi			; ┃
+					; ┣ 逐字节移动
+	mov	byte [es:edi], al	; ┃
+	inc	edi			; ┛
+
+	dec	ecx		; 计数器减一
+	jmp	.1		; 循环
+.2:
+	mov	eax, [ebp + 8]	; 返回值
+
+	pop	ecx
+	pop	edi
+	pop	esi
+	mov	esp, ebp
+	pop	ebp
+
+	ret			; 函数结束，返回
+; MemCpy 结束-------------------------------------------------------------
+
--- a/samples/Assembly/macros.inc
+++ b/samples/Assembly/macros.inc
@@ -0,0 +1,321 @@
+BLARGG_MACROS_INCLUDED = 1
+
+; Allows extra error checking with modified version
+; of ca65. Otherwise acts like a constant of 0.
+ADDR = 0
+
+; Switches to Segment and places Line there.
+; Line can be an .align directive, .res, .byte, etc.
+; Examples:
+; seg_data BSS, .align 256
+; seg_data RODATA, {message: .byte "Test",0}
+.macro seg_data Segment, Line
+	.pushseg
+	.segment .string(Segment)
+		Line
+	.popseg
+.endmacro
+
+; Reserves Size bytes in Segment for Name.
+; If Size is omitted, reserves one byte.
+.macro seg_res Segment, Name, Size
+	.ifblank Size
+		seg_data Segment, Name: .res 1
+	.else
+		seg_data Segment, Name: .res Size
+	.endif
+.endmacro
+
+; Shortcuts for zeropage, bss, and stack
+.define zp_res  seg_res ZEROPAGE,
+.define nv_res  seg_res NVRAM,
+.define bss_res seg_res BSS,
+.define sp_res  seg_res STACK,
+.define zp_byte zp_res
+
+; Copies byte from Src to Addr. If Src begins with #,
+; it sets Addr to the immediate value.
+; Out: A = byte copied
+; Preserved: X, Y
+.macro mov Addr, Src
+	lda Src
+	sta Addr
+.endmacro
+
+; Copies word from Src to Addr. If Src begins with #,
+; it sets Addr the immediate value.
+; Out: A = high byte of word
+; Preserved: X, Y
+.macro movw Addr, Src
+	.if .match( .left( 1, {Src} ), # )
+		lda #<(.right( .tcount( {Src} )-1, {Src} ))
+		sta Addr
+		lda #>(.right( .tcount( {Src} )-1, {Src} ))
+		sta 1+(Addr)
+	.else
+		lda Src
+		sta Addr
+		lda 1+(Src)
+		sta 1+(Addr)
+	.endif
+.endmacro
+
+; Increments 16-bit value at Addr.
+; Out: EQ/NE based on resulting 16-bit value
+; Preserved: A, X, Y
+.macro incw Addr
+	.local @Skip
+	inc Addr
+	bne @Skip
+	inc 1+(Addr)
+@Skip:
+.endmacro
+
+; Adds Src to word at Addr.
+; Out: A = high byte of result, carry set appropriately
+; Preserved: X, Y
+.macro addw Addr, Src
+	.if .match( .left( 1, {Src} ), # )
+		addw_ Addr,(.right( .tcount( {Src} )-1, {Src} ))
+	.else
+		lda Addr
+		clc
+		adc Src
+		sta Addr
+		
+		lda 1+(Addr)
+		adc 1+(Src)
+		sta 1+(Addr)
+	.endif
+.endmacro
+.macro addw_ Addr, Imm
+	lda Addr
+	clc
+	adc #<Imm
+	sta Addr
+	
+	;.if (Imm >> 8) <> 0
+		lda 1+(Addr)
+		adc #>Imm
+		sta 1+(Addr)
+	;.else
+	;   .local @Skip
+	;   bcc @Skip
+	;   inc 1+(Addr)
+	;@Skip:
+	;.endif
+.endmacro
+
+; Splits list of words into tables of low and high bytes
+; Example: split_words foo, {$1234, $5678}
+; expands to:
+; foo_l: $34, $78
+; foo_h: $12, $56
+; foo_count = 2
+.macro split_words Label, Words
+	.ident (.concat (.string(Label), "_l")): .lobytes Words
+	.ident (.concat (.string(Label), "_h")): .hibytes Words
+	.ident (.concat (.string(Label), "_count")) = * - .ident (.concat (.string(Label), "_h"))
+.endmacro
+
+.macro SELECT Bool, True, False, Extra
+	.ifndef Bool
+		False Extra
+	.elseif Bool <> 0
+		True Extra
+	.else
+		False Extra
+	.endif
+.endmacro
+
+.macro DEFAULT Name, Value
+	.ifndef Name
+		Name = Value
+	.endif
+.endmacro
+
+.ifp02
+	; 6502 doesn't define these alternate names
+	.define blt bcc
+	.define bge bcs
+.endif
+.define jlt jcc
+.define jge jcs
+
+; Jxx Target = Bxx Target, except it can go farther than
+; 128 bytes. Implemented via branch around a JMP.
+
+; Don't use ca65's longbranch, because they fail for @labels
+;.macpack longbranch
+
+.macro jeq Target
+	bne *+5
+	jmp Target
+.endmacro
+
+.macro jne Target
+	beq *+5
+	jmp Target
+.endmacro
+
+.macro jmi Target
+	bpl *+5
+	jmp Target
+.endmacro
+
+.macro jpl Target
+	bmi *+5
+	jmp Target
+.endmacro
+
+.macro jcs Target
+	bcc *+5
+	jmp Target
+.endmacro
+
+.macro jcc Target
+	bcs *+5
+	jmp Target
+.endmacro
+
+.macro jvs Target
+	bvc *+5
+	jmp Target
+.endmacro
+
+.macro jvc Target
+	bvs *+5
+	jmp Target
+.endmacro
+
+
+; Passes constant data to routine in addr
+; Preserved: A, X, Y
+.macro jsr_with_addr routine,data
+	.local Addr
+	pha
+	lda #<Addr
+	sta addr
+	lda #>Addr
+	sta addr+1
+	pla
+	jsr routine
+	seg_data RODATA,{Addr: data}
+.endmacro
+
+; Calls routine multiple times, with A having the
+; value 'start' the first time, 'start+step' the
+; second time, up to 'end' for the last time.
+.macro for_loop routine,start,end,step
+	.local @for_loop
+	lda #start
+@for_loop:
+	pha
+	jsr routine
+	pla
+	clc
+	adc #step
+	cmp #<((end)+(step))
+	bne @for_loop
+.endmacro
+
+; Calls routine n times. The value of A in the routine
+; counts from 0 to n-1.
+.macro loop_n_times routine,n
+	for_loop routine,0,n-1,+1
+.endmacro
+
+; Same as for_loop, except uses 16-bit value in YX.
+; -256 <= step <= 255
+.macro for_loop16 routine,start,end,step
+.if (step) < -256 || (step) > 255
+	.error "Step must be within -256 to 255"
+.endif
+	.local @for_loop_skip
+	.local @for_loop
+	ldy #>(start)
+	lda #<(start)
+@for_loop:
+	tax
+	pha
+	tya
+	pha
+	jsr routine
+	pla
+	tay
+	pla
+	clc
+	adc #step
+.if (step) > 0
+	bcc @for_loop_skip
+	iny
+.else
+	bcs @for_loop_skip
+	dey
+.endif
+@for_loop_skip:
+	cmp #<((end)+(step))
+	bne @for_loop
+	cpy #>((end)+(step))
+	bne @for_loop
+.endmacro
+
+; Stores byte at addr
+; Preserved: X, Y
+.macro setb addr, byte
+	lda #byte
+	sta addr
+.endmacro
+
+; Stores word at addr
+; Preserved: X, Y
+.macro setw addr, word
+	lda #<(word)
+	sta addr
+	lda #>(word)
+	sta addr+1
+.endmacro
+
+; Loads XY with 16-bit immediate or value at address
+.macro ldxy Arg
+	.if .match( .left( 1, {Arg} ), # )
+		ldy #<(.right( .tcount( {Arg} )-1, {Arg} ))
+		ldx #>(.right( .tcount( {Arg} )-1, {Arg} ))
+	.else
+		ldy (Arg)
+		ldx (Arg)+1
+	.endif
+.endmacro
+
+; Increments XY as 16-bit register, in CONSTANT time.
+; Z flag set based on entire result.
+; Preserved: A
+; Time: 7 clocks
+.macro inxy
+	iny ; 2
+	beq *+4 ; 3
+		; -1
+	bne *+3 ; 3
+		; -1
+	inx ; 2
+.endmacro
+
+; Negates A and adds it to operand
+.macro subaf Operand
+	eor #$FF
+	sec
+	adc Operand
+.endmacro
+
+; Initializes CPU registers to reasonable values
+; Preserved: A, Y
+.macro init_cpu_regs
+	sei
+	cld     ; unnecessary on NES, but might help on clone
+	ldx #$FF
+	txs
+	.ifndef BUILD_NSF
+		inx
+		stx PPUCTRL
+	.endif
+.endmacro
--- a/samples/C++/ClasspathVMSystemProperties.inc
+++ b/samples/C++/ClasspathVMSystemProperties.inc
@@ -0,0 +1,57 @@
+//===- ClasspathVMSystem/Properties.cpp -----------------------------------===//
+//===--------------------- GNU classpath gnu/classpath/VMSystemProperties -===//
+//
+//                            The VMKit project
+//
+// This file is distributed under the University of Illinois Open Source
+// License. See LICENSE.TXT for details.
+//
+//===----------------------------------------------------------------------===//
+
+#include <sys/utsname.h>
+
+#include "types.h"
+
+#include "Classpath.h"
+#include "JavaArray.h"
+#include "JavaClass.h"
+#include "JavaObject.h"
+#include "JavaThread.h"
+#include "JavaUpcalls.h"
+#include "Jnjvm.h"
+
+#include "SetProperties.inc"
+
+using namespace j3;
+
+extern "C" {
+
+
+JNIEXPORT void JNICALL Java_gnu_classpath_VMSystemProperties_preInit(
+#ifdef NATIVE_JNI
+JNIEnv *env,
+jclass clazz,
+#endif
+JavaObject* prop) {
+  
+  llvm_gcroot(prop, 0);
+
+  BEGIN_NATIVE_EXCEPTION(0)
+
+  setProperties(prop);
+
+  END_NATIVE_EXCEPTION
+}
+
+extern "C" void Java_gnu_classpath_VMSystemProperties_postInit__Ljava_util_Properties_2(JavaObject* prop) {
+
+  llvm_gcroot(prop, 0);
+
+  BEGIN_NATIVE_EXCEPTION(0)
+
+  setCommandLineProperties(prop);
+
+  END_NATIVE_EXCEPTION
+}
+
+}
--- a/samples/C++/initClasses.inc
+++ b/samples/C++/initClasses.inc
--- a/samples/C++/instances.inc
+++ b/samples/C++/instances.inc
@@ -0,0 +1,34 @@
+#include "QPBO.h"
+
+#ifdef _MSC_VER
+#pragma warning(disable: 4661)
+#endif
+
+// Instantiations
+
+template class QPBO<int>;
+template class QPBO<float>;
+template class QPBO<double>;
+
+template <> 
+	inline void QPBO<int>::get_type_information(char*& type_name, char*& type_format)
+{
+	type_name = "int";
+	type_format = "d";
+}
+
+template <> 
+	inline void QPBO<float>::get_type_information(char*& type_name, char*& type_format)
+{
+	type_name = "float";
+	type_format = "f";
+}
+
+template <> 
+	inline void QPBO<double>::get_type_information(char*& type_name, char*& type_format)
+{
+	type_name = "double";
+	type_format = "Lf";
+}
+
+
--- a/samples/G-code/lm.g
+++ b/samples/G-code/lm.g
--- a/samples/G-code/rm.g
+++ b/samples/G-code/rm.g
--- a/samples/HTML/rpanel.inc
+++ b/samples/HTML/rpanel.inc
@@ -0,0 +1,31 @@
+<!DOCTYPE html>
+<html>
+<head>
+<link rel="stylesheet" charset="UTF-8" type="text/css" href="main.css">
+<meta charset="UTF-8">
+</head>
+<body>
+    <div id="panel_header_main_form">
+        <p id="panel_header_main_form_title">Поддержка:</p>
+    </div>
+    <table>
+        <tbody>
+            <tr>
+                <td>    
+                    <p>Москва:</p>
+                </td>
+                <td>    
+                    <p>+7-902-7-800-807</p>
+                </td>
+            </tr>
+            <tr>
+                <td>    
+                    <p>Регионы:</p>
+                </td>
+                <td>    
+                    <p>+7-902-7-800-807</p>
+                </td>
+            </tr>
+        </tbody>
+    </table>
+</body>
--- a/samples/HTML/tailDel.inc
+++ b/samples/HTML/tailDel.inc
@@ -0,0 +1,5 @@
+</UL>
+<P><A HREF="devices.html">Supported Targets</A></P>
+</BODY>
+</HEAD>
+
--- a/ROOT/filenames/ROOT
+++ b/ROOT/filenames/ROOT
--- a/Module/bcm4334x.mod
+++ b/Module/bcm4334x.mod
@@ -0,0 +1,2 @@
+/data/israel/edison/poky/meta-edison/recipes-kernel/bcm43340/driver_bcm43x/bcm4334x.ko
+/data/israel/edison/poky/meta-edison/recipes-kernel/bcm43340/driver_bcm43x/dhd_pno.o /data/israel/edison/poky/meta-edison/recipes-kernel/bcm43340/driver_bcm43x/dhd_common.o /data/israel/edison/poky/meta-edison/recipes-kernel/bcm43340/driver_bcm43x/dhd_ip.o /data/israel/edison/poky/meta-edison/recipes-kernel/bcm43340/driver_bcm43x/dhd_custom_gpio.o /data/israel/edison/poky/meta-edison/recipes-kernel/bcm43340/driver_bcm43x/dhd_linux.o /data/israel/edison/poky/meta-edison/recipes-kernel/bcm43340/driver_bcm43x/dhd_linux_sched.o /data/israel/edison/poky/meta-edison/recipes-kernel/bcm43340/driver_bcm43x/dhd_cfg80211.o /data/israel/edison/poky/meta-edison/recipes-kernel/bcm43340/driver_bcm43x/dhd_linux_wq.o /data/israel/edison/poky/meta-edison/recipes-kernel/bcm43340/driver_bcm43x/aiutils.o /data/israel/edison/poky/meta-edison/recipes-kernel/bcm43340/driver_bcm43x/bcmevent.o /data/israel/edison/poky/meta-edison/recipes-kernel/bcm43340/driver_bcm43x/bcmutils.o /data/israel/edison/poky/meta-edison/recipes-kernel/bcm43340/driver_bcm43x/bcmwifi_channels.o /data/israel/edison/poky/meta-edison/recipes-kernel/bcm43340/driver_bcm43x/hndpmu.o /data/israel/edison/poky/meta-edison/recipes-kernel/bcm43340/driver_bcm43x/linux_osl.o /data/israel/edison/poky/meta-edison/recipes-kernel/bcm43340/driver_bcm43x/sbutils.o /data/israel/edison/poky/meta-edison/recipes-kernel/bcm43340/driver_bcm43x/siutils.o /data/israel/edison/poky/meta-edison/recipes-kernel/bcm43340/driver_bcm43x/wl_android.o /data/israel/edison/poky/meta-edison/recipes-kernel/bcm43340/driver_bcm43x/wl_cfg80211.o /data/israel/edison/poky/meta-edison/recipes-kernel/bcm43340/driver_bcm43x/wl_cfgp2p.o /data/israel/edison/poky/meta-edison/recipes-kernel/bcm43340/driver_bcm43x/wl_cfg_btcoex.o /data/israel/edison/poky/meta-edison/recipes-kernel/bcm43340/driver_bcm43x/wldev_common.o /data/israel/edison/poky/meta-edison/recipes-kernel/bcm43340/driver_bcm43x/wl_linux_mon.o /data/israel/edison/poky/meta-edison/recipes-kernel/bcm43340/driver_bcm43x/dhd_linux_platdev.o /data/israel/edison/poky/meta-edison/recipes-kernel/bcm43340/driver_bcm43x/bcmsdh.o /data/israel/edison/poky/meta-edison/recipes-kernel/bcm43340/driver_bcm43x/bcmsdh_linux.o /data/israel/edison/poky/meta-edison/recipes-kernel/bcm43340/driver_bcm43x/bcmsdh_sdmmc.o /data/israel/edison/poky/meta-edison/recipes-kernel/bcm43340/driver_bcm43x/bcmsdh_sdmmc_linux.o /data/israel/edison/poky/meta-edison/recipes-kernel/bcm43340/driver_bcm43x/dhd_cdc.o /data/israel/edison/poky/meta-edison/recipes-kernel/bcm43340/driver_bcm43x/dhd_wlfc.o /data/israel/edison/poky/meta-edison/recipes-kernel/bcm43340/driver_bcm43x/dhd_sdio.o
--- a/Module/mbcache.mod
+++ b/Module/mbcache.mod
@@ -0,0 +1,2 @@
+fs/mbcache.ko
+fs/mbcache.o
--- a/Module/md5.mod
+++ b/Module/md5.mod
@@ -0,0 +1,2 @@
+crypto/md5.ko
+crypto/md5.o
--- a/samples/Modula-2/HuffChan.mod
+++ b/samples/Modula-2/HuffChan.mod
@@ -0,0 +1,329 @@
+IMPLEMENTATION MODULE HuffChan;
+
+(*
+ This module shows how to redefine standard IO file functions. It provides
+ functions for reading and writing packed files opened in Raw mode.
+*)
+
+IMPORT IOChan, IOLink, ChanConsts, IOConsts, SYSTEM, Strings;
+FROM Storage IMPORT ALLOCATE, DEALLOCATE;
+
+CONST
+  rbldFrq = 512;	(* means: every 512 bytes rebuild table *)
+
+TYPE
+  charTap  = POINTER TO ARRAY [0..MAX(INTEGER)-1] OF CHAR;
+  smbTp = POINTER TO smbT;
+
+  smbT = RECORD			(* Huffman's tree *)
+    ch			: CHAR;
+    n			: CARDINAL; (* frequncy of char ch *)
+    left,right,next	: smbTp;
+  END;
+
+  tblT = RECORD		(* bit sequence for code *)
+    vl		: CARDINAL;	(* bit sequence *)
+    cnt		: INTEGER;	(* it length *)
+  END;
+
+  lclDataT = RECORD	(* channel's local data *)
+    tRoot 	: smbTp;
+    htbl	: ARRAY [0..255] OF tblT;     (* code -> bit sequence table *)
+    ftbl  	: ARRAY [0..255] OF CARDINAL; (* frequncey table *)
+    wBf,rb1,rb2	: CARDINAL;
+    wbc,rbc,smc	: INTEGER;
+    chid	: IOChan.ChanId;
+  END;
+  lclDataTp = POINTER TO lclDataT;
+  charp     = POINTER TO CHAR;
+
+VAR
+  did	: IOLink.DeviceId;
+  ldt	: lclDataTp;
+
+
+PROCEDURE Shf(a:CARDINAL; b : INTEGER) : CARDINAL; (* shl a,b (or shr) *)
+BEGIN
+  RETURN SYSTEM.CAST(CARDINAL,SYSTEM.SHIFT(SYSTEM.CAST(BITSET,a),b));
+END Shf;
+
+PROCEDURE wrDword(a:CARDINAL);	(* write 4 bytes to file *)
+BEGIN
+  IOChan.RawWrite(ldt^.chid,SYSTEM.ADR(a),4);
+END wrDword;
+
+PROCEDURE rdDword() : CARDINAL;  (* read 4 bytes from file *)
+VAR
+  a,z : CARDINAL;
+BEGIN
+  a:=0;
+  IOChan.RawRead(ldt^.chid,SYSTEM.ADR(a),4,z);
+  RETURN a;
+END rdDword;
+
+PROCEDURE wrSmb(ch : CHAR);	(* write bit sequence for code ch *)
+VAR
+  v,h : CARDINAL;
+  b,c : INTEGER;
+BEGIN
+  WITH ldt^ DO
+    v:=htbl[ORD(ch)].vl;
+    c:=htbl[ORD(ch)].cnt;
+    IF c+wbc<=32 THEN
+      wBf:=Shf(wBf,c);
+      wBf:=wBf+v;
+      wbc:=wbc+c;
+      IF wbc=32 THEN
+	wrDword(wBf);
+	wBf:=0; wbc:=0;
+      END;
+      RETURN;
+    END;
+    b:=c+wbc-32;
+    h:=Shf(v,-b);
+    wBf:=Shf(wBf,32-wbc)+h;
+    wrDword(wBf);
+    wBf:=v-Shf(h,b);
+    wbc:=b;
+  END;
+END wrSmb;
+
+PROCEDURE flush();	(* write data in buffer *)
+BEGIN
+  WITH ldt^ DO
+    wBf:=Shf(wBf,32-wbc);
+    wrDword(wBf);
+  END;
+END flush;
+
+PROCEDURE getSym() : CHAR; (* find code for first bit sequence in buffer *)
+VAR
+  t,i : CARDINAL;
+  b   : INTEGER;
+BEGIN
+  WITH ldt^ DO
+    IF rbc<=32 THEN
+      rb2:=rdDword();
+      t:=Shf(rb2,-rbc);
+      IF rbc=32 THEN t:=0; END;
+      rb1:=rb1+t;
+      rb2:=Shf(rb2,32-rbc);
+      IF rbc=0 THEN rb2:=0; END;
+      rbc:=rbc+32;
+    END;
+    FOR i:=0 TO 255 DO
+      t:=Shf(rb1,htbl[i].cnt-32);
+      IF t=htbl[i].vl THEN
+	rb1:=Shf(rb1,htbl[i].cnt);
+	b:=32-htbl[i].cnt;
+	t:=Shf(rb2,-b);
+	rb1:=rb1+t;
+	rb2:=Shf(rb2,32-b);
+	rbc:=rbc+b-32;
+	RETURN CHR(i);
+      END;
+    END;
+  END;
+END getSym;
+
+PROCEDURE Insert(s : smbTp); (* insert new character in Huffman's tree *)
+VAR
+  cr : smbTp;
+BEGIN
+  WITH ldt^ DO
+    IF tRoot=NIL THEN
+      cr:=tRoot;
+      tRoot:=s;
+      s^.next:=cr;
+      RETURN;
+    ELSIF tRoot^.n<=s^.n THEN
+      cr:=tRoot;
+      tRoot:=s;
+      s^.next:=cr;
+      RETURN;
+    END;
+    cr:=tRoot;
+    WHILE (cr^.next<>NIL) & (cr^.next^.n>s^.n) DO
+      cr:=cr^.next;
+    END;
+    s^.next:=cr^.next;
+    cr^.next:=s;
+  END;
+END Insert;
+
+PROCEDURE BuildTree(); (* build Huffman's tree *)
+VAR
+  cr,ocr,ncr : smbTp;
+BEGIN
+  WITH ldt^ DO
+    LOOP
+      ocr:=NIL; cr:=tRoot;
+      WHILE cr^.next^.next<>NIL  DO
+	ocr:=cr; cr:=cr^.next;
+      END;
+      NEW(ncr);
+      ncr^.n:=cr^.n+cr^.next^.n;
+      ncr^.left:=cr;
+      ncr^.right:=cr^.next;
+      IF ocr<>NIL THEN
+	ocr^.next:=NIL;
+	Insert(ncr);
+      ELSE
+	tRoot:=NIL;
+	Insert(ncr);
+	EXIT;
+      END;
+    END;
+  END;
+END BuildTree;
+
+PROCEDURE BuildTable(cr: smbTp; vl,n: CARDINAL); (* build table: code -> bit sequence *)
+BEGIN
+  WITH ldt^ DO
+    IF cr^.left=NIL THEN
+      htbl[ORD(cr^.ch)].vl:=vl;
+      htbl[ORD(cr^.ch)].cnt:=n;
+      DISPOSE(cr);
+      RETURN;
+    END;
+    vl:=vl*2;
+    BuildTable(cr^.left,vl,n+1);
+    BuildTable(cr^.right,vl+1,n+1);
+    DISPOSE(cr);
+  END;
+END BuildTable;
+
+PROCEDURE clcTab(); (* build code/bitseq. table from frequency table *)
+VAR
+  i : CARDINAL;
+  s : smbTp;
+BEGIN
+  WITH ldt^ DO
+    tRoot:=NIL;
+    FOR i:=0 TO 255 DO
+      NEW(s);
+      s^.ch:=CHR(i);
+      s^.n:=ftbl[i];
+      s^.left:=NIL; s^.right:=NIL; s^.next:=NIL;
+      Insert(s);
+    END;
+    BuildTree();
+    BuildTable(tRoot,0,0);
+  END;
+END clcTab;
+
+PROCEDURE iniHuf();
+VAR
+  i : CARDINAL;
+BEGIN
+  WITH ldt^ DO
+    FOR i:=0 TO 255 DO
+      ftbl[i]:=1;
+    END;
+    wBf:=0; wbc:=0; rb1:=0; rb2:=0; rbc:=0;
+    smc:=0;
+    clcTab();
+  END;
+END iniHuf;
+
+
+PROCEDURE RawWrite(x: IOLink.DeviceTablePtr; buf: SYSTEM.ADDRESS;
+		len: CARDINAL);
+VAR
+  i	: CARDINAL;
+  ch	: CHAR;
+  cht	: charTap;
+BEGIN
+  IF len = 0 THEN RETURN; END;
+  ldt:=SYSTEM.CAST(lclDataTp,x^.cd);
+  cht:=SYSTEM.CAST(charTap,buf);
+  WITH ldt^ DO
+    FOR i:=0 TO len-1 DO
+      ch:=cht^[i];
+      wrSmb(ch);
+      IF ch = 377C THEN wrSmb(ch); END;
+      ftbl[ORD(ch)]:=ftbl[ORD(ch)]+1; smc:=smc+1;
+      IF smc=rbldFrq THEN
+	clcTab();
+	smc:=0;
+      END;
+    END;
+  END;
+  x^.result:=IOChan.ReadResult(ldt^.chid);
+END RawWrite;
+
+PROCEDURE RawRead(x: IOLink.DeviceTablePtr; buf: SYSTEM.ADDRESS;
+		blen: CARDINAL; VAR len: CARDINAL);
+VAR
+  i	: CARDINAL;
+  cht	: charTap;
+  ch	: CHAR;
+BEGIN
+  ldt:=SYSTEM.CAST(lclDataTp,x^.cd);
+  cht:=SYSTEM.CAST(charTap,buf);
+  IF (blen=0) OR (x^.result<>IOConsts.allRight) THEN len:=0; RETURN; END;
+  WITH ldt^ DO
+    FOR i:=0 TO blen-1 DO
+      ch:=getSym();
+      IF ch = 377C THEN
+	ch:=getSym();
+	IF ch = 0C THEN
+	  x^.result:=IOConsts.endOfInput;
+	  len:=i; cht^[i]:=0C;
+	  RETURN;
+	END;
+      END;
+      cht^[i]:=ch;
+      ftbl[ORD(ch)]:=ftbl[ORD(ch)]+1; smc:=smc+1;
+      IF smc=rbldFrq THEN
+	clcTab();
+	smc:=0;
+      END;
+    END;
+    len:=blen;
+  END;
+END RawRead;
+
+PROCEDURE CreateAlias(VAR cid: ChanId; io: ChanId; VAR res: OpenResults);
+VAR
+  x	: IOLink.DeviceTablePtr;
+BEGIN
+  IOLink.MakeChan(did,cid);
+  IF cid = IOChan.InvalidChan() THEN
+    res:=ChanConsts.outOfChans
+  ELSE
+    NEW(ldt);
+    IF ldt=NIL THEN
+      IOLink.UnMakeChan(did,cid);
+      res:=ChanConsts.outOfChans;
+      RETURN;
+    END;
+    x:=IOLink.DeviceTablePtrValue(cid,did,IOChan.notAvailable,"");
+    ldt^.chid:=io;
+    x^.cd:=ldt;
+    x^.doRawWrite:=RawWrite;
+    x^.doRawRead:=RawRead;
+    res:=ChanConsts.opened;
+    iniHuf();
+    x^.result:=IOConsts.allRight;
+  END;
+END CreateAlias;
+
+PROCEDURE DeleteAlias(VAR cid: ChanId);
+VAR
+  x	: IOLink.DeviceTablePtr;
+BEGIN
+  x:=IOLink.DeviceTablePtrValue(cid,did,IOChan.notAvailable,"");
+  ldt:=x^.cd;
+  IF ldt^.rbc=0 THEN
+    wrSmb(377C);
+    wrSmb(0C);
+    flush();
+  END;
+  DISPOSE(ldt);
+  IOLink.UnMakeChan(did,cid);
+END DeleteAlias;
+
+BEGIN
+  IOLink.AllocateDeviceId(did);
+END HuffChan.
--- a/samples/PHP/file_display.inc
+++ b/samples/PHP/file_display.inc
@@ -0,0 +1,142 @@
+<?php
+
+/**
+ * Plugins are described by creating a $plugin array which will be used
+ * by the system that includes this file.
+ */
+$plugin = array(
+  'single' => TRUE,
+  'title' => t('File display'),
+  'description' => t('Displays the file with a configurable style.'),
+  'required context' => new ctools_context_required(t('File'), 'entity:file'),
+  'category' => t('File'),
+  'defaults' => array(
+    'displays' => array(),
+  ),
+);
+
+/**
+ * Render the node content.
+ */
+function file_entity_file_display_content_type_render($subtype, $conf, $panel_args, $context) {
+  if (!empty($context) && empty($context->data)) {
+    return;
+  }
+  $file = isset($context->data) ? clone($context->data) : NULL;
+  $block = new stdClass();
+  $block->module = 'file_entity';
+  $block->delta  = $file->fid;
+
+  if (empty($file)) {
+    $block->delta   = 'placeholder';
+    $block->title = t('File display');
+    $block->content = t('File display goes here.');
+  }
+  else {
+    if (!empty($conf['identifier'])) {
+      $file->ctools_template_identifier = $conf['identifier'];
+    }
+
+    $block->title = $file->filename;
+    $block->content = file_view_file($file, $conf['displays']);
+  }
+
+  if (!empty($conf['link']) && $file) {
+    $block->title_link = entity_uri('file', $file);
+  }
+
+  return $block;
+}
+
+/**
+ * Edit form for this plugin.
+ */
+function file_entity_file_display_content_type_edit_form($form, &$form_state) {
+  $conf = $form_state['conf'];
+  $form['#tree'] = TRUE;
+  $form['#attached']['js'][] = drupal_get_path('module', 'file_entity') . '/file_entity.admin.js';
+
+  // Retrieve available formatters for this file. We can load all file types
+  // since we don't know which type the file is at this point.
+  $formatters = file_info_formatter_types();
+
+  // Formatter status.
+  $form['displays']['status'] = array(
+    '#type' => 'item',
+    '#title' => t('Enabled displays'),
+    '#prefix' => '<div id="file-displays-status-wrapper">',
+    '#suffix' => '</div>',
+  );
+  $i=0;
+  foreach ($formatters as $name => $formatter) {
+    $form['displays']['status'][$name] = array(
+      '#type' => 'checkbox',
+      '#title' => check_plain($formatter['label']),
+      '#default_value' => !empty($conf['displays'][$name]['status']),
+      '#description' => isset($formatter['description']) ? filter_xss($formatter['description']) : NULL,
+      '#parents' => array('displays', $name, 'status'),
+      '#weight' => (isset($formatter['weight']) ? $formatter['weight'] : 0) + ($i / 1000),
+    );
+    $i++;
+  }
+  // Formatter order (tabledrag).
+  $form['displays']['order'] = array(
+    '#type' => 'item',
+    '#title' => t('Display precedence order'),
+    '#theme' => 'file_entity_file_display_order',
+  );
+  foreach ($formatters as $name => $formatter) {
+    $form['displays']['order'][$name]['label'] = array(
+      '#markup' => check_plain($formatter['label']),
+    );
+    $form['displays']['order'][$name]['weight'] = array(
+      '#type' => 'weight',
+      '#title' => t('Weight for @title', array('@title' => $formatter['label'])),
+      '#title_display' => 'invisible',
+      '#delta' => 50,
+      '#default_value' => isset($conf['displays'][$name]['weight']) ? $conf['displays'][$name]['weight'] : 0,
+      '#parents' => array('displays', $name, 'weight'),
+    );
+    $form['displays']['order'][$name]['#weight'] = $form['displays']['order'][$name]['weight']['#default_value'];
+  }
+
+  // Formatter settings.
+  $form['display_settings_title'] = array(
+    '#type' => 'item',
+    '#title' => t('Display settings'),
+  );
+  $form['display_settings'] = array(
+    '#type' => 'vertical_tabs',
+  );
+  $i=0;
+  foreach ($formatters as $name => $formatter) {
+    if (isset($formatter['settings callback']) && ($function = $formatter['settings callback']) && function_exists($function)) {
+      $defaults = !empty($formatter['default settings']) ? $formatter['default settings'] : array();
+      $settings = !empty($conf['displays'][$name]['settings']) ? $conf['displays'][$name]['settings'] : array();
+      $settings += $defaults;
+      $settings_form = $function($form, $form_state, $settings, $name, $file_type, $view_mode);
+      if (!empty($settings_form)) {
+        $form['displays']['settings'][$name] = array(
+          '#type' => 'fieldset',
+          '#title' => check_plain($formatter['label']),
+          '#parents' => array('displays', $name, 'settings'),
+          '#group' => 'display_settings',
+          '#weight' => (isset($formatter['weight']) ? $formatter['weight'] : 0) + ($i / 1000),
+        ) + $settings_form;
+      }
+    }
+    $i++;
+  }
+  return $form;
+}
+
+function file_entity_file_display_content_type_edit_form_submit($form, &$form_state) {
+  // Copy everything from our defaults.
+  foreach (array_keys($form_state['plugin']['defaults']) as $key) {
+    $form_state['conf'][$key] = $form_state['values'][$key];
+  }
+}
+
+function file_entity_file_display_content_type_admin_title($subtype, $conf, $context) {
+  return t('"@s" content', array('@s' => $context->identifier));
+}
--- a/samples/PHP/root.php
+++ b/samples/PHP/root.php
@@ -0,0 +1,6 @@
+<?php
+  ////////////////////////////////////
+  // I am not Isabelle ROOT         //
+  ////////////////////////////////////
+
+?>
--- a/samples/Pascal/image_url.inc
+++ b/samples/Pascal/image_url.inc
@@ -0,0 +1,37 @@
+  function GetUnixMangaImageURL: Boolean;
+  var
+    i: Integer;
+    l: TStringList;
+    s: String;
+  begin
+    l := TStringList.Create;
+    s := manager.container.PageContainerLinks[workCounter];
+    Result := GetPage(TObject(l), s , manager.container.Manager.retryConnect);
+
+    if Self.Terminated then
+    begin
+      l.Free;
+      parse.Free;
+      Exit;
+    end;
+
+    parse := TStringList.Create;
+    Parser := THTMLParser.Create(PChar(l.Text));
+    Parser.OnFoundTag := OnTag;
+    Parser.OnFoundText := OnText;
+    Parser.Exec;
+    Parser.Free;
+    l.Free;
+    if parse.Count > 0 then
+    begin
+      for i := 0 to parse.Count - 1 do
+      begin
+        if (Pos('STYLE="border', parse[i]) > 0) and (Pos('<IMG', parse[i]) > 0) then
+        begin
+          manager.container.PageLinks[workCounter] := Trim(GetVal(parse[i], 'SRC'));
+		  Break;
+        end;
+      end;
+    end;
+    parse.Free;
+  end;
--- a/samples/Pascal/libc.inc
+++ b/samples/Pascal/libc.inc
@@ -0,0 +1,56 @@
+{
+    This file is part of the Free Component Library (FCL)
+    Copyright (c) 1999-2002 by the Free Pascal development team
+
+    BIOS functions unit for Nintendo DS
+    Copyright (c) 2006 by Francesco Lombardi
+
+    See the file COPYING.FPC, included in this distribution,
+    for details about the copyright.
+
+    This program is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
+
+ *****************************************************************************}
+
+function __errno: plongint;  cdecl; export;
+begin
+
+end;
+
+
+function S_ISBLK(m: longint): boolean; inline;
+begin
+  result := (m and _IFMT) = _IFBLK;
+end;
+
+function S_ISCHR(m: longint): boolean; inline;
+begin
+  result := (m and _IFMT) = _IFCHR;
+end;
+
+function S_ISDIR(m: longint): boolean; inline;
+begin
+  result := (m and _IFMT) = _IFDIR;
+end;
+
+function S_ISFIFO(m: longint): boolean; inline;
+begin
+  result := (m and _IFMT) = _IFIFO;
+end;
+
+function S_ISREG(m: longint): boolean; inline;
+begin
+  result := (m and _IFMT) = _IFREG;
+end;
+
+function S_ISLNK(m: longint): boolean; inline;
+begin
+  result := (m and _IFMT) = _IFLNK;
+end;
+
+function S_ISSOCK(m: longint): boolean; inline;
+begin
+  result := (m and _IFMT) = _IFSOCK;
+end;
--- a/samples/Pascal/vmops_impl.inc
+++ b/samples/Pascal/vmops_impl.inc
@@ -0,0 +1,502 @@
+operator+(a, b: TVector)res: TVector;
+var
+  i, an, bn, rn: Integer;
+begin
+  an := Length(a);
+  bn := Length(b);
+  rn := math.max(an, bn);
+  SetLength(res, rn);
+  for i := 0 to rn - 1 do res[i] := a[i mod an] + b[i mod bn];
+end;
+
+operator+(a: TVector; b: Double)res: TVector;
+var
+  i, n: Integer;
+begin
+  n := Length(a);
+  SetLength(res, n);
+  for i := 0 to n - 1 do res[i] := a[i] + b;
+end;
+
+operator+(a: Double; b: TVector)res: TVector;
+var
+  i, n: Integer;
+begin
+  n := Length(b);
+  SetLength(res, n);
+  for i := 0 to n - 1 do res[i] := a + b[i];
+end;
+
+operator-(a: TVector)res: TVector;
+var
+  i, n: Integer;
+begin
+  n := Length(a);
+  SetLength(res, n);
+  for i := 0 to n - 1 do res[i] := -a[i];
+end;
+
+operator-(a, b: TVector)res: TVector;
+var
+  i, an, bn, rn: Integer;
+begin
+  an := Length(a);
+  bn := Length(b);
+  rn := math.max(an, bn);
+  SetLength(res, rn);
+  for i := 0 to rn - 1 do res[i] := a[i mod an] - b[i mod bn];
+end;
+
+operator-(a: TVector; b: Double)res: TVector;
+var
+  i, n: Integer;
+begin
+  n := Length(a);
+  SetLength(res, n);
+  for i := 0 to n - 1 do res[i] := a[i] - b;
+end;
+
+operator-(a: Double; b: TVector)res: TVector;
+var
+  i, n: Integer;
+begin
+  n := Length(b);
+  SetLength(res, n);
+  for i := 0 to n - 1 do res[i] := a - b[i];
+end;
+
+operator*(a, b: TVector)res: TVector;
+var
+  i, an, bn, rn: Integer;
+begin
+  an := Length(a);
+  bn := Length(b);
+  rn := math.max(an, bn);
+  SetLength(res, rn);
+  for i := 0 to rn - 1 do res[i] := a[i mod an] * b[i mod bn];
+end;
+
+operator*(a: TVector; b: Double)res: TVector;
+var
+  i, n: Integer;
+begin
+  n := Length(a);
+  SetLength(res, n);
+  for i := 0 to n - 1 do res[i] := a[i] * b;
+end;
+
+operator*(a: Double; b: TVector)res: TVector;
+var
+  i, n: Integer;
+begin
+  n := Length(b);
+  SetLength(res, n);
+  for i := 0 to n - 1 do res[i] := a * b[i];
+end;
+
+operator/(a, b: TVector)res: TVector;
+var
+  i, an, bn, rn: Integer;
+begin
+  an := Length(a);
+  bn := Length(b);
+  rn := math.max(an, bn);
+  SetLength(res, rn);
+  for i := 0 to rn - 1 do res[i] := a[i mod an] / b[i mod bn];
+end;
+
+operator/(a: TVector; b: Double)res: TVector;
+var
+  i, n: Integer;
+begin
+  n := Length(a);
+  SetLength(res, n);
+  for i := 0 to n - 1 do res[i] := a[i] / b;
+end;
+
+operator/(a: Double; b: TVector)res: TVector;
+var
+  i, n: Integer;
+begin
+  n := Length(b);
+  SetLength(res, n);
+  for i := 0 to n - 1 do res[i] := a / b[i];
+end;
+
+operator**(a, b: Double)res: Double;
+begin
+  if IsNan(a) or IsNan(b) then res := NaN
+  else if b = Infinity then begin
+    if a = NegInfinity then res := NaN
+    else case sign(a) of
+      1: res := Infinity;
+      0: res := 0;
+      -1: res := NegInfinity;
+    end;
+  end else if b = NegInfinity then begin
+    if a = NegInfinity then res := NaN
+    else case sign(a) of
+      1: res := 0;
+      0: res := Infinity;
+      -1: res := 0;
+    end;
+  end else res := power(a, b);
+end;
+
+operator**(a, b: TVector)res: TVector;
+var
+  i, an, bn, rn: Integer;
+begin
+  an := Length(a);
+  bn := Length(b);
+  rn := math.max(an, bn);
+  SetLength(res, rn);
+  for i := 0 to rn - 1 do res[i] := a[i mod an] ** b[i mod bn];
+end;
+
+operator**(a: TVector; b: Double)res: TVector;
+var
+  i, n: Integer;
+begin
+  n := Length(a);
+  SetLength(res, n);
+  for i := 0 to n - 1 do res[i] := a[i] ** b;
+end;
+
+operator**(a: Double; b: TVector)res: TVector;
+var
+  i, n: Integer;
+begin
+  n := Length(b);
+  SetLength(res, n);
+  for i := 0 to n - 1 do res[i] := a ** b[i];
+end;
+
+operator><(a: TVector; b: TVector)res: TMatrix;
+var
+  i, an, bn, rn: Integer;
+begin
+  an := Length(a);
+  bn := Length(b);
+  if an * bn = 0 then Exit(nil);
+  rn := math.max(an, bn);
+  SetLength(res, 1);
+  SetLength(res[0], 1);
+  res[0][0] := 0;
+  for i := 0 to rn - 1 do res[0][0] := res[0][0] + a[i mod an] * b[i mod bn];
+end;
+
+operator+(a: TMatrix; b: TMatrix)res: TMatrix;
+var
+  i, an: Integer;
+begin
+  an := Length(a);
+  SetLength(res, an);
+  for i := 0 to an - 1 do res[i] := a[i] + b[i];
+end;
+
+operator+(a: TMatrix; b: Double)res: TMatrix;
+var
+  i, n: Integer;
+begin
+  n := Length(a);
+  SetLength(res, n);
+  for i := 0 to n - 1 do res[i] := a[i] + b;
+end;
+
+operator+(a: Double; b: TMatrix)res: TMatrix;
+var
+  i, n: Integer;
+begin
+  n := Length(b);
+  SetLength(res, n);
+  for i := 0 to n - 1 do res[i] := a + b[i];
+end;
+
+operator+(a: TMatrix; b: TVector)res: TMatrix;
+begin
+  res := a + matrix(b, Length(a), Length(a[0]));
+end;
+
+operator+(a: TVector; b: TMatrix)res: TMatrix;
+begin
+  res := b + matrix(a, Length(b), Length(b[0]));
+end;
+
+operator-(a: TMatrix)res: TMatrix;
+var
+  i, n: Integer;
+begin
+  n := Length(a);
+  SetLength(res, n);
+  for i := 0 to n - 1 do res[i] := -a[i];
+end;
+
+operator-(a: TMatrix; b: TMatrix)res: TMatrix;
+var
+  i, an: Integer;
+begin
+  an := Length(a);
+  SetLength(res, an);
+  for i := 0 to an - 1 do res[i] := a[i] - b[i];
+end;
+
+operator-(a: TMatrix; b: Double)res: TMatrix;
+var
+  i, n: Integer;
+begin
+  n := Length(a);
+  SetLength(res, n);
+  for i := 0 to n - 1 do res[i] := a[i] - b;
+end;
+
+operator-(a: Double; b: TMatrix)res: TMatrix;
+var
+  i, n: Integer;
+begin
+  n := Length(b);
+  SetLength(res, n);
+  for i := 0 to n - 1 do res[i] := a - b[i];
+end;
+
+operator-(a: TMatrix; b: TVector)res: TMatrix;
+begin
+  res := a - matrix(b, Length(a), Length(a[0]));
+end;
+
+operator-(a: TVector; b: TMatrix)res: TMatrix;
+begin
+  res := b - matrix(a, Length(b), Length(b[0]));
+end;
+
+operator*(a: TMatrix; b: TMatrix)res: TMatrix;
+var
+  i, an: Integer;
+begin
+  an := Length(a);
+  SetLength(res, an);
+  for i := 0 to an - 1 do res[i] := a[i] * b[i];
+end;
+
+operator*(a: TMatrix; b: Double)res: TMatrix;
+var
+  i, n: Integer;
+begin
+  n := Length(a);
+  SetLength(res, n);
+  for i := 0 to n - 1 do res[i] := a[i] * b;
+end;
+
+operator*(a: Double; b: TMatrix)res: TMatrix;
+var
+  i, n: Integer;
+begin
+  n := Length(b);
+  SetLength(res, n);
+  for i := 0 to n - 1 do res[i] := a * b[i];
+end;
+
+operator*(a: TMatrix; b: TVector)res: TMatrix;
+begin
+  res := a * matrix(b, Length(a), Length(a[0]));
+end;
+
+operator*(a: TVector; b: TMatrix)res: TMatrix;
+begin
+  res := b * matrix(a, Length(b), Length(b[0]));
+end;
+
+operator/(a: TMatrix; b: TMatrix)res: TMatrix;
+var
+  i, an: Integer;
+begin
+  an := Length(a);
+  SetLength(res, an);
+  for i := 0 to an - 1 do res[i] := a[i] / b[i];
+end;
+
+operator/(a: TMatrix; b: Double)res: TMatrix;
+var
+  i, n: Integer;
+begin
+  n := Length(a);
+  SetLength(res, n);
+  for i := 0 to n - 1 do res[i] := a[i] / b;
+end;
+
+operator/(a: Double; b: TMatrix)res: TMatrix;
+var
+  i, n: Integer;
+begin
+  n := Length(b);
+  SetLength(res, n);
+  for i := 0 to n - 1 do res[i] := a / b[i];
+end;
+
+operator/(a: TMatrix; b: TVector)res: TMatrix;
+begin
+  res := a / matrix(b, Length(a), Length(a[0]));
+end;
+
+operator/(a: TVector; b: TMatrix)res: TMatrix;
+begin
+  res := b / matrix(a, Length(b), Length(b[0]));
+end;
+
+operator**(a: TMatrix; b: TMatrix)res: TMatrix;
+var
+  i, an: Integer;
+begin
+  an := Length(a);
+  SetLength(res, an);
+  for i := 0 to an - 1 do res[i] := a[i] ** b[i];
+end;
+
+operator**(a: TMatrix; b: Double)res: TMatrix;
+var
+  i, n: Integer;
+begin
+  n := Length(a);
+  SetLength(res, n);
+  for i := 0 to n - 1 do res[i] := a[i] ** b;
+end;
+
+operator**(a: Double; b: TMatrix)res: TMatrix;
+var
+  i, n: Integer;
+begin
+  n := Length(b);
+  SetLength(res, n);
+  for i := 0 to n - 1 do res[i] := a ** b[i];
+end;
+
+operator**(a: TMatrix; b: TVector)res: TMatrix;
+begin
+  res := a ** matrix(b, Length(a), Length(a[0]));
+end;
+
+operator**(a: TVector; b: TMatrix)res: TMatrix;
+begin
+  res := b ** matrix(a, Length(b), Length(b[0]));
+end;
+
+operator><(a: TMatrix; b: TMatrix)res: TMatrix;
+var
+  i, j, n, m: Integer;
+begin
+  n := Length(a);
+  m := Length(b);
+  if (n = 1) and (m = 1) then Exit(vector(a) >< vector(b));
+  SetLength(res, n);
+  for i := 0 to n - 1 do begin
+    j := 0;
+    res[i] := a[i][j] * b[j];
+    for j := 1 to m - 1 do res[i] := res[i] + a[i][j] * b[j];
+  end;
+end;
+
+operator><(a: TMatrix; b: TVector)res: TMatrix;
+begin
+  res := a >< matrix(b, 1, Length(b));
+end;
+
+operator><(a: TVector; b: TMatrix)res: TMatrix;
+begin
+  res := matrix(a, 1, Length(a)) >< b;
+end;
+
+function vector(a: array of const): TVector;
+var
+  i, n: Integer;
+begin
+  n := Length(a);
+  SetLength(Result, n);
+  for i := 0 to n - 1 do case a[i].VType of
+    vtInteger:  Result[i] := a[i].VInteger;
+    vtExtended: Result[i] := a[i].VExtended^;
+    vtCurrency: Result[i] := a[i].VCurrency^;
+    vtInt64:    Result[i] := a[i].VInt64^;
+  end;
+end;
+
+function vector(a: TMatrix): TVector; inline;
+var
+  i, j, n, m : Integer;
+begin
+  n := Length(a);
+  if n = 0 then Exit(nil);
+  m := Length(a[0]);
+  if m = 0 then Exit(nil);
+  SetLength(Result, m * n);
+  for i := 0 to m - 1 do
+    for j := 0 to n - 1 do
+      Result[i * n + j] := a[j][i];
+end;
+
+function matrix(data: TVector; nrow, ncol: Integer; byrow: Boolean): TMatrix;
+var
+  i, j, n, c: Integer;
+begin
+  n := Length(data);
+  if n = 0 then Exit(nil);
+  if (nrow = 0) and (ncol = 0) then ncol := 1;
+  if nrow = 0 then nrow := (n div ncol) + sign(n mod ncol);
+  if ncol = 0 then ncol := (n div nrow) + sign(n mod nrow);
+  SetLength(Result, nrow);
+  for i := 0 to nrow - 1 do begin
+    SetLength(Result[i], ncol);
+    for j := 0 to ncol - 1 do begin
+      if byrow then c := i * ncol + j else c := j * nrow + i;
+      Result[i][j] := data[c mod n];
+    end;
+  end;
+end;
+
+function matrix(data: TMatrix; nrow, ncol: Integer; byrow: Boolean): TMatrix;
+begin
+  Result := matrix(vector(data), nrow, ncol, byrow);
+end;
+
+function rep(data: TVector; times: TVector): TVector;
+var
+  i, j, n, m, s, c: Integer;
+begin
+  Result := nil;
+  n := Length(data);
+  m := Length(times);
+  if n * m = 0 then Exit;
+  s := 0;
+  for i := 0 to n - 1 do begin
+    c := trunc(times[i mod m]);
+    if c > 0 then s += c;
+  end;
+  SetLength(Result, s);
+  c := 0;
+  for i := 0 to n - 1 do begin
+    s := trunc(times[i mod m]);
+    for j := 1 to s do begin
+      Result[c] := data[i];
+      Inc(c);
+    end;
+  end;
+end;
+
+function rep(data: TVector; len: Integer): TVector;
+var
+  i, j, n: Integer;
+begin
+  n := Length(data);
+  SetLength(Result, n * len);
+  if n = 0 then Exit;
+  for i := 0 to len - 1 do
+    for j := 0 to n - 1 do
+      Result[i * n + j] := data[j];
+end;
+
+function rep(data: Double; len: Integer): TVector;
+var
+  i: Integer;
+begin
+  SetLength(Result, len);
+  for i := 0 to len - 1 do Result[i] := data;
+end;
--- a/samples/Perl/strict.t
+++ b/samples/Perl/strict.t
@@ -1,4 +1,5 @@
 use Test::Base;
+use Test::More;

 __DATA__
 === Strict Test
--- a/samples/Perl6/test.p6
+++ b/samples/Perl6/test.p6
@@ -73,26 +73,6 @@ Here's some POD!  Wooo

 say('this is not!');

-=table
-    Of role things
-
-say('not in your table');
-#= A single line declarator "block" (with a keyword like role)
-#| Another single line declarator "block" (with a keyword like role)
-#={
-    A declarator block (with a keyword like role)
-  }
-#|{
-    Another declarator block (with a keyword like role)
-  }
-#= { A single line declarator "block" with a brace (with a keyword like role)
-#=«
-    More declarator blocks! (with a keyword like role)
-  »
-#|«
-    More declarator blocks! (with a keyword like role)
-  »
-
 say 'Moar code!';

 my $don't = 16;
--- a/samples/SMT/bignum_lia1.smt2
+++ b/samples/SMT/bignum_lia1.smt2
@@ -0,0 +1,20 @@
+(set-logic QF_LIA)
+(set-info :source | SMT-COMP'06 organizers |)
+(set-info :smt-lib-version 2.0)
+(set-info :category "check")
+(set-info :status unsat)
+(set-info :notes |This benchmark is designed to check if the DP supports bignumbers.|)
+(declare-fun x1 () Int)
+(declare-fun x2 () Int)
+(declare-fun x3 () Int)
+(declare-fun x4 () Int)
+(declare-fun x5 () Int)
+(declare-fun x6 () Int)
+(assert (and (or (>= x1 1000) (>= x1 1002)) 
+             (or (>= x2 (* 1230 x1)) (>= x2 (* 1003 x1))) 
+			 (or (>= x3 (* 1310 x2)) (>= x3 (* 1999 x2)))
+			 (or (>= x4 (* 4000 x3)) (>= x4 (* 8000 x3))) 
+			 (or (<= x5 (* (- 4000) x4)) (<= x5 (* (- 8000) x4)))
+			 (or (>= x6 (* (- 3) x5)) (>= x6 (* (- 2) x5))) (< x6 0)))
+(check-sat)
+(exit)
--- a/samples/SMT/list4.smt2
+++ b/samples/SMT/list4.smt2
@@ -0,0 +1,20 @@
+(set-logic AUFLIRA)
+(set-info :source | Buggy list theorem |)
+(set-info :smt-lib-version 2.0)
+(set-info :category "crafted")
+(set-info :status sat)
+(declare-sort List 0)
+(declare-fun cons (Real List) List)
+(declare-fun nil () List)
+(declare-fun car (List) Real)
+(declare-fun cdr (List) List)
+(declare-fun len (List) Int)
+(assert (forall ((?x Real) (?y List)) (= (car (cons ?x ?y)) ?x)))
+(assert (forall ((?x Real) (?y List)) (= (cdr (cons ?x ?y)) ?y)))
+(assert (= (len nil) 0))
+(assert (forall ((?x Real) (?y List)) (= (len (cons ?x ?y)) (+ (len ?y) 1))))
+(declare-fun append (List List) List)
+(assert (forall ((?x Real) (?y1 List) (?y2 List)) (= (append (cons ?x ?y1) ?y2) (cons ?x (append ?y1 ?y2)))))
+(assert (not (forall ((?x Real) (?y List)) (= (append (cons ?x nil) ?y) (cons ?x ?y)))))
+(check-sat)
+(exit)
--- a/samples/SMT/queen10-1.smt2
+++ b/samples/SMT/queen10-1.smt2
@@ -0,0 +1,123 @@
+(set-logic QF_IDL)
+(set-info :source |
+Queens benchmarks generated by Hyondeuk Kim in SMT-LIB format.
+|)
+(set-info :smt-lib-version 2.0)
+(set-info :category "crafted")
+(set-info :status sat)
+(declare-fun x0 () Int)
+(declare-fun x1 () Int)
+(declare-fun x2 () Int)
+(declare-fun x3 () Int)
+(declare-fun x4 () Int)
+(declare-fun x5 () Int)
+(declare-fun x6 () Int)
+(declare-fun x7 () Int)
+(declare-fun x8 () Int)
+(declare-fun x9 () Int)
+(declare-fun x10 () Int)
+(assert 
+  (let 
+    ((?v_0 (- x0 x10)) 
+     (?v_1 (- x1 x10)) 
+     (?v_2 (- x2 x10))
+     (?v_3 (- x3 x10))
+     (?v_4 (- x4 x10))
+     (?v_5 (- x5 x10))
+     (?v_6 (- x6 x10))
+     (?v_7 (- x7 x10))
+     (?v_8 (- x8 x10)) 
+     (?v_9 (- x9 x10)) 
+     (?v_10 (- x0 x1))
+     (?v_11 (- x0 x2))
+     (?v_12 (- x0 x3)) 
+     (?v_13 (- x0 x4))
+     (?v_14 (- x0 x5))
+     (?v_15 (- x0 x6))
+     (?v_16 (- x0 x7))
+     (?v_17 (- x0 x8))
+     (?v_18 (- x0 x9))
+     (?v_19 (- x1 x2))
+     (?v_20 (- x1 x3))
+     (?v_21 (- x1 x4))
+     (?v_22 (- x1 x5))
+     (?v_23 (- x1 x6))
+     (?v_24 (- x1 x7)) 
+     (?v_25 (- x1 x8)) 
+     (?v_26 (- x1 x9))
+     (?v_27 (- x2 x3)) 
+     (?v_28 (- x2 x4))
+     (?v_29 (- x2 x5))
+     (?v_30 (- x2 x6))
+     (?v_31 (- x2 x7))
+     (?v_32 (- x2 x8))
+     (?v_33 (- x2 x9))
+     (?v_34 (- x3 x4))
+     (?v_35 (- x3 x5))
+     (?v_36 (- x3 x6))
+     (?v_37 (- x3 x7))
+     (?v_38 (- x3 x8))
+     (?v_39 (- x3 x9))
+     (?v_40 (- x4 x5))
+     (?v_41 (- x4 x6))
+     (?v_42 (- x4 x7))
+     (?v_43 (- x4 x8))
+     (?v_44 (- x4 x9))
+     (?v_45 (- x5 x6))
+     (?v_46 (- x5 x7))
+     (?v_47 (- x5 x8)) 
+     (?v_48 (- x5 x9))
+     (?v_49 (- x6 x7))
+     (?v_50 (- x6 x8))
+     (?v_51 (- x6 x9))
+     (?v_52 (- x7 x8))
+     (?v_53 (- x7 x9)) 
+     (?v_54 (- x8 x9))) 
+  (and (<= ?v_0 9) (>= ?v_0 0) (<= ?v_1 9) (>= ?v_1 0) (<= ?v_2 9) (>= ?v_2 0) 
+       (<= ?v_3 9) (>= ?v_3 0) (<= ?v_4 9) (>= ?v_4 0) (<= ?v_5 9) (>= ?v_5 0) 
+       (<= ?v_6 9) (>= ?v_6 0) (<= ?v_7 9) (>= ?v_7 0) (<= ?v_8 9) (>= ?v_8 0) 
+       (<= ?v_9 9) (>= ?v_9 0)
+       (not (= x0 x1)) (not (= x0 x2)) (not (= x0 x3)) (not (= x0 x4))
+       (not (= x0 x5)) (not (= x0 x6)) (not (= x0 x7)) (not (= x0 x8)) 
+       (not (= x0 x9)) (not (= x1 x2)) (not (= x1 x3)) (not (= x1 x4)) 
+       (not (= x1 x5)) (not (= x1 x6)) (not (= x1 x7)) (not (= x1 x8)) 
+       (not (= x1 x9)) (not (= x2 x3)) (not (= x2 x4)) (not (= x2 x5)) 
+       (not (= x2 x6)) (not (= x2 x7)) (not (= x2 x8)) (not (= x2 x9))
+       (not (= x3 x4)) (not (= x3 x5)) (not (= x3 x6)) (not (= x3 x7)) 
+       (not (= x3 x8)) (not (= x3 x9)) (not (= x4 x5)) (not (= x4 x6)) 
+       (not (= x4 x7)) (not (= x4 x8)) (not (= x4 x9)) (not (= x5 x6)) 
+       (not (= x5 x7)) (not (= x5 x8)) (not (= x5 x9)) (not (= x6 x7)) 
+       (not (= x6 x8)) (not (= x6 x9)) (not (= x7 x8)) (not (= x7 x9)) 
+       (not (= x8 x9)) 
+       (not (= ?v_10 1)) (not (= ?v_10 (- 1))) (not (= ?v_11 2)) 
+       (not (= ?v_11 (- 2))) (not (= ?v_12 3)) (not (= ?v_12 (- 3))) 
+       (not (= ?v_13 4)) (not (= ?v_13 (- 4))) (not (= ?v_14 5)) 
+       (not (= ?v_14 (- 5))) (not (= ?v_15 6)) (not (= ?v_15 (- 6)))
+       (not (= ?v_16 7)) (not (= ?v_16 (- 7))) (not (= ?v_17 8)) 
+       (not (= ?v_17 (- 8))) (not (= ?v_18 9)) (not (= ?v_18 (- 9))) 
+       (not (= ?v_19 1)) (not (= ?v_19 (- 1))) (not (= ?v_20 2)) 
+       (not (= ?v_20 (- 2))) (not (= ?v_21 3)) (not (= ?v_21 (- 3))) 
+       (not (= ?v_22 4)) (not (= ?v_22 (- 4))) (not (= ?v_23 5)) 
+       (not (= ?v_23 (- 5))) (not (= ?v_24 6)) (not (= ?v_24 (- 6))) 
+       (not (= ?v_25 7)) (not (= ?v_25 (- 7))) (not (= ?v_26 8)) 
+       (not (= ?v_26 (- 8))) (not (= ?v_27 1)) (not (= ?v_27 (- 1))) 
+       (not (= ?v_28 2)) (not (= ?v_28 (- 2))) (not (= ?v_29 3)) 
+       (not (= ?v_29 (- 3))) (not (= ?v_30 4)) (not (= ?v_30 (- 4))) 
+       (not (= ?v_31 5)) (not (= ?v_31 (- 5))) (not (= ?v_32 6))
+       (not (= ?v_32 (- 6))) (not (= ?v_33 7)) (not (= ?v_33 (- 7))) 
+       (not (= ?v_34 1)) (not (= ?v_34 (- 1))) (not (= ?v_35 2)) 
+       (not (= ?v_35 (- 2))) (not (= ?v_36 3)) (not (= ?v_36 (- 3)))
+       (not (= ?v_37 4)) (not (= ?v_37 (- 4))) (not (= ?v_38 5)) 
+       (not (= ?v_38 (- 5))) (not (= ?v_39 6)) (not (= ?v_39 (- 6))) 
+       (not (= ?v_40 1)) (not (= ?v_40 (- 1))) (not (= ?v_41 2)) 
+       (not (= ?v_41 (- 2))) (not (= ?v_42 3)) (not (= ?v_42 (- 3)))
+       (not (= ?v_43 4)) (not (= ?v_43 (- 4))) (not (= ?v_44 5))
+       (not (= ?v_44 (- 5))) (not (= ?v_45 1)) (not (= ?v_45 (- 1))) 
+       (not (= ?v_46 2)) (not (= ?v_46 (- 2))) (not (= ?v_47 3)) 
+       (not (= ?v_47 (- 3))) (not (= ?v_48 4)) (not (= ?v_48 (- 4))) 
+       (not (= ?v_49 1)) (not (= ?v_49 (- 1))) (not (= ?v_50 2)) 
+       (not (= ?v_50 (- 2))) (not (= ?v_51 3)) (not (= ?v_51 (- 3))) 
+       (not (= ?v_52 1)) (not (= ?v_52 (- 1))) (not (= ?v_53 2)) 
+       (not (= ?v_53 (- 2))) (not (= ?v_54 1)) (not (= ?v_54 (- 1))))))
+(check-sat)
+(exit)
--- a/samples/SMT/shufflevector.smt
+++ b/samples/SMT/shufflevector.smt
--- a/samples/SQL/hostcache_set_state.inc
+++ b/samples/SQL/hostcache_set_state.inc
@@ -0,0 +1,23 @@
+# Helper for hostcache_*.test
+
+# Set a known initial state for the test
+
+flush status;
+flush hosts;
+flush user_resources;
+flush privileges;
+
+# Print critical setup
+
+select @@global.debug;
+select @@global.max_connect_errors;
+select @@global.max_user_connections;
+select @@global.max_connections;
+
+# Make sure there are no remaining records that can change the test outcome
+
+select `User`, `Host` from mysql.`user` where `host` like '%\\%%';
+select `User`, `Host` from mysql.`user` where `user` like '192.%';
+select `User`, `Host` from mysql.`user` where `user` like '2001:%';
+select `User`, `Host` from mysql.`user` where `user` like 'santa.claus.%';
+
--- a/samples/SourcePawn/Check.inc
+++ b/samples/SourcePawn/Check.inc
@@ -0,0 +1,246 @@
+// 	Checkpoint Manager
+// 	(c) João Pedro Lopes, All right's reserved
+// 	
+// 	Feel free to change any line above, as long as you post the 'fix' / 'patch' at the forum
+// 	and send a copy to jplopes@live.com.pt
+
+/* natives
+	native CreateCheckpoint(ownerid, chpid, Float:posX, Float:posY, Float:posZ, Float:size); // Creates a checkpoint
+	native SetCheckpointInterior(chpid, interiorid); // Changes the checkpoint interior
+	native SetCheckpointVirtualWorld(chpid, VirtualWorldID); // Changes the Checkpoint vWorld
+	native ToggleCheckpointActive(chpid, bool:active); // Deactivates / Activates the checkpoint
+	native ChangeCheckpointOwner(chpid, owner);	// Change the checkpoint owner
+	native RemoveCheckpoint(chpid); // Removes the specified checkpoint
+	native StartCheckpointSeeking(); // Starts seeking for each individual
+	native StopCheckpointSeeking(); // Stops the system
+	native VerifyCheckpoint(playerid); // Place this at OnPlayerEnterCheckpoint
+*/
+
+// Function Forwards
+forward public OnCheckpointEnter(playerid, checkpointid);
+
+#if defined _CHECKPOINT_MANAGER_INCLUDED
+	#endinput
+#endif
+
+#define _CHECKPOINT_MANAGER_INCLUDED
+#pragma library CheckpointManager
+
+#include <a_samp>
+
+#define MAX_CHECKPOINTS 200
+#define CHECKPOINT_SEEKER_DELAY 300
+
+#define GLOBAL_OWNER_ID -1
+
+
+// CHECKPOINT ENUMERATION
+enum _checkpointEnum{
+	_chp_populated,			// Is this slot of the memory populated?
+	
+	_chp_id,				// The ID of the checkpoint
+	_chp_owner,				// The ID of the player who this checkpoint is visible too
+	
+	Float:_chp_posX,		// The X position of this checkpoint
+	Float:_chp_posY,		// The Y position of this checkpoint
+	Float:_chp_posZ,		// The Z position of this checkpoint
+	Float:_chp_size,		// The checkpoint size
+	Float:_chp_viewDistance,	// The checkpoint view distance
+	
+	bool:_chp_active,		// Is this checkpoint active?
+	
+	_chp_interior_id,		// The interior id of this checkpoint
+	_chp_world_id			// The world id of this checkpoint
+};
+
+// DATA ARRAYS
+new _checkpoints[MAX_CHECKPOINTS][_checkpointEnum];
+new _p_VisibleCheckpoint[MAX_PLAYERS];
+new _chp_manager_timer_id;
+
+// DATA VARIABLES
+new _totalCheckpoints;
+
+// --------------------------------------------------------------------------------------------------------
+// Creates a new checkpoint with some initial data
+stock CreateCheckpoint(__ownerid, __chpid, Float:__posX, Float:__posY, Float:__posZ, Float:__size){
+	// Max checkpoint reached?
+	if(_totalCheckpoints == MAX_CHECKPOINTS) return 0;
+	
+	// First checkpoint? Setting everything to unpopulated
+	if(!_totalCheckpoints){
+		for(new i; i < MAX_PLAYERS; i++) _p_VisibleCheckpoint[i] = -1;
+		for(new i; i < MAX_CHECKPOINTS; i++){
+			_checkpoints[i][_chp_populated] = false;
+		}
+		
+		// Sending the Initialization Info
+		printf("[Checkpoint Manager : Version 0.1.1b] System Initialized...", __chpid);
+	}
+	
+	// Getting the first open slot
+	new _slot;
+	for(new i = 0; i < MAX_CHECKPOINTS; i++){
+		if(!_checkpoints[i][_chp_populated]){
+			_slot = i;
+			break;
+		}
+	}
+	
+	// Adding the new checkpoint
+	_checkpoints[_slot][_chp_populated] = true;
+	_checkpoints[_slot][_chp_id] = __chpid;
+	_checkpoints[_slot][_chp_owner] = __ownerid;
+	_checkpoints[_slot][_chp_posX] = __posX;
+	_checkpoints[_slot][_chp_posY] = __posY;
+	_checkpoints[_slot][_chp_posZ] = __posZ;
+	_checkpoints[_slot][_chp_size] = __size;
+	_checkpoints[_slot][_chp_viewDistance] = 50.0;
+	_checkpoints[_slot][_chp_active] = true;
+	_checkpoints[_slot][_chp_interior_id] = 0;
+	_checkpoints[_slot][_chp_world_id] = 0;
+	
+	printf("[Checkpoint Manager] Checkpoint created (%d) at slot %d", __chpid, _slot);
+	printf("Checkpoint Position: { %f, %f, %f }", _checkpoints[_slot][_chp_posX], _checkpoints[_slot][_chp_posY], _checkpoints[_slot][_chp_posZ]);
+	
+	_totalCheckpoints++;
+	return 1;
+}
+
+//---------------------------------------------------------------------------------------------
+stock SetCheckpointInterior(__chpid, __interiorid){
+	new _slot = __ChpSlotByID(__chpid);
+	if(_slot > -1){
+		// Valid slot?
+		_checkpoints[_slot][_chp_interior_id] = __interiorid;
+		return 1;
+	}
+	return 0;
+}
+
+//---------------------------------------------------------------------------------------------
+stock SetCheckpointVirtualWorld(__chpid, __virtual_world_id){
+	new _slot = __ChpSlotByID(__chpid);
+	if(_slot > -1){
+		_checkpoints[_slot][_chp_world_id] = __virtual_world_id;
+		return 1;
+	}
+	return 0;
+}
+
+stock ToggleCheckpointActive(__chpid, bool:__active){
+	new _slot = __ChpSlotByID(__chpid);
+	if(_slot > -1){
+		_checkpoints[_slot][_chp_active] = __active;
+		return 1;
+	}
+	return 0;
+}
+
+stock ChangeCheckpointOwner(__chpid, __owner){
+	new _slot = __ChpSlotByID(__chpid);
+	if(_slot > -1){
+		_checkpoints[_slot][_chp_owner] = __owner;
+		return 1;
+	}
+	return 0;
+}
+
+stock RemoveCheckpoint(__chpid){
+	new _slot = __ChpSlotByID(__chpid);
+	if(_slot > -1){
+		// Deleting the checkpoint
+		_checkpoints[_slot][_chp_populated] = false;
+		_checkpoints[_slot][_chp_id] = -1;
+		_checkpoints[_slot][_chp_owner] = 255;
+		_checkpoints[_slot][_chp_posX] = -1;
+		_checkpoints[_slot][_chp_posY] = -1;
+		_checkpoints[_slot][_chp_posZ] = -1;
+		_checkpoints[_slot][_chp_size] = -1;
+		_checkpoints[_slot][_chp_viewDistance] = -1;
+		_checkpoints[_slot][_chp_active] = false;
+		_checkpoints[_slot][_chp_interior_id] = -1;
+		_checkpoints[_slot][_chp_world_id] = -1;
+		_totalCheckpoints--;
+		printf("\n[Checkpoint Manager] Checkpoint removed (ID: %d)", __chpid);
+		return 1;
+	}
+	return 0;
+}
+
+//---------------------------------------------------------------------------------------------
+// Gets the checkpoint slot by id
+stock __ChpSlotByID(__chpid){
+	for(new i; i < MAX_CHECKPOINTS; i++){
+		if(_checkpoints[i][_chp_id] == __chpid) return i;
+	}
+	return -1;
+}
+
+
+forward CheckpointSeeker();
+stock StartCheckpointSeeking(){
+	_chp_manager_timer_id = SetTimer("CheckpointSeeker", CHECKPOINT_SEEKER_DELAY, 1);
+	return 1;
+}
+
+stock StopCheckpointSeeking(){
+	KillTimer(_chp_manager_timer_id);
+	return 1;
+}
+
+public CheckpointSeeker(){
+	new Float:__posX, Float:__posY, Float:__posZ;
+	new __interior;
+	new __virtualWorld;
+	for(new i; i < MAX_PLAYERS; i++)
+	{
+		if(!IsPlayerConnected(i)) continue;
+		
+		GetPlayerPos(i, Float:__posX, Float:__posY, Float:__posZ);
+		// Is the player near a checkpoint?
+		if(_p_VisibleCheckpoint[i] > -1)
+		{
+			// If the player is no longer near that point
+			if(__posX < (_checkpoints[_p_VisibleCheckpoint[i]][_chp_posX] - _checkpoints[_p_VisibleCheckpoint[i]][_chp_viewDistance])
+			|| __posX > (_checkpoints[_p_VisibleCheckpoint[i]][_chp_posX] + _checkpoints[_p_VisibleCheckpoint[i]][_chp_viewDistance])
+			|| __posY < (_checkpoints[_p_VisibleCheckpoint[i]][_chp_posY] - _checkpoints[_p_VisibleCheckpoint[i]][_chp_viewDistance])
+			|| __posY > (_checkpoints[_p_VisibleCheckpoint[i]][_chp_posY] + _checkpoints[_p_VisibleCheckpoint[i]][_chp_viewDistance])){
+				DisablePlayerCheckpoint(i);
+				_p_VisibleCheckpoint[i] = -1;
+			}
+		}
+		else
+		{
+			// Getting the player Interior and virtual world
+			__interior = GetPlayerInterior(i);
+			__virtualWorld = GetPlayerVirtualWorld(i);
+			
+			// Looking for a new checkpoint
+			for(new j = 0; j < MAX_CHECKPOINTS; j++){
+				if(!_checkpoints[j][_chp_populated]) continue;
+				if((_checkpoints[j][_chp_owner] != i) && (_checkpoints[j][_chp_owner] != -1)) continue;
+				if(_checkpoints[j][_chp_interior_id] != __interior) continue;
+				if(_checkpoints[j][_chp_world_id] != __virtualWorld) continue;
+				
+				if(__posX > (_checkpoints[j][_chp_posX] - _checkpoints[j][_chp_viewDistance])
+				&& __posX < (_checkpoints[j][_chp_posX] + _checkpoints[j][_chp_viewDistance])
+				&& __posY > (_checkpoints[j][_chp_posY] - _checkpoints[j][_chp_viewDistance])
+				&& __posY < (_checkpoints[j][_chp_posY] + _checkpoints[j][_chp_viewDistance])){
+					SetPlayerCheckpoint(i, _checkpoints[j][_chp_posX], _checkpoints[j][_chp_posY], _checkpoints[j][_chp_posZ], _checkpoints[j][_chp_size]);
+					_p_VisibleCheckpoint[i] = j;
+					break;
+				}
+			}
+		}
+	}
+	return 1;
+}
+
+stock VerifyCheckpoint(__playerid){
+	if(_p_VisibleCheckpoint[__playerid] >= 0){
+		OnCheckpointEnter(__playerid, _checkpoints[_p_VisibleCheckpoint[__playerid]][_chp_id]);
+		return 1;
+	}
+	return 0;
+}
--- a/samples/SourcePawn/fixed.inc
+++ b/samples/SourcePawn/fixed.inc
@@ -0,0 +1,91 @@
+/* Fixed point arithmetic
+ *
+ * (c) Copyright 1998-2011, ITB CompuPhase
+ * This file is provided as is (no warranties).
+ */
+#pragma library Fixed
+
+const fround_method: {
+  fround_round = 0,
+  fround_floor,
+  fround_ceil,
+  fround_tozero,
+  fround_unbiased
+}
+
+native Fixed:fixed(value);
+native Fixed:strfixed(const string[]);
+native Fixed:fmul(Fixed:oper1, Fixed:oper2);
+native Fixed:fdiv(Fixed:dividend, Fixed:divisor);
+native Fixed:ffract(Fixed:value);
+native       fround(Fixed:value, fround_method:method=fround_round);
+native Fixed:fpower(Fixed:value, exponent);
+native Fixed:fsqroot(Fixed:value);
+native Fixed:fabs(Fixed:value);
+
+#pragma rational Fixed(3)
+
+/* user defined operators */
+native Fixed:operator*(Fixed:oper1, Fixed:oper2) = fmul;
+native Fixed:operator/(Fixed:oper1, Fixed:oper2) = fdiv;
+native Fixed:operator=(oper) = fixed;
+
+stock Fixed:operator++(Fixed:oper)
+    return oper + fixed(1);
+
+stock Fixed:operator--(Fixed:oper)
+    return oper - fixed(1);
+
+stock Fixed:operator*(Fixed:oper1, oper2)
+    return Fixed: (_:oper1 * oper2);            /* "*" is commutative */
+
+stock Fixed:operator/(Fixed:oper1, oper2)
+    return oper1 / fixed(oper2);
+
+stock Fixed:operator/(oper1, Fixed:oper2)
+    return fdiv(fixed(oper1), oper2);
+
+stock Fixed:operator+(Fixed:oper1, oper2)
+    return oper1 + fixed(oper2);                /* "+" is commutative */
+
+stock Fixed:operator-(Fixed:oper1, oper2)
+    return oper1 - fixed(oper2);
+
+stock Fixed:operator-(oper1, Fixed:oper2)
+    return fixed(oper1) - oper2;
+
+stock bool:operator>(Fixed:oper1, oper2)
+    return oper1 > fixed(oper2);
+
+stock bool:operator>(oper1, Fixed:oper2)
+    return fixed(oper1) > oper2;
+
+stock bool:operator>=(Fixed:oper1, oper2)
+    return oper1 >= fixed(oper2);
+
+stock bool:operator>=(oper1, Fixed:oper2)
+    return fixed(oper1) >= oper2;
+
+stock bool:operator<(Fixed:oper1, oper2)
+    return oper1 < fixed(oper2);
+
+stock bool:operator<(oper1, Fixed:oper2)
+    return fixed(oper1) < oper2;
+
+stock bool:operator<=(Fixed:oper1, oper2)
+    return oper1 <= fixed(oper2);
+
+stock bool:operator<=(oper1, Fixed:oper2)
+    return fixed(oper1) <= oper2;
+
+stock bool:operator==(Fixed:oper1, oper2)       /* "==" is commutative */
+    return oper1 == fixed(oper2);
+
+stock bool:operator!=(Fixed:oper1, oper2)       /* "!=" is commutative */
+    return oper1 != fixed(oper2);
+
+/* forbidden operations */
+forward operator%(Fixed:oper1, Fixed:oper2);
+forward operator%(Fixed:oper1, oper2);
+forward operator%(oper1, Fixed:oper2);
+
--- a/samples/SourcePawn/mfile.inc
+++ b/samples/SourcePawn/mfile.inc
@@ -0,0 +1,289 @@
+/*  mFile 1.1 by Minokon
+ *
+ *  (c) Copyright by Minokon 2010
+ *  (c) y_files Copyright by Y_Less 2010
+ *
+ */
+
+#if defined _mfile_included
+	#endinput
+#endif
+#define _mfile_included
+
+//Defines
+#define MAX_LINE_SIZE 80 //Max lenght of one line in file
+#define MAX_KEY_SIZE 50 //Max lenght of key in line (to =)
+#define MAX_VALUE_SIZE 50 //Max lenght of value in line (past =)
+#define TMP_FILE "tmpfile.txt"
+
+//Natives
+/*
+native mCreateFile(const file[]);
+native mRemoveFile(const file[]);
+native mClearFile(const file[]);
+native bool:mFileExist(const file[]);
+native mRenameFile(const file[], const newname[]);
+native mFindFile(const name[], dest[], &index, sizename=sizeof dest);
+native mCreateDir(const name[]);
+native mRenameDir(const dir[], const newname[]);
+native mFindDir(const name[], dest[], &index, sizename=sizeof dest);
+native mHowLines(const file[]);
+native mRemoveNewLine(string[]); //removes "\n" from string
+native mGetString(const file[], const key[], bool:ignorecase=false);
+native mGetInt(const file[], const key[], bool:ignorecase=false);
+native mGetFloat(const file[], const key[], &Float:value);
+native mSetString(const file[], const key[], const new_value[]);
+native mSetInt(const file[], const key[], new_value);
+native mSetFloat(const file[], const key[], Float:new_value);
+native mIsSet(const file[], const key[], bool:ignorecase=false);
+native mUnSet(const file[], const key[]);
+native mIsFileEmpty(const file[]);
+native y_files
+*/
+//y_files by Y_Less Functions
+native ffind(const pattern[], filename[], len, &idx);
+native frename(const oldname[], const newname[]);
+native dfind(const pattern[], filename[], len, &idx);
+native dcreate(const name[]);
+native drename(const oldname[], const newname[]);
+
+//Forwards
+forward OnFileCreated(file[]);
+forward OnFileRemoved(file[]);
+forward OnFileCleared(file[]);
+forward OnFileRenamed(oldname[], newname[]);
+forward OnDirCreated(dir[]);
+forward OnDirRenamed(oldname[], newname[]);
+
+stock mCreateFile(const file[])
+{
+	if(fexist(file)) fremove(file);
+	new File:mfile = fopen(file, io_write);
+ 	fclose(mfile);
+ 	CallLocalFunction("OnFileCreated", "s", file);
+ 	return 1;
+}
+
+stock mRemoveFile(const file[])
+{
+ 	CallLocalFunction("OnFileRemoved", "s", file);
+ 	return fremove(file);
+}
+
+stock mClearFile(const file[])
+{
+	if(!fremove(file)) return 0;
+	new File:mfile = fopen(file, io_write);
+	fclose(mfile);
+	CallLocalFunction("OnFileCleared", "s", file);
+	return 1;
+}
+
+stock bool:mFileExist(const file[])
+	if(fexist(file)) return true; //dla ciekawych: fexist nie zwraca booleanu
+	else return false;
+
+stock mRenameFile(const file[], const newname[])
+{
+    CallLocalFunction("OnFileRenamed", "ss", file, newname);
+	return frename(file, newname);
+}
+
+stock mFindFile(const name[], dest[], &index, sizename=sizeof dest)
+	return ffind(name, dest, sizename, index);
+
+stock mCreateDir(const name[])
+{
+    CallLocalFunction("OnDirCreated", "s", name);
+	return dcreate(name);
+}
+
+stock mRenameDir(const dir[], const newname[])
+{
+    CallLocalFunction("OnDirRenamed", "ss", dir, newname);
+	return drename(dir, newname);
+}
+
+stock mFindDir(const name[], dest[], &index, sizename=sizeof dest)
+	return dfind(name, dest, sizename, index);
+
+stock mHowLines(const file[])
+{
+	new lines, str[MAX_LINE_SIZE];
+	new File:mfile = fopen(file, io_read);
+	while(fread(mfile, str)) lines++;
+	fclose(mfile);
+	return lines;
+}
+
+stock mRemoveNewLine(string[])
+{
+	new pos = strfind(string, "\n");
+	if(pos != -1)
+	{
+		strdel(string, pos, pos+2);
+		return 1;
+	}
+	return 0;
+}
+
+stock mGetString(const file[], const key[], bool:ignorecase=false)
+{
+	//Create file if not exists
+    if(!fexist(file))
+	{
+	    new File:created = fopen(file, io_write);
+	    fclose(created);
+	}
+	new //Variables
+	    File:mfile = fopen(file, io_read), //Open file
+	    str[MAX_LINE_SIZE],
+	    str2[MAX_KEY_SIZE],
+	    str3[MAX_VALUE_SIZE],
+	    pos;
+	//Find key in file
+	while(fread(mfile, str))
+	{
+	    pos = strfind(str, "=", ignorecase);
+	    strmid(str2, str, 0, pos);
+		if(!strcmp(str2, key, ignorecase, strlen(key)+1))
+		{
+		    strmid(str3, str, pos+1, strlen(str));
+		    mRemoveNewLine(str3);
+		    break;
+		}
+	}
+	fclose(mfile);
+	return str3;
+}
+
+stock mGetInt(const file[], const key[], bool:ignorecase=false)
+	return strval(mGetString(file, key, ignorecase));
+	
+stock mGetFloat(const file[], const key[], &Float:value, bool:ignorecase=false)
+	value = floatstr(mGetString(file, key, ignorecase));
+
+stock mSetString(const file[], const key[], const new_value[])
+{
+    //Create file if not exists
+	if(!fexist(file))
+	{
+	    new File:created = fopen(file, io_write);
+	    fclose(created);
+	}
+	new //Variables
+		str[MAX_LINE_SIZE],
+		str2[MAX_KEY_SIZE],
+		str3[MAX_LINE_SIZE],
+		bool:lFinded = false;
+	//Open file
+	new File:mfile = fopen(file, io_read);
+	//Create cache file
+	new File:tmpfile = fopen(TMP_FILE, io_write);
+	fclose(tmpfile);
+	//Open cache file
+	tmpfile = fopen(TMP_FILE, io_append);
+	format(str3, sizeof str3, "%s=%s\n", key, new_value);
+	while(fread(mfile, str))
+	{
+	    strmid(str2, str, 0, strfind(str, "="));
+	    if(!strcmp(str2, key))
+	    {
+			fwrite(tmpfile, str3);
+			lFinded = true;
+	    }
+	    else
+	        fwrite(tmpfile, str);
+	}
+	if(!lFinded) //if line not found
+		fwrite(tmpfile, str3);
+    //Close and remove old file
+    fclose(mfile);
+	fremove(file);
+	//Close cache file and rename it
+	fclose(tmpfile);
+	frename(TMP_FILE, file);
+	return 1;
+}
+
+stock mSetInt(const file[], const key[], new_value)
+{
+	new str[MAX_VALUE_SIZE];
+	valstr(str, new_value);
+	mSetString(file, key, str);
+	return 1;
+}
+
+stock mSetFloat(const file[], const key[], Float:new_value)
+{
+	new str[MAX_VALUE_SIZE];
+	format(str, sizeof str, "%f", new_value);
+	return mSetString(file, key, str);
+}
+
+stock bool:mIsSet(const file[], const key[], bool:ignorecase=false)
+{
+    //If fexists return false
+    if(!fexist(file)) return false;
+	new //Variables
+	    File:mfile = fopen(file, io_read), //Open file
+	    str[MAX_LINE_SIZE],
+	    str2[MAX_KEY_SIZE],
+		bool:finded = false;
+	//Find key in file
+	while(fread(mfile, str))
+	{
+	    strmid(str2, str, 0, strfind(str, "="));
+		if(!strcmp(str2, key, ignorecase, strlen(key)+1))
+		{
+			finded = true;
+			break;
+   		}
+	}
+	fclose(mfile);
+	return finded;
+}
+
+stock mUnSet(const file[], const key[])
+{
+	if(!fexist(file)) return 0;
+	new //Variables
+		str[MAX_LINE_SIZE],
+		str2[MAX_KEY_SIZE];
+	//Open file
+	new File:mfile = fopen(file, io_read);
+	//Create cache file
+	new File:tmpfile = fopen(TMP_FILE, io_write);
+	fclose(tmpfile);
+	//Open cache file
+	tmpfile = fopen(TMP_FILE, io_append);
+	while(fread(mfile, str))
+	{
+	    strmid(str2, str, 0, strfind(str, "="));
+	    if(strcmp(str2, key) != 0)
+	    	fwrite(tmpfile, str);
+	}
+    //Close and remove old file
+    fclose(mfile);
+	fremove(file);
+	//Close cache file and rename it
+	fclose(tmpfile);
+	frename(TMP_FILE, file);
+	return 1;
+}
+
+stock bool:mIsFileEmpty(const file[])
+{
+	if(!fexist(file)) return true;
+	new File:mfile = fopen(file, io_read);
+	if(flength(mfile) <= 1)
+	{
+	    fclose(mfile);
+		return true;
+	}
+	else
+	{
+		fclose(mfile);
+		return false;
+	}
+}
--- a/samples/SourcePawn/y_testing.inc
+++ b/samples/SourcePawn/y_testing.inc
@@ -0,0 +1,633 @@
+/**--------------------------------------------------------------------------**\
+					====================================
+					 y_testing - Run unit tests easilly 
+					====================================
+Description:
+	Runs any functions named as tests when the Testing_Run function is called.
+Legal:
+	Version: MPL 1.1
+	
+	The contents of this file are subject to the Mozilla Public License Version 
+	1.1 (the "License"); you may not use this file except in compliance with 
+	the License. You may obtain a copy of the License at 
+	http://www.mozilla.org/MPL/
+	
+	Software distributed under the License is distributed on an "AS IS" basis,
+	WITHOUT WARRANTY OF ANY KIND, either express or implied. See the License
+	for the specific language governing rights and limitations under the
+	License.
+	
+	The Original Code is the YSI testing include.
+	
+	The Initial Developer of the Original Code is Alex "Y_Less" Cole.
+	Portions created by the Initial Developer are Copyright (C) 2011
+	the Initial Developer. All Rights Reserved.
+	
+	Contributors:
+		ZeeX, koolk, JoeBullet/Google63, g_aSlice/Slice
+	
+	Thanks:
+		JoeBullet/Google63 - Handy arbitrary ASM jump code using SCTRL.
+		ZeeX - Very productive conversations.
+		koolk - IsPlayerinAreaEx code.
+		TheAlpha - Danish translation.
+		breadfish - German translation.
+		Fireburn - Dutch translation.
+		yom - French translation.
+		50p - Polish translation.
+		Zamaroht - Spanish translation.
+		Dracoblue, sintax, mabako, Xtreme, other coders - Producing other modes
+			for me to strive to better.
+		Pixels^ - Running XScripters where the idea was born.
+		Matite - Pestering me to release it and using it.
+	
+	Very special thanks to:
+		Thiadmer - PAWN, whose limits continue to amaze me!
+		Kye/Kalcor - SA:MP.
+		SA:MP Team past, present and future - SA:MP.
+	
+Version:
+	1.0
+Changelog:
+	16/02/12:
+		Added better error reporting (less verbose passes).
+		Removed "Tests:".
+		Added player requiring tests.
+	25/10/10:
+		Integrated in to YSI.
+	06/08/10:
+		First version
+</remarks>
+\**--------------------------------------------------------------------------**/
+
+/*#if defined _inc_a_samp || defined _samp_included || defined _inc_y_version
+	#error y_testing must be the VERY FIRST include in your mode if being used.
+#endif
+
+// Now we redefined "native" to do something clever!
+// "IsPlayerAttachedObjectSlotUsed" is an issue for us...
+
+// "y_renative" allows native functions to be declared without constantly trying
+// to redefine it.
+#include "internal\y_renative"
+
+#define native%0(%1); _YSI_NO_TAG_NATIVE:_YSI_RE_NATIVE<%0@|||%1|||%0>_YSI_RE_STOCK<%0|||%1|||_:%0@>
+
+//stock%0(%1){printf(_:_YSI_NO_SQUARE:"native "#%0" called");return _:%0@(%1);}
+
+#define _YSI_RE_STOCK<%0|||%1|||%2> stock%0(%1){print(_:_YSI_NO_SQUARE:"native "#%0" called");return %2(%1);}
+
+#define _YSI_NO_SQUARE:%0);%1(%2[%3]%4);} _YSI_NO_SQUARE:%0);%1(%2%4);}
+
+//#define _YSI_NO_TAG_NATIVE:_YSI_RE_NATIVE<%0:%1|||%2|||%3:%4>%5{%6;%7:%8:%9} _YSI_RE_NATIVE<%1|||%2|||%4>%5{%6;return%8:%9}
+#define _YSI_NO_TAG_NATIVE:_YSI_RE_NATIVE<%0:%1|||%2|||%3:%4>_YSI_RE_STOCK<%5:%6|||%7|||_:%8:%9> _YSI_RE_NATIVE<%1|||%2|||%4>_YSI_RE_STOCK<%5:%6|||%7|||%8:%9>*/
+
+#include <a_samp>
+
+#if defined YSI_TESTS
+	#if defined INCLUDE_TESTS
+		#error Incompatible testing options (YSI_TESTS + INCLUDE_TESTS)
+	#endif
+	#if !defined RUN_TESTS
+		#define RUN_TESTS
+	#endif
+#endif
+
+#if defined INCLUDE_TESTS
+	#define RUN_TESTS
+	#define Debug_PrintT va_printf
+#elseif defined RUN_TESTS
+	#define _AUTO_RUN_TESTS
+	#define Debug_PrintT va_printf
+#else
+	#if _DEBUG > 0 || defined _YSI_SPECIAL_DEBUG
+		#define RUN_TESTS
+		#define _AUTO_RUN_TESTS
+		//#if defined _YSI_SPECIAL_DEBUG
+		//	#define TP printf
+		//	//#define TC(%0); %0
+		#define Debug_PrintT va_printf
+		//#else
+		//	//#define TP P:0
+		//	//#define TC C:0
+		//#endif
+	#else
+		#define Debug_PrintT(%0);
+	//	#define Tests:%1() stock bool:Tests_@%1()
+	//	#define Test:%1() stock bool:Test_@%1()
+	//	#define TestInit:%1() stock Init_@%1()
+	//	#define TestClose:%1() stock Shut_@%1()
+	#endif
+#endif
+
+#define Y_TESTING_DIALOG_ID (0x7974) // "yt"
+
+#define TEST_TRUE(%0)  Testing_Test(!!%0)
+#define TEST_FALSE(%0) Testing_Test(!%0)
+#define TEST_NULL(%0)  Testing_Test(0 == %0)
+#define TEST_NOT_NULL(%0)  Testing_Test(0 != %0)
+#define TEST_N(%0,%1)  Testing_Test(%1 == %0)
+
+#define TEST_TRUE_EX(%0,%2)  Testing_Test(bool:(%0), (%2))
+#define TEST_FALSE_EX(%0,%2) Testing_Test(!(%0), (%2))
+#define TEST_NULL_EX(%0,%2)  Testing_Test((%0) == 0, (%2))
+#define TEST_N_EX(%0,%1,%2)  Testing_Test((%0) == (%1), (%2))
+
+#define TEST_MSG "\2\2\2\2\2"
+#define TEST_FAILED "FAIL:"
+#define TEST_PASSED "PASS!"
+//#define TEST_FAILED "*** Test Failed:"
+//#define TEST_PASSED "*** Test Passed:"
+
+#define _Y_TESTEQ(%0) "\"%0\"")
+#define _Y_TESTDQ:_Y_TESTEQ(%0"%1"%2) _Y_TESTDQ:_Y_TESTEQ(%0\x22;%1\x22;%2)
+//#define _Y_TESTCB:_Y_TESTDQ:_Y_TESTEQ(%0)%1) _Y_TESTCB:_Y_TESTDQ:_Y_TESTEQ(%0\x29;%1)
+#define _Y_TESTCB:_Y_TESTDQ:_Y_TESTEQ(%0)%1) _Y_TESTCB:_Y_TESTDQ:_Y_TESTEQ(%0\x29;%1)
+#define _Y_TESTOB:_Y_TESTCB:_Y_TESTDQ:_Y_TESTEQ(%0(%1) _Y_TESTOB:_Y_TESTCB:_Y_TESTDQ:_Y_TESTEQ(%0\x28;%1)
+
+#define ASSERT(%0) Testing_Test(%0,TEST_MSG" %s", _Y_TESTOB:_Y_TESTCB:_Y_TESTDQ:_Y_TESTEQ(%0)
+#define ASSERT_TRUE(%0) ASSERT(!!%0) //Testing_Test(!!%0,__name)
+#define ASSERT_FALSE(%0) ASSERT(!%0) //Testing_Test(!%0,__name)
+#define ASSERT_NULL(%0) ASSERT(0 == %0) //Testing_Test(0==%0,__name)
+#define ASSERT_N:%1(%0) ASSERT(%1 == %0) //Testing_Test(%1==%0,__name)
+
+#define ASK(%0) Testing_Ask(playerid,%0)
+
+static stock
+	YSI_g_sFailMessage[512],
+	YSI_g_sPlayer = cellmax,
+	bool:YSI_g_sAsked,
+	YSI_g_sTests,
+	YSI_g_sFails;
+
+#if defined RUN_TESTS
+	#define Test:%1() forward bool:Tezt_@%1(); public bool:Tezt_@%1() for(new string:__name[]=#%1,bool:__once=(printf("*** Test %s start", __name) || TRUE);__once;__once=(printf(" ") && FALSE))
+	//#define Tests:%1() forward bool:Test_@%1(); public bool:Test_@%1() for(new string:__name[]=#%1,bool:__once=(printf("*** Test %s start", __name) || TRUE);__once;__once=(printf(" ") && FALSE))
+	#define TestInit:%1() forward Init_@%1(); public Init_@%1() for(new string:__name[]=#%1,bool:__once=TRUE;__once;__once=(printf(" ", __name) && FALSE))
+	#define TestClose:%1() forward Shut_@%1(); public Shut_@%1() for(new string:__name[]=#%1,bool:__once=TRUE;__once;__once=(printf(" ", __name) && FALSE))
+	
+	#define PTest:%1(%2) forward bool:Tezp_@%1(%2); public bool:Tezp_@%1(%2) for(new string:__name[]=#%1,bool:__once=(printf("*** Player Test %s start", __name) || TRUE);__once;__once=(printf(" ") && FALSE))
+	//#define Tests:%1() forward bool:Test_@%1(); public bool:Test_@%1() for(new string:__name[]=#%1,bool:__once=(printf("*** Test %s start", __name) || TRUE);__once;__once=(printf(" ") && FALSE))
+	#define PTestInit:%1(%2) forward Inip_@%1(%2); public Inip_@%1(%2) for(new string:__name[]=#%1,bool:__once=TRUE;__once;__once=(printf(" ", __name) && FALSE))
+	#define PTestClose:%1(%2) forward Shup_@%1(%2); public Shup_@%1(%2) for(new string:__name[]=#%1,bool:__once=TRUE;__once;__once=(printf(" ", __name) && FALSE))
+#else
+	#define Test:%1() stock bool:Test_@%1()
+	#define TestInit:%1() stock Init_@%1()
+	#define TestClose:%1() stock Shut_@%1()
+	
+	#define PTest:%1(%2) stock bool:Test_@%1(%2)
+	#define PTestInit:%1(%2) stock Init_@%1(%2)
+	#define PTestClose:%1(%2) stock Shut_@%1(%2)
+#endif
+
+// These all need to come AFTER the types are defined in case the have tests.
+#include "internal\y_version"
+
+#include "y_amx"
+#include "internal\y_shortfunc"
+#include "y_debug"
+
+#include "internal\y_natives"
+
+#include "y_va"
+
+/**--------------------------------------------------------------------------**\
+<summary>Testing_Ask</summary>
+<param name="playerid">Player to ask a question to.</param>
+<param name="str[]">What to ask.</param>
+<param name="va_args<>">Additional data.</param>
+<returns>
+	-
+</returns>
+<remarks>
+	Calls a dialog to ask the player if the given test actually passed.
+</remarks>
+\**--------------------------------------------------------------------------**/
+
+stock Testing_Ask(playerid, str[] = "", va_args<>)
+{
+	va_format(YSI_g_sFailMessage, sizeof (YSI_g_sFailMessage), str, va_start<2>);
+	ShowPlayerDialog(playerid, Y_TESTING_DIALOG_ID, DIALOG_STYLE_MSGBOX, "Did the test pass?", YSI_g_sFailMessage, "Yes", "No");
+	YSI_g_sAsked = true;
+}
+
+stock Testing_Test(bool:x, str[] = "", va_args<>)
+{
+	P:3("Testing_Test called: %i, \"%s\"", x, str);
+	++YSI_g_sTests;
+	if (!x)
+	{
+		++YSI_g_sFails;
+		if (numargs() == 2)
+		{
+			P:T(TEST_FAILED " %s", va_start<1>);
+			//printf("*** Test failed: %s", str);
+		}
+		else
+		{
+			if (str[0] == '\2')
+			{
+				strunpack(str, !TEST_FAILED, 6);
+				str[5] = ' ';
+			}
+			P:T(str, va_start<2>);
+		}
+	}
+	#if defined TEST_SHOW_PASSES
+		else /*if (numargs() == 2)
+		{
+			P:T(TEST_PASSED " %s", va_start<1>);
+		}
+		else
+		{
+			P:T(str, va_start<2>);
+			if (str[0] == '\2')
+			{
+				strunpack(str, !TEST_PASSED, 17);
+				str[16] = ' ';
+			}
+			printf(str);
+			P:T(str, va_start<2>);*/
+		{
+			P:T(TEST_PASSED, va_start<2>);
+		}
+	#endif
+}
+
+/**--------------------------------------------------------------------------**\
+<summary>Testing_Run</summary>
+<param name="&tests">Number of tests run.</param>
+<param name="&fails">Number of tests which failed.</param>
+<param name="buffer[33]">The name of the first test which failed.</param>
+<returns>
+	Wether all tests were sucessful or not.
+</returns>
+<remarks>
+	-
+
+native Testing_Run(&tests, &fails, buffer[33] = "");
+
+</remarks>
+\**--------------------------------------------------------------------------**/
+
+stock bool:Testing_Run(&tests, &fails, lastfail[33] = "", bool:p = false)
+{
+	P:3("bool:Testing_Run called: %i, %i, \"%s\", %i", tests, fails, lastfail, p);
+	#pragma unused p, lastfail
+	#if defined RUN_TESTS
+		P:2("Testing_Run() called");
+		new
+			idx,
+			buffer[32];
+		while ((idx = AMX_GetPublicName(idx, buffer, "Tezt_@")))
+		{
+			strunpack(buffer, buffer);
+			//++YSI_g_sTests;
+			// Call the setup function if there is one.
+			buffer[0] = 'I';
+			buffer[1] = 'n';
+			buffer[2] = 'i';
+			buffer[3] = 't';
+			CallLocalFunction(buffer, "");
+			// Call the test.
+			buffer[0] = 'T';
+			buffer[1] = 'e';
+			buffer[2] = 'z';
+			buffer[3] = 't';
+			fails = YSI_g_sFails;
+			P:5("Testing_Run(): Calling %s", buffer[6]);
+			CallLocalFunction(buffer, "");
+			#if !defined TEST_SHOW_PASSES
+				if (YSI_g_sFails == fails)
+				{
+					printf(TEST_PASSED);
+					printf(" ");
+				}
+			#endif
+			/*if (YSI_g_sFails != fails)
+			{
+				if (YSI_g_sFails)
+				{
+					++YSI_g_sFails;
+				}
+				else
+				{
+					fails = 0;
+					// Copy the string over.
+					while ((lastfail[fails] = buffer[fails + 6])) ++fails;
+					YSI_g_sFails = 1;
+				}
+				//C:1(if (p) printf("*** Test failed: %s", buffer[fails + 6]););
+			}*/
+			// Call the shutdown function if there is one.
+			buffer[0] = 'S';
+			buffer[1] = 'h';
+			buffer[2] = 'u';
+			buffer[3] = 't';
+			CallLocalFunction(buffer, "");
+		}
+		tests = YSI_g_sTests;
+		fails = YSI_g_sFails;
+		return fails == 0;
+	#else
+		#pragma unused tests, fails, lastfail
+		return true;
+	#endif
+}
+
+/**--------------------------------------------------------------------------**\
+<summary>Testing_Player</summary>
+<param name="playerid">Player to test on.</param>
+<param name="&idx">Next test to run.</param>
+<param name="&tests">Number of tests run.</param>
+<param name="&fails">Number of tests which failed.</param>
+<param name="buffer[33]">The name of the first test which failed.</param>
+<returns>
+	Wether all tests were sucessful or not.
+</returns>
+<remarks>
+	-
+
+native Testing_Run(&tests, &fails, buffer[33] = "");
+
+</remarks>
+\**--------------------------------------------------------------------------**/
+
+stock bool:Testing_Player(playerid, &idx, &tests, &fails, lastfail[33] = "", bool:p = false)
+{
+	P:3("bool:Testing_Player called: %i, %i, %i, %i, \"%s\", %i", playerid, idx, tests, fails, lastfail, p);
+	#pragma unused p
+	#if defined RUN_TESTS
+		P:2("Testing_Player() called");
+		new
+			//idx,
+			buffer[32];
+		//while ((idx = AMX_GetPublicName(idx, buffer, "Tezt_@")))
+		if ((idx = AMX_GetPublicName(idx, buffer, "Tezp_@")))
+		{
+			strunpack(buffer, buffer);
+			//++YSI_g_sTests;
+			// Call the setup function if there is one.
+			buffer[0] = 'I';
+			buffer[1] = 'n';
+			buffer[2] = 'i';
+			buffer[3] = 'p';
+			CallLocalFunction(buffer, "");
+			// Call the test.
+			buffer[0] = 'T';
+			buffer[1] = 'e';
+			buffer[2] = 'z';
+			buffer[3] = 'p';
+			fails = YSI_g_sFails;
+			P:5("Testing_Player(): Calling %s", buffer[6]);
+			CallLocalFunction(buffer, "");
+			#if !defined TEST_SHOW_PASSES
+				if (YSI_g_sFails == fails)
+				{
+					printf(TEST_PASSED);
+					printf(" ");
+				}
+			#endif
+			/*if (YSI_g_sFails != fails)
+			{
+				if (YSI_g_sFails)
+				{
+					++YSI_g_sFails;
+				}
+				else
+				{
+					fails = 0;
+					// Copy the string over.
+					while ((lastfail[fails] = buffer[fails + 6])) ++fails;
+					YSI_g_sFails = 1;
+				}
+				//C:1(if (p) printf("*** Test failed: %s", buffer[fails + 6]););
+			}*/
+			// Call the shutdown function if there is one.
+			//buffer[0] = 'S';
+			//buffer[1] = 'h';
+			//buffer[2] = 'u';
+			//buffer[3] = 'p';
+			//CallLocalFunction(buffer, "");
+		}
+		tests = YSI_g_sTests;
+		fails = YSI_g_sFails;
+		return fails == 0;
+	#else
+		#pragma unused tests, fails, lastfail
+		return true;
+	#endif
+}
+
+#if defined RUN_TESTS
+	/*#define Test:%1() forward bool:Tezt_@%1(); public bool:Tezt_@%1() for(new string:__name[]=#%1,bool:__once=(printf("*** Test %s start", __name) || TRUE);__once;__once=(printf(" ") && FALSE))
+	//#define Tests:%1() forward bool:Test_@%1(); public bool:Test_@%1() for(new string:__name[]=#%1,bool:__once=(printf("*** Test %s start", __name) || TRUE);__once;__once=(printf(" ") && FALSE))
+	#define TestInit:%1() forward Init_@%1(); public Init_@%1() for(new string:__name[]=#%1,bool:__once=TRUE;__once;__once=(printf(" ", __name) && FALSE))
+	#define TestClose:%1() forward Shut_@%1(); public Shut_@%1() for(new string:__name[]=#%1,bool:__once=TRUE;__once;__once=(printf(" ", __name) && FALSE))
+	
+	#define PTest:%1(%2) forward bool:Tezp_@%1(%2); public bool:Tezp_@%1(%2) for(new string:__name[]=#%1,bool:__once=(printf("*** Player Test %s start", __name) || TRUE);__once;__once=(printf(" ") && FALSE))
+	//#define Tests:%1() forward bool:Test_@%1(); public bool:Test_@%1() for(new string:__name[]=#%1,bool:__once=(printf("*** Test %s start", __name) || TRUE);__once;__once=(printf(" ") && FALSE))
+	#define PTestInit:%1(%2) forward Inip_@%1(%2); public Inip_@%1(%2) for(new string:__name[]=#%1,bool:__once=TRUE;__once;__once=(printf(" ", __name) && FALSE))
+	#define PTestClose:%1(%2) forward Shup_@%1(%2); public Shup_@%1(%2) for(new string:__name[]=#%1,bool:__once=TRUE;__once;__once=(printf(" ", __name) && FALSE))*/
+	
+	#if defined _AUTO_RUN_TESTS
+		#if !defined FILTERSCRIPT
+			// Hook main in gamemodes.
+			main()
+			{
+				// Disable error messages (as we're likely to generate them).
+				state ysi_debug : off;
+				CallLocalFunction("Testing_main", "");
+				new
+					tests,
+					fails;
+				printf(" ");
+				printf("  ||===================||  ");
+				printf("  || STARTING TESTS... ||  ");
+				printf("  ||===================||  ");
+				printf(" ");
+				Testing_Run(tests, fails, _, true);
+				printf("*** Tests: %d, Fails: %d", tests, fails);
+				if (!fails)
+				{
+					printf(" ");
+					printf("  ||===================||  ");
+					printf("  || ALL TESTS PASSED! ||  ");
+					printf("  ||===================||  ");
+					printf(" ");
+				}
+				state ysi_debug : on;
+			}
+			
+			#define main forward Testing_main(); public Testing_main
+			
+			Testing_Next(playerid)
+			{
+				new
+					buffer[32];
+				for ( ; ; )
+				{
+					new
+						fails = YSI_g_sFails;
+					// Get the last test (nicely fails for cellmax).
+					if ((YSI_g_sPlayer = AMX_GetPublicName(YSI_g_sPlayer, buffer, "Tezp_@")))
+					{
+						strunpack(buffer, buffer);
+						// Call the shutdown function if there is one.
+						buffer[0] = 'S';
+						buffer[1] = 'h';
+						buffer[2] = 'u';
+						buffer[3] = 'p';
+						CallLocalFunction(buffer, "i", playerid);
+					}
+					// Get the new test, but don't store the index.
+					if (AMX_GetPublicName(YSI_g_sPlayer, buffer, "Tezp_@"))
+					{
+						YSI_g_sAsked = false;
+						//++YSI_g_sTests;
+						strunpack(buffer, buffer);
+						// Call the setup function if there is one.
+						buffer[0] = 'I';
+						buffer[1] = 'n';
+						buffer[2] = 'i';
+						buffer[3] = 'p';
+						CallLocalFunction(buffer, "i", playerid);
+						// Call the test.
+						buffer[0] = 'T';
+						buffer[1] = 'e';
+						buffer[2] = 'z';
+						buffer[3] = 'p';
+						P:5("Testing_Next(): Calling %s", buffer[6]);
+						CallLocalFunction(buffer, "i", playerid);
+					}
+					else
+					{
+						YSI_g_sAsked = true;
+						// No more tests.
+						printf("*** Tests: %d, Fails: %d", YSI_g_sTests, YSI_g_sFails);
+						if (!YSI_g_sFails)
+						{
+							printf(" ");
+							printf("  ||==========================||  ");
+							printf("  || ALL PLAYER TESTS PASSED! ||  ");
+							printf("  ||==========================||  ");
+							printf(" ");
+						}
+					}
+					// If the test needs a player but doesn't ask them anything
+					// then we can't wait for "OnDialogResponse" to run the next
+					// one.
+					if (YSI_g_sAsked)
+					{
+						break;
+					}
+					else if (fails == YSI_g_sFails)
+					{
+						printf(TEST_PASSED);
+					}
+				}
+				//while (!YSI_g_sAsked);
+			}
+			
+			public OnDialogResponse(playerid, dialogid, response, listitem, inputtext[])
+			{
+				if (dialogid == Y_TESTING_DIALOG_ID)
+				{
+					++YSI_g_sTests;
+					if (response)
+					{
+						// Pass.
+						printf(TEST_PASSED);
+					}
+					else
+					{
+						// Fail.
+						printf(TEST_FAILED " %s", YSI_g_sFailMessage);
+						++YSI_g_sFails;
+					}
+					Testing_Next(playerid);
+					return 1;
+				}
+				#if defined Testing_OnDialogResponse
+					return Testing_OnDialogResponse(playerid, dialogid, response, listitem, inputtext);
+				#else
+					return 1;
+				#endif
+			}
+			
+			#if defined _ALS_OnDialogResponse
+				#undef OnDialogResponse
+			#else
+				#define _ALS_OnDialogResponse
+			#endif
+			#define OnDialogResponse Testing_OnDialogResponse
+			#if defined Testing_OnDialogResponse
+				forward Testing_OnDialogResponse(playerid, dialogid, response, listitem, inputtext[]);
+			#endif
+			
+			public OnPlayerSpawn(playerid)
+			{
+				if (YSI_g_sPlayer == cellmax && !IsPlayerNPC(playerid))
+				{
+					printf(" ");
+					printf("  ||==========================||  ");
+					printf("  || STARTING PLAYER TESTS... ||  ");
+					printf("  ||==========================||  ");
+					printf(" ");
+					YSI_g_sTests = 0;
+					YSI_g_sFails = 0;
+					Testing_Next(playerid);
+				}
+				#if defined Testing_OnPlayerSpawn
+					return Testing_OnPlayerSpawn(playerid);
+				#else
+					return 1;
+				#endif
+			}
+			
+			#if defined _ALS_OnPlayerSpawn
+				#undef OnPlayerSpawn
+			#else
+				#define _ALS_OnPlayerSpawn
+			#endif
+			#define OnPlayerSpawn Testing_OnPlayerSpawn
+			#if defined Testing_OnPlayerSpawn
+				forward Testing_OnPlayerSpawn(playerid);
+			#endif
+		#endif
+	#else
+		Testing_RunAll()
+		{
+			// Disable error messages (as we're likely to generate them).
+			state ysi_debug : off;
+			new
+				tests,
+				fails;
+			printf(" ");
+			printf("  ||===================||  ");
+			printf("  || STARTING TESTS... ||  ");
+			printf("  ||===================||  ");
+			printf(" ");
+			Testing_Run(tests, fails, _, true);
+			printf("*** Tests: %d, Fails: %d", tests, fails);
+			if (!fails)
+			{
+				printf(" ");
+				printf("  ||===================||  ");
+				printf("  || ALL TESTS PASSED! ||  ");
+				printf("  ||===================||  ");
+				printf(" ");
+			}
+			state ysi_debug : on;
+		}
+	#endif
+#else
+	//#define Tests:%1() stock bool:Tests_@%1()
+	/*#define Test:%1() stock bool:Test_@%1()
+	#define TestInit:%1() stock Init_@%1()
+	#define TestClose:%1() stock Shut_@%1()
+	
+	#define PTest:%1(%2) stock bool:Test_@%1(%2)
+	#define PTestInit:%1(%2) stock Init_@%1(%2)
+	#define PTestClose:%1(%2) stock Shut_@%1(%2)*/
+#endif
--- a/samples/XML/xhtml-struct-1.mod
+++ b/samples/XML/xhtml-struct-1.mod
@@ -0,0 +1,125 @@
+<!-- ...................................................................... -->
+<!-- XHTML Structure Module  .............................................. -->
+<!-- file: xhtml-struct-1.mod
+
+     This is XHTML, a reformulation of HTML as a modular XML application.
+     Copyright 1998-2000 W3C (MIT, INRIA, Keio), All Rights Reserved.
+     Revision: $Id: xhtml-struct-1.mod,v 1.1.1.1 2006/01/09 19:23:30 rcrews Exp $ SMI
+
+     This DTD module is identified by the PUBLIC and SYSTEM identifiers:
+
+       PUBLIC "-//W3C//ELEMENTS XHTML Document Structure 1.0//EN"
+       SYSTEM "http://www.w3.org/TR/xhtml-modulatization/DTD/xhtml-struct-1.mod"
+
+     Revisions:
+     (none)
+     ....................................................................... -->
+
+<!-- Document Structure
+
+        title, head, body, html
+
+     The Structure Module defines the major structural elements and 
+     their attributes.
+
+     Note that the content model of the head element type is redeclared 
+     when the Base Module is included in the DTD.
+
+     The parameter entity containing the XML namespace URI value used 
+     for XHTML is '%XHTML.xmlns;', defined in the Qualified Names module.
+-->
+
+<!-- title: Document Title ............................. -->
+
+<!-- The title element is not considered part of the flow of text.
+     It should be displayed, for example as the page header or
+     window title. Exactly one title is required per document.
+-->
+
+<!ENTITY % title.element  "INCLUDE" >
+<![%title.element;[
+<!ENTITY % title.content  "( #PCDATA )" >
+<!ENTITY % title.qname  "title" >
+<!ELEMENT %title.qname;  %title.content; >
+<!-- end of title.element -->]]>
+
+<!ENTITY % title.attlist  "INCLUDE" >
+<![%title.attlist;[
+<!ATTLIST %title.qname;
+      %XHTML.xmlns.attrib; 
+      %I18n.attrib;
+>
+<!-- end of title.attlist -->]]>
+
+<!-- head: Document Head ............................... -->
+
+<!ENTITY % head.element  "INCLUDE" >
+<![%head.element;[
+<!ENTITY % head.content
+    "( %HeadOpts.mix;, %title.qname;, %HeadOpts.mix; )"
+>
+<!ENTITY % head.qname  "head" >
+<!ELEMENT %head.qname;  %head.content; >
+<!-- end of head.element -->]]>
+
+<!ENTITY % head.attlist  "INCLUDE" >
+<![%head.attlist;[
+<!-- reserved for future use with document profiles
+-->
+<!ENTITY % profile.attrib
+     "profile      %URI.datatype;           '%XHTML.profile;'"
+>
+
+<!ATTLIST %head.qname;
+      %XHTML.xmlns.attrib; 
+      %I18n.attrib;
+      %profile.attrib;
+>
+<!-- end of head.attlist -->]]>
+
+<!-- body: Document Body ............................... -->
+
+<!ENTITY % body.element  "INCLUDE" >
+<![%body.element;[
+<!ENTITY % body.content
+     "( %Block.mix; )+"
+>
+<!ENTITY % body.qname  "body" >
+<!ELEMENT %body.qname;  %body.content; >
+<!-- end of body.element -->]]>
+
+<!ENTITY % body.attlist  "INCLUDE" >
+<![%body.attlist;[
+<!ATTLIST %body.qname;
+      %Common.attrib;
+>
+<!-- end of body.attlist -->]]>
+
+<!-- html: XHTML Document Element ...................... -->
+
+<!ENTITY % html.element  "INCLUDE" >
+<![%html.element;[
+<!ENTITY % html.content  "( %head.qname;, %body.qname; )" >
+<!ENTITY % html.qname  "html" >
+<!ELEMENT %html.qname;  %html.content; >
+<!-- end of html.element -->]]>
+
+<!ENTITY % html.attlist  "INCLUDE" >
+<![%html.attlist;[
+<!-- version attribute value defined in driver
+-->
+<!ENTITY % XHTML.version.attrib
+     "version      %FPI.datatype;           #FIXED '%XHTML.version;'"
+>
+
+<!-- see the Qualified Names module for information 
+     on how to extend XHTML using XML namespaces 
+-->
+<!ATTLIST %html.qname;
+      %XHTML.xmlns.attrib; 
+      %XHTML.version.attrib;
+      %I18n.attrib;
+>
+<!-- end of html.attlist -->]]>
+
+<!-- end of xhtml-struct-1.mod -->
--- a/test/fixtures/Generated/ABM8G.mod
+++ b/test/fixtures/Generated/ABM8G.mod
@@ -0,0 +1,50 @@
+PCBNEW-LibModule-V1  Wed 10 Aug 2011 05:57:27 PM COT
+# encoding utf-8
+$INDEX
+ABM8G
+$EndINDEX
+$MODULE ABM8G
+Po 0 0 0 15 4E430CBD 4E430CC5 ~~
+Li ABM8G
+Sc 4E430CC5
+AR 
+Op 0 0 0
+T0 591 -1378 354 354 0 39 N V 21 N "ABM8G"
+T1 0 787 354 354 0 39 N V 21 N "VAL**"
+DS -591 394 1299 394 79 21
+DS 1299 394 1299 -1063 79 21
+DS 1299 -1063 -472 -1063 79 21
+DS -472 -1063 -472 472 79 21
+DS -472 472 -472 551 79 21
+DS -472 551 -591 551 79 21
+DS -591 551 -591 433 79 21
+$PAD
+Sh "1" R 551 472 0 0 0
+Dr 0 0 0
+At SMD N 00888000
+Ne 0 ""
+Po 0 0
+$EndPAD
+$PAD
+Sh "2" R 551 472 0 0 0
+Dr 0 0 0
+At SMD N 00888000
+Ne 0 ""
+Po 866 0
+$EndPAD
+$PAD
+Sh "3" R 551 472 0 0 0
+Dr 0 0 0
+At SMD N 00888000
+Ne 0 ""
+Po 866 -669
+$EndPAD
+$PAD
+Sh "4" R 551 472 0 0 0
+Dr 0 0 0
+At SMD N 00888000
+Ne 0 ""
+Po 0 -669
+$EndPAD
+$EndMODULE  ABM8G
+$EndLIBRARY
--- a/test/fixtures/Generated/ms2.mod
+++ b/test/fixtures/Generated/ms2.mod
@@ -0,0 +1,19 @@
+GFORTRAN module version '0' created from ms2.f90 on Thu Sep  5 10:09:19 2013
+MD5:8a80cd5db1bc612a28603959302dbf37 -- If you edit this, you'll get what you deserve.
+
+(() () () () () () () () () () () () () () () () () () () () () () () ()
+() () ())
+
+()
+
+()
+
+()
+
+()
+
+(2 'ms2' 'ms2' 'ms2' 1 ((MODULE UNKNOWN-INTENT UNKNOWN-PROC UNKNOWN
+UNKNOWN) (UNKNOWN 0 0 0 UNKNOWN ()) 0 0 () () 0 () () () 0 0)
+)
+
+('ms2' 0 2)
--- a/test/fixtures/SVG/alg_schema.link.svg
+++ b/test/fixtures/SVG/alg_schema.link.svg
@@ -0,0 +1 @@
+alg_schema.svg
--- a/test/fixtures/SVG/alg_schema.svg
+++ b/test/fixtures/SVG/alg_schema.svg
@@ -0,0 +1,269 @@
+<?xml version="1.0" encoding="UTF-8" standalone="no"?>
+<!-- Created with Inkscape (http://www.inkscape.org/) -->
+
+<svg
+   xmlns:dc="http://purl.org/dc/elements/1.1/"
+   xmlns:cc="http://creativecommons.org/ns#"
+   xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"
+   xmlns:svg="http://www.w3.org/2000/svg"
+   xmlns="http://www.w3.org/2000/svg"
+   xmlns:sodipodi="http://sodipodi.sourceforge.net/DTD/sodipodi-0.dtd"
+   xmlns:inkscape="http://www.inkscape.org/namespaces/inkscape"
+   width="744.09448819"
+   height="1052.3622047"
+   id="svg2"
+   version="1.1"
+   inkscape:version="0.48.0 r9654"
+   sodipodi:docname="alg_schema.svg">
+  <defs
+     id="defs4" />
+  <sodipodi:namedview
+     id="base"
+     pagecolor="#ffffff"
+     bordercolor="#666666"
+     borderopacity="1.0"
+     inkscape:pageopacity="0.0"
+     inkscape:pageshadow="2"
+     inkscape:zoom="0.834386"
+     inkscape:cx="409.42881"
+     inkscape:cy="681.83774"
+     inkscape:document-units="px"
+     inkscape:current-layer="g3759"
+     showgrid="false"
+     inkscape:window-width="1280"
+     inkscape:window-height="993"
+     inkscape:window-x="1280"
+     inkscape:window-y="31"
+     inkscape:window-maximized="0"
+     showguides="true"
+     inkscape:snap-global="false">
+    <inkscape:grid
+       type="xygrid"
+       id="grid3914" />
+  </sodipodi:namedview>
+  <metadata
+     id="metadata7">
+    <rdf:RDF>
+      <cc:Work
+         rdf:about="">
+        <dc:format>image/svg+xml</dc:format>
+        <dc:type
+           rdf:resource="http://purl.org/dc/dcmitype/StillImage" />
+        <dc:title></dc:title>
+      </cc:Work>
+    </rdf:RDF>
+  </metadata>
+  <g
+     inkscape:label="Layer 1"
+     inkscape:groupmode="layer"
+     id="layer1">
+    <g
+       id="g3759"
+       transform="translate(-3.3909149,-21.218048)">
+      <rect
+         ry="11.855058"
+         rx="14.468504"
+         y="138.58023"
+         x="108.08632"
+         height="66.263969"
+         width="247.48737"
+         id="rect2985"
+         style="fill:#1f3d55;fill-opacity:1;fill-rule:evenodd;stroke:#3f5d75;stroke-width:5;stroke-linecap:round;stroke-linejoin:miter;stroke-miterlimit:4;stroke-opacity:1;stroke-dasharray:none;stroke-dashoffset:0" />
+      <text
+         sodipodi:linespacing="125%"
+         id="text3755"
+         y="163.58023"
+         x="238.39091"
+         style="font-size:12px;font-style:normal;font-variant:normal;font-weight:normal;font-stretch:normal;line-height:125%;letter-spacing:0px;word-spacing:0px;fill:#ffffff;fill-opacity:1;stroke:none;font-family:Bitstream Vera Sans;-inkscape-font-specification:Bitstream Vera Sans"
+         xml:space="preserve"><tspan
+           style="font-size:24px;text-align:center;text-anchor:middle;fill:#ffffff;fill-opacity:1"
+           y="163.58023"
+           x="238.39091"
+           id="tspan3757"
+           sodipodi:role="line">Sequence KEY</tspan><tspan
+           style="font-size:24px;text-align:center;text-anchor:middle;fill:#ffffff;fill-opacity:1"
+           y="193.58023"
+           x="238.39091"
+           sodipodi:role="line"
+           id="tspan4055">256 bits</tspan></text>
+    </g>
+    <g
+       id="g3870"
+       transform="translate(-0.73178617,29.27145)">
+      <g
+         id="g3759-5"
+         transform="translate(-0.40143056,286.32219)">
+        <rect
+           style="fill:#1f3d55;fill-opacity:1;fill-rule:evenodd;stroke:#3f5d75;stroke-width:5;stroke-linecap:round;stroke-linejoin:miter;stroke-miterlimit:4;stroke-opacity:1;stroke-dasharray:none;stroke-dashoffset:0"
+           id="rect2985-5"
+           width="247.48737"
+           height="74.751289"
+           x="108.08632"
+           y="130.09291"
+           rx="14.468504"
+           ry="13.373494" />
+        <flowRoot
+           transform="translate(2.4712344,-292.01415)"
+           style="font-size:24px;font-style:normal;font-variant:normal;font-weight:normal;font-stretch:normal;text-align:center;line-height:125%;letter-spacing:0px;word-spacing:0px;text-anchor:middle;fill:#ffffff;fill-opacity:1;stroke:none;font-family:Bitstream Vera Sans;-inkscape-font-specification:Bitstream Vera Sans"
+           id="flowRoot3797"
+           xml:space="preserve"><flowRegion
+             id="flowRegion3799"><rect
+               style="font-size:24px;text-align:center;text-anchor:middle;fill:#ffffff;fill-opacity:1"
+               y="428.79074"
+               x="125"
+               height="58.346195"
+               width="86.479271"
+               id="rect3801" /></flowRegion><flowPara
+             id="flowPara3805">Salt</flowPara><flowPara
+             id="flowPara3841">96 bits</flowPara></flowRoot>        <flowRoot
+           transform="translate(115.26831,-291.40674)"
+           style="font-size:24px;font-style:normal;font-variant:normal;font-weight:normal;font-stretch:normal;text-align:center;line-height:125%;letter-spacing:0px;word-spacing:0px;text-anchor:middle;fill:#ffffff;fill-opacity:1;stroke:none;font-family:Bitstream Vera Sans;-inkscape-font-specification:Bitstream Vera Sans"
+           id="flowRoot3797-6"
+           xml:space="preserve"><flowRegion
+             id="flowRegion3799-5"><rect
+               style="font-size:24px;text-align:center;text-anchor:middle;fill:#ffffff;fill-opacity:1"
+               y="428.79074"
+               x="125"
+               height="60.933453"
+               width="104.07261"
+               id="rect3801-6" /></flowRegion><flowPara
+             id="flowPara3805-9">Counter</flowPara><flowPara
+             id="flowPara3809-3">32 bits</flowPara></flowRoot>        <path
+           inkscape:connector-curvature="0"
+           id="path3845"
+           d="m 229.11476,138.88943 0,57.95451"
+           style="fill:none;stroke:#ffffff;stroke-width:3;stroke-linecap:butt;stroke-linejoin:miter;stroke-miterlimit:4;stroke-opacity:1;stroke-dasharray:none" />
+      </g>
+    </g>
+    <g
+       transform="matrix(0.6979728,0,0,0.6979728,71.363842,197.71804)"
+       id="g3759-7">
+      <rect
+         ry="13.373494"
+         rx="14.297379"
+         y="130.09291"
+         x="108.08632"
+         height="74.751289"
+         width="244.56023"
+         id="rect2985-4"
+         style="fill:#1f3d55;fill-opacity:1;fill-rule:evenodd;stroke:#3f5d75;stroke-width:7.16360283;stroke-linecap:round;stroke-linejoin:miter;stroke-miterlimit:4;stroke-opacity:1;stroke-dasharray:none;stroke-dashoffset:0" />
+      <text
+         sodipodi:linespacing="125%"
+         id="text3755-5"
+         y="178.58023"
+         x="141.31805"
+         style="font-size:12px;font-style:normal;font-variant:normal;font-weight:normal;font-stretch:normal;line-height:125%;letter-spacing:0px;word-spacing:0px;fill:#beff83;fill-opacity:1;stroke:none;font-family:Bitstream Vera Sans;-inkscape-font-specification:Bitstream Vera Sans"
+         xml:space="preserve"><tspan
+           style="font-size:32px;fill:#beff83;fill-opacity:1"
+           y="178.58023"
+           x="141.31805"
+           id="tspan3757-2"
+           sodipodi:role="line">AES Cipher</tspan></text>
+    </g>
+    <path
+       style="fill:#6ea1cc;stroke:#000000;stroke-width:1px;stroke-linecap:butt;stroke-linejoin:miter;stroke-opacity:1;fill-opacity:1"
+       d="m 225,437.36218 0,-50 -15,5 25,-35 25,35 -15,-5 0,50 z"
+       id="path3912"
+       inkscape:connector-curvature="0"
+       sodipodi:nodetypes="cccccccc" />
+    <path
+       style="fill:#6ea1cc;fill-opacity:1;stroke:#000000;stroke-width:1px;stroke-linecap:butt;stroke-linejoin:miter;stroke-opacity:1"
+       d="m 340,302.36218 50,0 -5,-15 35,25 -35,25 5,-15 -50,0 z"
+       id="path3912-5"
+       inkscape:connector-curvature="0"
+       sodipodi:nodetypes="cccccccc" />
+    <path
+       style="fill:#6ea1cc;fill-opacity:1;stroke:#000000;stroke-width:1px;stroke-linecap:butt;stroke-linejoin:miter;stroke-opacity:1"
+       d="m 245,192.36218 0,50 15,-5 -25,35 -25,-35 15,5 0,-50 z"
+       id="path3912-4"
+       inkscape:connector-curvature="0"
+       sodipodi:nodetypes="cccccccc" />
+    <g
+       transform="matrix(0.6979728,0,0,0.6979728,361.36384,197.71804)"
+       id="g3759-7-7">
+      <rect
+         ry="13.373494"
+         rx="17.857012"
+         y="130.09291"
+         x="108.08632"
+         height="74.751289"
+         width="305.44867"
+         id="rect2985-4-4"
+         style="fill:#1f3d55;fill-opacity:1;fill-rule:evenodd;stroke:#3f5d75;stroke-width:7.16360283;stroke-linecap:round;stroke-linejoin:miter;stroke-miterlimit:4;stroke-opacity:1;stroke-dasharray:none;stroke-dashoffset:0" />
+      <text
+         sodipodi:linespacing="125%"
+         id="text3755-5-4"
+         y="159.80484"
+         x="255.9357"
+         style="font-size:12px;font-style:normal;font-variant:normal;font-weight:normal;font-stretch:normal;line-height:125%;letter-spacing:0px;word-spacing:0px;fill:#beff83;fill-opacity:1;stroke:none;font-family:Bitstream Vera Sans;-inkscape-font-specification:Bitstream Vera Sans"
+         xml:space="preserve"><tspan
+           style="font-size:25.78897095px;text-align:center;text-anchor:middle;fill:#beff83;fill-opacity:1"
+           y="159.80484"
+           x="255.9357"
+           sodipodi:role="line"
+           id="tspan3979">Secure random data</tspan><tspan
+           style="font-size:25.78897095px;text-align:center;text-anchor:middle;fill:#beff83;fill-opacity:1"
+           y="192.04105"
+           x="255.9357"
+           sodipodi:role="line"
+           id="tspan3983">128 bits</tspan></text>
+    </g>
+    <path
+       style="fill:#6ea1cc;fill-opacity:1;stroke:#000000;stroke-width:1px;stroke-linecap:butt;stroke-linejoin:miter;stroke-opacity:1;opacity:0.45614035"
+       d="m 550,352.36218 0,50 15,-5 -25,35 -25,-35 15,5 0,-50 z"
+       id="path3912-5-0"
+       inkscape:connector-curvature="0"
+       sodipodi:nodetypes="cccccccc" />
+    <text
+       xml:space="preserve"
+       style="font-size:12px;font-style:normal;font-variant:normal;font-weight:normal;font-stretch:normal;line-height:125%;letter-spacing:0px;word-spacing:0px;fill:#000000;fill-opacity:1;stroke:none;font-family:Bitstream Vera Sans;-inkscape-font-specification:Bitstream Vera Sans"
+       x="540"
+       y="382.36218"
+       id="text4003"
+       sodipodi:linespacing="125%"><tspan
+         sodipodi:role="line"
+         x="540"
+         y="382.36218"
+         id="tspan4007"
+         style="font-size:16px;text-align:center;text-anchor:middle">Division by alphabet length</tspan><tspan
+         sodipodi:role="line"
+         x="540"
+         y="402.36218"
+         style="font-size:16px;text-align:center;text-anchor:middle"
+         id="tspan4053">repeated passcode-length times.</tspan></text>
+    <g
+       transform="matrix(0.6979728,0,0,0.6979728,344.55869,369.3865)"
+       id="g3759-7-7-7">
+      <g
+         id="g4045"
+         transform="translate(-1.21417,-6.070852)">
+        <rect
+           style="fill:#1f3d55;fill-opacity:1;fill-rule:evenodd;stroke:#3f5d75;stroke-width:7.16360283;stroke-linecap:round;stroke-linejoin:miter;stroke-miterlimit:4;stroke-opacity:1;stroke-dasharray:none;stroke-dashoffset:0"
+           id="rect2985-4-4-8"
+           width="305.44867"
+           height="74.751289"
+           x="131.15555"
+           y="130.09291"
+           rx="17.857012"
+           ry="13.373494" />
+        <text
+           xml:space="preserve"
+           style="font-size:12px;font-style:normal;font-variant:normal;font-weight:normal;font-stretch:normal;line-height:125%;letter-spacing:0px;word-spacing:0px;fill:#beff83;fill-opacity:1;stroke:none;font-family:Bitstream Vera Sans;-inkscape-font-specification:Bitstream Vera Sans"
+           x="283.77673"
+           y="158.71724"
+           id="text3755-5-4-6"
+           sodipodi:linespacing="125%"><tspan
+             id="tspan3983-8"
+             sodipodi:role="line"
+             x="283.77673"
+             y="158.71724"
+             style="font-size:25.78897095px;text-align:center;text-anchor:middle;fill:#beff83;fill-opacity:1">Passcode</tspan><tspan
+             id="tspan4043"
+             sodipodi:role="line"
+             x="283.77673"
+             y="190.95346"
+             style="font-size:25.78897095px;text-align:center;text-anchor:middle;fill:#beff83;fill-opacity:1">2-16 characters</tspan></text>
+      </g>
+    </g>
+  </g>
+</svg>
--- a/test/test_blob.rb
+++ b/test/test_blob.rb
@@ -279,6 +279,9 @@ class TestBlob < Minitest::Test
    # Rails vendor/
    assert sample_blob("vendor/plugins/will_paginate/lib/will_paginate.rb").vendored?

+    # Vendor/
+    assert sample_blob("Vendor/my_great_file.h").vendored?
+
    # 'thirdparty' directory
    assert sample_blob("thirdparty/lib/main.c").vendored?

@@ -480,6 +483,12 @@ class TestBlob < Minitest::Test

    # Vagrant
    assert sample_blob("puphpet/file.pp").vendored?
+
+    # Fabric.io
+    assert sample_blob("Fabric.framework/Fabric.h").vendored?
+
+    # Crashlytics
+    assert sample_blob("Crashlytics.framework/Crashlytics.h").vendored?
  end

  def test_documentation
@@ -551,6 +560,8 @@ class TestBlob < Minitest::Test
        blob = fixture_blob(filepath)
        if language == 'Data'
          assert blob.language.nil?, "A language was found for #{filepath}"
+        elsif language == 'Generated'
+          assert blob.generated?, "#{filepath} is not a generated file"
        else
          assert blob.language, "No language for #{filepath}"
          assert_equal language, blob.language.name, blob.name
--- a/vendor/grammars/Handlebars
+++ b/vendor/grammars/Handlebars
--- a/vendor/grammars/NimLime
+++ b/vendor/grammars/NimLime
--- a/vendor/grammars/SMT.tmbundle
+++ b/vendor/grammars/SMT.tmbundle
--- a/vendor/grammars/Sublime-Modula-2
+++ b/vendor/grammars/Sublime-Modula-2
--- a/vendor/grammars/atom-fsharp
+++ b/vendor/grammars/atom-fsharp
--- a/vendor/grammars/css.tmbundle
+++ b/vendor/grammars/css.tmbundle
--- a/vendor/grammars/factor
+++ b/vendor/grammars/factor
--- a/vendor/grammars/haxe-sublime-bundle
+++ b/vendor/grammars/haxe-sublime-bundle
--- a/vendor/grammars/language-javascript
+++ b/vendor/grammars/language-javascript
--- a/vendor/grammars/language-jsoniq
+++ b/vendor/grammars/language-jsoniq
--- a/vendor/grammars/language-python
+++ b/vendor/grammars/language-python
--- a/vendor/grammars/sas.tmbundle
+++ b/vendor/grammars/sas.tmbundle
--- a/vendor/grammars/sublime-text-ox
+++ b/vendor/grammars/sublime-text-ox
Author	SHA1	Message	Date
Arfon Smith	cf471af677	Merge pull request #2483 from github/cut-release-v4.5.8 v4.5.8 release	2015-07-10 22:57:07 +01:00
Arfon Smith	79a428ab8d	Merge pull request #2180 from pchaigno/inc-extension .inc file extension	2015-07-08 19:25:50 +01:00
Paul Chaignon	9f8c15ed6c	Merge branch 'master' into inc-extension	2015-07-05 14:45:35 +02:00
Paul Chaignon	b94eda18ab	New .inc Pascal samples	2015-07-05 12:48:22 +02:00
Paul Chaignon	849eb28b01	New .inc SourcePawn samples	2015-07-05 12:48:12 +02:00
Paul Chaignon	b0073d461c	New .inc C++ samples	2015-07-05 12:47:57 +02:00
Arfon Smith	21e97cc65c	Merge pull request #2170 from pchaigno/mod-extension .mod extension	2015-07-04 20:57:40 +01:00
Paul Chaignon	06c1033952	Fix error from merge conflicts	2015-07-04 18:04:19 +02:00
Paul Chaignon	8c54f68040	Fix conflicts from merging master into 'mod-extension'	2015-07-04 18:01:56 +02:00
Arfon Smith	4c1f5c490f	Merge pull request #2484 from pchaigno/fix-g-code-samples Remove incorrect G-code samples	2015-07-04 16:58:42 +01:00
Arfon Smith	117735ffb9	Merge pull request #2179 from pchaigno/symlinks Ignore symbolic links	2015-07-04 16:57:43 +01:00
Paul Chaignon	f98e6bdac7	Use proper format for symlinks, submodules and trees	2015-07-04 17:14:30 +02:00
Paul Chaignon	19d76306d3	Remove incorrect samples	2015-07-04 12:33:41 +02:00
Arfon Smith	a63a609ce1	v4.5.8 release	2015-07-04 10:36:45 +01:00
Arfon Smith	95fce2024d	Merge pull request #2482 from github/grammar-updates Grammar updates	2015-07-04 07:02:29 +01:00
Arfon Smith	f3b65015f4	Grammar updates	2015-07-04 06:55:51 +01:00
Arfon Smith	5431298b0d	Merge pull request #2481 from github/1823-local Isabelle ROOT support (updated PR)	2015-07-04 06:19:02 +01:00
Arfon Smith	8f651bca03	Adding PHP sample file for completeness	2015-07-04 06:01:06 +01:00
Arfon Smith	6c45e5ec19	Merge branch 'master' into 1823-local	2015-07-04 05:46:23 +01:00
Arfon Smith	95d394642c	Merge pull request #2478 from mattn/perl-test-more Append Test::More into strict.t	2015-07-04 05:32:30 +01:00
mattn	6a185a3d3a	remove some text contents from test.pl since it affect to heuristic search.	2015-07-04 02:29:01 +09:00
Arfon Smith	6ae353706d	Merge pull request #2479 from SRI-CSL/master SMT-LIB language support	2015-07-01 14:10:28 -05:00
Ian A. Mason	77bc72be14	Added an ace mode, and put the SMT entry in the correct place, maybe.	2015-07-01 11:22:04 -07:00
Bruno Dutertre	0585c880de	Example smt2 files	2015-07-01 10:38:17 -07:00
mattn	da5189e7fb	Append Test::More into strict.t. Because, most of tap scripts on Perl5 are detected as Perl6.	2015-07-01 16:23:38 +09:00
Ian A. Mason	5f456d8b22	Some part way through the adding a language checklist.	2015-06-30 15:29:02 -07:00
Vicent Marti	a351cdd486	Merge pull request #2477 from github/vmg/release-4.5.7 Rrelease 4.5.7	2015-06-30 14:58:18 +02:00
Arfon Smith	6e71663fd6	Merge pull request #2463 from pchaigno/doc-add-extension Instructions to add a new extension to a language	2015-06-29 21:18:47 -05:00
Arfon Smith	0b2e43cdee	Merge pull request #2457 from drewcrawford/master Adding some more vendered expressions	2015-06-29 21:16:08 -05:00
Paul Chaignon	9cbd280f79	New .inc SourcePawn sample	2015-06-28 16:05:47 +02:00
Paul Chaignon	947be9db0f	New .inc Pascal sample	2015-06-28 15:54:25 +02:00
Paul Chaignon	dd55f929d4	New .inc HTML sample	2015-06-28 15:27:59 +02:00
Paul Chaignon	8b5399d568	New C++ .inc sample	2015-06-28 14:33:54 +02:00
Paul Chaignon	1b8b0c6229	New .inc Assembly samples	2015-06-28 13:24:42 +02:00
Paul Chaignon	56dec47561	Merge branch 'master' into inc	2015-06-21 14:20:53 +02:00
Paul Chaignon	3e793ab5b7	Precision on requirements to add a language	2015-06-21 10:07:18 +02:00
Drew Crawford	8845b266de	Adding some more vendered expressions * `Vendor/`, the capitalized path * Crashlytics, a common iOS framework * Fabric, a common iOS framework	2015-06-17 21:25:54 -05:00
Paul Chaignon	786d1e4cfc	Instructions to add a new extension to a language	2015-06-12 21:22:55 +02:00
Paul Chaignon	0c2aeae00d	.inc extension for PHP, Pascal, Assembly, SQL, C++, HTML and SourcePawn	2015-05-10 20:36:41 +02:00
Paul Chaignon	b6ee02f313	Merge branch 'master' into mod-extension	2015-05-04 21:44:23 +02:00
Paul Chaignon	fc1f8083ad	Heuristic rules for XML and Modula-2	2015-04-25 23:36:15 +02:00
Paul Chaignon	af5e799a45	Merge branch 'master' into mod-extension	2015-04-22 21:14:24 +02:00
Paul Chaignon	e073e91d62	Detect GFortran module files as generated	2015-04-19 16:56:38 +02:00
Paul Chaignon	da9bda0e27	Detect KiCAD module files as generated	2015-04-19 16:19:52 +02:00
Paul Chaignon	0e996e4bb7	Grammar for Modula-2 from Sublime Text package	2015-04-19 12:41:41 +02:00
Paul Chaignon	63fbbd6e0a	.mod file extension for AMPL, Linux Kernel Module, Modula-2 and XML	2015-04-19 12:39:21 +02:00
Paul Chaignon	730be65514	Ignore symlinks in repository statistics	2015-02-28 16:08:16 +01:00
Gerwin Klein	f18ae4f99f	add support for Isabelle ROOT file syntax	2014-12-27 10:13:02 +11:00