├── afzutils.ijs ├── README.md ├── Jfire.ijs ├── arrayf_test.ijs ├── arrayfire.ijs └── LICENSE /afzutils.ijs: -------------------------------------------------------------------------------- 1 | cocurrent 'z' 2 | pD_z_ =: 1!:2&2 3 | cders_z_ =: cder ; cderx 4 | coself_z_ =: coname@(''"_) 5 | codestroy =: (coerase@coname@(''"_) ] destroy :: ])"0 6 | coinsert=: 3 : 0 NB. change to allow insert of an object rather than class. boxopen instead of < 7 | n=. ;: :: ] y 8 | p=. ; (, 18!:2) @ boxopen each n 9 | p=. ~. ( 18!:2 coname''), p 10 | (p /: p = <,'z') 18!:2 coname'' 11 | ) 12 | inl_z_ =: (cocurrent@] ".@] [)"1 0 13 | inlC_z_ =: 2 : 0 14 | (([: <^:(0=L.) v"_) inl~ m , ' ', lr@:]) : (([: <^:(0=L.) v"_) inl~ (lr@:[), ' ' ,m , ' ', lr@:] ) 15 | ) 16 | cocurrent2 =: 18!:4@boxxopen ] coname@(''"_) 17 | inlA_z_ =: 1 : 'u inlC (18!:5 '''')' 18 | coassign_z_ =: 4 : 0 NB.y is object or list of objects. x is string name. Destroys previous value prior to assign. 19 | try. (coerase ] 'destroy a:'&inl :: ]) x~ catch. end. 20 | (x) =: y 21 | ) 22 | lr_z_ =: 3 : '5!:5 < ''y''' 23 | lrA_z_ =: 1 : '5!:5 < ''u''' 24 | loc =: (,&'_'@[ ,&'_'@, ":@>@])"1 0 25 | locs =: 1 : 'm loc 18!:5 ''''' 26 | eval_z_ =: 1 : ' a: 1 : m' 27 | reduce =: 1 : '<"_1@[ ([: u &.>/(>@:) ,) <@:]' 28 | assign_z_ =: 4 : '(x) =: y' 29 | dlt0 =: #~ ([: (+./\ *. +./\.) (0{a.)&~:) 30 | dltb0 =: dlt0@:dltb 31 | NB. NoteB =: Note : ([ [ Note@]) 32 | NB. NoteB =: (2 : 'u' (3 : '0 : 0' ) ) 33 | Note 'not nec' 34 | NoteB =: (1 : '0 [ m (0 :)' ) 35 | NoteB =: (4 : 'x [ y (0 :)' ) 36 | NoteV =: 1 : '(0 (0 :)) label_. 0 (m :)' 37 | ) -------------------------------------------------------------------------------- /README.md: -------------------------------------------------------------------------------- 1 | # Jfire 2 | Arrayfire bindings for J language 3 | 4 | requires download and install of Arrayfire. Binary versions at: http://arrayfire.com/download/ 5 | https://github.com/arrayfire/arrayfire 6 | http://www.arrayfire.com/docs/index.htm 7 | All J files in project should be in the same folder as this file. load jfire.ijs in the J language (jsoftware.com) ide. 8 | 9 | Arrayfire is a paralel math library (focused mainly on floating point) that uses a single interface to other GPU and CPU math libraries. 10 | 11 | jfire.ijs includes setup utilities. 12 | arrayf_tests.ijs includes samples and benchmarks. 13 | 14 | A memory manager is included as well as a device interface, and enhancements to J to allow easier locale management. 15 | The device interface allows independent device locales each with their own memory manager. 16 | This allows not having to assign results and clear an entire group of pointers with one call, or by codestroy__device '' 17 | The same memory manager approach as my BN library is used. Mixed automatic and manual memory management is available. 18 | The M suffix on verbs that create pointers create an automanaged result. 19 | 20 | The design allows J single line productivity. Unlike my openssl bindings these use J dyads naturally, but the result is always a new pointer. 21 | 22 | see tests for usage. 23 | 24 | Error management is currently set to just crash at point of failure and didsplay what error information is returned from arrayfire (standard error is not used much by them, but the error codes are in arrayfire.ijs file) 25 | 26 | A subset of functions are implemented so far, but it should be straight forward to add the others as they have common signatures. 27 | 28 | Main commands in every locale and device: 29 | 30 | A creates an array. (scalars are arrays too) Af, Ad, As create "typed" arrays float double int32. I haven't implemented complex or byte arrays yet. 31 | A is simple monad with any numeric noun (handle chars when I do byte, but there are few functions suited to chars in AF library) 32 | R releases an array. 33 | M suffix (AM AfM...) puts created array in managed memory. addM mulM adds result to managed memory. 34 | J is universal from arrayfire to J command (every type) 35 | JR releases pointer after getting its contents. 36 | 37 | see wiki for performing the same BLAS tests that come with arrayfire in J 38 | 39 | https://github.com/Pascal-J/Jfire/wiki 40 | -------------------------------------------------------------------------------- /Jfire.ijs: -------------------------------------------------------------------------------- 1 | 2 | Note 'This is Jfire' 3 | Author: Pascal J -GPL3 liccense. 4 | requires download and install of Arrayfire. Binary versions at: http://arrayfire.com/download/ 5 | https://github.com/arrayfire/arrayfire 6 | http://www.arrayfire.com/docs/index.htm 7 | All J files in project should be in the same folder as this file 8 | 9 | BINDINGS for Arrayfire: crossplatform and crosslibrary API parallel gpu and cpu library. 10 | Jfire is mixed J and Arrayfire syntax, where J is the glue and scripting around the heavy libraries. 11 | Potential for a J dsl that allows as identical syntax as possible to those libraries. But the most practical approach: 12 | Design in J, and start copying over parts that could benefit from lazy and parallel computing to Arrayfire. 13 | So far, arrayfire on low end GPU hardware anyway shows promise for floating point or other calculation where you want less precision that J delivers. 14 | Heavy operations (matrix mult) can benefit the most. 15 | Arrayfire's current design involves a JIT step that adds noticeable lag on my system the first time a function is ran. 16 | But subsequent runs are respectably fast. 17 | ) 18 | 19 | Note 'Settings/loader' 20 | This file will (eventually) run a gui setup. Process is if file arrayfire.settings in this folder exist, then load those otherwise start setup. 21 | for now, 22 | SETTINGS FILE FORMAT: (lines separated by linefeed) 23 | path to arrayfire libraries (without trailing/) 24 | 3 boolean values (1 0) that describe which libraries to use CPU CUDA OPENCL (recommend CPU and OPENCL. If you do not have NVidia chip then set CUDA to 0) 25 | Default device ID for each library. 0 0 0 is safest setting (as all libraries with a device include id 0) 26 | ) 27 | 28 | cocurrent 'afloader' 29 | sampleconfig =: 0 : 0 30 | D:\Program Files\ArrayFire\v3\lib 31 | 1 0 1 32 | 0 0 1 33 | ) 34 | MYDIR =: getpath_j_ '\/' rplc~ > (4!:4<'thisfile'){(4!:3) thisfile=:'' NB. boilerplate to set the working directory 35 | require MYDIR ,'afzutils.ijs' 36 | 37 | AFpath_base_ =: configpath =: 3 : 0 38 | libAFpathset_af_ =: y 39 | LIBFILTER_af_ =: 1 1 1 40 | load MYDIR_afloader_ ,'arrayfire.ijs' 41 | try.c =. get_device_count_afcpu_ 1 catch. 'path likely wrong.' return. end. 42 | pD (<' Device count: ') (,~ ; 'get_device_count 1'&inl@boxopen@] ) every ;: 'afcpu afcuda afopencl' 43 | pD r =. 'get_device_count 1'&inl@boxopen@] every ;: 'afcpu afcuda afopencl' 44 | pD ,. 'device_info@set_device"0 i. get_device_count 1'&inl@boxopen each ;: 'afcpu afcuda afopencl' 45 | pD 'recommended config line 3 settings: 1st item in each box above is device 0: 0 0 0 is always safe' 46 | pD 'recommended config line 2 settings: ' , ": 0 < r 47 | pD 'example 3rd line (append boxed to this result): to use cpu device 0, cuda (if any) device 0, and opencl device 1 : 0 0 1' 48 | pD 'to set config, call AFsetconfig_base_@:(AFpath_base_ ":each@:(, <) 0 0 0"_) ''' , y , '''' 49 | y ; 0 < r 50 | ) 51 | config =: 3 : 0 52 | pD a =. cutLF y 53 | '3 boxed parameters needed' assert 3 = # a 54 | '3 boxed parameters needed' assert 1 = L. a 55 | libAFpathset_af_ =: 0 {:: a 56 | LIBFILTER_af_ =: 1 ".@{:: a 57 | LIBDEFAULT_af_ =: 2 ".@{:: a 58 | load MYDIR_afloader_ ,'arrayfire.ijs' 59 | load MYDIR_afloader_ ,'arrayfire.ijs' NB. double to make sure :P 60 | ) 61 | AFsetconfig_base_ =: setconfig =: 3 : 0 62 | '3 boxed parameters needed' assert 3 = # y 63 | '3 boxed parameters needed' assert 1 = L. y 64 | (LF joinstring y) fwrite MYDIR_afloader_ ,'arrayfire.settings' 65 | config_afloader_ fread MYDIR_afloader_ , 'arrayfire.settings' 66 | 'config file written and library loaded' 67 | 68 | ) 69 | 70 | 71 | 72 | GUARD =: config@fread`_1:@.(_1 -: fread) MYDIR , 'arrayfire.settings' 73 | 'config not set. Call AFpath_base_ path to where arrayfirelibraries (such as afcpu.dll or afcpu.so) are. read jfire.ijs for more help.' assert _1 -.@-: GUARD 74 | pD 'AFpath_base_ pathstr to change Arrayfire config' 75 | 76 | 77 | NB. see arrayf_test.ijs for examples and usage -------------------------------------------------------------------------------- /arrayf_test.ijs: -------------------------------------------------------------------------------- 1 | MYDIR =: getpath_j_ '\/' rplc~ > (4!:4<'thisfile'){(4!:3) thisfile=:'' NB. boilerplate to set the working directory 2 | require MYDIR , 'jfire.ijs' 3 | 4 | lrX_z_ =: 1 : ('''('', u lrA , '') '' , lr y';':';'''('', (lr x) , '') ('' , u lrA , '') '' , lr y') 5 | tsfX_z_ =: 1 : 'u [ [: 1!:2&2@:timespacex u lrX' 6 | 7 | Note 'library locales vs device objects' 8 | The library locales are afcpu afcuda and afopencl. They do not have managed (by J) memory. 9 | device objects are shown in the next note, and do have managed memory. The first few tests can use either library locales or device objects. 10 | 11 | TO CALL EACH TEST, 12 | pass a list of locales (boxed if more than 1, or if a device object) 13 | the code runs once for each locale passed as argument. 14 | ) 15 | test1 =: 'no test crashed' [ ( cutLF 0 : 0) (pD@inl [ pD@:(' ', ":)@[)each"2 0 <"0@boxopen 16 | infoF 1 17 | JR As i. 10 10 18 | 1 3 10 30 timespacex 'JR a =. As i. 10 10 100' 19 | 1 3 10 30 timespacex 'JR a =. A i. 10 100' 20 | 1 3 10 30 timespacex 'JR a =. A i. 10' 21 | ) 22 | floats =: 'no test crashed' [ ( cutLF 0 : 0) (pD@inl [ pD@:(' ', ":)@[)each"2 0 <"0@boxopen 23 | R b_base_ [ pD 0j16": J b_base_ =. Af ". ": %: 3 3 $ 1 2 3 5 6 7 8 10 11 NB. truncated f32 24 | R a_base_ [pD 0j16": J a_base_ =: Af %: 3 3 $ 1 2 3 5 6 7 8 10 11 NB. not truncated f32. 25 | 0j16": JR Ad ". ": %: 3 3 $ 1 2 3 5 6 7 8 10 11 NB. NB. crashes if device has no double support NB.truncated f64 26 | 0j16": JR Ad %: 3 3 $ 1 2 3 5 6 7 8 10 11 NB. f64 not truncated 27 | 0j16": %: 3 3 $ 1 2 3 5 6 7 8 10 11 NB. What J thinks it should get back 28 | ) 29 | 30 | maybefails =: 'no test crashed' [ ( cutLF 0 : 0) (pD@inl [ pD@:(' ', ":)@[)each"2 0 <"0@boxopen 31 | 0j16": JR Ad %: 3 3 $ 1 2 3 5 6 7 8 10 11 NB. crashes if device has no double support 32 | 33 | ) 34 | 35 | adds =: 'no test crashed' [ ( cutLF 0 : 0) (pD@inl [ pD@:(' ', ":)@[)each"2 0 <"0@boxopen 36 | infoF 0 37 | R a,b [ pD@JR c_base_ =: add/ tsfX 'a b' =. A"1 i.2 5 38 | R a,b [ pD(JR ; get_type) add/ 'a b' =. pD As every 6 ; i. 5 NB. if batchmode 0 on add 39 | ) 40 | NB. TESTS BELOW THIS MUST BE CALLED WITH A DEVICE OBJECT(s). 41 | Note 'sample to makde device objects (copy and F8)' 42 | C =. P =. ('afcpu';0) conew 'afdevice' 43 | O =. ('afopencl';1) conew 'afdevice' 44 | C =. G =. ('afopencl';0) conew 'afdevice' 45 | addsManaged P,O 46 | ) 47 | Jspecials =: 'no test crashed' [ ( cutLF 0 : 0) (pD@inl [ pD@:(' ', ":)@[)each"2 0 <"0@boxopen 48 | info__C setme__C C =. coname '' 49 | J__C expM__C~ AM__C 0 50 | J__C divM__C~ AM__C 0 51 | J__C divM__C~ AfM__C 0 52 | J__C divM__C~ AM__C 0 1 2 53 | 54 | ) 55 | addsManaged =: 'no test crashed' [ ( cutLF 0 : 0) (pD@inl [ pD@:(' ', ":)@[)each"2 0 <"0@boxopen 56 | C =. coname '' NB. not necessary as code will run in each y locale 57 | J addM/tsfX AM"1 i.20 5 NB. mem managed arrays. must use a device object. use killmanaged__object to clear all mem allocated. 58 | ([: J addM/)tsfX AM"1 i.20 5 NB. time to J as well. 59 | JR__C (AM__C 100000 ) add__C AM__C 239420398023948 1231 1234 NB. scalar + vector 60 | JR__C (AM__C 1 2 ) add__C AM__C 2 3 $ 239420398023948 1231 1234 NB. vector + table reasonable compatibility shape 61 | JR__C (AM__C 2 2 $ 1 2 3 4) add__C AM__C 2 2 3 $ 239420398023948 1231 1234 NB. reasonable compatibility shape 62 | ) 63 | NB. only afcpu is not buggy 64 | reduces =: 'no test crashed' [ ( cutLF 0 : 0) (pD@inl [ pD@:(' ', ":)@[)each"2 0 <"0@boxopen 65 | info__C setme__C C =. coname '' 66 | J__C 1 sumM__C AM__C i.5 10 67 | J__C 0 sumM__C AM__C 1000000000 + i.5 10 68 | J__C 1 sumM__C AfM__C i.5 10 69 | J__C 0 sumM__C AfM__C i.5 10 70 | J__C 1 sumM__C AdM__C i.5 10 71 | J__C 0 sumM__C AdM__C i.5 10 72 | +/ i.10 5 73 | +/"1 i.10 5 74 | J__C 1 sumM__C tsfX AsM__C i.4 5000 NB. fails on afcpu too. 75 | (+/ b =.?. 800000 4 $ 100000) -: J__C 1 sumM__C tsfX a =.AM__C ?. 4 800000 $ 100000 76 | timespacex 'J__C 1 sumM__C tsfX a' NB. tsfX fast because a is just a pointer. 77 | timespacex '+/ tsfX b' NB. tsfX is slow here because data is copied into function. 78 | timespacex 'J__C 1 sumM__C a' 79 | killmanaged__C timespacex 'J__C 0 sumM__C a' [ a =. AM__C"1 ?. 4 800000 $ 100000 80 | killmanaged__C timespacex 'J__C 0 sumM__C a' [ a =. AM__C"1 ?. 16 200000 $ 100000 81 | timespacex '+/ b ' 82 | timespacex '+/ each <"1 b ' [ b=. ?.4 800000 $ 100000 83 | timespacex '+/ each b ' [ b=. <"1 ?. 4 800000 $ 100000 84 | 85 | ) 86 | sets =: 'no test crashed' [ ( cutLF 0 : 0) (pD@inl [ pD@:(' ', ":)@[)each"2 0 <"0@boxopen 87 | setme__C C =. coname '' 88 | J__C a =. setM__C AdM__C 2 3 3 4 1 5 3 2 NB. must be floats/double 89 | JR__C 1 set_intersect__C/ a , setM__C AfM__C 3 5 7 7 1 2 90 | JR__C a intersect__C setM__C AfM__C 3 5 7 7 1 2 0 2 91 | JR__C 1 set_union__C/ a , setM__C AfM__C 3 5 7 7 1 2 0 2 92 | JR__C a union__C setM__C AfM__C 3 5 7 7 1 2 93 | ) 94 | 95 | 96 | 97 | multimatmuls =: 4 : 'for_i. x do. matmuls y [ matmulp_base_ =: 2 # i end.' 98 | multimatmulsF =: 4 : 'for_i. x do. matmulsFonly y [ matmulp_base_ =: 2 # i end.' 99 | matmulp_base_ =. 100 100 100 | matmuls =: 'no test crashed' [ ( cutLF 0 : 0) (pD@inl [ pD@:(' ', ":)@[)each"2 0 <"0@boxopen 101 | matmulp_base_ 102 | J 0 0 matmul~tsfX AdM 5 5 $ i. 5 103 | timespacex'JR 0 0 matmul~tsfX AdM matmulp_base_ $ i. 5' NB. double 104 | timespacex' JR@:((0 0 matmul~)tsfX) AfM matmulp_base_ $ i. 5' NB. float 105 | timespacex'+/ . *~ matmulp_base_ $ i. 5' 106 | ((+/ . *)~ -: [: JR@:(0 0 matmul~)tsfX AdM) matmulp_base_ $ i. 5 NB. TEST MATCHED. timing includes getting back to J 107 | R 0 0 matmul~tsfX AdM matmulp_base_ $ i. 5 NB. don't access result should return fast 108 | killmanaged i.0 109 | ) 110 | NB. needed for device that doesn't support double 111 | matmulsFonly =:'no test crashed' [ ( cutLF 0 : 0) (pD@inl [ pD@:(' ', ":)@[)each"2 0 <"0@boxopen 112 | matmulp_base_ 113 | timespacex' JR@:((0 0 matmul~)tsfX) AfM matmulp_base_ $ ?. 5$1' NB. float 114 | timespacex'+/ . *~ matmulp_base_ $ i. 5' 115 | ((+/ . *)~ -: [: JR@:(0 0 matmul~)tsfX AfM) matmulp_base_ $ ?. 5$1 NB. TEST MATCHED. timing includes getting back to J 116 | R 0 0 matmul~tsfX AfM matmulp_base_ $ ?. 5$1 NB. don't access result should return fast 117 | killmanaged i.0 118 | ) 119 | 120 | fails =: 'no test crashed' [ ( cutLF 0 : 0) (pD@inl [ pD@:(' ', ":)@[)each"2 0 <"0@boxopen 121 | R a,b [ add/ 'a b' =. A every 6 ; i. 5 NB. if batchmode 0 on add NB. fixed. 122 | ) 123 | 124 | convolveRNG =: (4294967295 (17 b.) {:@$ ((] ,@:({."0 1)~ -@-:@[ , -:@[) ,: ] {~ -:@[ + i.@[) +//. @: (+//. @:((2147483647 | */~)"1))) 125 | NB. convolveRNG ^:(5) >: i.2 6 126 | convolveRNGtest =: 'no test crashed' [ ( cutLF 0 : 0) (pD@inl [ pD@:(' ', ":)@[)each"2 0 <"0@boxopen 127 | infoF m31 =: A 2147483647 128 | J mulM~"0 AM"1 >: i.2 6 NB. make 2 arrays and square each 129 | J m31 modM"0 0~ mulM~"0 (AM"1) 100000 + i.2 6 NB. mod is J-backwards 130 | 2147483647 | (*~"1) 100000 + i.2 6 131 | J (AM 2) mulM"0 0 AM"1 i.2 6 132 | ([: AM"1 $ #"1 ,.)"1 >: i.2 6 NB. can call J__device on output pointers to combine arrays. 133 | +//. +//."_1 J m31 modM~"0 (AM"0 mulM"0 0 AM)"1 >: i.2 6 134 | NB.J ([: AM"1 $ #"1 ,.) mulM"0 0"1 0 AM@])"1 >: i.2 6 135 | ((4294967295 (17 b.) {:@$ ((] ,@:({."0 1)~ -@-:@[ , -:@[) ,: ] {~ -:@[ + i.@[) [: +//.@:(+//."_1@:J) m31 modM~"0 (AM"0 mulM"0 0 AM)"1))^:4 tsfX >: i.2 6 136 | ((4294967295 (17 b.) {:@$ ((] ,@:({."0 1)~ -@-:@[ , -:@[) ,: ] {~ -:@[ + i.@[) [: +//.@:(+//."_1@:J) m31 modM~"0 (AM"0 mulM"0 0 AM)"1))^:3 tsfX >: i.2 12 137 | convolveRNG_base_^:4 tsfX >: i.2 6 NB.4 iterations fail match 138 | convolveRNG_base_^:3 tsfX >: i.2 12 NB.3 iterations match 139 | ) 140 | 141 | polymult =: 'no test crashed' [ ( cutLF 0 : 0) (pD@inl [ pD@:(' ', ":)@[)each"2 0 <"0@boxopen 142 | a =. ? 100000000 $~ c [ b =. ? 100000000 $~ c=.350 143 | +//. J a (AM"0@[ mulM"0 0 tsfX AM@]) b 144 | +//. J a (([: AM"1 $ #"1 ,.)@[ mulM"0 0 tsfX AM@]) b 145 | timespacex 'a (([: AM"1 $ #"1 ,.)@[ mulM"0 0 tsfX AM@]) b' NB. no access to result or oblique sum 146 | a +//.@:(*/) tsfX b 147 | killmanaged 0 148 | ) -------------------------------------------------------------------------------- /arrayfire.ijs: -------------------------------------------------------------------------------- 1 | 2 | require 'dll' 3 | cocurrent 'af' 4 | NB.pD 'Arrayfire libpath set to: ' ;libAFpath =: IFWIN pick '';'D:\Program Files\ArrayFire\v3\lib' NB. OVERWRITTEN NEXT LINE 5 | libAFpath =: libAFpathset_af_ NB. set in loader 6 | libAFmainlib =: libAFpath , (IFIOS + (;: 'Win Linux Android Darwin') i. '' = {.x do. (y) =: (y , '' > + '' , }. x) libAF else. (y) =: (y , '' + '' , x) libAF end. y'&>/"1 16 | cdparse =:cdparseS =: 4 : '(y) =: (y , '' '' , x) libAF label_. y'&>/"1 17 | BUGGY =: dltb leaf ((':' {.@:cut [), {.@:('('&cut)@])&>/"1 ] 2 {."1 (9{a.) cut every cutLF 0 : 0 18 | n *c *c *c *c : void deviceInfo(char *d_name, char *d_platform, char *d_toolkit, char *d_compute) 19 | i *c *c *c *c : af_err af_deviceprop(char* d_name, char* d_platform, char *d_toolkit, char* d_compute) 20 | l n : AFAPI int getDeviceCount() 21 | ) 22 | AFLIB =: dltb leaf ((':' {.@:cut [), {.@:('('&cut)@])&>/"1 ] 2 {."1 (9{a.) cut every cutLF 0 : 0 23 | i *c *c *c *c : af_err af_device_info(char* d_name, char* d_platform, char *d_toolkit, char* d_compute) 24 | i *i : af_err af_get_device_count( int * num_of_devices ) 25 | i c : AFAPI af_err af_info() 26 | i n : AFAPI af_err af_init() 27 | i i : af_err af_sync(const int device) 28 | i *i : af_err af_free_device(void *ptr) 29 | i i : af_err af_set_device( const int device ) 30 | i *i : af_err af_get_device( int * device ) 31 | i *i i :af_err af_get_dbl_support (bool *available, const int device) 32 | i *i *i *i *i :af_err af_device_mem_info (size_t *alloc_bytes, size_t *alloc_buffers, size_t *lock_bytes, size_t *lock_buffers) 33 | i n :af_err af_device_gc () 34 | i i :af_err af_set_backend(const af_backend bknd) 35 | i *i *i *i *i :af_err af_device_mem_info (size_t *alloc_bytes, size_t *alloc_buffers, size_t *lock_bytes, size_t *lock_buffers) 36 | i *i :af_err af_get_mem_step_size(size_t * step_bytes ) 37 | i *x *x x *x i :af_err af_create_array (af_array *arr, const void *const data, const unsigned ndims, const dim_t *const dims, const af_dtype type) 38 | i *x x:af_err af_get_data_ptr (void *data, const af_array arr) 39 | > i x :af_err af_release_array (af_array arr) 40 | i *x x:af_err af_retain_array (af_array *out, const af_array in) 41 | i *i x :af_err af_get_numdims (unsigned *result, const af_array arr) 42 | i *i *i *i *i x:af_err af_get_dims(dim_t * d0,dim_t * d1,dim_t * d2,dim_t * d3,const af_array arr 43 | i *i x:af_err af_get_type (af_dtype *type, const af_array arr) 44 | i *i x:af_err af_get_elements (dim_t *elems, const af_array arr) 45 | i *x x x i:af_err af_add (af_array *out, const af_array lhs, const af_array rhs, const bool batch) 46 | i *x x x i:af_err af_sub (af_array *out, const af_array lhs, const af_array rhs, const bool batch) 47 | i *x x x i:af_err af_mul (af_array *out, const af_array lhs, const af_array rhs, const bool batch) 48 | i *x x x i:af_err af_div (af_array *out, const af_array lhs, const af_array rhs, const bool batch) 49 | i *x x x i:af_err af_bitxor (af_array *out, const af_array lhs, const af_array rhs, const bool batch) 50 | i *x x x i:af_err af_bitand (af_array *out, const af_array lhs, const af_array rhs, const bool batch) 51 | i *x x x i:af_err af_bitor (af_array *out, const af_array lhs, const af_array rhs, const bool batch) 52 | i *x x x i:af_err af_mod (af_array *out, const af_array lhs, const af_array rhs, const bool batch) 53 | i *x x x i:af_err af_exp (af_array *out, const af_array lhs, const af_array rhs, const bool batch) 54 | i *x x x i i:af_err af_matmul (af_array *out, const af_array lhs, const af_array rhs, const af_mat_prop optLhs, const af_mat_prop optRhs) 55 | i *x x i:af_err af_set_unique (af_array *out, const af_array in, const bool is_sorted) 56 | i *x x x i:af_err af_set_intersect (af_array *out, const af_array first, const af_array second, const bool is_unique) 57 | i *x x x i:af_err af_set_union (af_array *out, const af_array first, const af_array second, const bool is_unique) 58 | i *x x i :af_err af_sum (af_array *out, const af_array in, const int dim) 59 | i *x x i :af_err af_product (af_array *out, const af_array in, const int dim) 60 | i *x x i :af_err af_min (af_array *out, const af_array in, const int dim) 61 | i *x x i :af_err af_max (af_array *out, const af_array in, const int dim) 62 | i *x x i :af_err af_alltrue (af_array *out, const af_array in, const int dim) 63 | i *x x i :af_err af_anytrue (af_array *out, const af_array in, const int dim) 64 | i *x x i :af_err af_count (af_array *out, const af_array in, const int dim) 65 | ) 66 | cdSp =: 3 : '''c n s'' =. y label_.(n,s) =: (n , '' '' , c) libAF label_. y'"1 67 | SPECIALVERs =: dltb leaf ((':' {.@:cut 1 {:: ]) , {.@:('('&cut)@(2 {:: ]) ,{.)"1 ] 3 {."1 (9{a.) cut every cutLF 0 : 0 68 | F i *x *f x *x i :af_err af_create_array (af_array *arr, const void *const data, const unsigned ndims, const dim_t *const dims, const af_dtype type) 69 | J i *x *j x *x i :af_err af_create_array (af_array *arr, const void *const data, const unsigned ndims, const dim_t *const dims, const af_dtype type) 70 | D i *x *d x *x i :af_err af_create_array (af_array *arr, const void *const data, const unsigned ndims, const dim_t *const dims, const af_dtype type) 71 | S i *x *i x *x i :af_err af_create_array (af_array *arr, const void *const data, const unsigned ndims, const dim_t *const dims, const af_dtype type) 72 | F i *f x:af_err af_get_data_ptr (void *data, const af_array arr) 73 | D i *d x:af_err af_get_data_ptr (void *data, const af_array arr) 74 | S i *i x:af_err af_get_data_ptr (void *data, const af_array arr) 75 | ) 76 | get_device_count =: (1 {.@{:: af_get_device_count@<@,@0:) :: 0: 77 | get_device =: 1 {.@{:: af_get_device@<@,@0: 78 | set_device =: 3 : 'CURRENT =: get_device@:af_set_device y' NB. y is int ID. No error if return = y 79 | set_device =: 3 : '1 {:: af_set_device NUMDEVICES | y ' NB. don't cache current, but allow perpetual toggle of devices by rolling over out of bounds. 80 | device_mem_info =: (' DoubleSupport?: ' , ":@:get_dbl_support@:get_device) ; [: }.@af_device_mem_info ,@1:;,@2:;,@3:;,@4: 81 | mem_infoF =: ({. , (cut 'AlocByte: AlocBuf: LockByte: LockBuf:') (, ' ' , ":) each }.)@:device_mem_info 82 | device_info =: [: dltb0 each (DRIVER ,' DeviceID : ' , ":@get_device) ; [: }.@af_device_info (128 <@$ ' '"_) ,(128 <@$ ' '"_) ,(128 <@$ ' '"_) , 128 <@$ ' '"_ 83 | infoF =: device_info ,: mem_infoF 84 | get_dbl_support =: 1 {:: [: af_get_dbl_support (,0);] 85 | info =: af_info@:(' '"_) NB. console only. device_info much more useful anyway. 86 | device_gc=: af_device_gc@:(' '"_) 87 | A =: ([: (af_create_array) (,0) ; , ; (1 >. #@$) ; ,@$`(,@1:)@.((i.0) -: $) ; MAPa ) 88 | A =: ([: (chkerR@af_create_array) (,0) ; , ; (1 >. #@$) ; (4 {.!.1 $) ; s64"_ ) 89 | Ad=: ([: (chkerR@af_create_arrayD) (,0) ; , ; (1 >. #@$) ; (4 {.!.1 $) ; f64"_ ) 90 | Af=: ([: (chkerR@af_create_arrayF) (,0) ; , ; (1 >. #@$) ; (4 {.!.1 $) ; f32"_ ) 91 | As=: ([: (chkerR@af_create_arrayS) (,0) ; , ; (1 >. #@$) ; (4 {.!.1 $) ; s32"_ ) 92 | 'useless' NB.create_arrayRshape =: [: (af_create_array) (,0) ; ,@] ;(1 >. 0 #@{:: [ ) ; [ NB. Dyad x is manual shape and datatype. manual shape may be needed due to dll unpacking of items. 93 | Atyped =: [: (chkerR@af_create_array) (,0) ; ,@] ;(1 >. #@$)@];(4 {.!.1 $)@] ; [ NB. Dyad x is manual datatype. 94 | Atypedf =: [: (chkerR@af_create_arrayF) (,0) ; ,@] ;(1 >. #@$)@];(4 {.!.1 $)@] ; [ NB. Dyad x is manual datatype. 95 | 96 | R =: af_release_array"0 97 | get_dims =: [: {.every 1 2 3 4 { [: af_get_dims (, each 0 1 2 3)(,<)] 98 | get_numdims =: 1 {.@{:: [: af_get_numdims (,0) ; ] 99 | get_type =: 1 {.@{:: [: af_get_type (,0) ; ] 100 | dims =: get_numdims{. get_dims 101 | count =: {.@get_dims 102 | num_elements =: 1 {.@{::[: af_get_elements (,0);] 103 | 104 | J =: (dims $ 1 {:: [: (af_get_data_ptrF)`('c32 not supported' assert 0:)`(af_get_data_ptrD)`(af_get_data_ptrJ)`(af_get_data_ptrB)`(af_get_data_ptrS)`(af_get_data_ptr)`(af_get_data_ptrB)`(af_get_data_ptr)`(af_get_data_ptr)@.(1 get_type@{:: ]) (num_elements # AFpadval@get_type) ; ])"0 105 | 'not safe enough' NB. assignR =: assign [ R@(4 :'x~ assert. 100000000 < | x~' :: 0:) NB. Release ptr in name(str) x , then assign y to x 106 | NB. not complete but good idea. managed mem much more useful though. 107 | Ra =: 2 : 0 NB. applies verb u, and releases args indicated by list n: 0 no release. negative: index of 1based-x param positive: 1based-index of y param. Ex: xptr add Ra (_1 1) yptr releases both x and y after getting result of add 108 | ([ 'R'locs@[ v"_ <:@ #~ 0 > v"_) ] (] 'R'locs@[ v"_ <:@ #~ 0 < v"_) ]u 109 | ) 110 | JR =: (R ] J)"0 NB. release after getting toJ 111 | add =: ([: chkerR@af_add (,0) ; [ ; ] ; 0:)"0 0 NB. overwritten by next batch. 112 | NB.add =: ([: chkerR@af_bitxor (,0) ; [ ; ] ; 1:)"0 0 113 | dyadlist =: 'add bitxor bitand bitor sub mul div mod exp' 114 | 3 : '(y) =: (''([: chkerR@af_'', y, '' (,0) ; [ ; ] ; 1:)"0 0'' ) eval label_. y' each ;: dyadlist 115 | reducelist =: 'sum product count alltrue anytrue max min' 116 | 3 : '(y) =: (''(_1&$: : ([: chkerR@af_'', y, '' (,0) ; [ ;~ ]))"0 _ 0'' ) eval label_. y' each ;: reducelist 117 | add_a =: ([: chkerR@af_add (0 {:: ]) ; 1&{:: ; 2&{:: ; 0:)"1 NB. monad triplet version. result, x, y pointers. 0 for result creates new array. FAILS (but keep trying): Hopefully can overwrite result into existing array pointer. 118 | matmul =: 1 : 'a=. coname '''' label_. ([: chkerR__a@af_matmul__a f. (,0) ; [ ; (;/m) ;~ ])' NB. m is transpose options 0 0 is no transpose. see enumbs below 119 | set =: 0&$: : ([: chkerR@af_set_unique (,0) ; [ ;~ ]) 120 | set_intersect =: 1 : 'a=. coname '''' label_. ([: chkerR__a@af_set_intersect__a f. (,0) ; [ ; (m) ;~ ])' 121 | set_union =: 1 : 'a=. coname '''' label_. ([: chkerR__a@af_set_union__a f. (,0) ; [ ; (m) ;~ ])' 122 | 123 | cocurrent 'afenums' 124 | enumO =: (] assign each i.@#) 125 | enum =: ([ assign ".@])&>/"1 126 | enumO ' '{.@cut every ',' {.@cut"1 dltb every cutLF 0 : 0 127 | f32, ///< 32-bit floating point values 128 | c32, ///< 32-bit complex floating point values 129 | f64, ///< 64-bit complex floating point values 130 | c64, ///< 64-bit complex floating point values 131 | b8, ///< 8-bit boolean values 132 | s32, ///< 32-bit signed integral values 133 | u32, ///< 32-bit unsigned integral values 134 | u8, ///< 8-bit unsigned integral values 135 | s64, ///< 64-bit signed integral values 136 | u64 ///< 64-bit unsigned integral values 137 | ) 138 | MAPa =: (4 7 ,(IF64 { 5 8 ) ,(IF64 { 0 2 ),(IF64 { 1 3) ){~ 1 2 4 8 16 i. 3!:0 NB. mapArr 139 | MAPs =: 3 : 0@:MAPa NB. input is an above enum. mapSafe 140 | if. -.get_dbl_support CURRENT do. 2 -~^:(2 3 e. ]) y else. y end. 141 | ) 142 | AFbytesize =: {&4 4 8 1 4 4 1 8 8 143 | AFmemrsize =: {&8 16 8 16 2 4 4 2 4 4 144 | AFpadval =: {::&(0.5;0j1;0.5;0j1;0;0;0;0;0) :: 0: NB.errors can still get data out. 145 | AFpadval =: {::&(0.5;0j1;0.5;0j1;0;0;0;0;0) :: (0.5"_) 146 | 147 | enum dltb each"1 '=' cut every ',' {.@cut"1 dltb every cutLF 0 : 0 148 | AF_BACKEND_DEFAULT = 0, ///< Default backend order: OpenCL -> CUDA -> CPU 149 | AF_BACKEND_CPU = 1, ///< CPU a.k.a sequential algorithms 150 | AF_BACKEND_CUDA = 2, ///< CUDA Compute Backend 151 | AF_BACKEND_OPENCL = 3, ///< OpenCL Compute Backend 152 | ) 153 | 154 | enum dltb each"1 '=' cut every ',' {.@cut"1 dltb every cutLF 0 : 0 155 | AF_ERR_NO_MEM = 101, /// The system or device ran out of memory 100-199 Errors in environment 156 | AF_ERR_DRIVER = 102, /// There was an error in the device driver 157 | AF_ERR_RUNTIME = 103, /// There was an error with the runtime environment 158 | AF_ERR_INVALID_ARRAY = 201, /// The input array is not a valid af_array object.200-299 Errors in input parameters 159 | AF_ERR_ARG = 202, /// One of the function arguments is incorrect 160 | AF_ERR_SIZE = 203, /// The size is incorrect 161 | AF_ERR_TYPE = 204, /// The type is not suppported by this function 162 | AF_ERR_DIFF_TYPE = 205, /// The type of the input arrays are not compatible 163 | AF_ERR_BATCH = 207, /// Function does not support GFOR / batch mode 164 | AF_ERR_NOT_SUPPORTED = 301, /// The option is not supported 300-399 Errors for missing software features 165 | AF_ERR_NOT_CONFIGURED = 302, /// This build of ArrayFire does not support this feature 166 | AFF_ERR_NONFREE = 303, /// This build of ArrayFire is not compiled with "nonfree" algorithms 167 | AF_ERR_NO_DBL = 401, /// This device does not support double 400-499 Errors for missing hardware features 168 | AF_ERR_NO_GFX = 402, /// This build of ArrayFire was not built with graphics or this device does not support graphics 169 | AF_ERR_LOAD_LIB = 501, // 500-599 Errors specific to heterogenous API 170 | AF_ERR_LOAD_SYM = 502, // 900-999 Errors from upstream libraries and runtimes 171 | AF_ERR_INTERNAL = 998, /// There was an internal error either in ArrayFire or in a project upstream 172 | AF_ERR_UNKNOWN = 999, /// Unknown Error 173 | ) 174 | 175 | enum dltb each"1 '=' cut every ',' {.@cut"1 dltb every cutLF 0 : 0 176 | AF_MAT_NONE = 0, ///< Default 177 | AF_MAT_TRANS = 1, ///< Data needs to be transposed 178 | AF_MAT_CTRANS = 2, ///< Data needs to be conjugate tansposed 179 | AF_MAT_CONJ = 4, ///< Data needs to be conjugate 180 | AF_MAT_UPPER = 32, ///< Matrix is upper triangular 181 | AF_MAT_LOWER = 64, ///< Matrix is lower triangular 182 | AF_MAT_DIAG_UNIT = 128, ///< Matrix diagonal contains unitary values 183 | AF_MAT_SYM = 512, ///< Matrix is symmetric 184 | AF_MAT_POSDEF = 1024, ///< Matrix is positive definite 185 | AF_MAT_ORTHOG = 2048, ///< Matrix is orthogonal 186 | AF_MAT_TRI_DIAG = 4096, ///< Matrix is tri diagonal 187 | AF_MAT_BLOCK_DIAG = 8192, ///< Matrix is block diagonal 188 | ) 189 | 190 | (cutLF 0 : 0) inl each"2 0 <"0@boxopen LIBFILTER_af_ # ;: 'afcpu afcuda afopencl' 191 | a =. > coname '' 192 | coinsert 'af' 193 | DRIVER =: (('''', toupper a ,'''') , '"_') eval 194 | libAFmainlib =: libAFpath , (IFIOS + (;: 'Win Linux Android Darwin') i. 5 | Everyone is permitted to copy and distribute verbatim copies 6 | of this license document, but changing it is not allowed. 7 | 8 | Preamble 9 | 10 | The GNU General Public License is a free, copyleft license for 11 | software and other kinds of works. 12 | 13 | The licenses for most software and other practical works are designed 14 | to take away your freedom to share and change the works. By contrast, 15 | the GNU General Public License is intended to guarantee your freedom to 16 | share and change all versions of a program--to make sure it remains free 17 | software for all its users. We, the Free Software Foundation, use the 18 | GNU General Public License for most of our software; it applies also to 19 | any other work released this way by its authors. You can apply it to 20 | your programs, too. 21 | 22 | When we speak of free software, we are referring to freedom, not 23 | price. Our General Public Licenses are designed to make sure that you 24 | have the freedom to distribute copies of free software (and charge for 25 | them if you wish), that you receive source code or can get it if you 26 | want it, that you can change the software or use pieces of it in new 27 | free programs, and that you know you can do these things. 28 | 29 | To protect your rights, we need to prevent others from denying you 30 | these rights or asking you to surrender the rights. Therefore, you have 31 | certain responsibilities if you distribute copies of the software, or if 32 | you modify it: responsibilities to respect the freedom of others. 33 | 34 | For example, if you distribute copies of such a program, whether 35 | gratis or for a fee, you must pass on to the recipients the same 36 | freedoms that you received. You must make sure that they, too, receive 37 | or can get the source code. And you must show them these terms so they 38 | know their rights. 39 | 40 | Developers that use the GNU GPL protect your rights with two steps: 41 | (1) assert copyright on the software, and (2) offer you this License 42 | giving you legal permission to copy, distribute and/or modify it. 43 | 44 | For the developers' and authors' protection, the GPL clearly explains 45 | that there is no warranty for this free software. For both users' and 46 | authors' sake, the GPL requires that modified versions be marked as 47 | changed, so that their problems will not be attributed erroneously to 48 | authors of previous versions. 49 | 50 | Some devices are designed to deny users access to install or run 51 | modified versions of the software inside them, although the manufacturer 52 | can do so. This is fundamentally incompatible with the aim of 53 | protecting users' freedom to change the software. The systematic 54 | pattern of such abuse occurs in the area of products for individuals to 55 | use, which is precisely where it is most unacceptable. Therefore, we 56 | have designed this version of the GPL to prohibit the practice for those 57 | products. If such problems arise substantially in other domains, we 58 | stand ready to extend this provision to those domains in future versions 59 | of the GPL, as needed to protect the freedom of users. 60 | 61 | Finally, every program is threatened constantly by software patents. 62 | States should not allow patents to restrict development and use of 63 | software on general-purpose computers, but in those that do, we wish to 64 | avoid the special danger that patents applied to a free program could 65 | make it effectively proprietary. To prevent this, the GPL assures that 66 | patents cannot be used to render the program non-free. 67 | 68 | The precise terms and conditions for copying, distribution and 69 | modification follow. 70 | 71 | TERMS AND CONDITIONS 72 | 73 | 0. Definitions. 74 | 75 | "This License" refers to version 3 of the GNU General Public License. 76 | 77 | "Copyright" also means copyright-like laws that apply to other kinds of 78 | works, such as semiconductor masks. 79 | 80 | "The Program" refers to any copyrightable work licensed under this 81 | License. Each licensee is addressed as "you". "Licensees" and 82 | "recipients" may be individuals or organizations. 83 | 84 | To "modify" a work means to copy from or adapt all or part of the work 85 | in a fashion requiring copyright permission, other than the making of an 86 | exact copy. The resulting work is called a "modified version" of the 87 | earlier work or a work "based on" the earlier work. 88 | 89 | A "covered work" means either the unmodified Program or a work based 90 | on the Program. 91 | 92 | To "propagate" a work means to do anything with it that, without 93 | permission, would make you directly or secondarily liable for 94 | infringement under applicable copyright law, except executing it on a 95 | computer or modifying a private copy. Propagation includes copying, 96 | distribution (with or without modification), making available to the 97 | public, and in some countries other activities as well. 98 | 99 | To "convey" a work means any kind of propagation that enables other 100 | parties to make or receive copies. Mere interaction with a user through 101 | a computer network, with no transfer of a copy, is not conveying. 102 | 103 | An interactive user interface displays "Appropriate Legal Notices" 104 | to the extent that it includes a convenient and prominently visible 105 | feature that (1) displays an appropriate copyright notice, and (2) 106 | tells the user that there is no warranty for the work (except to the 107 | extent that warranties are provided), that licensees may convey the 108 | work under this License, and how to view a copy of this License. If 109 | the interface presents a list of user commands or options, such as a 110 | menu, a prominent item in the list meets this criterion. 111 | 112 | 1. Source Code. 113 | 114 | The "source code" for a work means the preferred form of the work 115 | for making modifications to it. "Object code" means any non-source 116 | form of a work. 117 | 118 | A "Standard Interface" means an interface that either is an official 119 | standard defined by a recognized standards body, or, in the case of 120 | interfaces specified for a particular programming language, one that 121 | is widely used among developers working in that language. 122 | 123 | The "System Libraries" of an executable work include anything, other 124 | than the work as a whole, that (a) is included in the normal form of 125 | packaging a Major Component, but which is not part of that Major 126 | Component, and (b) serves only to enable use of the work with that 127 | Major Component, or to implement a Standard Interface for which an 128 | implementation is available to the public in source code form. A 129 | "Major Component", in this context, means a major essential component 130 | (kernel, window system, and so on) of the specific operating system 131 | (if any) on which the executable work runs, or a compiler used to 132 | produce the work, or an object code interpreter used to run it. 133 | 134 | The "Corresponding Source" for a work in object code form means all 135 | the source code needed to generate, install, and (for an executable 136 | work) run the object code and to modify the work, including scripts to 137 | control those activities. However, it does not include the work's 138 | System Libraries, or general-purpose tools or generally available free 139 | programs which are used unmodified in performing those activities but 140 | which are not part of the work. For example, Corresponding Source 141 | includes interface definition files associated with source files for 142 | the work, and the source code for shared libraries and dynamically 143 | linked subprograms that the work is specifically designed to require, 144 | such as by intimate data communication or control flow between those 145 | subprograms and other parts of the work. 146 | 147 | The Corresponding Source need not include anything that users 148 | can regenerate automatically from other parts of the Corresponding 149 | Source. 150 | 151 | The Corresponding Source for a work in source code form is that 152 | same work. 153 | 154 | 2. Basic Permissions. 155 | 156 | All rights granted under this License are granted for the term of 157 | copyright on the Program, and are irrevocable provided the stated 158 | conditions are met. This License explicitly affirms your unlimited 159 | permission to run the unmodified Program. The output from running a 160 | covered work is covered by this License only if the output, given its 161 | content, constitutes a covered work. This License acknowledges your 162 | rights of fair use or other equivalent, as provided by copyright law. 163 | 164 | You may make, run and propagate covered works that you do not 165 | convey, without conditions so long as your license otherwise remains 166 | in force. You may convey covered works to others for the sole purpose 167 | of having them make modifications exclusively for you, or provide you 168 | with facilities for running those works, provided that you comply with 169 | the terms of this License in conveying all material for which you do 170 | not control copyright. Those thus making or running the covered works 171 | for you must do so exclusively on your behalf, under your direction 172 | and control, on terms that prohibit them from making any copies of 173 | your copyrighted material outside their relationship with you. 174 | 175 | Conveying under any other circumstances is permitted solely under 176 | the conditions stated below. Sublicensing is not allowed; section 10 177 | makes it unnecessary. 178 | 179 | 3. Protecting Users' Legal Rights From Anti-Circumvention Law. 180 | 181 | No covered work shall be deemed part of an effective technological 182 | measure under any applicable law fulfilling obligations under article 183 | 11 of the WIPO copyright treaty adopted on 20 December 1996, or 184 | similar laws prohibiting or restricting circumvention of such 185 | measures. 186 | 187 | When you convey a covered work, you waive any legal power to forbid 188 | circumvention of technological measures to the extent such circumvention 189 | is effected by exercising rights under this License with respect to 190 | the covered work, and you disclaim any intention to limit operation or 191 | modification of the work as a means of enforcing, against the work's 192 | users, your or third parties' legal rights to forbid circumvention of 193 | technological measures. 194 | 195 | 4. Conveying Verbatim Copies. 196 | 197 | You may convey verbatim copies of the Program's source code as you 198 | receive it, in any medium, provided that you conspicuously and 199 | appropriately publish on each copy an appropriate copyright notice; 200 | keep intact all notices stating that this License and any 201 | non-permissive terms added in accord with section 7 apply to the code; 202 | keep intact all notices of the absence of any warranty; and give all 203 | recipients a copy of this License along with the Program. 204 | 205 | You may charge any price or no price for each copy that you convey, 206 | and you may offer support or warranty protection for a fee. 207 | 208 | 5. Conveying Modified Source Versions. 209 | 210 | You may convey a work based on the Program, or the modifications to 211 | produce it from the Program, in the form of source code under the 212 | terms of section 4, provided that you also meet all of these conditions: 213 | 214 | a) The work must carry prominent notices stating that you modified 215 | it, and giving a relevant date. 216 | 217 | b) The work must carry prominent notices stating that it is 218 | released under this License and any conditions added under section 219 | 7. This requirement modifies the requirement in section 4 to 220 | "keep intact all notices". 221 | 222 | c) You must license the entire work, as a whole, under this 223 | License to anyone who comes into possession of a copy. This 224 | License will therefore apply, along with any applicable section 7 225 | additional terms, to the whole of the work, and all its parts, 226 | regardless of how they are packaged. This License gives no 227 | permission to license the work in any other way, but it does not 228 | invalidate such permission if you have separately received it. 229 | 230 | d) If the work has interactive user interfaces, each must display 231 | Appropriate Legal Notices; however, if the Program has interactive 232 | interfaces that do not display Appropriate Legal Notices, your 233 | work need not make them do so. 234 | 235 | A compilation of a covered work with other separate and independent 236 | works, which are not by their nature extensions of the covered work, 237 | and which are not combined with it such as to form a larger program, 238 | in or on a volume of a storage or distribution medium, is called an 239 | "aggregate" if the compilation and its resulting copyright are not 240 | used to limit the access or legal rights of the compilation's users 241 | beyond what the individual works permit. Inclusion of a covered work 242 | in an aggregate does not cause this License to apply to the other 243 | parts of the aggregate. 244 | 245 | 6. Conveying Non-Source Forms. 246 | 247 | You may convey a covered work in object code form under the terms 248 | of sections 4 and 5, provided that you also convey the 249 | machine-readable Corresponding Source under the terms of this License, 250 | in one of these ways: 251 | 252 | a) Convey the object code in, or embodied in, a physical product 253 | (including a physical distribution medium), accompanied by the 254 | Corresponding Source fixed on a durable physical medium 255 | customarily used for software interchange. 256 | 257 | b) Convey the object code in, or embodied in, a physical product 258 | (including a physical distribution medium), accompanied by a 259 | written offer, valid for at least three years and valid for as 260 | long as you offer spare parts or customer support for that product 261 | model, to give anyone who possesses the object code either (1) a 262 | copy of the Corresponding Source for all the software in the 263 | product that is covered by this License, on a durable physical 264 | medium customarily used for software interchange, for a price no 265 | more than your reasonable cost of physically performing this 266 | conveying of source, or (2) access to copy the 267 | Corresponding Source from a network server at no charge. 268 | 269 | c) Convey individual copies of the object code with a copy of the 270 | written offer to provide the Corresponding Source. This 271 | alternative is allowed only occasionally and noncommercially, and 272 | only if you received the object code with such an offer, in accord 273 | with subsection 6b. 274 | 275 | d) Convey the object code by offering access from a designated 276 | place (gratis or for a charge), and offer equivalent access to the 277 | Corresponding Source in the same way through the same place at no 278 | further charge. You need not require recipients to copy the 279 | Corresponding Source along with the object code. If the place to 280 | copy the object code is a network server, the Corresponding Source 281 | may be on a different server (operated by you or a third party) 282 | that supports equivalent copying facilities, provided you maintain 283 | clear directions next to the object code saying where to find the 284 | Corresponding Source. Regardless of what server hosts the 285 | Corresponding Source, you remain obligated to ensure that it is 286 | available for as long as needed to satisfy these requirements. 287 | 288 | e) Convey the object code using peer-to-peer transmission, provided 289 | you inform other peers where the object code and Corresponding 290 | Source of the work are being offered to the general public at no 291 | charge under subsection 6d. 292 | 293 | A separable portion of the object code, whose source code is excluded 294 | from the Corresponding Source as a System Library, need not be 295 | included in conveying the object code work. 296 | 297 | A "User Product" is either (1) a "consumer product", which means any 298 | tangible personal property which is normally used for personal, family, 299 | or household purposes, or (2) anything designed or sold for incorporation 300 | into a dwelling. In determining whether a product is a consumer product, 301 | doubtful cases shall be resolved in favor of coverage. For a particular 302 | product received by a particular user, "normally used" refers to a 303 | typical or common use of that class of product, regardless of the status 304 | of the particular user or of the way in which the particular user 305 | actually uses, or expects or is expected to use, the product. A product 306 | is a consumer product regardless of whether the product has substantial 307 | commercial, industrial or non-consumer uses, unless such uses represent 308 | the only significant mode of use of the product. 309 | 310 | "Installation Information" for a User Product means any methods, 311 | procedures, authorization keys, or other information required to install 312 | and execute modified versions of a covered work in that User Product from 313 | a modified version of its Corresponding Source. The information must 314 | suffice to ensure that the continued functioning of the modified object 315 | code is in no case prevented or interfered with solely because 316 | modification has been made. 317 | 318 | If you convey an object code work under this section in, or with, or 319 | specifically for use in, a User Product, and the conveying occurs as 320 | part of a transaction in which the right of possession and use of the 321 | User Product is transferred to the recipient in perpetuity or for a 322 | fixed term (regardless of how the transaction is characterized), the 323 | Corresponding Source conveyed under this section must be accompanied 324 | by the Installation Information. But this requirement does not apply 325 | if neither you nor any third party retains the ability to install 326 | modified object code on the User Product (for example, the work has 327 | been installed in ROM). 328 | 329 | The requirement to provide Installation Information does not include a 330 | requirement to continue to provide support service, warranty, or updates 331 | for a work that has been modified or installed by the recipient, or for 332 | the User Product in which it has been modified or installed. Access to a 333 | network may be denied when the modification itself materially and 334 | adversely affects the operation of the network or violates the rules and 335 | protocols for communication across the network. 336 | 337 | Corresponding Source conveyed, and Installation Information provided, 338 | in accord with this section must be in a format that is publicly 339 | documented (and with an implementation available to the public in 340 | source code form), and must require no special password or key for 341 | unpacking, reading or copying. 342 | 343 | 7. Additional Terms. 344 | 345 | "Additional permissions" are terms that supplement the terms of this 346 | License by making exceptions from one or more of its conditions. 347 | Additional permissions that are applicable to the entire Program shall 348 | be treated as though they were included in this License, to the extent 349 | that they are valid under applicable law. If additional permissions 350 | apply only to part of the Program, that part may be used separately 351 | under those permissions, but the entire Program remains governed by 352 | this License without regard to the additional permissions. 353 | 354 | When you convey a copy of a covered work, you may at your option 355 | remove any additional permissions from that copy, or from any part of 356 | it. (Additional permissions may be written to require their own 357 | removal in certain cases when you modify the work.) You may place 358 | additional permissions on material, added by you to a covered work, 359 | for which you have or can give appropriate copyright permission. 360 | 361 | Notwithstanding any other provision of this License, for material you 362 | add to a covered work, you may (if authorized by the copyright holders of 363 | that material) supplement the terms of this License with terms: 364 | 365 | a) Disclaiming warranty or limiting liability differently from the 366 | terms of sections 15 and 16 of this License; or 367 | 368 | b) Requiring preservation of specified reasonable legal notices or 369 | author attributions in that material or in the Appropriate Legal 370 | Notices displayed by works containing it; or 371 | 372 | c) Prohibiting misrepresentation of the origin of that material, or 373 | requiring that modified versions of such material be marked in 374 | reasonable ways as different from the original version; or 375 | 376 | d) Limiting the use for publicity purposes of names of licensors or 377 | authors of the material; or 378 | 379 | e) Declining to grant rights under trademark law for use of some 380 | trade names, trademarks, or service marks; or 381 | 382 | f) Requiring indemnification of licensors and authors of that 383 | material by anyone who conveys the material (or modified versions of 384 | it) with contractual assumptions of liability to the recipient, for 385 | any liability that these contractual assumptions directly impose on 386 | those licensors and authors. 387 | 388 | All other non-permissive additional terms are considered "further 389 | restrictions" within the meaning of section 10. If the Program as you 390 | received it, or any part of it, contains a notice stating that it is 391 | governed by this License along with a term that is a further 392 | restriction, you may remove that term. If a license document contains 393 | a further restriction but permits relicensing or conveying under this 394 | License, you may add to a covered work material governed by the terms 395 | of that license document, provided that the further restriction does 396 | not survive such relicensing or conveying. 397 | 398 | If you add terms to a covered work in accord with this section, you 399 | must place, in the relevant source files, a statement of the 400 | additional terms that apply to those files, or a notice indicating 401 | where to find the applicable terms. 402 | 403 | Additional terms, permissive or non-permissive, may be stated in the 404 | form of a separately written license, or stated as exceptions; 405 | the above requirements apply either way. 406 | 407 | 8. Termination. 408 | 409 | You may not propagate or modify a covered work except as expressly 410 | provided under this License. Any attempt otherwise to propagate or 411 | modify it is void, and will automatically terminate your rights under 412 | this License (including any patent licenses granted under the third 413 | paragraph of section 11). 414 | 415 | However, if you cease all violation of this License, then your 416 | license from a particular copyright holder is reinstated (a) 417 | provisionally, unless and until the copyright holder explicitly and 418 | finally terminates your license, and (b) permanently, if the copyright 419 | holder fails to notify you of the violation by some reasonable means 420 | prior to 60 days after the cessation. 421 | 422 | Moreover, your license from a particular copyright holder is 423 | reinstated permanently if the copyright holder notifies you of the 424 | violation by some reasonable means, this is the first time you have 425 | received notice of violation of this License (for any work) from that 426 | copyright holder, and you cure the violation prior to 30 days after 427 | your receipt of the notice. 428 | 429 | Termination of your rights under this section does not terminate the 430 | licenses of parties who have received copies or rights from you under 431 | this License. If your rights have been terminated and not permanently 432 | reinstated, you do not qualify to receive new licenses for the same 433 | material under section 10. 434 | 435 | 9. Acceptance Not Required for Having Copies. 436 | 437 | You are not required to accept this License in order to receive or 438 | run a copy of the Program. Ancillary propagation of a covered work 439 | occurring solely as a consequence of using peer-to-peer transmission 440 | to receive a copy likewise does not require acceptance. However, 441 | nothing other than this License grants you permission to propagate or 442 | modify any covered work. These actions infringe copyright if you do 443 | not accept this License. Therefore, by modifying or propagating a 444 | covered work, you indicate your acceptance of this License to do so. 445 | 446 | 10. Automatic Licensing of Downstream Recipients. 447 | 448 | Each time you convey a covered work, the recipient automatically 449 | receives a license from the original licensors, to run, modify and 450 | propagate that work, subject to this License. You are not responsible 451 | for enforcing compliance by third parties with this License. 452 | 453 | An "entity transaction" is a transaction transferring control of an 454 | organization, or substantially all assets of one, or subdividing an 455 | organization, or merging organizations. If propagation of a covered 456 | work results from an entity transaction, each party to that 457 | transaction who receives a copy of the work also receives whatever 458 | licenses to the work the party's predecessor in interest had or could 459 | give under the previous paragraph, plus a right to possession of the 460 | Corresponding Source of the work from the predecessor in interest, if 461 | the predecessor has it or can get it with reasonable efforts. 462 | 463 | You may not impose any further restrictions on the exercise of the 464 | rights granted or affirmed under this License. For example, you may 465 | not impose a license fee, royalty, or other charge for exercise of 466 | rights granted under this License, and you may not initiate litigation 467 | (including a cross-claim or counterclaim in a lawsuit) alleging that 468 | any patent claim is infringed by making, using, selling, offering for 469 | sale, or importing the Program or any portion of it. 470 | 471 | 11. Patents. 472 | 473 | A "contributor" is a copyright holder who authorizes use under this 474 | License of the Program or a work on which the Program is based. The 475 | work thus licensed is called the contributor's "contributor version". 476 | 477 | A contributor's "essential patent claims" are all patent claims 478 | owned or controlled by the contributor, whether already acquired or 479 | hereafter acquired, that would be infringed by some manner, permitted 480 | by this License, of making, using, or selling its contributor version, 481 | but do not include claims that would be infringed only as a 482 | consequence of further modification of the contributor version. For 483 | purposes of this definition, "control" includes the right to grant 484 | patent sublicenses in a manner consistent with the requirements of 485 | this License. 486 | 487 | Each contributor grants you a non-exclusive, worldwide, royalty-free 488 | patent license under the contributor's essential patent claims, to 489 | make, use, sell, offer for sale, import and otherwise run, modify and 490 | propagate the contents of its contributor version. 491 | 492 | In the following three paragraphs, a "patent license" is any express 493 | agreement or commitment, however denominated, not to enforce a patent 494 | (such as an express permission to practice a patent or covenant not to 495 | sue for patent infringement). To "grant" such a patent license to a 496 | party means to make such an agreement or commitment not to enforce a 497 | patent against the party. 498 | 499 | If you convey a covered work, knowingly relying on a patent license, 500 | and the Corresponding Source of the work is not available for anyone 501 | to copy, free of charge and under the terms of this License, through a 502 | publicly available network server or other readily accessible means, 503 | then you must either (1) cause the Corresponding Source to be so 504 | available, or (2) arrange to deprive yourself of the benefit of the 505 | patent license for this particular work, or (3) arrange, in a manner 506 | consistent with the requirements of this License, to extend the patent 507 | license to downstream recipients. "Knowingly relying" means you have 508 | actual knowledge that, but for the patent license, your conveying the 509 | covered work in a country, or your recipient's use of the covered work 510 | in a country, would infringe one or more identifiable patents in that 511 | country that you have reason to believe are valid. 512 | 513 | If, pursuant to or in connection with a single transaction or 514 | arrangement, you convey, or propagate by procuring conveyance of, a 515 | covered work, and grant a patent license to some of the parties 516 | receiving the covered work authorizing them to use, propagate, modify 517 | or convey a specific copy of the covered work, then the patent license 518 | you grant is automatically extended to all recipients of the covered 519 | work and works based on it. 520 | 521 | A patent license is "discriminatory" if it does not include within 522 | the scope of its coverage, prohibits the exercise of, or is 523 | conditioned on the non-exercise of one or more of the rights that are 524 | specifically granted under this License. You may not convey a covered 525 | work if you are a party to an arrangement with a third party that is 526 | in the business of distributing software, under which you make payment 527 | to the third party based on the extent of your activity of conveying 528 | the work, and under which the third party grants, to any of the 529 | parties who would receive the covered work from you, a discriminatory 530 | patent license (a) in connection with copies of the covered work 531 | conveyed by you (or copies made from those copies), or (b) primarily 532 | for and in connection with specific products or compilations that 533 | contain the covered work, unless you entered into that arrangement, 534 | or that patent license was granted, prior to 28 March 2007. 535 | 536 | Nothing in this License shall be construed as excluding or limiting 537 | any implied license or other defenses to infringement that may 538 | otherwise be available to you under applicable patent law. 539 | 540 | 12. No Surrender of Others' Freedom. 541 | 542 | If conditions are imposed on you (whether by court order, agreement or 543 | otherwise) that contradict the conditions of this License, they do not 544 | excuse you from the conditions of this License. If you cannot convey a 545 | covered work so as to satisfy simultaneously your obligations under this 546 | License and any other pertinent obligations, then as a consequence you may 547 | not convey it at all. For example, if you agree to terms that obligate you 548 | to collect a royalty for further conveying from those to whom you convey 549 | the Program, the only way you could satisfy both those terms and this 550 | License would be to refrain entirely from conveying the Program. 551 | 552 | 13. Use with the GNU Affero General Public License. 553 | 554 | Notwithstanding any other provision of this License, you have 555 | permission to link or combine any covered work with a work licensed 556 | under version 3 of the GNU Affero General Public License into a single 557 | combined work, and to convey the resulting work. The terms of this 558 | License will continue to apply to the part which is the covered work, 559 | but the special requirements of the GNU Affero General Public License, 560 | section 13, concerning interaction through a network will apply to the 561 | combination as such. 562 | 563 | 14. Revised Versions of this License. 564 | 565 | The Free Software Foundation may publish revised and/or new versions of 566 | the GNU General Public License from time to time. Such new versions will 567 | be similar in spirit to the present version, but may differ in detail to 568 | address new problems or concerns. 569 | 570 | Each version is given a distinguishing version number. If the 571 | Program specifies that a certain numbered version of the GNU General 572 | Public License "or any later version" applies to it, you have the 573 | option of following the terms and conditions either of that numbered 574 | version or of any later version published by the Free Software 575 | Foundation. If the Program does not specify a version number of the 576 | GNU General Public License, you may choose any version ever published 577 | by the Free Software Foundation. 578 | 579 | If the Program specifies that a proxy can decide which future 580 | versions of the GNU General Public License can be used, that proxy's 581 | public statement of acceptance of a version permanently authorizes you 582 | to choose that version for the Program. 583 | 584 | Later license versions may give you additional or different 585 | permissions. However, no additional obligations are imposed on any 586 | author or copyright holder as a result of your choosing to follow a 587 | later version. 588 | 589 | 15. Disclaimer of Warranty. 590 | 591 | THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY 592 | APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT 593 | HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY 594 | OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, 595 | THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR 596 | PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM 597 | IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF 598 | ALL NECESSARY SERVICING, REPAIR OR CORRECTION. 599 | 600 | 16. Limitation of Liability. 601 | 602 | IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING 603 | WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS 604 | THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY 605 | GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE 606 | USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF 607 | DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD 608 | PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS), 609 | EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF 610 | SUCH DAMAGES. 611 | 612 | 17. Interpretation of Sections 15 and 16. 613 | 614 | If the disclaimer of warranty and limitation of liability provided 615 | above cannot be given local legal effect according to their terms, 616 | reviewing courts shall apply local law that most closely approximates 617 | an absolute waiver of all civil liability in connection with the 618 | Program, unless a warranty or assumption of liability accompanies a 619 | copy of the Program in return for a fee. 620 | 621 | END OF TERMS AND CONDITIONS 622 | 623 | How to Apply These Terms to Your New Programs 624 | 625 | If you develop a new program, and you want it to be of the greatest 626 | possible use to the public, the best way to achieve this is to make it 627 | free software which everyone can redistribute and change under these terms. 628 | 629 | To do so, attach the following notices to the program. It is safest 630 | to attach them to the start of each source file to most effectively 631 | state the exclusion of warranty; and each file should have at least 632 | the "copyright" line and a pointer to where the full notice is found. 633 | 634 | {one line to give the program's name and a brief idea of what it does.} 635 | Copyright (C) {year} {name of author} 636 | 637 | This program is free software: you can redistribute it and/or modify 638 | it under the terms of the GNU General Public License as published by 639 | the Free Software Foundation, either version 3 of the License, or 640 | (at your option) any later version. 641 | 642 | This program is distributed in the hope that it will be useful, 643 | but WITHOUT ANY WARRANTY; without even the implied warranty of 644 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 645 | GNU General Public License for more details. 646 | 647 | You should have received a copy of the GNU General Public License 648 | along with this program. If not, see . 649 | 650 | Also add information on how to contact you by electronic and paper mail. 651 | 652 | If the program does terminal interaction, make it output a short 653 | notice like this when it starts in an interactive mode: 654 | 655 | {project} Copyright (C) {year} {fullname} 656 | This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'. 657 | This is free software, and you are welcome to redistribute it 658 | under certain conditions; type `show c' for details. 659 | 660 | The hypothetical commands `show w' and `show c' should show the appropriate 661 | parts of the General Public License. Of course, your program's commands 662 | might be different; for a GUI interface, you would use an "about box". 663 | 664 | You should also get your employer (if you work as a programmer) or school, 665 | if any, to sign a "copyright disclaimer" for the program, if necessary. 666 | For more information on this, and how to apply and follow the GNU GPL, see 667 | . 668 | 669 | The GNU General Public License does not permit incorporating your program 670 | into proprietary programs. If your program is a subroutine library, you 671 | may consider it more useful to permit linking proprietary applications with 672 | the library. If this is what you want to do, use the GNU Lesser General 673 | Public License instead of this License. But first, please read 674 | . 675 | 676 | --------------------------------------------------------------------------------