[ { "path": ".gitignore", "content": "*.jar\ntarget\nclojure.iws\nclojure.ipr\nnbproject/private/\nmaven-classpath\nmaven-classpath.properties\ncoclojure/*\n.settings/*\n.classpath\n.project\nxcode\n.idea/\n\nsettings.xml\n\nupload-github.sh\n" }, { "path": "CONTRIBUTING.md", "content": "If you'd like to submit a patch, please follow the [contributing guidelines](http://clojure.org/contributing).\n" }, { "path": "KNOWN_ISSUES", "content": "- Dividing by zero doesn't throw an exception in objc, it fails with EXC_ARITHMETIC\n- NullPointerException and ClassCastException are not reliable, as they are emulated by j2objc\n- Empty regular expressions throw an exception\n- pr-str a date have a bad Timezone format: https://code.google.com/p/j2objc/issues/detail?id=321" }, { "path": "antsetup.sh", "content": "#!/bin/bash\n\nmvn -q dependency:build-classpath -Dmdep.outputFile=maven-classpath\ncat <maven-classpath.properties \nmaven.compile.classpath=`cat maven-classpath`\nmaven.test.classpath=`cat maven-classpath`\nEOF\necho \"Wrote maven-classpath.properties for standalone ant use\"\n" }, { "path": "build.clj", "content": "(use '[clojure.java.shell :only [sh with-sh-dir]])\n(use '[clojure.java.io :only [delete-file file]])\n(require '[clojure.string :as st])\n(import '[java.io File])\n\n(def j2objc-home (System/getenv \"J2OBJC_HOME\"))\n(def iphone-os-sdk \"/Applications/Xcode.app/Contents/Developer/Platforms/iPhoneOS.platform/Developer/SDKs/iPhoneOS.sdk\")\n(def iphone-simulator-sdk \"/Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator.sdk\")\n(def frameworks \"-framework UIKit -framework Foundation\")\n(def opts \"-g -miphoneos-version-min=6.1 -fmessage-length=0 -fmacro-backtrace-limit=0 -std=gnu99 -fpascal-strings -O3 -DDEBUG=1 -Wno-unsequenced\")\n\n(let [a (agent nil)]\n (defn println+ [& other]\n (send a (fn [_] (apply println other)))))\n\n(defn walk [^File dir]\n (let [children (.listFiles dir)\n subdirs (filter #(.isDirectory %) children)\n files (filter #(.isFile %) children)]\n (concat files (mapcat walk subdirs))))\n\n(defn find-files [folder extension]\n (filter #(.endsWith (.getName %) (str \".\" extension)) (walk (file folder))))\n\n(defn sh+ [& args]\n (let [silent (= :silent (first args))\n _ (when-not silent\n (println+ \"Running: \" (reduce str (interpose \" \" args))))\n args (map #(clojure.string/split % #\" \") \n (if silent (next args) args))\n r (apply sh (flatten args))]\n (when-not (zero? (:exit r))\n (println+ \"FAILED\" (:err r)))))\n\n(defn makeoname [f]\n (str (st/replace f #\"/\" \".\") \".o\"))\n\n(defn clang [id params sdk target f]\n (println+ id (.getName f))\n (sh+ :silent \"clang\" \"-x\" \"objective-c\" params opts \"-isysroot\" sdk\n (str \"-I\" target \"/../src/ffi\")\n (str \"-I\" target \"/objc\")\n (str \"-I\" j2objc-home \"/include\")\n \"-c\" (.getCanonicalPath f) \"-o\" (makeoname (.getPath f))))\n\n(defn build [id params sdk]\n (let [target (File. \"target\")\n tcn (.getCanonicalPath target)]\n (with-sh-dir target\n (println+ \"Compiling\" id)\n (sh+ \"rm\" \"-Rf\" id)\n (sh+ \"mkdir\" id)\n (with-sh-dir (File. (str \"target/\" id))\n (doall (pmap (partial clang id params sdk tcn) \n (find-files \"target/objc\" \"m\")))\n (spit (str tcn \"/\" id \"/files.LinkFileList\") (reduce str (interpose \"\\n\" (find-files (str tcn \"/\" id) \"o\"))))\n (sh+ \"libtool\" \"-static\" \"-syslibroot\" sdk \"-filelist\" \n \"files.LinkFileList\" frameworks \"-o\" \"libclojure-objc.a\")))))\n\n(sh+ \"mvn\" \"compile\" \"test-compile\")\n(sh+ \"rm\" \"-Rf\" \"target/objc\")\n(sh+ \"mkdir\" \"target/objc\")\n(sh+ \"cp\" \"-R\" \"src/objc/.\" \"target/objc\")\n(sh+ \"cp\" \"-R\" \"src/ffi/.\" \"target/objc\")\n(sh+ \"zip\" \"-r\" \"target/objc.jar\" \"target/gen\" \"src/jvm\" \"test/java\")\n(sh+ (str j2objc-home \"/j2objc\") \"-d\" \"target/objc\" \"--final-methods-as-functions\" \"--batch-translate-max=500\" \"-J-Xmx2G\" \"-classpath\" \n \"target/classes:target/test-classes\" \n \"target/objc.jar\")\n\n(let [i (File. \"target/include\")]\n (when-not (.exists i)\n (.mkdirs i)))\n\n(with-sh-dir (File. \"target/objc\")\n (sh \"rsync\" \"-avm\" \"--delete\" \"--include\" \"*.h\" \"-f\" \n \"hide,! */\" \".\" \"../include\"))\n\n(build \"iphoneos\" \"-arch armv7 -arch armv7s -arch arm64\" iphone-os-sdk)\n(build \"iphonesimulator\" \"-arch i386 -arch x86_64\" iphone-simulator-sdk)\n\n(let [a (File. \"target/libclojure-objc.a\")]\n (when (.exists a)\n (.delete a))\n (sh+ \"lipo\" \"-create\" \"-output\" \"target/libclojure-objc.a\" \"target/iphoneos/libclojure-objc.a\" \"target/iphonesimulator/libclojure-objc.a\"))" }, { "path": "build.xml", "content": "\n\n\t\n Build with \"ant\" and then start the\n REPL with: \"java -cp clojure.jar clojure.main\".\n \n\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n \n \n \n \n\n \n \n\n \n \n \n \n version=${clojure.version.label}\n \n\n \n \n \n\n \n \n \n \n \n \n \n \n \n \n \n \t\n \t\n \t\n \t\n \t\n \t\n \t\n \t\n \t\n \t\n \t\n \t\n \n \n\n \n \n \n \n \n \n \n \n \n \t\n \t\n \n \n\n \n \n \n \n \n \n \n\t\n \n \n \n \n\n \n \n \n \n \n \n \n\t\n \n \n \n \n\n \n\n \n\n \n \n \n \n \n \n \n \n \n \n \n \n\n \n \n \n \n \n \n \n \n \n\t\n\t\n \n \n \n\n \n\n \n \n \n \n \n \n \n\n\n" }, { "path": "changes.md", "content": "\n\n# Changes to Clojure in Version 1.7\n\n## 1 Compatibility Notes\n\nPlease be aware of the following issues when upgrading to Clojure 1.7.\n\n### Seqs on Java iterators that return the same mutating object\n\nSeqs are fundamentally incompatible with Java iterators that return\nthe same mutating object on every call to next(). Some Clojure\nlibraries incorrectly rely on calling seq on such iterators.\n\nIn 1.7, iterator-seqs are chunked, which will cause many of these\nincorrect usages to return incorrect results immediately.\n\nThe `seq` and `iterator-seq` docstrings have been updated to include\nan explicit warning. Libraries that incorrectly use `seq` and\n`iterator-seq` will need to be fixed before running against 1.7.\n\n* [CLJ-1669](http://dev.clojure.org/jira/browse/CLJ-1669)\n* [CLJ-1738](http://dev.clojure.org/jira/browse/CLJ-1738)\n\n### Thread owner check removed on transients\n\nPrior to Clojure 1.7, transients would allow modification only from the\nthread that created the transient. This check has been removed. It is\nstill a requirement that transients should be updated by only a single\nthread at a time.\n\nThis constraint was relaxed to allow transients to be used in cases where\ncode is multiplexed across multiple threads in a pool (such as go blocks\nin core.async).\n\n### keys/vals require custom map type to implement Iterable\n\nInvoking `keys` or `vals` on a custom map type that implements IPersistentMap\nwill now use the Iterable iterator() method instead of accessing entries\nvia the seq of the map. There have been no changes in the type hierarchy\n(IPersistentMap has always extended Iterable) but former map-like instances\nmay have skipped implementing this method in the past.\n\n* [CLJ-1602](http://dev.clojure.org/jira/browse/CLJ-1602)\n\n## 2 New and Improved Features\n\n### 2.1 Transducers\n\nTransducers is a new way to decouple algorithmic transformations from their\napplication in different contexts. Transducers are functions that transform\nreducing functions to build up a \"recipe\" for transformation.\n\nAlso see: http://clojure.org/transducers\n\nMany existing sequence functions now have a new arity (one fewer argument\nthan before). This arity will return a transducer that represents the same\nlogic but is independent of lazy sequence processing. Functions included are:\n\n* map\n* mapcat\n* filter\n* remove\n* take\n* take-while\n* drop\n* drop-while\n* take-nth\n* replace\n* partition-by\n* partition-all\n* keep\n* keep-indexed\n* map-indexed\n* distinct\n* interpose\n\nAdditionally some new transducer functions have been added:\n\n* cat - concatenates the contents of each input\n* dedupe - removes consecutive duplicated values\n* random-sample - returns items from coll with random probability\n\nAnd this function can be used to make completing transforms:\n\n* completing\n\nThere are also several new or modified functions that can be used to apply\ntransducers in different ways:\n\n* sequence - takes a transformation and a coll and produces a lazy seq\n* transduce - reduce with a transformation (eager)\n* eduction - returns a reducible/iterable of applications of the transducer to items in coll. Applications are re-performed with every reduce/iterator.\n\nThere have been a number of internal changes to support transducers:\n\n* volatiles - there are a new set of functions (volatile!, vswap!, vreset!, volatile?) to create and use volatile \"boxes\" to hold state in stateful transducers. Volatiles are faster than atoms but give up atomicity guarantees so should only be used with thread isolation.\n* array iterators - added support for iterators over arrays\n* conj can be used as a reducing function and will conj to []\n\nSome related issues addressed during development:\n* [CLJ-1511](http://dev.clojure.org/jira/browse/CLJ-1511)\n* [CLJ-1497](http://dev.clojure.org/jira/browse/CLJ-1497)\n* [CLJ-1549](http://dev.clojure.org/jira/browse/CLJ-1549)\n* [CLJ-1537](http://dev.clojure.org/jira/browse/CLJ-1537)\n* [CLJ-1554](http://dev.clojure.org/jira/browse/CLJ-1554)\n* [CLJ-1601](http://dev.clojure.org/jira/browse/CLJ-1601)\n* [CLJ-1606](http://dev.clojure.org/jira/browse/CLJ-1606)\n* [CLJ-1621](http://dev.clojure.org/jira/browse/CLJ-1621)\n* [CLJ-1600](http://dev.clojure.org/jira/browse/CLJ-1600)\n* [CLJ-1635](http://dev.clojure.org/jira/browse/CLJ-1635)\n* [CLJ-1683](http://dev.clojure.org/jira/browse/CLJ-1683)\n* [CLJ-1669](http://dev.clojure.org/jira/browse/CLJ-1669)\n* [CLJ-1723](http://dev.clojure.org/jira/browse/CLJ-1723)\n\n### 2.2 Reader Conditionals\n\nReader Conditionals are a new capability to support portable code that\ncan run on multiple Clojure platforms with only small changes. In\nparticular, this feature aims to support the increasingly common case\nof libraries targeting both Clojure and ClojureScript.\n\nCode intended to be common across multiple platforms should use a new\nsupported file extension: \".cljc\". When requested to load a namespace,\nthe platform-specific file extension (.clj, .cljs) will be checked\nprior to .cljc.\n\nA new reader form can be used to specify \"reader conditional\" code in\ncljc files (and *only* cljc files). Each platform defines a feature\nidentifying the platform (:clj, :cljs, :cljr). The reader conditional\nspecifies code that is read conditionally based on the feature. The\nREPL also allows reader conditionals.\n\nForm #? takes a list of alternating feature and expression. These are\nchecked like cond and the selected expression is read and returned. Other\nbranches are read but skipped. If no branch is selected, the reader reads\nnothing (not nil, but literally as if reading no form). An optional\n`:default` branch can be used as a fallthrough.\n\nReader conditional with 2 features and a default:\n\n\t#?(:clj Double/NaN\n\t :cljs js/NaN\n\t :default nil)\n\nThere is also a reader conditional splicing form. The evaluated expression\nshould be sequential and will be spliced into the surrounded code, similar\nto unquote-splicing.\n\nFor example:\n\n [1 2 #?@(:clj [3 4] :cljs [5 6])]\n\nThis form would read as [1 2 3 4] on Clojure, [1 2 5 6] on ClojureScript,\nand [1 2] on any other platform. Splicing is not allowed at the top level.\n\nAdditionally, the reader can now be invoked with options for the features\nto use and how to interpret reader conditionals. By default, reader conditionals\nare not allowed, but that can be turned on, or a \"preserve\" mode can be used to\npreserve all branches (most likely useful for tooling or source transforms).\n\nIn the preserve mode, the reader conditional itself and any tagged literals\nwithin the unselected branches are returned as tagged literal data.\n\nFor more information, see:\nhttp://dev.clojure.org/display/design/Reader+Conditionals\n\n* [CLJ-1424](http://dev.clojure.org/jira/browse/CLJ-1424)\n* [CLJ-1685](http://dev.clojure.org/jira/browse/CLJ-1685)\n* [CLJ-1698](http://dev.clojure.org/jira/browse/CLJ-1698)\n* [CLJ-1699](http://dev.clojure.org/jira/browse/CLJ-1699)\n* [CLJ-1700](http://dev.clojure.org/jira/browse/CLJ-1700)\n* [CLJ-1728](http://dev.clojure.org/jira/browse/CLJ-1728)\n* [CLJ-1706](http://dev.clojure.org/jira/browse/CLJ-1706)\n\n### 2.3 Keyword and Symbol Construction\n\nIn response to issues raised in [CLJ-1439](http://dev.clojure.org/jira/browse/CLJ-1439),\nseveral changes have been made in symbol and keyword construction:\n\n1) The main bottleneck in construction of symbols (which also occurs inside keywords) was\ninterning of the name and namespace strings. This interning has been removed, resulting\nin a performance increase.\n\n2) Keywords are cached and keyword construction includes a cache check. A change was made\nto only clear the cache reference queue when there is a cache miss.\n\n### 2.4 Warn on Boxed Math\n\nOne source of performance issues is the (unintended) use of arithmetic operations on\nboxed numbers. To make detecting the presence of boxed math easier, a warning will now\nbe emitted about boxed math if \\*unchecked-math* is set to :warn-on-boxed (any truthy\nvalue will enable unchecked-math, only this specific value enables the warning).\n\nExample use:\n\n user> (defn plus-2 [x] (+ x 2)) ;; no warning, but boxed\n\t#'user/plus-2\n user> (set! *unchecked-math* :warn-on-boxed)\n\ttrue\n user> (defn plus-2 [x] (+ x 2)) ;; now we see a warning\n Boxed math warning, NO_SOURCE_PATH:10:18 - call: public static java.lang.Number\n\tclojure.lang.Numbers.unchecked_add(java.lang.Object,long).\n #'user/plus-2\n\tuser> (defn plus-2 [^long x] (+ x 2)) ;; use a hint to avoid boxing\n\t#'user/plus-2\n\n* [CLJ-1325](http://dev.clojure.org/jira/browse/CLJ-1325)\n* [CLJ-1535](http://dev.clojure.org/jira/browse/CLJ-1535)\n* [CLJ-1642](http://dev.clojure.org/jira/browse/CLJ-1642)\n\n### 2.5 update - like update-in for first level\n\n`update` is a new function that is like update-in specifically for first-level keys:\n\n (update m k f args...)\n\nExample use:\n\n user> (update {:a 1} :a inc)\n\t{:a 2}\n\tuser> (update {:a 1} :a + 2)\n\t{:a 3}\n\tuser> (update {} :a identity) ;; missing returns nil\n\t{:a nil}\n\n* [CLJ-1251](http://dev.clojure.org/jira/browse/CLJ-1251)\n\n### 2.6 Faster reduce and iterator paths\n\nSeveral important Clojure functions now return sequences that also\ncontain fast reduce() (or in some cases iterator()) paths. In many\ncases, the new implementations are also faster for lazy sequences\n\n* repeat - now implements IReduce\n* cycle - implements IReduceInit\n* iterate - implements IReduceInit\n* range - implements IReduce, specialized case handles common case of all longs\n* keys - iterates directly over the keys of a map, without seq or MapEntry allocation\n* vals - iterates directly over the vals of a map, without seq or MapEntry allocation\n* iterator-seq - creates a chunked sequence when previously it was unchunked\n\nAdditionally, hash-maps and hash-sets now provide iterators that walk\nthe data structure directly rather than via a sequence.\n\nA new interface (IMapIterable) for direct key and val iterators on maps\nwas added. External data structures can use this interface to provide\ndirect key and val iterators via keys and vals.\n\nThese enhancements are particularly effective when used\nin tandem with transducers via transduce, sequence, into, and\neduction.\n\n* [CLJ-1603](http://dev.clojure.org/jira/browse/CLJ-1603)\n* [CLJ-1515](http://dev.clojure.org/jira/browse/CLJ-1515)\n* [CLJ-1602](http://dev.clojure.org/jira/browse/CLJ-1602)\n* [CLJ-1669](http://dev.clojure.org/jira/browse/CLJ-1669)\n* [CLJ-1692](http://dev.clojure.org/jira/browse/CLJ-1692)\n* [CLJ-1694](http://dev.clojure.org/jira/browse/CLJ-1694)\n* [CLJ-1711](http://dev.clojure.org/jira/browse/CLJ-1711)\n* [CLJ-1709](http://dev.clojure.org/jira/browse/CLJ-1709)\n* [CLJ-1713](http://dev.clojure.org/jira/browse/CLJ-1713)\n* [CLJ-1726](http://dev.clojure.org/jira/browse/CLJ-1726)\n* [CLJ-1727](http://dev.clojure.org/jira/browse/CLJ-1727)\n\n### 2.7 Printing as data\n\nThere have been enhancements in how the REPL prints values without a\nprint-method, specifically Throwable and the fallthrough Object case.\nBoth cases now print in a tagged literal data form that can be read\nby the reader.\n\nUnhandled objects print with the class, hash code, and toString:\n\n\tuser=> *ns*\n\t#object[clojure.lang.Namespace 0x55aa628 \"user\"]\n\nThrown exceptions will still be printed in the normal way by the default\nREPL but printing them to a stream will show a different form:\n\n\tuser=> (/ 1 0)\n\tArithmeticException Divide by zero clojure.lang.Numbers.divide (Numbers.java:158)\n\tuser=> (println *e)\n\t#error {\n\t :cause Divide by zero\n\t :via\n\t [{:type java.lang.ArithmeticException\n\t :message Divide by zero\n\t :at [clojure.lang.Numbers divide Numbers.java 158]}]\n\t :trace\n\t [[clojure.lang.Numbers divide Numbers.java 158]\n\t [clojure.lang.Numbers divide Numbers.java 3808]\n\t ;; ... elided frames\n\t ]}\n\nAdditionally, there is a new function available to obtain a Throwable as \nmap data: `Throwable->map`.\n\n* [CLJ-1703](http://dev.clojure.org/jira/browse/CLJ-1703)\n* [CLJ-1716](http://dev.clojure.org/jira/browse/CLJ-1716)\n* [CLJ-1735](http://dev.clojure.org/jira/browse/CLJ-1735)\n\n### 2.8 run!\n\nrun! is a new function that takes a side effect reducing function and runs\nit for all items in a collection via reduce. The accumulator is ignored and\nnil is returned.\n\n (run! println (range 10))\n\n## 3 Enhancements\n\n### 3.1 Error messages\n\n* [CLJ-1261](http://dev.clojure.org/jira/browse/CLJ-1261)\n Invalid defrecord results in exception attributed to consuming ns instead of defrecord ns\n* [CLJ-1297](http://dev.clojure.org/jira/browse/CLJ-1297)\n Give more specific hint if namespace with \"-\" not found to check file uses \"_\"\n\n### 3.2 Documentation strings\n\n* [CLJ-1417](http://dev.clojure.org/jira/browse/CLJ-1417)\n clojure.java.io/input-stream has incorrect docstring\n* [CLJ-1357](http://dev.clojure.org/jira/browse/CLJ-1357)\n Fix typo in gen-class doc-string\n* [CLJ-1479](http://dev.clojure.org/jira/browse/CLJ-1479)\n Fix typo in filterv example\n* [CLJ-1480](http://dev.clojure.org/jira/browse/CLJ-1480)\n Fix typo in defmulti docstring\n* [CLJ-1477](http://dev.clojure.org/jira/browse/CLJ-1477)\n Fix typo in deftype docstring\n* [CLJ-1478](http://dev.clojure.org/jira/browse/CLJ-1378)\n Fix typo in clojure.main usage\n* [CLJ-1738](http://dev.clojure.org/jira/browse/CLJ-1738)\n Clarify usage on Java iterators in seq and iterator-seq\n\n### 3.3 Performance\n\n* [CLJ-1430](http://dev.clojure.org/jira/browse/CLJ-1430)\n Improve performance of partial with more unrolling\n* [CLJ-1384](http://dev.clojure.org/jira/browse/CLJ-1384)\n clojure.core/set should use transients for better performance\n* [CLJ-1429](http://dev.clojure.org/jira/browse/CLJ-1429)\n Cache unknown multimethod value default dispatch\n* [CLJ-1529](http://dev.clojure.org/jira/browse/CLJ-1529)\n Reduce compile times by avoiding unnecessary calls to Class.forName()\n* [CLJ-1546](http://dev.clojure.org/jira/browse/CLJ-1546)\n vec is now faster on almost all inputs\n* [CLJ-1618](http://dev.clojure.org/jira/browse/CLJ-1618)\n set is now faster on almost all inputs\n* [CLJ-1695](http://dev.clojure.org/jira/browse/CLJ-1695)\n Fixed reflection call in variadic vector-of constructor\n\n### 3.4 Other enhancements\n\n* [CLJ-1191](http://dev.clojure.org/jira/browse/CLJ-1191)\n Improve apropos to show some indication of namespace of symbols found\n* [CLJ-1378](http://dev.clojure.org/jira/browse/CLJ-1378)\n Hints don't work with #() form of function\n* [CLJ-1498](http://dev.clojure.org/jira/browse/CLJ-1498)\n Removes owner-thread check from transients - this check was preventing some valid usage of transients in core.async where a transient is created on one thread and then used again in another pooled thread (while still maintaining thread isolation).\n* [CLJ-803](http://dev.clojure.org/jira/browse/CLJ-803)\n Extracted IAtom interface implemented by Atom.\n* [CLJ-1315](http://dev.clojure.org/jira/browse/CLJ-1315)\n Don't initialize classes when importing them\n* [CLJ-1330](http://dev.clojure.org/jira/browse/CLJ-1330)\n Class name clash between top-level functions and defn'ed ones\n* [CLJ-1349](http://dev.clojure.org/jira/browse/CLJ-1349)\n Update to latest test.generative and add dependency on test.check\n* [CLJ-1546](http://dev.clojure.org/jira/browse/CLJ-1546)\n vec now works with things that only implement Iterable or IReduceInit\n* [CLJ-1618](http://dev.clojure.org/jira/browse/CLJ-1618)\n set now works with things that only implement Iterable or IReduceInit\n* [CLJ-1633](http://dev.clojure.org/jira/browse/CLJ-1633)\n PersistentList/creator doesn't handle ArraySeqs correctly\n* [CLJ-1589](http://dev.clojure.org/jira/browse/CLJ-1589)\n Clean up unused paths in InternalReduce\n* [CLJ-1677](http://dev.clojure.org/jira/browse/CLJ-1677)\n Add setLineNumber() to LineNumberingPushbackReader\n* [CLJ-1667](http://dev.clojure.org/jira/browse/CLJ-1667)\n Change test to avoid using hard-coded socket port\n* [CLJ-1683](http://dev.clojure.org/jira/browse/CLJ-1683)\n Change reduce tests to better catch reduce without init bugs\n\n## 4 Bug Fixes\n\n* [CLJ-1362](http://dev.clojure.org/jira/browse/CLJ-1362)\n Reduce broken on some primitive vectors\n* [CLJ-1388](http://dev.clojure.org/jira/browse/CLJ-1388)\n Equality bug on records created with nested calls to map->record\n* [CLJ-1274](http://dev.clojure.org/jira/browse/CLJ-1274)\n Unable to set compiler options via system properties except for AOT compilation\n* [CLJ-1241](http://dev.clojure.org/jira/browse/CLJ-1241)\n NPE when AOTing overrided clojure.core functions\n* [CLJ-1185](http://dev.clojure.org/jira/browse/CLJ-1185)\n reductions does not check for reduced value\n* [CLJ-1039](http://dev.clojure.org/jira/browse/CLJ-1039)\n Using def with metadata {:type :anything} throws ClassCastException during printing\n* [CLJ-887](http://dev.clojure.org/jira/browse/CLJ-887)\n Error when calling primitive functions with destructuring in the arg vector\n* [CLJ-823](http://dev.clojure.org/jira/browse/CLJ-823)\n Piping seque into seque can deadlock\n* [CLJ-738](http://dev.clojure.org/jira/browse/CLJ-738)\n <= is incorrect when args include Double/NaN\n* [CLJ-1408](http://dev.clojure.org/jira/browse/CLJ-1408)\n Make cached string value of Keyword and Symbol transient\n* [CLJ-1466](http://dev.clojure.org/jira/browse/CLJ-1466)\n clojure.core/bean should implement Iterable\n* [CLJ-1578](http://dev.clojure.org/jira/browse/CLJ-1578)\n Make refer of Clojure core function not throw exception on reload\n* [CLJ-1501](http://dev.clojure.org/jira/browse/CLJ-1501)\n LazySeq equals() should not use equiv() logic\n* [CLJ-1572](http://dev.clojure.org/jira/browse/CLJ-1572)\n into (and other fns that rely on reduce) require only IReduceInit\n* [CLJ-1619](http://dev.clojure.org/jira/browse/CLJ-1619)\n PersistentVector now directly implements reduce without init\n* [CLJ-1580](http://dev.clojure.org/jira/browse/CLJ-1580)\n Transient collections should guarantee thread visibility\n* [CLJ-1590](http://dev.clojure.org/jira/browse/CLJ-1590)\n Some IReduce/IReduceInit implementors don't respect reduced\n* [CLJ-979](http://dev.clojure.org/jira/browse/CLJ-979)\n Clojure resolves to wrong deftype classes when AOT compiling or reloading\n* [CLJ-1636](http://dev.clojure.org/jira/browse/CLJ-1636)\n Fix intermittent SeqIterator problem by removing use of this as a sentinel\n* [CLJ-1637](http://dev.clojure.org/jira/browse/CLJ-1636)\n Fix regression from CLJ-1546 that broke vec on MapEntry\n* [CLJ-1663](http://dev.clojure.org/jira/browse/CLJ-1663)\n Fix regression from CLJ-979 for DynamicClassLoader classloader delegation\n* [CLJ-1604](http://dev.clojure.org/jira/browse/CLJ-1604)\n Fix error from AOT'ed code defining a var with a clojure.core symbol name\n* [CLJ-1561](http://dev.clojure.org/jira/browse/CLJ-1561)\n Fix incorrect line number reporting for error locations\n* [CLJ-1568](http://dev.clojure.org/jira/browse/CLJ-1568)\n Fix incorrect line number reporting for error locations\n* [CLJ-1638](http://dev.clojure.org/jira/browse/CLJ-1638)\n Fix regression from CLJ-1546 removed PersistentVector.create(List) method\n* [CLJ-1681](http://dev.clojure.org/jira/browse/CLJ-1681)\n Fix regression from CLJ-1248 (1.6) in reflection warning with literal nil argument\n* [CLJ-1648](http://dev.clojure.org/jira/browse/CLJ-1648)\n Use equals() instead of == when resolving Symbol\n* [CLJ-1195](http://dev.clojure.org/jira/browse/CLJ-1195)\n emit-hinted-impl expands to ns-qualified invocation of fn\n* [CLJ-1237](http://dev.clojure.org/jira/browse/CLJ-1237)\n reduce of sequence that switches between chunked and unchunked many times throws StackOverflow\n\n# Changes to Clojure in Version 1.6\n\n## CONTENTS\n\n## 1 Compatibility and Dependencies\n\n## 1.1 JDK Version Update\n\nClojure now builds with Java SE 1.6 and emits bytecode requiring Java\nSE 1.6 instead of Java SE 1.5. [CLJ-1268]\n\n## 1.2 ASM Library Update\n\nThe embedded version of the ASM bytecode library has been upgraded to\nASM 4.1. [CLJ-713]\n\n## 1.3 Promoted \"Alpha\" Features\n\nThe following features are no longer marked Alpha in Clojure:\n\n* Watches - add-watch, remove-watch\n* Transients - transient, persistent!, conj!, assoc!, dissoc!, pop!, disj!\n* Exception data - ex-info, ex-data\n* Promises - promise, deliver\n* Records - defrecord\n* Types - deftype\n* Pretty-print tables - print-table\n\n## 2 New and Improved Features\n\n### 2.1 Java API\n\nThe clojure.java.api package provides a minimal interface to bootstrap\nClojure access from other JVM languages. It does this by providing:\n1. The ability to use Clojure's namespaces to locate an arbitrary var,\n returning the var's clojure.lang.IFn interface.\n2. A convenience method read for reading data using Clojure's edn\n reader.\n\nIFns provide complete access to Clojure's APIs. You can also access\nany other library written in Clojure, after adding either its source\nor compiled form to the classpath.\n\nThe public Java API for Clojure consists of the following classes and interfaces:\n\n* clojure.java.api.Clojure\n* clojure.lang.IFn\n\nAll other Java classes should be treated as implementation details,\nand applications should avoid relying on them.\n\nTo look up and call a Clojure function:\n\n IFn plus = Clojure.var(\"clojure.core\", \"+\");\n plus.invoke(1, 2);\n\nFunctions in clojure.core are automatically loaded. Other namespaces\ncan be loaded via require:\n\n IFn require = Clojure.var(\"clojure.core\", \"require\");\n require.invoke(Clojure.read(\"clojure.set\"));\n \nIFns can be passed to higher order functions, e.g. the example below\npasses plus to read:\n\n IFn map = Clojure.var(\"clojure.core\", \"map\");\n IFn inc = Clojure.var(\"clojure.core\", \"inc\");\n map.invoke(inc, Clojure.read(\"[1 2 3]\"));\n\nMost IFns in Clojure refer to functions. A few, however, refer to\nnon-function data values. To access these, use deref instead of fn:\n\n IFn printLength = Clojure.var(\"clojure.core\", \"*print-length*\");\n Clojure.var(\"clojure.core\", \"deref\").invoke(printLength);\n\n### 2.2 Map destructuring extended to support namespaced keys\n\n* [CLJ-1318](http://dev.clojure.org/jira/browse/CLJ-1318)\n\nIn the past, map destructuring with :keys and :syms would not work\nwith maps containing namespaced keys or symbols. The :keys and :syms\nforms have been updated to allow them to match namespaced keys and\nbind to a local variable based on the name.\n\nExamples:\n\n (let [m {:x/a 1, :y/b 2}\n {:keys [x/a y/b]} m]\n (+ a b))\n\n (let [m {'x/a 1, 'y/b 2}\n {:syms [x/a y/b]} m]\n (+ a b))\n\nAdditionally, the :keys form can now take keywords instead of symbols.\nThis provides support specifically for auto-resolved keywords:\n\n (let [m {:x/a 1, :y/b 2}\n {:keys [:x/a :y/b]} m]\n (+ a b))\n\n (let [m {::x 1}\n {:keys [::x]} m]\n x)\n\n### 2.3 New \"some\" operations\n\nMany conditional functions rely on logical truth (where \"falsey\"\nvalues are nil or false). Sometimes it is useful to have functions\nthat rely on \"not nilness\" instead. These functions have been added to\nsupport these cases [CLJ-1343]:\n\n* some? - same as (not (nil? x))\n* if-some - like if-let, but checks (some? test) instead of test\n* when-some - like when-let, but checks (some? test) instead of test\n\n### 2.4 Hashing\n\nClojure 1.6 provides new hashing algorithms for primitives and\ncollections, accessible via IHashEq/hasheq (in Java) or the\nclojure.core/hash function (in Clojure). In general, these changes\nshould be transparent to users, except hash codes used inside hashed\ncollections like maps and sets will have better properties.\n\nHash codes returned by the Java .hashCode() method are unchanged and\ncontinue to match Java behavior or conform to the Java specification\nas appropriate.\n\nAny collections implementing IHashEq or wishing to interoperate with\nClojure collections should conform to the hashing algorithms specified\nin http://clojure.org/data_structures#hash and use the new function\n`mix-collection-hash` for the final mixing operation. Alternatively,\nyou may call the helper functions `hash-ordered-coll` and\n`hash-unordered-coll`.\n\nAny details of the current hashing algorithm not specified on that\npage should be considered subject to future change.\n\nRelated tickets for dev and regressions:\n\n* [CLJ-1328](http://dev.clojure.org/jira/browse/CLJ-1328)\n Make several Clojure tests independent of ordering\n* [CLJ-1331](http://dev.clojure.org/jira/browse/CLJ-1331)\n Update primitive vectors to use Murmur3 hash\n* [CLJ-1335](http://dev.clojure.org/jira/browse/CLJ-1335)\n Update hash for empty PersistentList and LazySeq\n* [CLJ-1336](http://dev.clojure.org/jira/browse/CLJ-1336)\n Make hashing mixing functions available in Clojure\n* [CLJ-1338](http://dev.clojure.org/jira/browse/CLJ-1338)\n Make Murmur3 class public\n* [CLJ-1344](http://dev.clojure.org/jira/browse/CLJ-1344)\n Update mapHasheq to call Murmur3 algorithm\n* [CLJ-1348](http://dev.clojure.org/jira/browse/CLJ-1348)\n Add hash-ordered-coll and hash-unordered-coll\n* [CLJ-1355](http://dev.clojure.org/jira/browse/CLJ-1355)\n Restore cached hashCode for Symbol and (uncached) hashCode for Keyword\n* [CLJ-1365](http://dev.clojure.org/jira/browse/CLJ-1365)\n Add type hints for new collection hash functions\n\n### 2.5 bitops\n\n* [CLJ-827](http://dev.clojure.org/jira/browse/CLJ-827) - unsigned-bit-shift-right\n\nA new unsigned-bit-shift-right (Java's >>>) has been added to the core\nlibrary. The shift distance is truncated to the least 6 bits (per the\nJava specification for long >>>).\n\nExamples:\n (unsigned-bit-shift-right 2r100 1) ;; 2r010\n (unsigned-bit-shift-right 2r100 2) ;; 2r001\n (unsigned-bit-shift-right 2r100 3) ;; 2r000\n\n### 2.6 clojure.test\n\n* [CLJ-866](http://dev.clojure.org/jira/browse/CLJ-866) - test-vars\n* [CLJ-1352](http://dev.clojure.org/jira/browse/CLJ-1352) - fix\n regression in CLJ-866\n\nAdded a new clojure.test/test-vars function that takes a list of vars, groups them by namespace, and\nruns them *with their fixtures*.\n\n## 3 Enhancements\n\n### 3.1 Printing\n\n* [CLJ-908](http://dev.clojure.org/jira/browse/CLJ-908)\n Print metadata for functions when *print-meta* is true and remove errant space at beginning.\n* [CLJ-937](http://dev.clojure.org/jira/browse/CLJ-937)\n pprint cl-format now supports E, F, and G formats for ratios.\n\n### 3.2 Error messages\n\n* [CLJ-1248](http://dev.clojure.org/jira/browse/CLJ-1248)\n Include type information in reflection warning messages\n* [CLJ-1099](http://dev.clojure.org/jira/browse/CLJ-1099)\n If non-seq passed where seq is needed, error message now is an\n ExceptionInfo with the instance value, retrievable via ex-data.\n* [CLJ-1083](http://dev.clojure.org/jira/browse/CLJ-1083)\n Fix error message reporting for \"munged\" function names (like a->b).\n* [CLJ-1056](http://dev.clojure.org/jira/browse/CLJ-1056)\n Handle more cases and improve error message for errors in defprotocol definitions.\n* [CLJ-1102](http://dev.clojure.org/jira/browse/CLJ-1102)\n Better handling of exceptions with empty stack traces.\n* [CLJ-939](http://dev.clojure.org/jira/browse/CLJ-939)\n Exceptions thrown in the top level ns form are reported without file or line number.\n\n### 3.3 Documentation strings\n\n* [CLJ-1164](http://dev.clojure.org/jira/browse/CLJ-1164)\n Fix typos in clojure.instant/validated and other internal instant functions.\n* [CLJ-1143](http://dev.clojure.org/jira/browse/CLJ-1143)\n Correct doc string for ns macro.\n* [CLJ-196](http://dev.clojure.org/jira/browse/CLJ-196)\n Clarify value of *file* is undefined in the REPL.\n* [CLJ-1228](http://dev.clojure.org/jira/browse/CLJ-1228)\n Fix a number of spelling errors in namespace and doc strings.\n* [CLJ-835](http://dev.clojure.org/jira/browse/CLJ-835)\n Update defmulti doc to clarify expectations for hierarchy argument.\n* [CLJ-1304](http://dev.clojure.org/jira/browse/CLJ-1304)\n Fix minor typos in documentation and comments\n* [CLJ-1302](http://dev.clojure.org/jira/browse/CLJ-1302)\n Mention that keys and vals order are consistent with seq order\n\n### 3.4 Performance\n\n* [CLJ-858](http://dev.clojure.org/jira/browse/CLJ-858)\n Improve speed of STM by removing System.currentTimeMillis.\n* [CLJ-669](http://dev.clojure.org/jira/browse/CLJ-669)\n clojure.java.io/do-copy: use java.nio for Files\n* [commit](https://github.com/clojure/clojure/commit/0b73494c3c855e54b1da591eeb687f24f608f346)\n Reduce overhead of protocol callsites by removing unneeded generated\n cache fields.\n\n### 3.5 Other enhancements\n\n* [CLJ-908](http://dev.clojure.org/jira/browse/CLJ-908)\n Make *default-data-reader-fn* set!-able in REPL, similar to *data-readers*.\n* [CLJ-783](http://dev.clojure.org/jira/browse/CLJ-783)\n Make clojure.inspector/inspect-tree work on sets.\n* [CLJ-896](http://dev.clojure.org/jira/browse/CLJ-896)\n Make browse-url aware of xdg-open.\n* [CLJ-1160](http://dev.clojure.org/jira/browse/CLJ-1160)\n Fix clojure.core.reducers/mapcat does not stop on reduced? values.\n* [CLJ-1121](http://dev.clojure.org/jira/browse/CLJ-1121)\n -> and ->> have been rewritten to work with a broader set of macros.\n* [CLJ-1105](http://dev.clojure.org/jira/browse/CLJ-1105)\n clojure.walk now supports records.\n* [CLJ-949](http://dev.clojure.org/jira/browse/CLJ-949)\n Removed all unnecessary cases of sneakyThrow.\n* [CLJ-1238](http://dev.clojure.org/jira/browse/CLJ-1238)\n Allow EdnReader to read foo// (matches LispReader behavior).\n* [CLJ-1264](http://dev.clojure.org/jira/browse/CLJ-1264)\n Remove uses of _ as a var in the Java code (causes warning in Java 8).\n* [CLJ-394](http://dev.clojure.org/jira/browse/CLJ-394)\n Add record? predicate.\n* [CLJ-1200](http://dev.clojure.org/jira/browse/CLJ-1200)\n ArraySeq dead code cleanup, ArraySeq_short support added.\n* [CLJ-1331](http://dev.clojure.org/jira/browse/CLJ-1331)\n Primitive vectors should implement hasheq and use new hash algorithm\n* [CLJ-1354](http://dev.clojure.org/jira/browse/CLJ-1354)\n Make APersistentVector.SubVector public so other collections can access\n* [CLJ-1353](http://dev.clojure.org/jira/browse/CLJ-1353)\n Make awt run headless during the build process\n\n## 4 Bug Fixes\n\n* [CLJ-1018](http://dev.clojure.org/jira/browse/CLJ-1018)\n Make range consistently return infinite sequence of start with a step of 0.\n* [CLJ-863](http://dev.clojure.org/jira/browse/CLJ-863)\n Make interleave return () on 0 args and identity on 1 args.\n* [CLJ-1072](http://dev.clojure.org/jira/browse/CLJ-1072)\n Update internal usages of the old metadata reader syntax to new syntax.\n* [CLJ-1193](http://dev.clojure.org/jira/browse/CLJ-1193)\n Make bigint and biginteger functions work on double values outside long range.\n* [CLJ-1154](http://dev.clojure.org/jira/browse/CLJ-1154)\n Make Compile.java flush but not close stdout so errors can be reported.\n* [CLJ-1161](http://dev.clojure.org/jira/browse/CLJ-1161)\n Remove bad version.properties from sources jar.\n* [CLJ-1175](http://dev.clojure.org/jira/browse/CLJ-1175)\n Fix invalid behavior of Delay/deref if an exception is thrown - exception will\n now be rethrown on subsequent calls and not enter a corrupted state.\n* [CLJ-1171](http://dev.clojure.org/jira/browse/CLJ-1171)\n Fix several issues with instance? to make it consistent when used with apply.\n* [CLJ-1202](http://dev.clojure.org/jira/browse/CLJ-1202)\n Protocol fns with dashes may get incorrectly compiled into field accesses.\n* [CLJ-850](http://dev.clojure.org/jira/browse/CLJ-850)\n Add check to emit invokePrim with return type of double or long if type-hinted.\n* [CLJ-1177](http://dev.clojure.org/jira/browse/CLJ-1177)\n clojure.java.io URL to File coercion corrupts path containing UTF-8 characters.\n* [CLJ-1234](http://dev.clojure.org/jira/browse/CLJ-1234)\n Accept whitespace in Record and Type reader forms (similar to data literals).\n* [CLJ-1233](http://dev.clojure.org/jira/browse/CLJ-1233)\n Allow ** as a valid symbol name without triggering dynamic warnings.\n* [CLJ-1246](http://dev.clojure.org/jira/browse/CLJ-1246)\n Add support to clojure.reflect for classes with annotations.\n * [CLJ-1184](http://dev.clojure.org/jira/browse/CLJ-1184)\n Evaling #{do ...} or [do ...] is treated as do special form.\n* [CLJ-1090](http://dev.clojure.org/jira/browse/CLJ-1090)\n Indirect function calls through Var instances fail to clear locals.\n* [CLJ-1076](http://dev.clojure.org/jira/browse/CLJ-1076)\n pprint tests fail on Windows, expecting \\n.\n* [CLJ-766](http://dev.clojure.org/jira/browse/CLJ-766)\n Make into-array work consistently with short-array and byte-array on\n bigger types.\n* [CLJ-1285](http://dev.clojure.org/jira/browse/CLJ-1285)\n Data structure invariants are violated after persistent operations when\n collision node created by transients.\n* [CLJ-1222](http://dev.clojure.org/jira/browse/CLJ-1222)\n Multiplication overflow issues around Long/MIN_VALUE\n* [CLJ-1118](http://dev.clojure.org/jira/browse/CLJ-1118)\n Inconsistent numeric comparison semantics between BigDecimals and other numerics\n* [CLJ-1125](http://dev.clojure.org/jira/browse/CLJ-1125)\n Clojure can leak memory in a servlet container when using dynamic\n bindings or STM transactions.\n* [CLJ-1082](http://dev.clojure.org/jira/browse/CLJ-1082)\n Subvecs of primitve vectors cannot be reduced\n* [CLJ-1301](http://dev.clojure.org/jira/browse/CLJ-1301)\n Case expressions use a mixture of hashCode and hasheq, potentially\n leading to missed case matches when these differ.\n* [CLJ-983](http://dev.clojure.org/jira/browse/CLJ-983)\n proxy-super does not restore original binding if call throws exception\n* [CLJ-1176](http://dev.clojure.org/jira/browse/CLJ-1176)\n clojure.repl/source errors when *read-eval* bound to :unknown\n* [CLJ-935](http://dev.clojure.org/jira/browse/CLJ-935)\n clojure.string/trim uses different definition of whitespace than\n triml and trimr\n* [CLJ-1058](http://dev.clojure.org/jira/browse/CLJ-1058)\n StackOverflowError on exception in reducef for PersistentHashMap\n fold\n* [CLJ-1328](http://dev.clojure.org/jira/browse/CLJ-1328)\n Fix some tests in the Clojure test suite to make their names unique\n and independent of hashing order\n* [CLJ-1339](http://dev.clojure.org/jira/browse/CLJ-1339)\n Empty primitive vectors throw NPE on .equals with non-vector\n sequential types\n* [CLJ-1363](http://dev.clojure.org/jira/browse/CLJ-1363)\n Field access via .- in reflective case does not work\n* [CLJ-944](http://dev.clojure.org/jira/browse/CLJ-944)\n Compiler gives constant collections types which mismatch their\n runtime values\n* [CLJ-1387](http://dev.clojure.org/jira/browse/CLJ-1387)\n reduce-kv on large hash maps ignores reduced result\n\n# Changes to Clojure in Version 1.5.1\n\n* fix for leak caused by ddc65a96fdb1163b\n\n# Changes to Clojure in Version 1.5\n\n## CONTENTS\n\n
\n 1 Deprecated and Removed Features\n    1.1 Clojure 1.5 reducers library requires Java 6 or later\n 2 New and Improved Features\n    2.1 Reducers\n    2.2 Reader Literals improved\n    2.3 clojure.core/set-agent-send-executor!, set-agent-send-off-executor!, and send-via\n    2.4 New threading macros\n    2.5 Column metadata captured by reader\n    2.6 gen-class improvements\n    2.7 Support added for marker protocols\n    2.8 clojure.pprint/print-table output compatible with Emacs Org mode\n    2.9 clojure.string/replace and replace-first handle special characters more predictably\n    2.10 Set and map constructor functions allow duplicates\n    2.11 More functions preserve metadata\n    2.12 New edn reader, improvements to *read-eval*\n 3 Performance Enhancements\n 4 Improved error messages\n 5 Improved documentation strings\n 6 Bug Fixes\n 7 Binary Compatibility Notes\n
\n\n## 1 Deprecated and Removed Features\n\n### 1.1 Clojure 1.5 reducers library requires Java 6 or later\n\nThe new reducers library (see below) requires Java 6 plus a ForkJoin\nlibrary, or Java 7 or later. Clojure 1.5 can still be compiled and\nrun with Java 5. The only limitations with Java 5 are that the new\nreducers library will not work, and building Clojure requires skipping\nthe test suite (e.g. by using the command \"ant jar\").\n\n\n## 2 New and Improved Features\n\n### 2.1 Reducers\n\nReducers provide a set of high performance functions for working with collections. The actual fold/reduce algorithms are specified via the collection being reduced. This allows each collection to define the most efficient way to reduce its contents.\n\nThe implementation details of reducers are available at the [Clojure blog](http://clojure.com/blog/2012/05/08/reducers-a-library-and-model-for-collection-processing.html) and therefore won't be repeated in these change notes. However, as a summary:\n\n* There is a new namespace: clojure.core.reducers\n* It contains new versions of map, filter etc based upon transforming reducing functions - reducers\n* It contains a new function, fold, which is a parallel reduce+combine\nfold uses fork/join when working with (the existing!) Clojure vectors and maps\n* Your new parallel code has exactly the same shape as your existing seq-based code\n* The reducers are composable\n* Reducer implementations are primarily functional - no iterators\n* The model uses regular data structures, not 'parallel collections' or other OO malarkey\n* It's fast, and can become faster still\n* This is work-in-progress\n\nExamples:\n\n\tuser=> (require '[clojure.core.reducers :as r])\n\tuser=> (reduce + (r/filter even? (r/map inc [1 1 1 2])))\n\t;=> 6\n\n\n\t;;red is a reducer awaiting a collection\n\tuser=> (def red (comp (r/filter even?) (r/map inc)))\n\tuser=> (reduce + (red [1 1 1 2]))\n\t;=> 6\n\n\tuser=> (into #{} (r/filter even? (r/map inc [1 1 1 2])))\n\t;=> #{2}\n\n### 2.2 Reader Literals improved\n\n* [CLJ-1034](http://dev.clojure.org/jira/browse/CLJ-1034)\n \"Conflicting data-reader mapping\" should no longer be thrown where there really isn't a conflict. Until this patch, having data_readers.clj on the classpath twice would cause the above exception.\n\n* [CLJ-927](http://dev.clojure.org/jira/browse/CLJ-927)\n Added `*default-data-reader-fn*` to clojure.core. When no data reader is found for a tag and `*default-data-reader-fn*`is non-nil, it will be called with two arguments, the tag and the value. If `*default-data-reader-fn*` is nil (the default), an exception will be thrown for the unknown tag.\n\n### 2.3 clojure.core/set-agent-send-executor!, set-agent-send-off-executor!, and send-via\n\nAdded two new functions:\n\n* clojure.core/set-agent-send-executor!\n\n Allows the user to set the `java.util.concurrent.Executor` used when calling `clojure.core/send`. Defaults to a fixed thread pool of size: (numCores + 2)\n\n* clojure.core/set-agent-send-off-executor!\n\n \tAllows the user to set the `java.util.concurrent.Executor` used when calling `clojure.core/send-off`. Defaults to a cached thread pool.\n\n* clojure.core/send-via\n\n\tLike `send`, and `send-off`, except the first argument to this function is an executor to use when sending.\n\n\n\n\n### 2.4 New threading macros\n\n* clojure.core/cond-> [expr & clauses]\n\n\tTakes an expression and a set of test/form pairs. Threads the expression (via ->) through each form for which the corresponding test expression (not threaded) is true.\n\nExample:\n\n\tuser=> (cond-> 1\n\t\t\t\t true inc\n\t false (* 42)\n\t (= 2 2) (* 3))\n\t6\n\n* clojure.core/cond->> [expr & clauses]\n\n\tTakes an expression and a set of test/form pairs. Threads expr (via ->>)\n through each form for which the corresponding test expression (not threaded) is true.\n\nExample:\n\n\tuser=> (def d [0 1 2 3])\n\t#'user/d\n\tuser=> (cond->> d\n\t\t\t\t true (map inc)\n\t\t\t\t\t(seq? d) (map dec)\n\t\t\t\t\t(= (count d) 4) (reduce +)) ;; no threading in the test expr\n\t\t\t\t\t ;; so d must be passed in explicitly\n\t10\n\n\n* clojure.core/as-> [expr name & forms]\n\nBinds name to expr, evaluates the first form in the lexical context of that binding, then binds name to that result, repeating for each successive form\n\nNote: this form does not actually perform any threading. Instead it allows the user to assign a name and lexical context to a value created by a parent threading form.\n\nExample:\n\n\tuser=> (-> 84\n\t \t (/ 4)\n\t \t (as-> twenty-one ;; uses the value from ->\n\t \t\t (* 2 twenty-one))) ;; no threading here\n\t42\n\n* clojure.core/some-> [expr & forms]\n\n\nWhen expr is not nil, threads it into the first form (via ->),\n and when that result is not nil, through the next etc.\n\nExample:\n\n\tuser=> (defn die [x] (assert false))\n\t#'user/die\n\tuser=> (-> 1 inc range next next next die)\n\tAssertionError Assert failed: false user/die (NO_SOURCE_FILE:65)\n\tuser=> (some-> 1 inc range next next next die)\n\tnil\n\n\n\n* clojure.core/some->> [expr & forms]\n\n When expr is not nil, threads it into the first form (via ->>),\n and when that result is not nil, through the next etc.\n\n Same as some-> except the value is threaded as the last argument in each form.\n\n### 2.5 Column metadata captured by reader\n\n* [CLJ-960](http://dev.clojure.org/jira/browse/CLJ-960)\n Data read by the clojure reader is now tagged with :column in addition to :line.\n\n\n### 2.6 gen-class improvements\n\n* [CLJ-745](http://dev.clojure.org/jira/browse/CLJ-745)\n It is now possible to expose protected final methods via `:exposes-methods` in `gen-class`. This allows Clojure classes created via gen-class to access protected methods of its parent class.\n\nExample:\n\n\t(gen-class :name clojure.test_clojure.genclass.examples.ProtectedFinalTester\n \t :extends java.lang.ClassLoader\n \t :main false\n \t :prefix \"pf-\"\n \t :exposes-methods {findSystemClass superFindSystemClass})\n\n* [CLJ-948](http://dev.clojure.org/jira/browse/CLJ-948)\n It is now possible to annotate constructors via `gen-class`.\n\nExample:\n\n\t(gen-class :name foo.Bar\n \t :extends clojure.lang.Box\n \t :constructors {^{Deprecated true} [Object] [Object]}\n \t :init init\n \t :prefix \"foo\")\n\n### 2.7 Support added for marker protocols\n\n* [CLJ-966](http://dev.clojure.org/jira/browse/CLJ-966)\n `defprotocol` no longer requires that at least one method be given in the definition of the protocol. This allows for marker protocols, whose sole reason of existence is to allow `satisfies?` to be true for a given type.\n\n\nExample:\n\n\tuser=> (defprotocol P (hi [_]))\n P\n user=> (defprotocol M) ; marker protocol\n M\n user=> (deftype T [a] M P (hi [_] \"hi there\"))\n user.T\n user=> (satisfies? P (T. 1))\n true\n user=> (satisfies? M (T. 1))\n true\n user=> (hi (T. 1))\n \"hi there\"\n user=> (defprotocol M2 \"marker for 2\") ; marker protocol again\n M2\n user=> (extend-type T M2)\n nil\n user=> (satisfies? M2 (T. 1))\n true\n\n\n### 2.8 clojure.pprint/print-table output compatible with Emacs Org mode\n\nFor the convenience of those that use Emacs Org mode,\n`clojure.pprint/print-table` now prints tables in the form used by\nthat mode. Emacs Org mode has features to make it easy to edit such\ntables, and even to do spreadsheet-like calculations on their\ncontents. See the [Org mode documentation on\ntables](http://orgmode.org/manual/Tables.html) for details.\n\n user=> (clojure.pprint/print-table [:name :initial-impression]\n [{:name \"Rich\" :initial-impression \"rock star\"}\n {:name \"Andy\" :initial-impression \"engineer\"}])\n | :name | :initial-impression |\n |-------+---------------------|\n | Rich | rock star |\n | Andy | engineer |\n\n\n### 2.9 clojure.string/replace and replace-first handle special characters more predictably\n\n`clojure.string/replace` and `clojure.string/replace-first` are now\nconsistent in the way that they handle the replacement strings: all\ncharacters in the replacement strings are treated literally, including\nbackslash and dollar sign characters.\n\n user=> (require '[clojure.string :as s])\n\n user=> (s/replace-first \"munge.this\" \".\" \"$\")\n ;=> \"munge$this\"\n\n user=> (s/replace \"/my/home/dir\" #\"/\" (fn [s] \"\\\\\"))\n ;=> \"\\\\my\\\\home\\\\dir\"\n\nThere is one exception, which is described in the doc strings. If you\ncall these functions with a regex to search for and a string as the\nreplacement, then dollar sign and backslash characters in the\nreplacement string are treated specially. Occurrences of `$1` in the\nreplacement string are replaced with the string that matched the first\nparenthesized subexpression of the regex, occurrences of `$2` are\nreplaced with the match of the second parenthesized subexpression,\netc.\n\n user=> (s/replace \"x12, b4\" #\"([a-z]+)([0-9]+)\" \"$1 <- $2\")\n ;=> \"x <- 12, b <- 4\"\n\nIndividual occurrences of `$` or `\\` in the replacement string that\nyou wish to be treated literally can be escaped by prefixing them with\na `\\`. If you wish your replacement string to be treated literally\nand its contents are unknown to you at compile time (or you don't wish\nto tarnish your constant string with lots of backslashes), you can use\nthe new function `clojure.string/re-quote-replacement` to do the\nnecessary escaping of special characters for you.\n\n user=> (s/replace \"x12, b4\" #\"([a-z]+)([0-9]+)\"\n (s/re-quote-replacement \"$1 <- $2\"))\n ;=> \"$1 <- $2, $1 <- $2\"\n\n\n### 2.10 Set and map constructor functions allow duplicates\n\nAll of the functions that construct sets such as `set` and\n`sorted-set` allow duplicate elements to appear in their arguments,\nand they are documented to treat this case as if by repeated uses of\n`conj`.\n\nSimilarly, all map constructor functions such as `hash-map`,\n`array-map`, and `sorted-map` allow duplicate keys, and are documented\nto treat this case as if by repeated uses of `assoc`.\n\nAs before, literal sets, e.g. `#{1 2 3}`, do not allow duplicate\nelements, and while elements can be expressions evaluated at run time\nsuch as `#{(inc x) (dec y)}`, this leads to a check for duplicates at\nrun time whenever the set needs to be constructed, throwing an\nexception if any duplicates are found.\n\nSimilarly, literal maps do not allow duplicate keys. New to Clojure\n1.5 is a performance optimization: if all keys are compile time\nconstants but one or more values are expressions requiring evaluation\nat run time, duplicate keys are checked for once at compile time only,\nnot each time a map is constructed at run time.\n\n* [CLJ-1065](http://dev.clojure.org/jira/browse/CLJ-1065)\n Allow duplicate set elements and map keys for all set and map constructors\n\n\n### 2.11 More functions preserve metadata\n\nMost functions that take a collection and return a \"modified\" version\nof that collection preserve the metadata that was on the input\ncollection, e.g. `conj`, `assoc`, `dissoc`, etc. One notable\nexception was `into`, which would return a collection with metadata\n`nil` for several common types of input collections.\n\nNow the functions `into`, `select-keys`, `clojure.set/project`, and\n`clojure.set/rename` return collections with the same metadata as\ntheir input collections.\n\n### 2.12 New edn reader, improvements to `*read-eval*`\n\nThe new `clojure.edn` namespace reads edn (http://edn-format.org) data,\nand should be used for reading data from untrusted sources.\n\nClojure's core read* functions can evaluate code, and should not be\nused to read data from untrusted sources. As of 1.5, `*read-eval*`\nsupports a documented set of thread-local bindings, see the doc string\nfor details.\n\n`*read-eval*`'s default can be set to false by setting a system property:\n\n -Dclojure.read.eval=false\n\n## 3 Performance and Memory Enhancements\n\n* [CLJ-988](http://dev.clojure.org/jira/browse/CLJ-988)\n Multimethod tables are now protected by a read/write lock instead of a synchronized method. This should result in a performance boost for multithreaded code using multimethods.\n* [CLJ-1061](http://dev.clojure.org/jira/browse/CLJ-1061)\n `when-first` now evaluates its expression only once.\n* [CLJ-1084](http://dev.clojure.org/jira/browse/CLJ-1084)\n `PersistentVector$ChunkedSeq` now implements `Counted` interface, to avoid some cases where vector elements were being counted by iterating over their elements.\n* [CLJ-867](http://dev.clojure.org/jira/browse/CLJ-867)\n Records with same fields and field values, but different types, now usually hash to different values.\n* [CLJ-1000](http://dev.clojure.org/jira/browse/CLJ-1000)\n Cache hasheq() for seqs, sets, vectors, maps and queues\n* (no ticket) array-map perf tweaks\n* [CLJ-1111](http://dev.clojure.org/jira/browse/CLJ-1111)\n Allows loop to evaluate to primitive values\n* (no ticket) Move loop locals into same clearing context as loop body\n\n\n## 4 Improved error messages\n\n* [CLJ-103](http://dev.clojure.org/jira/browse/CLJ-103)\n Improved if-let error message when form has a improperly defined body.\n* [CLJ-897](http://dev.clojure.org/jira/browse/CLJ-897)\n Don't use destructuring in defrecord/deftype arglists to get a slightly better error message when forgetting to specify the fields vector\n* [CLJ-788](http://dev.clojure.org/jira/browse/CLJ-788)\n Add source and line members and getters to CompilerException\n* [CLJ-157](http://dev.clojure.org/jira/browse/CLJ-157)\n Better error messages for syntax errors w/ defn and fn\n* [CLJ-940](http://dev.clojure.org/jira/browse/CLJ-940)\n Passing a non-sequence to refer :only results in uninformative exception\n* [CLJ-1052](http://dev.clojure.org/jira/browse/CLJ-1052)\n `assoc` now throws an exception if the last key argument is missing a value.\n\n\n## 5 Improved documentation strings\n\n* [CLJ-893](http://dev.clojure.org/jira/browse/CLJ-893)\n Document that vec will alias Java arrays\n* [CLJ-892](http://dev.clojure.org/jira/browse/CLJ-892)\n Clarify doc strings of sort and sort-by: they will modify Java array arguments\n* [CLJ-1019](http://dev.clojure.org/jira/browse/CLJ-1019)\n ns-resolve doc has a typo\n* [CLJ-1038](http://dev.clojure.org/jira/browse/CLJ-1038)\n Docstring for deliver doesn't match behavior\n* [CLJ-1055](http://dev.clojure.org/jira/browse/CLJ-1055)\n \"be come\" should be \"become\"\n* [CLJ-917](http://dev.clojure.org/jira/browse/CLJ-917)\n clojure.core/definterface is not included in the API docs\n* (no ticket) clojure.core/read, read-string, and *read-eval* all have more extensive documentation.\n\n\n## 6 Bug Fixes\n\n* [CLJ-962](http://dev.clojure.org/jira/browse/CLJ-962)\n Vectors returned by subvec allow access at negative indices\n* [CLJ-952](http://dev.clojure.org/jira/browse/CLJ-952)\n bigdec does not properly convert a clojure.lang.BigInt\n* [CLJ-975](http://dev.clojure.org/jira/browse/CLJ-975)\n inconsistent destructuring behaviour when using nested maps\n* [CLJ-954](http://dev.clojure.org/jira/browse/CLJ-954)\n TAP support in clojure.test.tap Needs Updating\n* [CLJ-881](http://dev.clojure.org/jira/browse/CLJ-881)\n exception when cl-format is given some ~f directive/value combinations\n* [CLJ-763](http://dev.clojure.org/jira/browse/CLJ-763)\n Do not check for duplicates in destructuring map creation\n* [CLJ-667](http://dev.clojure.org/jira/browse/CLJ-667)\n Allow loops fully nested in catch/finally\n* [CLJ-768](http://dev.clojure.org/jira/browse/CLJ-768)\n cl-format bug in ~f formatting\n* [CLJ-844](http://dev.clojure.org/jira/browse/CLJ-844)\n NPE calling keyword on map from bean\n* [CLJ-934](http://dev.clojure.org/jira/browse/CLJ-934)\n disj! Throws exception when attempting to remove multiple items in one call\n* [CLJ-943](http://dev.clojure.org/jira/browse/CLJ-943)\n When load-lib fails, a namespace is still created\n* [CLJ-981](http://dev.clojure.org/jira/browse/CLJ-981)\n clojure.set/rename-keys deletes keys when there's a collision\n* [CLJ-961](http://dev.clojure.org/jira/browse/CLJ-961)\n with-redefs loses a Var's root binding if the Var is thread-bound\n* [CLJ-1032](http://dev.clojure.org/jira/browse/CLJ-1032)\n seque leaks threads from the send-off pool\n* [CLJ-1041](http://dev.clojure.org/jira/browse/CLJ-1041)\n reduce-kv on sorted maps should stop on seeing a Reduced value\n* [CLJ-1011](http://dev.clojure.org/jira/browse/CLJ-1011)\n clojure.data/diff should cope with null and false values in maps\n* [CLJ-977](http://dev.clojure.org/jira/browse/CLJ-977)\n (int \\a) returns a value, (long \\a) throws an exception\n* [CLJ-964](http://dev.clojure.org/jira/browse/CLJ-964)\n test-clojure/rt.clj has undeclared dependency on clojure.set\n* [CLJ-923](http://dev.clojure.org/jira/browse/CLJ-923)\n Reading ratios prefixed by + is not working\n* [CLJ-1012](http://dev.clojure.org/jira/browse/CLJ-1012)\n partial function should also accept 1 arg (just f)\n* [CLJ-932](http://dev.clojure.org/jira/browse/CLJ-932)\n contains? Should throw exception on non-keyed collections\n* [CLJ-730](http://dev.clojure.org/jira/browse/CLJ-730) Create test suite for functional fns (e.g. juxt, comp, partial, etc.)\n* [CLJ-757](http://dev.clojure.org/jira/browse/CLJ-757)\n Empty transient maps/sets return wrong value for .contains\n* [CLJ-828](http://dev.clojure.org/jira/browse/CLJ-828)\n clojure.core/bases returns a cons when passed a class and a Java array when passed an interface\n* [CLJ-1062](http://dev.clojure.org/jira/browse/CLJ-1062)\n CLJ-940 breaks compilation of namespaces that don't have any public functions\n* [CLJ-1070](http://dev.clojure.org/jira/browse/CLJ-1070)\n PersistentQueue's hash function does not match its equality\n* [CLJ-987](http://dev.clojure.org/jira/browse/CLJ-987)\n pprint doesn't flush the underlying stream\n* [CLJ-963](http://dev.clojure.org/jira/browse/CLJ-963)\n Support pretty printing namespace declarations under code-dispatch\n* [CLJ-902](http://dev.clojure.org/jira/browse/CLJ-902)\n doc macro broken for namespaces\n* [CLJ-909](http://dev.clojure.org/jira/browse/CLJ-909) Make LineNumberingPushbackReader's buffer size configurable\n* [CLJ-910](http://dev.clojure.org/jira/browse/CLJ-910) Allow for type-hinting the method receiver in memfn\n* [CLJ-1048](http://dev.clojure.org/jira/browse/CLJ-1048) add test.generative to Clojure's tests\n* [CLJ-1071](http://dev.clojure.org/jira/browse/CLJ-1071) ExceptionInfo does no abstraction\n* [CLJ-1085](http://dev.clojure.org/jira/browse/CLJ-1085) clojure.main/repl unconditionally refers REPL utilities into `*ns*`\n* (no ticket) Rich Hickey fix: syntax-quote was walking records, returning maps\n* [CLJ-1116](http://dev.clojure.org/jira/browse/CLJ-1116) More REPL-friendly 'ns macro\n* (no ticket) Rich Hickey fix: deref any j.u.c.Future\n* [CLJ-1092](http://dev.clojure.org/jira/browse/CLJ-1092) New function re-quote-replacement has incorrect :added metadata\n* [CLJ-1098](http://dev.clojure.org/jira/browse/CLJ-1098) Implement IKVReduce and CollFold for nil\n* (no ticket) Rich Hickey fix: impose once semantics on fabricated closures for e.g. loops\n* [CLJ-1140](http://dev.clojure.org/jira/browse/CLJ-1140) Restore {:as x} destructuring for empty lists\n* [CLJ-1150](http://dev.clojure.org/jira/browse/CLJ-1150) Make some PersistentVector's and APersistentVector.SubVector's internals public\n* (no ticket) Rich Hickey fix: use non-loading classForName\n* [CLJ-1106](http://dev.clojure.org/jira/browse/CLJ-1106) Fixing set equality\n\n## 7 Binary Compatibility Notes\n\n* `public static inner class LispReader.ReaderException(int line, Throwable cause)`\n Constructor changed to `ReaderException(int line, int column, Throwable cause)`\n* `public Object clojure.lang.Agent.dispatch(IFn fn, ISeq args, boolean solo)`\n Replaced with `dispatch(IFn fn, ISeq args, Executor exec)`\n\n# Changes to Clojure in Version 1.4\n\n## CONTENTS\n\n
\n 1 Deprecated and Removed Features\n    1.1 Fields that Start With a Dash Can No Longer Be Accessed Using Dot Syntax\n 2 New/Improved Features\n    2.1 Reader Literals\n    2.2 clojure.core/mapv\n    2.3 clojure.core/filterv\n    2.4 clojure.core/ex-info and clojure.core/ex-data\n    2.5 clojure.core/reduce-kv\n    2.6 clojure.core/contains? Improved\n    2.7 clojure.core/min and clojure.core/max prefer NaN\n    2.8 clojure.java.io/as-file and clojure.java.io/as-url Handle URL-Escaping Better\n    2.9 New Dot Syntax for Record and Type Field Access\n    2.10 Record Factory Methods Available Inside defrecord\n    2.11 assert-args Displays Namespace and Line Number on Errors\n    2.12 File and Line Number Added to Earmuff Dynamic Warning\n    2.13 require Can Take a :refer Option\n    2.14 *compiler-options* Var\n    2.15 Improved Reporting of Invalid Characters in Unicode String Literals\n    2.16 clojure.core/hash No Longer Relies on .hashCode\n    2.17 Java 7 Documentation\n    2.18 loadLibrary Loads Library Using System ClassLoader\n    2.19 Java int is boxed as java.lang.Integer\n 3 Performance Enhancements\n 4 Bug Fixes\n
\n\n## 1 Deprecated and Removed Features\n\n### 1.1 Record and Type Fields that Start With a Dash Can No Longer Be Accessed Using Dot Syntax\n\nClojure 1.4 introduces a field accessor syntax for the dot special form that aligns Clojure field lookup syntax with ClojureScript's.\n\nFor example, in Clojure 1.3, one can declare a record with a field starting with dash and access it like this:\n\n (defrecord Bar [-a]) ;=> user.Bar\n (.-a (Bar. 10)) ;=> 10\n\nIn 1.4, the above code results in `IllegalArgumentException No matching field found: a for class user.Bar`\n\nHowever, the field may still be accessed as a keyword:\n\n (:-a (Bar. 10)) ;=> 10\n\n## 2 New and Improved Features\n\n### 2.1 Reader Literals\n\nClojure 1.4 supports reader literals, which are data structures tagged\nby a symbol to denote how they will be read.\n\nWhen Clojure starts, it searches for files named `data_readers.clj`\nat the root of the classpath. Each such file must contain a Clojure\nmap of symbols, like this:\n\n {foo/bar my.project.foo/bar\n foo/baz my.project/baz}\n\nThe key in each pair is a tag that will be recognized by\nthe Clojure reader. The value in the pair is the\nfully-qualified name of a Var which will be invoked by the reader to\nparse the form following the tag. For example, given the\ndata_readers.clj file above, the Clojure reader would parse this\nform:\n\n #foo/bar [1 2 3]\n\nby invoking the Var `#'my.project.foo/bar` on the vector `[1 2 3]`. The\ndata reader function is invoked on the form AFTER it has been read\nas a normal Clojure data structure by the reader.\n\nReader tags without namespace qualifiers are reserved for Clojure. Default\nreader tags are defined in `clojure.core/default-data-readers` but may be\noverridden in `data_readers.clj` or by rebinding `*data-readers*`.\n\n#### 2.1.1 Instant Literals\n\nClojure supports literals for instants in the form\n`#inst \"yyyy-mm-ddThh:mm:ss.fff+hh:mm\"`. These literals are parsed as `java.util.Date`s\nby default. They can be parsed as `java.util.Calendar`s or `java.util.Timestamp`s\nby binding `*data-readers*` to use `clojure.instant/read-instant-calendar` or\n`clojure.instant/read-instant-timestamp`.\n\n (def instant \"#inst \\\"@2010-11-12T13:14:15.666\\\"\")\n\n ; Instants are read as java.util.Date by default\n (= java.util.Date (class (read-string instant)))\n ;=> true\n\n ; Instants can be read as java.util.Calendar or java.util.Timestamp\n\n (binding [*data-readers* {'inst read-instant-calendar}]\n (= java.util.Calendar (class (read-string instant))))\n ;=> true\n\n (binding [*data-readers* {'inst read-instant-timestamp}]\n (= java.util.Timestamp (class (read-string instant))))\n ;=> true\n\n#### 2.1.2 UUID Literals\n\nClojure supports literals for UUIDs in the form `#uuid \"uuid-string\"`. These\nliterals are parsed as `java.util.UUID`s.\n\n### 2.2 clojure.core/mapv\n\n`mapv` takes a function `f` and one or more collections and returns a\nvector consisting of the result of applying `f` to the set of first items of\neach collection, followed by applying `f` to the set of second items in each\ncollection, until any one of the collections is exhausted. Any remaining\nitems in other collections are ignored. `f` should accept a number of arguments\nequal to the number of collections.\n\n (= [1 2 3] (mapv + [1 2 3]))\n ;=> true\n\n (= [2 3 4] (mapv + [1 2 3] (repeat 1)))\n ;=> true\n\n### 2.3 clojure.core/filterv\n\n`filterv` takes a predicate `pred` and a collection and returns a vector\nof the items in the collection for which `(pred item)` returns true. `pred`\nmust be free of side-effects.\n\n (= [] (filterv even? [1 3 5]))\n ;=> true\n\n (= [2 4] (filterv even? [1 2 3 4 5]))\n ;=> true\n\n### 2.4 clojure.core/ex-info and clojure.core/ex-data\n\n`ex-info` creates an instance of `ExceptionInfo`. `ExceptionInfo` is a\n`RuntimeException` subclass that takes a string `msg` and a map of data.\n\n (ex-info \"Invalid use of robots\" {:robots false})\n ;=> #\n\n`ex-data` is called with an exception and will retrieve that map of data\nif the exception is an instance of `ExceptionInfo`.\n\n (ex-data (ex-info \"Invalid use of robots\" {:robots false}))\n ;=> {:robots false}\n\n### 2.5 clojure.core/reduce-kv\n\n`reduce-kv` reduces an associative collection. It takes a function `f`,\nan initial value `init` and an associative collection `coll`. `f` should\nbe a function of 3 arguments. Returns the result of applying `f` to `init`,\nthe first key and the first value in `coll`, then applying `f` to that result\nand the 2nd key and value, etc. If `coll` contains no entries, returns `init`\nand f is not called. Note that `reduce-kv` is supported on vectors,\nwhere the keys will be the ordinals.\n\n (reduce-kv str \"Hello \" {:w \\o :r \\l :d \\!})\n ;=> \"Hello :rl:d!:wo\"\n (reduce-kv str \"Hello \" [\\w \\o \\r \\l \\d \\!])\n ;=> \"Hello 0w1o2r3l4d5!\"\n\n### 2.6 clojure.core/contains? Improved\n\n`contains?` now works with `java.util.Set`.\n\n### 2.7 clojure.core/min and clojure.core/max prefer NaN\n\n`min` and `max` now give preference to returning NaN if either of their\narguments is NaN.\n\n### 2.8 clojure.java.io/as-file and clojure.java.io/as-url Handle URL-Escaping Better\n\n`as-file` and `as-url` now handle URL-escaping in both directions.\n\n### 2.9 New Dot Syntax for Record and Type Field Access\n\nClojure 1.4 introduces a field accessor syntax for the dot special\nform that aligns Clojure field lookup syntax with ClojureScript's.\n\nIn 1.4, to declare a record type and access its property `x`, one can\nwrite:\n\n (defrecord Foo [x]) ;=> user.Foo\n (.-x (Foo. 10)) ;=> 10\n\nThis addition makes it easier to write code that will run as expected\nin both Clojure and ClojureScript.\n\n### 2.10 Record Factory Methods Available Inside defrecord\n\nPrior to 1.4, you could not use the factory functions (`->RecordClass`\nand `map->RecordClass`) to construct a new record from inside a\n`defrecord` definition.\n\nThe following example did not work prior to 1.4, but is now\nvalid. This example makes use of `->Mean` which would have not yet\nbeen available.\n\n (defrecord Mean [last-winner]\n Player\n (choose [_] (if last-winner last-winner (random-choice)))\n (update-strategy [_ me you] (->Mean (when (iwon? me you) me))))\n\n### 2.11 assert-args Displays Namespace and Line Number on Errors\n\n`assert-args` now uses &form to report the namespace and line number where\nmacro syntax errors occur.\n\n### 2.12 File and Line Number Added to Earmuff Dynamic Warning\n\nWhen a variable is defined using earmuffs but is not declared dynamic,\nClojure emits a warning. That warning now includes the file and line\nnumber.\n\n### 2.13 require Can Take a :refer Option\n\n`require` can now take a `:refer` option. `:refer` takes a list of symbols\nto refer from the namespace or `:all` to bring in all public vars.\n\n### 2.14 \\*compiler-options\\* Var\n\nThe dynamic var `*compiler-options*` contains a map of options to send\nto the Clojure compiler.\n\nSupported options:\n\n* `:elide-meta`: Have certain metadata elided during compilation. This\nshould be set to a collection of keywords.\n* `:disable-locals-clearing`: Set to true to disable clearing. Useful for\nusing a debugger.\n\nThe main function of the Clojure compiler sets the\n`*compiler-options*` from properties prefixed by `clojure.compiler`,\ne.g.\n\n java -Dclojure.compiler.elide-meta='[:doc :file :line]'\n\n### 2.15 Improved Reporting of Invalid Characters in Unicode String Literals\n\nWhen the reader finds an invalid character in a Unicode string literal, it\nnow reports the character instead of its numerical representation.\n\n### 2.16 clojure.core/hash No Longer Relies on .hashCode\n\n`hash` no longer directly uses .hashCode() to return the hash of a Clojure\ndata structure. It calls `clojure.lang.Util.hasheq`, which has its own implementation\nfor Integer, Short, Byte, and Clojure collections. This ensures that the hash code\nreturned is consistent with `=`.\n\n### 2.17 Java 7 Documentation\n\n`*core-java-api*` will now return the URL for the Java 7 Javadoc when you are\nrunning Java 7.\n\n### 2.18 loadLibrary Loads Library Using System ClassLoader\n\nA static method, `loadLibrary`, was added to `clojure.lang.RT` to load a\nlibrary using the system ClassLoader instead of Clojure's class loader.\n\n### 2.19 Java int is Boxed As java.lang.Integer\n\nJava `int`s are now boxed as `java.lang.Integer`s. See\n[the discussion on clojure-dev](https://groups.google.com/forum/#!msg/clojure/7-hARL5c1lI/ntnnOweEGfUJ)\nfor more information.\n\n## 3 Performance Enhancements\n\n* `(= char char)` is now optimized\n* `equiv` is inlined in variadic =\n* `toString` cached on keywords and symbols\n\n## 4 Bug Fixes\n\n* [CLJ-829](http://dev.clojure.org/jira/browse/CLJ-829)\n Transient hashmaps mishandle hash collisions\n* [CLJ-773](http://dev.clojure.org/jira/browse/CLJ-773)\n Macros that are expanded away still have their vars referenced in the emitted byte code\n* [CLJ-837](http://dev.clojure.org/jira/browse/CLJ-837)\n java.lang.VerifyError when compiling deftype or defrecord with argument name starting with double underscore characters\n* [CLJ-369](http://dev.clojure.org/jira/browse/CLJ-369)\n Check for invalid interface method names\n* [CLJ-845](http://dev.clojure.org/jira/browse/CLJ-845)\n Unexpected interaction between protocol extension and namespaced method keyword/symbols\n * Ignoring namespace portion of symbols used to name methods in extend-type and extend-protocol\n* [CLJ-852](http://dev.clojure.org/jira/browse/CLJ-852)\n IllegalArgumentException thrown when defining a var whose value is calculated with a primitive fn\n* [CLJ-855](http://dev.clojure.org/jira/browse/CLJ-855)\n catch receives a RuntimeException rather than the expected checked exception\n* [CLJ-876](http://dev.clojure.org/jira/browse/CLJ-876)\n #^:dynamic vars declared in a nested form are not immediately dynamic\n* [CLJ-886](http://dev.clojure.org/jira/browse/CLJ-886)\n java.io/do-copy can garble multibyte characters\n* [CLJ-895](http://dev.clojure.org/jira/browse/CLJ-895)\n Collection.toArray implementations do not conform to Java API docs\n * obey contract for toArray return type\n* [CLJ-898](http://dev.clojure.org/jira/browse/CLJ-898)\n Agent sends consume heap\n * Only capture a shallow copy of the current Frame in binding-conveyor-fn, so that sends in agent actions don't build infinite Frame stacks\n* [CLJ-928](http://dev.clojure.org/jira/browse/CLJ-928)\n Instant literal for Date and Timestamp should print in UTC\n* [CLJ-931](http://dev.clojure.org/jira/browse/CLJ-933)\n Syntactically broken clojure.test/are tests succeed\n* [CLJ-933](http://dev.clojure.org/jira/browse/CLJ-933)\n Compiler warning on clojure.test-clojure.require-scratch\n\n# Changes to Clojure in Version 1.3\n\n## CONTENTS\n
\n 1 Deprecated and Removed Features\n    1.1 Earmuffed Vars are No Longer Automatically Considered Dynamic\n    1.2 ISeq No Longer Inherits from Sequential\n    1.3 Removed Bit Operation Support for Boxed Numbers\n    1.4 Ancillary Namespaces No Longer Auto-Load on Startup\n    1.5 Replicate Deprecated\n 2 New/Improved Features\n    2.1 Enhanced Primitive Support\n    2.2 defrecord and deftype Improvements\n    2.3 Better Exception Reporting\n    2.4 clojure.reflect/reflect\n    2.5 clojure.data/diff\n    2.6 clojure.core/every-pred and clojure.core/some-fn Combinators\n    2.7 clojure.core/realized?\n    2.8 clojure.core/with-redefs-fn & with-redefs\n    2.9 clojure.core/find-keyword\n    2.10 clojure.repl/pst\n    2.11 clojure.pprint/print-table\n    2.12 pprint respects *print-length*\n    2.13 compilation and deployment via Maven\n    2.14 internal keyword map uses weak refs\n    2.15 ^:const defs\n    2.16 Message Bearing Assert\n    2.17 Error Checking for defmulti Options\n    2.18 Removed Checked Exceptions\n    2.19 vector-of Takes Multiple Arguments\n    2.20 deref with timeout\n    2.21 Walk Support for sorted-by Collections\n    2.22 string.join Enhanced to Work with Sets\n    2.23 clojure.test-helper\n    2.24 Newline outputs platform-specific newline sequence\n    2.25 init-proxy and update-proxy return proxy\n    2.26 doc & find-doc moved to REPL\n    2.27 clojure.java.shell/sh accepts as input anything that clojure.java.io/copy does\n    2.28 InterruptedHandler Promoted to clojure.repl\n    2.29 Add support for running -main namespaces from clojure.main\n    2.30 Set thread names on agent thread pools\n    2.31 Add docstring support to def\n    2.32 Comp function returns identity when called with zero arity\n    2.33 Type hints can be applied to arg vectors\n    2.34 Binding Conveyance\n 3 Performance Enhancements\n 4 Bug Fixes\n 5 Modular Contrib\n
\n\n## 1 Deprecated and Removed Features\n\n### 1.1 Earmuffed Vars Are No Longer Automatically Considered Dynamic.\n\n (def *fred*)\n => Warning: *fred* not declared dynamic and thus is not dynamically rebindable, but its name suggests otherwise. Please either indicate ^:dynamic ** or change the name.\n\n### 1.2 ISeq No Longer Inherits From Sequential\n\nThis allows ISeq implementers to be in the map or set equality partition.\n\n### 1.3 Removed Bit Operation Support for Boxed Numbers\n\nBit Operations map directly to primitive operations\n\n### 1.4 Ancillary Namespaces No Longer Auto-Load on Startup\n\nThe following namespaces are no longer loaded on startup: clojure.set, clojure.xml, clojure.zip\n\n### 1.5 Replicate Deprecated\n\nUse repeat instead.\n\n## 2 New/Improved Features\n\n### 2.1 Enhanced Primitive Support\n\nFull details here:\n\n - [Enhanced Primitive Support][EPS]\n - [Documentation for 1.3 Numerics][NUM]\n\n[EPS]: http://dev.clojure.org/display/doc/Enhanced+Primitive+Support\n[NUM]: http://dev.clojure.org/display/doc/Documentation+for+1.3+Numerics\n\n### 2.2 defrecord and deftype Improvements\n\nDetails here: [Defrecord Improvements](http://dev.clojure.org/display/design/defrecord+improvements)\n\n### 2.3 Better Exception Reporting\n\nDetails here: [Error Handling](http://dev.clojure.org/display/design/Error+Handling)\n\nAdditionally:\n\nBetter error messages:\n\n * When calling macros with arity\n * For Invalid Map Literals\n * For alias function if using unknown namespace\n * In the REPL\n * Add \"starting at \" to EOF while reading exceptions\n * Better compilation error reporting\n\n### 2.4 clojure.reflect/reflect\n\nFull details here: [Reflection API](http://dev.clojure.org/display/design/Reflection+API)\n\n### 2.5 clojure.data/diff\n\nRecursively compares a and b, returning a tuple of [things-only-in-a things-only-in-b things-in-both]\n\n (diff {:a 1 :b 2} {:a 1 :b 22 :c 3})\n => ({:b 2} {:c 3, :b 22} {:a 1})\n\n### 2.6 clojure.core/every-pred and clojure.core/some-fn Combinators\n\nevery-pred takes a set of predicates and returns a function f that returns true if all of its composing predicates return a logical true value against all of its arguments, else it returns false.\n\n ((every-pred even?) 2 4 6)\n => true\n\n ((every-pred even?) 2 4 5)\n =>false\n\nsome-fn takes a set of predicates and returns a function f that returns the first logical true value returned by one of its composing predicates against any of its arguments, else it returns logical false.\n\n ((some-fn even?) 2 4 5)\n => true\n ((some-fn odd?) 2 4 6)\n => false\n\n### 2.7 clojure.core/realized?\n\nReturns true if a value has been produced for a promise, delay, future or lazy sequence.\n\n (let [x (range 5)]\n (println (realized? x))\n (first x)\n (println (realized? x)))\n => false\n => true\n\n### 2.8 clojure.core/with-redefs-fn & clojure.core/with-redefs\n\nwith-redefs-fn temporarily redefines Vars during a call to func. with-redefs temporarily redefines Vars while executing the body.\n\n (with-redefs [nil? :temp] (println nil?))\n => :temp\n\n### 2.9 clojure.core/find-keyword\n\nReturns a Keyword with the given namespace and name if one already exists.\n\n (find-keyword \"def\")\n => :def\n (find-keyword \"fred\")\n => nil\n\n### 2.10 clojure.repl/pst\n\nPrints a stack trace of the exception\n\n\n (pst (IllegalArgumentException.))\n\n IllegalArgumentException\n user/eval27 (NO_SOURCE_FILE:18)\n clojure.lang.Compiler.eval (Compiler.java:6355)\n clojure.lang.Compiler.eval (Compiler.java:6322)\n clojure.core/eval (core.clj:2699)\n clojure.main/repl/read-eval-print--5906 (main.clj:244)\n clojure.main/repl/fn--5911 (main.clj:265)\n clojure.main/repl (main.clj:265)\n clojure.main/repl-opt (main.clj:331)\n clojure.main/main (main.clj:427)\n clojure.lang.Var.invoke (Var.java:397)\n clojure.lang.Var.applyTo (Var.java:518)\n clojure.main.main (main.java:37)\n\n### 2.11 clojure.pprint/print-table\n\nPrints a collection of maps in a textual table.\n\n (print-table [:fred :barney]\n [{:fred \"ethel\"}\n {:fred \"wilma\" :barney \"betty\"}])\n\n ===============\n :fred | :barney\n ===============\n ethel |\n wilma | betty\n ===============\n\n### 2.12 pprint respects \\*print-length\\*\n\nAssigning \\*print-length\\* now affects output of pprint\n\n### 2.13 compilation and deployment via Maven\n\nSee the following pages for more information:\n\n - [Maven Settings and Repositories][MSR]\n - [Why Maven?][WM]\n - [Common Contrib Build][CCB]\n - [How to Make Releases][HMR]\n\n [MSR]: http://dev.clojure.org/display/doc/Maven+Settings+and+Repositories\n [WM]: http://dev.clojure.org/pages/viewpage.action?pageId=950842\n [CCB]: http://dev.clojure.org/display/design/Common+Contrib+Build\n [HMR]:http://dev.clojure.org/display/design/How+to+Make+Releases\n\n### 2.14 internal keyword map uses weak refs\n\n### 2.15 ^:const defs\n\n^:const lets you name primitive values with speedier reference.\n\n (def constants\n {:pi 3.14\n :e 2.71})\n\n (def ^:const pi (:pi constants))\n (def ^:const e (:e constants))\n\nThe overhead of looking up :e and :pi in the map happens at compile time, as (:pi constants) and (:e constants) are evaluated when their parent def forms are evaluated.\n\n### 2.16 Message Bearing Assert\n\nAssert can take a second argument which will be printed when the assert fails\n\n (assert (= 1 2) \"1 is not equal to 2\")\n => AssertionError Assert failed: 1 is not equal to 2\n\n### 2.17 Error Checking for defmulti Options\n\ndefmulti will check to verify that its options are valid. For example, the following code will throw an exception:\n\n (defmulti fred :ethel :lucy :ricky)\n => IllegalArgumentException\n\n### 2.18 Removed Checked Exceptions\n\nClojure does not throw checked exceptions\n\n### 2.19 vector-of Takes Multiple Args\n\nvector-of takes multiple args used to populate the array\n\n (vector-of :int 1 2 3)\n => [1 2 3]\n\n### 2.20 deref with timeout\n\nderef now takes a timeout option - when given with a blocking reference, will return the timeout-val if the timeout (in milliseconds) is reached before value is available.\n\n (deref (promise) 10 :ethel)\n => :ethel\n\n### 2.21 Walk Support for sorted-by Collections\n\nWalk modified to work on sorted-by collections\n\n let [x (sorted-set-by > 1 2 3)] (walk inc reverse x))\n => (2 3 4)\n\n### 2.22 string.join Enhanced to Work with Sets\n\nJust like join works on other collections\n\n (join \" and \" #{:fred :ethel :lucy})\n => \":lucy and :fred and :ethel\"\n\n### 2.23 clojure.test-helper\n\nAll test helpers moved into clojure.test-helper\n\n### 2.24 Newline outputs platform-specific newline sequence\n\nNewline sequence is output as \\r\\n on Windows now.\n\n### 2.25 init-proxy and update-proxy return proxy\n\nNow you can chain calls on the proxy\n\n### 2.26 doc & find-doc moved to REPL\n\nAdds special form docs to the REPL\n\n### 2.27 clojure.java.shell/sh accepts as input anything that clojure.java.io/copy does\n\nThis adds InputStream, Reader, File, byte[] to the list of inputs for clojure.java.shell/sh\n\n### 2.28 Interrupt Handler Promoted to clojure.repl\n\nPromoting this library eliminates the need for a dependency on old contrib.\n\n### 2.29 Add support for running -main namespaces from clojure.main\n\nThis patch allows clojure.main to accept an argument pointing to a namespace to look for a -main function in. This allows users to write -main functions that will work the same whether the code is AOT-compiled for use in an executable jar or just run from source.\n\n### 2.30 Set thread names on agent thread pools\n\nIt's a best practice to name the threads in an executor thread pool with a custom ThreadFactory so that the purpose of these threads is clear in thread dumps and other runtime operational tools.\n\nPatch causes thread names like:\n\n clojure-agent-send-pool-%d (should be fixed # of threads)\n clojure-agent-send-off-pool-%d (will be added and removed over time)\n\n### 2.31 Add docstring support to def\n\nA def can now have a docstring between name and value.\n\n (def foo \"a foo\" :foo)\n\n### 2.32 Comp function returns identity when called with zero arity\n\n (= (comp) identity)\n => true\n\n### 2.33 Type hints can be applied to arg vectors\n\nYou can hint different arities separately:\n\n (defn hinted\n (^String [])\n (^Integer [a])\n (^java.util.List [a & args]))\n\nThis is preferred over hinting the function name. Hinting the function name is still allowed for backward compatibility, but will likely be deprecated in a future release.\n\n### 2.34 Binding Conveyance\n\nClojure APIs that pass work off to other threads (e.g. send, send-off, pmap, future) now convey the dynamic bindings of the calling thread:\n\n (def ^:dynamic *num* 1)\n (binding [*num* 2] (future (println *num*)))\n ;; prints \"2\", not \"1\"\n\n## 3 Performance Enhancements\n\n * Code path for using vars is now much faster for the common case\n * Improved startup time\n * Fix performance on some numeric overloads\n See [CLJ-380](http://dev.clojure.org/jira/browse/CLJ-5) for more information\n * Promises are lock free\n * Functions only get metadata support code when metadata explicitly supplied\n * definterface/gen-interface accepts array type hints\n * inline nil?\n * inline bit-functions & math ops\n * inline n-ary min & max\n * PersistentQueue count is now O(1)\n * Intrinsics: unchecked math operators now emit bytecodes directly where possible\n\n## 4 Bug Fixes\n\n[Complete list of Tickets for 1.3 Release][ISSUES].\n\n[ISSUES]: http://dev.clojure.org/jira/secure/IssueNavigator.jspa?mode=hide&requestId=10052\n\n * [CLJ-8](http://dev.clojure.org/jira/browse/CLJ-8)\n detect and report cyclic load dependencies\n * Patch restore detection of cyclic load dependencies\n\n * [CLJ-31](http://dev.clojure.org/jira/browse/CLJ-31)\n compiler now correctly rejects attempts to recur across try\n (fn [x] (try (recur 1)))\n => CompilerException\n\n * [CLJ-286](http://dev.clojure.org/jira/browse/CLJ-286)\n \\*out\\* being used as java.io.PrintWriter\n * Patch fixes using Writer instead of PrintWriter\n * fix clojure.main to not assume that *err* is a PrintWriter\n\n * [CLJ-292](http://dev.clojure.org/jira/browse/CLJ-292)\n LazySeq.sval() nests RuntimeExceptions\n * Patch causes only the original RuntimeException to be thrown\n\n * [CLJ-390](http://dev.clojure.org/jira/browse/CLJ-390)\n sends from agent error-handlers should be allowed\n * Patch allows agent error-handler to send successfully\n\n * [CLJ-426](http://dev.clojure.org/jira/browse/CLJ-426)\n case should handle hash collision\n * There were situations where a hash collision would occur with case and an exception would be thrown. See [discussion](https://groups.google.com/d/topic/clojure/m4ZDWKSfmfo/discussion) for more details\n\n * [CLJ-430](http://dev.clojure.org/jira/browse/CLJ-430)\n clojure.java.io URL Coercion throws java.lang.ClassCastException\n * Patch correct exception to be thrown\n\n * [CLJ-432](http://dev.clojure.org/jira/browse/CLJ-432)\n deftype does not work if containing ns contains dashes\n * Patch munges namespaces with dashes properly\n\n * [CLJ-433](http://dev.clojure.org/jira/browse/CLJ-433)\n munge should not munge $ (which isJavaIdentifierPart), should munge ' (which is not)\n\n * [CLJ-435](http://dev.clojure.org/jira/browse/CLJ-435)\n stackoverflow exception in printing meta with :type\n * Patch fixes exception being thrown on certain type metadata\n (with-meta {:value 2} {:type Object})\n => No message. [Thrown class java.lang.StackOverflowError]\n\n * [CLJ-437](http://dev.clojure.org/jira/browse/CLJ-437)\n Bugs in clojure.set/subset? and superset? for sets with false/nil elements\n * Patch fixes failing on subset? and superset? for sets with false/nil elements\n\n * [CLJ-439](http://dev.clojure.org/jira/browse/CLJ-439)\n Automatic type translation from Integer to Long\n * Patch fixes increase coercion from Integer to Long\n\n * [CLJ-444](http://dev.clojure.org/jira/browse/CLJ-444)\n Infinite recursion in Keyword.intern leads to stack overflow\n * No more infinite recursion with patch\n\n * [CLJ-673](http://dev.clojure.org/jira/browse/CLJ-673)\n use system class loader when base loader is null\n * facilitates placing Clojure on bootclasspath\n\n * [CLJ-678](http://dev.clojure.org/jira/browse/CLJ-678)\n into-array should work with all primitive types\n\n * [CLJ-680](http://dev.clojure.org/jira/browse/CLJ-680)\n printing promises should not block\n * Patch allows printing of promises without blocking\n\n * [CLJ-682](http://dev.clojure.org/jira/browse/CLJ-682)\n cl-format: ~w throws an exception when not wrapped in a pretty-writer\n * Patch fixes the following bug in cl-format with ~w:\n\n * [CLJ-693](http://dev.clojure.org/jira/browse/CLJ-693)\n VerifyError with symbol metadata, macros, and defrecord\n\n * [CLJ-702](http://dev.clojure.org/jira/browse/CLJ-702)\n case gives NPE when used with nil\n * Patch allows nil to be used with case\n\n * [CLJ-734](http://dev.clojure.org/jira/browse/CLJ-734)\n starting scope of let bindings seems incorrect from jdi perspective\n * Patch fixes local variables table to have the correct code index for let bindings.\n\n * [CLJ-739](http://dev.clojure.org/jira/browse/CLJ-739)\n version.properties file is not closed\n * Patch properly closes version.properties file\n\n * [CLJ-751](http://dev.clojure.org/jira/browse/CLJ-751)\n cl-format: ~( throws an exception with an empty string\n * Patch fixes the following bug in cl-format when format is nil\n (cl-format nil \"~:(~a~)\" \"\")\n => NullPointerException\n\n * [CLJ-780](http://dev.clojure.org/jira/browse/CLJ-780)\n race condition in reference cache on Java 5\n * Map.Entry instances can have null values prior to Java 6. This patch provides a workaround.\n\n * floats were being boxed as Doubles, now they are boxed as Floats\n\n * several \"holding onto head\" fixes\n * Stop top-level defs from hanging onto the head of an expression that uses a lazy seq\n * Stop multimethods from holding onto heads of their arguments\n\n## 5 Modular Contrib\n\nIn 1.3, the monolithic clojure-contrib.jar has been replaced by a modular system of contrib libraries, so that production systems can include only the code they actually need. This also allows individual contribs to have their own release cycles. Many contribs have moved forward by several point versions already. Documentation for updating applications to use the new contrib libraries is at http://dev.clojure.org/display/design/Where+Did+Clojure.Contrib+Go\n\nImportant Note: Many of the new modular contribs are compatible with both 1.2 and 1.3. This offers an incremental migration path: First, upgrade your contrib libraries while holding Clojure at 1.2, Then, in a separate step, upgrade to Clojure 1.3.\n" }, { "path": "clojure.iml", "content": "\n\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n" }, { "path": "doc/clojure/pprint/CommonLispFormat.markdown", "content": "# A Common Lisp-compatible Format Function\ncl-format is an implementation of the incredibly baroque Common Lisp format function as specified \nin [Common Lisp, the Language, 2nd edition, Chapter 22](http://www.cs.cmu.edu/afs/cs.cmu.edu/project/ai-repository/ai/html/cltl/clm/node200.html#SECTION002633000000000000000).\n\nFormat gives you an easy and powerful way to format text and data for output. It supports rich \nformatting of strings and numbers, loops, conditionals, embedded formats, etc. It is really a \ndomain-specific language for formatting.\n\nThis implementation for clojure has the following goals:\n\n * Support the full feature set of the Common Lisp format function (including the X3J13 extensions) with the only exception being concepts that make no sense or are differently interpreted in Clojure.\n * Make porting code from Common Lisp easier.\n * Provide a more native feeling solution for Clojure programmers than the Java format method and its relatives.\n * Be fast. This includes the ability to precompile formats that are going to be used repetitively.\n * Include useful error handling and comprehensive documentation.\n\n## Why would I use cl-format?\n\nFor some people the answer to this question is that they are used to\nCommon Lisp and, therefore, they already know the syntax of format\nstrings and all the directives.\n\nA more interesting answer is that cl-format provides a way of\nrendering strings that is much more suited to Lisp and its data\nstructures. \n\nBecause iteration and conditionals are built into the directive\nstructure of cl-format, it is possible to render sequences and other\ncomplex data structures directly without having to loop over the data\nstructure. \n\nFor example, to print the elements of a sequence separated by commas,\nyou simply say:\n\n (cl-format true \"~{~a~^, ~}\" aseq)\n\n(This example is taken from \n[Practical Common Lisp](http://www.gigamonkeys.com/book/)\nby Peter Seibel.)\n\nThe corresponding output using Clojure's Java-based _format_ function\nwould involve a nasty loop/recur with some code to figure out about\nthe commas. Yuck!\n\n## Current Status of cl-format\n\ncl-format is 100% compatible with the Common Lisp standard as\nspecified in CLtLv2.\nThis includes all of the functionality of Common\nLisp's format function including iteration, conditionals, \ntext justification and rich\noptions for displaying real and integer values. It also includes the\ndirectives to support pretty printing structured output.\n\nIf you find a bug in a directive, drop me a line\nwith a chunk of code that exhibits the bug and the version of\ncl-format you found it in and I'll try to get it fixed.\n\nI also intend to have good built-in documentation for the directives,\nbut I haven't built that yet.\n\nThe following directives are\nnot yet supported: ~:T and ~@:T (but all other forms of ~T work) \nand extensions with ~/. \n\nThe pretty printer interface is similar, but not identical to the \ninterface in Common Lisp.\n\nNext up: \n\n * Support for ~/\n * True compiled formats\n * Restructure unit tests into modular chunks.\n * Import tests from CLISP and SBCL.\n * Unit tests for exception conditions.\n * Interactive documentation\n \n## How to use cl-format\n\n### Loading cl-format in your program\n\nOnce cl-format is in your path, adding it to your code is easy:\n\n (ns your-namespace-here\n (:use [clojure.pprint :only (cl-format)]))\n\nIf you want to refer to the cl-format function as \"format\" (rather\nthan using the clojure function of that name), you can use this idiom:\n\n (ns your-namespace-here\n (:refer-clojure :exclude [format])\n (:use clojure.pprint))\n\n (def format cl-format)\n\nYou might want to do this in code that you've ported from Common Lisp,\nfor instance, or maybe just because old habits die hard.\n\nFrom the REPL, you can grab it using (use):\n\n (use 'clojure.pprint)\n\n### Calling cl-format\n\ncl-format is a standard clojure function that takes a variable number\nof arguments. You call it like this:\n\n (cl-format stream format args...)\n\n_stream_ can be any Java Writer (that is java.io.Writer) or the values\n_true_, _false_, or _nil_. The argument _true_ is identical to using\n`*`out`*` while _false_ or _nil_ indicate that cl-format should return\nits result as a string rather than writing it to a stream.\n\n_format_ is either a format string or a compiled format (see\nbelow). The format string controls the output that's written in a way\nthat's similar to (but much more powerful than) the standard Clojure\nAPI format function (which is based on Java's\njava.lang.String.Format).\n\nFormat strings consist of characters that are to be written to the\noutput stream plus directives (which are marked by ~) as in \"The\nanswer is ~,2f\". Format strings are documented in detail in \n[*Common Lisp the Language*, 2nd edition, Chapter 22](http://www.cs.cmu.edu/afs/cs.cmu.edu/project/ai-repository/ai/html/cltl/clm/node200.html#SECTION002633000000000000000).\n\n_args_ is a set of arguments whose use is defined by the format.\n\n## Using column aware streams across format invocations\n\nWriters in Java have no real idea of current column or device page width, so the format\ndirectives that want to work relative to the current position on the\npage have nothing to work with. To deal with this, cl-format contains\nan extension to writer called pretty-writer. A pretty-writer watches the\noutput and keeps track of what column the current output is going to.\n\nWhen you call format and your format includes a directive that cares\nabout what column it's in (~T, ~&, ~<...~>), cl-format will\nautomatically wrap the Writer you passed in with a pretty-writer. This\nmeans that by default all cl-format statements act like they begin on\na fresh line and have a page width of 72.\n\nFor many applications, these assumptions are fine and you need to do\nnothing more. But sometimes you want to use multiple cl-format calls\nthat output partial lines. You may also want to mix cl-format calls\nwith the native clojure calls like print. If you want stay\ncolumn-aware while doing this you need to create a pretty-writer of\nyour own (and possibly bind it to `*`out`*`).\n\nAs an example of this, this function takes a nested list and prints it\nas a table (returning the result as a string):\n\n (defn list-to-table [aseq column-width]\n (let [string-writer (java.io.StringWriter.)\n stream (get-pretty-writer string-writer)]\n (binding [*out* stream]\n (doseq [row aseq]\n (doseq [col row]\n (cl-format true \"~4D~7,vT\" col column-width))\n (prn)))\n (.flush stream)\n (.toString string-writer)))\n\n(In reality, you'd probably do this as a single call to cl-format.)\n\nThe get-pretty-writer function takes the Writer to wrap and\n(optionally) the page width (in columns) for use with ~<...~>. \n\n## Examples\n\nThe following function uses cl-format to dump a columnized table of the Java system properties:\n\n (defn show-props [stream]\n (let [p (mapcat \n \t #(vector (key %) (val %)) \n \t (sort-by key (System/getProperties)))]\n (cl-format stream \"~30A~A~%~{~20,,,'-A~10A~}~%~{~30A~S~%~}\" \n \t \"Property\" \"Value\" [\"\" \"\" \"\" \"\"] p)))\n \nThere are some more examples in the pretty print examples gallery at \nhttp://github.com/tomfaulhaber/pprint-examples:\n\n * hexdump - a program that uses cl-format to create a standard formatted hexdump of the requested stream.\n * multiply - a function to show a formatted multiplication table in a very \"first-order\" way.\n * props - the show-props example shown above.\n * show_doc - some utilities for showing documentation from various name spaces.\n\n## Differences from the Common Lisp format function\n\nThe floating point directives that show exponents (~E, ~G) show E for\nthe exponent character in all cases (unless overridden with an\n_exponentchar_). Clojure does not distinguish between floats and\ndoubles in its printed representation and neither does cl-format.\n\nThe ~A and ~S directives accept the colon prefix, but ignore it since\n() and nil are not equivalent in Clojure.\n\nClojure has 3 different reader syntaxes for characters. The ~@c\ndirective to cl-format has an argument extension to let you choose:\n\n * ~@c (with no argument) prints \"\\c\" (backslash followed by the printed representation of the character or \\newline, \\space, \\tab, \\backspace, \\return)\n * ~'o@c prints \"\\oDDD\" where DDD are the octal digits representing the character. \n * ~'u@c prints \"\\uXXXX\" prints the hex Unicode representation of the character. \n" }, { "path": "doc/clojure/pprint/PrettyPrinting.markdown", "content": "# A Pretty Printer for Clojure\n\n## Overview\n\nThis namespace adds a new feature to Clojure: a generalized pretty\nprinter.\n\nThe pretty printer is easy to use:\n\n user=> (println (for [x (range 10)] (range x)))\n (() (0) (0 1) (0 1 2) (0 1 2 3) (0 1 2 3 4) (0 1 2 3 4 5) (0 1 2 3 4 5 6) (0 1 2 3 4 5 6 7) (0 1 2 3 4 5 6 7 8))\n nil\n user=> (use 'clojure.pprint) \n nil\n user=> (pprint (for [x (range 10)] (range x))) \n (()\n (0)\n (0 1)\n (0 1 2)\n (0 1 2 3)\n (0 1 2 3 4)\n (0 1 2 3 4 5)\n (0 1 2 3 4 5 6)\n (0 1 2 3 4 5 6 7)\n (0 1 2 3 4 5 6 7 8))\n nil\n user=>\n\nThe pretty printer supports two modes: _code_ which has special\nformatting for special forms and core macros and _simple_ (the\ndefault) which formats the various Clojure data structures as\nappropriate for raw data. In fact, the pretty printer is\nhighly customizable, but basic use is pretty simple.\n\nAll the functions and variables described here are in the\nclojure.pprint namespace. Using them is as simple as adding a \n`(:use clojure.pprint)` to\nyour namespace declarations. Or, better practice would be \n`(:use [clojure.pprint :only ()])`.\n\npprint is being developed by Tom Faulhaber (to mail me you can use\nmy first name at my domain which is infolace.com).\n\nAs with the rest of Clojure, the pretty printer is licensed under the \n[http://opensource.org/licenses/eclipse-1.0.php Eclipse Public License 1.0].\n\nFuture development is guided by those using it, so send feedback about\nwhat's working and not working for you and what you'd like to see in the \npretty printer.\n\n## Pretty Printing Basics\n\nPretty printing is primarily implemented with the function\npprint. pprint takes a single argument and formats it according to the\nsettings of several special variables.\n\nGenerally, the defaults are fine for pretty printing and you can\nsimply use:\n\n (pprint obj)\n\nto print your object. If you wish to write to\nanother stream besides `*`out`*`, you can use:\n\n (write obj :pretty true :stream foo)\n\nwhere foo is the stream to which you wish to write. (The write\nfunction has a lot more options which are not yet documented. Stay\ntuned.)\n\nWhen at the REPL, the pp macro pretty prints the last output\nvalue. This is useful when you get something too complex to read\ncomfortably. Just type:\n\n user=> (pp)\n\nand you'll get a pretty printed version of the last thing output (the\nmagic variable `*`1).\n\n## Dispatch tables and code formatting\n\nThe behavior of the pretty printer can be finely controlled through\nthe use of _dispatch tables_ that contain descriptions for how\ndifferent structures should be formatted. \n\nUsing custom dispatch tables, the pretty printer can create formatted\noutput for data structures that is customized for the\napplication. This allows pretty printing to be baked into any\nstructured output. For information and examples, see below in\n[#Custom_Dispatch_Functions Custom Dispatch Functions].\n\nThe pretty printer comes with two pre-defined dispatch tables to cover\nthe most common situations:\n\n`*`simple-dispatch`*` - supports basic representation of data in various\nClojure structures: seqs, maps, vectors, etc. in a fairly standard\nway. When structures need to be broken across lines, following lines\nare indented to line up with the first element. `*`simple-dispatch`*` is\nthe default and is good for showing the output of most operations.\n\n`*`code-dispatch`*` - has special representation for various structures\nfound in code: defn, condp, binding vectors, anonymous functions,\netc. This dispatch indents following lines of a list one more space as\nappropriate for a function/argument type of list.\n\nAn example formatted with code dispatch:\n\n user=> (def code '(defn cl-format \n \"An implementation of a Common Lisp compatible format function\"\n [stream format-in & args] (let [compiled-format (if (string? format-in) \n (compile-format format-in) format-in) navigator (init-navigator args)] \n (execute-format stream compiled-format navigator))))\n #'user/code\n user=> (with-pprint-dispatch *code-dispatch* (pprint code))\n (defn cl-format\n \"An implementation of a Common Lisp compatible format function\"\n [stream format-in & args]\n (let [compiled-format (if (string? format-in)\n (compile-format format-in)\n format-in)\n navigator (init-navigator args)]\n (execute-format stream compiled-format navigator)))\n nil\n user=> \n\nThere are three ways to set the current dispatch: set it to a specific\ntable permanently with set-pprint-dispatch, bind it with\nwith-pprint-dispatch (as shown in the example above), or use the\n:dispatch keyword argument to write.\n\n## Control variables\n\nThe operation of pretty printing is also controlled by a set of variables\nthat control general parameters of how the pretty printer makes\ndecisions. The current list is as follows:\n\n*`*`print-pretty`*`*: Default: *true* \n\nBind to true if you want write to use pretty printing. (pprint and pp automatically \nbind this to true.)\n\n*`*`print-right-margin`*`*: Default: *72*\n\nPretty printing will try to avoid anything going beyond this column.\n\n*`*`print-miser-width`*`*: Default: *40*\n\nThe column at which to enter miser style. Depending on the dispatch table, \nmiser style add newlines in more places to try to keep lines short allowing for further \nlevels of nesting. For example, in the code dispatch table, the pretty printer will \ninsert a newline between the \"if\" and its condition when in miser style.\n\n*`*`print-suppress-namespaces`*`*: Default: *false*\n\nDon't print namespaces with symbols. This is particularly useful when \npretty printing the results of macro expansions\n\n*`*`print-level`*`*: Default: *nil*\n\nAs with the regular Clojure print function, this variable controls the \ndepth of structure that is printed. The argument itself is level 0,\nthe first level of a collection is level 1, etc. When the structure\ngets deeper than the specified `*`print-level`*`, a hash sign (#) is\nprinted.\n\nFor example:\n\n user=> (binding [*print-level* 2] (pprint '(a b (c d) ((e) ((f d) g)))))\n (a b (c d) (# #))\n nil\n user=> \n\n*`*`print-length`*`*: Default: *nil*\n\nAs with the regular Clojure print function, this variable controls the \nnumber of items that are printed at each layer of structure. When a\nlayer has too many items, ellipses (...) are displayed.\n\nFor example:\n\n user=> (defn foo [x] (for [i (range x) ] (range 1 (- x (dec i)))))\n #'user/foo\n user=> (binding [*print-length* 6] (pprint (foo 10)))\n ((1 2 3 4 5 6 ...)\n (1 2 3 4 5 6 ...)\n (1 2 3 4 5 6 ...)\n (1 2 3 4 5 6 ...)\n (1 2 3 4 5 6)\n (1 2 3 4 5)\n ...)\n nil\n user=>\n\n## Custom Dispatch Functions\n\nUsing custom dispatch, you can easily create your own formatted output\nfor structured data. Examples included with the pretty printer show\nhow to use custom dispatch to translate simple Clojure structures into\nnicely formatted JSON and XML.\n\n### Basic Concepts of Pretty Printing\n\nIn order to create custom dispatch functions, you need to understand\nthe fundamentals of pretty printing. The clojure pretty printer is\nbased on the XP pretty printer algorithm (used in many Lisps including\nCommon Lisp) which supports sophisticated decision-making about line\nbreaking and indentation with reasonable performance even for very\nlarge structures. The XP algorithm is documented in the paper,\n[http://dspace.mit.edu/handle/1721.1/6504 XP. A Common Lisp Pretty\nPrinting System].\n\nThe Clojure implementation of XP is similar in spirit to the Common\nLisp implementation, but the details of the interface are somewhat\ndifferent. The result is that writing custom dispatch in Clojure is\nmore \"Clojure-y.\"\n\nThere are three key concepts to understand when creating custom pretty\nprinting functions: _logical blocks_, _conditional newlines_, and\n_indentation_.\n\nA _logical block_ marks a set of output that should be thought about\nas a single unit by the pretty printer. Logical blocks can contain\nother logical blocks (that is, they nest). As a simple example, when\nprinting list structure, every sublist will typically be a logical\nblock.\n\n_Conditional newlines_ tell the pretty printer where it can insert\nline breaks and how to make the decisions about when to do it. There\nare four types of conditional newline:\n\n * Linear newlines tell the pretty printer to insert a newline in a\n place whenever the enclosing logical block won't fit on a single\n line. Linear newlines are an all-or-nothing proposition; if the\n logical block doesn't fit on a single line, *all* the linear\n newlines are emitted as actual newlines.\n * Fill newlines tell the pretty printer that it should fit as many\n chunks of the logical block as possible on this line and then emit\n a newline.\n * Mandatory newlines tell the pretty printer to emit a newline\n regardless of where it is in the output line. \n * Miser newlines tell the pretty printer to emit a newline if the\n output column is in the miser region (as defined by the pretty\n printer variable `*`pprint-miser-width`*`). This allows you to\n define special behavior as the output gets heavily nested near the\n right margin.\n\n_Indentation_ commands allow you to specify how wrapped lines should\nbe indented. Indentation can be relative to either the start column of\nthe current logical block or the current column position of the output. \n\n(This section is still incomplete...)\n\n## Current limitations and future plans\n\nThis is an early version release of the pretty printer and there is\nplenty that is yet to come.\n\nHere are some examples:\n\n * Support all the types and forms in Clojure (most of the way there now).\n * Support for limiting pretty printing based on line counts.\n * Support for circular and shared substructure detection.\n * Finishing the integration with the format function (support for ~/ and tabular pretty printing).\n * Performance! (Not much thought has been made to making this go fast, but there are a bunch of pretty obvious speedups to be had.)\n * Handle Java objects intelligently\n\nPlease let me know about anything that's not working right, anything that\nshould work differently, or the feature you think should be at the top\nof my list. \n\n" }, { "path": "epl-v10.html", "content": "\r\n\r\n\r\n\r\n\r\n\r\nEclipse Public License - Version 1.0\r\n\r\n\r\n\r\n\r\n\r\n\r\n

Eclipse Public License - v 1.0

\r\n\r\n

THE ACCOMPANYING PROGRAM IS PROVIDED UNDER THE TERMS OF THIS ECLIPSE\r\nPUBLIC LICENSE ("AGREEMENT"). ANY USE, REPRODUCTION OR\r\nDISTRIBUTION OF THE PROGRAM CONSTITUTES RECIPIENT'S ACCEPTANCE OF THIS\r\nAGREEMENT.

\r\n\r\n

1. DEFINITIONS

\r\n\r\n

"Contribution" means:

\r\n\r\n

a) in the case of the initial Contributor, the initial\r\ncode and documentation distributed under this Agreement, and

\r\n

b) in the case of each subsequent Contributor:

\r\n

i) changes to the Program, and

\r\n

ii) additions to the Program;

\r\n

where such changes and/or additions to the Program\r\noriginate from and are distributed by that particular Contributor. A\r\nContribution 'originates' from a Contributor if it was added to the\r\nProgram by such Contributor itself or anyone acting on such\r\nContributor's behalf. Contributions do not include additions to the\r\nProgram which: (i) are separate modules of software distributed in\r\nconjunction with the Program under their own license agreement, and (ii)\r\nare not derivative works of the Program.

\r\n\r\n

"Contributor" means any person or entity that distributes\r\nthe Program.

\r\n\r\n

"Licensed Patents" mean patent claims licensable by a\r\nContributor which are necessarily infringed by the use or sale of its\r\nContribution alone or when combined with the Program.

\r\n\r\n

"Program" means the Contributions distributed in accordance\r\nwith this Agreement.

\r\n\r\n

"Recipient" means anyone who receives the Program under\r\nthis Agreement, including all Contributors.

\r\n\r\n

2. GRANT OF RIGHTS

\r\n\r\n

a) Subject to the terms of this Agreement, each\r\nContributor hereby grants Recipient a non-exclusive, worldwide,\r\nroyalty-free copyright license to reproduce, prepare derivative works\r\nof, publicly display, publicly perform, distribute and sublicense the\r\nContribution of such Contributor, if any, and such derivative works, in\r\nsource code and object code form.

\r\n\r\n

b) Subject to the terms of this Agreement, each\r\nContributor hereby grants Recipient a non-exclusive, worldwide,\r\nroyalty-free patent license under Licensed Patents to make, use, sell,\r\noffer to sell, import and otherwise transfer the Contribution of such\r\nContributor, if any, in source code and object code form. This patent\r\nlicense shall apply to the combination of the Contribution and the\r\nProgram if, at the time the Contribution is added by the Contributor,\r\nsuch addition of the Contribution causes such combination to be covered\r\nby the Licensed Patents. The patent license shall not apply to any other\r\ncombinations which include the Contribution. No hardware per se is\r\nlicensed hereunder.

\r\n\r\n

c) Recipient understands that although each Contributor\r\ngrants the licenses to its Contributions set forth herein, no assurances\r\nare provided by any Contributor that the Program does not infringe the\r\npatent or other intellectual property rights of any other entity. Each\r\nContributor disclaims any liability to Recipient for claims brought by\r\nany other entity based on infringement of intellectual property rights\r\nor otherwise. As a condition to exercising the rights and licenses\r\ngranted hereunder, each Recipient hereby assumes sole responsibility to\r\nsecure any other intellectual property rights needed, if any. For\r\nexample, if a third party patent license is required to allow Recipient\r\nto distribute the Program, it is Recipient's responsibility to acquire\r\nthat license before distributing the Program.

\r\n\r\n

d) Each Contributor represents that to its knowledge it\r\nhas sufficient copyright rights in its Contribution, if any, to grant\r\nthe copyright license set forth in this Agreement.

\r\n\r\n

3. REQUIREMENTS

\r\n\r\n

A Contributor may choose to distribute the Program in object code\r\nform under its own license agreement, provided that:

\r\n\r\n

a) it complies with the terms and conditions of this\r\nAgreement; and

\r\n\r\n

b) its license agreement:

\r\n\r\n

i) effectively disclaims on behalf of all Contributors\r\nall warranties and conditions, express and implied, including warranties\r\nor conditions of title and non-infringement, and implied warranties or\r\nconditions of merchantability and fitness for a particular purpose;

\r\n\r\n

ii) effectively excludes on behalf of all Contributors\r\nall liability for damages, including direct, indirect, special,\r\nincidental and consequential damages, such as lost profits;

\r\n\r\n

iii) states that any provisions which differ from this\r\nAgreement are offered by that Contributor alone and not by any other\r\nparty; and

\r\n\r\n

iv) states that source code for the Program is available\r\nfrom such Contributor, and informs licensees how to obtain it in a\r\nreasonable manner on or through a medium customarily used for software\r\nexchange.

\r\n\r\n

When the Program is made available in source code form:

\r\n\r\n

a) it must be made available under this Agreement; and

\r\n\r\n

b) a copy of this Agreement must be included with each\r\ncopy of the Program.

\r\n\r\n

Contributors may not remove or alter any copyright notices contained\r\nwithin the Program.

\r\n\r\n

Each Contributor must identify itself as the originator of its\r\nContribution, if any, in a manner that reasonably allows subsequent\r\nRecipients to identify the originator of the Contribution.

\r\n\r\n

4. COMMERCIAL DISTRIBUTION

\r\n\r\n

Commercial distributors of software may accept certain\r\nresponsibilities with respect to end users, business partners and the\r\nlike. While this license is intended to facilitate the commercial use of\r\nthe Program, the Contributor who includes the Program in a commercial\r\nproduct offering should do so in a manner which does not create\r\npotential liability for other Contributors. Therefore, if a Contributor\r\nincludes the Program in a commercial product offering, such Contributor\r\n("Commercial Contributor") hereby agrees to defend and\r\nindemnify every other Contributor ("Indemnified Contributor")\r\nagainst any losses, damages and costs (collectively "Losses")\r\narising from claims, lawsuits and other legal actions brought by a third\r\nparty against the Indemnified Contributor to the extent caused by the\r\nacts or omissions of such Commercial Contributor in connection with its\r\ndistribution of the Program in a commercial product offering. The\r\nobligations in this section do not apply to any claims or Losses\r\nrelating to any actual or alleged intellectual property infringement. In\r\norder to qualify, an Indemnified Contributor must: a) promptly notify\r\nthe Commercial Contributor in writing of such claim, and b) allow the\r\nCommercial Contributor to control, and cooperate with the Commercial\r\nContributor in, the defense and any related settlement negotiations. The\r\nIndemnified Contributor may participate in any such claim at its own\r\nexpense.

\r\n\r\n

For example, a Contributor might include the Program in a commercial\r\nproduct offering, Product X. That Contributor is then a Commercial\r\nContributor. If that Commercial Contributor then makes performance\r\nclaims, or offers warranties related to Product X, those performance\r\nclaims and warranties are such Commercial Contributor's responsibility\r\nalone. Under this section, the Commercial Contributor would have to\r\ndefend claims against the other Contributors related to those\r\nperformance claims and warranties, and if a court requires any other\r\nContributor to pay any damages as a result, the Commercial Contributor\r\nmust pay those damages.

\r\n\r\n

5. NO WARRANTY

\r\n\r\n

EXCEPT AS EXPRESSLY SET FORTH IN THIS AGREEMENT, THE PROGRAM IS\r\nPROVIDED ON AN "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS\r\nOF ANY KIND, EITHER EXPRESS OR IMPLIED INCLUDING, WITHOUT LIMITATION,\r\nANY WARRANTIES OR CONDITIONS OF TITLE, NON-INFRINGEMENT, MERCHANTABILITY\r\nOR FITNESS FOR A PARTICULAR PURPOSE. Each Recipient is solely\r\nresponsible for determining the appropriateness of using and\r\ndistributing the Program and assumes all risks associated with its\r\nexercise of rights under this Agreement , including but not limited to\r\nthe risks and costs of program errors, compliance with applicable laws,\r\ndamage to or loss of data, programs or equipment, and unavailability or\r\ninterruption of operations.

\r\n\r\n

6. DISCLAIMER OF LIABILITY

\r\n\r\n

EXCEPT AS EXPRESSLY SET FORTH IN THIS AGREEMENT, NEITHER RECIPIENT\r\nNOR ANY CONTRIBUTORS SHALL HAVE ANY LIABILITY FOR ANY DIRECT, INDIRECT,\r\nINCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING\r\nWITHOUT LIMITATION LOST PROFITS), HOWEVER CAUSED AND ON ANY THEORY OF\r\nLIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING\r\nNEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OR\r\nDISTRIBUTION OF THE PROGRAM OR THE EXERCISE OF ANY RIGHTS GRANTED\r\nHEREUNDER, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGES.

\r\n\r\n

7. GENERAL

\r\n\r\n

If any provision of this Agreement is invalid or unenforceable under\r\napplicable law, it shall not affect the validity or enforceability of\r\nthe remainder of the terms of this Agreement, and without further action\r\nby the parties hereto, such provision shall be reformed to the minimum\r\nextent necessary to make such provision valid and enforceable.

\r\n\r\n

If Recipient institutes patent litigation against any entity\r\n(including a cross-claim or counterclaim in a lawsuit) alleging that the\r\nProgram itself (excluding combinations of the Program with other\r\nsoftware or hardware) infringes such Recipient's patent(s), then such\r\nRecipient's rights granted under Section 2(b) shall terminate as of the\r\ndate such litigation is filed.

\r\n\r\n

All Recipient's rights under this Agreement shall terminate if it\r\nfails to comply with any of the material terms or conditions of this\r\nAgreement and does not cure such failure in a reasonable period of time\r\nafter becoming aware of such noncompliance. If all Recipient's rights\r\nunder this Agreement terminate, Recipient agrees to cease use and\r\ndistribution of the Program as soon as reasonably practicable. However,\r\nRecipient's obligations under this Agreement and any licenses granted by\r\nRecipient relating to the Program shall continue and survive.

\r\n\r\n

Everyone is permitted to copy and distribute copies of this\r\nAgreement, but in order to avoid inconsistency the Agreement is\r\ncopyrighted and may only be modified in the following manner. The\r\nAgreement Steward reserves the right to publish new versions (including\r\nrevisions) of this Agreement from time to time. No one other than the\r\nAgreement Steward has the right to modify this Agreement. The Eclipse\r\nFoundation is the initial Agreement Steward. The Eclipse Foundation may\r\nassign the responsibility to serve as the Agreement Steward to a\r\nsuitable separate entity. Each new version of the Agreement will be\r\ngiven a distinguishing version number. The Program (including\r\nContributions) may always be distributed subject to the version of the\r\nAgreement under which it was received. In addition, after a new version\r\nof the Agreement is published, Contributor may elect to distribute the\r\nProgram (including its Contributions) under the new version. Except as\r\nexpressly stated in Sections 2(a) and 2(b) above, Recipient receives no\r\nrights or licenses to the intellectual property of any Contributor under\r\nthis Agreement, whether expressly, by implication, estoppel or\r\notherwise. All rights in the Program not expressly granted under this\r\nAgreement are reserved.

\r\n\r\n

This Agreement is governed by the laws of the State of New York and\r\nthe intellectual property laws of the United States of America. No party\r\nto this Agreement will bring a legal action under this Agreement more\r\nthan one year after the cause of action arose. Each party waives its\r\nrights to a jury trial in any resulting litigation.

\r\n\r\n\r\n\r\n\r\n" }, { "path": "pom.xml", "content": "\n\n\t4.0.0\n\tgaldolber\n\tclojure-objc\n\tclojure-objc\n\tjar\n\t1.7.0-RC2\n\t\n\t\n \n clojars\n Clojars repository\n https://clojars.org/repo\n \n \n\n\thttp://clojure.org/\n\tClojure core environment and runtime library.\n\n\t\n\t\t\n\t\t\tRich Hickey\n\t\t\trichhickey@gmail.com\n\t\t\t-5\n\t\t\n\t\n\n\t\n\t\t\n\t\t\tEclipse Public License 1.0\n\t\t\thttp://opensource.org/licenses/eclipse-1.0.php\n\t\t\trepo\n\t\t\n\t\n\n\t\n\t\tscm:git:git@github.com:galdolber/clojure-objc.git\n\t\tscm:git:git@github.com:galdolber/clojure-objc.git\n\t\tgit@github.com:galdolber/clojure-objc.git\n\t\n\n\t\n\t\t\n\t\t\torg.codehaus.jsr166-mirror\n\t\t\tjsr166y\n\t\t\t1.7.0\n\t\t\tprovided\n\t\t\n\t\t\n\t\t\torg.clojure\n\t\t\ttest.generative\n\t\t\t0.5.2\n\t\t\ttest\n\t\t\t\n\t\t\t\t\n\t\t\t\t\torg.clojure\n\t\t\t\t\tclojure\n\t\t\t\t\n\t\t\t\n\t\t\n\t\t\n\t\t\torg.clojure\n\t\t\ttest.check\n\t\t\t0.5.9\n\t\t\ttest\n\t\t\t\n\t\t\t\t\n\t\t\t\t\torg.clojure\n\t\t\t\t\tclojure\n\t\t\t\t\n\t\t\t\n\t\t\n\t\n\n\t\n\t\t\n\t\t\t\n\t\t\t\tsrc/resources\n\t\t\t\ttrue\n\t\t\t\n\t\t\t\n\t\t\t\tsrc/clj\n\t\t\t\n\t\t\n\t\ttest/java\n\t\t\n\t\t\t\n\t\t\t\torg.apache.maven.plugins\n\t\t\t\tmaven-compiler-plugin\n\t\t\t\t2.3.2\n\t\t\t\t\n\t\t\t\t\t1.6\n\t\t\t\t\t1.6\n\t\t\t\t\t${project.build.sourceEncoding}\n\t\t\t\t\n\t\t\t\n\t\t\t\n\t\t\t\tmaven-antrun-plugin\n\t\t\t\t1.6\n\t\t\t\t\n\t\t\t\t\t\n\t\t\t\t\t\tclojure-compile\n\t\t\t\t\t\tcompile\n\t\t\t\t\t\t\n\t\t\t\t\t\t\trun\n\t\t\t\t\t\t\n\t\t\t\t\t\t\n\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t\n\t\t\t\t\t\t\n\t\t\t\t\t\n\t\t\t\t\t\n\t\t\t\t\t\tclojure-test\n\t\t\t\t\t\ttest\n\t\t\t\t\t\t\n\t\t\t\t\t\t\trun\n\t\t\t\t\t\t\n\t\t\t\t\t\t\n\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t\n\t\t\t\t\t\t\n\t\t\t\t\t\n\t\t\t\t\n\t\t\t\n\t\t\t\n\t\t\t\torg.codehaus.mojo\n\t\t\t\tbuild-helper-maven-plugin\n\t\t\t\t1.5\n\t\t\t\t\n\t\t\t\t\t\n\t\t\t\t\t\tadd-clojure-source-dirs\n\t\t\t\t\t\tgenerate-sources\n\t\t\t\t\t\t\n\t\t\t\t\t\t\tadd-source\n\t\t\t\t\t\t\n\t\t\t\t\t\t\n\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t\tsrc/jvm\n\t\t\t\t\t\t\t\n\t\t\t\t\t\t\n\t\t\t\t\t\n\t\t\t\t\n\t\t\t\n\t\t\t\n\t\t\t\tmaven-assembly-plugin\n\t\t\t\t2.2\n\t\t\t\t\n\t\t\t\t\t\n\t\t\t\t\t\tclojure-slim-jar\n\t\t\t\t\t\tpackage\n\t\t\t\t\t\t\n\t\t\t\t\t\t\tsingle\n\t\t\t\t\t\t\n\t\t\t\t\t\t\n\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t\tsrc/assembly/slim.xml\n\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t\t\tclojure.main\n\t\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t\n\t\t\t\t\t\t\n\t\t\t\t\t\n\t\t\t\t\n\t\t\t\n\t\t\t\n\t\t\t\tmaven-jar-plugin\n\t\t\t\t2.3.1\n\t\t\t\t\n\t\t\t\t\t\n\t\t\t\t\t\t\n\t\t\t\t\t\t\tclojure.main\n\t\t\t\t\t\t\n\t\t\t\t\t\n\t\t\t\t\n\t\t\t\n\t\t\t\n\t\t\t\tmaven-source-plugin\n\t\t\t\t2.1.2\n\t\t\t\t\n\t\t\t\t\t\n\t\t\t\t\t\tsources-jar\n\t\t\t\t\t\tpackage\n\t\t\t\t\t\t\n\t\t\t\t\t\t\tjar\n\t\t\t\t\t\t\n\t\t\t\t\t\t\n\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t\tclojure/version.properties\n\t\t\t\t\t\t\t\n\t\t\t\t\t\t\n\t\t\t\t\t\n\t\t\t\t\n\t\t\t\n\t\t\t\n\t\t\t\t\n\t\t\t\torg.apache.maven.plugins\n\t\t\t\tmaven-release-plugin\n\t\t\t\t2.1\n\t\t\t\t\n\t\t\t\t\tfalse\n\t\t\t\t\ttrue\n\t\t\t\t\n\t\t\t\n\t\t\t\n\t\t\t\t\n\t\t\t\torg.apache.maven.plugins\n\t\t\t\tmaven-surefire-plugin\n\t\t\t\t2.6\n\t\t\t\t\n\t\t\t\t\ttrue\n\t\t\t\t\n\t\t\t\n\t\t\n\t\n\n" }, { "path": "readme.md", "content": "# clojure-objc\n\nA Clojure compiler that targets objc runtimes.\n\n * Write native apps in Clojure\n * Strong iOS support\n * Future proof: shares 99.99% of the code base with clojure for the jvm\n * Distribute clojure-objc libs using maven\n * Most existing Clojure libs should just work\n * ObjC interop\n * C interop\n * ObjC subclassing\n * REPL!\n\n![alt usage guide](https://github.com/galdolber/clojure-objc-sample/raw/master/ios.gif)\n\n## Leiningen plugin\n \n https://github.com/galdolber/lein-objcbuild\n \n## Dependency\n\n[![Clojars Project](http://clojars.org/galdolber/clojure-objc/latest-version.svg)](http://clojars.org/galdolber/clojure-objc)\n \n## Memory management\n \n All generated code manage memory automagically, but if you alloc with interop you need to release!\n \n## ObjC interop\n \n ;; calling objc methods\n (defn say-hi [name]\n (-> ($ UIAlertView)\n ($ :alloc)\n ($ :initWithTitle (str \"Hello \" name)\n :message \"Hi! from clojure\"\n :delegate nil\n :cancelButtonTitle \"Cancelar\"\n :otherButtonTitles nil)\n ($ :autorelease)\n ($ :show)))\n \n ;; extend objc class\n (defnstype UIKitController UIViewController\n ([^:id self :initWith ^:id [view s]]\n (doto ($$ self :init)\n ($ :setView ($ view :retain))\n (objc-set! :scope s)\n (#(post-notification ($ % :view) :init)))))\n \n ;; c interop\n (defc NSLog :void [:id &]) ; & for variadic\n (NSLog \"%@ %@ %d\" \"Hello\" \"World\" 13)\n\n ;; proxy objc class\n (nsproxy\n ([^:bool self :textFieldShouldReturn ^:id field]\n ($ field :resignFirstResponder) \n true))\n \n## Presentations\n\nhttp://www.slideshare.net/GalDolber/clojureobjc-47500127\n \n## Discuss\n \n https://groups.google.com/d/forum/clojure-objc-discuss\n \n## How to build dist\n \n lein exec build.clj\n\n## License\n\nPortions of this project derived from Clojure:\nCopyright © 2006-2015 Rich Hickey\n\nOriginal code and Clojure modifications:\nCopyright © 2014-2015 Gal Dolber\n\nBoth are distributed under the Eclipse Public License either version 1.0 or (at your option) any later version.\n" }, { "path": "release.sh", "content": "export KEEP_META=false\nrm -Rf target/release\nmkdir target/release\ncp target/libclojure-objc.a target/release/\ncp $J2OBJC_HOME/lib/libjre_emul.a target/release/\ncp src/ffi/libffi.a target/release/\nmkdir target/release/include\nrsync -a $J2OBJC_HOME/include target/release\nrsync -a target/include target/release\ncp $J2OBJC_HOME/j2objc target/release/\nmkdir target/release/lib\ncp $J2OBJC_HOME/lib/j2objc_annotations.jar target/release/lib\ncp $J2OBJC_HOME/lib/j2objc.jar target/release/lib\ncp $J2OBJC_HOME/lib/jre_emul.jar target/release/lib\ncd ./target/release\nzip -r ../release.zip .\n" }, { "path": "src/assembly/distribution.xml", "content": "\n distribution\n \n zip\n \n \n \n src\n src\n \n \n doc\n doc\n \n \n test\n test\n \n \n target\n /\n false\n \n\t*.jar\n \n \n \n \n \n pom.xml\n \n \n build.xml\n \n \n readme.txt\n true\n \n \n changes.md\n \n \n clojure.iml\n \n \n epl-v10.html\n \n \n\n" }, { "path": "src/assembly/slim.xml", "content": "\n slim\n \n jar\n \n false\n \n \n src/clj\n /\n \n \n src/resources\n /\n true\n \n \n target/classes/clojure/asm\n clojure/asm\n \n \n target/classes/clojure/lang\n clojure/lang\n \n \n \n \n target/classes/clojure/main.class\n clojure\n \n \n\n" }, { "path": "src/clj/clojure/core/protocols.clj", "content": "; Copyright (c) Rich Hickey. All rights reserved.\n; The use and distribution terms for this software are covered by the\n; Eclipse Public License 1.0 (http://opensource.org/licenses/eclipse-1.0.php)\n; which can be found in the file epl-v10.html at the root of this distribution.\n; By using this software in any fashion, you are agreeing to be bound by\n; the terms of this license.\n; You must not remove this notice, or any other, from this software.\n\n(ns clojure.core.protocols)\n\n(set! *warn-on-reflection* true)\n\n(defprotocol CollReduce\n \"Protocol for collection types that can implement reduce faster than\n first/next recursion. Called by clojure.core/reduce. Baseline\n implementation defined in terms of Iterable.\"\n (coll-reduce [coll f] [coll f val]))\n\n(defprotocol InternalReduce\n \"Protocol for concrete seq types that can reduce themselves\n faster than first/next recursion. Called by clojure.core/reduce.\"\n (internal-reduce [seq f start]))\n\n(defn- seq-reduce\n ([coll f]\n (if-let [s (seq coll)]\n (internal-reduce (next s) f (first s))\n (f)))\n ([coll f val]\n (let [s (seq coll)]\n (internal-reduce s f val))))\n\n(defn- iter-reduce\n ([^java.lang.Iterable coll f]\n (let [iter (.iterator coll)]\n (if (.hasNext iter)\n (loop [ret (.next iter)]\n (if (.hasNext iter)\n (let [ret (f ret (.next iter))]\n (if (reduced? ret)\n @ret\n (recur ret)))\n ret))\n (f))))\n ([^java.lang.Iterable coll f val]\n (let [iter (.iterator coll)]\n (loop [ret val]\n (if (.hasNext iter)\n (let [ret (f ret (.next iter))]\n (if (reduced? ret)\n @ret\n (recur ret)))\n ret)))))\n\n(defn- naive-seq-reduce\n \"Reduces a seq, ignoring any opportunities to switch to a more\n specialized implementation.\"\n [s f val]\n (loop [s (seq s)\n val val]\n (if s\n (let [ret (f val (first s))]\n (if (reduced? ret)\n @ret\n (recur (next s) ret)))\n val)))\n\n(defn- interface-or-naive-reduce\n \"Reduces via IReduceInit if possible, else naively.\"\n [coll f val]\n (if (instance? clojure.lang.IReduceInit coll)\n (.reduce ^clojure.lang.IReduceInit coll f val)\n (naive-seq-reduce coll f val)))\n\n(extend-protocol CollReduce\n nil\n (coll-reduce\n ([coll f] (f))\n ([coll f val] val))\n\n Object\n (coll-reduce\n ([coll f] (seq-reduce coll f))\n ([coll f val] (seq-reduce coll f val)))\n\n clojure.lang.IReduceInit\n (coll-reduce\n ([coll f] (.reduce ^clojure.lang.IReduce coll f))\n ([coll f val] (.reduce coll f val)))\n\n ;;aseqs are iterable, masking internal-reducers\n clojure.lang.ASeq\n (coll-reduce\n ([coll f] (seq-reduce coll f))\n ([coll f val] (seq-reduce coll f val)))\n\n ;;for range\n clojure.lang.LazySeq\n (coll-reduce\n ([coll f] (seq-reduce coll f))\n ([coll f val] (seq-reduce coll f val)))\n\n ;;vector's chunked seq is faster than its iter\n clojure.lang.PersistentVector\n (coll-reduce\n ([coll f] (seq-reduce coll f))\n ([coll f val] (seq-reduce coll f val)))\n\n Iterable\n (coll-reduce\n ([coll f] (iter-reduce coll f))\n ([coll f val] (iter-reduce coll f val)))\n\n clojure.lang.APersistentMap$KeySeq\n (coll-reduce\n ([coll f] (iter-reduce coll f))\n ([coll f val] (iter-reduce coll f val)))\n\n clojure.lang.APersistentMap$ValSeq\n (coll-reduce\n ([coll f] (iter-reduce coll f))\n ([coll f val] (iter-reduce coll f val))))\n\n(extend-protocol InternalReduce\n nil\n (internal-reduce\n [s f val]\n val)\n \n ;; handles vectors and ranges\n clojure.lang.IChunkedSeq\n (internal-reduce\n [s f val]\n (if-let [s (seq s)]\n (if (chunked-seq? s)\n (let [ret (.reduce (chunk-first s) f val)]\n (if (reduced? ret)\n @ret\n (recur (chunk-next s)\n f\n ret)))\n (interface-or-naive-reduce s f val))\n val))\n \n clojure.lang.StringSeq\n (internal-reduce\n [str-seq f val]\n (let [s (.s str-seq)]\n (loop [i (.i str-seq)\n val val]\n (if (< i (.length s))\n (let [ret (f val (.charAt s i))]\n (if (reduced? ret)\n @ret\n (recur (inc i) ret)))\n val))))\n \n java.lang.Object\n (internal-reduce\n [s f val]\n (loop [cls (class s)\n s s\n f f\n val val]\n (if-let [s (seq s)]\n (if (identical? (class s) cls)\n (let [ret (f val (first s))]\n (if (reduced? ret)\n @ret\n (recur cls (next s) f ret)))\n (interface-or-naive-reduce s f val))\n val))))\n\n(defprotocol IKVReduce\n \"Protocol for concrete associative types that can reduce themselves\n via a function of key and val faster than first/next recursion over map\n entries. Called by clojure.core/reduce-kv, and has same\n semantics (just different arg order).\"\n (kv-reduce [amap f init]))\n" }, { "path": "src/clj/clojure/core/reducers.clj", "content": "; Copyright (c) Rich Hickey. All rights reserved.\n; The use and distribution terms for this software are covered by the\n; Eclipse Public License 1.0 (http://opensource.org/licenses/eclipse-1.0.php)\n; which can be found in the file epl-v10.html at the root of this distribution.\n; By using this software in any fashion, you are agreeing to be bound by\n; the terms of this license.\n; You must not remove this notice, or any other, from this software.\n\n(ns ^{:doc\n \"A library for reduction and parallel folding. Alpha and subject\n to change. Note that fold and its derivatives require Java 7+ or\n Java 6 + jsr166y.jar for fork/join support. See Clojure's pom.xml for the\n dependency info.\"\n :author \"Rich Hickey\"}\n clojure.core.reducers\n (:refer-clojure :exclude [reduce map mapcat filter remove take take-while drop flatten cat])\n (:require [clojure.walk :as walk]))\n\n(alias 'core 'clojure.core)\n(set! *warn-on-reflection* true)\n\n;;;;;;;;;;;;;; some fj stuff ;;;;;;;;;;\n\n(defmacro ^:private compile-if\n \"Evaluate `exp` and if it returns logical true and doesn't error, expand to\n `then`. Else expand to `else`.\n\n (compile-if (Class/forName \\\"java.util.concurrent.ForkJoinTask\\\")\n (do-cool-stuff-with-fork-join)\n (fall-back-to-executor-services))\"\n [exp then else]\n (if (try (eval exp)\n (catch Throwable _ false))\n `(do ~then)\n `(do ~else)))\n\n(compile-if\n (Class/forName \"java.util.concurrent.ForkJoinTask\")\n ;; We're running a JDK 7+\n (do\n (def pool (delay (java.util.concurrent.ForkJoinPool.)))\n\n (defn fjtask [^Callable f]\n (java.util.concurrent.ForkJoinTask/adapt f))\n\n (defn- fjinvoke [f]\n (if (java.util.concurrent.ForkJoinTask/inForkJoinPool)\n (f)\n (.invoke ^java.util.concurrent.ForkJoinPool @pool ^java.util.concurrent.ForkJoinTask (fjtask f))))\n\n (defn- fjfork [task] (.fork ^java.util.concurrent.ForkJoinTask task))\n\n (defn- fjjoin [task] (.join ^java.util.concurrent.ForkJoinTask task)))\n ;; We're running a JDK <7\n (do\n (def pool (delay (jsr166y.ForkJoinPool.)))\n\n (defn fjtask [^Callable f]\n (jsr166y.ForkJoinTask/adapt f))\n\n (defn- fjinvoke [f]\n (if (jsr166y.ForkJoinTask/inForkJoinPool)\n (f)\n (.invoke ^jsr166y.ForkJoinPool @pool ^jsr166y.ForkJoinTask (fjtask f))))\n\n (defn- fjfork [task] (.fork ^jsr166y.ForkJoinTask task))\n\n (defn- fjjoin [task] (.join ^jsr166y.ForkJoinTask task))))\n;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\n\n(defn reduce\n \"Like core/reduce except:\n When init is not provided, (f) is used.\n Maps are reduced with reduce-kv\"\n ([f coll] (reduce f (f) coll))\n ([f init coll]\n (if (instance? java.util.Map coll)\n (clojure.core.protocols/kv-reduce coll f init)\n (clojure.core.protocols/coll-reduce coll f init))))\n\n(defprotocol CollFold\n (coll-fold [coll n combinef reducef]))\n\n(defn fold\n \"Reduces a collection using a (potentially parallel) reduce-combine\n strategy. The collection is partitioned into groups of approximately\n n (default 512), each of which is reduced with reducef (with a seed\n value obtained by calling (combinef) with no arguments). The results\n of these reductions are then reduced with combinef (default\n reducef). combinef must be associative, and, when called with no\n arguments, (combinef) must produce its identity element. These\n operations may be performed in parallel, but the results will\n preserve order.\"\n {:added \"1.5\"}\n ([reducef coll] (fold reducef reducef coll))\n ([combinef reducef coll] (fold 512 combinef reducef coll))\n ([n combinef reducef coll]\n (coll-fold coll n combinef reducef)))\n\n(defn reducer\n \"Given a reducible collection, and a transformation function xf,\n returns a reducible collection, where any supplied reducing\n fn will be transformed by xf. xf is a function of reducing fn to\n reducing fn.\"\n {:added \"1.5\"}\n ([coll xf]\n (reify\n clojure.core.protocols/CollReduce\n (coll-reduce [this f1]\n (clojure.core.protocols/coll-reduce this f1 (f1)))\n (coll-reduce [_ f1 init]\n (clojure.core.protocols/coll-reduce coll (xf f1) init)))))\n\n(defn folder\n \"Given a foldable collection, and a transformation function xf,\n returns a foldable collection, where any supplied reducing\n fn will be transformed by xf. xf is a function of reducing fn to\n reducing fn.\"\n {:added \"1.5\"}\n ([coll xf]\n (reify\n clojure.core.protocols/CollReduce\n (coll-reduce [_ f1]\n (clojure.core.protocols/coll-reduce coll (xf f1) (f1)))\n (coll-reduce [_ f1 init]\n (clojure.core.protocols/coll-reduce coll (xf f1) init))\n\n CollFold\n (coll-fold [_ n combinef reducef]\n (coll-fold coll n combinef (xf reducef))))))\n\n(defn- do-curried\n [name doc meta args body]\n (let [cargs (vec (butlast args))]\n `(defn ~name ~doc ~meta\n (~cargs (fn [x#] (~name ~@cargs x#)))\n (~args ~@body))))\n\n(defmacro ^:private defcurried\n \"Builds another arity of the fn that returns a fn awaiting the last\n param\"\n [name doc meta args & body]\n (do-curried name doc meta args body))\n\n(defn- do-rfn [f1 k fkv]\n `(fn\n ([] (~f1))\n ~(clojure.walk/postwalk\n #(if (sequential? %)\n ((if (vector? %) vec identity)\n (core/remove #{k} %))\n %)\n fkv)\n ~fkv))\n\n(defmacro ^:private rfn\n \"Builds 3-arity reducing fn given names of wrapped fn and key, and k/v impl.\"\n [[f1 k] fkv]\n (do-rfn f1 k fkv))\n\n(defcurried map\n \"Applies f to every value in the reduction of coll. Foldable.\"\n {:added \"1.5\"}\n [f coll]\n (folder coll\n (fn [f1]\n (rfn [f1 k]\n ([ret k v]\n (f1 ret (f k v)))))))\n\n(defcurried mapcat\n \"Applies f to every value in the reduction of coll, concatenating the result\n colls of (f val). Foldable.\"\n {:added \"1.5\"}\n [f coll]\n (folder coll\n (fn [f1]\n (let [f1 (fn\n ([ret v]\n (let [x (f1 ret v)] (if (reduced? x) (reduced x) x)))\n ([ret k v]\n (let [x (f1 ret k v)] (if (reduced? x) (reduced x) x))))]\n (rfn [f1 k]\n ([ret k v]\n (reduce f1 ret (f k v))))))))\n\n(defcurried filter\n \"Retains values in the reduction of coll for which (pred val)\n returns logical true. Foldable.\"\n {:added \"1.5\"}\n [pred coll]\n (folder coll\n (fn [f1]\n (rfn [f1 k]\n ([ret k v]\n (if (pred k v)\n (f1 ret k v)\n ret))))))\n\n(defcurried remove\n \"Removes values in the reduction of coll for which (pred val)\n returns logical true. Foldable.\"\n {:added \"1.5\"}\n [pred coll]\n (filter (complement pred) coll))\n\n(defcurried flatten\n \"Takes any nested combination of sequential things (lists, vectors,\n etc.) and returns their contents as a single, flat foldable\n collection.\"\n {:added \"1.5\"}\n [coll]\n (folder coll\n (fn [f1]\n (fn\n ([] (f1))\n ([ret v]\n (if (sequential? v)\n (clojure.core.protocols/coll-reduce (flatten v) f1 ret)\n (f1 ret v)))))))\n\n(defcurried take-while\n \"Ends the reduction of coll when (pred val) returns logical false.\"\n {:added \"1.5\"}\n [pred coll]\n (reducer coll\n (fn [f1]\n (rfn [f1 k]\n ([ret k v]\n (if (pred k v)\n (f1 ret k v)\n (reduced ret)))))))\n\n(defcurried take\n \"Ends the reduction of coll after consuming n values.\"\n {:added \"1.5\"}\n [n coll]\n (reducer coll\n (fn [f1]\n (let [cnt (atom n)]\n (rfn [f1 k]\n ([ret k v]\n (swap! cnt dec)\n (if (neg? @cnt)\n (reduced ret)\n (f1 ret k v))))))))\n\n(defcurried drop\n \"Elides the first n values from the reduction of coll.\"\n {:added \"1.5\"}\n [n coll]\n (reducer coll\n (fn [f1]\n (let [cnt (atom n)]\n (rfn [f1 k]\n ([ret k v]\n (swap! cnt dec)\n (if (neg? @cnt)\n (f1 ret k v)\n ret)))))))\n\n;;do not construct this directly, use cat\n(deftype Cat [cnt left right]\n clojure.lang.Counted\n (count [_] cnt)\n\n clojure.lang.Seqable\n (seq [_] (concat (seq left) (seq right)))\n\n clojure.core.protocols/CollReduce\n (coll-reduce [this f1] (clojure.core.protocols/coll-reduce this f1 (f1)))\n (coll-reduce\n [_ f1 init]\n (clojure.core.protocols/coll-reduce\n right f1\n (clojure.core.protocols/coll-reduce left f1 init)))\n\n CollFold\n (coll-fold\n [_ n combinef reducef]\n (fjinvoke\n (fn []\n (let [rt (fjfork (fjtask #(coll-fold right n combinef reducef)))]\n (combinef\n (coll-fold left n combinef reducef)\n (fjjoin rt)))))))\n\n(defn cat\n \"A high-performance combining fn that yields the catenation of the\n reduced values. The result is reducible, foldable, seqable and\n counted, providing the identity collections are reducible, seqable\n and counted. The single argument version will build a combining fn\n with the supplied identity constructor. Tests for identity\n with (zero? (count x)). See also foldcat.\"\n {:added \"1.5\"}\n ([] (java.util.ArrayList.))\n ([ctor]\n (fn\n ([] (ctor))\n ([left right] (cat left right))))\n ([left right]\n (cond\n (zero? (count left)) right\n (zero? (count right)) left\n :else\n (Cat. (+ (count left) (count right)) left right))))\n\n(defn append!\n \".adds x to acc and returns acc\"\n {:added \"1.5\"}\n [^java.util.Collection acc x]\n (doto acc (.add x)))\n\n(defn foldcat\n \"Equivalent to (fold cat append! coll)\"\n {:added \"1.5\"}\n [coll]\n (fold cat append! coll))\n\n(defn monoid\n \"Builds a combining fn out of the supplied operator and identity\n constructor. op must be associative and ctor called with no args\n must return an identity value for it.\"\n {:added \"1.5\"}\n [op ctor]\n (fn m\n ([] (ctor))\n ([a b] (op a b))))\n\n;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;; fold impls ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\n(defn- foldvec\n [v n combinef reducef]\n (cond\n (empty? v) (combinef)\n (<= (count v) n) (reduce reducef (combinef) v)\n :else\n (let [split (quot (count v) 2)\n v1 (subvec v 0 split)\n v2 (subvec v split (count v))\n fc (fn [child] #(foldvec child n combinef reducef))]\n (fjinvoke\n #(let [f1 (fc v1)\n t2 (fjtask (fc v2))]\n (fjfork t2)\n (combinef (f1) (fjjoin t2)))))))\n\n(extend-protocol CollFold\n nil\n (coll-fold\n [coll n combinef reducef]\n (combinef))\n\n Object\n (coll-fold\n [coll n combinef reducef]\n ;;can't fold, single reduce\n (reduce reducef (combinef) coll))\n\n clojure.lang.IPersistentVector\n (coll-fold\n [v n combinef reducef]\n (foldvec v n combinef reducef))\n\n clojure.lang.PersistentHashMap\n (coll-fold\n [m n combinef reducef]\n (.fold m n combinef reducef fjinvoke fjtask fjfork fjjoin)))\n" }, { "path": "src/clj/clojure/core.clj", "content": "; Copyright (c) Rich Hickey. All rights reserved.\n; The use and distribution terms for this software are covered by the\n; Eclipse Public License 1.0 (http://opensource.org/licenses/eclipse-1.0.php)\n; which can be found in the file epl-v10.html at the root of this distribution.\n; By using this software in any fashion, you are agreeing to be bound by\n; the terms of this license.\n; You must not remove this notice, or any other, from this software.\n\n(ns ^{:doc \"The core Clojure language.\"\n :author \"Rich Hickey\"}\n clojure.core)\n\n(def unquote)\n(def unquote-splicing)\n\n(def\n ^{:arglists '([& items])\n :doc \"Creates a new list containing the items.\"\n :added \"1.0\"}\n list (. clojure.lang.PersistentList creator))\n\n(def\n ^{:arglists '([x seq])\n :doc \"Returns a new seq where x is the first element and seq is\n the rest.\"\n :added \"1.0\"\n :static true}\n\n cons (fn* ^:static cons [x seq] (. clojure.lang.RT (cons x seq))))\n\n;during bootstrap we don't have destructuring let, loop or fn, will redefine later\n(def\n ^{:macro true\n :added \"1.0\"}\n let (fn* let [&form &env & decl] (cons 'let* decl)))\n\n(def\n ^{:macro true\n :added \"1.0\"}\n loop (fn* loop [&form &env & decl] (cons 'loop* decl)))\n\n(def\n ^{:macro true\n :added \"1.0\"}\n fn (fn* fn [&form &env & decl] \n (.withMeta ^clojure.lang.IObj (cons 'fn* decl) \n (.meta ^clojure.lang.IMeta &form))))\n\n(def\n ^{:arglists '([coll])\n :doc \"Returns the first item in the collection. Calls seq on its\n argument. If coll is nil, returns nil.\"\n :added \"1.0\"\n :static true}\n first (fn ^:static first [coll] (. clojure.lang.RT (first coll))))\n\n(def\n ^{:arglists '([coll])\n :tag clojure.lang.ISeq\n :doc \"Returns a seq of the items after the first. Calls seq on its\n argument. If there are no more items, returns nil.\"\n :added \"1.0\"\n :static true} \n next (fn ^:static next [x] (. clojure.lang.RT (next x))))\n\n(def\n ^{:arglists '([coll])\n :tag clojure.lang.ISeq\n :doc \"Returns a possibly empty seq of the items after the first. Calls seq on its\n argument.\"\n :added \"1.0\"\n :static true} \n rest (fn ^:static rest [x] (. clojure.lang.RT (more x))))\n\n(def\n ^{:arglists '([coll x] [coll x & xs])\n :doc \"conj[oin]. Returns a new collection with the xs\n 'added'. (conj nil item) returns (item). The 'addition' may\n happen at different 'places' depending on the concrete type.\"\n :added \"1.0\"\n :static true}\n conj (fn ^:static conj\n ([] [])\n ([coll] coll)\n ([coll x] (. clojure.lang.RT (conj coll x)))\n ([coll x & xs]\n (if xs\n (recur (conj coll x) (first xs) (next xs))\n (conj coll x)))))\n\n(def\n ^{:doc \"Same as (first (next x))\"\n :arglists '([x])\n :added \"1.0\"\n :static true}\n second (fn ^:static second [x] (first (next x))))\n\n(def\n ^{:doc \"Same as (first (first x))\"\n :arglists '([x])\n :added \"1.0\"\n :static true}\n ffirst (fn ^:static ffirst [x] (first (first x))))\n\n(def\n ^{:doc \"Same as (next (first x))\"\n :arglists '([x])\n :added \"1.0\"\n :static true}\n nfirst (fn ^:static nfirst [x] (next (first x))))\n\n(def\n ^{:doc \"Same as (first (next x))\"\n :arglists '([x])\n :added \"1.0\"\n :static true}\n fnext (fn ^:static fnext [x] (first (next x))))\n\n(def\n ^{:doc \"Same as (next (next x))\"\n :arglists '([x])\n :added \"1.0\"\n :static true}\n nnext (fn ^:static nnext [x] (next (next x))))\n\n(def\n ^{:arglists '(^clojure.lang.ISeq [coll])\n :doc \"Returns a seq on the collection. If the collection is\n empty, returns nil. (seq nil) returns nil. seq also works on\n Strings, native Java arrays (of reference types) and any objects\n that implement Iterable. Note that seqs cache values, thus seq\n should not be used on any Iterable whose iterator repeatedly\n returns the same mutable object.\"\n :tag clojure.lang.ISeq\n :added \"1.0\"\n :static true}\n seq (fn ^:static seq ^clojure.lang.ISeq [coll] (. clojure.lang.RT (seq coll))))\n\n(def\n ^{:arglists '([^Class c x])\n :doc \"Evaluates x and tests if it is an instance of the class\n c. Returns true or false\"\n :added \"1.0\"}\n instance? (fn instance? [^Class c x] (. c (isInstance x))))\n\n(def\n ^{:arglists '([x])\n :doc \"Return true if x implements ISeq\"\n :added \"1.0\"\n :static true}\n seq? (fn ^:static seq? [x] (instance? clojure.lang.ISeq x)))\n\n(def\n ^{:arglists '([x])\n :doc \"Return true if x is a Character\"\n :added \"1.0\"\n :static true}\n char? (fn ^:static char? [x] (instance? Character x)))\n\n(def\n ^{:arglists '([x])\n :doc \"Return true if x is a String\"\n :added \"1.0\"\n :static true}\n string? (fn ^:static string? [x] (instance? String x)))\n\n(def\n ^{:arglists '([x])\n :doc \"Return true if x implements IPersistentMap\"\n :added \"1.0\"\n :static true}\n map? (fn ^:static map? [x] (instance? clojure.lang.IPersistentMap x)))\n\n(def\n ^{:arglists '([x])\n :doc \"Return true if x implements IPersistentVector\"\n :added \"1.0\"\n :static true}\n vector? (fn ^:static vector? [x] (instance? clojure.lang.IPersistentVector x)))\n\n(def\n ^{:arglists '([map key val] [map key val & kvs])\n :doc \"assoc[iate]. When applied to a map, returns a new map of the\n same (hashed/sorted) type, that contains the mapping of key(s) to\n val(s). When applied to a vector, returns a new vector that\n contains val at index. Note - index must be <= (count vector).\"\n :added \"1.0\"\n :static true}\n assoc\n (fn ^:static assoc\n ([map key val] (. clojure.lang.RT (assoc map key val)))\n ([map key val & kvs]\n (let [ret (assoc map key val)]\n (if kvs\n (if (next kvs)\n (recur ret (first kvs) (second kvs) (nnext kvs))\n (throw (IllegalArgumentException.\n \"assoc expects even number of arguments after map/vector, found odd number\")))\n ret)))))\n\n;;;;;;;;;;;;;;;;; metadata ;;;;;;;;;;;;;;;;;;;;;;;;;;;\n(def\n ^{:arglists '([obj])\n :doc \"Returns the metadata of obj, returns nil if there is no metadata.\"\n :added \"1.0\"\n :static true}\n meta (fn ^:static meta [x]\n (if (instance? clojure.lang.IMeta x)\n (. ^clojure.lang.IMeta x (meta)))))\n\n(def\n ^{:arglists '([^clojure.lang.IObj obj m])\n :doc \"Returns an object of the same type and value as obj, with\n map m as its metadata.\"\n :added \"1.0\"\n :static true}\n with-meta (fn ^:static with-meta [^clojure.lang.IObj x m]\n (. x (withMeta m))))\n\n(def ^{:private true :dynamic true}\n assert-valid-fdecl (fn [fdecl]))\n\n(def\n ^{:private true}\n sigs\n (fn [fdecl]\n (assert-valid-fdecl fdecl)\n (let [asig\n (fn [fdecl]\n (let [arglist (first fdecl)\n ;elide implicit macro args\n arglist (if (clojure.lang.Util/equals '&form (first arglist))\n (clojure.lang.RT/subvec arglist 2 (clojure.lang.RT/count arglist))\n arglist)\n body (next fdecl)]\n (if (map? (first body))\n (if (next body)\n (with-meta arglist (conj (if (meta arglist) (meta arglist) {}) (first body)))\n arglist)\n arglist)))]\n (if (seq? (first fdecl))\n (loop [ret [] fdecls fdecl]\n (if fdecls\n (recur (conj ret (asig (first fdecls))) (next fdecls))\n (seq ret)))\n (list (asig fdecl))))))\n\n\n(def \n ^{:arglists '([coll])\n :doc \"Return the last item in coll, in linear time\"\n :added \"1.0\"\n :static true}\n last (fn ^:static last [s]\n (if (next s)\n (recur (next s))\n (first s))))\n\n(def \n ^{:arglists '([coll])\n :doc \"Return a seq of all but the last item in coll, in linear time\"\n :added \"1.0\"\n :static true}\n butlast (fn ^:static butlast [s]\n (loop [ret [] s s]\n (if (next s)\n (recur (conj ret (first s)) (next s))\n (seq ret)))))\n\n(def \n\n ^{:doc \"Same as (def name (fn [params* ] exprs*)) or (def\n name (fn ([params* ] exprs*)+)) with any doc-string or attrs added\n to the var metadata. prepost-map defines a map with optional keys\n :pre and :post that contain collections of pre or post conditions.\"\n :arglists '([name doc-string? attr-map? [params*] prepost-map? body]\n [name doc-string? attr-map? ([params*] prepost-map? body)+ attr-map?])\n :added \"1.0\"\n :macro true}\n defn (fn defn [&form &env name & fdecl]\n ;; Note: Cannot delegate this check to def because of the call to (with-meta name ..)\n (if (instance? clojure.lang.Symbol name)\n nil\n (throw (IllegalArgumentException. \"First argument to defn must be a symbol\")))\n (let [m (if (string? (first fdecl))\n {:doc (first fdecl)}\n {})\n fdecl (if (string? (first fdecl))\n (next fdecl)\n fdecl)\n m (if (map? (first fdecl))\n (conj m (first fdecl))\n m)\n fdecl (if (map? (first fdecl))\n (next fdecl)\n fdecl)\n fdecl (if (vector? (first fdecl))\n (list fdecl)\n fdecl)\n m (if (map? (last fdecl))\n (conj m (last fdecl))\n m)\n fdecl (if (map? (last fdecl))\n (butlast fdecl)\n fdecl)\n m (conj {:arglists (list 'quote (sigs fdecl))} m)\n m (let [inline (:inline m)\n ifn (first inline)\n iname (second inline)]\n ;; same as: (if (and (= 'fn ifn) (not (symbol? iname))) ...)\n (if (if (clojure.lang.Util/equiv 'fn ifn)\n (if (instance? clojure.lang.Symbol iname) false true))\n ;; inserts the same fn name to the inline fn if it does not have one\n (assoc m :inline (cons ifn (cons (clojure.lang.Symbol/intern (.concat (.getName ^clojure.lang.Symbol name) \"__inliner\"))\n (next inline))))\n m))\n m (conj (if (meta name) (meta name) {}) m)]\n (list 'def (with-meta name m)\n ;;todo - restore propagation of fn name\n ;;must figure out how to convey primitive hints to self calls first\n (cons `fn fdecl) ))))\n\n(defn to-array\n \"Returns an array of Objects containing the contents of coll, which\n can be any Collection. Maps to java.util.Collection.toArray().\"\n {:tag \"[Ljava.lang.Object;\"\n :added \"1.0\"\n :static true}\n [coll] (. clojure.lang.RT (toArray coll)))\n\n(defn cast\n \"Throws a ClassCastException if x is not a c, else returns x.\"\n {:added \"1.0\"\n :static true}\n [^Class c x] \n (. c (cast x)))\n \n(defn vector\n \"Creates a new vector containing the args.\"\n {:added \"1.0\"\n :static true}\n ([] [])\n ([a] [a])\n ([a b] [a b])\n ([a b c] [a b c])\n ([a b c d] [a b c d])\n ([a b c d & args]\n (. clojure.lang.LazilyPersistentVector (create (cons a (cons b (cons c (cons d args))))))))\n\n(defn vec\n \"Creates a new vector containing the contents of coll. Java arrays\n will be aliased and should not be modified.\"\n {:added \"1.0\"\n :static true}\n ([coll]\n (if (vector? coll)\n (if (instance? clojure.lang.IObj coll)\n (with-meta coll nil)\n (clojure.lang.LazilyPersistentVector/create coll))\n (clojure.lang.LazilyPersistentVector/create coll))))\n\n(defn hash-map\n \"keyval => key val\n Returns a new hash map with supplied mappings. If any keys are\n equal, they are handled as if by repeated uses of assoc.\"\n {:added \"1.0\"\n :static true}\n ([] {})\n ([& keyvals]\n (. clojure.lang.PersistentHashMap (create keyvals))))\n\n(defn hash-set\n \"Returns a new hash set with supplied keys. Any equal keys are\n handled as if by repeated uses of conj.\"\n {:added \"1.0\"\n :static true}\n ([] #{})\n ([& keys]\n (clojure.lang.PersistentHashSet/create keys)))\n\n(defn sorted-map\n \"keyval => key val\n Returns a new sorted map with supplied mappings. If any keys are\n equal, they are handled as if by repeated uses of assoc.\"\n {:added \"1.0\"\n :static true}\n ([& keyvals]\n (clojure.lang.PersistentTreeMap/create keyvals)))\n\n(defn sorted-map-by\n \"keyval => key val\n Returns a new sorted map with supplied mappings, using the supplied\n comparator. If any keys are equal, they are handled as if by\n repeated uses of assoc.\"\n {:added \"1.0\"\n :static true}\n ([comparator & keyvals]\n (clojure.lang.PersistentTreeMap/create comparator keyvals)))\n\n(defn sorted-set\n \"Returns a new sorted set with supplied keys. Any equal keys are\n handled as if by repeated uses of conj.\"\n {:added \"1.0\"\n :static true}\n ([& keys]\n (clojure.lang.PersistentTreeSet/create keys)))\n\n(defn sorted-set-by\n \"Returns a new sorted set with supplied keys, using the supplied\n comparator. Any equal keys are handled as if by repeated uses of\n conj.\"\n {:added \"1.1\"\n :static true} \n ([comparator & keys]\n (clojure.lang.PersistentTreeSet/create comparator keys)))\n\n \n;;;;;;;;;;;;;;;;;;;;\n(defn nil?\n \"Returns true if x is nil, false otherwise.\"\n {:tag Boolean\n :added \"1.0\"\n :static true\n :inline (fn [x] (list 'clojure.lang.Util/identical x nil))}\n [x] (clojure.lang.Util/identical x nil))\n\n(def\n\n ^{:doc \"Like defn, but the resulting function name is declared as a\n macro and will be used as a macro by the compiler when it is\n called.\"\n :arglists '([name doc-string? attr-map? [params*] body]\n [name doc-string? attr-map? ([params*] body)+ attr-map?])\n :added \"1.0\"\n :macro true}\n defmacro (fn [&form &env\n name & args]\n (let [prefix (loop [p (list name) args args]\n (let [f (first args)]\n (if (string? f)\n (recur (cons f p) (next args))\n (if (map? f)\n (recur (cons f p) (next args))\n p))))\n fdecl (loop [fd args]\n (if (string? (first fd))\n (recur (next fd))\n (if (map? (first fd))\n (recur (next fd))\n fd)))\n fdecl (if (vector? (first fdecl))\n (list fdecl)\n fdecl)\n add-implicit-args (fn [fd]\n (let [args (first fd)]\n (cons (vec (cons '&form (cons '&env args))) (next fd))))\n add-args (fn [acc ds]\n (if (nil? ds)\n acc\n (let [d (first ds)]\n (if (map? d)\n (conj acc d)\n (recur (conj acc (add-implicit-args d)) (next ds))))))\n fdecl (seq (add-args [] fdecl))\n decl (loop [p prefix d fdecl]\n (if p\n (recur (next p) (cons (first p) d))\n d))\n sym (with-meta (first decl) (assoc (meta (first decl)) :macro true))\n decl (cons sym (next decl))]\n (cons `defn decl))))\n\n(defmacro when\n \"Evaluates test. If logical true, evaluates body in an implicit do.\"\n {:added \"1.0\"}\n [test & body]\n (list 'if test (cons 'do body)))\n\n(defmacro when-not\n \"Evaluates test. If logical false, evaluates body in an implicit do.\"\n {:added \"1.0\"}\n [test & body]\n (list 'if test nil (cons 'do body)))\n\n(defn false?\n \"Returns true if x is the value false, false otherwise.\"\n {:tag Boolean,\n :added \"1.0\"\n :static true}\n [x] (clojure.lang.Util/identical x false))\n\n(defn true?\n \"Returns true if x is the value true, false otherwise.\"\n {:tag Boolean,\n :added \"1.0\"\n :static true}\n [x] (clojure.lang.Util/identical x true))\n\n(defn not\n \"Returns true if x is logical false, false otherwise.\"\n {:tag Boolean\n :added \"1.0\"\n :static true}\n [x] (if x false true))\n\n(defn some?\n \"Returns true if x is not nil, false otherwise.\"\n {:tag Boolean\n :added \"1.6\"\n :static true}\n [x] (not (nil? x)))\n\n(defn str\n \"With no args, returns the empty string. With one arg x, returns\n x.toString(). (str nil) returns the empty string. With more than\n one arg, returns the concatenation of the str values of the args.\"\n {:tag String\n :added \"1.0\"\n :static true}\n (^String [] \"\")\n (^String [^Object x]\n (if (nil? x) \"\" (. x (toString))))\n (^String [x & ys]\n ((fn [^StringBuilder sb more]\n (if more\n (recur (. sb (append (str (first more)))) (next more))\n (str sb)))\n (new StringBuilder (str x)) ys)))\n\n\n(defn symbol?\n \"Return true if x is a Symbol\"\n {:added \"1.0\"\n :static true}\n [x] (instance? clojure.lang.Symbol x))\n\n(defn keyword?\n \"Return true if x is a Keyword\"\n {:added \"1.0\"\n :static true}\n [x] (instance? clojure.lang.Keyword x))\n\n(defn symbol\n \"Returns a Symbol with the given namespace and name.\"\n {:tag clojure.lang.Symbol\n :added \"1.0\"\n :static true}\n ([name] (if (symbol? name) name (clojure.lang.Symbol/intern name)))\n ([ns name] (clojure.lang.Symbol/intern ns name)))\n\n(defn gensym\n \"Returns a new symbol with a unique name. If a prefix string is\n supplied, the name is prefix# where # is some unique number. If\n prefix is not supplied, the prefix is 'G__'.\"\n {:added \"1.0\"\n :static true}\n ([] (gensym \"G__\"))\n ([prefix-string] (. clojure.lang.Symbol (intern (str prefix-string (str (. clojure.lang.RT (nextID))))))))\n\n(defmacro cond\n \"Takes a set of test/expr pairs. It evaluates each test one at a\n time. If a test returns logical true, cond evaluates and returns\n the value of the corresponding expr and doesn't evaluate any of the\n other tests or exprs. (cond) returns nil.\"\n {:added \"1.0\"}\n [& clauses]\n (when clauses\n (list 'if (first clauses)\n (if (next clauses)\n (second clauses)\n (throw (IllegalArgumentException.\n \"cond requires an even number of forms\")))\n (cons 'clojure.core/cond (next (next clauses))))))\n\n(defn keyword\n \"Returns a Keyword with the given namespace and name. Do not use :\n in the keyword strings, it will be added automatically.\"\n {:tag clojure.lang.Keyword\n :added \"1.0\"\n :static true}\n ([name] (cond (keyword? name) name\n (symbol? name) (clojure.lang.Keyword/intern ^clojure.lang.Symbol name)\n (string? name) (clojure.lang.Keyword/intern ^String name)))\n ([ns name] (clojure.lang.Keyword/intern ns name)))\n\n(defn find-keyword\n \"Returns a Keyword with the given namespace and name if one already\n exists. This function will not intern a new keyword. If the keyword\n has not already been interned, it will return nil. Do not use :\n in the keyword strings, it will be added automatically.\"\n {:tag clojure.lang.Keyword\n :added \"1.3\"\n :static true}\n ([name] (cond (keyword? name) name\n (symbol? name) (clojure.lang.Keyword/find ^clojure.lang.Symbol name)\n (string? name) (clojure.lang.Keyword/find ^String name)))\n ([ns name] (clojure.lang.Keyword/find ns name)))\n\n\n(defn spread\n {:private true\n :static true}\n [arglist]\n (cond\n (nil? arglist) nil\n (nil? (next arglist)) (seq (first arglist))\n :else (cons (first arglist) (spread (next arglist)))))\n\n(defn list*\n \"Creates a new list containing the items prepended to the rest, the\n last of which will be treated as a sequence.\"\n {:added \"1.0\"\n :static true}\n ([args] (seq args))\n ([a args] (cons a args))\n ([a b args] (cons a (cons b args)))\n ([a b c args] (cons a (cons b (cons c args))))\n ([a b c d & more]\n (cons a (cons b (cons c (cons d (spread more)))))))\n\n(defn apply\n \"Applies fn f to the argument list formed by prepending intervening arguments to args.\"\n {:added \"1.0\"\n :static true}\n ([^clojure.lang.IFn f args]\n (. f (applyTo (seq args))))\n ([^clojure.lang.IFn f x args]\n (. f (applyTo (list* x args))))\n ([^clojure.lang.IFn f x y args]\n (. f (applyTo (list* x y args))))\n ([^clojure.lang.IFn f x y z args]\n (. f (applyTo (list* x y z args))))\n ([^clojure.lang.IFn f a b c d & args]\n (. f (applyTo (cons a (cons b (cons c (cons d (spread args)))))))))\n\n(defn vary-meta\n \"Returns an object of the same type and value as obj, with\n (apply f (meta obj) args) as its metadata.\"\n {:added \"1.0\"\n :static true}\n [obj f & args]\n (with-meta obj (apply f (meta obj) args)))\n\n(defmacro lazy-seq\n \"Takes a body of expressions that returns an ISeq or nil, and yields\n a Seqable object that will invoke the body only the first time seq\n is called, and will cache the result and return it on all subsequent\n seq calls. See also - realized?\"\n {:added \"1.0\"}\n [& body]\n (list 'new 'clojure.lang.LazySeq (list* '^{:once true} fn* [] body)))\n\n(defn ^:static ^clojure.lang.ChunkBuffer chunk-buffer ^clojure.lang.ChunkBuffer [capacity]\n (clojure.lang.ChunkBuffer. capacity))\n\n(defn ^:static chunk-append [^clojure.lang.ChunkBuffer b x]\n (.add b x))\n\n(defn ^:static ^clojure.lang.IChunk chunk [^clojure.lang.ChunkBuffer b]\n (.chunk b))\n\n(defn ^:static ^clojure.lang.IChunk chunk-first ^clojure.lang.IChunk [^clojure.lang.IChunkedSeq s]\n (.chunkedFirst s))\n\n(defn ^:static ^clojure.lang.ISeq chunk-rest ^clojure.lang.ISeq [^clojure.lang.IChunkedSeq s]\n (.chunkedMore s))\n\n(defn ^:static ^clojure.lang.ISeq chunk-next ^clojure.lang.ISeq [^clojure.lang.IChunkedSeq s]\n (.chunkedNext s))\n\n(defn ^:static chunk-cons [chunk rest]\n (if (clojure.lang.Numbers/isZero (clojure.lang.RT/count chunk))\n rest\n (clojure.lang.ChunkedCons. chunk rest)))\n\n(defn ^:static chunked-seq? [s]\n (instance? clojure.lang.IChunkedSeq s))\n\n(defn concat\n \"Returns a lazy seq representing the concatenation of the elements in the supplied colls.\"\n {:added \"1.0\"\n :static true}\n ([] (lazy-seq nil))\n ([x] (lazy-seq x))\n ([x y]\n (lazy-seq\n (let [s (seq x)]\n (if s\n (if (chunked-seq? s)\n (chunk-cons (chunk-first s) (concat (chunk-rest s) y))\n (cons (first s) (concat (rest s) y)))\n y))))\n ([x y & zs]\n (let [cat (fn cat [xys zs]\n (lazy-seq\n (let [xys (seq xys)]\n (if xys\n (if (chunked-seq? xys)\n (chunk-cons (chunk-first xys)\n (cat (chunk-rest xys) zs))\n (cons (first xys) (cat (rest xys) zs)))\n (when zs\n (cat (first zs) (next zs)))))))]\n (cat (concat x y) zs))))\n\n;;;;;;;;;;;;;;;;at this point all the support for syntax-quote exists;;;;;;;;;;;;;;;;;;;;;;\n(defmacro delay\n \"Takes a body of expressions and yields a Delay object that will\n invoke the body only the first time it is forced (with force or deref/@), and\n will cache the result and return it on all subsequent force\n calls. See also - realized?\"\n {:added \"1.0\"}\n [& body]\n (list 'new 'clojure.lang.Delay (list* `^{:once true} fn* [] body)))\n\n(defn delay?\n \"returns true if x is a Delay created with delay\"\n {:added \"1.0\"\n :static true}\n [x] (instance? clojure.lang.Delay x))\n\n(defn force\n \"If x is a Delay, returns the (possibly cached) value of its expression, else returns x\"\n {:added \"1.0\"\n :static true}\n [x] (. clojure.lang.Delay (force x)))\n\n(defmacro if-not\n \"Evaluates test. If logical false, evaluates and returns then expr,\n otherwise else expr, if supplied, else nil.\"\n {:added \"1.0\"}\n ([test then] `(if-not ~test ~then nil))\n ([test then else]\n `(if (not ~test) ~then ~else)))\n\n(defn identical?\n \"Tests if 2 arguments are the same object\"\n {:inline (fn [x y] `(. clojure.lang.Util identical ~x ~y))\n :inline-arities #{2}\n :added \"1.0\"}\n ([x y] (clojure.lang.Util/identical x y)))\n\n;equiv-based\n(defn =\n \"Equality. Returns true if x equals y, false if not. Same as\n Java x.equals(y) except it also works for nil, and compares\n numbers and collections in a type-independent manner. Clojure's immutable data\n structures define equals() (and thus =) as a value, not an identity,\n comparison.\"\n {:inline (fn [x y] `(. clojure.lang.Util equiv ~x ~y))\n :inline-arities #{2}\n :added \"1.0\"}\n ([x] true)\n ([x y] (clojure.lang.Util/equiv x y))\n ([x y & more]\n (if (clojure.lang.Util/equiv x y)\n (if (next more)\n (recur y (first more) (next more))\n (clojure.lang.Util/equiv y (first more)))\n false)))\n\n;equals-based\n#_(defn =\n \"Equality. Returns true if x equals y, false if not. Same as Java\n x.equals(y) except it also works for nil. Boxed numbers must have\n same type. Clojure's immutable data structures define equals() (and\n thus =) as a value, not an identity, comparison.\"\n {:inline (fn [x y] `(. clojure.lang.Util equals ~x ~y))\n :inline-arities #{2}\n :added \"1.0\"}\n ([x] true)\n ([x y] (clojure.lang.Util/equals x y))\n ([x y & more]\n (if (= x y)\n (if (next more)\n (recur y (first more) (next more))\n (= y (first more)))\n false)))\n\n(defn not=\n \"Same as (not (= obj1 obj2))\"\n {:tag Boolean\n :added \"1.0\"\n :static true}\n ([x] false)\n ([x y] (not (= x y)))\n ([x y & more]\n (not (apply = x y more))))\n\n\n\n(defn compare\n \"Comparator. Returns a negative number, zero, or a positive number\n when x is logically 'less than', 'equal to', or 'greater than'\n y. Same as Java x.compareTo(y) except it also works for nil, and\n compares numbers and collections in a type-independent manner. x\n must implement Comparable\"\n {\n :inline (fn [x y] `(. clojure.lang.Util compare ~x ~y))\n :added \"1.0\"}\n [x y] (. clojure.lang.Util (compare x y)))\n\n(defmacro and\n \"Evaluates exprs one at a time, from left to right. If a form\n returns logical false (nil or false), and returns that value and\n doesn't evaluate any of the other expressions, otherwise it returns\n the value of the last expr. (and) returns true.\"\n {:added \"1.0\"}\n ([] true)\n ([x] x)\n ([x & next]\n `(let [and# ~x]\n (if and# (and ~@next) and#))))\n\n(defmacro or\n \"Evaluates exprs one at a time, from left to right. If a form\n returns a logical true value, or returns that value and doesn't\n evaluate any of the other expressions, otherwise it returns the\n value of the last expression. (or) returns nil.\"\n {:added \"1.0\"}\n ([] nil)\n ([x] x)\n ([x & next]\n `(let [or# ~x]\n (if or# or# (or ~@next)))))\n\n;;;;;;;;;;;;;;;;;;; sequence fns ;;;;;;;;;;;;;;;;;;;;;;;\n(defn zero?\n \"Returns true if num is zero, else false\"\n {\n :inline (fn [x] `(. clojure.lang.Numbers (isZero ~x)))\n :added \"1.0\"}\n [x] (. clojure.lang.Numbers (isZero x)))\n\n(defn count\n \"Returns the number of items in the collection. (count nil) returns\n 0. Also works on strings, arrays, and Java Collections and Maps\"\n {\n :inline (fn [x] `(. clojure.lang.RT (count ~x)))\n :added \"1.0\"}\n [coll] (clojure.lang.RT/count coll))\n\n(defn int\n \"Coerce to int\"\n {\n :inline (fn [x] `(. clojure.lang.RT (~(if *unchecked-math* 'uncheckedIntCast 'intCast) ~x)))\n :added \"1.0\"}\n [x] (. clojure.lang.RT (intCast x)))\n\n(defn nth\n \"Returns the value at the index. get returns nil if index out of\n bounds, nth throws an exception unless not-found is supplied. nth\n also works for strings, Java arrays, regex Matchers and Lists, and,\n in O(n) time, for sequences.\"\n {:inline (fn [c i & nf] `(. clojure.lang.RT (nth ~c ~i ~@nf)))\n :inline-arities #{2 3}\n :added \"1.0\"}\n ([coll index] (. clojure.lang.RT (nth coll index)))\n ([coll index not-found] (. clojure.lang.RT (nth coll index not-found))))\n\n(defn <\n \"Returns non-nil if nums are in monotonically increasing order,\n otherwise false.\"\n {:inline (fn [x y] `(. clojure.lang.Numbers (lt ~x ~y)))\n :inline-arities #{2}\n :added \"1.0\"}\n ([x] true)\n ([x y] (. clojure.lang.Numbers (lt x y)))\n ([x y & more]\n (if (< x y)\n (if (next more)\n (recur y (first more) (next more))\n (< y (first more)))\n false)))\n\n(defn inc'\n \"Returns a number one greater than num. Supports arbitrary precision.\n See also: inc\"\n {:inline (fn [x] `(. clojure.lang.Numbers (incP ~x)))\n :added \"1.0\"}\n [x] (. clojure.lang.Numbers (incP x)))\n\n(defn inc\n \"Returns a number one greater than num. Does not auto-promote\n longs, will throw on overflow. See also: inc'\"\n {:inline (fn [x] `(. clojure.lang.Numbers (~(if *unchecked-math* 'unchecked_inc 'inc) ~x)))\n :added \"1.2\"}\n [x] (. clojure.lang.Numbers (inc x)))\n\n;; reduce is defined again later after InternalReduce loads\n(defn ^:private ^:static\n reduce1\n ([f coll]\n (let [s (seq coll)]\n (if s\n (reduce1 f (first s) (next s))\n (f))))\n ([f val coll]\n (let [s (seq coll)]\n (if s\n (if (chunked-seq? s)\n (recur f\n (.reduce (chunk-first s) f val)\n (chunk-next s))\n (recur f (f val (first s)) (next s)))\n val))))\n\n(defn reverse\n \"Returns a seq of the items in coll in reverse order. Not lazy.\"\n {:added \"1.0\"\n :static true}\n [coll]\n (reduce1 conj () coll))\n\n;;math stuff\n(defn ^:private nary-inline\n ([op] (nary-inline op op))\n ([op unchecked-op]\n (fn\n ([x] (let [op (if *unchecked-math* unchecked-op op)]\n `(. clojure.lang.Numbers (~op ~x))))\n ([x y] (let [op (if *unchecked-math* unchecked-op op)]\n `(. clojure.lang.Numbers (~op ~x ~y))))\n ([x y & more]\n (let [op (if *unchecked-math* unchecked-op op)]\n (reduce1\n (fn [a b] `(. clojure.lang.Numbers (~op ~a ~b)))\n `(. clojure.lang.Numbers (~op ~x ~y)) more))))))\n\n(defn ^:private >1? [n] (clojure.lang.Numbers/gt n 1))\n(defn ^:private >0? [n] (clojure.lang.Numbers/gt n 0))\n\n(defn +'\n \"Returns the sum of nums. (+) returns 0. Supports arbitrary precision.\n See also: +\"\n {:inline (nary-inline 'addP)\n :inline-arities >1?\n :added \"1.0\"}\n ([] 0)\n ([x] (cast Number x))\n ([x y] (. clojure.lang.Numbers (addP x y)))\n ([x y & more]\n (reduce1 +' (+' x y) more)))\n\n(defn +\n \"Returns the sum of nums. (+) returns 0. Does not auto-promote\n longs, will throw on overflow. See also: +'\"\n {:inline (nary-inline 'add 'unchecked_add)\n :inline-arities >1?\n :added \"1.2\"}\n ([] 0)\n ([x] (cast Number x))\n ([x y] (. clojure.lang.Numbers (add x y)))\n ([x y & more]\n (reduce1 + (+ x y) more)))\n\n(defn *'\n \"Returns the product of nums. (*) returns 1. Supports arbitrary precision.\n See also: *\"\n {:inline (nary-inline 'multiplyP)\n :inline-arities >1?\n :added \"1.0\"}\n ([] 1)\n ([x] (cast Number x))\n ([x y] (. clojure.lang.Numbers (multiplyP x y)))\n ([x y & more]\n (reduce1 *' (*' x y) more)))\n\n(defn *\n \"Returns the product of nums. (*) returns 1. Does not auto-promote\n longs, will throw on overflow. See also: *'\"\n {:inline (nary-inline 'multiply 'unchecked_multiply)\n :inline-arities >1?\n :added \"1.2\"}\n ([] 1)\n ([x] (cast Number x))\n ([x y] (. clojure.lang.Numbers (multiply x y)))\n ([x y & more]\n (reduce1 * (* x y) more)))\n\n(defn /\n \"If no denominators are supplied, returns 1/numerator,\n else returns numerator divided by all of the denominators.\"\n {:inline (nary-inline 'divide)\n :inline-arities >1?\n :added \"1.0\"}\n ([x] (/ 1 x))\n ([x y] (. clojure.lang.Numbers (divide x y)))\n ([x y & more]\n (reduce1 / (/ x y) more)))\n\n(defn -'\n \"If no ys are supplied, returns the negation of x, else subtracts\n the ys from x and returns the result. Supports arbitrary precision.\n See also: -\"\n {:inline (nary-inline 'minusP)\n :inline-arities >0?\n :added \"1.0\"}\n ([x] (. clojure.lang.Numbers (minusP x)))\n ([x y] (. clojure.lang.Numbers (minusP x y)))\n ([x y & more]\n (reduce1 -' (-' x y) more)))\n\n(defn -\n \"If no ys are supplied, returns the negation of x, else subtracts\n the ys from x and returns the result. Does not auto-promote\n longs, will throw on overflow. See also: -'\"\n {:inline (nary-inline 'minus 'unchecked_minus)\n :inline-arities >0?\n :added \"1.2\"}\n ([x] (. clojure.lang.Numbers (minus x)))\n ([x y] (. clojure.lang.Numbers (minus x y)))\n ([x y & more]\n (reduce1 - (- x y) more)))\n\n(defn <=\n \"Returns non-nil if nums are in monotonically non-decreasing order,\n otherwise false.\"\n {:inline (fn [x y] `(. clojure.lang.Numbers (lte ~x ~y)))\n :inline-arities #{2}\n :added \"1.0\"}\n ([x] true)\n ([x y] (. clojure.lang.Numbers (lte x y)))\n ([x y & more]\n (if (<= x y)\n (if (next more)\n (recur y (first more) (next more))\n (<= y (first more)))\n false)))\n\n(defn >\n \"Returns non-nil if nums are in monotonically decreasing order,\n otherwise false.\"\n {:inline (fn [x y] `(. clojure.lang.Numbers (gt ~x ~y)))\n :inline-arities #{2}\n :added \"1.0\"}\n ([x] true)\n ([x y] (. clojure.lang.Numbers (gt x y)))\n ([x y & more]\n (if (> x y)\n (if (next more)\n (recur y (first more) (next more))\n (> y (first more)))\n false)))\n\n(defn >=\n \"Returns non-nil if nums are in monotonically non-increasing order,\n otherwise false.\"\n {:inline (fn [x y] `(. clojure.lang.Numbers (gte ~x ~y)))\n :inline-arities #{2}\n :added \"1.0\"}\n ([x] true)\n ([x y] (. clojure.lang.Numbers (gte x y)))\n ([x y & more]\n (if (>= x y)\n (if (next more)\n (recur y (first more) (next more))\n (>= y (first more)))\n false)))\n\n(defn ==\n \"Returns non-nil if nums all have the equivalent\n value (type-independent), otherwise false\"\n {:inline (fn [x y] `(. clojure.lang.Numbers (equiv ~x ~y)))\n :inline-arities #{2}\n :added \"1.0\"}\n ([x] true)\n ([x y] (. clojure.lang.Numbers (equiv x y)))\n ([x y & more]\n (if (== x y)\n (if (next more)\n (recur y (first more) (next more))\n (== y (first more)))\n false)))\n\n(defn max\n \"Returns the greatest of the nums.\"\n {:added \"1.0\"\n :inline-arities >1?\n :inline (nary-inline 'max)}\n ([x] x)\n ([x y] (. clojure.lang.Numbers (max x y)))\n ([x y & more]\n (reduce1 max (max x y) more)))\n\n(defn min\n \"Returns the least of the nums.\"\n {:added \"1.0\"\n :inline-arities >1?\n :inline (nary-inline 'min)}\n ([x] x)\n ([x y] (. clojure.lang.Numbers (min x y)))\n ([x y & more]\n (reduce1 min (min x y) more)))\n\n(defn dec'\n \"Returns a number one less than num. Supports arbitrary precision.\n See also: dec\"\n {:inline (fn [x] `(. clojure.lang.Numbers (decP ~x)))\n :added \"1.0\"}\n [x] (. clojure.lang.Numbers (decP x)))\n\n(defn dec\n \"Returns a number one less than num. Does not auto-promote\n longs, will throw on overflow. See also: dec'\"\n {:inline (fn [x] `(. clojure.lang.Numbers (~(if *unchecked-math* 'unchecked_dec 'dec) ~x)))\n :added \"1.2\"}\n [x] (. clojure.lang.Numbers (dec x)))\n\n(defn unchecked-inc-int\n \"Returns a number one greater than x, an int.\n Note - uses a primitive operator subject to overflow.\"\n {:inline (fn [x] `(. clojure.lang.Numbers (unchecked_int_inc ~x)))\n :added \"1.0\"}\n [x] (. clojure.lang.Numbers (unchecked_int_inc x)))\n\n(defn unchecked-inc\n \"Returns a number one greater than x, a long.\n Note - uses a primitive operator subject to overflow.\"\n {:inline (fn [x] `(. clojure.lang.Numbers (unchecked_inc ~x)))\n :added \"1.0\"}\n [x] (. clojure.lang.Numbers (unchecked_inc x)))\n\n(defn unchecked-dec-int\n \"Returns a number one less than x, an int.\n Note - uses a primitive operator subject to overflow.\"\n {:inline (fn [x] `(. clojure.lang.Numbers (unchecked_int_dec ~x)))\n :added \"1.0\"}\n [x] (. clojure.lang.Numbers (unchecked_int_dec x)))\n\n(defn unchecked-dec\n \"Returns a number one less than x, a long.\n Note - uses a primitive operator subject to overflow.\"\n {:inline (fn [x] `(. clojure.lang.Numbers (unchecked_dec ~x)))\n :added \"1.0\"}\n [x] (. clojure.lang.Numbers (unchecked_dec x)))\n\n(defn unchecked-negate-int\n \"Returns the negation of x, an int.\n Note - uses a primitive operator subject to overflow.\"\n {:inline (fn [x] `(. clojure.lang.Numbers (unchecked_int_negate ~x)))\n :added \"1.0\"}\n [x] (. clojure.lang.Numbers (unchecked_int_negate x)))\n\n(defn unchecked-negate\n \"Returns the negation of x, a long.\n Note - uses a primitive operator subject to overflow.\"\n {:inline (fn [x] `(. clojure.lang.Numbers (unchecked_minus ~x)))\n :added \"1.0\"}\n [x] (. clojure.lang.Numbers (unchecked_minus x)))\n\n(defn unchecked-add-int\n \"Returns the sum of x and y, both int.\n Note - uses a primitive operator subject to overflow.\"\n {:inline (fn [x y] `(. clojure.lang.Numbers (unchecked_int_add ~x ~y)))\n :added \"1.0\"}\n [x y] (. clojure.lang.Numbers (unchecked_int_add x y)))\n\n(defn unchecked-add\n \"Returns the sum of x and y, both long.\n Note - uses a primitive operator subject to overflow.\"\n {:inline (fn [x y] `(. clojure.lang.Numbers (unchecked_add ~x ~y)))\n :added \"1.0\"}\n [x y] (. clojure.lang.Numbers (unchecked_add x y)))\n\n(defn unchecked-subtract-int\n \"Returns the difference of x and y, both int.\n Note - uses a primitive operator subject to overflow.\"\n {:inline (fn [x y] `(. clojure.lang.Numbers (unchecked_int_subtract ~x ~y)))\n :added \"1.0\"}\n [x y] (. clojure.lang.Numbers (unchecked_int_subtract x y)))\n\n(defn unchecked-subtract\n \"Returns the difference of x and y, both long.\n Note - uses a primitive operator subject to overflow.\"\n {:inline (fn [x y] `(. clojure.lang.Numbers (unchecked_minus ~x ~y)))\n :added \"1.0\"}\n [x y] (. clojure.lang.Numbers (unchecked_minus x y)))\n\n(defn unchecked-multiply-int\n \"Returns the product of x and y, both int.\n Note - uses a primitive operator subject to overflow.\"\n {:inline (fn [x y] `(. clojure.lang.Numbers (unchecked_int_multiply ~x ~y)))\n :added \"1.0\"}\n [x y] (. clojure.lang.Numbers (unchecked_int_multiply x y)))\n\n(defn unchecked-multiply\n \"Returns the product of x and y, both long.\n Note - uses a primitive operator subject to overflow.\"\n {:inline (fn [x y] `(. clojure.lang.Numbers (unchecked_multiply ~x ~y)))\n :added \"1.0\"}\n [x y] (. clojure.lang.Numbers (unchecked_multiply x y)))\n\n(defn unchecked-divide-int\n \"Returns the division of x by y, both int.\n Note - uses a primitive operator subject to truncation.\"\n {:inline (fn [x y] `(. clojure.lang.Numbers (unchecked_int_divide ~x ~y)))\n :added \"1.0\"}\n [x y] (. clojure.lang.Numbers (unchecked_int_divide x y)))\n\n(defn unchecked-remainder-int\n \"Returns the remainder of division of x by y, both int.\n Note - uses a primitive operator subject to truncation.\"\n {:inline (fn [x y] `(. clojure.lang.Numbers (unchecked_int_remainder ~x ~y)))\n :added \"1.0\"}\n [x y] (. clojure.lang.Numbers (unchecked_int_remainder x y)))\n\n(defn pos?\n \"Returns true if num is greater than zero, else false\"\n {\n :inline (fn [x] `(. clojure.lang.Numbers (isPos ~x)))\n :added \"1.0\"}\n [x] (. clojure.lang.Numbers (isPos x)))\n\n(defn neg?\n \"Returns true if num is less than zero, else false\"\n {\n :inline (fn [x] `(. clojure.lang.Numbers (isNeg ~x)))\n :added \"1.0\"}\n [x] (. clojure.lang.Numbers (isNeg x)))\n\n(defn quot\n \"quot[ient] of dividing numerator by denominator.\"\n {:added \"1.0\"\n :static true\n :inline (fn [x y] `(. clojure.lang.Numbers (quotient ~x ~y)))}\n [num div]\n (. clojure.lang.Numbers (quotient num div)))\n\n(defn rem\n \"remainder of dividing numerator by denominator.\"\n {:added \"1.0\"\n :static true\n :inline (fn [x y] `(. clojure.lang.Numbers (remainder ~x ~y)))}\n [num div]\n (. clojure.lang.Numbers (remainder num div)))\n\n(defn rationalize\n \"returns the rational value of num\"\n {:added \"1.0\"\n :static true}\n [num]\n (. clojure.lang.Numbers (rationalize num)))\n\n;;Bit ops\n\n(defn bit-not\n \"Bitwise complement\"\n {:inline (fn [x] `(. clojure.lang.Numbers (not ~x)))\n :added \"1.0\"}\n [x] (. clojure.lang.Numbers not x))\n\n\n(defn bit-and\n \"Bitwise and\"\n {:inline (nary-inline 'and)\n :inline-arities >1?\n :added \"1.0\"}\n ([x y] (. clojure.lang.Numbers and x y))\n ([x y & more]\n (reduce1 bit-and (bit-and x y) more)))\n\n(defn bit-or\n \"Bitwise or\"\n {:inline (nary-inline 'or)\n :inline-arities >1?\n :added \"1.0\"}\n ([x y] (. clojure.lang.Numbers or x y))\n ([x y & more]\n (reduce1 bit-or (bit-or x y) more)))\n\n(defn bit-xor\n \"Bitwise exclusive or\"\n {:inline (nary-inline 'xor)\n :inline-arities >1?\n :added \"1.0\"}\n ([x y] (. clojure.lang.Numbers xor x y))\n ([x y & more]\n (reduce1 bit-xor (bit-xor x y) more)))\n\n(defn bit-and-not\n \"Bitwise and with complement\"\n {:inline (nary-inline 'andNot)\n :inline-arities >1?\n :added \"1.0\"\n :static true}\n ([x y] (. clojure.lang.Numbers andNot x y))\n ([x y & more]\n (reduce1 bit-and-not (bit-and-not x y) more)))\n\n\n(defn bit-clear\n \"Clear bit at index n\"\n {:added \"1.0\"\n :static true}\n [x n] (. clojure.lang.Numbers clearBit x n))\n\n(defn bit-set\n \"Set bit at index n\"\n {:added \"1.0\"\n :static true}\n [x n] (. clojure.lang.Numbers setBit x n))\n\n(defn bit-flip\n \"Flip bit at index n\"\n {:added \"1.0\"\n :static true}\n [x n] (. clojure.lang.Numbers flipBit x n))\n\n(defn bit-test\n \"Test bit at index n\"\n {:added \"1.0\"\n :static true}\n [x n] (. clojure.lang.Numbers testBit x n))\n\n\n(defn bit-shift-left\n \"Bitwise shift left\"\n {:inline (fn [x n] `(. clojure.lang.Numbers (shiftLeft ~x ~n)))\n :added \"1.0\"}\n [x n] (. clojure.lang.Numbers shiftLeft x n))\n\n(defn bit-shift-right\n \"Bitwise shift right\"\n {:inline (fn [x n] `(. clojure.lang.Numbers (shiftRight ~x ~n)))\n :added \"1.0\"}\n [x n] (. clojure.lang.Numbers shiftRight x n))\n\n(defn unsigned-bit-shift-right\n \"Bitwise shift right, without sign-extension.\"\n {:inline (fn [x n] `(. clojure.lang.Numbers (unsignedShiftRight ~x ~n)))\n :added \"1.6\"}\n [x n] (. clojure.lang.Numbers unsignedShiftRight x n))\n\n(defn integer?\n \"Returns true if n is an integer\"\n {:added \"1.0\"\n :static true}\n [n]\n (or (instance? Integer n)\n (instance? Long n)\n (instance? clojure.lang.BigInt n)\n (instance? BigInteger n)\n (instance? Short n)\n (instance? Byte n)))\n\n(defn even?\n \"Returns true if n is even, throws an exception if n is not an integer\"\n {:added \"1.0\"\n :static true}\n [n] (if (integer? n)\n (zero? (bit-and (clojure.lang.RT/uncheckedLongCast n) 1))\n (throw (IllegalArgumentException. (str \"Argument must be an integer: \" n)))))\n\n(defn odd?\n \"Returns true if n is odd, throws an exception if n is not an integer\"\n {:added \"1.0\"\n :static true}\n [n] (not (even? n)))\n\n\n;;\n\n(defn complement\n \"Takes a fn f and returns a fn that takes the same arguments as f,\n has the same effects, if any, and returns the opposite truth value.\"\n {:added \"1.0\"\n :static true}\n [f]\n (fn\n ([] (not (f)))\n ([x] (not (f x)))\n ([x y] (not (f x y)))\n ([x y & zs] (not (apply f x y zs)))))\n\n(defn constantly\n \"Returns a function that takes any number of arguments and returns x.\"\n {:added \"1.0\"\n :static true}\n [x] (fn [& args] x))\n\n(defn identity\n \"Returns its argument.\"\n {:added \"1.0\"\n :static true}\n [x] x)\n\n;;Collection stuff\n\n;;list stuff\n(defn peek\n \"For a list or queue, same as first, for a vector, same as, but much\n more efficient than, last. If the collection is empty, returns nil.\"\n {:added \"1.0\"\n :static true}\n [coll] (. clojure.lang.RT (peek coll)))\n\n(defn pop\n \"For a list or queue, returns a new list/queue without the first\n item, for a vector, returns a new vector without the last item. If\n the collection is empty, throws an exception. Note - not the same\n as next/butlast.\"\n {:added \"1.0\"\n :static true}\n [coll] (. clojure.lang.RT (pop coll)))\n\n;;map stuff\n\n(defn contains?\n \"Returns true if key is present in the given collection, otherwise\n returns false. Note that for numerically indexed collections like\n vectors and Java arrays, this tests if the numeric key is within the\n range of indexes. 'contains?' operates constant or logarithmic time;\n it will not perform a linear search for a value. See also 'some'.\"\n {:added \"1.0\"\n :static true}\n [coll key] (. clojure.lang.RT (contains coll key)))\n\n(defn get\n \"Returns the value mapped to key, not-found or nil if key not present.\"\n {:inline (fn [m k & nf] `(. clojure.lang.RT (get ~m ~k ~@nf)))\n :inline-arities #{2 3}\n :added \"1.0\"}\n ([map key]\n (. clojure.lang.RT (get map key)))\n ([map key not-found]\n (. clojure.lang.RT (get map key not-found))))\n\n(defn dissoc\n \"dissoc[iate]. Returns a new map of the same (hashed/sorted) type,\n that does not contain a mapping for key(s).\"\n {:added \"1.0\"\n :static true}\n ([map] map)\n ([map key]\n (. clojure.lang.RT (dissoc map key)))\n ([map key & ks]\n (let [ret (dissoc map key)]\n (if ks\n (recur ret (first ks) (next ks))\n ret))))\n\n(defn disj\n \"disj[oin]. Returns a new set of the same (hashed/sorted) type, that\n does not contain key(s).\"\n {:added \"1.0\"\n :static true}\n ([set] set)\n ([^clojure.lang.IPersistentSet set key]\n (when set\n (. set (disjoin key))))\n ([set key & ks]\n (when set\n (let [ret (disj set key)]\n (if ks\n (recur ret (first ks) (next ks))\n ret)))))\n\n(defn find\n \"Returns the map entry for key, or nil if key not present.\"\n {:added \"1.0\"\n :static true}\n [map key] (. clojure.lang.RT (find map key)))\n\n(defn select-keys\n \"Returns a map containing only those entries in map whose key is in keys\"\n {:added \"1.0\"\n :static true}\n [map keyseq]\n (loop [ret {} keys (seq keyseq)]\n (if keys\n (let [entry (. clojure.lang.RT (find map (first keys)))]\n (recur\n (if entry\n (conj ret entry)\n ret)\n (next keys)))\n (with-meta ret (meta map)))))\n\n(defn keys\n \"Returns a sequence of the map's keys, in the same order as (seq map).\"\n {:added \"1.0\"\n :static true}\n [map] (. clojure.lang.RT (keys map)))\n\n(defn vals\n \"Returns a sequence of the map's values, in the same order as (seq map).\"\n {:added \"1.0\"\n :static true}\n [map] (. clojure.lang.RT (vals map)))\n\n(defn key\n \"Returns the key of the map entry.\"\n {:added \"1.0\"\n :static true}\n [^java.util.Map$Entry e]\n (. e (getKey)))\n\n(defn val\n \"Returns the value in the map entry.\"\n {:added \"1.0\"\n :static true}\n [^java.util.Map$Entry e]\n (. e (getValue)))\n\n(defn rseq\n \"Returns, in constant time, a seq of the items in rev (which\n can be a vector or sorted-map), in reverse order. If rev is empty returns nil\"\n {:added \"1.0\"\n :static true}\n [^clojure.lang.Reversible rev]\n (. rev (rseq)))\n\n(defn name\n \"Returns the name String of a string, symbol or keyword.\"\n {:tag String\n :added \"1.0\"\n :static true}\n [x]\n (if (string? x) x (. ^clojure.lang.Named x (getName))))\n\n(defn namespace\n \"Returns the namespace String of a symbol or keyword, or nil if not present.\"\n {:tag String\n :added \"1.0\"\n :static true}\n [^clojure.lang.Named x]\n (. x (getNamespace)))\n\n(defmacro locking\n \"Executes exprs in an implicit do, while holding the monitor of x.\n Will release the monitor of x in all circumstances.\"\n {:added \"1.0\"}\n [x & body]\n `(let [lockee# ~x]\n (try\n (monitor-enter lockee#)\n ~@body\n (finally\n (monitor-exit lockee#)))))\n\n(defmacro ..\n \"form => fieldName-symbol or (instanceMethodName-symbol args*)\n\n Expands into a member access (.) of the first member on the first\n argument, followed by the next member on the result, etc. For\n instance:\n\n (.. System (getProperties) (get \\\"os.name\\\"))\n\n expands to:\n\n (. (. System (getProperties)) (get \\\"os.name\\\"))\n\n but is easier to write, read, and understand.\"\n {:added \"1.0\"}\n ([x form] `(. ~x ~form))\n ([x form & more] `(.. (. ~x ~form) ~@more)))\n\n(defmacro ->\n \"Threads the expr through the forms. Inserts x as the\n second item in the first form, making a list of it if it is not a\n list already. If there are more forms, inserts the first form as the\n second item in second form, etc.\"\n {:added \"1.0\"}\n [x & forms]\n (loop [x x, forms forms]\n (if forms\n (let [form (first forms)\n threaded (if (seq? form)\n (with-meta `(~(first form) ~x ~@(next form)) (meta form))\n (list form x))]\n (recur threaded (next forms)))\n x)))\n\n(defmacro ->>\n \"Threads the expr through the forms. Inserts x as the\n last item in the first form, making a list of it if it is not a\n list already. If there are more forms, inserts the first form as the\n last item in second form, etc.\"\n {:added \"1.1\"}\n [x & forms]\n (loop [x x, forms forms]\n (if forms\n (let [form (first forms)\n threaded (if (seq? form)\n (with-meta `(~(first form) ~@(next form) ~x) (meta form))\n (list form x))]\n (recur threaded (next forms)))\n x)))\n\n(def map)\n\n(defn ^:private check-valid-options\n \"Throws an exception if the given option map contains keys not listed\n as valid, else returns nil.\"\n [options & valid-keys]\n (when (seq (apply disj (apply hash-set (keys options)) valid-keys))\n (throw\n (IllegalArgumentException.\n ^String\n (apply str \"Only these options are valid: \"\n (first valid-keys)\n (map #(str \", \" %) (rest valid-keys)))))))\n\n;;multimethods\n(def global-hierarchy)\n\n(defmacro defmulti\n \"Creates a new multimethod with the associated dispatch function.\n The docstring and attr-map are optional.\n\n Options are key-value pairs and may be one of:\n\n :default\n\n The default dispatch value, defaults to :default\n\n :hierarchy\n\n The value used for hierarchical dispatch (e.g. ::square is-a ::shape)\n\n Hierarchies are type-like relationships that do not depend upon type\n inheritance. By default Clojure's multimethods dispatch off of a\n global hierarchy map. However, a hierarchy relationship can be\n created with the derive function used to augment the root ancestor\n created with make-hierarchy.\n\n Multimethods expect the value of the hierarchy option to be supplied as\n a reference type e.g. a var (i.e. via the Var-quote dispatch macro #'\n or the var special form).\"\n {:arglists '([name docstring? attr-map? dispatch-fn & options])\n :added \"1.0\"}\n [mm-name & options]\n (let [docstring (if (string? (first options))\n (first options)\n nil)\n options (if (string? (first options))\n (next options)\n options)\n m (if (map? (first options))\n (first options)\n {})\n options (if (map? (first options))\n (next options)\n options)\n dispatch-fn (first options)\n options (next options)\n m (if docstring\n (assoc m :doc docstring)\n m)\n m (if (meta mm-name)\n (conj (meta mm-name) m)\n m)]\n (when (= (count options) 1)\n (throw (Exception. \"The syntax for defmulti has changed. Example: (defmulti name dispatch-fn :default dispatch-value)\")))\n (let [options (apply hash-map options)\n default (get options :default :default)\n hierarchy (get options :hierarchy #'global-hierarchy)]\n (check-valid-options options :default :hierarchy)\n `(let [v# (def ~mm-name)]\n (when-not (and (.hasRoot v#) (instance? clojure.lang.MultiFn (deref v#)))\n (def ~(with-meta mm-name m)\n (new clojure.lang.MultiFn ~(name mm-name) ~dispatch-fn ~default ~hierarchy)))))))\n\n(defmacro defmethod\n \"Creates and installs a new method of multimethod associated with dispatch-value. \"\n {:added \"1.0\"}\n [multifn dispatch-val & fn-tail]\n `(. ~(with-meta multifn {:tag 'clojure.lang.MultiFn}) addMethod ~dispatch-val (fn ~@fn-tail)))\n\n(defn remove-all-methods\n \"Removes all of the methods of multimethod.\"\n {:added \"1.2\"\n :static true}\n [^clojure.lang.MultiFn multifn]\n (.reset multifn))\n\n(defn remove-method\n \"Removes the method of multimethod associated with dispatch-value.\"\n {:added \"1.0\"\n :static true}\n [^clojure.lang.MultiFn multifn dispatch-val]\n (. multifn removeMethod dispatch-val))\n\n(defn prefer-method\n \"Causes the multimethod to prefer matches of dispatch-val-x over dispatch-val-y\n when there is a conflict\"\n {:added \"1.0\"\n :static true}\n [^clojure.lang.MultiFn multifn dispatch-val-x dispatch-val-y]\n (. multifn preferMethod dispatch-val-x dispatch-val-y))\n\n(defn methods\n \"Given a multimethod, returns a map of dispatch values -> dispatch fns\"\n {:added \"1.0\"\n :static true}\n [^clojure.lang.MultiFn multifn] (.getMethodTable multifn))\n\n(defn get-method\n \"Given a multimethod and a dispatch value, returns the dispatch fn\n that would apply to that value, or nil if none apply and no default\"\n {:added \"1.0\"\n :static true}\n [^clojure.lang.MultiFn multifn dispatch-val] (.getMethod multifn dispatch-val))\n\n(defn prefers\n \"Given a multimethod, returns a map of preferred value -> set of other values\"\n {:added \"1.0\"\n :static true}\n [^clojure.lang.MultiFn multifn] (.getPreferTable multifn))\n\n;;;;;;;;; var stuff\n\n(defmacro ^{:private true} assert-args\n [& pairs]\n `(do (when-not ~(first pairs)\n (throw (IllegalArgumentException.\n (str (first ~'&form) \" requires \" ~(second pairs) \" in \" ~'*ns* \":\" (:line (meta ~'&form))))))\n ~(let [more (nnext pairs)]\n (when more\n (list* `assert-args more)))))\n\n(defmacro if-let\n \"bindings => binding-form test\n\n If test is true, evaluates then with binding-form bound to the value of\n test, if not, yields else\"\n {:added \"1.0\"}\n ([bindings then]\n `(if-let ~bindings ~then nil))\n ([bindings then else & oldform]\n (assert-args\n (vector? bindings) \"a vector for its binding\"\n (nil? oldform) \"1 or 2 forms after binding vector\"\n (= 2 (count bindings)) \"exactly 2 forms in binding vector\")\n (let [form (bindings 0) tst (bindings 1)]\n `(let [temp# ~tst]\n (if temp#\n (let [~form temp#]\n ~then)\n ~else)))))\n\n(defmacro when-let\n \"bindings => binding-form test\n\n When test is true, evaluates body with binding-form bound to the value of test\"\n {:added \"1.0\"}\n [bindings & body]\n (assert-args\n (vector? bindings) \"a vector for its binding\"\n (= 2 (count bindings)) \"exactly 2 forms in binding vector\")\n (let [form (bindings 0) tst (bindings 1)]\n `(let [temp# ~tst]\n (when temp#\n (let [~form temp#]\n ~@body)))))\n\n(defmacro if-some\n \"bindings => binding-form test\n\n If test is not nil, evaluates then with binding-form bound to the\n value of test, if not, yields else\"\n {:added \"1.6\"}\n ([bindings then]\n `(if-some ~bindings ~then nil))\n ([bindings then else & oldform]\n (assert-args\n (vector? bindings) \"a vector for its binding\"\n (nil? oldform) \"1 or 2 forms after binding vector\"\n (= 2 (count bindings)) \"exactly 2 forms in binding vector\")\n (let [form (bindings 0) tst (bindings 1)]\n `(let [temp# ~tst]\n (if (nil? temp#)\n ~else\n (let [~form temp#]\n ~then))))))\n\n(defmacro when-some\n \"bindings => binding-form test\n\n When test is not nil, evaluates body with binding-form bound to the\n value of test\"\n {:added \"1.6\"}\n [bindings & body]\n (assert-args\n (vector? bindings) \"a vector for its binding\"\n (= 2 (count bindings)) \"exactly 2 forms in binding vector\")\n (let [form (bindings 0) tst (bindings 1)]\n `(let [temp# ~tst]\n (if (nil? temp#)\n nil\n (let [~form temp#]\n ~@body)))))\n\n(defn push-thread-bindings\n \"WARNING: This is a low-level function. Prefer high-level macros like\n binding where ever possible.\n\n Takes a map of Var/value pairs. Binds each Var to the associated value for\n the current thread. Each call *MUST* be accompanied by a matching call to\n pop-thread-bindings wrapped in a try-finally!\n\n (push-thread-bindings bindings)\n (try\n ...\n (finally\n (pop-thread-bindings)))\"\n {:added \"1.1\"\n :static true}\n [bindings]\n (clojure.lang.Var/pushThreadBindings bindings))\n\n(defn pop-thread-bindings\n \"Pop one set of bindings pushed with push-binding before. It is an error to\n pop bindings without pushing before.\"\n {:added \"1.1\"\n :static true}\n []\n (clojure.lang.Var/popThreadBindings))\n\n(defn get-thread-bindings\n \"Get a map with the Var/value pairs which is currently in effect for the\n current thread.\"\n {:added \"1.1\"\n :static true}\n []\n (clojure.lang.Var/getThreadBindings))\n\n(defmacro binding\n \"binding => var-symbol init-expr\n\n Creates new bindings for the (already-existing) vars, with the\n supplied initial values, executes the exprs in an implicit do, then\n re-establishes the bindings that existed before. The new bindings\n are made in parallel (unlike let); all init-exprs are evaluated\n before the vars are bound to their new values.\"\n {:added \"1.0\"}\n [bindings & body]\n (assert-args\n (vector? bindings) \"a vector for its binding\"\n (even? (count bindings)) \"an even number of forms in binding vector\")\n (let [var-ize (fn [var-vals]\n (loop [ret [] vvs (seq var-vals)]\n (if vvs\n (recur (conj (conj ret `(var ~(first vvs))) (second vvs))\n (next (next vvs)))\n (seq ret))))]\n `(let []\n (push-thread-bindings (hash-map ~@(var-ize bindings)))\n (try\n ~@body\n (finally\n (pop-thread-bindings))))))\n\n(defn with-bindings*\n \"Takes a map of Var/value pairs. Installs for the given Vars the associated\n values as thread-local bindings. Then calls f with the supplied arguments.\n Pops the installed bindings after f returned. Returns whatever f returns.\"\n {:added \"1.1\"\n :static true}\n [binding-map f & args]\n (push-thread-bindings binding-map)\n (try\n (apply f args)\n (finally\n (pop-thread-bindings))))\n\n(defmacro with-bindings\n \"Takes a map of Var/value pairs. Installs for the given Vars the associated\n values as thread-local bindings. The executes body. Pops the installed\n bindings after body was evaluated. Returns the value of body.\"\n {:added \"1.1\"}\n [binding-map & body]\n `(with-bindings* ~binding-map (fn [] ~@body)))\n\n(defn bound-fn*\n \"Returns a function, which will install the same bindings in effect as in\n the thread at the time bound-fn* was called and then call f with any given\n arguments. This may be used to define a helper function which runs on a\n different thread, but needs the same bindings in place.\"\n {:added \"1.1\"\n :static true}\n [f]\n (let [bindings (get-thread-bindings)]\n (fn [& args]\n (apply with-bindings* bindings f args))))\n\n(defmacro bound-fn\n \"Returns a function defined by the given fntail, which will install the\n same bindings in effect as in the thread at the time bound-fn was called.\n This may be used to define a helper function which runs on a different\n thread, but needs the same bindings in place.\"\n {:added \"1.1\"}\n [& fntail]\n `(bound-fn* (fn ~@fntail)))\n\n(defn find-var\n \"Returns the global var named by the namespace-qualified symbol, or\n nil if no var with that name.\"\n {:added \"1.0\"\n :static true}\n [sym] (. clojure.lang.Var (find sym)))\n\n(defn binding-conveyor-fn\n {:private true\n :added \"1.3\"}\n [f]\n (let [frame (clojure.lang.Var/cloneThreadBindingFrame)]\n (fn\n ([]\n (clojure.lang.Var/resetThreadBindingFrame frame)\n (f))\n ([x]\n (clojure.lang.Var/resetThreadBindingFrame frame)\n (f x))\n ([x y]\n (clojure.lang.Var/resetThreadBindingFrame frame)\n (f x y))\n ([x y z]\n (clojure.lang.Var/resetThreadBindingFrame frame)\n (f x y z))\n ([x y z & args]\n (clojure.lang.Var/resetThreadBindingFrame frame)\n (apply f x y z args)))))\n\n;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;; Refs ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\n(defn ^{:private true}\n setup-reference [^clojure.lang.ARef r options]\n (let [opts (apply hash-map options)]\n (when (:meta opts)\n (.resetMeta r (:meta opts)))\n (when (:validator opts)\n (.setValidator r (:validator opts)))\n r))\n\n(defn agent\n \"Creates and returns an agent with an initial value of state and\n zero or more options (in any order):\n\n :meta metadata-map\n\n :validator validate-fn\n\n :error-handler handler-fn\n\n :error-mode mode-keyword\n\n If metadata-map is supplied, it will become the metadata on the\n agent. validate-fn must be nil or a side-effect-free fn of one\n argument, which will be passed the intended new state on any state\n change. If the new state is unacceptable, the validate-fn should\n return false or throw an exception. handler-fn is called if an\n action throws an exception or if validate-fn rejects a new state --\n see set-error-handler! for details. The mode-keyword may be either\n :continue (the default if an error-handler is given) or :fail (the\n default if no error-handler is given) -- see set-error-mode! for\n details.\"\n {:added \"1.0\"\n :static true\n }\n ([state & options]\n (let [a (new clojure.lang.Agent state)\n opts (apply hash-map options)]\n (setup-reference a options)\n (when (:error-handler opts)\n (.setErrorHandler a (:error-handler opts)))\n (.setErrorMode a (or (:error-mode opts)\n (if (:error-handler opts) :continue :fail)))\n a)))\n\n(defn set-agent-send-executor!\n \"Sets the ExecutorService to be used by send\"\n {:added \"1.5\"}\n [executor]\n (set! clojure.lang.Agent/pooledExecutor executor))\n\n(defn set-agent-send-off-executor!\n \"Sets the ExecutorService to be used by send-off\"\n {:added \"1.5\"}\n [executor]\n (set! clojure.lang.Agent/soloExecutor executor))\n\n(defn send-via\n \"Dispatch an action to an agent. Returns the agent immediately.\n Subsequently, in a thread supplied by executor, the state of the agent\n will be set to the value of:\n\n (apply action-fn state-of-agent args)\"\n {:added \"1.5\"}\n [executor ^clojure.lang.Agent a f & args]\n (.dispatch a (binding [*agent* a] (binding-conveyor-fn f)) args executor))\n\n(defn send\n \"Dispatch an action to an agent. Returns the agent immediately.\n Subsequently, in a thread from a thread pool, the state of the agent\n will be set to the value of:\n\n (apply action-fn state-of-agent args)\"\n {:added \"1.0\"\n :static true}\n [^clojure.lang.Agent a f & args]\n (apply send-via clojure.lang.Agent/pooledExecutor a f args))\n\n(defn send-off\n \"Dispatch a potentially blocking action to an agent. Returns the\n agent immediately. Subsequently, in a separate thread, the state of\n the agent will be set to the value of:\n\n (apply action-fn state-of-agent args)\"\n {:added \"1.0\"\n :static true}\n [^clojure.lang.Agent a f & args]\n (apply send-via clojure.lang.Agent/soloExecutor a f args))\n\n(defn release-pending-sends\n \"Normally, actions sent directly or indirectly during another action\n are held until the action completes (changes the agent's\n state). This function can be used to dispatch any pending sent\n actions immediately. This has no impact on actions sent during a\n transaction, which are still held until commit. If no action is\n occurring, does nothing. Returns the number of actions dispatched.\"\n {:added \"1.0\"\n :static true}\n [] (clojure.lang.Agent/releasePendingSends))\n\n(defn add-watch\n \"Adds a watch function to an agent/atom/var/ref reference. The watch\n fn must be a fn of 4 args: a key, the reference, its old-state, its\n new-state. Whenever the reference's state might have been changed,\n any registered watches will have their functions called. The watch fn\n will be called synchronously, on the agent's thread if an agent,\n before any pending sends if agent or ref. Note that an atom's or\n ref's state may have changed again prior to the fn call, so use\n old/new-state rather than derefing the reference. Note also that watch\n fns may be called from multiple threads simultaneously. Var watchers\n are triggered only by root binding changes, not thread-local\n set!s. Keys must be unique per reference, and can be used to remove\n the watch with remove-watch, but are otherwise considered opaque by\n the watch mechanism.\"\n {:added \"1.0\"\n :static true}\n [^clojure.lang.IRef reference key fn] (.addWatch reference key fn))\n\n(defn remove-watch\n \"Removes a watch (set by add-watch) from a reference\"\n {:added \"1.0\"\n :static true}\n [^clojure.lang.IRef reference key]\n (.removeWatch reference key))\n\n(defn agent-error\n \"Returns the exception thrown during an asynchronous action of the\n agent if the agent is failed. Returns nil if the agent is not\n failed.\"\n {:added \"1.2\"\n :static true}\n [^clojure.lang.Agent a] (.getError a))\n\n(defn restart-agent\n \"When an agent is failed, changes the agent state to new-state and\n then un-fails the agent so that sends are allowed again. If\n a :clear-actions true option is given, any actions queued on the\n agent that were being held while it was failed will be discarded,\n otherwise those held actions will proceed. The new-state must pass\n the validator if any, or restart will throw an exception and the\n agent will remain failed with its old state and error. Watchers, if\n any, will NOT be notified of the new state. Throws an exception if\n the agent is not failed.\"\n {:added \"1.2\"\n :static true\n }\n [^clojure.lang.Agent a, new-state & options]\n (let [opts (apply hash-map options)]\n (.restart a new-state (if (:clear-actions opts) true false))))\n\n(defn set-error-handler!\n \"Sets the error-handler of agent a to handler-fn. If an action\n being run by the agent throws an exception or doesn't pass the\n validator fn, handler-fn will be called with two arguments: the\n agent and the exception.\"\n {:added \"1.2\"\n :static true}\n [^clojure.lang.Agent a, handler-fn]\n (.setErrorHandler a handler-fn))\n\n(defn error-handler\n \"Returns the error-handler of agent a, or nil if there is none.\n See set-error-handler!\"\n {:added \"1.2\"\n :static true}\n [^clojure.lang.Agent a]\n (.getErrorHandler a))\n\n(defn set-error-mode!\n \"Sets the error-mode of agent a to mode-keyword, which must be\n either :fail or :continue. If an action being run by the agent\n throws an exception or doesn't pass the validator fn, an\n error-handler may be called (see set-error-handler!), after which,\n if the mode is :continue, the agent will continue as if neither the\n action that caused the error nor the error itself ever happened.\n\n If the mode is :fail, the agent will become failed and will stop\n accepting new 'send' and 'send-off' actions, and any previously\n queued actions will be held until a 'restart-agent'. Deref will\n still work, returning the state of the agent before the error.\"\n {:added \"1.2\"\n :static true}\n [^clojure.lang.Agent a, mode-keyword]\n (.setErrorMode a mode-keyword))\n\n(defn error-mode\n \"Returns the error-mode of agent a. See set-error-mode!\"\n {:added \"1.2\"\n :static true}\n [^clojure.lang.Agent a]\n (.getErrorMode a))\n\n(defn agent-errors\n \"DEPRECATED: Use 'agent-error' instead.\n Returns a sequence of the exceptions thrown during asynchronous\n actions of the agent.\"\n {:added \"1.0\"\n :deprecated \"1.2\"}\n [a]\n (when-let [e (agent-error a)]\n (list e)))\n\n(defn clear-agent-errors\n \"DEPRECATED: Use 'restart-agent' instead.\n Clears any exceptions thrown during asynchronous actions of the\n agent, allowing subsequent actions to occur.\"\n {:added \"1.0\"\n :deprecated \"1.2\"}\n [^clojure.lang.Agent a] (restart-agent a (.deref a)))\n\n(defn shutdown-agents\n \"Initiates a shutdown of the thread pools that back the agent\n system. Running actions will complete, but no new actions will be\n accepted\"\n {:added \"1.0\"\n :static true}\n [] (. clojure.lang.Agent shutdown))\n\n(defn ref\n \"Creates and returns a Ref with an initial value of x and zero or\n more options (in any order):\n\n :meta metadata-map\n\n :validator validate-fn\n\n :min-history (default 0)\n :max-history (default 10)\n\n If metadata-map is supplied, it will become the metadata on the\n ref. validate-fn must be nil or a side-effect-free fn of one\n argument, which will be passed the intended new state on any state\n change. If the new state is unacceptable, the validate-fn should\n return false or throw an exception. validate-fn will be called on\n transaction commit, when all refs have their final values.\n\n Normally refs accumulate history dynamically as needed to deal with\n read demands. If you know in advance you will need history you can\n set :min-history to ensure it will be available when first needed (instead\n of after a read fault). History is limited, and the limit can be set\n with :max-history.\"\n {:added \"1.0\"\n :static true\n }\n ([x] (new clojure.lang.Ref x))\n ([x & options]\n (let [r ^clojure.lang.Ref (setup-reference (ref x) options)\n opts (apply hash-map options)]\n (when (:max-history opts)\n (.setMaxHistory r (:max-history opts)))\n (when (:min-history opts)\n (.setMinHistory r (:min-history opts)))\n r)))\n\n(defn ^:private deref-future\n ([^java.util.concurrent.Future fut]\n (.get fut))\n ([^java.util.concurrent.Future fut timeout-ms timeout-val]\n (try (.get fut timeout-ms java.util.concurrent.TimeUnit/MILLISECONDS)\n (catch java.util.concurrent.TimeoutException e\n timeout-val))))\n\n(defn deref\n \"Also reader macro: @ref/@agent/@var/@atom/@delay/@future/@promise. Within a transaction,\n returns the in-transaction-value of ref, else returns the\n most-recently-committed value of ref. When applied to a var, agent\n or atom, returns its current state. When applied to a delay, forces\n it if not already forced. When applied to a future, will block if\n computation not complete. When applied to a promise, will block\n until a value is delivered. The variant taking a timeout can be\n used for blocking references (futures and promises), and will return\n timeout-val if the timeout (in milliseconds) is reached before a\n value is available. See also - realized?.\"\n {:added \"1.0\"\n :static true}\n ([ref] (if (instance? clojure.lang.IDeref ref)\n (.deref ^clojure.lang.IDeref ref)\n (deref-future ref)))\n ([ref timeout-ms timeout-val]\n (if (instance? clojure.lang.IBlockingDeref ref)\n (.deref ^clojure.lang.IBlockingDeref ref timeout-ms timeout-val)\n (deref-future ref timeout-ms timeout-val))))\n\n(defn atom\n \"Creates and returns an Atom with an initial value of x and zero or\n more options (in any order):\n\n :meta metadata-map\n\n :validator validate-fn\n\n If metadata-map is supplied, it will become the metadata on the\n atom. validate-fn must be nil or a side-effect-free fn of one\n argument, which will be passed the intended new state on any state\n change. If the new state is unacceptable, the validate-fn should\n return false or throw an exception.\"\n {:added \"1.0\"\n :static true}\n ([x] (new clojure.lang.Atom x))\n ([x & options] (setup-reference (atom x) options)))\n\n(defn swap!\n \"Atomically swaps the value of atom to be:\n (apply f current-value-of-atom args). Note that f may be called\n multiple times, and thus should be free of side effects. Returns\n the value that was swapped in.\"\n {:added \"1.0\"\n :static true}\n ([^clojure.lang.IAtom atom f] (.swap atom f))\n ([^clojure.lang.IAtom atom f x] (.swap atom f x))\n ([^clojure.lang.IAtom atom f x y] (.swap atom f x y))\n ([^clojure.lang.IAtom atom f x y & args] (.swap atom f x y args)))\n\n(defn compare-and-set!\n \"Atomically sets the value of atom to newval if and only if the\n current value of the atom is identical to oldval. Returns true if\n set happened, else false\"\n {:added \"1.0\"\n :static true}\n [^clojure.lang.IAtom atom oldval newval] (.compareAndSet atom oldval newval))\n\n(defn reset!\n \"Sets the value of atom to newval without regard for the\n current value. Returns newval.\"\n {:added \"1.0\"\n :static true}\n [^clojure.lang.IAtom atom newval] (.reset atom newval))\n\n(defn set-validator!\n \"Sets the validator-fn for a var/ref/agent/atom. validator-fn must be nil or a\n side-effect-free fn of one argument, which will be passed the intended\n new state on any state change. If the new state is unacceptable, the\n validator-fn should return false or throw an exception. If the current state (root\n value if var) is not acceptable to the new validator, an exception\n will be thrown and the validator will not be changed.\"\n {:added \"1.0\"\n :static true}\n [^clojure.lang.IRef iref validator-fn] (. iref (setValidator validator-fn)))\n\n(defn get-validator\n \"Gets the validator-fn for a var/ref/agent/atom.\"\n {:added \"1.0\"\n :static true}\n [^clojure.lang.IRef iref] (. iref (getValidator)))\n\n(defn alter-meta!\n \"Atomically sets the metadata for a namespace/var/ref/agent/atom to be:\n\n (apply f its-current-meta args)\n\n f must be free of side-effects\"\n {:added \"1.0\"\n :static true}\n [^clojure.lang.IReference iref f & args] (.alterMeta iref f args))\n\n(defn reset-meta!\n \"Atomically resets the metadata for a namespace/var/ref/agent/atom\"\n {:added \"1.0\"\n :static true}\n [^clojure.lang.IReference iref metadata-map] (.resetMeta iref metadata-map))\n\n(defn commute\n \"Must be called in a transaction. Sets the in-transaction-value of\n ref to:\n\n (apply fun in-transaction-value-of-ref args)\n\n and returns the in-transaction-value of ref.\n\n At the commit point of the transaction, sets the value of ref to be:\n\n (apply fun most-recently-committed-value-of-ref args)\n\n Thus fun should be commutative, or, failing that, you must accept\n last-one-in-wins behavior. commute allows for more concurrency than\n ref-set.\"\n {:added \"1.0\"\n :static true}\n\n [^clojure.lang.Ref ref fun & args]\n (. ref (commute fun args)))\n\n(defn alter\n \"Must be called in a transaction. Sets the in-transaction-value of\n ref to:\n\n (apply fun in-transaction-value-of-ref args)\n\n and returns the in-transaction-value of ref.\"\n {:added \"1.0\"\n :static true}\n [^clojure.lang.Ref ref fun & args]\n (. ref (alter fun args)))\n\n(defn ref-set\n \"Must be called in a transaction. Sets the value of ref.\n Returns val.\"\n {:added \"1.0\"\n :static true}\n [^clojure.lang.Ref ref val]\n (. ref (set val)))\n\n(defn ref-history-count\n \"Returns the history count of a ref\"\n {:added \"1.1\"\n :static true}\n [^clojure.lang.Ref ref]\n (.getHistoryCount ref))\n\n(defn ref-min-history\n \"Gets the min-history of a ref, or sets it and returns the ref\"\n {:added \"1.1\"\n :static true}\n ([^clojure.lang.Ref ref]\n (.getMinHistory ref))\n ([^clojure.lang.Ref ref n]\n (.setMinHistory ref n)))\n\n(defn ref-max-history\n \"Gets the max-history of a ref, or sets it and returns the ref\"\n {:added \"1.1\"\n :static true}\n ([^clojure.lang.Ref ref]\n (.getMaxHistory ref))\n ([^clojure.lang.Ref ref n]\n (.setMaxHistory ref n)))\n\n(defn ensure\n \"Must be called in a transaction. Protects the ref from modification\n by other transactions. Returns the in-transaction-value of\n ref. Allows for more concurrency than (ref-set ref @ref)\"\n {:added \"1.0\"\n :static true}\n [^clojure.lang.Ref ref]\n (. ref (touch))\n (. ref (deref)))\n\n(defmacro sync\n \"transaction-flags => TBD, pass nil for now\n\n Runs the exprs (in an implicit do) in a transaction that encompasses\n exprs and any nested calls. Starts a transaction if none is already\n running on this thread. Any uncaught exception will abort the\n transaction and flow out of sync. The exprs may be run more than\n once, but any effects on Refs will be atomic.\"\n {:added \"1.0\"}\n [flags-ignored-for-now & body]\n `(. clojure.lang.LockingTransaction\n (runInTransaction (fn [] ~@body))))\n\n\n(defmacro io!\n \"If an io! block occurs in a transaction, throws an\n IllegalStateException, else runs body in an implicit do. If the\n first expression in body is a literal string, will use that as the\n exception message.\"\n {:added \"1.0\"}\n [& body]\n (let [message (when (string? (first body)) (first body))\n body (if message (next body) body)]\n `(if (clojure.lang.LockingTransaction/isRunning)\n (throw (new IllegalStateException ~(or message \"I/O in transaction\")))\n (do ~@body))))\n\n(defn volatile!\n \"Creates and returns a Volatile with an initial value of val.\"\n {:added \"1.7\"\n :tag clojure.lang.Volatile}\n [val]\n (clojure.lang.Volatile. val))\n\n(defn vreset!\n \"Sets the value of volatile to newval without regard for the\n current value. Returns newval.\"\n {:added \"1.7\"}\n [^clojure.lang.Volatile vol newval]\n (.reset vol newval))\n\n(defmacro vswap!\n \"Non-atomically swaps the value of the volatile as if:\n (apply f current-value-of-vol args). Returns the value that\n was swapped in.\"\n {:added \"1.7\"}\n [vol f & args]\n (let [v (with-meta vol {:tag 'clojure.lang.Volatile})]\n `(.reset ~v (~f (.deref ~v) ~@args))))\n\n(defn volatile?\n \"Returns true if x is a volatile.\"\n {:added \"1.7\"}\n [x]\n (instance? clojure.lang.Volatile x))\n\n;;;;;;;;;;;;;;;;;;;;;;;;;;;;;; fn stuff ;;;;;;;;;;;;;;;;\n\n\n(defn comp\n \"Takes a set of functions and returns a fn that is the composition\n of those fns. The returned fn takes a variable number of args,\n applies the rightmost of fns to the args, the next\n fn (right-to-left) to the result, etc.\"\n {:added \"1.0\"\n :static true}\n ([] identity)\n ([f] f)\n ([f g]\n (fn\n ([] (f (g)))\n ([x] (f (g x)))\n ([x y] (f (g x y)))\n ([x y z] (f (g x y z)))\n ([x y z & args] (f (apply g x y z args)))))\n ([f g & fs]\n (reduce1 comp (list* f g fs))))\n\n(defn juxt\n \"Takes a set of functions and returns a fn that is the juxtaposition\n of those fns. The returned fn takes a variable number of args, and\n returns a vector containing the result of applying each fn to the\n args (left-to-right).\n ((juxt a b c) x) => [(a x) (b x) (c x)]\"\n {:added \"1.1\"\n :static true}\n ([f]\n (fn\n ([] [(f)])\n ([x] [(f x)])\n ([x y] [(f x y)])\n ([x y z] [(f x y z)])\n ([x y z & args] [(apply f x y z args)])))\n ([f g]\n (fn\n ([] [(f) (g)])\n ([x] [(f x) (g x)])\n ([x y] [(f x y) (g x y)])\n ([x y z] [(f x y z) (g x y z)])\n ([x y z & args] [(apply f x y z args) (apply g x y z args)])))\n ([f g h]\n (fn\n ([] [(f) (g) (h)])\n ([x] [(f x) (g x) (h x)])\n ([x y] [(f x y) (g x y) (h x y)])\n ([x y z] [(f x y z) (g x y z) (h x y z)])\n ([x y z & args] [(apply f x y z args) (apply g x y z args) (apply h x y z args)])))\n ([f g h & fs]\n (let [fs (list* f g h fs)]\n (fn\n ([] (reduce1 #(conj %1 (%2)) [] fs))\n ([x] (reduce1 #(conj %1 (%2 x)) [] fs))\n ([x y] (reduce1 #(conj %1 (%2 x y)) [] fs))\n ([x y z] (reduce1 #(conj %1 (%2 x y z)) [] fs))\n ([x y z & args] (reduce1 #(conj %1 (apply %2 x y z args)) [] fs))))))\n\n(defn partial\n \"Takes a function f and fewer than the normal arguments to f, and\n returns a fn that takes a variable number of additional args. When\n called, the returned function calls f with args + additional args.\"\n {:added \"1.0\"\n :static true}\n ([f] f)\n ([f arg1]\n (fn\n ([] (f arg1))\n ([x] (f arg1 x))\n ([x y] (f arg1 x y))\n ([x y z] (f arg1 x y z))\n ([x y z & args] (apply f arg1 x y z args))))\n ([f arg1 arg2]\n (fn\n ([] (f arg1 arg2))\n ([x] (f arg1 arg2 x))\n ([x y] (f arg1 arg2 x y))\n ([x y z] (f arg1 arg2 x y z))\n ([x y z & args] (apply f arg1 arg2 x y z args))))\n ([f arg1 arg2 arg3]\n (fn\n ([] (f arg1 arg2 arg3))\n ([x] (f arg1 arg2 arg3 x))\n ([x y] (f arg1 arg2 arg3 x y))\n ([x y z] (f arg1 arg2 arg3 x y z))\n ([x y z & args] (apply f arg1 arg2 arg3 x y z args))))\n ([f arg1 arg2 arg3 & more]\n (fn [& args] (apply f arg1 arg2 arg3 (concat more args)))))\n\n;;;;;;;;;;;;;;;;;;; sequence fns ;;;;;;;;;;;;;;;;;;;;;;;\n\n(defn sequence\n \"Coerces coll to a (possibly empty) sequence, if it is not already\n one. Will not force a lazy seq. (sequence nil) yields (), When a\n transducer is supplied, returns a lazy sequence of applications of\n the transform to the items in coll(s), i.e. to the set of first\n items of each coll, followed by the set of second\n items in each coll, until any one of the colls is exhausted. Any\n remaining items in other colls are ignored. The transform should accept\n number-of-colls arguments\"\n {:added \"1.0\"\n :static true}\n ([coll]\n (if (seq? coll) coll\n (or (seq coll) ())))\n ([xform coll]\n (or (clojure.lang.RT/chunkIteratorSeq\n (clojure.lang.TransformerIterator/create xform (clojure.lang.RT/iter coll)))\n ()))\n ([xform coll & colls]\n (or (clojure.lang.RT/chunkIteratorSeq\n (clojure.lang.TransformerIterator/createMulti\n xform\n (map #(clojure.lang.RT/iter %) (cons coll colls))))\n ())))\n\n(defn every?\n \"Returns true if (pred x) is logical true for every x in coll, else\n false.\"\n {:tag Boolean\n :added \"1.0\"\n :static true}\n [pred coll]\n (cond\n (nil? (seq coll)) true\n (pred (first coll)) (recur pred (next coll))\n :else false))\n\n(def\n ^{:tag Boolean\n :doc \"Returns false if (pred x) is logical true for every x in\n coll, else true.\"\n :arglists '([pred coll])\n :added \"1.0\"}\n not-every? (comp not every?))\n\n(defn some\n \"Returns the first logical true value of (pred x) for any x in coll,\n else nil. One common idiom is to use a set as pred, for example\n this will return :fred if :fred is in the sequence, otherwise nil:\n (some #{:fred} coll)\"\n {:added \"1.0\"\n :static true}\n [pred coll]\n (when (seq coll)\n (or (pred (first coll)) (recur pred (next coll)))))\n\n(def\n ^{:tag Boolean\n :doc \"Returns false if (pred x) is logical true for any x in coll,\n else true.\"\n :arglists '([pred coll])\n :added \"1.0\"}\n not-any? (comp not some))\n\n;will be redefed later with arg checks\n(defmacro dotimes\n \"bindings => name n\n\n Repeatedly executes body (presumably for side-effects) with name\n bound to integers from 0 through n-1.\"\n {:added \"1.0\"}\n [bindings & body]\n (let [i (first bindings)\n n (second bindings)]\n `(let [n# (clojure.lang.RT/longCast ~n)]\n (loop [~i 0]\n (when (< ~i n#)\n ~@body\n (recur (unchecked-inc ~i)))))))\n\n(defn map\n \"Returns a lazy sequence consisting of the result of applying f to\n the set of first items of each coll, followed by applying f to the\n set of second items in each coll, until any one of the colls is\n exhausted. Any remaining items in other colls are ignored. Function\n f should accept number-of-colls arguments. Returns a transducer when\n no collection is provided.\"\n {:added \"1.0\"\n :static true}\n ([f]\n (fn [rf]\n (fn\n ([] (rf))\n ([result] (rf result))\n ([result input]\n (rf result (f input)))\n ([result input & inputs]\n (rf result (apply f input inputs))))))\n ([f coll]\n (lazy-seq\n (when-let [s (seq coll)]\n (if (chunked-seq? s)\n (let [c (chunk-first s)\n size (int (count c))\n b (chunk-buffer size)]\n (dotimes [i size]\n (chunk-append b (f (.nth c i))))\n (chunk-cons (chunk b) (map f (chunk-rest s))))\n (cons (f (first s)) (map f (rest s)))))))\n ([f c1 c2]\n (lazy-seq\n (let [s1 (seq c1) s2 (seq c2)]\n (when (and s1 s2)\n (cons (f (first s1) (first s2))\n (map f (rest s1) (rest s2)))))))\n ([f c1 c2 c3]\n (lazy-seq\n (let [s1 (seq c1) s2 (seq c2) s3 (seq c3)]\n (when (and s1 s2 s3)\n (cons (f (first s1) (first s2) (first s3))\n (map f (rest s1) (rest s2) (rest s3)))))))\n ([f c1 c2 c3 & colls]\n (let [step (fn step [cs]\n (lazy-seq\n (let [ss (map seq cs)]\n (when (every? identity ss)\n (cons (map first ss) (step (map rest ss)))))))]\n (map #(apply f %) (step (conj colls c3 c2 c1))))))\n\n(defmacro declare\n \"defs the supplied var names with no bindings, useful for making forward declarations.\"\n {:added \"1.0\"}\n [& names] `(do ~@(map #(list 'def (vary-meta % assoc :declared true)) names)))\n\n(declare cat)\n\n(defn mapcat\n \"Returns the result of applying concat to the result of applying map\n to f and colls. Thus function f should return a collection. Returns\n a transducer when no collections are provided\"\n {:added \"1.0\"\n :static true}\n ([f] (comp (map f) cat))\n ([f & colls]\n (apply concat (apply map f colls))))\n\n(defn filter\n \"Returns a lazy sequence of the items in coll for which\n (pred item) returns true. pred must be free of side-effects.\n Returns a transducer when no collection is provided.\"\n {:added \"1.0\"\n :static true}\n ([pred]\n (fn [rf]\n (fn\n ([] (rf))\n ([result] (rf result))\n ([result input]\n (if (pred input)\n (rf result input)\n result)))))\n ([pred coll]\n (lazy-seq\n (when-let [s (seq coll)]\n (if (chunked-seq? s)\n (let [c (chunk-first s)\n size (count c)\n b (chunk-buffer size)]\n (dotimes [i size]\n (let [v (.nth c i)]\n (when (pred v)\n (chunk-append b v))))\n (chunk-cons (chunk b) (filter pred (chunk-rest s))))\n (let [f (first s) r (rest s)]\n (if (pred f)\n (cons f (filter pred r))\n (filter pred r))))))))\n\n\n(defn remove\n \"Returns a lazy sequence of the items in coll for which\n (pred item) returns false. pred must be free of side-effects.\n Returns a transducer when no collection is provided.\"\n {:added \"1.0\"\n :static true}\n ([pred] (filter (complement pred)))\n ([pred coll]\n (filter (complement pred) coll)))\n\n(defn reduced\n \"Wraps x in a way such that a reduce will terminate with the value x\"\n {:added \"1.5\"}\n [x]\n (clojure.lang.Reduced. x))\n\n(defn reduced?\n \"Returns true if x is the result of a call to reduced\"\n {:inline (fn [x] `(clojure.lang.RT/isReduced ~x ))\n :inline-arities #{1}\n :added \"1.5\"}\n ([x] (clojure.lang.RT/isReduced x)))\n\n(defn ensure-reduced\n \"If x is already reduced?, returns it, else returns (reduced x)\"\n {:added \"1.7\"}\n [x]\n (if (reduced? x) x (reduced x)))\n\n(defn unreduced\n \"If x is reduced?, returns (deref x), else returns x\"\n {:added \"1.7\"}\n [x]\n (if (reduced? x) (deref x) x))\n\n(defn take\n \"Returns a lazy sequence of the first n items in coll, or all items if\n there are fewer than n. Returns a stateful transducer when\n no collection is provided.\"\n {:added \"1.0\"\n :static true}\n ([n]\n (fn [rf]\n (let [nv (volatile! n)]\n (fn\n ([] (rf))\n ([result] (rf result))\n ([result input]\n (let [n @nv\n nn (vswap! nv dec)\n result (if (pos? n)\n (rf result input)\n result)]\n (if (not (pos? nn))\n (ensure-reduced result)\n result)))))))\n ([n coll]\n (lazy-seq\n (when (pos? n) \n (when-let [s (seq coll)]\n (cons (first s) (take (dec n) (rest s))))))))\n\n(defn take-while\n \"Returns a lazy sequence of successive items from coll while\n (pred item) returns true. pred must be free of side-effects.\n Returns a transducer when no collection is provided.\"\n {:added \"1.0\"\n :static true}\n ([pred]\n (fn [rf]\n (fn\n ([] (rf))\n ([result] (rf result))\n ([result input]\n (if (pred input)\n (rf result input)\n (reduced result))))))\n ([pred coll]\n (lazy-seq\n (when-let [s (seq coll)]\n (when (pred (first s))\n (cons (first s) (take-while pred (rest s))))))))\n\n(defn drop\n \"Returns a lazy sequence of all but the first n items in coll.\n Returns a stateful transducer when no collection is provided.\"\n {:added \"1.0\"\n :static true}\n ([n]\n (fn [rf]\n (let [nv (volatile! n)]\n (fn\n ([] (rf))\n ([result] (rf result))\n ([result input]\n (let [n @nv]\n (vswap! nv dec)\n (if (pos? n)\n result\n (rf result input))))))))\n ([n coll]\n (let [step (fn [n coll]\n (let [s (seq coll)]\n (if (and (pos? n) s)\n (recur (dec n) (rest s))\n s)))]\n (lazy-seq (step n coll)))))\n\n(defn drop-last\n \"Return a lazy sequence of all but the last n (default 1) items in coll\"\n {:added \"1.0\"\n :static true}\n ([s] (drop-last 1 s))\n ([n s] (map (fn [x _] x) s (drop n s))))\n\n(defn take-last\n \"Returns a seq of the last n items in coll. Depending on the type\n of coll may be no better than linear time. For vectors, see also subvec.\"\n {:added \"1.1\"\n :static true}\n [n coll]\n (loop [s (seq coll), lead (seq (drop n coll))]\n (if lead\n (recur (next s) (next lead))\n s)))\n\n(defn drop-while\n \"Returns a lazy sequence of the items in coll starting from the\n first item for which (pred item) returns logical false. Returns a\n stateful transducer when no collection is provided.\"\n {:added \"1.0\"\n :static true}\n ([pred]\n (fn [rf]\n (let [dv (volatile! true)]\n (fn\n ([] (rf))\n ([result] (rf result))\n ([result input]\n (let [drop? @dv]\n (if (and drop? (pred input))\n result\n (do\n (vreset! dv nil)\n (rf result input)))))))))\n ([pred coll]\n (let [step (fn [pred coll]\n (let [s (seq coll)]\n (if (and s (pred (first s)))\n (recur pred (rest s))\n s)))]\n (lazy-seq (step pred coll)))))\n\n(defn cycle\n \"Returns a lazy (infinite!) sequence of repetitions of the items in coll.\"\n {:added \"1.0\"\n :static true}\n [coll] (clojure.lang.Cycle/create (seq coll)))\n\n(defn split-at\n \"Returns a vector of [(take n coll) (drop n coll)]\"\n {:added \"1.0\"\n :static true}\n [n coll]\n [(take n coll) (drop n coll)])\n\n(defn split-with\n \"Returns a vector of [(take-while pred coll) (drop-while pred coll)]\"\n {:added \"1.0\"\n :static true}\n [pred coll]\n [(take-while pred coll) (drop-while pred coll)])\n\n(defn repeat\n \"Returns a lazy (infinite!, or length n if supplied) sequence of xs.\"\n {:added \"1.0\"\n :static true}\n ([x] (clojure.lang.Repeat/create x))\n ([n x] (clojure.lang.Repeat/create n x)))\n\n(defn replicate\n \"DEPRECATED: Use 'repeat' instead.\n Returns a lazy seq of n xs.\"\n {:added \"1.0\"\n :deprecated \"1.3\"}\n [n x] (take n (repeat x)))\n\n(defn iterate\n \"Returns a lazy sequence of x, (f x), (f (f x)) etc. f must be free of side-effects\"\n {:added \"1.0\"\n :static true}\n [f x] (clojure.lang.Iterate/create f x) )\n\n(defn range\n \"Returns a lazy seq of nums from start (inclusive) to end\n (exclusive), by step, where start defaults to 0, step to 1, and end to\n infinity. When step is equal to 0, returns an infinite sequence of\n start. When start is equal to end, returns empty list.\"\n {:added \"1.0\"\n :static true}\n ([]\n (iterate inc' 0))\n ([end]\n (if (instance? Long end)\n (clojure.lang.LongRange/create end)\n (clojure.lang.Range/create end)))\n ([start end]\n (if (and (instance? Long start) (instance? Long end))\n (clojure.lang.LongRange/create start end)\n (clojure.lang.Range/create start end)))\n ([start end step]\n (if (and (instance? Long start) (instance? Long end) (instance? Long step))\n (clojure.lang.LongRange/create start end step)\n (clojure.lang.Range/create start end step))))\n\n(defn merge\n \"Returns a map that consists of the rest of the maps conj-ed onto\n the first. If a key occurs in more than one map, the mapping from\n the latter (left-to-right) will be the mapping in the result.\"\n {:added \"1.0\"\n :static true}\n [& maps]\n (when (some identity maps)\n (reduce1 #(conj (or %1 {}) %2) maps)))\n\n(defn merge-with\n \"Returns a map that consists of the rest of the maps conj-ed onto\n the first. If a key occurs in more than one map, the mapping(s)\n from the latter (left-to-right) will be combined with the mapping in\n the result by calling (f val-in-result val-in-latter).\"\n {:added \"1.0\"\n :static true}\n [f & maps]\n (when (some identity maps)\n (let [merge-entry (fn [m e]\n\t\t\t(let [k (key e) v (val e)]\n\t\t\t (if (contains? m k)\n\t\t\t (assoc m k (f (get m k) v))\n\t\t\t (assoc m k v))))\n merge2 (fn [m1 m2]\n\t\t (reduce1 merge-entry (or m1 {}) (seq m2)))]\n (reduce1 merge2 maps))))\n\n\n\n(defn zipmap\n \"Returns a map with the keys mapped to the corresponding vals.\"\n {:added \"1.0\"\n :static true}\n [keys vals]\n (loop [map {}\n ks (seq keys)\n vs (seq vals)]\n (if (and ks vs)\n (recur (assoc map (first ks) (first vs))\n (next ks)\n (next vs))\n map)))\n\n(defn line-seq\n \"Returns the lines of text from rdr as a lazy sequence of strings.\n rdr must implement java.io.BufferedReader.\"\n {:added \"1.0\"\n :static true}\n [^java.io.BufferedReader rdr]\n (when-let [line (.readLine rdr)]\n (cons line (lazy-seq (line-seq rdr)))))\n\n(defn comparator\n \"Returns an implementation of java.util.Comparator based upon pred.\"\n {:added \"1.0\"\n :static true}\n [pred]\n (fn [x y]\n (cond (pred x y) -1 (pred y x) 1 :else 0)))\n\n(defn sort\n \"Returns a sorted sequence of the items in coll. If no comparator is\n supplied, uses compare. comparator must implement\n java.util.Comparator. If coll is a Java array, it will be modified.\n To avoid this, sort a copy of the array.\"\n {:added \"1.0\"\n :static true}\n ([coll]\n (sort compare coll))\n ([^java.util.Comparator comp coll]\n (if (seq coll)\n (let [a (to-array coll)]\n (. java.util.Arrays (sort a comp))\n (seq a))\n ())))\n\n(defn sort-by\n \"Returns a sorted sequence of the items in coll, where the sort\n order is determined by comparing (keyfn item). If no comparator is\n supplied, uses compare. comparator must implement\n java.util.Comparator. If coll is a Java array, it will be modified.\n To avoid this, sort a copy of the array.\"\n {:added \"1.0\"\n :static true}\n ([keyfn coll]\n (sort-by keyfn compare coll))\n ([keyfn ^java.util.Comparator comp coll]\n (sort (fn [x y] (. comp (compare (keyfn x) (keyfn y)))) coll)))\n\n(defn dorun\n \"When lazy sequences are produced via functions that have side\n effects, any effects other than those needed to produce the first\n element in the seq do not occur until the seq is consumed. dorun can\n be used to force any effects. Walks through the successive nexts of\n the seq, does not retain the head and returns nil.\"\n {:added \"1.0\"\n :static true}\n ([coll]\n (when-let [s (seq coll)]\n (recur (next s))))\n ([n coll]\n (when (and (seq coll) (pos? n))\n (recur (dec n) (next coll)))))\n\n(defn doall\n \"When lazy sequences are produced via functions that have side\n effects, any effects other than those needed to produce the first\n element in the seq do not occur until the seq is consumed. doall can\n be used to force any effects. Walks through the successive nexts of\n the seq, retains the head and returns it, thus causing the entire\n seq to reside in memory at one time.\"\n {:added \"1.0\"\n :static true}\n ([coll]\n (dorun coll)\n coll)\n ([n coll]\n (dorun n coll)\n coll))\n\n(defn nthnext\n \"Returns the nth next of coll, (seq coll) when n is 0.\"\n {:added \"1.0\"\n :static true}\n [coll n]\n (loop [n n xs (seq coll)]\n (if (and xs (pos? n))\n (recur (dec n) (next xs))\n xs)))\n\n(defn nthrest\n \"Returns the nth rest of coll, coll when n is 0.\"\n {:added \"1.3\"\n :static true}\n [coll n]\n (loop [n n xs coll]\n (if-let [xs (and (pos? n) (seq xs))]\n (recur (dec n) (rest xs))\n xs)))\n\n(defn partition\n \"Returns a lazy sequence of lists of n items each, at offsets step\n apart. If step is not supplied, defaults to n, i.e. the partitions\n do not overlap. If a pad collection is supplied, use its elements as\n necessary to complete last partition upto n items. In case there are\n not enough padding elements, return a partition with less than n items.\"\n {:added \"1.0\"\n :static true}\n ([n coll]\n (partition n n coll))\n ([n step coll]\n (lazy-seq\n (when-let [s (seq coll)]\n (let [p (doall (take n s))]\n (when (= n (count p))\n (cons p (partition n step (nthrest s step))))))))\n ([n step pad coll]\n (lazy-seq\n (when-let [s (seq coll)]\n (let [p (doall (take n s))]\n (if (= n (count p))\n (cons p (partition n step pad (nthrest s step)))\n (list (take n (concat p pad)))))))))\n\n;; evaluation\n\n(defn eval\n \"Evaluates the form data structure (not text!) and returns the result.\"\n {:added \"1.0\"\n :static true}\n [form] (. clojure.lang.Compiler (eval form)))\n\n(defmacro doseq\n \"Repeatedly executes body (presumably for side-effects) with\n bindings and filtering as provided by \\\"for\\\". Does not retain\n the head of the sequence. Returns nil.\"\n {:added \"1.0\"}\n [seq-exprs & body]\n (assert-args\n (vector? seq-exprs) \"a vector for its binding\"\n (even? (count seq-exprs)) \"an even number of forms in binding vector\")\n (let [step (fn step [recform exprs]\n (if-not exprs\n [true `(do ~@body)]\n (let [k (first exprs)\n v (second exprs)]\n (if (keyword? k)\n (let [steppair (step recform (nnext exprs))\n needrec (steppair 0)\n subform (steppair 1)]\n (cond\n (= k :let) [needrec `(let ~v ~subform)]\n (= k :while) [false `(when ~v\n ~subform\n ~@(when needrec [recform]))]\n (= k :when) [false `(if ~v\n (do\n ~subform\n ~@(when needrec [recform]))\n ~recform)]))\n (let [seq- (gensym \"seq_\")\n chunk- (with-meta (gensym \"chunk_\")\n {:tag 'clojure.lang.IChunk})\n count- (gensym \"count_\")\n i- (gensym \"i_\")\n recform `(recur (next ~seq-) nil 0 0)\n steppair (step recform (nnext exprs))\n needrec (steppair 0)\n subform (steppair 1)\n recform-chunk\n `(recur ~seq- ~chunk- ~count- (unchecked-inc ~i-))\n steppair-chunk (step recform-chunk (nnext exprs))\n subform-chunk (steppair-chunk 1)]\n [true\n `(loop [~seq- (seq ~v), ~chunk- nil,\n ~count- 0, ~i- 0]\n (if (< ~i- ~count-)\n (let [~k (.nth ~chunk- ~i-)]\n ~subform-chunk\n ~@(when needrec [recform-chunk]))\n (when-let [~seq- (seq ~seq-)]\n (if (chunked-seq? ~seq-)\n (let [c# (chunk-first ~seq-)]\n (recur (chunk-rest ~seq-) c#\n (int (count c#)) (int 0)))\n (let [~k (first ~seq-)]\n ~subform\n ~@(when needrec [recform]))))))])))))]\n (nth (step nil (seq seq-exprs)) 1)))\n\n(defn await\n \"Blocks the current thread (indefinitely!) until all actions\n dispatched thus far, from this thread or agent, to the agent(s) have\n occurred. Will block on failed agents. Will never return if\n a failed agent is restarted with :clear-actions true.\"\n {:added \"1.0\"\n :static true}\n [& agents]\n (io! \"await in transaction\"\n (when *agent*\n (throw (new Exception \"Can't await in agent action\")))\n (let [latch (new java.util.concurrent.CountDownLatch (count agents))\n count-down (fn [agent] (. latch (countDown)) agent)]\n (doseq [agent agents]\n (send agent count-down))\n (. latch (await)))))\n\n(defn ^:static await1 [^clojure.lang.Agent a]\n (when (pos? (.getQueueCount a))\n (await a))\n a)\n\n(defn await-for\n \"Blocks the current thread until all actions dispatched thus\n far (from this thread or agent) to the agents have occurred, or the\n timeout (in milliseconds) has elapsed. Returns logical false if\n returning due to timeout, logical true otherwise.\"\n {:added \"1.0\"\n :static true}\n [timeout-ms & agents]\n (io! \"await-for in transaction\"\n (when *agent*\n (throw (new Exception \"Can't await in agent action\")))\n (let [latch (new java.util.concurrent.CountDownLatch (count agents))\n count-down (fn [agent] (. latch (countDown)) agent)]\n (doseq [agent agents]\n (send agent count-down))\n (. latch (await timeout-ms (. java.util.concurrent.TimeUnit MILLISECONDS))))))\n\n(defmacro dotimes\n \"bindings => name n\n\n Repeatedly executes body (presumably for side-effects) with name\n bound to integers from 0 through n-1.\"\n {:added \"1.0\"}\n [bindings & body]\n (assert-args\n (vector? bindings) \"a vector for its binding\"\n (= 2 (count bindings)) \"exactly 2 forms in binding vector\")\n (let [i (first bindings)\n n (second bindings)]\n `(let [n# (long ~n)]\n (loop [~i 0]\n (when (< ~i n#)\n ~@body\n (recur (unchecked-inc ~i)))))))\n\n#_(defn into\n \"Returns a new coll consisting of to-coll with all of the items of\n from-coll conjoined.\"\n {:added \"1.0\"}\n [to from]\n (let [ret to items (seq from)]\n (if items\n (recur (conj ret (first items)) (next items))\n ret)))\n\n;;;;;;;;;;;;;;;;;;;;; editable collections ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\n(defn transient\n \"Returns a new, transient version of the collection, in constant time.\"\n {:added \"1.1\"\n :static true}\n [^clojure.lang.IEditableCollection coll]\n (.asTransient coll))\n\n(defn persistent!\n \"Returns a new, persistent version of the transient collection, in\n constant time. The transient collection cannot be used after this\n call, any such use will throw an exception.\"\n {:added \"1.1\"\n :static true}\n [^clojure.lang.ITransientCollection coll]\n (.persistent coll))\n\n(defn conj!\n \"Adds x to the transient collection, and return coll. The 'addition'\n may happen at different 'places' depending on the concrete type.\"\n {:added \"1.1\"\n :static true}\n ([] (transient []))\n ([coll] coll)\n ([^clojure.lang.ITransientCollection coll x]\n (.conj coll x)))\n\n(defn assoc!\n \"When applied to a transient map, adds mapping of key(s) to\n val(s). When applied to a transient vector, sets the val at index.\n Note - index must be <= (count vector). Returns coll.\"\n {:added \"1.1\"\n :static true}\n ([^clojure.lang.ITransientAssociative coll key val] (.assoc coll key val))\n ([^clojure.lang.ITransientAssociative coll key val & kvs]\n (let [ret (.assoc coll key val)]\n (if kvs\n (recur ret (first kvs) (second kvs) (nnext kvs))\n ret))))\n\n(defn dissoc!\n \"Returns a transient map that doesn't contain a mapping for key(s).\"\n {:added \"1.1\"\n :static true}\n ([^clojure.lang.ITransientMap map key] (.without map key))\n ([^clojure.lang.ITransientMap map key & ks]\n (let [ret (.without map key)]\n (if ks\n (recur ret (first ks) (next ks))\n ret))))\n\n(defn pop!\n \"Removes the last item from a transient vector. If\n the collection is empty, throws an exception. Returns coll\"\n {:added \"1.1\"\n :static true}\n [^clojure.lang.ITransientVector coll]\n (.pop coll))\n\n(defn disj!\n \"disj[oin]. Returns a transient set of the same (hashed/sorted) type, that\n does not contain key(s).\"\n {:added \"1.1\"\n :static true}\n ([set] set)\n ([^clojure.lang.ITransientSet set key]\n (. set (disjoin key)))\n ([^clojure.lang.ITransientSet set key & ks]\n (let [ret (. set (disjoin key))]\n (if ks\n (recur ret (first ks) (next ks))\n ret))))\n\n;redef into with batch support\n(defn ^:private into1\n \"Returns a new coll consisting of to-coll with all of the items of\n from-coll conjoined.\"\n {:added \"1.0\"\n :static true}\n [to from]\n (if (instance? clojure.lang.IEditableCollection to)\n (persistent! (reduce1 conj! (transient to) from))\n (reduce1 conj to from)))\n\n(defmacro import\n \"import-list => (package-symbol class-name-symbols*)\n\n For each name in class-name-symbols, adds a mapping from name to the\n class named by package.name to the current namespace. Use :import in the ns\n macro in preference to calling this directly.\"\n {:added \"1.0\"}\n [& import-symbols-or-lists]\n (let [specs (map #(if (and (seq? %) (= 'quote (first %))) (second %) %)\n import-symbols-or-lists)]\n `(do ~@(map #(list 'clojure.core/import* %)\n (reduce1 (fn [v spec]\n (if (symbol? spec)\n (conj v (name spec))\n (let [p (first spec) cs (rest spec)]\n (into1 v (map #(str p \".\" %) cs)))))\n [] specs)))))\n\n(defn into-array\n \"Returns an array with components set to the values in aseq. The array's\n component type is type if provided, or the type of the first value in\n aseq if present, or Object. All values in aseq must be compatible with\n the component type. Class objects for the primitive types can be obtained\n using, e.g., Integer/TYPE.\"\n {:added \"1.0\"\n :static true}\n ([aseq]\n (clojure.lang.RT/seqToTypedArray (seq aseq)))\n ([type aseq]\n (clojure.lang.RT/seqToTypedArray type (seq aseq))))\n\n(defn ^{:private true}\n array [& items]\n (into-array items))\n\n(defn class\n \"Returns the Class of x\"\n {:added \"1.0\"\n :static true}\n ^Class [^Object x] (if (nil? x) x (. x (getClass))))\n\n(defn type\n \"Returns the :type metadata of x, or its Class if none\"\n {:added \"1.0\"\n :static true}\n [x]\n (or (get (meta x) :type) (class x)))\n\n(defn num\n \"Coerce to Number\"\n {:tag Number\n :inline (fn [x] `(. clojure.lang.Numbers (num ~x)))\n :added \"1.0\"}\n [x] (. clojure.lang.Numbers (num x)))\n\n(defn long\n \"Coerce to long\"\n {:inline (fn [x] `(. clojure.lang.RT (longCast ~x)))\n :added \"1.0\"}\n [^Number x] (clojure.lang.RT/longCast x))\n\n(defn float\n \"Coerce to float\"\n {:inline (fn [x] `(. clojure.lang.RT (~(if *unchecked-math* 'uncheckedFloatCast 'floatCast) ~x)))\n :added \"1.0\"}\n [^Number x] (clojure.lang.RT/floatCast x))\n\n(defn double\n \"Coerce to double\"\n {:inline (fn [x] `(. clojure.lang.RT (doubleCast ~x)))\n :added \"1.0\"}\n [^Number x] (clojure.lang.RT/doubleCast x))\n\n(defn short\n \"Coerce to short\"\n {:inline (fn [x] `(. clojure.lang.RT (~(if *unchecked-math* 'uncheckedShortCast 'shortCast) ~x)))\n :added \"1.0\"}\n [^Number x] (clojure.lang.RT/shortCast x))\n\n(defn byte\n \"Coerce to byte\"\n {:inline (fn [x] `(. clojure.lang.RT (~(if *unchecked-math* 'uncheckedByteCast 'byteCast) ~x)))\n :added \"1.0\"}\n [^Number x] (clojure.lang.RT/byteCast x))\n\n(defn char\n \"Coerce to char\"\n {:inline (fn [x] `(. clojure.lang.RT (~(if *unchecked-math* 'uncheckedCharCast 'charCast) ~x)))\n :added \"1.1\"}\n [x] (. clojure.lang.RT (charCast x)))\n\n(defn boolean\n \"Coerce to boolean\"\n {\n :inline (fn [x] `(. clojure.lang.RT (booleanCast ~x)))\n :added \"1.0\"}\n [x] (clojure.lang.RT/booleanCast x))\n\n(defn unchecked-byte\n \"Coerce to byte. Subject to rounding or truncation.\"\n {:inline (fn [x] `(. clojure.lang.RT (uncheckedByteCast ~x)))\n :added \"1.3\"}\n [^Number x] (clojure.lang.RT/uncheckedByteCast x))\n\n(defn unchecked-short\n \"Coerce to short. Subject to rounding or truncation.\"\n {:inline (fn [x] `(. clojure.lang.RT (uncheckedShortCast ~x)))\n :added \"1.3\"}\n [^Number x] (clojure.lang.RT/uncheckedShortCast x))\n\n(defn unchecked-char\n \"Coerce to char. Subject to rounding or truncation.\"\n {:inline (fn [x] `(. clojure.lang.RT (uncheckedCharCast ~x)))\n :added \"1.3\"}\n [x] (. clojure.lang.RT (uncheckedCharCast x)))\n\n(defn unchecked-int\n \"Coerce to int. Subject to rounding or truncation.\"\n {:inline (fn [x] `(. clojure.lang.RT (uncheckedIntCast ~x)))\n :added \"1.3\"}\n [^Number x] (clojure.lang.RT/uncheckedIntCast x))\n\n(defn unchecked-long\n \"Coerce to long. Subject to rounding or truncation.\"\n {:inline (fn [x] `(. clojure.lang.RT (uncheckedLongCast ~x)))\n :added \"1.3\"}\n [^Number x] (clojure.lang.RT/uncheckedLongCast x))\n\n(defn unchecked-float\n \"Coerce to float. Subject to rounding.\"\n {:inline (fn [x] `(. clojure.lang.RT (uncheckedFloatCast ~x)))\n :added \"1.3\"}\n [^Number x] (clojure.lang.RT/uncheckedFloatCast x))\n\n(defn unchecked-double\n \"Coerce to double. Subject to rounding.\"\n {:inline (fn [x] `(. clojure.lang.RT (uncheckedDoubleCast ~x)))\n :added \"1.3\"}\n [^Number x] (clojure.lang.RT/uncheckedDoubleCast x))\n\n\n(defn number?\n \"Returns true if x is a Number\"\n {:added \"1.0\"\n :static true}\n [x]\n (instance? Number x))\n\n(defn mod\n \"Modulus of num and div. Truncates toward negative infinity.\"\n {:added \"1.0\"\n :static true}\n [num div]\n (let [m (rem num div)]\n (if (or (zero? m) (= (pos? num) (pos? div)))\n m\n (+ m div))))\n\n(defn ratio?\n \"Returns true if n is a Ratio\"\n {:added \"1.0\"\n :static true}\n [n] (instance? clojure.lang.Ratio n))\n\n(defn numerator\n \"Returns the numerator part of a Ratio.\"\n {:tag BigInteger\n :added \"1.2\"\n :static true}\n [r]\n (.numerator ^clojure.lang.Ratio r))\n\n(defn denominator\n \"Returns the denominator part of a Ratio.\"\n {:tag BigInteger\n :added \"1.2\"\n :static true}\n [r]\n (.denominator ^clojure.lang.Ratio r))\n\n(defn decimal?\n \"Returns true if n is a BigDecimal\"\n {:added \"1.0\"\n :static true}\n [n] (instance? BigDecimal n))\n\n(defn float?\n \"Returns true if n is a floating point number\"\n {:added \"1.0\"\n :static true}\n [n]\n (or (instance? Double n)\n (instance? Float n)))\n\n(defn rational?\n \"Returns true if n is a rational number\"\n {:added \"1.0\"\n :static true}\n [n]\n (or (integer? n) (ratio? n) (decimal? n)))\n\n(defn bigint\n \"Coerce to BigInt\"\n {:tag clojure.lang.BigInt\n :static true\n :added \"1.3\"}\n [x] (cond\n (instance? clojure.lang.BigInt x) x\n (instance? BigInteger x) (clojure.lang.BigInt/fromBigInteger x)\n (decimal? x) (bigint (.toBigInteger ^BigDecimal x))\n (float? x) (bigint (. BigDecimal valueOf (double x)))\n (ratio? x) (bigint (.bigIntegerValue ^clojure.lang.Ratio x))\n (number? x) (clojure.lang.BigInt/valueOf (long x))\n :else (bigint (BigInteger. ^String x))))\n\n(defn biginteger\n \"Coerce to BigInteger\"\n {:tag BigInteger\n :added \"1.0\"\n :static true}\n [x] (cond\n (instance? BigInteger x) x\n (instance? clojure.lang.BigInt x) (.toBigInteger ^clojure.lang.BigInt x)\n (decimal? x) (.toBigInteger ^BigDecimal x)\n (float? x) (.toBigInteger (. BigDecimal valueOf (double x)))\n (ratio? x) (.bigIntegerValue ^clojure.lang.Ratio x)\n (number? x) (BigInteger/valueOf (long x))\n :else (BigInteger. ^String x)))\n\n(defn bigdec\n \"Coerce to BigDecimal\"\n {:tag BigDecimal\n :added \"1.0\"\n :static true}\n [x] (cond\n (decimal? x) x\n (float? x) (. BigDecimal valueOf (double x))\n (ratio? x) (/ (BigDecimal. (.numerator ^clojure.lang.Ratio x)) (.denominator ^clojure.lang.Ratio x))\n (instance? clojure.lang.BigInt x) (.toBigDecimal ^clojure.lang.BigInt x)\n (instance? BigInteger x) (BigDecimal. ^BigInteger x)\n (number? x) (BigDecimal/valueOf (long x))\n :else (BigDecimal. ^String x)))\n\n(def ^:dynamic ^{:private true} print-initialized false)\n\n(defmulti print-method (fn [x writer]\n (let [t (get (meta x) :type)]\n (if (keyword? t) t (class x)))))\n(defmulti print-dup (fn [x writer] (class x)))\n\n(defn pr-on\n {:private true\n :static true}\n [x w]\n (if *print-dup*\n (print-dup x w)\n (print-method x w))\n nil)\n\n(defn pr\n \"Prints the object(s) to the output stream that is the current value\n of *out*. Prints the object(s), separated by spaces if there is\n more than one. By default, pr and prn print in a way that objects\n can be read by the reader\"\n {:dynamic true\n :added \"1.0\"}\n ([] nil)\n ([x]\n (pr-on x *out*))\n ([x & more]\n (pr x)\n (. *out* (append \\space))\n (if-let [nmore (next more)]\n (recur (first more) nmore)\n (apply pr more))))\n\n(def ^:private ^String system-newline\n (System/getProperty \"line.separator\"))\n\n(defn newline\n \"Writes a platform-specific newline to *out*\"\n {:added \"1.0\"\n :static true}\n []\n (. *out* (append system-newline))\n nil)\n\n(defn flush\n \"Flushes the output stream that is the current value of\n *out*\"\n {:added \"1.0\"\n :static true}\n []\n (. *out* (flush))\n nil)\n\n(defn prn\n \"Same as pr followed by (newline). Observes *flush-on-newline*\"\n {:added \"1.0\"\n :static true}\n [& more]\n (apply pr more)\n (newline)\n (when *flush-on-newline*\n (flush)))\n\n(defn print\n \"Prints the object(s) to the output stream that is the current value\n of *out*. print and println produce output for human consumption.\"\n {:added \"1.0\"\n :static true}\n [& more]\n (binding [*print-readably* nil]\n (apply pr more)))\n\n(defn println\n \"Same as print followed by (newline)\"\n {:added \"1.0\"\n :static true}\n [& more]\n (binding [*print-readably* nil]\n (apply prn more)))\n\n(defn read\n \"Reads the next object from stream, which must be an instance of\n java.io.PushbackReader or some derivee. stream defaults to the\n current value of *in*.\n\n Opts is a persistent map with valid keys:\n :read-cond - :allow to process reader conditionals, or\n :preserve to keep all branches\n :features - persistent set of feature keywords for reader conditionals\n :eof - on eof, return value unless :eofthrow, then throw.\n if not specified, will throw\n\n Note that read can execute code (controlled by *read-eval*),\n and as such should be used only with trusted sources.\n\n For data structure interop use clojure.edn/read\"\n {:added \"1.0\"\n :static true}\n ([]\n (read *in*))\n ([stream]\n (read stream true nil))\n ([stream eof-error? eof-value]\n (read stream eof-error? eof-value false))\n ([stream eof-error? eof-value recursive?]\n (. clojure.lang.LispReader (read stream (boolean eof-error?) eof-value recursive?)))\n ([opts stream]\n (. clojure.lang.LispReader (read stream opts))))\n\n(defn read-line\n \"Reads the next line from stream that is the current value of *in* .\"\n {:added \"1.0\"\n :static true}\n []\n (if (instance? clojure.lang.LineNumberingPushbackReader *in*)\n (.readLine ^clojure.lang.LineNumberingPushbackReader *in*)\n (.readLine ^java.io.BufferedReader *in*)))\n\n(defn read-string\n \"Reads one object from the string s. Optionally include reader\n options, as specified in read.\n\n Note that read-string can execute code (controlled by *read-eval*),\n and as such should be used only with trusted sources.\n\n For data structure interop use clojure.edn/read-string\"\n {:added \"1.0\"\n :static true}\n ([s] (clojure.lang.RT/readString s))\n ([opts s] (clojure.lang.RT/readString s opts)))\n\n(defn subvec\n \"Returns a persistent vector of the items in vector from\n start (inclusive) to end (exclusive). If end is not supplied,\n defaults to (count vector). This operation is O(1) and very fast, as\n the resulting vector shares structure with the original and no\n trimming is done.\"\n {:added \"1.0\"\n :static true}\n ([v start]\n (subvec v start (count v)))\n ([v start end]\n (. clojure.lang.RT (subvec v start end))))\n\n(defmacro with-open\n \"bindings => [name init ...]\n\n Evaluates body in a try expression with names bound to the values\n of the inits, and a finally clause that calls (.close name) on each\n name in reverse order.\"\n {:added \"1.0\"}\n [bindings & body]\n (assert-args\n (vector? bindings) \"a vector for its binding\"\n (even? (count bindings)) \"an even number of forms in binding vector\")\n (cond\n (= (count bindings) 0) `(do ~@body)\n (symbol? (bindings 0)) `(let ~(subvec bindings 0 2)\n (try\n (with-open ~(subvec bindings 2) ~@body)\n (finally\n (. ~(bindings 0) close))))\n :else (throw (IllegalArgumentException.\n \"with-open only allows Symbols in bindings\"))))\n\n(defmacro doto\n \"Evaluates x then calls all of the methods and functions with the\n value of x supplied at the front of the given arguments. The forms\n are evaluated in order. Returns x.\n\n (doto (new java.util.HashMap) (.put \\\"a\\\" 1) (.put \\\"b\\\" 2))\"\n {:added \"1.0\"}\n [x & forms]\n (let [gx (gensym)]\n `(let [~gx ~x]\n ~@(map (fn [f]\n (if (seq? f)\n `(~(first f) ~gx ~@(next f))\n `(~f ~gx)))\n forms)\n ~gx)))\n\n(defmacro memfn\n \"Expands into code that creates a fn that expects to be passed an\n object and any args and calls the named instance method on the\n object passing the args. Use when you want to treat a Java method as\n a first-class fn. name may be type-hinted with the method receiver's\n type in order to avoid reflective calls.\"\n {:added \"1.0\"}\n [name & args]\n (let [t (with-meta (gensym \"target\")\n (meta name))]\n `(fn [~t ~@args]\n (. ~t (~name ~@args)))))\n\n(defmacro time\n \"Evaluates expr and prints the time it took. Returns the value of\n expr.\"\n {:added \"1.0\"}\n [expr]\n `(let [start# (. System (nanoTime))\n ret# ~expr]\n (prn (str \"Elapsed time: \" (/ (double (- (. System (nanoTime)) start#)) 1000000.0) \" msecs\"))\n ret#))\n\n\n\n(import '(java.lang.reflect Array))\n\n(defn alength\n \"Returns the length of the Java array. Works on arrays of all\n types.\"\n {:inline (fn [a] `(. clojure.lang.RT (alength ~a)))\n :added \"1.0\"}\n [array] (. clojure.lang.RT (alength array)))\n\n(defn aclone\n \"Returns a clone of the Java array. Works on arrays of known\n types.\"\n {:inline (fn [a] `(. clojure.lang.RT (aclone ~a)))\n :added \"1.0\"}\n [array] (. clojure.lang.RT (aclone array)))\n\n(defn aget\n \"Returns the value at the index/indices. Works on Java arrays of all\n types.\"\n {:inline (fn [a i] `(. clojure.lang.RT (aget ~a (int ~i))))\n :inline-arities #{2}\n :added \"1.0\"}\n ([array idx]\n (clojure.lang.Reflector/prepRet (.getComponentType (class array)) (. Array (get array idx))))\n ([array idx & idxs]\n (apply aget (aget array idx) idxs)))\n\n(defn aset\n \"Sets the value at the index/indices. Works on Java arrays of\n reference types. Returns val.\"\n {:inline (fn [a i v] `(. clojure.lang.RT (aset ~a (int ~i) ~v)))\n :inline-arities #{3}\n :added \"1.0\"}\n ([array idx val]\n (. Array (set array idx val))\n val)\n ([array idx idx2 & idxv]\n (apply aset (aget array idx) idx2 idxv)))\n\n(defmacro\n ^{:private true}\n def-aset [name method coerce]\n `(defn ~name\n {:arglists '([~'array ~'idx ~'val] [~'array ~'idx ~'idx2 & ~'idxv])}\n ([array# idx# val#]\n (. Array (~method array# idx# (~coerce val#)))\n val#)\n ([array# idx# idx2# & idxv#]\n (apply ~name (aget array# idx#) idx2# idxv#))))\n\n(def-aset\n ^{:doc \"Sets the value at the index/indices. Works on arrays of int. Returns val.\"\n :added \"1.0\"}\n aset-int setInt int)\n\n(def-aset\n ^{:doc \"Sets the value at the index/indices. Works on arrays of long. Returns val.\"\n :added \"1.0\"}\n aset-long setLong long)\n\n(def-aset\n ^{:doc \"Sets the value at the index/indices. Works on arrays of boolean. Returns val.\"\n :added \"1.0\"}\n aset-boolean setBoolean boolean)\n\n(def-aset\n ^{:doc \"Sets the value at the index/indices. Works on arrays of float. Returns val.\"\n :added \"1.0\"}\n aset-float setFloat float)\n\n(def-aset\n ^{:doc \"Sets the value at the index/indices. Works on arrays of double. Returns val.\"\n :added \"1.0\"}\n aset-double setDouble double)\n\n(def-aset\n ^{:doc \"Sets the value at the index/indices. Works on arrays of short. Returns val.\"\n :added \"1.0\"}\n aset-short setShort short)\n\n(def-aset\n ^{:doc \"Sets the value at the index/indices. Works on arrays of byte. Returns val.\"\n :added \"1.0\"}\n aset-byte setByte byte)\n\n(def-aset\n ^{:doc \"Sets the value at the index/indices. Works on arrays of char. Returns val.\"\n :added \"1.0\"}\n aset-char setChar char)\n\n(defn make-array\n \"Creates and returns an array of instances of the specified class of\n the specified dimension(s). Note that a class object is required.\n Class objects can be obtained by using their imported or\n fully-qualified name. Class objects for the primitive types can be\n obtained using, e.g., Integer/TYPE.\"\n {:added \"1.0\"\n :static true}\n ([^Class type len]\n (. Array (newInstance type (int len))))\n ([^Class type dim & more-dims]\n (let [dims (cons dim more-dims)\n ^\"[I\" dimarray (make-array (. Integer TYPE) (count dims))]\n (dotimes [i (alength dimarray)]\n (aset-int dimarray i (nth dims i)))\n (. Array (newInstance type dimarray)))))\n\n(defn to-array-2d\n \"Returns a (potentially-ragged) 2-dimensional array of Objects\n containing the contents of coll, which can be any Collection of any\n Collection.\"\n {:tag \"[[Ljava.lang.Object;\"\n :added \"1.0\"\n :static true}\n [^java.util.Collection coll]\n (let [ret (make-array (. Class (forName \"[Ljava.lang.Object;\")) (. coll (size)))]\n (loop [i 0 xs (seq coll)]\n (when xs\n (aset ret i (to-array (first xs)))\n (recur (inc i) (next xs))))\n ret))\n\n(defn macroexpand-1\n \"If form represents a macro form, returns its expansion,\n else returns form.\"\n {:added \"1.0\"\n :static true}\n [form]\n (. clojure.lang.Compiler (macroexpand1 form)))\n\n(defn macroexpand\n \"Repeatedly calls macroexpand-1 on form until it no longer\n represents a macro form, then returns it. Note neither\n macroexpand-1 nor macroexpand expand macros in subforms.\"\n {:added \"1.0\"\n :static true}\n [form]\n (let [ex (macroexpand-1 form)]\n (if (identical? ex form)\n form\n (macroexpand ex))))\n\n(defn create-struct\n \"Returns a structure basis object.\"\n {:added \"1.0\"\n :static true}\n [& keys]\n (. clojure.lang.PersistentStructMap (createSlotMap keys)))\n\n(defmacro defstruct\n \"Same as (def name (create-struct keys...))\"\n {:added \"1.0\"\n :static true}\n [name & keys]\n `(def ~name (create-struct ~@keys)))\n\n(defn struct-map\n \"Returns a new structmap instance with the keys of the\n structure-basis. keyvals may contain all, some or none of the basis\n keys - where values are not supplied they will default to nil.\n keyvals can also contain keys not in the basis.\"\n {:added \"1.0\"\n :static true}\n [s & inits]\n (. clojure.lang.PersistentStructMap (create s inits)))\n\n(defn struct\n \"Returns a new structmap instance with the keys of the\n structure-basis. vals must be supplied for basis keys in order -\n where values are not supplied they will default to nil.\"\n {:added \"1.0\"\n :static true}\n [s & vals]\n (. clojure.lang.PersistentStructMap (construct s vals)))\n\n(defn accessor\n \"Returns a fn that, given an instance of a structmap with the basis,\n returns the value at the key. The key must be in the basis. The\n returned function should be (slightly) more efficient than using\n get, but such use of accessors should be limited to known\n performance-critical areas.\"\n {:added \"1.0\"\n :static true}\n [s key]\n (. clojure.lang.PersistentStructMap (getAccessor s key)))\n\n(defn load-reader\n \"Sequentially read and evaluate the set of forms contained in the\n stream/file\"\n {:added \"1.0\"\n :static true}\n [rdr] (. clojure.lang.Compiler (load rdr)))\n\n(defn load-string\n \"Sequentially read and evaluate the set of forms contained in the\n string\"\n {:added \"1.0\"\n :static true}\n [s]\n (let [rdr (-> (java.io.StringReader. s)\n (clojure.lang.LineNumberingPushbackReader.))]\n (load-reader rdr)))\n\n(defn set?\n \"Returns true if x implements IPersistentSet\"\n {:added \"1.0\"\n :static true}\n [x] (instance? clojure.lang.IPersistentSet x))\n\n(defn set\n \"Returns a set of the distinct elements of coll.\"\n {:added \"1.0\"\n :static true}\n [coll]\n (if (set? coll)\n (with-meta coll nil)\n (if (instance? clojure.lang.IReduceInit coll)\n (persistent! (.reduce ^clojure.lang.IReduceInit coll conj! (transient #{})))\n (persistent! (reduce1 conj! (transient #{}) coll)))))\n\n(defn ^{:private true\n :static true}\n filter-key [keyfn pred amap]\n (loop [ret {} es (seq amap)]\n (if es\n (if (pred (keyfn (first es)))\n (recur (assoc ret (key (first es)) (val (first es))) (next es))\n (recur ret (next es)))\n ret)))\n\n(defn find-ns\n \"Returns the namespace named by the symbol or nil if it doesn't exist.\"\n {:added \"1.0\"\n :static true}\n [sym] (clojure.lang.Namespace/find sym))\n\n(defn create-ns\n \"Create a new namespace named by the symbol if one doesn't already\n exist, returns it or the already-existing namespace of the same\n name.\"\n {:added \"1.0\"\n :static true}\n [sym] (clojure.lang.Namespace/findOrCreate sym))\n\n(defn remove-ns\n \"Removes the namespace named by the symbol. Use with caution.\n Cannot be used to remove the clojure namespace.\"\n {:added \"1.0\"\n :static true}\n [sym] (clojure.lang.Namespace/remove sym))\n\n(defn all-ns\n \"Returns a sequence of all namespaces.\"\n {:added \"1.0\"\n :static true}\n [] (clojure.lang.Namespace/all))\n\n(defn the-ns\n \"If passed a namespace, returns it. Else, when passed a symbol,\n returns the namespace named by it, throwing an exception if not\n found.\"\n {:added \"1.0\"\n :static true}\n ^clojure.lang.Namespace [x]\n (if (instance? clojure.lang.Namespace x)\n x\n (or (find-ns x) (throw (Exception. (str \"No namespace: \" x \" found\"))))))\n\n(defn ns-name\n \"Returns the name of the namespace, a symbol.\"\n {:added \"1.0\"\n :static true}\n [ns]\n (.getName (the-ns ns)))\n\n(defn ns-map\n \"Returns a map of all the mappings for the namespace.\"\n {:added \"1.0\"\n :static true}\n [ns]\n (.getMappings (the-ns ns)))\n\n(defn ns-unmap\n \"Removes the mappings for the symbol from the namespace.\"\n {:added \"1.0\"\n :static true}\n [ns sym]\n (.unmap (the-ns ns) sym))\n\n;(defn export [syms]\n; (doseq [sym syms]\n; (.. *ns* (intern sym) (setExported true))))\n\n(defn ns-publics\n \"Returns a map of the public intern mappings for the namespace.\"\n {:added \"1.0\"\n :static true}\n [ns]\n (let [ns (the-ns ns)]\n (filter-key val (fn [^clojure.lang.Var v] (and (instance? clojure.lang.Var v)\n (= ns (.ns v))\n (.isPublic v)))\n (ns-map ns))))\n\n(defn ns-imports\n \"Returns a map of the import mappings for the namespace.\"\n {:added \"1.0\"\n :static true}\n [ns]\n (filter-key val (partial instance? Class) (ns-map ns)))\n\n(defn ns-interns\n \"Returns a map of the intern mappings for the namespace.\"\n {:added \"1.0\"\n :static true}\n [ns]\n (let [ns (the-ns ns)]\n (filter-key val (fn [^clojure.lang.Var v] (and (instance? clojure.lang.Var v)\n (= ns (.ns v))))\n (ns-map ns))))\n\n(defn refer\n \"refers to all public vars of ns, subject to filters.\n filters can include at most one each of:\n\n :exclude list-of-symbols\n :only list-of-symbols\n :rename map-of-fromsymbol-tosymbol\n\n For each public interned var in the namespace named by the symbol,\n adds a mapping from the name of the var to the var to the current\n namespace. Throws an exception if name is already mapped to\n something else in the current namespace. Filters can be used to\n select a subset, via inclusion or exclusion, or to provide a mapping\n to a symbol different from the var's name, in order to prevent\n clashes. Use :use in the ns macro in preference to calling this directly.\"\n {:added \"1.0\"}\n [ns-sym & filters]\n (let [ns (or (find-ns ns-sym) (throw (new Exception (str \"No namespace: \" ns-sym))))]\n (.referNs *ns* ns (apply hash-map filters))))\n\n(defn ns-refers\n \"Returns a map of the refer mappings for the namespace.\"\n {:added \"1.0\"\n :static true}\n [ns]\n (let [ns (the-ns ns)]\n (filter-key val (fn [^clojure.lang.Var v] (and (instance? clojure.lang.Var v)\n (not= ns (.ns v))))\n (ns-map ns))))\n\n(defn alias\n \"Add an alias in the current namespace to another\n namespace. Arguments are two symbols: the alias to be used, and\n the symbolic name of the target namespace. Use :as in the ns macro in preference\n to calling this directly.\"\n {:added \"1.0\"\n :static true}\n [alias namespace-sym]\n (.addAlias *ns* alias (the-ns namespace-sym)))\n\n(defn ns-aliases\n \"Returns a map of the aliases for the namespace.\"\n {:added \"1.0\"\n :static true}\n [ns]\n (.getAliases (the-ns ns)))\n\n(defn ns-unalias\n \"Removes the alias for the symbol from the namespace.\"\n {:added \"1.0\"\n :static true}\n [ns sym]\n (.removeAlias (the-ns ns) sym))\n\n(defn take-nth\n \"Returns a lazy seq of every nth item in coll. Returns a stateful\n transducer when no collection is provided.\"\n {:added \"1.0\"\n :static true}\n ([n]\n (fn [rf]\n (let [iv (volatile! -1)]\n (fn\n ([] (rf))\n ([result] (rf result))\n ([result input]\n (let [i (vswap! iv inc)]\n (if (zero? (rem i n))\n (rf result input)\n result)))))))\n ([n coll]\n (lazy-seq\n (when-let [s (seq coll)]\n (cons (first s) (take-nth n (drop n s)))))))\n\n(defn interleave\n \"Returns a lazy seq of the first item in each coll, then the second etc.\"\n {:added \"1.0\"\n :static true}\n ([] ())\n ([c1] (lazy-seq c1))\n ([c1 c2]\n (lazy-seq\n (let [s1 (seq c1) s2 (seq c2)]\n (when (and s1 s2)\n (cons (first s1) (cons (first s2)\n (interleave (rest s1) (rest s2))))))))\n ([c1 c2 & colls]\n (lazy-seq\n (let [ss (map seq (conj colls c2 c1))]\n (when (every? identity ss)\n (concat (map first ss) (apply interleave (map rest ss))))))))\n\n(defn var-get\n \"Gets the value in the var object\"\n {:added \"1.0\"\n :static true}\n [^clojure.lang.Var x] (. x (get)))\n\n(defn var-set\n \"Sets the value in the var object to val. The var must be\n thread-locally bound.\"\n {:added \"1.0\"\n :static true}\n [^clojure.lang.Var x val] (. x (set val)))\n\n(defmacro with-local-vars\n \"varbinding=> symbol init-expr\n\n Executes the exprs in a context in which the symbols are bound to\n vars with per-thread bindings to the init-exprs. The symbols refer\n to the var objects themselves, and must be accessed with var-get and\n var-set\"\n {:added \"1.0\"}\n [name-vals-vec & body]\n (assert-args\n (vector? name-vals-vec) \"a vector for its binding\"\n (even? (count name-vals-vec)) \"an even number of forms in binding vector\")\n `(let [~@(interleave (take-nth 2 name-vals-vec)\n (repeat '(.. clojure.lang.Var create setDynamic)))]\n (. clojure.lang.Var (pushThreadBindings (hash-map ~@name-vals-vec)))\n (try\n ~@body\n (finally (. clojure.lang.Var (popThreadBindings))))))\n\n(defn ns-resolve\n \"Returns the var or Class to which a symbol will be resolved in the\n namespace (unless found in the environment), else nil. Note that\n if the symbol is fully qualified, the var/Class to which it resolves\n need not be present in the namespace.\"\n {:added \"1.0\"\n :static true}\n ([ns sym]\n (ns-resolve ns nil sym))\n ([ns env sym]\n (when-not (contains? env sym)\n (clojure.lang.Compiler/maybeResolveIn (the-ns ns) sym))))\n\n(defn resolve\n \"same as (ns-resolve *ns* symbol) or (ns-resolve *ns* &env symbol)\"\n {:added \"1.0\"\n :static true}\n ([sym] (ns-resolve *ns* sym))\n ([env sym] (ns-resolve *ns* env sym)))\n\n(defn array-map\n \"Constructs an array-map. If any keys are equal, they are handled as\n if by repeated uses of assoc.\"\n {:added \"1.0\"\n :static true}\n ([] (. clojure.lang.PersistentArrayMap EMPTY))\n ([& keyvals]\n (clojure.lang.PersistentArrayMap/createAsIfByAssoc (to-array keyvals))))\n\n;redefine let and loop with destructuring\n(defn destructure [bindings]\n (let [bents (partition 2 bindings)\n pb (fn pb [bvec b v]\n (let [pvec\n (fn [bvec b val]\n (let [gvec (gensym \"vec__\")]\n (loop [ret (-> bvec (conj gvec) (conj val))\n n 0\n bs b\n seen-rest? false]\n (if (seq bs)\n (let [firstb (first bs)]\n (cond\n (= firstb '&) (recur (pb ret (second bs) (list `nthnext gvec n))\n n\n (nnext bs)\n true)\n (= firstb :as) (pb ret (second bs) gvec)\n :else (if seen-rest?\n (throw (new Exception \"Unsupported binding form, only :as can follow & parameter\"))\n (recur (pb ret firstb (list `nth gvec n nil))\n (inc n)\n (next bs)\n seen-rest?))))\n ret))))\n pmap\n (fn [bvec b v]\n (let [gmap (gensym \"map__\")\n gmapseq (with-meta gmap {:tag 'clojure.lang.ISeq})\n defaults (:or b)]\n (loop [ret (-> bvec (conj gmap) (conj v)\n (conj gmap) (conj `(if (seq? ~gmap) (clojure.lang.PersistentHashMap/create (seq ~gmapseq)) ~gmap))\n ((fn [ret]\n (if (:as b)\n (conj ret (:as b) gmap)\n ret))))\n bes (reduce1\n (fn [bes entry]\n (reduce1 #(assoc %1 %2 ((val entry) %2))\n (dissoc bes (key entry))\n ((key entry) bes)))\n (dissoc b :as :or)\n {:keys #(if (keyword? %) % (keyword (str %))),\n :strs str, :syms #(list `quote %)})]\n (if (seq bes)\n (let [bb (key (first bes))\n bk (val (first bes))\n has-default (contains? defaults bb)]\n (recur (pb ret bb (if has-default\n (list `get gmap bk (defaults bb))\n (list `get gmap bk)))\n (next bes)))\n ret))))]\n (cond\n (symbol? b) (-> bvec (conj (if (namespace b) (symbol (name b)) b)) (conj v))\n (keyword? b) (-> bvec (conj (symbol (name b))) (conj v))\n (vector? b) (pvec bvec b v)\n (map? b) (pmap bvec b v)\n :else (throw (new Exception (str \"Unsupported binding form: \" b))))))\n process-entry (fn [bvec b] (pb bvec (first b) (second b)))]\n (if (every? symbol? (map first bents))\n bindings\n (if-let [kwbs (seq (filter #(keyword? (first %)) bents))]\n (throw (new Exception (str \"Unsupported binding key: \" (ffirst kwbs))))\n (reduce1 process-entry [] bents)))))\n\n(defmacro let\n \"binding => binding-form init-expr\n\n Evaluates the exprs in a lexical context in which the symbols in\n the binding-forms are bound to their respective init-exprs or parts\n therein.\"\n {:added \"1.0\", :special-form true, :forms '[(let [bindings*] exprs*)]}\n [bindings & body]\n (assert-args\n (vector? bindings) \"a vector for its binding\"\n (even? (count bindings)) \"an even number of forms in binding vector\")\n `(let* ~(destructure bindings) ~@body))\n\n(defn ^{:private true}\n maybe-destructured\n [params body]\n (if (every? symbol? params)\n (cons params body)\n (loop [params params\n new-params (with-meta [] (meta params))\n lets []]\n (if params\n (if (symbol? (first params))\n (recur (next params) (conj new-params (first params)) lets)\n (let [gparam (gensym \"p__\")]\n (recur (next params) (conj new-params gparam)\n (-> lets (conj (first params)) (conj gparam)))))\n `(~new-params\n (let ~lets\n ~@body))))))\n\n;redefine fn with destructuring and pre/post conditions\n(defmacro fn\n \"params => positional-params* , or positional-params* & next-param\n positional-param => binding-form\n next-param => binding-form\n name => symbol\n\n Defines a function\"\n {:added \"1.0\", :special-form true,\n :forms '[(fn name? [params* ] exprs*) (fn name? ([params* ] exprs*)+)]}\n [& sigs]\n (let [name (if (symbol? (first sigs)) (first sigs) nil)\n sigs (if name (next sigs) sigs)\n sigs (if (vector? (first sigs))\n (list sigs)\n (if (seq? (first sigs))\n sigs\n ;; Assume single arity syntax\n (throw (IllegalArgumentException.\n ^String\n (if (seq sigs)\n (str \"Parameter declaration \"\n (first sigs)\n \" should be a vector\")\n (str \"Parameter declaration missing\"))))))\n psig (fn* [sig]\n ;; Ensure correct type before destructuring sig\n (when (not (seq? sig))\n (throw (IllegalArgumentException.\n (str \"Invalid signature \" sig\n \" should be a list\"))))\n (let [[params & body] sig\n _ (when (not (vector? params))\n (throw (IllegalArgumentException.\n ^String\n (if (seq? (first sigs))\n (str \"Parameter declaration \" params\n \" should be a vector\")\n (str \"Invalid signature \" sig\n \" should be a list\")))))\n conds (when (and (next body) (map? (first body)))\n (first body))\n body (if conds (next body) body)\n conds (or conds (meta params))\n pre (:pre conds)\n post (:post conds)\n body (if post\n `((let [~'% ~(if (< 1 (count body))\n `(do ~@body)\n (first body))]\n ~@(map (fn* [c] `(assert ~c)) post)\n ~'%))\n body)\n body (if pre\n (concat (map (fn* [c] `(assert ~c)) pre)\n body)\n body)]\n (maybe-destructured params body)))\n new-sigs (map psig sigs)]\n (with-meta\n (if name\n (list* 'fn* name new-sigs)\n (cons 'fn* new-sigs))\n (meta &form))))\n\n(defmacro loop\n \"Evaluates the exprs in a lexical context in which the symbols in\n the binding-forms are bound to their respective init-exprs or parts\n therein. Acts as a recur target.\"\n {:added \"1.0\", :special-form true, :forms '[(loop [bindings*] exprs*)]}\n [bindings & body]\n (assert-args\n (vector? bindings) \"a vector for its binding\"\n (even? (count bindings)) \"an even number of forms in binding vector\")\n (let [db (destructure bindings)]\n (if (= db bindings)\n `(loop* ~bindings ~@body)\n (let [vs (take-nth 2 (drop 1 bindings))\n bs (take-nth 2 bindings)\n gs (map (fn [b] (if (symbol? b) b (gensym))) bs)\n bfs (reduce1 (fn [ret [b v g]]\n (if (symbol? b)\n (conj ret g v)\n (conj ret g v b g)))\n [] (map vector bs vs gs))]\n `(let ~bfs\n (loop* ~(vec (interleave gs gs))\n (let ~(vec (interleave bs gs))\n ~@body)))))))\n\n(defmacro when-first\n \"bindings => x xs\n\n Roughly the same as (when (seq xs) (let [x (first xs)] body)) but xs is evaluated only once\"\n {:added \"1.0\"}\n [bindings & body]\n (assert-args\n (vector? bindings) \"a vector for its binding\"\n (= 2 (count bindings)) \"exactly 2 forms in binding vector\")\n (let [[x xs] bindings]\n `(when-let [xs# (seq ~xs)]\n (let [~x (first xs#)]\n ~@body))))\n\n(defmacro lazy-cat\n \"Expands to code which yields a lazy sequence of the concatenation\n of the supplied colls. Each coll expr is not evaluated until it is\n needed.\n\n (lazy-cat xs ys zs) === (concat (lazy-seq xs) (lazy-seq ys) (lazy-seq zs))\"\n {:added \"1.0\"}\n [& colls]\n `(concat ~@(map #(list `lazy-seq %) colls)))\n\n(defmacro for\n \"List comprehension. Takes a vector of one or more\n binding-form/collection-expr pairs, each followed by zero or more\n modifiers, and yields a lazy sequence of evaluations of expr.\n Collections are iterated in a nested fashion, rightmost fastest,\n and nested coll-exprs can refer to bindings created in prior\n binding-forms. Supported modifiers are: :let [binding-form expr ...],\n :while test, :when test.\n\n (take 100 (for [x (range 100000000) y (range 1000000) :while (< y x)] [x y]))\"\n {:added \"1.0\"}\n [seq-exprs body-expr]\n (assert-args\n (vector? seq-exprs) \"a vector for its binding\"\n (even? (count seq-exprs)) \"an even number of forms in binding vector\")\n (let [to-groups (fn [seq-exprs]\n (reduce1 (fn [groups [k v]]\n (if (keyword? k)\n (conj (pop groups) (conj (peek groups) [k v]))\n (conj groups [k v])))\n [] (partition 2 seq-exprs)))\n err (fn [& msg] (throw (IllegalArgumentException. ^String (apply str msg))))\n emit-bind (fn emit-bind [[[bind expr & mod-pairs]\n & [[_ next-expr] :as next-groups]]]\n (let [giter (gensym \"iter__\")\n gxs (gensym \"s__\")\n do-mod (fn do-mod [[[k v :as pair] & etc]]\n (cond\n (= k :let) `(let ~v ~(do-mod etc))\n (= k :while) `(when ~v ~(do-mod etc))\n (= k :when) `(if ~v\n ~(do-mod etc)\n (recur (rest ~gxs)))\n (keyword? k) (err \"Invalid 'for' keyword \" k)\n next-groups\n `(let [iterys# ~(emit-bind next-groups)\n fs# (seq (iterys# ~next-expr))]\n (if fs#\n (concat fs# (~giter (rest ~gxs)))\n (recur (rest ~gxs))))\n :else `(cons ~body-expr\n (~giter (rest ~gxs)))))]\n (if next-groups\n #_\"not the inner-most loop\"\n `(fn ~giter [~gxs]\n (lazy-seq\n (loop [~gxs ~gxs]\n (when-first [~bind ~gxs]\n ~(do-mod mod-pairs)))))\n #_\"inner-most loop\"\n (let [gi (gensym \"i__\")\n gb (gensym \"b__\")\n do-cmod (fn do-cmod [[[k v :as pair] & etc]]\n (cond\n (= k :let) `(let ~v ~(do-cmod etc))\n (= k :while) `(when ~v ~(do-cmod etc))\n (= k :when) `(if ~v\n ~(do-cmod etc)\n (recur\n (unchecked-inc ~gi)))\n (keyword? k)\n (err \"Invalid 'for' keyword \" k)\n :else\n `(do (chunk-append ~gb ~body-expr)\n (recur (unchecked-inc ~gi)))))]\n `(fn ~giter [~gxs]\n (lazy-seq\n (loop [~gxs ~gxs]\n (when-let [~gxs (seq ~gxs)]\n (if (chunked-seq? ~gxs)\n (let [c# (chunk-first ~gxs)\n size# (int (count c#))\n ~gb (chunk-buffer size#)]\n (if (loop [~gi (int 0)]\n (if (< ~gi size#)\n (let [~bind (.nth c# ~gi)]\n ~(do-cmod mod-pairs))\n true))\n (chunk-cons\n (chunk ~gb)\n (~giter (chunk-rest ~gxs)))\n (chunk-cons (chunk ~gb) nil)))\n (let [~bind (first ~gxs)]\n ~(do-mod mod-pairs)))))))))))]\n `(let [iter# ~(emit-bind (to-groups seq-exprs))]\n (iter# ~(second seq-exprs)))))\n\n(defmacro comment\n \"Ignores body, yields nil\"\n {:added \"1.0\"}\n [& body])\n\n(defmacro with-out-str\n \"Evaluates exprs in a context in which *out* is bound to a fresh\n StringWriter. Returns the string created by any nested printing\n calls.\"\n {:added \"1.0\"}\n [& body]\n `(let [s# (new java.io.StringWriter)]\n (binding [*out* s#]\n ~@body\n (str s#))))\n\n(defmacro with-in-str\n \"Evaluates body in a context in which *in* is bound to a fresh\n StringReader initialized with the string s.\"\n {:added \"1.0\"}\n [s & body]\n `(with-open [s# (-> (java.io.StringReader. ~s) clojure.lang.LineNumberingPushbackReader.)]\n (binding [*in* s#]\n ~@body)))\n\n(defn pr-str\n \"pr to a string, returning it\"\n {:tag String\n :added \"1.0\"\n :static true}\n [& xs]\n (with-out-str\n (apply pr xs)))\n\n(defn prn-str\n \"prn to a string, returning it\"\n {:tag String\n :added \"1.0\"\n :static true}\n [& xs]\n (with-out-str\n (apply prn xs)))\n\n(defn print-str\n \"print to a string, returning it\"\n {:tag String\n :added \"1.0\"\n :static true}\n [& xs]\n (with-out-str\n (apply print xs)))\n\n(defn println-str\n \"println to a string, returning it\"\n {:tag String\n :added \"1.0\"\n :static true}\n [& xs]\n (with-out-str\n (apply println xs)))\n\n(import clojure.lang.ExceptionInfo clojure.lang.IExceptionInfo)\n(defn ex-info\n \"Create an instance of ExceptionInfo, a RuntimeException subclass\n that carries a map of additional data.\"\n {:added \"1.4\"}\n ([msg map]\n (ExceptionInfo. msg map))\n ([msg map cause]\n (ExceptionInfo. msg map cause)))\n\n(defn ex-data\n \"Returns exception data (a map) if ex is an IExceptionInfo.\n Otherwise returns nil.\"\n {:added \"1.4\"}\n [ex]\n (when (instance? IExceptionInfo ex)\n (.getData ^IExceptionInfo ex)))\n\n(defmacro assert\n \"Evaluates expr and throws an exception if it does not evaluate to\n logical true.\"\n {:added \"1.0\"}\n ([x]\n (when *assert*\n `(when-not ~x\n (throw (new AssertionError (str \"Assert failed: \" (pr-str '~x)))))))\n ([x message]\n (when *assert*\n `(when-not ~x\n (throw (new AssertionError (str \"Assert failed: \" ~message \"\\n\" (pr-str '~x))))))))\n\n(defn test\n \"test [v] finds fn at key :test in var metadata and calls it,\n presuming failure will throw exception\"\n {:added \"1.0\"}\n [v]\n (let [f (:test (meta v))]\n (if f\n (do (f) :ok)\n :no-test)))\n\n(defn re-pattern\n \"Returns an instance of java.util.regex.Pattern, for use, e.g. in\n re-matcher.\"\n {:tag java.util.regex.Pattern\n :added \"1.0\"\n :static true}\n [s] (if (instance? java.util.regex.Pattern s)\n s\n (. java.util.regex.Pattern (compile s))))\n\n(defn re-matcher\n \"Returns an instance of java.util.regex.Matcher, for use, e.g. in\n re-find.\"\n {:tag java.util.regex.Matcher\n :added \"1.0\"\n :static true}\n [^java.util.regex.Pattern re s]\n (. re (matcher s)))\n\n(defn re-groups\n \"Returns the groups from the most recent match/find. If there are no\n nested groups, returns a string of the entire match. If there are\n nested groups, returns a vector of the groups, the first element\n being the entire match.\"\n {:added \"1.0\"\n :static true}\n [^java.util.regex.Matcher m]\n (let [gc (. m (groupCount))]\n (if (zero? gc)\n (. m (group))\n (loop [ret [] c 0]\n (if (<= c gc)\n (recur (conj ret (. m (group c))) (inc c))\n ret)))))\n\n(defn re-seq\n \"Returns a lazy sequence of successive matches of pattern in string,\n using java.util.regex.Matcher.find(), each such match processed with\n re-groups.\"\n {:added \"1.0\"\n :static true}\n [^java.util.regex.Pattern re s]\n (let [m (re-matcher re s)]\n ((fn step []\n (when (. m (find))\n (cons (re-groups m) (lazy-seq (step))))))))\n\n(defn re-matches\n \"Returns the match, if any, of string to pattern, using\n java.util.regex.Matcher.matches(). Uses re-groups to return the\n groups.\"\n {:added \"1.0\"\n :static true}\n [^java.util.regex.Pattern re s]\n (let [m (re-matcher re s)]\n (when (. m (matches))\n (re-groups m))))\n\n\n(defn re-find\n \"Returns the next regex match, if any, of string to pattern, using\n java.util.regex.Matcher.find(). Uses re-groups to return the\n groups.\"\n {:added \"1.0\"\n :static true}\n ([^java.util.regex.Matcher m]\n (when (. m (find))\n (re-groups m)))\n ([^java.util.regex.Pattern re s]\n (let [m (re-matcher re s)]\n (re-find m))))\n\n(defn rand\n \"Returns a random floating point number between 0 (inclusive) and\n n (default 1) (exclusive).\"\n {:added \"1.0\"\n :static true}\n ([] (. Math (random)))\n ([n] (* n (rand))))\n\n(defn rand-int\n \"Returns a random integer between 0 (inclusive) and n (exclusive).\"\n {:added \"1.0\"\n :static true}\n [n] (int (rand n)))\n\n(defmacro defn-\n \"same as defn, yielding non-public def\"\n {:added \"1.0\"}\n [name & decls]\n (list* `defn (with-meta name (assoc (meta name) :private true)) decls))\n\n(defn tree-seq\n \"Returns a lazy sequence of the nodes in a tree, via a depth-first walk.\n branch? must be a fn of one arg that returns true if passed a node\n that can have children (but may not). children must be a fn of one\n arg that returns a sequence of the children. Will only be called on\n nodes for which branch? returns true. Root is the root node of the\n tree.\"\n {:added \"1.0\"\n :static true}\n [branch? children root]\n (let [walk (fn walk [node]\n (lazy-seq\n (cons node\n (when (branch? node)\n (mapcat walk (children node))))))]\n (walk root)))\n\n(defn file-seq\n \"A tree seq on java.io.Files\"\n {:added \"1.0\"\n :static true}\n [dir]\n (tree-seq\n (fn [^java.io.File f] (. f (isDirectory)))\n (fn [^java.io.File d] (seq (. d (listFiles))))\n dir))\n\n(defn xml-seq\n \"A tree seq on the xml elements as per xml/parse\"\n {:added \"1.0\"\n :static true}\n [root]\n (tree-seq\n (complement string?)\n (comp seq :content)\n root))\n\n(defn special-symbol?\n \"Returns true if s names a special form\"\n {:added \"1.0\"\n :static true}\n [s]\n (contains? (. clojure.lang.Compiler specials) s))\n\n(defn var?\n \"Returns true if v is of type clojure.lang.Var\"\n {:added \"1.0\"\n :static true}\n [v] (instance? clojure.lang.Var v))\n\n(defn subs\n \"Returns the substring of s beginning at start inclusive, and ending\n at end (defaults to length of string), exclusive.\"\n {:added \"1.0\"\n :static true}\n (^String [^String s start] (. s (substring start)))\n (^String [^String s start end] (. s (substring start end))))\n\n(defn max-key\n \"Returns the x for which (k x), a number, is greatest.\"\n {:added \"1.0\"\n :static true}\n ([k x] x)\n ([k x y] (if (> (k x) (k y)) x y))\n ([k x y & more]\n (reduce1 #(max-key k %1 %2) (max-key k x y) more)))\n\n(defn min-key\n \"Returns the x for which (k x), a number, is least.\"\n {:added \"1.0\"\n :static true}\n ([k x] x)\n ([k x y] (if (< (k x) (k y)) x y))\n ([k x y & more]\n (reduce1 #(min-key k %1 %2) (min-key k x y) more)))\n\n(defn distinct\n \"Returns a lazy sequence of the elements of coll with duplicates removed.\n Returns a stateful transducer when no collection is provided.\"\n {:added \"1.0\"\n :static true}\n ([]\n (fn [rf]\n (let [seen (volatile! #{})]\n (fn\n ([] (rf))\n ([result] (rf result))\n ([result input]\n (if (contains? @seen input)\n result\n (do (vswap! seen conj input)\n (rf result input))))))))\n ([coll]\n (let [step (fn step [xs seen]\n (lazy-seq\n ((fn [[f :as xs] seen]\n (when-let [s (seq xs)]\n (if (contains? seen f)\n (recur (rest s) seen)\n (cons f (step (rest s) (conj seen f))))))\n xs seen)))]\n (step coll #{}))))\n\n\n\n(defn replace\n \"Given a map of replacement pairs and a vector/collection, returns a\n vector/seq with any elements = a key in smap replaced with the\n corresponding val in smap. Returns a transducer when no collection\n is provided.\"\n {:added \"1.0\"\n :static true}\n ([smap]\n (map #(if-let [e (find smap %)] (val e) %)))\n ([smap coll]\n (if (vector? coll)\n (reduce1 (fn [v i]\n (if-let [e (find smap (nth v i))]\n (assoc v i (val e))\n v))\n coll (range (count coll)))\n (map #(if-let [e (find smap %)] (val e) %) coll))))\n\n(defmacro dosync\n \"Runs the exprs (in an implicit do) in a transaction that encompasses\n exprs and any nested calls. Starts a transaction if none is already\n running on this thread. Any uncaught exception will abort the\n transaction and flow out of dosync. The exprs may be run more than\n once, but any effects on Refs will be atomic.\"\n {:added \"1.0\"}\n [& exprs]\n `(sync nil ~@exprs))\n\n(defmacro with-precision\n \"Sets the precision and rounding mode to be used for BigDecimal operations.\n\n Usage: (with-precision 10 (/ 1M 3))\n or: (with-precision 10 :rounding HALF_DOWN (/ 1M 3))\n\n The rounding mode is one of CEILING, FLOOR, HALF_UP, HALF_DOWN,\n HALF_EVEN, UP, DOWN and UNNECESSARY; it defaults to HALF_UP.\"\n {:added \"1.0\"}\n [precision & exprs]\n (let [[body rm] (if (= (first exprs) :rounding)\n [(next (next exprs))\n `((. java.math.RoundingMode ~(second exprs)))]\n [exprs nil])]\n `(binding [*math-context* (java.math.MathContext. ~precision ~@rm)]\n ~@body)))\n\n(defn mk-bound-fn\n {:private true}\n [^clojure.lang.Sorted sc test key]\n (fn [e]\n (test (.. sc comparator (compare (. sc entryKey e) key)) 0)))\n\n(defn subseq\n \"sc must be a sorted collection, test(s) one of <, <=, > or\n >=. Returns a seq of those entries with keys ek for\n which (test (.. sc comparator (compare ek key)) 0) is true\"\n {:added \"1.0\"\n :static true}\n ([^clojure.lang.Sorted sc test key]\n (let [include (mk-bound-fn sc test key)]\n (if (#{> >=} test)\n (when-let [[e :as s] (. sc seqFrom key true)]\n (if (include e) s (next s)))\n (take-while include (. sc seq true)))))\n ([^clojure.lang.Sorted sc start-test start-key end-test end-key]\n (when-let [[e :as s] (. sc seqFrom start-key true)]\n (take-while (mk-bound-fn sc end-test end-key)\n (if ((mk-bound-fn sc start-test start-key) e) s (next s))))))\n\n(defn rsubseq\n \"sc must be a sorted collection, test(s) one of <, <=, > or\n >=. Returns a reverse seq of those entries with keys ek for\n which (test (.. sc comparator (compare ek key)) 0) is true\"\n {:added \"1.0\"\n :static true}\n ([^clojure.lang.Sorted sc test key]\n (let [include (mk-bound-fn sc test key)]\n (if (#{< <=} test)\n (when-let [[e :as s] (. sc seqFrom key false)]\n (if (include e) s (next s)))\n (take-while include (. sc seq false)))))\n ([^clojure.lang.Sorted sc start-test start-key end-test end-key]\n (when-let [[e :as s] (. sc seqFrom end-key false)]\n (take-while (mk-bound-fn sc start-test start-key)\n (if ((mk-bound-fn sc end-test end-key) e) s (next s))))))\n\n(defn repeatedly\n \"Takes a function of no args, presumably with side effects, and\n returns an infinite (or length n if supplied) lazy sequence of calls\n to it\"\n {:added \"1.0\"\n :static true}\n ([f] (lazy-seq (cons (f) (repeatedly f))))\n ([n f] (take n (repeatedly f))))\n\n(defn add-classpath\n \"DEPRECATED\n\n Adds the url (String or URL object) to the classpath per\n URLClassLoader.addURL\"\n {:added \"1.0\"\n :deprecated \"1.1\"}\n [url]\n (println \"WARNING: add-classpath is deprecated\")\n (clojure.lang.RT/addURL url))\n\n\n\n(defn hash\n \"Returns the hash code of its argument. Note this is the hash code\n consistent with =, and thus is different than .hashCode for Integer,\n Short, Byte and Clojure collections.\"\n\n {:added \"1.0\"\n :static true}\n [x] (. clojure.lang.Util (hasheq x)))\n\n\n(defn mix-collection-hash\n \"Mix final collection hash for ordered or unordered collections.\n hash-basis is the combined collection hash, count is the number\n of elements included in the basis. Note this is the hash code\n consistent with =, different from .hashCode.\n See http://clojure.org/data_structures#hash for full algorithms.\"\n {:added \"1.6\"\n :static true}\n ^long\n [^long hash-basis ^long count] (clojure.lang.Murmur3/mixCollHash hash-basis count))\n\n(defn hash-ordered-coll\n \"Returns the hash code, consistent with =, for an external ordered\n collection implementing Iterable.\n See http://clojure.org/data_structures#hash for full algorithms.\"\n {:added \"1.6\"\n :static true}\n ^long\n [coll] (clojure.lang.Murmur3/hashOrdered coll))\n\n(defn hash-unordered-coll\n \"Returns the hash code, consistent with =, for an external unordered\n collection implementing Iterable. For maps, the iterator should\n return map entries whose hash is computed as\n (hash-ordered-coll [k v]).\n See http://clojure.org/data_structures#hash for full algorithms.\"\n {:added \"1.6\"\n :static true}\n ^long\n [coll] (clojure.lang.Murmur3/hashUnordered coll))\n\n(defn interpose\n \"Returns a lazy seq of the elements of coll separated by sep.\n Returns a stateful transducer when no collection is provided.\"\n {:added \"1.0\"\n :static true}\n ([sep]\n (fn [rf]\n (let [started (volatile! false)]\n (fn\n ([] (rf))\n ([result] (rf result))\n ([result input]\n (if @started\n (let [sepr (rf result sep)]\n (if (reduced? sepr)\n sepr\n (rf sepr input)))\n (do\n (vreset! started true)\n (rf result input))))))))\n ([sep coll]\n (drop 1 (interleave (repeat sep) coll))))\n\n(defmacro definline\n \"Experimental - like defmacro, except defines a named function whose\n body is the expansion, calls to which may be expanded inline as if\n it were a macro. Cannot be used with variadic (&) args.\"\n {:added \"1.0\"}\n [name & decl]\n (let [[pre-args [args expr]] (split-with (comp not vector?) decl)]\n `(do\n (defn ~name ~@pre-args ~args ~(apply (eval (list `fn args expr)) args))\n (alter-meta! (var ~name) assoc :inline (fn ~args ~expr))\n (var ~name))))\n\n(defn empty\n \"Returns an empty collection of the same category as coll, or nil\"\n {:added \"1.0\"\n :static true}\n [coll]\n (when (instance? clojure.lang.IPersistentCollection coll)\n (.empty ^clojure.lang.IPersistentCollection coll)))\n\n(defmacro amap\n \"Maps an expression across an array a, using an index named idx, and\n return value named ret, initialized to a clone of a, then setting\n each element of ret to the evaluation of expr, returning the new\n array ret.\"\n {:added \"1.0\"}\n [a idx ret expr]\n `(let [a# ~a\n ~ret (aclone a#)]\n (loop [~idx 0]\n (if (< ~idx (alength a#))\n (do\n (aset ~ret ~idx ~expr)\n (recur (unchecked-inc ~idx)))\n ~ret))))\n\n(defmacro areduce\n \"Reduces an expression across an array a, using an index named idx,\n and return value named ret, initialized to init, setting ret to the\n evaluation of expr at each step, returning ret.\"\n {:added \"1.0\"}\n [a idx ret init expr]\n `(let [a# ~a]\n (loop [~idx 0 ~ret ~init]\n (if (< ~idx (alength a#))\n (recur (unchecked-inc ~idx) ~expr)\n ~ret))))\n\n(defn float-array\n \"Creates an array of floats\"\n {:inline (fn [& args] `(. clojure.lang.Numbers float_array ~@args))\n :inline-arities #{1 2}\n :added \"1.0\"}\n ([size-or-seq] (. clojure.lang.Numbers float_array size-or-seq))\n ([size init-val-or-seq] (. clojure.lang.Numbers float_array size init-val-or-seq)))\n\n(defn boolean-array\n \"Creates an array of booleans\"\n {:inline (fn [& args] `(. clojure.lang.Numbers boolean_array ~@args))\n :inline-arities #{1 2}\n :added \"1.1\"}\n ([size-or-seq] (. clojure.lang.Numbers boolean_array size-or-seq))\n ([size init-val-or-seq] (. clojure.lang.Numbers boolean_array size init-val-or-seq)))\n\n(defn byte-array\n \"Creates an array of bytes\"\n {:inline (fn [& args] `(. clojure.lang.Numbers byte_array ~@args))\n :inline-arities #{1 2}\n :added \"1.1\"}\n ([size-or-seq] (. clojure.lang.Numbers byte_array size-or-seq))\n ([size init-val-or-seq] (. clojure.lang.Numbers byte_array size init-val-or-seq)))\n\n(defn char-array\n \"Creates an array of chars\"\n {:inline (fn [& args] `(. clojure.lang.Numbers char_array ~@args))\n :inline-arities #{1 2}\n :added \"1.1\"}\n ([size-or-seq] (. clojure.lang.Numbers char_array size-or-seq))\n ([size init-val-or-seq] (. clojure.lang.Numbers char_array size init-val-or-seq)))\n\n(defn short-array\n \"Creates an array of shorts\"\n {:inline (fn [& args] `(. clojure.lang.Numbers short_array ~@args))\n :inline-arities #{1 2}\n :added \"1.1\"}\n ([size-or-seq] (. clojure.lang.Numbers short_array size-or-seq))\n ([size init-val-or-seq] (. clojure.lang.Numbers short_array size init-val-or-seq)))\n\n(defn double-array\n \"Creates an array of doubles\"\n {:inline (fn [& args] `(. clojure.lang.Numbers double_array ~@args))\n :inline-arities #{1 2}\n :added \"1.0\"}\n ([size-or-seq] (. clojure.lang.Numbers double_array size-or-seq))\n ([size init-val-or-seq] (. clojure.lang.Numbers double_array size init-val-or-seq)))\n\n(defn object-array\n \"Creates an array of objects\"\n {:inline (fn [arg] `(. clojure.lang.RT object_array ~arg))\n :inline-arities #{1}\n :added \"1.2\"}\n ([size-or-seq] (. clojure.lang.RT object_array size-or-seq)))\n\n(defn int-array\n \"Creates an array of ints\"\n {:inline (fn [& args] `(. clojure.lang.Numbers int_array ~@args))\n :inline-arities #{1 2}\n :added \"1.0\"}\n ([size-or-seq] (. clojure.lang.Numbers int_array size-or-seq))\n ([size init-val-or-seq] (. clojure.lang.Numbers int_array size init-val-or-seq)))\n\n(defn long-array\n \"Creates an array of longs\"\n {:inline (fn [& args] `(. clojure.lang.Numbers long_array ~@args))\n :inline-arities #{1 2}\n :added \"1.0\"}\n ([size-or-seq] (. clojure.lang.Numbers long_array size-or-seq))\n ([size init-val-or-seq] (. clojure.lang.Numbers long_array size init-val-or-seq)))\n\n(definline booleans\n \"Casts to boolean[]\"\n {:added \"1.1\"}\n [xs] `(. clojure.lang.Numbers booleans ~xs))\n\n(definline bytes\n \"Casts to bytes[]\"\n {:added \"1.1\"}\n [xs] `(. clojure.lang.Numbers bytes ~xs))\n\n(definline chars\n \"Casts to chars[]\"\n {:added \"1.1\"}\n [xs] `(. clojure.lang.Numbers chars ~xs))\n\n(definline shorts\n \"Casts to shorts[]\"\n {:added \"1.1\"}\n [xs] `(. clojure.lang.Numbers shorts ~xs))\n\n(definline floats\n \"Casts to float[]\"\n {:added \"1.0\"}\n [xs] `(. clojure.lang.Numbers floats ~xs))\n\n(definline ints\n \"Casts to int[]\"\n {:added \"1.0\"}\n [xs] `(. clojure.lang.Numbers ints ~xs))\n\n(definline doubles\n \"Casts to double[]\"\n {:added \"1.0\"}\n [xs] `(. clojure.lang.Numbers doubles ~xs))\n\n(definline longs\n \"Casts to long[]\"\n {:added \"1.0\"}\n [xs] `(. clojure.lang.Numbers longs ~xs))\n\n(import '(java.util.concurrent BlockingQueue LinkedBlockingQueue))\n\n(defn seque\n \"Creates a queued seq on another (presumably lazy) seq s. The queued\n seq will produce a concrete seq in the background, and can get up to\n n items ahead of the consumer. n-or-q can be an integer n buffer\n size, or an instance of java.util.concurrent BlockingQueue. Note\n that reading from a seque can block if the reader gets ahead of the\n producer.\"\n {:added \"1.0\"\n :static true}\n ([s] (seque 100 s))\n ([n-or-q s]\n (let [^BlockingQueue q (if (instance? BlockingQueue n-or-q)\n n-or-q\n (LinkedBlockingQueue. (int n-or-q)))\n NIL (Object.) ;nil sentinel since LBQ doesn't support nils\n agt (agent (lazy-seq s)) ; never start with nil; that signifies we've already put eos\n log-error (fn [q e]\n (if (.offer q q)\n (throw e)\n e))\n fill (fn [s]\n (when s\n (if (instance? Exception s) ; we failed to .offer an error earlier\n (log-error q s)\n (try\n (loop [[x & xs :as s] (seq s)]\n (if s\n (if (.offer q (if (nil? x) NIL x))\n (recur xs)\n s)\n (when-not (.offer q q) ; q itself is eos sentinel\n ()))) ; empty seq, not nil, so we know to put eos next time\n (catch Exception e\n (log-error q e))))))\n drain (fn drain []\n (lazy-seq\n (let [x (.take q)]\n (if (identical? x q) ;q itself is eos sentinel\n (do @agt nil) ;touch agent just to propagate errors\n (do\n (send-off agt fill)\n (release-pending-sends)\n (cons (if (identical? x NIL) nil x) (drain)))))))]\n (send-off agt fill)\n (drain))))\n\n(defn class?\n \"Returns true if x is an instance of Class\"\n {:added \"1.0\"\n :static true}\n [x] (instance? Class x))\n\n(defn- is-annotation? [c]\n (and (class? c)\n (.isAssignableFrom java.lang.annotation.Annotation c)))\n\n(defn- is-runtime-annotation? [^Class c]\n (boolean\n (and (is-annotation? c)\n (when-let [^java.lang.annotation.Retention r\n (.getAnnotation c java.lang.annotation.Retention)]\n (= (.value r) java.lang.annotation.RetentionPolicy/RUNTIME)))))\n\n(defn- descriptor [^Class c] (clojure.asm.Type/getDescriptor c))\n\n(declare process-annotation)\n(declare process-print-annotation)\n\n(defn- print-annotation-value [v]\n (cond\n (vector? v) (str \"{\" (apply str (interpose \", \" (map print-annotation-value v))) \"}\")\n (symbol? v) (let [ev (eval v)]\n (cond\n (instance? java.lang.Enum ev) (str (.getCanonicalName (class ev)) \".\" (str ev))\n (class? ev) (str (.getCanonicalName ev) \".class\")\n :else (throw (IllegalArgumentException.\n (str \"Unsupported annotation value: \" v \" of class \" (class ev))))))\n (seq? v) (let [[nested nv] v\n c (resolve nested)]\n (str \"@\" (.getCanonicalName c) \"(\"\n (process-print-annotation nv) \")\"))\n (string? v) (str \"\\\"\" (clojure.lang.Compiler/escapeString ^String v) \"\\\"\")\n (nil? v) \"\"\n :else v))\n\n(defn- add-annotation [^clojure.asm.AnnotationVisitor av name v]\n (cond\n (vector? v) (let [avec (.visitArray av name)]\n (doseq [vval v]\n (add-annotation avec \"value\" vval))\n (.visitEnd avec))\n (symbol? v) (let [ev (eval v)]\n (cond\n (instance? java.lang.Enum ev)\n (.visitEnum av name (descriptor (class ev)) (str ev))\n (class? ev) (.visit av name (clojure.asm.Type/getType ev))\n :else (throw (IllegalArgumentException.\n (str \"Unsupported annotation value: \" v \" of class \" (class ev))))))\n (seq? v) (let [[nested nv] v\n c (resolve nested)\n nav (.visitAnnotation av name (descriptor c))]\n (process-annotation nav nv)\n (.visitEnd nav))\n :else\n (.visit av name v)))\n\n(defn- process-annotation [av v]\n (if (map? v)\n (doseq [[k v] v]\n (add-annotation av (name k) v))\n (add-annotation av \"value\" v)))\n\n(defn- process-print-annotation [v]\n (if (map? v)\n (apply str (interpose \", \" (map (fn [[k v]] (str (name k) \"=\" (print-annotation-value v))) v)))\n (print-annotation-value v)))\n\n(defn- add-annotations\n ([visitor m] (add-annotations visitor m nil))\n ([visitor m i]\n (doseq [[k v] m]\n (when (symbol? k)\n (when-let [c (resolve k)]\n (when (is-annotation? c)\n ;this is known duck/reflective as no common base of ASM Visitors\n (let [av (if i\n (.visitParameterAnnotation visitor i (descriptor c)\n (is-runtime-annotation? c))\n (.visitAnnotation visitor (descriptor c)\n (is-runtime-annotation? c)))]\n (clojure.lang.Compiler/emitSource (str \"@\" (.getCanonicalName c)\n (if (= 0 (count (.getDeclaredMethods c)))\n \"\"\n (str \"(\" (process-print-annotation v) \")\"))))\n (process-annotation av v)\n (.visitEnd av))))))))\n\n(defn alter-var-root\n \"Atomically alters the root binding of var v by applying f to its\n current value plus any args\"\n {:added \"1.0\"\n :static true}\n [^clojure.lang.Var v f & args] (.alterRoot v f args))\n\n(defn bound?\n \"Returns true if all of the vars provided as arguments have any bound value, root or thread-local.\n Implies that deref'ing the provided vars will succeed. Returns true if no vars are provided.\"\n {:added \"1.2\"\n :static true}\n [& vars]\n (every? #(.isBound ^clojure.lang.Var %) vars))\n\n(defn thread-bound?\n \"Returns true if all of the vars provided as arguments have thread-local bindings.\n Implies that set!'ing the provided vars will succeed. Returns true if no vars are provided.\"\n {:added \"1.2\"\n :static true}\n [& vars]\n (every? #(.getThreadBinding ^clojure.lang.Var %) vars))\n\n(defn make-hierarchy\n \"Creates a hierarchy object for use with derive, isa? etc.\"\n {:added \"1.0\"\n :static true}\n [] {:parents {} :descendants {} :ancestors {}})\n\n(def ^{:private true}\n global-hierarchy (make-hierarchy))\n\n(defn not-empty\n \"If coll is empty, returns nil, else coll\"\n {:added \"1.0\"\n :static true}\n [coll] (when (seq coll) coll))\n\n(defn bases\n \"Returns the immediate superclass and direct interfaces of c, if any\"\n {:added \"1.0\"\n :static true}\n [^Class c]\n (when c\n (let [i (seq (.getInterfaces c))\n s (.getSuperclass c)]\n (if s (cons s i) i))))\n\n(defn supers\n \"Returns the immediate and indirect superclasses and interfaces of c, if any\"\n {:added \"1.0\"\n :static true}\n [^Class class]\n (loop [ret (set (bases class)) cs ret]\n (if (seq cs)\n (let [c (first cs) bs (bases c)]\n (recur (into1 ret bs) (into1 (disj cs c) bs)))\n (not-empty ret))))\n\n(defn isa?\n \"Returns true if (= child parent), or child is directly or indirectly derived from\n parent, either via a Java type inheritance relationship or a\n relationship established via derive. h must be a hierarchy obtained\n from make-hierarchy, if not supplied defaults to the global\n hierarchy\"\n {:added \"1.0\"}\n ([child parent] (isa? global-hierarchy child parent))\n ([h child parent]\n (or (= child parent)\n (and (class? parent) (class? child)\n (. ^Class parent isAssignableFrom child))\n (contains? ((:ancestors h) child) parent)\n (and (class? child) (some #(contains? ((:ancestors h) %) parent) (supers child)))\n (and (vector? parent) (vector? child)\n (= (count parent) (count child))\n (loop [ret true i 0]\n (if (or (not ret) (= i (count parent)))\n ret\n (recur (isa? h (child i) (parent i)) (inc i))))))))\n\n(defn parents\n \"Returns the immediate parents of tag, either via a Java type\n inheritance relationship or a relationship established via derive. h\n must be a hierarchy obtained from make-hierarchy, if not supplied\n defaults to the global hierarchy\"\n {:added \"1.0\"}\n ([tag] (parents global-hierarchy tag))\n ([h tag] (not-empty\n (let [tp (get (:parents h) tag)]\n (if (class? tag)\n (into1 (set (bases tag)) tp)\n tp)))))\n\n(defn ancestors\n \"Returns the immediate and indirect parents of tag, either via a Java type\n inheritance relationship or a relationship established via derive. h\n must be a hierarchy obtained from make-hierarchy, if not supplied\n defaults to the global hierarchy\"\n {:added \"1.0\"}\n ([tag] (ancestors global-hierarchy tag))\n ([h tag] (not-empty\n (let [ta (get (:ancestors h) tag)]\n (if (class? tag)\n (let [superclasses (set (supers tag))]\n (reduce1 into1 superclasses\n (cons ta\n (map #(get (:ancestors h) %) superclasses))))\n ta)))))\n\n(defn descendants\n \"Returns the immediate and indirect children of tag, through a\n relationship established via derive. h must be a hierarchy obtained\n from make-hierarchy, if not supplied defaults to the global\n hierarchy. Note: does not work on Java type inheritance\n relationships.\"\n {:added \"1.0\"}\n ([tag] (descendants global-hierarchy tag))\n ([h tag] (if (class? tag)\n (throw (java.lang.UnsupportedOperationException. \"Can't get descendants of classes\"))\n (not-empty (get (:descendants h) tag)))))\n\n(defn derive\n \"Establishes a parent/child relationship between parent and\n tag. Parent must be a namespace-qualified symbol or keyword and\n child can be either a namespace-qualified symbol or keyword or a\n class. h must be a hierarchy obtained from make-hierarchy, if not\n supplied defaults to, and modifies, the global hierarchy.\"\n {:added \"1.0\"}\n ([tag parent]\n (assert (namespace parent))\n (assert (or (class? tag) (and (instance? clojure.lang.Named tag) (namespace tag))))\n\n (alter-var-root #'global-hierarchy derive tag parent) nil)\n ([h tag parent]\n (assert (not= tag parent))\n (assert (or (class? tag) (instance? clojure.lang.Named tag)))\n (assert (instance? clojure.lang.Named parent))\n\n (let [tp (:parents h)\n td (:descendants h)\n ta (:ancestors h)\n tf (fn [m source sources target targets]\n (reduce1 (fn [ret k]\n (assoc ret k\n (reduce1 conj (get targets k #{}) (cons target (targets target)))))\n m (cons source (sources source))))]\n (or\n (when-not (contains? (tp tag) parent)\n (when (contains? (ta tag) parent)\n (throw (Exception. (print-str tag \"already has\" parent \"as ancestor\"))))\n (when (contains? (ta parent) tag)\n (throw (Exception. (print-str \"Cyclic derivation:\" parent \"has\" tag \"as ancestor\"))))\n {:parents (assoc (:parents h) tag (conj (get tp tag #{}) parent))\n :ancestors (tf (:ancestors h) tag td parent ta)\n :descendants (tf (:descendants h) parent ta tag td)})\n h))))\n\n(declare flatten)\n\n(defn underive\n \"Removes a parent/child relationship between parent and\n tag. h must be a hierarchy obtained from make-hierarchy, if not\n supplied defaults to, and modifies, the global hierarchy.\"\n {:added \"1.0\"}\n ([tag parent] (alter-var-root #'global-hierarchy underive tag parent) nil)\n ([h tag parent]\n (let [parentMap (:parents h)\n\t childsParents (if (parentMap tag)\n\t\t\t (disj (parentMap tag) parent) #{})\n\t newParents (if (not-empty childsParents)\n\t\t (assoc parentMap tag childsParents)\n\t\t (dissoc parentMap tag))\n\t deriv-seq (flatten (map #(cons (key %) (interpose (key %) (val %)))\n\t\t\t\t (seq newParents)))]\n (if (contains? (parentMap tag) parent)\n\t(reduce1 #(apply derive %1 %2) (make-hierarchy)\n\t\t(partition 2 deriv-seq))\n\th))))\n\n\n(defn distinct?\n \"Returns true if no two of the arguments are =\"\n {:tag Boolean\n :added \"1.0\"\n :static true}\n ([x] true)\n ([x y] (not (= x y)))\n ([x y & more]\n (if (not= x y)\n (loop [s #{x y} [x & etc :as xs] more]\n (if xs\n (if (contains? s x)\n false\n (recur (conj s x) etc))\n true))\n false)))\n\n(comment\n (defn resultset-seq\n \"Creates and returns a lazy sequence of structmaps corresponding to\n the rows in the java.sql.ResultSet rs\"\n {:added \"1.0\"}\n [^java.sql.ResultSet rs]\n (let [rsmeta (. rs (getMetaData))\n idxs (range 1 (inc (. rsmeta (getColumnCount))))\n keys (map (comp keyword #(.toLowerCase ^String %))\n (map (fn [i] (. rsmeta (getColumnLabel i))) idxs))\n check-keys\n (or (apply distinct? keys)\n (throw (Exception. \"ResultSet must have unique column labels\")))\n row-struct (apply create-struct keys)\n row-values (fn [] (map (fn [^Integer i] (. rs (getObject i))) idxs))\n rows (fn thisfn []\n (when (. rs (next))\n (cons (apply struct row-struct (row-values)) (lazy-seq (thisfn)))))]\n (rows))))\n\n(defn iterator-seq\n \"Returns a seq on a java.util.Iterator. Note that most collections\n providing iterators implement Iterable and thus support seq directly.\n Seqs cache values, thus iterator-seq should not be used on any\n iterator that repeatedly returns the same mutable object.\"\n {:added \"1.0\"\n :static true}\n [iter]\n (clojure.lang.RT/chunkIteratorSeq iter))\n\n(defn enumeration-seq\n \"Returns a seq on a java.util.Enumeration\"\n {:added \"1.0\"\n :static true}\n [e]\n (clojure.lang.EnumerationSeq/create e))\n\n(defn format\n \"Formats a string using java.lang.String.format, see java.util.Formatter for format\n string syntax\"\n {:added \"1.0\"\n :static true}\n ^String [fmt & args]\n (String/format fmt (to-array args)))\n\n(defn printf\n \"Prints formatted output, as per format\"\n {:added \"1.0\"\n :static true}\n [fmt & args]\n (print (apply format fmt args)))\n\n(declare gen-class)\n\n(defmacro with-loading-context [& body]\n `((fn loading# []\n (. clojure.lang.Var (pushThreadBindings {clojure.lang.Compiler/LOADER\n (.getClassLoader (.getClass ^Object loading#))}))\n (try\n ~@body\n (finally\n (. clojure.lang.Var (popThreadBindings)))))))\n\n(defmacro ns\n \"Sets *ns* to the namespace named by name (unevaluated), creating it\n if needed. references can be zero or more of: (:refer-clojure ...)\n (:require ...) (:use ...) (:import ...) (:load ...) (:gen-class)\n with the syntax of refer-clojure/require/use/import/load/gen-class\n respectively, except the arguments are unevaluated and need not be\n quoted. (:gen-class ...), when supplied, defaults to :name\n corresponding to the ns name, :main true, :impl-ns same as ns, and\n :init-impl-ns true. All options of gen-class are\n supported. The :gen-class directive is ignored when not\n compiling. If :gen-class is not supplied, when compiled only an\n nsname__init.class will be generated. If :refer-clojure is not used, a\n default (refer 'clojure.core) is used. Use of ns is preferred to\n individual calls to in-ns/require/use/import:\n\n (ns foo.bar\n (:refer-clojure :exclude [ancestors printf])\n (:require (clojure.contrib sql combinatorics))\n (:use (my.lib this that))\n (:import (java.util Date Timer Random)\n (java.sql Connection Statement)))\"\n {:arglists '([name docstring? attr-map? references*])\n :added \"1.0\"}\n [name & references]\n (let [process-reference\n (fn [[kname & args]]\n `(~(symbol \"clojure.core\" (clojure.core/name kname))\n ~@(map #(list 'quote %) args)))\n docstring (when (string? (first references)) (first references))\n references (if docstring (next references) references)\n name (if docstring\n (vary-meta name assoc :doc docstring)\n name)\n metadata (when (map? (first references)) (first references))\n references (if metadata (next references) references)\n name (if metadata\n (vary-meta name merge metadata)\n name)\n gen-class-clause (first (filter #(= :gen-class (first %)) references))\n gen-class-call\n (when gen-class-clause\n (list* `gen-class :name (.replace (str name) \\- \\_) :impl-ns name :main true (next gen-class-clause)))\n references (remove #(= :gen-class (first %)) references)\n ;ns-effect (clojure.core/in-ns name)\n ]\n `(do\n (clojure.core/in-ns '~name)\n (with-loading-context\n ~@(when gen-class-call (list gen-class-call))\n ~@(when (and (not= name 'clojure.core) (not-any? #(= :refer-clojure (first %)) references))\n `((clojure.core/refer '~'clojure.core)))\n ~@(map process-reference references))\n (if (.equals '~name 'clojure.core)\n nil\n (do (dosync (commute @#'*loaded-libs* conj '~name)) nil)))))\n\n(defmacro refer-clojure\n \"Same as (refer 'clojure.core )\"\n {:added \"1.0\"}\n [& filters]\n `(clojure.core/refer '~'clojure.core ~@filters))\n\n(defmacro defonce\n \"defs name to have the root value of the expr iff the named var has no root value,\n else expr is unevaluated\"\n {:added \"1.0\"}\n [name expr]\n `(let [v# (def ~name)]\n (when-not (.hasRoot v#)\n (def ~name ~expr))))\n\n;;;;;;;;;;; require/use/load, contributed by Stephen C. Gilardi ;;;;;;;;;;;;;;;;;;\n\n(defonce ^:dynamic\n ^{:private true\n :doc \"A ref to a sorted set of symbols representing loaded libs\"}\n *loaded-libs* (ref (sorted-set)))\n\n(defonce ^:dynamic\n ^{:private true\n :doc \"A stack of paths currently being loaded by this thread\"}\n *pending-paths* ())\n\n(defonce ^:dynamic\n ^{:private true :doc\n \"True while a verbose load is pending\"}\n *loading-verbosely* false)\n\n(defn- throw-if\n \"Throws a CompilerException with a message if pred is true\"\n [pred fmt & args]\n (when pred\n (let [^String message (apply format fmt args)\n exception (Exception. message)\n raw-trace (.getStackTrace exception)\n boring? #(not= (.getMethodName ^StackTraceElement %) \"doInvoke\")\n trace (into-array (drop 2 (drop-while boring? raw-trace)))]\n (.setStackTrace exception trace)\n (throw (clojure.lang.Compiler$CompilerException.\n *file*\n (.deref clojure.lang.Compiler/LINE)\n (.deref clojure.lang.Compiler/COLUMN)\n exception)))))\n\n(defn- libspec?\n \"Returns true if x is a libspec\"\n [x]\n (or (symbol? x)\n (and (vector? x)\n (or\n (nil? (second x))\n (keyword? (second x))))))\n\n(defn- prependss\n \"Prepends a symbol or a seq to coll\"\n [x coll]\n (if (symbol? x)\n (cons x coll)\n (concat x coll)))\n\n(defn- root-resource\n \"Returns the root directory path for a lib\"\n {:tag String}\n [lib]\n (str \\/\n (.. (name lib)\n (replace \\- \\_)\n (replace \\. \\/))))\n\n(defn- root-directory\n \"Returns the root resource path for a lib\"\n [lib]\n (let [d (root-resource lib)]\n (subs d 0 (.lastIndexOf d \"/\"))))\n\n(declare load)\n\n(defn- load-one\n \"Loads a lib given its name. If need-ns, ensures that the associated\n namespace exists after loading. If require, records the load so any\n duplicate loads can be skipped.\"\n [lib need-ns require]\n (load (root-resource lib))\n (throw-if (and need-ns (not (find-ns lib)))\n \"namespace '%s' not found after loading '%s'\"\n lib (root-resource lib))\n (when require\n (dosync\n (commute *loaded-libs* conj lib))))\n\n(defn- load-all\n \"Loads a lib given its name and forces a load of any libs it directly or\n indirectly loads. If need-ns, ensures that the associated namespace\n exists after loading. If require, records the load so any duplicate loads\n can be skipped.\"\n [lib need-ns require]\n (dosync\n (commute *loaded-libs* #(reduce1 conj %1 %2)\n (binding [*loaded-libs* (ref (sorted-set))]\n (load-one lib need-ns require)\n @*loaded-libs*))))\n\n(defn- load-lib\n \"Loads a lib with options\"\n [prefix lib & options]\n (throw-if (and prefix (pos? (.indexOf (name lib) (int \\.))))\n \"Found lib name '%s' containing period with prefix '%s'. lib names inside prefix lists must not contain periods\"\n (name lib) prefix)\n (let [lib (if prefix (symbol (str prefix \\. lib)) lib)\n opts (apply hash-map options)\n {:keys [as reload reload-all require use verbose]} opts\n loaded (contains? @*loaded-libs* lib)\n load (cond reload-all\n load-all\n (or reload (not require) (not loaded))\n load-one)\n need-ns (or as use)\n filter-opts (select-keys opts '(:exclude :only :rename :refer))\n undefined-on-entry (not (find-ns lib))]\n (binding [*loading-verbosely* (or *loading-verbosely* verbose)]\n (if load\n (try\n (load lib need-ns require)\n (catch Exception e\n (when undefined-on-entry\n (remove-ns lib))\n (throw e)))\n (throw-if (and need-ns (not (find-ns lib)))\n \"namespace '%s' not found\" lib))\n (when (and need-ns *loading-verbosely*)\n (printf \"(clojure.core/in-ns '%s)\\n\" (ns-name *ns*)))\n (when as\n (when *loading-verbosely*\n (printf \"(clojure.core/alias '%s '%s)\\n\" as lib))\n (alias as lib))\n (when (or use (:refer filter-opts))\n (when *loading-verbosely*\n (printf \"(clojure.core/refer '%s\" lib)\n (doseq [opt filter-opts]\n (printf \" %s '%s\" (key opt) (print-str (val opt))))\n (printf \")\\n\"))\n (apply refer lib (mapcat seq filter-opts))))))\n\n(defn- load-libs\n \"Loads libs, interpreting libspecs, prefix lists, and flags for\n forwarding to load-lib\"\n [& args]\n (let [flags (filter keyword? args)\n opts (interleave flags (repeat true))\n args (filter (complement keyword?) args)]\n ; check for unsupported options\n (let [supported #{:as :reload :reload-all :require :use :verbose :refer}\n unsupported (seq (remove supported flags))]\n (throw-if unsupported\n (apply str \"Unsupported option(s) supplied: \"\n (interpose \\, unsupported))))\n ; check a load target was specified\n (throw-if (not (seq args)) \"Nothing specified to load\")\n (doseq [arg args]\n (if (libspec? arg)\n (apply load-lib nil (prependss arg opts))\n (let [[prefix & args] arg]\n (throw-if (nil? prefix) \"prefix cannot be nil\")\n (doseq [arg args]\n (apply load-lib prefix (prependss arg opts))))))))\n\n(defn- check-cyclic-dependency\n \"Detects and rejects non-trivial cyclic load dependencies. The\n exception message shows the dependency chain with the cycle\n highlighted. Ignores the trivial case of a file attempting to load\n itself because that can occur when a gen-class'd class loads its\n implementation.\"\n [path]\n (when (some #{path} (rest *pending-paths*))\n (let [pending (map #(if (= % path) (str \"[ \" % \" ]\") %)\n (cons path *pending-paths*))\n chain (apply str (interpose \"->\" pending))]\n (throw-if true \"Cyclic load dependency: %s\" chain))))\n\n;; Public\n\n(defn require\n \"Loads libs, skipping any that are already loaded. Each argument is\n either a libspec that identifies a lib, a prefix list that identifies\n multiple libs whose names share a common prefix, or a flag that modifies\n how all the identified libs are loaded. Use :require in the ns macro\n in preference to calling this directly.\n\n Libs\n\n A 'lib' is a named set of resources in classpath whose contents define a\n library of Clojure code. Lib names are symbols and each lib is associated\n with a Clojure namespace and a Java package that share its name. A lib's\n name also locates its root directory within classpath using Java's\n package name to classpath-relative path mapping. All resources in a lib\n should be contained in the directory structure under its root directory.\n All definitions a lib makes should be in its associated namespace.\n\n 'require loads a lib by loading its root resource. The root resource path\n is derived from the lib name in the following manner:\n Consider a lib named by the symbol 'x.y.z; it has the root directory\n /x/y/, and its root resource is /x/y/z.clj. The root\n resource should contain code to create the lib's namespace (usually by using\n the ns macro) and load any additional lib resources.\n\n Libspecs\n\n A libspec is a lib name or a vector containing a lib name followed by\n options expressed as sequential keywords and arguments.\n\n Recognized options:\n :as takes a symbol as its argument and makes that symbol an alias to the\n lib's namespace in the current namespace.\n :refer takes a list of symbols to refer from the namespace or the :all\n keyword to bring in all public vars.\n\n Prefix Lists\n\n It's common for Clojure code to depend on several libs whose names have\n the same prefix. When specifying libs, prefix lists can be used to reduce\n repetition. A prefix list contains the shared prefix followed by libspecs\n with the shared prefix removed from the lib names. After removing the\n prefix, the names that remain must not contain any periods.\n\n Flags\n\n A flag is a keyword.\n Recognized flags: :reload, :reload-all, :verbose\n :reload forces loading of all the identified libs even if they are\n already loaded\n :reload-all implies :reload and also forces loading of all libs that the\n identified libs directly or indirectly load via require or use\n :verbose triggers printing information about each load, alias, and refer\n\n Example:\n\n The following would load the libraries clojure.zip and clojure.set\n abbreviated as 's'.\n\n (require '(clojure zip [set :as s]))\"\n {:added \"1.0\"}\n\n [& args]\n (apply load-libs :require args))\n\n(defn use\n \"Like 'require, but also refers to each lib's namespace using\n clojure.core/refer. Use :use in the ns macro in preference to calling\n this directly.\n\n 'use accepts additional options in libspecs: :exclude, :only, :rename.\n The arguments and semantics for :exclude, :only, and :rename are the same\n as those documented for clojure.core/refer.\"\n {:added \"1.0\"}\n [& args] (apply load-libs :require :use args))\n\n(defn loaded-libs\n \"Returns a sorted set of symbols naming the currently loaded libs\"\n {:added \"1.0\"}\n [] @*loaded-libs*)\n\n(defn load\n \"Loads Clojure code from resources in classpath. A path is interpreted as\n classpath-relative if it begins with a slash or relative to the root\n directory for the current namespace otherwise.\"\n {:added \"1.0\"}\n [& paths]\n (doseq [^String path paths]\n (let [^String path (if (.startsWith path \"/\")\n path\n (str (root-directory (ns-name *ns*)) \\/ path))]\n (when *loading-verbosely*\n (printf \"(clojure.core/load \\\"%s\\\")\\n\" path)\n (flush))\n (check-cyclic-dependency path)\n (when-not (= path (first *pending-paths*))\n (binding [*pending-paths* (conj *pending-paths* path)]\n (clojure.lang.RT/load (.substring path 1)))))))\n\n(defn compile\n \"Compiles the namespace named by the symbol lib into a set of\n classfiles. The source for the lib must be in a proper\n classpath-relative directory. The output files will go into the\n directory specified by *compile-path*, and that directory too must\n be in the classpath.\"\n {:added \"1.0\"}\n [lib]\n (binding [*compile-files* true\n *compiler-options* \n {:elide-meta (if (= \"true\" (System/getenv \"KEEP_META\"))\n []\n [:arglists :file :line :column\n :ns :name :added :static :doc])}]\n (load-one lib true true))\n lib)\n\n;;;;;;;;;;;;; nested associative ops ;;;;;;;;;;;\n\n(defn get-in\n \"Returns the value in a nested associative structure,\n where ks is a sequence of keys. Returns nil if the key\n is not present, or the not-found value if supplied.\"\n {:added \"1.2\"\n :static true}\n ([m ks]\n (reduce1 get m ks))\n ([m ks not-found]\n (loop [sentinel (Object.)\n m m\n ks (seq ks)]\n (if ks\n (let [m (get m (first ks) sentinel)]\n (if (identical? sentinel m)\n not-found\n (recur sentinel m (next ks))))\n m))))\n\n(defn assoc-in\n \"Associates a value in a nested associative structure, where ks is a\n sequence of keys and v is the new value and returns a new nested structure.\n If any levels do not exist, hash-maps will be created.\"\n {:added \"1.0\"\n :static true}\n [m [k & ks] v]\n (if ks\n (assoc m k (assoc-in (get m k) ks v))\n (assoc m k v)))\n\n(defn update-in\n \"'Updates' a value in a nested associative structure, where ks is a\n sequence of keys and f is a function that will take the old value\n and any supplied args and return the new value, and returns a new\n nested structure. If any levels do not exist, hash-maps will be\n created.\"\n {:added \"1.0\"\n :static true}\n ([m [k & ks] f & args]\n (if ks\n (assoc m k (apply update-in (get m k) ks f args))\n (assoc m k (apply f (get m k) args)))))\n\n(defn update\n \"'Updates' a value in an associative structure, where k is a\n key and f is a function that will take the old value\n and any supplied args and return the new value, and returns a new\n structure. If the key does not exist, nil is passed as the old value.\"\n {:added \"1.7\"\n :static true}\n ([m k f]\n (assoc m k (f (get m k))))\n ([m k f x]\n (assoc m k (f (get m k) x)))\n ([m k f x y]\n (assoc m k (f (get m k) x y)))\n ([m k f x y z]\n (assoc m k (f (get m k) x y z)))\n ([m k f x y z & more]\n (assoc m k (apply f (get m k) x y z more))))\n\n(defn empty?\n \"Returns true if coll has no items - same as (not (seq coll)).\n Please use the idiom (seq x) rather than (not (empty? x))\"\n {:added \"1.0\"\n :static true}\n [coll] (not (seq coll)))\n\n(defn coll?\n \"Returns true if x implements IPersistentCollection\"\n {:added \"1.0\"\n :static true}\n [x] (instance? clojure.lang.IPersistentCollection x))\n\n(defn list?\n \"Returns true if x implements IPersistentList\"\n {:added \"1.0\"\n :static true}\n [x] (instance? clojure.lang.IPersistentList x))\n\n(defn ifn?\n \"Returns true if x implements IFn. Note that many data structures\n (e.g. sets and maps) implement IFn\"\n {:added \"1.0\"\n :static true}\n [x] (instance? clojure.lang.IFn x))\n\n(defn fn?\n \"Returns true if x implements Fn, i.e. is an object created via fn.\"\n {:added \"1.0\"\n :static true}\n [x] (instance? clojure.lang.Fn x))\n\n\n(defn associative?\n \"Returns true if coll implements Associative\"\n {:added \"1.0\"\n :static true}\n [coll] (instance? clojure.lang.Associative coll))\n\n(defn sequential?\n \"Returns true if coll implements Sequential\"\n {:added \"1.0\"\n :static true}\n [coll] (instance? clojure.lang.Sequential coll))\n\n(defn sorted?\n \"Returns true if coll implements Sorted\"\n {:added \"1.0\"\n :static true}\n [coll] (instance? clojure.lang.Sorted coll))\n\n(defn counted?\n \"Returns true if coll implements count in constant time\"\n {:added \"1.0\"\n :static true}\n [coll] (instance? clojure.lang.Counted coll))\n\n(defn reversible?\n \"Returns true if coll implements Reversible\"\n {:added \"1.0\"\n :static true}\n [coll] (instance? clojure.lang.Reversible coll))\n\n(def ^:dynamic\n ^{:doc \"bound in a repl thread to the most recent value printed\"\n :added \"1.0\"}\n *1)\n\n(def ^:dynamic\n ^{:doc \"bound in a repl thread to the second most recent value printed\"\n :added \"1.0\"}\n *2)\n\n(def ^:dynamic\n ^{:doc \"bound in a repl thread to the third most recent value printed\"\n :added \"1.0\"}\n *3)\n\n(def ^:dynamic\n ^{:doc \"bound in a repl thread to the most recent exception caught by the repl\"\n :added \"1.0\"}\n *e)\n\n(defn trampoline\n \"trampoline can be used to convert algorithms requiring mutual\n recursion without stack consumption. Calls f with supplied args, if\n any. If f returns a fn, calls that fn with no arguments, and\n continues to repeat, until the return value is not a fn, then\n returns that non-fn value. Note that if you want to return a fn as a\n final value, you must wrap it in some data structure and unpack it\n after trampoline returns.\"\n {:added \"1.0\"\n :static true}\n ([f]\n (let [ret (f)]\n (if (fn? ret)\n (recur ret)\n ret)))\n ([f & args]\n (trampoline #(apply f args))))\n\n(defn intern\n \"Finds or creates a var named by the symbol name in the namespace\n ns (which can be a symbol or a namespace), setting its root binding\n to val if supplied. The namespace must exist. The var will adopt any\n metadata from the name symbol. Returns the var.\"\n {:added \"1.0\"\n :static true}\n ([ns ^clojure.lang.Symbol name]\n (let [v (clojure.lang.Var/intern (the-ns ns) name)]\n (when (meta name) (.setMeta v (meta name)))\n v))\n ([ns name val]\n (let [v (clojure.lang.Var/intern (the-ns ns) name val)]\n (when (meta name) (.setMeta v (meta name)))\n v)))\n\n(defmacro while\n \"Repeatedly executes body while test expression is true. Presumes\n some side-effect will cause test to become false/nil. Returns nil\"\n {:added \"1.0\"}\n [test & body]\n `(loop []\n (when ~test\n ~@body\n (recur))))\n\n(defn memoize\n \"Returns a memoized version of a referentially transparent function. The\n memoized version of the function keeps a cache of the mapping from arguments\n to results and, when calls with the same arguments are repeated often, has\n higher performance at the expense of higher memory use.\"\n {:added \"1.0\"\n :static true}\n [f]\n (let [mem (atom {})]\n (fn [& args]\n (if-let [e (find @mem args)]\n (val e)\n (let [ret (apply f args)]\n (swap! mem assoc args ret)\n ret)))))\n\n(def supers (memoize supers))\n(def bases (memoize bases))\n\n(defmacro condp\n \"Takes a binary predicate, an expression, and a set of clauses.\n Each clause can take the form of either:\n\n test-expr result-expr\n\n test-expr :>> result-fn\n\n Note :>> is an ordinary keyword.\n\n For each clause, (pred test-expr expr) is evaluated. If it returns\n logical true, the clause is a match. If a binary clause matches, the\n result-expr is returned, if a ternary clause matches, its result-fn,\n which must be a unary function, is called with the result of the\n predicate as its argument, the result of that call being the return\n value of condp. A single default expression can follow the clauses,\n and its value will be returned if no clause matches. If no default\n expression is provided and no clause matches, an\n IllegalArgumentException is thrown.\"\n {:added \"1.0\"}\n\n [pred expr & clauses]\n (let [gpred (gensym \"pred__\")\n gexpr (gensym \"expr__\")\n emit (fn emit [pred expr args]\n (let [[[a b c :as clause] more]\n (split-at (if (= :>> (second args)) 3 2) args)\n n (count clause)]\n (cond\n (= 0 n) `(throw (IllegalArgumentException. (str \"No matching clause: \" ~expr)))\n (= 1 n) a\n (= 2 n) `(if (~pred ~a ~expr)\n ~b\n ~(emit pred expr more))\n :else `(if-let [p# (~pred ~a ~expr)]\n (~c p#)\n ~(emit pred expr more)))))\n gres (gensym \"res__\")]\n `(let [~gpred ~pred\n ~gexpr ~expr]\n ~(emit gpred gexpr clauses))))\n\n;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;; var documentation ;;;;;;;;;;;;;;;;;;;;;;;;;;\n\n(alter-meta! #'*agent* assoc :added \"1.0\")\n(alter-meta! #'in-ns assoc :added \"1.0\")\n(alter-meta! #'load-file assoc :added \"1.0\")\n\n(defmacro add-doc-and-meta {:private true} [name docstring meta]\n `(alter-meta! (var ~name) merge (assoc ~meta :doc ~docstring)))\n\n(add-doc-and-meta *file*\n \"The path of the file being evaluated, as a String.\n\n When there is no file, e.g. in the REPL, the value is not defined.\"\n {:added \"1.0\"})\n\n(add-doc-and-meta *command-line-args*\n \"A sequence of the supplied command line arguments, or nil if\n none were supplied\"\n {:added \"1.0\"})\n\n(add-doc-and-meta *warn-on-reflection*\n \"When set to true, the compiler will emit warnings when reflection is\n needed to resolve Java method calls or field accesses.\n\n Defaults to false.\"\n {:added \"1.0\"})\n\n(add-doc-and-meta *compile-path*\n \"Specifies the directory where 'compile' will write out .class\n files. This directory must be in the classpath for 'compile' to\n work.\n\n Defaults to \\\"classes\\\"\"\n {:added \"1.0\"})\n\n(add-doc-and-meta *compile-files*\n \"Set to true when compiling files, false otherwise.\"\n {:added \"1.0\"})\n\n(add-doc-and-meta *unchecked-math*\n \"While bound to true, compilations of +, -, *, inc, dec and the\n coercions will be done without overflow checks. While bound\n to :warn-on-boxed, same behavior as true, and a warning is emitted\n when compilation uses boxed math. Default: false.\"\n {:added \"1.3\"})\n\n(add-doc-and-meta *compiler-options*\n \"A map of keys to options.\n Note, when binding dynamically make sure to merge with previous value.\n Supported options:\n :elide-meta - a collection of metadata keys to elide during compilation.\n :disable-locals-clearing - set to true to disable clearing, useful for using a debugger\n Alpha, subject to change.\"\n {:added \"1.4\"})\n\n(add-doc-and-meta *ns*\n \"A clojure.lang.Namespace object representing the current namespace.\"\n {:added \"1.0\"})\n\n(add-doc-and-meta *in*\n \"A java.io.Reader object representing standard input for read operations.\n\n Defaults to System/in, wrapped in a LineNumberingPushbackReader\"\n {:added \"1.0\"})\n\n(add-doc-and-meta *out*\n \"A java.io.Writer object representing standard output for print operations.\n\n Defaults to System/out, wrapped in an OutputStreamWriter\"\n {:added \"1.0\"})\n\n(add-doc-and-meta *err*\n \"A java.io.Writer object representing standard error for print operations.\n\n Defaults to System/err, wrapped in a PrintWriter\"\n {:added \"1.0\"})\n\n(add-doc-and-meta *flush-on-newline*\n \"When set to true, output will be flushed whenever a newline is printed.\n\n Defaults to true.\"\n {:added \"1.0\"})\n\n(add-doc-and-meta *print-meta*\n \"If set to logical true, when printing an object, its metadata will also\n be printed in a form that can be read back by the reader.\n\n Defaults to false.\"\n {:added \"1.0\"})\n\n(add-doc-and-meta *print-dup*\n \"When set to logical true, objects will be printed in a way that preserves\n their type when read in later.\n\n Defaults to false.\"\n {:added \"1.0\"})\n\n(add-doc-and-meta *print-readably*\n \"When set to logical false, strings and characters will be printed with\n non-alphanumeric characters converted to the appropriate escape sequences.\n\n Defaults to true\"\n {:added \"1.0\"})\n\n(add-doc-and-meta *read-eval*\n \"Defaults to true (or value specified by system property, see below)\n ***This setting implies that the full power of the reader is in play,\n including syntax that can cause code to execute. It should never be\n used with untrusted sources. See also: clojure.edn/read.***\n\n When set to logical false in the thread-local binding,\n the eval reader (#=) and record/type literal syntax are disabled in read/load.\n Example (will fail): (binding [*read-eval* false] (read-string \\\"#=(* 2 21)\\\"))\n\n The default binding can be controlled by the system property\n 'clojure.read.eval' System properties can be set on the command line\n like this:\n\n java -Dclojure.read.eval=false ...\n\n The system property can also be set to 'unknown' via\n -Dclojure.read.eval=unknown, in which case the default binding\n is :unknown and all reads will fail in contexts where *read-eval*\n has not been explicitly bound to either true or false. This setting\n can be a useful diagnostic tool to ensure that all of your reads\n occur in considered contexts. You can also accomplish this in a\n particular scope by binding *read-eval* to :unknown\n \"\n {:added \"1.0\"})\n\n(defn future?\n \"Returns true if x is a future\"\n {:added \"1.1\"\n :static true}\n [x] (instance? java.util.concurrent.Future x))\n\n(defn future-done?\n \"Returns true if future f is done\"\n {:added \"1.1\"\n :static true}\n [^java.util.concurrent.Future f] (.isDone f))\n\n\n(defmacro letfn\n \"fnspec ==> (fname [params*] exprs) or (fname ([params*] exprs)+)\n\n Takes a vector of function specs and a body, and generates a set of\n bindings of functions to their names. All of the names are available\n in all of the definitions of the functions, as well as the body.\"\n {:added \"1.0\", :forms '[(letfn [fnspecs*] exprs*)],\n :special-form true, :url nil}\n [fnspecs & body]\n `(letfn* ~(vec (interleave (map first fnspecs)\n (map #(cons `fn %) fnspecs)))\n ~@body))\n\n(defn fnil\n \"Takes a function f, and returns a function that calls f, replacing\n a nil first argument to f with the supplied value x. Higher arity\n versions can replace arguments in the second and third\n positions (y, z). Note that the function f can take any number of\n arguments, not just the one(s) being nil-patched.\"\n {:added \"1.2\"\n :static true}\n ([f x]\n (fn\n ([a] (f (if (nil? a) x a)))\n ([a b] (f (if (nil? a) x a) b))\n ([a b c] (f (if (nil? a) x a) b c))\n ([a b c & ds] (apply f (if (nil? a) x a) b c ds))))\n ([f x y]\n (fn\n ([a b] (f (if (nil? a) x a) (if (nil? b) y b)))\n ([a b c] (f (if (nil? a) x a) (if (nil? b) y b) c))\n ([a b c & ds] (apply f (if (nil? a) x a) (if (nil? b) y b) c ds))))\n ([f x y z]\n (fn\n ([a b] (f (if (nil? a) x a) (if (nil? b) y b)))\n ([a b c] (f (if (nil? a) x a) (if (nil? b) y b) (if (nil? c) z c)))\n ([a b c & ds] (apply f (if (nil? a) x a) (if (nil? b) y b) (if (nil? c) z c) ds)))))\n\n\n;;;;;;; case ;;;;;;;;;;;;;\n(defn- shift-mask [shift mask x]\n (-> x (bit-shift-right shift) (bit-and mask)))\n\n(def ^:private max-mask-bits 13)\n(def ^:private max-switch-table-size (bit-shift-left 1 max-mask-bits))\n\n(defn- maybe-min-hash\n \"takes a collection of hashes and returns [shift mask] or nil if none found\"\n [hashes]\n (first\n (filter (fn [[s m]]\n (apply distinct? (map #(shift-mask s m %) hashes)))\n (for [mask (map #(dec (bit-shift-left 1 %)) (range 1 (inc max-mask-bits)))\n shift (range 0 31)]\n [shift mask]))))\n\n(defn- case-map\n \"Transforms a sequence of test constants and a corresponding sequence of then\n expressions into a sorted map to be consumed by case*. The form of the map\n entries are {(case-f test) [(test-f test) then]}.\"\n [case-f test-f tests thens]\n (into1 (sorted-map)\n (zipmap (map case-f tests)\n (map vector\n (map test-f tests)\n thens))))\n\n(defn- fits-table?\n \"Returns true if the collection of ints can fit within the\n max-table-switch-size, false otherwise.\"\n [ints]\n (< (- (apply max (seq ints)) (apply min (seq ints))) max-switch-table-size))\n\n(defn- prep-ints\n \"Takes a sequence of int-sized test constants and a corresponding sequence of\n then expressions. Returns a tuple of [shift mask case-map switch-type] where\n case-map is a map of int case values to [test then] tuples, and switch-type\n is either :sparse or :compact.\"\n [tests thens]\n (if (fits-table? tests)\n ; compact case ints, no shift-mask\n [0 0 (case-map int int tests thens) :compact]\n (let [[shift mask] (or (maybe-min-hash (map int tests)) [0 0])]\n (if (zero? mask)\n ; sparse case ints, no shift-mask\n [0 0 (case-map int int tests thens) :sparse]\n ; compact case ints, with shift-mask\n [shift mask (case-map #(shift-mask shift mask (int %)) int tests thens) :compact]))))\n\n(defn- merge-hash-collisions\n \"Takes a case expression, default expression, and a sequence of test constants\n and a corresponding sequence of then expressions. Returns a tuple of\n [tests thens skip-check-set] where no tests have the same hash. Each set of\n input test constants with the same hash is replaced with a single test\n constant (the case int), and their respective thens are combined into:\n (condp = expr\n test-1 then-1\n ...\n test-n then-n\n default).\n The skip-check is a set of case ints for which post-switch equivalence\n checking must not be done (the cases holding the above condp thens).\"\n [expr-sym default tests thens]\n (let [buckets (loop [m {} ks tests vs thens]\n (if (and ks vs)\n (recur\n (update m (clojure.lang.Util/hash (first ks)) (fnil conj []) [(first ks) (first vs)])\n (next ks) (next vs))\n m))\n assoc-multi (fn [m h bucket]\n (let [testexprs (apply concat bucket)\n expr `(condp = ~expr-sym ~@testexprs ~default)]\n (assoc m h expr)))\n hmap (reduce1\n (fn [m [h bucket]]\n (if (== 1 (count bucket))\n (assoc m (ffirst bucket) (second (first bucket)))\n (assoc-multi m h bucket)))\n {} buckets)\n skip-check (->> buckets\n (filter #(< 1 (count (second %))))\n (map first)\n (into1 #{}))]\n [(keys hmap) (vals hmap) skip-check]))\n\n(defn- prep-hashes\n \"Takes a sequence of test constants and a corresponding sequence of then\n expressions. Returns a tuple of [shift mask case-map switch-type skip-check]\n where case-map is a map of int case values to [test then] tuples, switch-type\n is either :sparse or :compact, and skip-check is a set of case ints for which\n post-switch equivalence checking must not be done (occurs with hash\n collisions).\"\n [expr-sym default tests thens]\n (let [hashcode #(clojure.lang.Util/hash %)\n hashes (into1 #{} (map hashcode tests))]\n (if (== (count tests) (count hashes))\n (if (fits-table? hashes)\n ; compact case ints, no shift-mask\n [0 0 (case-map hashcode identity tests thens) :compact]\n (let [[shift mask] (or (maybe-min-hash hashes) [0 0])]\n (if (zero? mask)\n ; sparse case ints, no shift-mask\n [0 0 (case-map hashcode identity tests thens) :sparse]\n ; compact case ints, with shift-mask\n [shift mask (case-map #(shift-mask shift mask (hashcode %)) identity tests thens) :compact])))\n ; resolve hash collisions and try again\n (let [[tests thens skip-check] (merge-hash-collisions expr-sym default tests thens)\n [shift mask case-map switch-type] (prep-hashes expr-sym default tests thens)\n skip-check (if (zero? mask)\n skip-check\n (into1 #{} (map #(shift-mask shift mask %) skip-check)))]\n [shift mask case-map switch-type skip-check]))))\n\n(defmacro case\n \"Takes an expression, and a set of clauses.\n\n Each clause can take the form of either:\n\n test-constant result-expr\n\n (test-constant1 ... test-constantN) result-expr\n\n The test-constants are not evaluated. They must be compile-time\n literals, and need not be quoted. If the expression is equal to a\n test-constant, the corresponding result-expr is returned. A single\n default expression can follow the clauses, and its value will be\n returned if no clause matches. If no default expression is provided\n and no clause matches, an IllegalArgumentException is thrown.\n\n Unlike cond and condp, case does a constant-time dispatch, the\n clauses are not considered sequentially. All manner of constant\n expressions are acceptable in case, including numbers, strings,\n symbols, keywords, and (Clojure) composites thereof. Note that since\n lists are used to group multiple constants that map to the same\n expression, a vector can be used to match a list if needed. The\n test-constants need not be all of the same type.\"\n {:added \"1.2\"}\n\n [e & clauses]\n (let [ge (with-meta (gensym) {:tag Object})\n default (if (odd? (count clauses))\n (last clauses)\n `(throw (IllegalArgumentException. (str \"No matching clause: \" ~ge))))]\n (if (> 2 (count clauses))\n `(let [~ge ~e] ~default)\n (let [pairs (partition 2 clauses)\n assoc-test (fn assoc-test [m test expr]\n (if (contains? m test)\n (throw (IllegalArgumentException. (str \"Duplicate case test constant: \" test)))\n (assoc m test expr)))\n pairs (reduce1\n (fn [m [test expr]]\n (if (seq? test)\n (reduce1 #(assoc-test %1 %2 expr) m test)\n (assoc-test m test expr)))\n {} pairs)\n tests (keys pairs)\n thens (vals pairs)\n mode (cond\n (every? #(and (integer? %) (<= Integer/MIN_VALUE % Integer/MAX_VALUE)) tests)\n :ints\n (every? keyword? tests)\n :identity\n :else :hashes)]\n (condp = mode\n :ints\n (let [[shift mask imap switch-type] (prep-ints tests thens)]\n `(let [~ge ~e] (case* ~ge ~shift ~mask ~default ~imap ~switch-type :int)))\n :hashes\n (let [[shift mask imap switch-type skip-check] (prep-hashes ge default tests thens)]\n `(let [~ge ~e] (case* ~ge ~shift ~mask ~default ~imap ~switch-type :hash-equiv ~skip-check)))\n :identity\n (let [[shift mask imap switch-type skip-check] (prep-hashes ge default tests thens)]\n `(let [~ge ~e] (case* ~ge ~shift ~mask ~default ~imap ~switch-type :hash-identity ~skip-check))))))))\n\n;; redefine reduce with internal-reduce\n\n;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;; helper files ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\n(alter-meta! (find-ns 'clojure.core) assoc :doc \"Fundamental library of the Clojure language\")\n(load \"core_proxy\")\n(load \"core_print\")\n(load \"genclass\")\n(load \"core_deftype\")\n(load \"core/protocols\")\n(load \"gvec\")\n(load \"instant\")\n(load \"uuid\")\n\n(defn reduce\n \"f should be a function of 2 arguments. If val is not supplied,\n returns the result of applying f to the first 2 items in coll, then\n applying f to that result and the 3rd item, etc. If coll contains no\n items, f must accept no arguments as well, and reduce returns the\n result of calling f with no arguments. If coll has only 1 item, it\n is returned and f is not called. If val is supplied, returns the\n result of applying f to val and the first item in coll, then\n applying f to that result and the 2nd item, etc. If coll contains no\n items, returns val and f is not called.\"\n {:added \"1.0\"}\n ([f coll]\n (if (instance? clojure.lang.IReduce coll)\n (.reduce ^clojure.lang.IReduce coll f)\n (clojure.core.protocols/coll-reduce coll f)))\n ([f val coll]\n (if (instance? clojure.lang.IReduceInit coll)\n (.reduce ^clojure.lang.IReduceInit coll f val)\n (clojure.core.protocols/coll-reduce coll f val))))\n\n(extend-protocol clojure.core.protocols/IKVReduce\n nil\n (kv-reduce\n [_ f init]\n init)\n\n ;;slow path default\n clojure.lang.IPersistentMap\n (kv-reduce\n [amap f init]\n (reduce (fn [ret [k v]] (f ret k v)) init amap))\n\n clojure.lang.PersistentHashMap\n (kv-reduce\n [amap f init]\n (.kvreduce amap f init))\n\n clojure.lang.PersistentArrayMap\n (kv-reduce\n [amap f init]\n (.kvreduce amap f init))\n\n clojure.lang.PersistentTreeMap\n (kv-reduce\n [amap f init]\n (.kvreduce amap f init))\n\n clojure.lang.PersistentVector\n (kv-reduce\n [vec f init]\n (.kvreduce vec f init)))\n\n(defn reduce-kv\n \"Reduces an associative collection. f should be a function of 3\n arguments. Returns the result of applying f to init, the first key\n and the first value in coll, then applying f to that result and the\n 2nd key and value, etc. If coll contains no entries, returns init\n and f is not called. Note that reduce-kv is supported on vectors,\n where the keys will be the ordinals.\"\n {:added \"1.4\"}\n ([f init coll]\n (clojure.core.protocols/kv-reduce coll f init)))\n\n(defn completing\n \"Takes a reducing function f of 2 args and returns a fn suitable for\n transduce by adding an arity-1 signature that calls cf (default -\n identity) on the result argument.\"\n {:added \"1.7\"}\n ([f] (completing f identity))\n ([f cf]\n (fn\n ([] (f))\n ([x] (cf x))\n ([x y] (f x y)))))\n\n(defn transduce\n \"reduce with a transformation of f (xf). If init is not\n supplied, (f) will be called to produce it. f should be a reducing\n step function that accepts both 1 and 2 arguments, if it accepts\n only 2 you can add the arity-1 with 'completing'. Returns the result\n of applying (the transformed) xf to init and the first item in coll,\n then applying xf to that result and the 2nd item, etc. If coll\n contains no items, returns init and f is not called. Note that\n certain transforms may inject or skip items.\" {:added \"1.7\"}\n ([xform f coll] (transduce xform f (f) coll))\n ([xform f init coll]\n (let [f (xform f)\n ret (if (instance? clojure.lang.IReduceInit coll)\n (.reduce ^clojure.lang.IReduceInit coll f init)\n (clojure.core.protocols/coll-reduce coll f init))]\n (f ret))))\n\n(defn into\n \"Returns a new coll consisting of to-coll with all of the items of\n from-coll conjoined. A transducer may be supplied.\"\n {:added \"1.0\"\n :static true}\n ([to from]\n (if (instance? clojure.lang.IEditableCollection to)\n (with-meta (persistent! (reduce conj! (transient to) from)) (meta to))\n (reduce conj to from)))\n ([to xform from]\n (if (instance? clojure.lang.IEditableCollection to)\n (with-meta (persistent! (transduce xform conj! (transient to) from)) (meta to))\n (transduce xform conj to from))))\n\n(defn mapv\n \"Returns a vector consisting of the result of applying f to the\n set of first items of each coll, followed by applying f to the set\n of second items in each coll, until any one of the colls is\n exhausted. Any remaining items in other colls are ignored. Function\n f should accept number-of-colls arguments.\"\n {:added \"1.4\"\n :static true}\n ([f coll]\n (-> (reduce (fn [v o] (conj! v (f o))) (transient []) coll)\n persistent!))\n ([f c1 c2]\n (into [] (map f c1 c2)))\n ([f c1 c2 c3]\n (into [] (map f c1 c2 c3)))\n ([f c1 c2 c3 & colls]\n (into [] (apply map f c1 c2 c3 colls))))\n\n(defn filterv\n \"Returns a vector of the items in coll for which\n (pred item) returns true. pred must be free of side-effects.\"\n {:added \"1.4\"\n :static true}\n [pred coll]\n (-> (reduce (fn [v o] (if (pred o) (conj! v o) v))\n (transient [])\n coll)\n persistent!))\n\n(load \"java/io\")\n\n(defn- normalize-slurp-opts\n [opts]\n (if (string? (first opts))\n (do\n (println \"WARNING: (slurp f enc) is deprecated, use (slurp f :encoding enc).\")\n [:encoding (first opts)])\n opts))\n\n(defn slurp\n \"Opens a reader on f and reads all its contents, returning a string.\n See clojure.java.io/reader for a complete list of supported arguments.\"\n {:added \"1.0\"}\n ([f & opts]\n (let [opts (normalize-slurp-opts opts)\n sb (StringBuilder.)]\n (with-open [^java.io.Reader r (apply clojure.java.io/reader f opts)]\n (loop [c (.read r)]\n (if (neg? c)\n (str sb)\n (do\n (.append sb (char c))\n (recur (.read r)))))))))\n\n(defn spit\n \"Opposite of slurp. Opens f with writer, writes content, then\n closes f. Options passed to clojure.java.io/writer.\"\n {:added \"1.2\"}\n [f content & options]\n (with-open [^java.io.Writer w (apply clojure.java.io/writer f options)]\n (.write w (str content))))\n\n;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;; futures (needs proxy);;;;;;;;;;;;;;;;;;\n(defn future-call\n \"Takes a function of no args and yields a future object that will\n invoke the function in another thread, and will cache the result and\n return it on all subsequent calls to deref/@. If the computation has\n not yet finished, calls to deref/@ will block, unless the variant\n of deref with timeout is used. See also - realized?.\"\n {:added \"1.1\"\n :static true}\n [f]\n (let [f (binding-conveyor-fn f)\n fut (.submit clojure.lang.Agent/soloExecutor ^Callable f)]\n (reify\n clojure.lang.IDeref\n (deref [_] (deref-future fut))\n clojure.lang.IBlockingDeref\n (deref\n [_ timeout-ms timeout-val]\n (deref-future fut timeout-ms timeout-val))\n clojure.lang.IPending\n (isRealized [_] (.isDone fut))\n java.util.concurrent.Future\n (get [_] (.get fut))\n (get [_ timeout unit] (.get fut timeout unit))\n (isCancelled [_] (.isCancelled fut))\n (isDone [_] (.isDone fut))\n (cancel [_ interrupt?] (.cancel fut interrupt?)))))\n\n(defmacro future\n \"Takes a body of expressions and yields a future object that will\n invoke the body in another thread, and will cache the result and\n return it on all subsequent calls to deref/@. If the computation has\n not yet finished, calls to deref/@ will block, unless the variant of\n deref with timeout is used. See also - realized?.\"\n {:added \"1.1\"}\n [& body] `(future-call (^{:once true} fn* [] ~@body)))\n\n\n(defn future-cancel\n \"Cancels the future, if possible.\"\n {:added \"1.1\"\n :static true}\n [^java.util.concurrent.Future f] (.cancel f true))\n\n(defn future-cancelled?\n \"Returns true if future f is cancelled\"\n {:added \"1.1\"\n :static true}\n [^java.util.concurrent.Future f] (.isCancelled f))\n\n(defn pmap\n \"Like map, except f is applied in parallel. Semi-lazy in that the\n parallel computation stays ahead of the consumption, but doesn't\n realize the entire result unless required. Only useful for\n computationally intensive functions where the time of f dominates\n the coordination overhead.\"\n {:added \"1.0\"\n :static true}\n ([f coll]\n (let [n (+ 2 (.. Runtime getRuntime availableProcessors))\n rets (map #(future (f %)) coll)\n step (fn step [[x & xs :as vs] fs]\n (lazy-seq\n (if-let [s (seq fs)]\n (cons (deref x) (step xs (rest s)))\n (map deref vs))))]\n (step rets (drop n rets))))\n ([f coll & colls]\n (let [step (fn step [cs]\n (lazy-seq\n (let [ss (map seq cs)]\n (when (every? identity ss)\n (cons (map first ss) (step (map rest ss)))))))]\n (pmap #(apply f %) (step (cons coll colls))))))\n\n(defn pcalls\n \"Executes the no-arg fns in parallel, returning a lazy sequence of\n their values\"\n {:added \"1.0\"\n :static true}\n [& fns] (pmap #(%) fns))\n\n(defmacro pvalues\n \"Returns a lazy sequence of the values of the exprs, which are\n evaluated in parallel\"\n {:added \"1.0\"\n :static true}\n [& exprs]\n `(pcalls ~@(map #(list `fn [] %) exprs)))\n\n\n;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;; clojure version number ;;;;;;;;;;;;;;;;;;;;;;\n\n;(let [properties (with-open [version-stream (.getResourceAsStream\n; (ClassLoader/getSystemClassLoader)\n; \"clojure/version.properties\")]\n; (doto (new java.util.Properties)\n; (.load version-stream)))\n; version-string (.getProperty properties \"version\")\n; [_ major minor incremental qualifier snapshot]\n; (re-matches\n; #\"(\\d+)\\.(\\d+)\\.(\\d+)(?:-([a-zA-Z0-9_]+))?(?:-(SNAPSHOT))?\"\n; version-string)\n; clojure-version {:major (Integer/valueOf ^String major)\n; :minor (Integer/valueOf ^String minor)\n; :incremental (Integer/valueOf ^String incremental)\n; :qualifier (if (= qualifier \"SNAPSHOT\") nil qualifier)}]\n; (def ^:dynamic *clojure-version*\n; (if (.contains version-string \"SNAPSHOT\")\n; (clojure.lang.RT/assoc clojure-version :interim true)\n; clojure-version)))\n\n(def ^:dynamic *clojure-version* {:major 1, :minor 5, :incremental 1, :qualifier nil})\n\n;(add-doc-and-meta *clojure-version*\n; \"The version info for Clojure core, as a map containing :major :minor\n; :incremental and :qualifier keys. Feature releases may increment\n; :minor and/or :major, bugfix releases will increment :incremental.\n; Possible values of :qualifier include \\\"GA\\\", \\\"SNAPSHOT\\\", \\\"RC-x\\\" \\\"BETA-x\\\"\"\n; {:added \"1.0\"})\n\n(defn\n clojure-version\n \"Returns clojure version as a printable string.\"\n {:added \"1.0\"}\n []\n (str (:major *clojure-version*)\n \".\"\n (:minor *clojure-version*)\n (when-let [i (:incremental *clojure-version*)]\n (str \".\" i))\n (when-let [q (:qualifier *clojure-version*)]\n (when (pos? (count q)) (str \"-\" q)))\n (when (:interim *clojure-version*)\n \"-SNAPSHOT\")))\n\n(defn promise\n \"Returns a promise object that can be read with deref/@, and set,\n once only, with deliver. Calls to deref/@ prior to delivery will\n block, unless the variant of deref with timeout is used. All\n subsequent derefs will return the same delivered value without\n blocking. See also - realized?.\"\n {:added \"1.1\"\n :static true}\n []\n (let [d (java.util.concurrent.CountDownLatch. 1)\n v (atom d)]\n (reify\n clojure.lang.IDeref\n (deref [_] (.await d) @v)\n clojure.lang.IBlockingDeref\n (deref\n [_ timeout-ms timeout-val]\n (if (.await d timeout-ms java.util.concurrent.TimeUnit/MILLISECONDS)\n @v\n timeout-val))\n clojure.lang.IPending\n (isRealized [this]\n (zero? (.getCount d)))\n clojure.lang.IFn\n (invoke\n [this x]\n (when (and (pos? (.getCount d))\n (compare-and-set! v d x))\n (.countDown d)\n this)))))\n\n(defn deliver\n \"Delivers the supplied value to the promise, releasing any pending\n derefs. A subsequent call to deliver on a promise will have no effect.\"\n {:added \"1.1\"\n :static true}\n [promise val] (promise val))\n\n\n\n(defn flatten\n \"Takes any nested combination of sequential things (lists, vectors,\n etc.) and returns their contents as a single, flat sequence.\n (flatten nil) returns an empty sequence.\"\n {:added \"1.2\"\n :static true}\n [x]\n (filter (complement sequential?)\n (rest (tree-seq sequential? seq x))))\n\n(defn group-by\n \"Returns a map of the elements of coll keyed by the result of\n f on each element. The value at each key will be a vector of the\n corresponding elements, in the order they appeared in coll.\"\n {:added \"1.2\"\n :static true}\n [f coll]\n (persistent!\n (reduce\n (fn [ret x]\n (let [k (f x)]\n (assoc! ret k (conj (get ret k []) x))))\n (transient {}) coll)))\n\n(defn partition-by\n \"Applies f to each value in coll, splitting it each time f returns a\n new value. Returns a lazy seq of partitions. Returns a stateful\n transducer when no collection is provided.\"\n {:added \"1.2\"\n :static true}\n ([f]\n (fn [rf]\n (let [a (java.util.ArrayList.)\n pv (volatile! ::none)]\n (fn\n ([] (rf))\n ([result]\n (let [result (if (.isEmpty a)\n result\n (let [v (vec (.toArray a))]\n ;;clear first!\n (.clear a)\n (unreduced (rf result v))))]\n (rf result)))\n ([result input]\n (let [pval @pv\n val (f input)]\n (vreset! pv val)\n (if (or (identical? pval ::none)\n (= val pval))\n (do\n (.add a input)\n result)\n (let [v (vec (.toArray a))]\n (.clear a)\n (let [ret (rf result v)]\n (when-not (reduced? ret)\n (.add a input))\n ret)))))))))\n ([f coll]\n (lazy-seq\n (when-let [s (seq coll)]\n (let [fst (first s)\n fv (f fst)\n run (cons fst (take-while #(= fv (f %)) (next s)))]\n (cons run (partition-by f (seq (drop (count run) s)))))))))\n\n(defn frequencies\n \"Returns a map from distinct items in coll to the number of times\n they appear.\"\n {:added \"1.2\"\n :static true}\n [coll]\n (persistent!\n (reduce (fn [counts x]\n (assoc! counts x (inc (get counts x 0))))\n (transient {}) coll)))\n\n(defn reductions\n \"Returns a lazy seq of the intermediate values of the reduction (as\n per reduce) of coll by f, starting with init.\"\n {:added \"1.2\"}\n ([f coll]\n (lazy-seq\n (if-let [s (seq coll)]\n (reductions f (first s) (rest s))\n (list (f)))))\n ([f init coll]\n (if (reduced? init)\n (list @init)\n (cons init\n (lazy-seq\n (when-let [s (seq coll)]\n (reductions f (f init (first s)) (rest s))))))))\n\n(defn rand-nth\n \"Return a random element of the (sequential) collection. Will have\n the same performance characteristics as nth for the given\n collection.\"\n {:added \"1.2\"\n :static true}\n [coll]\n (nth coll (rand-int (count coll))))\n\n(defn partition-all\n \"Returns a lazy sequence of lists like partition, but may include\n partitions with fewer than n items at the end. Returns a stateful\n transducer when no collection is provided.\"\n {:added \"1.2\"\n :static true}\n ([^long n]\n (fn [rf]\n (let [a (java.util.ArrayList. n)]\n (fn\n ([] (rf))\n ([result]\n (let [result (if (.isEmpty a)\n result\n (let [v (vec (.toArray a))]\n ;;clear first!\n (.clear a)\n (unreduced (rf result v))))]\n (rf result)))\n ([result input]\n (.add a input)\n (if (= n (.size a))\n (let [v (vec (.toArray a))]\n (.clear a)\n (rf result v))\n result))))))\n ([n coll]\n (partition-all n n coll))\n ([n step coll]\n (lazy-seq\n (when-let [s (seq coll)]\n (let [seg (doall (take n s))]\n (cons seg (partition-all n step (nthrest s step))))))))\n\n(defn shuffle\n \"Return a random permutation of coll\"\n {:added \"1.2\"\n :static true}\n [^java.util.Collection coll]\n (let [al (java.util.ArrayList. coll)]\n (java.util.Collections/shuffle al)\n (clojure.lang.RT/vector (.toArray al))))\n\n(defn map-indexed\n \"Returns a lazy sequence consisting of the result of applying f to 0\n and the first item of coll, followed by applying f to 1 and the second\n item in coll, etc, until coll is exhausted. Thus function f should\n accept 2 arguments, index and item. Returns a stateful transducer when\n no collection is provided.\"\n {:added \"1.2\"\n :static true}\n ([f]\n (fn [rf]\n (let [i (volatile! -1)]\n (fn\n ([] (rf))\n ([result] (rf result))\n ([result input]\n (rf result (f (vswap! i inc) input)))))))\n ([f coll]\n (letfn [(mapi [idx coll]\n (lazy-seq\n (when-let [s (seq coll)]\n (if (chunked-seq? s)\n (let [c (chunk-first s)\n size (int (count c))\n b (chunk-buffer size)]\n (dotimes [i size]\n (chunk-append b (f (+ idx i) (.nth c i))))\n (chunk-cons (chunk b) (mapi (+ idx size) (chunk-rest s))))\n (cons (f idx (first s)) (mapi (inc idx) (rest s)))))))]\n (mapi 0 coll))))\n\n(defn keep\n \"Returns a lazy sequence of the non-nil results of (f item). Note,\n this means false return values will be included. f must be free of\n side-effects. Returns a transducer when no collection is provided.\"\n {:added \"1.2\"\n :static true}\n ([f]\n (fn [rf]\n (fn\n ([] (rf))\n ([result] (rf result))\n ([result input]\n (let [v (f input)]\n (if (nil? v)\n result\n (rf result v)))))))\n ([f coll]\n (lazy-seq\n (when-let [s (seq coll)]\n (if (chunked-seq? s)\n (let [c (chunk-first s)\n size (count c)\n b (chunk-buffer size)]\n (dotimes [i size]\n (let [x (f (.nth c i))]\n (when-not (nil? x)\n (chunk-append b x))))\n (chunk-cons (chunk b) (keep f (chunk-rest s))))\n (let [x (f (first s))]\n (if (nil? x)\n (keep f (rest s))\n (cons x (keep f (rest s))))))))))\n\n(defn keep-indexed\n \"Returns a lazy sequence of the non-nil results of (f index item). Note,\n this means false return values will be included. f must be free of\n side-effects. Returns a stateful transducer when no collection is\n provided.\"\n {:added \"1.2\"\n :static true}\n ([f]\n (fn [rf]\n (let [iv (volatile! -1)]\n (fn\n ([] (rf))\n ([result] (rf result))\n ([result input]\n (let [i (vswap! iv inc)\n v (f i input)]\n (if (nil? v)\n result\n (rf result v))))))))\n ([f coll]\n (letfn [(keepi [idx coll]\n (lazy-seq\n (when-let [s (seq coll)]\n (if (chunked-seq? s)\n (let [c (chunk-first s)\n size (count c)\n b (chunk-buffer size)]\n (dotimes [i size]\n (let [x (f (+ idx i) (.nth c i))]\n (when-not (nil? x)\n (chunk-append b x))))\n (chunk-cons (chunk b) (keepi (+ idx size) (chunk-rest s))))\n (let [x (f idx (first s))]\n (if (nil? x)\n (keepi (inc idx) (rest s))\n (cons x (keepi (inc idx) (rest s)))))))))]\n (keepi 0 coll))))\n\n(defn every-pred\n \"Takes a set of predicates and returns a function f that returns true if all of its\n composing predicates return a logical true value against all of its arguments, else it returns\n false. Note that f is short-circuiting in that it will stop execution on the first\n argument that triggers a logical false result against the original predicates.\"\n {:added \"1.3\"}\n ([p]\n (fn ep1\n ([] true)\n ([x] (boolean (p x)))\n ([x y] (boolean (and (p x) (p y))))\n ([x y z] (boolean (and (p x) (p y) (p z))))\n ([x y z & args] (boolean (and (ep1 x y z)\n (every? p args))))))\n ([p1 p2]\n (fn ep2\n ([] true)\n ([x] (boolean (and (p1 x) (p2 x))))\n ([x y] (boolean (and (p1 x) (p1 y) (p2 x) (p2 y))))\n ([x y z] (boolean (and (p1 x) (p1 y) (p1 z) (p2 x) (p2 y) (p2 z))))\n ([x y z & args] (boolean (and (ep2 x y z)\n (every? #(and (p1 %) (p2 %)) args))))))\n ([p1 p2 p3]\n (fn ep3\n ([] true)\n ([x] (boolean (and (p1 x) (p2 x) (p3 x))))\n ([x y] (boolean (and (p1 x) (p2 x) (p3 x) (p1 y) (p2 y) (p3 y))))\n ([x y z] (boolean (and (p1 x) (p2 x) (p3 x) (p1 y) (p2 y) (p3 y) (p1 z) (p2 z) (p3 z))))\n ([x y z & args] (boolean (and (ep3 x y z)\n (every? #(and (p1 %) (p2 %) (p3 %)) args))))))\n ([p1 p2 p3 & ps]\n (let [ps (list* p1 p2 p3 ps)]\n (fn epn\n ([] true)\n ([x] (every? #(% x) ps))\n ([x y] (every? #(and (% x) (% y)) ps))\n ([x y z] (every? #(and (% x) (% y) (% z)) ps))\n ([x y z & args] (boolean (and (epn x y z)\n (every? #(every? % args) ps))))))))\n\n(defn some-fn\n \"Takes a set of predicates and returns a function f that returns the first logical true value\n returned by one of its composing predicates against any of its arguments, else it returns\n logical false. Note that f is short-circuiting in that it will stop execution on the first\n argument that triggers a logical true result against the original predicates.\"\n {:added \"1.3\"}\n ([p]\n (fn sp1\n ([] nil)\n ([x] (p x))\n ([x y] (or (p x) (p y)))\n ([x y z] (or (p x) (p y) (p z)))\n ([x y z & args] (or (sp1 x y z)\n (some p args)))))\n ([p1 p2]\n (fn sp2\n ([] nil)\n ([x] (or (p1 x) (p2 x)))\n ([x y] (or (p1 x) (p1 y) (p2 x) (p2 y)))\n ([x y z] (or (p1 x) (p1 y) (p1 z) (p2 x) (p2 y) (p2 z)))\n ([x y z & args] (or (sp2 x y z)\n (some #(or (p1 %) (p2 %)) args)))))\n ([p1 p2 p3]\n (fn sp3\n ([] nil)\n ([x] (or (p1 x) (p2 x) (p3 x)))\n ([x y] (or (p1 x) (p2 x) (p3 x) (p1 y) (p2 y) (p3 y)))\n ([x y z] (or (p1 x) (p2 x) (p3 x) (p1 y) (p2 y) (p3 y) (p1 z) (p2 z) (p3 z)))\n ([x y z & args] (or (sp3 x y z)\n (some #(or (p1 %) (p2 %) (p3 %)) args)))))\n ([p1 p2 p3 & ps]\n (let [ps (list* p1 p2 p3 ps)]\n (fn spn\n ([] nil)\n ([x] (some #(% x) ps))\n ([x y] (some #(or (% x) (% y)) ps))\n ([x y z] (some #(or (% x) (% y) (% z)) ps))\n ([x y z & args] (or (spn x y z)\n (some #(some % args) ps)))))))\n\n(defn- ^{:dynamic true} assert-valid-fdecl\n \"A good fdecl looks like (([a] ...) ([a b] ...)) near the end of defn.\"\n [fdecl]\n (when (empty? fdecl) (throw (IllegalArgumentException.\n \"Parameter declaration missing\")))\n (let [argdecls (map\n #(if (seq? %)\n (first %)\n (throw (IllegalArgumentException.\n ^String\n (if (seq? (first fdecl))\n (str \"Invalid signature \\\"\"\n %\n \"\\\" should be a list\")\n (str \"Parameter declaration \\\"\"\n %\n \"\\\" should be a vector\")))))\n fdecl)\n bad-args (seq (remove #(vector? %) argdecls))]\n (when bad-args\n (throw (IllegalArgumentException. (str \"Parameter declaration \\\"\" (first bad-args) \n \"\\\" should be a vector\"))))))\n\n(defn with-redefs-fn\n \"Temporarily redefines Vars during a call to func. Each val of\n binding-map will replace the root value of its key which must be\n a Var. After func is called with no args, the root values of all\n the Vars will be set back to their old values. These temporary\n changes will be visible in all threads. Useful for mocking out\n functions during testing.\"\n {:added \"1.3\"}\n [binding-map func]\n (let [root-bind (fn [m]\n (doseq [[a-var a-val] m]\n (.bindRoot ^clojure.lang.Var a-var a-val)))\n old-vals (zipmap (keys binding-map)\n (map #(.getRawRoot ^clojure.lang.Var %) (keys binding-map)))]\n (try\n (root-bind binding-map)\n (func)\n (finally\n (root-bind old-vals)))))\n\n(defmacro with-redefs\n \"binding => var-symbol temp-value-expr\n\n Temporarily redefines Vars while executing the body. The\n temp-value-exprs will be evaluated and each resulting value will\n replace in parallel the root value of its Var. After the body is\n executed, the root values of all the Vars will be set back to their\n old values. These temporary changes will be visible in all threads.\n Useful for mocking out functions during testing.\"\n {:added \"1.3\"}\n [bindings & body]\n `(with-redefs-fn ~(zipmap (map #(list `var %) (take-nth 2 bindings))\n (take-nth 2 (next bindings)))\n (fn [] ~@body)))\n\n(defn realized?\n \"Returns true if a value has been produced for a promise, delay, future or lazy sequence.\"\n {:added \"1.3\"}\n [^clojure.lang.IPending x] (.isRealized x))\n\n(defmacro cond->\n \"Takes an expression and a set of test/form pairs. Threads expr (via ->)\n through each form for which the corresponding test\n expression is true. Note that, unlike cond branching, cond-> threading does\n not short circuit after the first true test expression.\"\n {:added \"1.5\"}\n [expr & clauses]\n (assert (even? (count clauses)))\n (let [g (gensym)\n pstep (fn [[test step]] `(if ~test (-> ~g ~step) ~g))]\n `(let [~g ~expr\n ~@(interleave (repeat g) (map pstep (partition 2 clauses)))]\n ~g)))\n\n(defmacro cond->>\n \"Takes an expression and a set of test/form pairs. Threads expr (via ->>)\n through each form for which the corresponding test expression\n is true. Note that, unlike cond branching, cond->> threading does not short circuit\n after the first true test expression.\"\n {:added \"1.5\"}\n [expr & clauses]\n (assert (even? (count clauses)))\n (let [g (gensym)\n pstep (fn [[test step]] `(if ~test (->> ~g ~step) ~g))]\n `(let [~g ~expr\n ~@(interleave (repeat g) (map pstep (partition 2 clauses)))]\n ~g)))\n\n(defmacro as->\n \"Binds name to expr, evaluates the first form in the lexical context\n of that binding, then binds name to that result, repeating for each\n successive form, returning the result of the last form.\"\n {:added \"1.5\"}\n [expr name & forms]\n `(let [~name ~expr\n ~@(interleave (repeat name) forms)]\n ~name))\n\n(defmacro some->\n \"When expr is not nil, threads it into the first form (via ->),\n and when that result is not nil, through the next etc\"\n {:added \"1.5\"}\n [expr & forms]\n (let [g (gensym)\n pstep (fn [step] `(if (nil? ~g) nil (-> ~g ~step)))]\n `(let [~g ~expr\n ~@(interleave (repeat g) (map pstep forms))]\n ~g)))\n\n(defmacro some->>\n \"When expr is not nil, threads it into the first form (via ->>),\n and when that result is not nil, through the next etc\"\n {:added \"1.5\"}\n [expr & forms]\n (let [g (gensym)\n pstep (fn [step] `(if (nil? ~g) nil (->> ~g ~step)))]\n `(let [~g ~expr\n ~@(interleave (repeat g) (map pstep forms))]\n ~g)))\n\n(defn ^:private preserving-reduced\n [rf]\n #(let [ret (rf %1 %2)]\n (if (reduced? ret)\n (reduced ret)\n ret)))\n\n(defn cat\n \"A transducer which concatenates the contents of each input, which must be a\n collection, into the reduction.\"\n {:added \"1.7\"}\n [rf]\n (let [rrf (preserving-reduced rf)] \n (fn\n ([] (rf))\n ([result] (rf result))\n ([result input]\n (reduce rrf result input)))))\n\n(defn dedupe\n \"Returns a lazy sequence removing consecutive duplicates in coll.\n Returns a transducer when no collection is provided.\"\n {:added \"1.7\"}\n ([]\n (fn [rf]\n (let [pv (volatile! ::none)]\n (fn\n ([] (rf))\n ([result] (rf result))\n ([result input]\n (let [prior @pv]\n (vreset! pv input)\n (if (= prior input)\n result\n (rf result input))))))))\n ([coll] (sequence (dedupe) coll)))\n\n(defn random-sample\n \"Returns items from coll with random probability of prob (0.0 -\n 1.0). Returns a transducer when no collection is provided.\"\n {:added \"1.7\"}\n ([prob]\n (filter (fn [_] (< (rand) prob))))\n ([prob coll]\n (filter (fn [_] (< (rand) prob)) coll)))\n\n(deftype Eduction [xform coll]\n Iterable\n (iterator [_]\n (clojure.lang.TransformerIterator/create xform (clojure.lang.RT/iter coll)))\n\n clojure.lang.IReduceInit\n (reduce [_ f init]\n ;; NB (completing f) isolates completion of inner rf from outer rf\n (transduce xform (completing f) init coll))\n\n clojure.lang.Sequential)\n\n(defn eduction\n \"Returns a reducible/iterable application of the transducers\n to the items in coll. Transducers are applied in order as if\n combined with comp. Note that these applications will be\n performed every time reduce/iterator is called.\"\n {:arglists '([xform* coll])\n :added \"1.7\"}\n [& xforms]\n (Eduction. (apply comp (butlast xforms)) (last xforms)))\n\n(defmethod print-method Eduction [c, ^Writer w]\n (if *print-readably*\n (do\n (print-sequential \"(\" pr-on \" \" \")\" c w))\n (print-object c w)))\n\n(defn run!\n \"Runs the supplied procedure (via reduce), for purposes of side\n effects, on successive items in the collection. Returns nil\"\n {:added \"1.7\"}\n [proc coll]\n (reduce #(proc %2) nil coll))\n\n\n(defn tagged-literal?\n \"Return true if the value is the data representation of a tagged literal\"\n {:added \"1.7\"}\n [value]\n (instance? clojure.lang.TaggedLiteral value))\n\n(defn tagged-literal\n \"Construct a data representation of a tagged literal from a\n tag symbol and a form.\"\n {:added \"1.7\"}\n [^clojure.lang.Symbol tag form]\n (clojure.lang.TaggedLiteral/create tag form))\n\n(defn reader-conditional?\n \"Return true if the value is the data representation of a reader conditional\"\n {:added \"1.7\"}\n [value]\n (instance? clojure.lang.ReaderConditional value))\n\n(defn reader-conditional\n \"Construct a data representation of a reader conditional.\n If true, splicing? indicates read-cond-splicing.\"\n {:added \"1.7\"}\n [form ^Boolean splicing?]\n (clojure.lang.ReaderConditional/create form splicing?))\n\n\n\n\n;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;; data readers ;;;;;;;;;;;;;;;;;;\n\n(def ^{:added \"1.4\"} default-data-readers\n \"Default map of data reader functions provided by Clojure. May be\n overridden by binding *data-readers*.\"\n {'inst #'clojure.instant/read-instant-date\n 'uuid #'clojure.uuid/default-uuid-reader})\n\n(def ^{:added \"1.4\" :dynamic true} *data-readers*\n \"Map from reader tag symbols to data reader Vars.\n\n When Clojure starts, it searches for files named 'data_readers.clj'\n at the root of the classpath. Each such file must contain a literal\n map of symbols, like this:\n\n {foo/bar my.project.foo/bar\n foo/baz my.project/baz}\n\n The first symbol in each pair is a tag that will be recognized by\n the Clojure reader. The second symbol in the pair is the\n fully-qualified name of a Var which will be invoked by the reader to\n parse the form following the tag. For example, given the\n data_readers.clj file above, the Clojure reader would parse this\n form:\n\n #foo/bar [1 2 3]\n\n by invoking the Var #'my.project.foo/bar on the vector [1 2 3]. The\n data reader function is invoked on the form AFTER it has been read\n as a normal Clojure data structure by the reader.\n\n Reader tags without namespace qualifiers are reserved for\n Clojure. Default reader tags are defined in\n clojure.core/default-data-readers but may be overridden in\n data_readers.clj or by rebinding this Var.\"\n {})\n\n(def ^{:added \"1.5\" :dynamic true} *default-data-reader-fn*\n \"When no data reader is found for a tag and *default-data-reader-fn*\n is non-nil, it will be called with two arguments,\n the tag and the value. If *default-data-reader-fn* is nil (the\n default), an exception will be thrown for the unknown tag.\"\n nil)\n\n;(defn- data-reader-urls []\n; (enumeration-seq\n; (.getResources (ClassLoader/getSystemClassLoader) \"data_readers.clj\")))\n\n;(defn- data-reader-var [sym]\n; (intern (create-ns (symbol (namespace sym)))\n; (symbol (name sym))))\n\n;(defn- load-data-reader-file [mappings ^java.net.URL url]\n; (with-open [rdr (clojure.lang.LineNumberingPushbackReader.\n; (java.io.InputStreamReader.\n; (.openStream url) \"UTF-8\"))]\n; (binding [*file* (.getFile url)]\n; (let [new-mappings (read rdr false nil)]\n; (when (not (map? new-mappings))\n; (throw (ex-info (str \"Not a valid data-reader map\")\n; {:url url})))\n; (reduce\n; (fn [m [k v]]\n; (when (not (symbol? k))\n; (throw (ex-info (str \"Invalid form in data-reader file\")\n; {:url url\n; :form k})))\n; (let [v-var (data-reader-var v)]\n; (when (and (contains? mappings k)\n; (not= (mappings k) v-var))\n; (throw (ex-info \"Conflicting data-reader mapping\"\n; {:url url\n; :conflict k\n; :mappings m})))\n; (assoc m k v-var)))\n; mappings\n; new-mappings)))))\n\n;(defn- load-data-readers []\n; (alter-var-root #'*data-readers*\n; (fn [mappings]\n; (reduce load-data-reader-file\n; mappings (data-reader-urls)))))\n\n;(try\n; (load-data-readers)\n; (catch Throwable t\n; (.printStackTrace t)\n; (throw t)))\n\n(load \"core_objc\")\n" }, { "path": "src/clj/clojure/core_deftype.clj", "content": "; Copyright (c) Rich Hickey. All rights reserved.\n; The use and distribution terms for this software are covered by the\n; Eclipse Public License 1.0 (http://opensource.org/licenses/eclipse-1.0.php)\n; which can be found in the file epl-v10.html at the root of this distribution.\n; By using this software in any fashion, you are agreeing to be bound by\n; the terms of this license.\n; You must not remove this notice, or any other, from this software.\n\n(in-ns 'clojure.core)\n\n;;;;;;;;;;;;;;;;;;;;;;;;;;;; definterface ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\n(defn namespace-munge\n \"Convert a Clojure namespace name to a legal Java package name.\"\n {:added \"1.2\"}\n [ns]\n (.replace (str ns) \\- \\_))\n\n;for now, built on gen-interface\n(defmacro definterface\n \"Creates a new Java interface with the given name and method sigs.\n The method return types and parameter types may be specified with type hints,\n defaulting to Object if omitted.\n\n (definterface MyInterface\n (^int method1 [x])\n (^Bar method2 [^Baz b ^Quux q]))\"\n {:added \"1.2\"} ;; Present since 1.2, but made public in 1.5.\n [name & sigs]\n (let [tag (fn [x] (or (:tag (meta x)) Object))\n psig (fn [[name [& args]]]\n (vector name (vec (map tag args)) (tag name) (map meta args)))\n cname (with-meta (symbol (str (namespace-munge *ns*) \".\" (namespace-munge name))) (meta name))]\n `(do\n (gen-interface :name ~cname :methods ~(vec (map psig sigs)))\n (import ~cname))))\n\n;;;;;;;;;;;;;;;;;;;;;;;;;;;; reify/deftype ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\n\n(defn- parse-opts [s]\n (loop [opts {} [k v & rs :as s] s]\n (if (keyword? k)\n (recur (assoc opts k v) rs)\n [opts s])))\n\n(defn- parse-impls [specs]\n (loop [ret {} s specs]\n (if (seq s)\n (recur (assoc ret (first s) (take-while seq? (next s)))\n (drop-while seq? (next s)))\n ret)))\n\n(defn- parse-opts+specs [opts+specs]\n (let [[opts specs] (parse-opts opts+specs)\n impls (parse-impls specs)\n interfaces (-> (map #(if (var? (resolve %))\n (:on (deref (resolve %)))\n %)\n (keys impls))\n set\n (disj 'Object 'java.lang.Object)\n vec)\n methods (map (fn [[name params & body]]\n (cons name (maybe-destructured params body)))\n (apply concat (vals impls)))]\n (when-let [bad-opts (seq (remove #{:no-print} (keys opts)))]\n (throw (IllegalArgumentException. ^String (apply print-str \"Unsupported option(s) -\" bad-opts))))\n [interfaces methods opts]))\n\n(defmacro reify\n \"reify is a macro with the following structure:\n\n (reify options* specs*)\n\n Currently there are no options.\n\n Each spec consists of the protocol or interface name followed by zero\n or more method bodies:\n\n protocol-or-interface-or-Object\n (methodName [args+] body)*\n\n Methods should be supplied for all methods of the desired\n protocol(s) and interface(s). You can also define overrides for\n methods of Object. Note that the first parameter must be supplied to\n correspond to the target object ('this' in Java parlance). Thus\n methods for interfaces will take one more argument than do the\n interface declarations. Note also that recur calls to the method\n head should *not* pass the target object, it will be supplied\n automatically and can not be substituted.\n\n The return type can be indicated by a type hint on the method name,\n and arg types can be indicated by a type hint on arg names. If you\n leave out all hints, reify will try to match on same name/arity\n method in the protocol(s)/interface(s) - this is preferred. If you\n supply any hints at all, no inference is done, so all hints (or\n default of Object) must be correct, for both arguments and return\n type. If a method is overloaded in a protocol/interface, multiple\n independent method definitions must be supplied. If overloaded with\n same arity in an interface you must specify complete hints to\n disambiguate - a missing hint implies Object.\n\n recur works to method heads The method bodies of reify are lexical\n closures, and can refer to the surrounding local scope:\n\n (str (let [f \\\"foo\\\"]\n (reify Object\n (toString [this] f))))\n == \\\"foo\\\"\n\n (seq (let [f \\\"foo\\\"]\n (reify clojure.lang.Seqable\n (seq [this] (seq f)))))\n == (\\\\f \\\\o \\\\o))\n\n reify always implements clojure.lang.IObj and transfers meta\n data of the form to the created object.\n\n (meta ^{:k :v} (reify Object (toString [this] \\\"foo\\\")))\n == {:k :v}\"\n {:added \"1.2\"}\n [& opts+specs]\n (let [[interfaces methods] (parse-opts+specs opts+specs)]\n (with-meta `(reify* ~interfaces ~@methods) (meta &form))))\n\n(defn hash-combine [x y]\n (clojure.lang.Util/hashCombine x (clojure.lang.Util/hash y)))\n\n(defn munge [s]\n ((if (symbol? s) symbol str) (clojure.lang.Compiler/munge (str s))))\n\n(defn- imap-cons\n [^IPersistentMap this o]\n (cond\n (instance? java.util.Map$Entry o)\n (let [^java.util.Map$Entry pair o]\n (.assoc this (.getKey pair) (.getValue pair)))\n (instance? clojure.lang.IPersistentVector o)\n (let [^clojure.lang.IPersistentVector vec o]\n (.assoc this (.nth vec 0) (.nth vec 1)))\n :else (loop [this this\n o o]\n (if (seq o)\n (let [^java.util.Map$Entry pair (first o)]\n (recur (.assoc this (.getKey pair) (.getValue pair)) (rest o)))\n this))))\n\n(defn- emit-defrecord\n \"Do not use this directly - use defrecord\"\n {:added \"1.2\"}\n [tagname name fields interfaces methods]\n (let [classname (with-meta (symbol (str (namespace-munge *ns*) \".\" (namespace-munge name))) (meta name))\n interfaces (vec interfaces)\n interface-set (set (map resolve interfaces))\n methodname-set (set (map first methods))\n hinted-fields fields\n fields (vec (map #(with-meta % nil) fields))\n base-fields fields\n fields (conj fields '__meta '__extmap)\n type-hash (hash classname)]\n (when (some #{:volatile-mutable :unsynchronized-mutable} (mapcat (comp keys meta) hinted-fields))\n (throw (IllegalArgumentException. \":volatile-mutable or :unsynchronized-mutable not supported for record fields\")))\n (let [gs (gensym)]\n (letfn \n [(irecord [[i m]]\n [(conj i 'clojure.lang.IRecord)\n m])\n (eqhash [[i m]] \n [(conj i 'clojure.lang.IHashEq)\n (conj m\n `(hasheq [this#] (bit-xor ~type-hash (clojure.lang.APersistentMap/mapHasheq this#)))\n `(hashCode [this#] (clojure.lang.APersistentMap/mapHash this#))\n `(equals [this# ~gs] (clojure.lang.APersistentMap/mapEquals this# ~gs)))])\n (iobj [[i m]] \n [(conj i 'clojure.lang.IObj)\n (conj m `(meta [this#] ~'__meta)\n `(withMeta [this# ~gs] (new ~tagname ~@(replace {'__meta gs} fields))))])\n (ilookup [[i m]] \n [(conj i 'clojure.lang.ILookup 'clojure.lang.IKeywordLookup)\n (conj m `(valAt [this# k#] (.valAt this# k# nil))\n `(valAt [this# k# else#] \n (case k# ~@(mapcat (fn [fld] [(keyword fld) fld]) \n base-fields)\n (get ~'__extmap k# else#)))\n `(getLookupThunk [this# k#]\n (let [~'gclass (class this#)] \n (case k#\n ~@(let [hinted-target (with-meta 'gtarget {:tag tagname})] \n (mapcat \n (fn [fld]\n [(keyword fld)\n `(reify clojure.lang.ILookupThunk\n (get [~'thunk ~'gtarget]\n (if (identical? (class ~'gtarget) ~'gclass)\n (. ~hinted-target ~(symbol (str \"-\" fld)))\n ~'thunk)))])\n base-fields))\n nil))))])\n (imap [[i m]] \n [(conj i 'clojure.lang.IPersistentMap)\n (conj m \n `(count [this#] (+ ~(count base-fields) (count ~'__extmap)))\n `(empty [this#] (throw (UnsupportedOperationException. (str \"Can't create empty: \" ~(str classname)))))\n `(cons [this# e#] ((var imap-cons) this# e#))\n `(equiv [this# ~gs] \n (boolean \n (or (identical? this# ~gs)\n (when (identical? (class this#) (class ~gs))\n (let [~gs ~(with-meta gs {:tag tagname})]\n (and ~@(map (fn [fld] `(= ~fld (. ~gs ~(symbol (str \"-\" fld))))) base-fields)\n (= ~'__extmap (. ~gs ~'__extmap))))))))\n `(containsKey [this# k#] (not (identical? this# (.valAt this# k# this#))))\n `(entryAt [this# k#] (let [v# (.valAt this# k# this#)]\n (when-not (identical? this# v#)\n (clojure.lang.MapEntry. k# v#))))\n `(seq [this#] (seq (concat [~@(map #(list `new `clojure.lang.MapEntry (keyword %) %) base-fields)] \n ~'__extmap)))\n `(iterator [~gs]\n (clojure.lang.RecordIterator. ~gs [~@(map keyword base-fields)] (RT/iter ~'__extmap)))\n `(assoc [this# k# ~gs]\n (condp identical? k#\n ~@(mapcat (fn [fld]\n [(keyword fld) (list* `new tagname (replace {fld gs} fields))])\n base-fields)\n (new ~tagname ~@(remove #{'__extmap} fields) (assoc ~'__extmap k# ~gs))))\n `(without [this# k#] (if (contains? #{~@(map keyword base-fields)} k#)\n (dissoc (with-meta (into {} this#) ~'__meta) k#)\n (new ~tagname ~@(remove #{'__extmap} fields) \n (not-empty (dissoc ~'__extmap k#))))))])\n (ijavamap [[i m]]\n [(conj i 'java.util.Map 'java.io.Serializable)\n (conj m\n `(size [this#] (.count this#))\n `(isEmpty [this#] (= 0 (.count this#)))\n `(containsValue [this# v#] (boolean (some #{v#} (vals this#))))\n `(get [this# k#] (.valAt this# k#))\n `(put [this# k# v#] (throw (UnsupportedOperationException.)))\n `(remove [this# k#] (throw (UnsupportedOperationException.)))\n `(putAll [this# m#] (throw (UnsupportedOperationException.)))\n `(clear [this#] (throw (UnsupportedOperationException.)))\n `(keySet [this#] (set (keys this#)))\n `(values [this#] (vals this#))\n `(entrySet [this#] (set this#)))])\n ]\n (let [[i m] (-> [interfaces methods] irecord eqhash iobj ilookup imap ijavamap)]\n `(deftype* ~tagname ~classname ~(conj hinted-fields '__meta '__extmap) \n :implements ~(vec i) \n ~@m))))))\n\n(defn- build-positional-factory\n \"Used to build a positional factory for a given type/record. Because of the\n limitation of 20 arguments to Clojure functions, this factory needs to be\n constructed to deal with more arguments. It does this by building a straight\n forward type/record ctor call in the <=20 case, and a call to the same\n ctor pulling the extra args out of the & overage parameter. Finally, the\n arity is constrained to the number of expected fields and an ArityException\n will be thrown at runtime if the actual arg count does not match.\"\n [nom classname fields]\n (let [fn-name (symbol (str '-> nom))\n [field-args over] (split-at 20 fields)\n field-count (count fields)\n arg-count (count field-args)\n over-count (count over)\n docstring (str \"Positional factory function for class \" classname \".\")]\n `(defn ~fn-name\n ~docstring\n [~@field-args ~@(if (seq over) '[& overage] [])]\n ~(if (seq over)\n `(if (= (count ~'overage) ~over-count)\n (new ~classname\n ~@field-args\n ~@(for [i (range 0 (count over))]\n (list `nth 'overage i)))\n (throw (clojure.lang.ArityException. (+ ~arg-count (count ~'overage)) (name '~fn-name))))\n `(new ~classname ~@field-args)))))\n\n(defn- validate-fields\n \"\"\n [fields name]\n (when-not (vector? fields)\n (throw (AssertionError. \"No fields vector given.\")))\n (let [specials #{'__meta '__extmap}]\n (when (some specials fields)\n (throw (AssertionError. (str \"The names in \" specials \" cannot be used as field names for types or records.\")))))\n (let [non-syms (remove symbol? fields)]\n (when (seq non-syms)\n (throw (clojure.lang.Compiler$CompilerException.\n *file*\n (.deref clojure.lang.Compiler/LINE)\n (.deref clojure.lang.Compiler/COLUMN)\n (AssertionError.\n (str \"defrecord and deftype fields must be symbols, \"\n *ns* \".\" name \" had: \"\n (apply str (interpose \", \" non-syms)))))))))\n\n(defmacro defrecord\n \"(defrecord name [fields*] options* specs*)\n\n Currently there are no options.\n\n Each spec consists of a protocol or interface name followed by zero\n or more method bodies:\n\n protocol-or-interface-or-Object\n (methodName [args*] body)*\n\n Dynamically generates compiled bytecode for class with the given\n name, in a package with the same name as the current namespace, the\n given fields, and, optionally, methods for protocols and/or\n interfaces.\n\n The class will have the (immutable) fields named by\n fields, which can have type hints. Protocols/interfaces and methods\n are optional. The only methods that can be supplied are those\n declared in the protocols/interfaces. Note that method bodies are\n not closures, the local environment includes only the named fields,\n and those fields can be accessed directly.\n\n Method definitions take the form:\n\n (methodname [args*] body)\n\n The argument and return types can be hinted on the arg and\n methodname symbols. If not supplied, they will be inferred, so type\n hints should be reserved for disambiguation.\n\n Methods should be supplied for all methods of the desired\n protocol(s) and interface(s). You can also define overrides for\n methods of Object. Note that a parameter must be supplied to\n correspond to the target object ('this' in Java parlance). Thus\n methods for interfaces will take one more argument than do the\n interface declarations. Note also that recur calls to the method\n head should *not* pass the target object, it will be supplied\n automatically and can not be substituted.\n\n In the method bodies, the (unqualified) name can be used to name the\n class (for calls to new, instance? etc).\n\n The class will have implementations of several (clojure.lang)\n interfaces generated automatically: IObj (metadata support) and\n IPersistentMap, and all of their superinterfaces.\n\n In addition, defrecord will define type-and-value-based =,\n and will defined Java .hashCode and .equals consistent with the\n contract for java.util.Map.\n\n When AOT compiling, generates compiled bytecode for a class with the\n given name (a symbol), prepends the current ns as the package, and\n writes the .class file to the *compile-path* directory.\n\n Two constructors will be defined, one taking the designated fields\n followed by a metadata map (nil for none) and an extension field\n map (nil for none), and one taking only the fields (using nil for\n meta and extension fields). Note that the field names __meta\n and __extmap are currently reserved and should not be used when\n defining your own records.\n\n Given (defrecord TypeName ...), two factory functions will be\n defined: ->TypeName, taking positional parameters for the fields,\n and map->TypeName, taking a map of keywords to field values.\"\n {:added \"1.2\"\n :arglists '([name [& fields] & opts+specs])}\n\n [name fields & opts+specs]\n (validate-fields fields name)\n (let [gname (namespace-munge name)\n [interfaces methods opts] (parse-opts+specs opts+specs)\n ns-part (namespace-munge *ns*)\n classname (symbol (str ns-part \".\" gname))\n hinted-fields fields\n fields (vec (map #(with-meta % nil) fields))]\n `(do\n (declare ~(symbol (str '-> gname)))\n (declare ~(symbol (str 'map-> gname)))\n ~(emit-defrecord name gname (vec hinted-fields) (vec interfaces) methods)\n (import ~classname)\n ~(build-positional-factory gname classname fields)\n (defn ~(symbol (str 'map-> gname))\n ~(str \"Factory function for class \" classname \", taking a map of keywords to field values.\")\n ([m#] (~(symbol (str classname \"/create\"))\n (if (instance? clojure.lang.MapEquivalence m#) m# (into {} m#)))))\n ~classname)))\n\n(defn record?\n \"Returns true if x is a record\"\n {:added \"1.6\"\n :static true}\n [x]\n (instance? clojure.lang.IRecord x))\n\n(defn- emit-deftype*\n \"Do not use this directly - use deftype\"\n [tagname name fields interfaces methods]\n (let [classname (with-meta (symbol (str (namespace-munge *ns*) \".\" (namespace-munge name))) (meta name))\n interfaces (conj interfaces 'clojure.lang.IType)]\n `(deftype* ~tagname ~classname ~fields\n :implements ~interfaces\n ~@methods)))\n\n(defmacro deftype\n \"(deftype name [fields*] options* specs*)\n\n Currently there are no options.\n\n Each spec consists of a protocol or interface name followed by zero\n or more method bodies:\n\n protocol-or-interface-or-Object\n (methodName [args*] body)*\n\n Dynamically generates compiled bytecode for class with the given\n name, in a package with the same name as the current namespace, the\n given fields, and, optionally, methods for protocols and/or\n interfaces.\n\n The class will have the (by default, immutable) fields named by\n fields, which can have type hints. Protocols/interfaces and methods\n are optional. The only methods that can be supplied are those\n declared in the protocols/interfaces. Note that method bodies are\n not closures, the local environment includes only the named fields,\n and those fields can be accessed directly. Fields can be qualified\n with the metadata :volatile-mutable true or :unsynchronized-mutable\n true, at which point (set! afield aval) will be supported in method\n bodies. Note well that mutable fields are extremely difficult to use\n correctly, and are present only to facilitate the building of higher\n level constructs, such as Clojure's reference types, in Clojure\n itself. They are for experts only - if the semantics and\n implications of :volatile-mutable or :unsynchronized-mutable are not\n immediately apparent to you, you should not be using them.\n\n Method definitions take the form:\n\n (methodname [args*] body)\n\n The argument and return types can be hinted on the arg and\n methodname symbols. If not supplied, they will be inferred, so type\n hints should be reserved for disambiguation.\n\n Methods should be supplied for all methods of the desired\n protocol(s) and interface(s). You can also define overrides for\n methods of Object. Note that a parameter must be supplied to\n correspond to the target object ('this' in Java parlance). Thus\n methods for interfaces will take one more argument than do the\n interface declarations. Note also that recur calls to the method\n head should *not* pass the target object, it will be supplied\n automatically and can not be substituted.\n\n In the method bodies, the (unqualified) name can be used to name the\n class (for calls to new, instance? etc).\n\n When AOT compiling, generates compiled bytecode for a class with the\n given name (a symbol), prepends the current ns as the package, and\n writes the .class file to the *compile-path* directory.\n\n One constructor will be defined, taking the designated fields. Note\n that the field names __meta and __extmap are currently reserved and\n should not be used when defining your own types.\n\n Given (deftype TypeName ...), a factory function called ->TypeName\n will be defined, taking positional parameters for the fields\"\n {:added \"1.2\"\n :arglists '([name [& fields] & opts+specs])}\n\n [name fields & opts+specs]\n (validate-fields fields name)\n (let [gname (namespace-munge name)\n [interfaces methods opts] (parse-opts+specs opts+specs)\n ns-part (namespace-munge *ns*)\n classname (symbol (str ns-part \".\" gname))\n hinted-fields fields\n fields (vec (map #(with-meta % nil) fields))\n [field-args over] (split-at 20 fields)]\n `(do\n ~(emit-deftype* name gname (vec hinted-fields) (vec interfaces) methods)\n (import ~classname)\n ~(build-positional-factory gname classname fields)\n ~classname)))\n\n;;;;;;;;;;;;;;;;;;;;;;; protocols ;;;;;;;;;;;;;;;;;;;;;;;;\n\n(defn- expand-method-impl-cache [^clojure.lang.MethodImplCache cache c f]\n (if (.map cache)\n (let [cs (assoc (.map cache) c (clojure.lang.MethodImplCache$Entry. c f))]\n (clojure.lang.MethodImplCache. (.protocol cache) (.methodk cache) cs))\n (let [cs (into1 {} (remove (fn [[c e]] (nil? e)) (map vec (partition 2 (.table cache)))))\n cs (assoc cs c (clojure.lang.MethodImplCache$Entry. c f))]\n (if-let [[shift mask] (maybe-min-hash (map hash (keys cs)))]\n (let [table (make-array Object (* 2 (inc mask)))\n table (reduce1 (fn [^objects t [c e]]\n (let [i (* 2 (int (shift-mask shift mask (hash c))))]\n (aset t i c)\n (aset t (inc i) e)\n t))\n table cs)]\n (clojure.lang.MethodImplCache. (.protocol cache) (.methodk cache) shift mask table))\n (clojure.lang.MethodImplCache. (.protocol cache) (.methodk cache) cs)))))\n\n(defn- super-chain [^Class c]\n (when c\n (cons c (super-chain (.getSuperclass c)))))\n\n(defn- pref\n ([] nil)\n ([a] a)\n ([^Class a ^Class b]\n (if (.isAssignableFrom a b) b a)))\n\n(defn find-protocol-impl [protocol x]\n (if (instance? (:on-interface protocol) x)\n x\n (let [c (class x)\n impl #(get (:impls protocol) %)]\n (or (impl c)\n (and c (or (first (remove nil? (map impl (butlast (super-chain c)))))\n (when-let [t (reduce1 pref (filter impl (disj (supers c) Object)))]\n (impl t))\n (impl Object)))))))\n\n(defn find-protocol-method [protocol methodk x]\n (get (find-protocol-impl protocol x) methodk))\n\n(defn- protocol?\n [maybe-p]\n (boolean (:on-interface maybe-p)))\n\n(defn- implements? [protocol atype]\n (and atype (.isAssignableFrom ^Class (:on-interface protocol) atype)))\n\n(defn extends?\n \"Returns true if atype extends protocol\"\n {:added \"1.2\"}\n [protocol atype]\n (boolean (or (implements? protocol atype)\n (get (:impls protocol) atype))))\n\n(defn extenders\n \"Returns a collection of the types explicitly extending protocol\"\n {:added \"1.2\"}\n [protocol]\n (keys (:impls protocol)))\n\n(defn satisfies?\n \"Returns true if x satisfies the protocol\"\n {:added \"1.2\"}\n [protocol x]\n (boolean (find-protocol-impl protocol x)))\n\n(defn -cache-protocol-fn [^clojure.lang.AFunction pf x ^Class c ^clojure.lang.IFn interf]\n (let [cache (.__methodImplCache pf)\n f (if (.isInstance c x)\n interf\n (find-protocol-method (.protocol cache) (.methodk cache) x))]\n (when-not f\n (throw (IllegalArgumentException. (str \"No implementation of method: \" (.methodk cache)\n \" of protocol: \" (:var (.protocol cache))\n \" found for class: \" (if (nil? x) \"nil\" (.getName (class x)))))))\n (set! (.__methodImplCache pf) (expand-method-impl-cache cache (class x) f))\n f))\n\n(defn- emit-method-builder [on-interface method on-method arglists]\n (let [methodk (keyword method)\n gthis (with-meta (gensym) {:tag 'clojure.lang.AFunction})\n ginterf (gensym)]\n `(fn [cache#]\n (let [~ginterf\n (fn\n ~@(map\n (fn [args]\n (let [gargs (map #(gensym (str \"gf__\" % \"__\")) args)\n target (first gargs)]\n `([~@gargs]\n (. ~(with-meta target {:tag on-interface}) (~(or on-method method) ~@(rest gargs))))))\n arglists))\n ^clojure.lang.AFunction f#\n (fn ~gthis\n ~@(map\n (fn [args]\n (let [gargs (map #(gensym (str \"gf__\" % \"__\")) args)\n target (first gargs)]\n `([~@gargs]\n (let [cache# (.__methodImplCache ~gthis)\n f# (.fnFor cache# (clojure.lang.Util/classOf ~target))]\n (if f#\n (f# ~@gargs)\n ((-cache-protocol-fn ~gthis ~target ~on-interface ~ginterf) ~@gargs))))))\n arglists))]\n (set! (.__methodImplCache f#) cache#)\n f#))))\n\n(defn -reset-methods [protocol]\n (doseq [[^clojure.lang.Var v build] (:method-builders protocol)]\n (let [cache (clojure.lang.MethodImplCache. protocol (keyword (.sym v)))]\n (.bindRoot v (build cache)))))\n\n(defn- assert-same-protocol [protocol-var method-syms]\n (doseq [m method-syms]\n (let [^clojure.lang.Var v (resolve m)\n ^clojure.lang.Var p (:protocol (meta v))]\n (when (and v (bound? v) (not= protocol-var p))\n (binding [*out* *err*]\n (println \"Warning: protocol\" protocol-var \"is overwriting\"\n (if p\n (str \"method \" (.sym v) \" of protocol \" (.sym p))\n (str \"function \" (.sym v)))))))))\n\n(defn- emit-protocol [name opts+sigs]\n (let [iname (symbol (str (munge (namespace-munge *ns*)) \".\" (munge (namespace-munge name))))\n [opts sigs]\n (loop [opts {:on (list 'quote iname) :on-interface iname} sigs opts+sigs]\n (condp #(%1 %2) (first sigs)\n string? (recur (assoc opts :doc (first sigs)) (next sigs))\n keyword? (recur (assoc opts (first sigs) (second sigs)) (nnext sigs))\n [opts sigs]))\n sigs (when sigs\n (reduce1 (fn [m s]\n (let [name-meta (meta (first s))\n mname (with-meta (first s) nil)\n [arglists doc]\n (loop [as [] rs (rest s)]\n (if (vector? (first rs))\n (recur (conj as (first rs)) (next rs))\n [(seq as) (first rs)]))]\n (when (some #{0} (map count arglists))\n (throw (IllegalArgumentException. (str \"Definition of function \" mname \" in protocol \" name \" must take at least one arg.\"))))\n (when (m (keyword mname))\n (throw (IllegalArgumentException. (str \"Function \" mname \" in protocol \" name \" was redefined. Specify all arities in single definition.\"))))\n (assoc m (keyword mname)\n (merge name-meta\n {:name (vary-meta mname assoc :doc doc :arglists arglists)\n :arglists arglists\n :doc doc}))))\n {} sigs))\n meths (mapcat (fn [sig]\n (let [m (munge (:name sig))]\n (map #(vector m (vec (repeat (dec (count %))'Object)) 'Object)\n (:arglists sig))))\n (vals sigs))]\n `(do\n (defonce ~name {})\n (gen-interface :name ~iname :methods ~meths)\n (alter-meta! (var ~name) assoc :doc ~(:doc opts))\n ~(when sigs\n `(#'assert-same-protocol (var ~name) '~(map :name (vals sigs))))\n (alter-var-root (var ~name) merge\n (assoc ~opts\n :sigs '~sigs\n :var (var ~name)\n :method-map\n ~(and (:on opts)\n (apply hash-map\n (mapcat\n (fn [s]\n [(keyword (:name s)) (keyword (or (:on s) (:name s)))])\n (vals sigs))))\n :method-builders\n ~(apply hash-map\n (mapcat\n (fn [s]\n [`(intern *ns* (with-meta '~(:name s) (merge '~s {:protocol (var ~name)})))\n (emit-method-builder (:on-interface opts) (:name s) (:on s) (:arglists s))])\n (vals sigs)))))\n (-reset-methods ~name)\n '~name)))\n\n(defmacro defprotocol\n \"A protocol is a named set of named methods and their signatures:\n (defprotocol AProtocolName\n\n ;optional doc string\n \\\"A doc string for AProtocol abstraction\\\"\n\n ;method signatures\n (bar [this a b] \\\"bar docs\\\")\n (baz [this a] [this a b] [this a b c] \\\"baz docs\\\"))\n\n No implementations are provided. Docs can be specified for the\n protocol overall and for each method. The above yields a set of\n polymorphic functions and a protocol object. All are\n namespace-qualified by the ns enclosing the definition The resulting\n functions dispatch on the type of their first argument, which is\n required and corresponds to the implicit target object ('this' in\n Java parlance). defprotocol is dynamic, has no special compile-time\n effect, and defines no new types or classes. Implementations of\n the protocol methods can be provided using extend.\n\n defprotocol will automatically generate a corresponding interface,\n with the same name as the protocol, i.e. given a protocol:\n my.ns/Protocol, an interface: my.ns.Protocol. The interface will\n have methods corresponding to the protocol functions, and the\n protocol will automatically work with instances of the interface.\n\n Note that you should not use this interface with deftype or\n reify, as they support the protocol directly:\n\n (defprotocol P\n (foo [this])\n (bar-me [this] [this y]))\n\n (deftype Foo [a b c]\n P\n (foo [this] a)\n (bar-me [this] b)\n (bar-me [this y] (+ c y)))\n\n (bar-me (Foo. 1 2 3) 42)\n => 45\n\n (foo\n (let [x 42]\n (reify P\n (foo [this] 17)\n (bar-me [this] x)\n (bar-me [this y] x))))\n => 17\"\n {:added \"1.2\"}\n [name & opts+sigs]\n (emit-protocol name opts+sigs))\n\n(defn- emit-impl [[p fs]]\n [p (zipmap (map #(-> % first keyword) fs)\n (map #(cons `fn (drop 1 %)) fs))])\n\n(defn- emit-hinted-impl [c [p fs]]\n (let [hint (fn [specs]\n (let [specs (if (vector? (first specs))\n (list specs)\n specs)]\n (map (fn [[[target & args] & body]]\n (cons (apply vector (vary-meta target assoc :tag c) args)\n body))\n specs)))]\n [p (zipmap (map #(-> % first name keyword) fs)\n (map #(cons `fn (hint (drop 1 %))) fs))]))\n\n(defn- emit-extend-type [c specs]\n (let [impls (parse-impls specs)]\n `(extend ~c\n ~@(mapcat (partial emit-hinted-impl c) impls))))\n\n(defmacro extend-type\n \"A macro that expands into an extend call. Useful when you are\n supplying the definitions explicitly inline, extend-type\n automatically creates the maps required by extend. Propagates the\n class as a type hint on the first argument of all fns.\n\n (extend-type MyType\n Countable\n (cnt [c] ...)\n Foo\n (bar [x y] ...)\n (baz ([x] ...) ([x y & zs] ...)))\n\n expands into:\n\n (extend MyType\n Countable\n {:cnt (fn [c] ...)}\n Foo\n {:baz (fn ([x] ...) ([x y & zs] ...))\n :bar (fn [x y] ...)})\"\n {:added \"1.2\"}\n [t & specs]\n (emit-extend-type t specs))\n\n(defn- emit-extend-protocol [p specs]\n (let [impls (parse-impls specs)]\n `(do\n ~@(map (fn [[t fs]]\n `(extend-type ~t ~p ~@fs))\n impls))))\n\n(defmacro extend-protocol\n \"Useful when you want to provide several implementations of the same\n protocol all at once. Takes a single protocol and the implementation\n of that protocol for one or more types. Expands into calls to\n extend-type:\n\n (extend-protocol Protocol\n AType\n (foo [x] ...)\n (bar [x y] ...)\n BType\n (foo [x] ...)\n (bar [x y] ...)\n AClass\n (foo [x] ...)\n (bar [x y] ...)\n nil\n (foo [x] ...)\n (bar [x y] ...))\n\n expands into:\n\n (do\n (clojure.core/extend-type AType Protocol\n (foo [x] ...)\n (bar [x y] ...))\n (clojure.core/extend-type BType Protocol\n (foo [x] ...)\n (bar [x y] ...))\n (clojure.core/extend-type AClass Protocol\n (foo [x] ...)\n (bar [x y] ...))\n (clojure.core/extend-type nil Protocol\n (foo [x] ...)\n (bar [x y] ...)))\"\n {:added \"1.2\"}\n\n [p & specs]\n (emit-extend-protocol p specs))\n\n(defn extend\n \"Implementations of protocol methods can be provided using the extend construct:\n\n (extend AType\n AProtocol\n {:foo an-existing-fn\n :bar (fn [a b] ...)\n :baz (fn ([a]...) ([a b] ...)...)}\n BProtocol\n {...}\n ...)\n\n extend takes a type/class (or interface, see below), and one or more\n protocol + method map pairs. It will extend the polymorphism of the\n protocol's methods to call the supplied methods when an AType is\n provided as the first argument.\n\n Method maps are maps of the keyword-ized method names to ordinary\n fns. This facilitates easy reuse of existing fns and fn maps, for\n code reuse/mixins without derivation or composition. You can extend\n an interface to a protocol. This is primarily to facilitate interop\n with the host (e.g. Java) but opens the door to incidental multiple\n inheritance of implementation since a class can inherit from more\n than one interface, both of which extend the protocol. It is TBD how\n to specify which impl to use. You can extend a protocol on nil.\n\n If you are supplying the definitions explicitly (i.e. not reusing\n exsting functions or mixin maps), you may find it more convenient to\n use the extend-type or extend-protocol macros.\n\n Note that multiple independent extend clauses can exist for the same\n type, not all protocols need be defined in a single extend call.\n\n See also:\n extends?, satisfies?, extenders\"\n {:added \"1.2\"}\n [atype & proto+mmaps]\n (doseq [[proto mmap] (partition 2 proto+mmaps)]\n (when-not (protocol? proto)\n (throw (IllegalArgumentException.\n (str proto \" is not a protocol\"))))\n (when (implements? proto atype)\n (throw (IllegalArgumentException.\n (str atype \" already directly implements \" (:on-interface proto) \" for protocol:\"\n (:var proto)))))\n (-reset-methods (alter-var-root (:var proto) assoc-in [:impls atype] mmap))))\n" }, { "path": "src/clj/clojure/core_objc.clj", "content": "(in-ns 'clojure.core)\n\n(require 'clojure.string)\n\n(def ^:dynamic dispatch-class)\n\n(def ^:dynamic force-main-thread)\n\n(def objc? (clojure.lang.ObjC/objc))\n\n(when-not objc?\n (require '[clojure.walk :as walk]))\n\n(defmacro ^{:added \"1.6\"} dispatch-main\n \"Runs the body with dispatch_sync in the main queue\n\n dispatch_sync(dispatch_get_main_queue(), ^{\n ...\n });\"\n [& body]\n `(clojure.lang.RT/dispatchInMainSync\n (fn [] ~@body)))\n\n(defn ^{:added \"1.6\"} sel\n \"Creates an objc selector.\n\n (sel \\\"some:selector:\\\")\"\n [^String s]\n (clojure.lang.Selector. s))\n\n(defn ^{:added \"1.6\"} objc-class\n \"Lookup an objc class by name.\n\n (objc-class \\\"UIView\\\")\"\n [s]\n (RT/objcClass (name s)))\n\n(defmacro ^{:added \"1.6\"} $\n \"The objc interop macro. Use to lookup a class or to msgSend.\n \n [UIView class] -> ($ UIView)\n [MyObject objectWithString:myString] -> ($ MyObject :objectWithString myString)\n [@\\\"Hello\\\" description] -> ($ \\\"Hello\\\" :description)\n [UIView alloc] -> ($ ($ UIView) :alloc)\n \"\n [& args]\n (let [is-class (= 1 (count args))\n t (first args)]\n (if is-class\n `(objc-class '~t)\n (let [args (vec (next args))\n has-params (even? (count args))\n args (partition 2 (if has-params args (conj args nil)))\n params (mapv second args)\n selector (str (subs (apply str (map first args)) 1) (if has-params \":\" \"\"))]\n (if has-params\n `(clojure.lang.Selector/invokeSelector ~selector ~t ~params)\n `(clojure.lang.Selector/invokeSelector ~selector ~t))))))\n\n(defmacro ^{:added \"1.6\"} $$\n \"Like $ but calls super.\n \n [super initWithFrame:frame] -> ($$ self :initWithFrame frame)\n \"\n [& args]\n (let [t (first args)\n dispatch-class (if (bound? #'dispatch-class) dispatch-class nil)\n args (vec (next args))\n has-params (even? (count args))\n args (if has-params (partition 2 args) args)\n params (if has-params (mapv second args) [])\n selector (if has-params (str (subs (apply str (map first args)) 1) \":\") (name (first args)))]\n `($ ($ NSCommon) :invokeSuperSel ~t :withDispatchClass ~dispatch-class :withSelector ~selector :withArgs ~params)))\n\n(def objc-types\n {:void \\v\n :float \\f\n :longlong \\q\n :long \\l\n :char \\c\n :short \\s\n :int \\i\n :double \\d\n :ulonglong \\Q\n :ulong \\L\n :uchar \\C\n :ushort \\S\n :uint \\I\n :bool \\b\n :cgpoint \\P\n :nsrange \\N\n :uiedge \\E\n :cgsize \\Z\n :cgaffinetransform \\A\n :catransform3d \\T\n :uioffset \\O\n :cgrect \\R\n :id \\p\n :pointer \\Y\n :cgfloat (if ($ ($ NSCommon) :cgfloatIsDouble) \\d \\f)})\n\n(defmethod print-method clojure.lang.RemoteRef\n [^clojure.lang.RemoteRef r, ^java.io.Writer w]\n (.write w (str \"#remote-ref \\\"\" (.getId r) \"\\\"\")))\n\n(defmethod print-method clojure.lang.ObjCClass\n [^clojure.lang.ObjCClass r, ^java.io.Writer w]\n (.write w (str \"#objc-class \\\"\" (.getName r) \"\\\"\")))\n\n(defn ^{:added \"1.6\"} read-remote-ref [id]\n (.get (clojure.lang.RemoteRef. id)))\n\n(defn ^{:added \"1.6\"} read-sel [name]\n (clojure.lang.Selector. name))\n\n(alter-var-root #'*data-readers*\n (fn [m] (merge m {'sel #'read-sel\n 'remote-ref #'read-remote-ref\n 'objc-class #'objc-class})))\n\n(defn ^{:added \"1.6\"} class->types\n \"Lookup a type for a class simple name\"\n [c] \n (case c\n :long :longlong\n :integer :int\n :boolean :bool\n :float :float\n :double :double\n :short :short\n :void :void\n :character :char\n :remoteref :pointer\n (if ($ c :isKindOfClass ($ NSValue))\n (some #(if (= (val %) ($ ($ NSCommon) :signatureToType ($ c :objCType))) (key %)) objc-types)\n :id)))\n\n(defn ^{:added \"1.6\"} types-for-vals [vals]\n (map (comp objc-types class->types keyword clojure.string/lower-case #(.getSimpleName %) class) vals))\n\n(defn ^{:added \"1.6\"} ccall\n \"The c interop. To use a c function you need to register it in using:\n \n #import \\\"NSCommon.h\\\"\n reg_c(CGRectMake); // From now on you can use CGRectMake in ccall\n \n The args are unboxed when necessary and the return is always a boxed value.\n\n fun: the c function name\n types: a vector with the return type followed by the parameters types. Types map: clojure.core/objc-types\n args: the arguments vector\n\n CGRectMake(1, 2, 3, 4) -> (ccall \\\"CGRectMake\\\" [\\\\R \\\\f \\\\f \\\\f \\\\f] [1 2 3 4])\n \"\n [fun types args]\n ($ ($ NSCommon) :ccall (name fun) :types (vec types) :args (vec args)))\n\n(defmacro ^{:added \"1.6\"} defc\n \"Defines a c function. Supports variadic functions.\n Takes the function name, the return type and a vector of the arguments types.\n \n (defc CGRectMake :cgrect [:cgfloat :cgfloat :cgfloat :cgfloat])\n (CGRectMake 12 23 44 55)\n\n ;; Variadic\n (defc NSLog :void [:id &])\n (NSLog \\\"%@ %@ %d\\\" \\\"Hello\\\" \\\"World\\\" 44)\n \"\n [n r types]\n (let [nn (name n)\n variadic? (= '& (last types))\n types (if variadic? (drop-last types) types)\n types (vec (cons r types))]\n (if variadic?\n `(defn ~n [& args#] (ccall ~nn (apply conj (mapv objc-types ~types) (types-for-vals (drop (dec (count ~types)) args#))) args#))\n `(defn ~n [& args#] (ccall ~nn (mapv objc-types ~types) args#)))))\n\n(defmacro ^{:added \"1.6\"} nsproxy\n \"nsproxy mocks an object. It's intended to implement protocols/delegators.\n\n (nsproxy\n ([^id self :doSomething] \n \\\"I don't do anything\\\")\n ([^:bool self :textFieldShouldReturn ^:id field]\n ($ field :resignFirstResponder) \n true))\n \"\n [& methods]\n (let [objc-meta-type (comp objc-types ffirst meta)\n has-class (not (list? (first methods)))\n clazz (when has-class (name (first methods)))\n methods (if has-class (next methods) methods)\n i (map (fn [[args & body]]\n (let [self-sym (first args)\n args (next args)\n sel (take-nth 2 args)\n fields (take-nth 2 (next args))\n types (map objc-meta-type (cons self-sym fields))\n sel (if (pos? (count fields))\n (reduce str (map #(str (name %) \":\") sel))\n (reduce str (map name sel)))]\n `[~sel [[~@types] (fn [~self-sym ~@fields] ~@body)]]))\n methods)\n i (into {} i)]\n `($ ($ ($ NSProxyImpl) :alloc) :initWithClass ~clazz :map ~i)))\n\n(defc ^{:added \"1.6\"} objc_setAssociatedObject :void [:id :pointer :id :int])\n\n(defc ^{:added \"1.6\"} objc_getAssociatedObject :id [:id :pointer])\n\n(def objc-keys-map (atom {}))\n\n(defn ^{:added \"1.6\"} objc-tag [tag]\n (if-let [t (tag @objc-keys-map)]\n t\n (let [t ($ (str \"__\" (name tag) \"__\") :UTF8String)]\n (swap! objc-keys-map assoc tag t)\n t)))\n\n(defn ^{:added \"1.6\"} objc-set!\n \"Retains and sets a value into an object.\"\n [self tag value]\n (objc_setAssociatedObject self (objc-tag tag) value 1)) ; retain assign\n\n(defn ^{:added \"1.6\"} objc-get\n \"Gets a value for a tag set with objc-set!.\"\n [self tag]\n (objc_getAssociatedObject self (objc-tag tag)))\n\n(defmacro ^{:added \"1.6\"} defnstype\n \"nstype creates a new objc class.\n Takes a name, a superclass and a list of methods.\n \n The signature on the methods is optional when the method exists\n on the superclass, otherwise is mandatory.\n \n For the list of all available types see: clojure.core/objc-types\n \n (nstype MyTextField UITextField\n ([self :initWithFrame frame] ; Here the signature is not needed\n (doto ($$ self :initWithFrame frame)\n ($ :setDelegate self)))\n ([^:bool self :textFieldShouldReturn ^:id field]\n ($ self :resignFirstResponder)\n true))\n \"\n [na super & methods]\n (let [methods\n (binding [dispatch-class (name na)]\n (mapv walk/macroexpand-all methods))\n na (name na)\n super (name super)\n fnsi (map\n (fn [[args & body]]\n (let [objc-meta-type (comp objc-types ffirst meta)\n self-sym (first args)\n args (next args)\n sel (take-nth 2 args)\n fields-vec (take-nth 2 (next args))\n fields (take (count fields-vec) (repeatedly gensym))\n fields-let (interleave fields-vec fields)\n types (map objc-meta-type\n (cons self-sym fields-vec))\n types (if (nil? (first types)) nil (vec types))\n sel (if (pos? (count fields))\n (reduce str (map #(str (name %) \":\") sel))\n (reduce str (map name sel)))\n fnname (symbol (str na \":\" sel))]\n [`(defn ~fnname [~self-sym ~@fields]\n (let [~@fields-let] ~@body))\n `[~sel [~types ~fnname]]]))\n methods)\n fns (map first fnsi)\n i (into {} (map second fnsi))]\n `(do\n ~@fns\n ($ ($ NSTypeImpl)\n :makeClassWithName ~na\n :superclass ~super\n :map ~i))))\n\n(defn ^{:added \"1.6\"} remote-repl\n \"Starts a remote repl\"\n [] (clojure.lang.RemoteRepl/listen))\n" }, { "path": "src/clj/clojure/core_print.clj", "content": "; Copyright (c) Rich Hickey. All rights reserved.\n; The use and distribution terms for this software are covered by the\n; Eclipse Public License 1.0 (http://opensource.org/licenses/eclipse-1.0.php)\n; which can be found in the file epl-v10.html at the root of this distribution.\n; By using this software in any fashion, you are agreeing to be bound by\n; the terms of this license.\n; You must not remove this notice, or any other, from this software.\n\n(in-ns 'clojure.core)\n\n;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;; printing ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\n\n(import '(java.io Writer))\n\n(set! *warn-on-reflection* true)\n(def ^:dynamic\n ^{:doc \"*print-length* controls how many items of each collection the\n printer will print. If it is bound to logical false, there is no\n limit. Otherwise, it must be bound to an integer indicating the maximum\n number of items of each collection to print. If a collection contains\n more items, the printer will print items up to the limit followed by\n '...' to represent the remaining items. The root binding is nil\n indicating no limit.\"\n :added \"1.0\"}\n *print-length* nil)\n\n(def ^:dynamic\n ^{:doc \"*print-level* controls how many levels deep the printer will\n print nested objects. If it is bound to logical false, there is no\n limit. Otherwise, it must be bound to an integer indicating the maximum\n level to print. Each argument to print is at level 0; if an argument is a\n collection, its items are at level 1; and so on. If an object is a\n collection and is at a level greater than or equal to the value bound to\n *print-level*, the printer prints '#' to represent it. The root binding\n is nil indicating no limit.\"\n :added \"1.0\"}\n *print-level* nil)\n\n(def ^:dynamic *verbose-defrecords* false)\n\n(defn- print-sequential [^String begin, print-one, ^String sep, ^String end, sequence, ^Writer w]\n (binding [*print-level* (and (not *print-dup*) *print-level* (dec *print-level*))]\n (if (and *print-level* (neg? *print-level*))\n (.write w \"#\")\n (do\n (.write w begin)\n (when-let [xs (seq sequence)]\n (if (and (not *print-dup*) *print-length*)\n (loop [[x & xs] xs\n print-length *print-length*]\n (if (zero? print-length)\n (.write w \"...\")\n (do\n (print-one x w)\n (when xs\n (.write w sep)\n (recur xs (dec print-length))))))\n (loop [[x & xs] xs]\n (print-one x w)\n (when xs\n (.write w sep)\n (recur xs)))))\n (.write w end)))))\n\n(defn- print-meta [o, ^Writer w]\n (when-let [m (meta o)]\n (when (and (pos? (count m))\n (or *print-dup*\n (and *print-meta* *print-readably*)))\n (.write w \"^\")\n (if (and (= (count m) 1) (:tag m))\n (pr-on (:tag m) w)\n (pr-on m w))\n (.write w \" \"))))\n\n(defn print-simple [o, ^Writer w]\n (print-meta o w)\n (.write w (str o)))\n\n(defmethod print-method :default [o, ^Writer w]\n (if (instance? clojure.lang.IObj o)\n (print-method (vary-meta o #(dissoc % :type)) w)\n (print-simple o w)))\n\n(defmethod print-method nil [o, ^Writer w]\n (.write w \"nil\"))\n\n(defmethod print-dup nil [o w] (print-method o w))\n\n(defn print-ctor [o print-args ^Writer w]\n (.write w \"#=(\")\n (.write w (.getName ^Class (class o)))\n (.write w \". \")\n (print-args o w)\n (.write w \")\"))\n\n(defn- print-tagged-object [o rep ^Writer w]\n (when (instance? clojure.lang.IMeta o)\n (print-meta o w))\n (if clojure.lang.RemoteRepl/connected\n (.write w (str \"#remote-ref \\\"\" (clojure.lang.RemoteRef/register o) \"\\\"\"))\n (do\n (.write w \"#object[\")\n \t (let [c (class o)]\n (if (.isArray c)\n (print-method (.getName c) w)\n (.write w (.getName c))))\n (.write w \" \")\n \t (.write w (format \"0x%x \" (System/identityHashCode o)))\n \t (print-method rep w)\n \t (.write w \"]\"))))\n\n(defn- print-object [o, ^Writer w]\n (if clojure.lang.RemoteRepl/connected\n (.write w (str \"#remote-ref \\\"\" (clojure.lang.RemoteRef/register o) \"\\\"\"))\n (print-tagged-object o (str o) w)))\n\n(defmethod print-method Object [o, ^Writer w]\n (print-object o w))\n\n(defmethod print-method clojure.lang.Keyword [o, ^Writer w]\n (.write w (str o)))\n\n(defmethod print-dup clojure.lang.Keyword [o w] (print-method o w))\n\n(defmethod print-method clojure.lang.Selector [^clojure.lang.Selector o, ^Writer w]\n (.write w (str \"#sel \\\"\" (. o sel) \"\\\"\")))\n\n(defmethod print-dup clojure.lang.Selector [o w] (print-method o w))\n\n(defmethod print-method Number [o, ^Writer w]\n (.write w (str o)))\n\n(defmethod print-dup Number [o, ^Writer w]\n (print-ctor o\n (fn [o w]\n (print-dup (str o) w))\n w))\n\n(defmethod print-dup clojure.lang.Fn [o, ^Writer w]\n (print-ctor o (fn [o w]) w))\n\n(prefer-method print-dup clojure.lang.IPersistentCollection clojure.lang.Fn)\n(prefer-method print-dup java.util.Map clojure.lang.Fn)\n(prefer-method print-dup java.util.Collection clojure.lang.Fn)\n\n(defmethod print-method Boolean [o, ^Writer w]\n (.write w (str o)))\n\n(defmethod print-dup Boolean [o w] (print-method o w))\n\n(defmethod print-method clojure.lang.Symbol [o, ^Writer w]\n (print-simple o w))\n\n(defmethod print-dup clojure.lang.Symbol [o w] (print-method o w))\n\n(defmethod print-method clojure.lang.Var [o, ^Writer w]\n (print-simple o w))\n\n(defmethod print-dup clojure.lang.Var [^clojure.lang.Var o, ^Writer w]\n (.write w (str \"#=(var \" (.name (.ns o)) \"/\" (.sym o) \")\")))\n\n(defmethod print-method clojure.lang.ISeq [o, ^Writer w]\n (print-meta o w)\n (print-sequential \"(\" pr-on \" \" \")\" o w))\n\n(defmethod print-dup clojure.lang.ISeq [o w] (print-method o w))\n(defmethod print-dup clojure.lang.IPersistentList [o w] (print-method o w))\n(prefer-method print-method clojure.lang.ISeq clojure.lang.IPersistentCollection)\n(prefer-method print-dup clojure.lang.ISeq clojure.lang.IPersistentCollection)\n(prefer-method print-method clojure.lang.ISeq java.util.Collection)\n(prefer-method print-dup clojure.lang.ISeq java.util.Collection)\n\n\n\n(defmethod print-dup java.util.Collection [o, ^Writer w]\n (print-ctor o #(print-sequential \"[\" print-dup \" \" \"]\" %1 %2) w))\n\n(defmethod print-dup clojure.lang.IPersistentCollection [o, ^Writer w]\n (print-meta o w)\n (.write w \"#=(\")\n (.write w (.getName ^Class (class o)))\n (.write w \"/create \")\n (print-sequential \"[\" print-dup \" \" \"]\" o w)\n (.write w \")\"))\n\n(prefer-method print-dup clojure.lang.IPersistentCollection java.util.Collection)\n\n(def ^{:tag String\n :doc \"Returns escape string for char or nil if none\"\n :added \"1.0\"}\n char-escape-string\n {\\newline \"\\\\n\"\n \\tab \"\\\\t\"\n \\return \"\\\\r\"\n \\\" \"\\\\\\\"\"\n \\\\ \"\\\\\\\\\"\n \\formfeed \"\\\\f\"\n \\backspace \"\\\\b\"})\n\n(defmethod print-method String [^String s, ^Writer w]\n (if (or *print-dup* *print-readably*)\n (do (.append w \\\")\n (dotimes [n (count s)]\n (let [c (.charAt s n)\n e (char-escape-string c)]\n (if e (.write w e) (.append w c))))\n (.append w \\\"))\n (.write w s))\n nil)\n\n(defmethod print-dup String [s w] (print-method s w))\n\n(defmethod print-method clojure.lang.IPersistentVector [v, ^Writer w]\n (print-meta v w)\n (print-sequential \"[\" pr-on \" \" \"]\" v w))\n\n(defn- print-map [m print-one w]\n (print-sequential\n \"{\"\n (fn [e ^Writer w]\n (do (print-one (key e) w) (.append w \\space) (print-one (val e) w)))\n \", \"\n \"}\"\n (seq m) w))\n\n(defmethod print-method clojure.lang.IPersistentMap [m, ^Writer w]\n (print-meta m w)\n (print-map m pr-on w))\n\n(defmethod print-dup java.util.Map [m, ^Writer w]\n (print-ctor m #(print-map (seq %1) print-dup %2) w))\n\n(defmethod print-dup clojure.lang.IPersistentMap [m, ^Writer w]\n (print-meta m w)\n (.write w \"#=(\")\n (.write w (.getName (class m)))\n (.write w \"/create \")\n (print-map m print-dup w)\n (.write w \")\"))\n\n;; java.util\n(prefer-method print-method clojure.lang.IPersistentCollection java.util.Collection)\n(prefer-method print-method clojure.lang.IPersistentCollection java.util.RandomAccess)\n(prefer-method print-method java.util.RandomAccess java.util.List)\n(prefer-method print-method clojure.lang.IPersistentCollection java.util.Map)\n\n(defmethod print-method java.util.List [c, ^Writer w]\n (if *print-readably*\n (do\n (print-meta c w)\n (print-sequential \"(\" pr-on \" \" \")\" c w))\n (print-object c w)))\n\n(defmethod print-method java.util.RandomAccess [v, ^Writer w]\n (if *print-readably*\n (do\n (print-meta v w)\n (print-sequential \"[\" pr-on \" \" \"]\" v w))\n (print-object v w)))\n\n(defmethod print-method java.util.Map [m, ^Writer w]\n (if *print-readably*\n (do\n (print-meta m w)\n (print-map m pr-on w))\n (print-object m w)))\n\n(defmethod print-method java.util.Set [s, ^Writer w]\n (if *print-readably*\n (do\n (print-meta s w)\n (print-sequential \"#{\" pr-on \" \" \"}\" (seq s) w))\n (print-object s w)))\n\n;; Records\n\n(defmethod print-method clojure.lang.IRecord [r, ^Writer w]\n (print-meta r w)\n (.write w \"#\")\n (.write w (.getName (class r)))\n (print-map r pr-on w))\n\n(defmethod print-dup clojure.lang.IRecord [r, ^Writer w]\n (print-meta r w)\n (.write w \"#\")\n (.write w (.getName (class r)))\n (if *verbose-defrecords*\n (print-map r print-dup w)\n (print-sequential \"[\" pr-on \", \" \"]\" (vals r) w)))\n\n(prefer-method print-method clojure.lang.IRecord java.util.Map)\n(prefer-method print-method clojure.lang.IRecord clojure.lang.IPersistentMap)\n(prefer-method print-dup clojure.lang.IRecord clojure.lang.IPersistentMap)\n(prefer-method print-dup clojure.lang.IPersistentCollection java.util.Map)\n(prefer-method print-dup clojure.lang.IRecord clojure.lang.IPersistentCollection)\n(prefer-method print-dup clojure.lang.IRecord java.util.Map)\n\n(defmethod print-method clojure.lang.IPersistentSet [s, ^Writer w]\n (print-meta s w)\n (print-sequential \"#{\" pr-on \" \" \"}\" (seq s) w))\n\n(def ^{:tag String\n :doc \"Returns name string for char or nil if none\"\n :added \"1.0\"}\n char-name-string\n {\\newline \"newline\"\n \\tab \"tab\"\n \\space \"space\"\n \\backspace \"backspace\"\n \\formfeed \"formfeed\"\n \\return \"return\"})\n\n(defmethod print-method java.lang.Character [^Character c, ^Writer w]\n (if (or *print-dup* *print-readably*)\n (do (.append w \\\\)\n (let [n (char-name-string c)]\n (if n (.write w n) (.append w c))))\n (.append w c))\n nil)\n\n(defmethod print-dup java.lang.Character [c w] (print-method c w))\n(defmethod print-dup java.lang.Long [o w] (print-method o w))\n(defmethod print-dup java.lang.Double [o w] (print-method o w))\n(defmethod print-dup clojure.lang.Ratio [o w] (print-method o w))\n(defmethod print-dup java.math.BigDecimal [o w] (print-method o w))\n(defmethod print-dup clojure.lang.BigInt [o w] (print-method o w))\n(defmethod print-dup clojure.lang.PersistentHashMap [o w] (print-method o w))\n(defmethod print-dup clojure.lang.PersistentHashSet [o w] (print-method o w))\n(defmethod print-dup clojure.lang.PersistentVector [o w] (print-method o w))\n(defmethod print-dup clojure.lang.LazilyPersistentVector [o w] (print-method o w))\n\n(def primitives-classnames\n {Float/TYPE \"Float/TYPE\"\n Integer/TYPE \"Integer/TYPE\"\n Long/TYPE \"Long/TYPE\"\n Boolean/TYPE \"Boolean/TYPE\"\n Character/TYPE \"Character/TYPE\"\n Double/TYPE \"Double/TYPE\"\n Byte/TYPE \"Byte/TYPE\"\n Short/TYPE \"Short/TYPE\"})\n\n(defmethod print-method Class [^Class c, ^Writer w]\n (.write w (.getName c)))\n\n(defmethod print-dup Class [^Class c, ^Writer w]\n (cond\n (.isPrimitive c) (do\n (.write w \"#=(identity \")\n (.write w ^String (primitives-classnames c))\n (.write w \")\"))\n (.isArray c) (do\n (.write w \"#=(java.lang.Class/forName \\\"\")\n (.write w (.getName c))\n (.write w \"\\\")\"))\n :else (do\n (.write w \"#=\")\n (.write w (.getName c)))))\n\n(defmethod print-method java.math.BigDecimal [b, ^Writer w]\n (.write w (str b))\n (.write w \"M\"))\n\n(defmethod print-method clojure.lang.BigInt [b, ^Writer w]\n (.write w (str b))\n (.write w \"N\"))\n\n(defmethod print-method java.util.regex.Pattern [p ^Writer w]\n (.write w \"#\\\"\")\n (loop [[^Character c & r :as s] (seq (.pattern ^java.util.regex.Pattern p))\n qmode false]\n (when s\n (cond\n (= c \\\\) (let [[^Character c2 & r2] r]\n (.append w \\\\)\n (.append w c2)\n (if qmode\n (recur r2 (not= c2 \\E))\n (recur r2 (= c2 \\Q))))\n (= c \\\") (do\n (if qmode\n (.write w \"\\\\E\\\\\\\"\\\\Q\")\n (.write w \"\\\\\\\"\"))\n (recur r qmode))\n :else (do\n (.append w c)\n (recur r qmode)))))\n (.append w \\\"))\n\n(defmethod print-dup java.util.regex.Pattern [p ^Writer w] (print-method p w))\n\n(defmethod print-dup clojure.lang.Namespace [^clojure.lang.Namespace n ^Writer w]\n (.write w \"#=(find-ns \")\n (print-dup (.name n) w)\n (.write w \")\"))\n\n(defn- deref-as-map [^clojure.lang.IDeref o]\n (let [pending (and (instance? clojure.lang.IPending o)\n (not (.isRealized ^clojure.lang.IPending o)))\n [ex val]\n (when-not pending\n (try [false (deref o)]\n (catch Throwable e\n [true e])))]\n {:status\n (cond\n (or ex\n (and (instance? clojure.lang.Agent o)\n (agent-error o)))\n :failed\n\n pending\n :pending\n\n :else\n :ready)\n\n :val val}))\n\n(defmethod print-method clojure.lang.IDeref [o ^Writer w]\n (print-tagged-object o (deref-as-map o) w))\n\n(defmethod print-method StackTraceElement [^StackTraceElement o ^Writer w]\n (print-method [(symbol (.getClassName o)) (symbol (.getMethodName o)) (.getFileName o) (.getLineNumber o)] w))\n\n(defn Throwable->map\n \"Constructs a data representation for a Throwable.\"\n {:added \"1.7\"}\n [^Throwable o]\n (let [base (fn [^Throwable t]\n (let [m {:type (class t)\n :message (.getLocalizedMessage t)\n :at (get (.getStackTrace t) 0)}\n data (ex-data t)]\n (if data\n (assoc m :data data)\n m)))\n via (loop [via [], ^Throwable t o]\n (if t\n (recur (conj via t) (.getCause t))\n via))\n ^Throwable root (peek via)\n m {:cause (.getLocalizedMessage root)\n :via (vec (map base via))\n :trace (vec (.getStackTrace ^Throwable (or root o)))}\n data (ex-data root)]\n (if data\n (assoc m :data data)\n m)))\n\n(defn- print-throwable [^Throwable o ^Writer w]\n (.write w \"#error {\\n :cause \")\n (let [{:keys [cause data via trace]} (Throwable->map o)\n print-via #(do (.write w \"{:type \")\n\t\t (print-method (:type %) w)\n\t\t\t\t\t (.write w \"\\n :message \")\n\t\t\t\t\t (print-method (:message %) w)\n (when-let [data (:data %)]\n (.write w \"\\n :data \")\n (print-method data w))\n\t\t\t\t\t (.write w \"\\n :at \")\n\t\t\t\t\t (print-method (:at %) w)\n\t\t\t\t\t (.write w \"}\"))]\n (print-method cause w)\n (when data\n (.write w \"\\n :data \")\n (print-method data w))\n (when via\n (.write w \"\\n :via\\n [\")\n (when-let [fv (first via)]\n\t (print-via fv)\n (doseq [v (rest via)]\n (.write w \"\\n \")\n\t\t (print-via v)))\n (.write w \"]\"))\n (when trace\n (.write w \"\\n :trace\\n [\")\n (when-let [ft (first trace)]\n (print-method ft w)\n (doseq [t (rest trace)]\n (.write w \"\\n \")\n (print-method t w)))\n (.write w \"]\")))\n (.write w \"}\"))\n\n(defmethod print-method Throwable [^Throwable o ^Writer w]\n (print-throwable o w))\n\n(defmethod print-method clojure.lang.TaggedLiteral [o ^Writer w]\n (.write w \"#\")\n (print-method (:tag o) w)\n (.write w \" \")\n (print-method (:form o) w))\n\n(defmethod print-method clojure.lang.ReaderConditional [o ^Writer w]\n (.write w \"#?\")\n (when (:splicing? o) (.write w \"@\"))\n (print-method (:form o) w))\n\n(def ^{:private true} print-initialized true)\n" }, { "path": "src/clj/clojure/core_proxy.clj", "content": "; Copyright (c) Rich Hickey. All rights reserved.\n; The use and distribution terms for this software are covered by the\n; Eclipse Public License 1.0 (http://opensource.org/licenses/eclipse-1.0.php)\n; which can be found in the file epl-v10.html at the root of this distribution.\n; By using this software in any fashion, you are agreeing to be bound by\n; the terms of this license.\n; You must not remove this notice, or any other, from this software.\n\n(in-ns 'clojure.core)\n\n;;;;;;;;;;;;;;;;;;;;;;;;;;;; proxy ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\n\n(import\n '(clojure.asm ClassWriter ClassVisitor Opcodes Type)\n '(java.lang.reflect Modifier Constructor)\n '(clojure.asm.commons Method GeneratorAdapter)\n '(clojure.lang Var IProxy Reflector DynamicClassLoader Compiler IPersistentMap PersistentHashMap RT))\n\n(defn method-sig [^java.lang.reflect.Method meth]\n [(. meth (getName)) (seq (. meth (getParameterTypes))) (. meth getReturnType)])\n\n(defn- most-specific [rtypes]\n (or (some (fn [t] (when (every? #(isa? t %) rtypes) t)) rtypes)\n (throw (Exception. \"Incompatible return types\"))))\n\n(defn- group-by-sig\n \"takes a collection of [msig meth] and returns a seq of maps from return-types to meths.\"\n [coll]\n (vals (reduce1 (fn [m [msig meth]]\n (let [rtype (peek msig)\n argsig (pop msig)]\n (assoc m argsig (assoc (m argsig {}) rtype meth))))\n {} coll)))\n\n(defn proxy-name\n {:tag String}\n [^Class super interfaces]\n (let [inames (into1 (sorted-set) (map #(.getName ^Class %) interfaces))]\n (apply str (.replace (str *ns*) \\- \\_) \".proxy\"\n (interleave (repeat \"$\")\n (concat\n [(.getName super)]\n (map #(subs % (inc (.lastIndexOf ^String % \".\"))) inames)\n [(Integer/toHexString (hash inames))])))))\n\n(defn- generate-proxy [^Class super interfaces]\n (let [cv (new ClassWriter (. ClassWriter COMPUTE_MAXS))]\n (binding [*source-writer* (.getSc cv)]\n (let [sname (proxy-name super interfaces)\n cname (.replace sname \\. \\/) ;(str \"clojure/lang/\" (gensym \"Proxy__\"))\n ctype (. Type (getObjectType cname))\n lastdot (.lastIndexOf sname \".\")\n classname (subs sname (inc lastdot))\n packagename (subs sname 0 lastdot)\n iname (fn [^Class c] (.. Type (getType c) (getInternalName)))\n fmap \"__clojureFnMap\"\n totype (fn [^Class c] (. Type (getType c)))\n to-types (fn [cs] (if (pos? (count cs))\n (into-array (map totype cs))\n (make-array Type 0)))\n super-type ^Type (totype super)\n imap-type ^Type (totype IPersistentMap)\n ifn-type (totype clojure.lang.IFn)\n obj-type (totype Object)\n sym-type (totype clojure.lang.Symbol)\n rt-type (totype clojure.lang.RT)\n ex-type (totype java.lang.UnsupportedOperationException)\n gen-bridge\n (fn [^java.lang.reflect.Method meth ^java.lang.reflect.Method dest]\n (let [pclasses (. meth (getParameterTypes))\n ptypes (to-types pclasses)\n rclass (. meth (getReturnType))\n rtype ^Type (totype rclass)\n mname (. meth (getName))\n m (new Method mname rtype ptypes)\n dtype (totype (.getDeclaringClass dest))\n dm (new Method (. dest (getName)) (totype (. dest (getReturnType))) (to-types (. dest (getParameterTypes))))\n gen (new GeneratorAdapter (bit-or (. Opcodes ACC_PUBLIC) (. Opcodes ACC_BRIDGE)) m nil nil cv)]\n (comment (Compiler/emitSource (str \"public \" (.getCanonicalName rclass) \" \" mname \"(\"\n (apply str (interpose \", \" (map #(str (.getCanonicalName (nth pclasses %)) \" p\" %) (range (count pclasses))))) \") {\"))\n (Compiler/tab))\n (. gen (visitCode))\n (. gen (loadThis))\n (dotimes [i (count ptypes)]\n (. gen (loadArg i)))\n (if (-> dest .getDeclaringClass .isInterface)\n (. gen (invokeInterface dtype dm))\n (. gen (invokeVirtual dtype dm)))\n (comment (Compiler/emitSource (str (if (= (.getCanonicalName rclass) \"void\") \"\" \"return \")\n \"super.\" mname \"(\" (apply str (interpose \", \" (map #(str \"p\" %) (range (count pclasses))))) \");\"))\n (Compiler/untab)\n (Compiler/emitSource \"}\"))\n (. gen (returnValue))\n (. gen (endMethod))))\n gen-method\n (fn [^java.lang.reflect.Method meth else-gen]\n (let [pclasses (. meth (getParameterTypes))\n abstract? (Modifier/isAbstract (.getModifiers meth))\n ptypes (to-types pclasses)\n rclass (. meth (getReturnType))\n extypes (. meth (getExceptionTypes))\n exdecl (reduce1 str (interpose \", \" (map #(.getCanonicalName %) extypes)))\n rcanonical (.getCanonicalName rclass)\n rtype ^Type (totype rclass)\n mname (. meth (getName))\n m (new Method mname rtype ptypes)\n gen (new GeneratorAdapter (. Opcodes ACC_PUBLIC) m nil nil cv)\n else-label (. gen (newLabel))\n end-label (. gen (newLabel))\n decl-type (. Type (getType (. meth (getDeclaringClass))))]\n (. gen (visitCode))\n (Compiler/emitSource (str \"public \" (.getCanonicalName rclass) \" \" mname \"(\"\n (apply str (interpose \", \" (map #(str (.getCanonicalName (nth pclasses %)) \" p\" %) (range (count pclasses))))) \")\"\n (if (empty? exdecl) \"\" (str \" throws \" exdecl \" \")) \" {\"))\n (Compiler/tab)\n (if (> (count pclasses) 18)\n (else-gen gen m)\n (do\n (. gen (loadThis))\n (. gen (getField ctype fmap imap-type))\n\n (. gen (push mname))\n ;lookup fn in map\n (Compiler/emitSource (str \"final Object value = RT.get(this.__clojureFnMap, \\\"\" mname \"\\\");\"))\n (. gen (invokeStatic rt-type (. Method (getMethod \"Object get(Object, Object)\"))))\n (. gen (dup))\n (. gen (ifNull else-label))\n ;if found\n (.checkCast gen ifn-type)\n (. gen (loadThis))\n ;box args\n (dotimes [i (count ptypes)]\n (. gen (loadArg i))\n (. clojure.lang.Compiler$HostExpr (emitBoxReturn nil gen (nth pclasses i) \"\")))\n ;call fn\n (. gen (invokeInterface ifn-type (new Method \"invoke\" obj-type\n (into-array (cons obj-type\n (replicate (count ptypes) obj-type))))))\n ;unbox return\n ;return (value != null) ? ((IMapEntry)((IFn)value).invoke(this, o)) : super.entryAt(o);\n (let [param-list (apply str (interpose \", \" (map #(str \"p\" %) (range (count pclasses)))))]\n (if (= rcanonical \"void\")\n (Compiler/emitSource (str \"if (value != null) {\" \"((IFn)value).invoke(this\"\n (if (empty? param-list) \"\" \", \") param-list \"); } \" (if abstract? \"\" (str \"else { super.\" mname \"(\" param-list \"); }\"))))\n (Compiler/emitSource (str \"return (value != null) ? \" \"(\" rcanonical \")\"\n (. gen (unbox rtype (str \"((IFn)value).invoke(this\" (if (empty? param-list) \"\" \", \") param-list \")\")))\n \" : \" (if abstract? \"null;\" (str \"super.\" mname \"(\" param-list \");\"))))))\n (. gen (unbox rtype))\n (when (= (. rtype (getSort)) (. Type VOID))\n (. gen (pop)))\n (. gen (goTo end-label))\n\n ;else call supplied alternative generator\n (Var/pushThreadBindings {Compiler/STOP_EMIT_SOURCE true})\n (. gen (mark else-label))\n\n (. gen (pop))\n\n (else-gen gen m)\n (Var/popThreadBindings)\n\n (. gen (mark end-label))))\n (Compiler/untab)\n (Compiler/emitSource \"}\")\n (. gen (returnValue))\n (. gen (endMethod))))]\n\n (Compiler/emitSource (str \"package \" packagename \";\"))\n (Compiler/emitSource)\n (Compiler/emitSource \"import java.util.*;\")\n (Compiler/emitSource \"import clojure.lang.*;\")\n (Compiler/emitSource)\n (Compiler/emitSource (str \"public class \" classname \" extends \" (.getCanonicalName super) \" implements \"\n (apply str (interpose \", \" (cons \"IProxy\" (map #(.getCanonicalName %) interfaces)))) \" {\"))\n (Compiler/tab)\n\n (Compiler/emitSource)\n (Compiler/emitSource \"private volatile IPersistentMap __clojureFnMap;\")\n (Compiler/emitSource)\n ;start class definition\n (. cv (visit (. Opcodes V1_5) (+ (. Opcodes ACC_PUBLIC) (. Opcodes ACC_SUPER))\n cname nil (iname super)\n (into-array (map iname (cons IProxy interfaces)))))\n ;add field for fn mappings\n (. cv (visitField (+ (. Opcodes ACC_PRIVATE) (. Opcodes ACC_VOLATILE))\n fmap (. imap-type (getDescriptor)) nil nil))\n ;add ctors matching/calling super's\n (doseq [^Constructor ctor (. super (getDeclaredConstructors))]\n (when-not (. Modifier (isPrivate (. ctor (getModifiers))))\n (let [pclasses (. ctor (getParameterTypes))\n ptypes (to-types pclasses)\n m (new Method \"\" (. Type VOID_TYPE) ptypes)\n gen (new GeneratorAdapter (. Opcodes ACC_PUBLIC) m nil nil cv)]\n (. gen (visitCode))\n (Compiler/emitSource (str \"public \" classname \"(\"\n (apply str (interpose \", \" (map #(str (.getCanonicalName (nth pclasses %)) \" p\" %) (range (count pclasses))))) \") {\"))\n (Compiler/tab)\n ;call super ctor\n (. gen (loadThis))\n (. gen (dup))\n (. gen (loadArgs))\n (. gen (invokeConstructor super-type m))\n (Compiler/emitSource (str \"super(\" (apply str (interpose \", \" (map #(str \"p\" %) (range (count pclasses))))) \");\"))\n\n (Compiler/untab)\n (Compiler/emitSource \"}\")\n\n (. gen (returnValue))\n (. gen (endMethod)))))\n ;add IProxy methods\n (let [m (. Method (getMethod \"void __initClojureFnMappings(clojure.lang.IPersistentMap)\"))\n gen (new GeneratorAdapter (. Opcodes ACC_PUBLIC) m nil nil cv)]\n (. gen (visitCode))\n (. gen (loadThis))\n (. gen (loadArgs))\n (. gen (putField ctype fmap imap-type))\n\n (. gen (returnValue))\n (. gen (endMethod)))\n\n (Compiler/emitSource (str \"public void __initClojureFnMappings(final IPersistentMap _clojureFnMap) {\"))\n (Compiler/tab)\n (Compiler/emitSource \"this.__clojureFnMap = _clojureFnMap;\")\n (Compiler/untab)\n (Compiler/emitSource (str \"}\"))\n\n (let [m (. Method (getMethod \"void __updateClojureFnMappings(clojure.lang.IPersistentMap)\"))\n gen (new GeneratorAdapter (. Opcodes ACC_PUBLIC) m nil nil cv)]\n (. gen (visitCode))\n (. gen (loadThis))\n (. gen (dup))\n (. gen (getField ctype fmap imap-type))\n (.checkCast gen (totype clojure.lang.IPersistentCollection))\n (. gen (loadArgs))\n (. gen (invokeInterface (totype clojure.lang.IPersistentCollection)\n (. Method (getMethod \"clojure.lang.IPersistentCollection cons(Object)\"))))\n (. gen (checkCast imap-type))\n (. gen (putField ctype fmap imap-type))\n\n (. gen (returnValue))\n (. gen (endMethod)))\n\n (Compiler/emitSource (str \"public void __updateClojureFnMappings(final IPersistentMap persistentMap) {\"))\n (Compiler/tab)\n (Compiler/emitSource \"this.__clojureFnMap = (IPersistentMap)((IPersistentCollection)this.__clojureFnMap).cons(persistentMap);\")\n (Compiler/untab)\n (Compiler/emitSource (str \"}\"))\n\n (let [m (. Method (getMethod \"clojure.lang.IPersistentMap __getClojureFnMappings()\"))\n gen (new GeneratorAdapter (. Opcodes ACC_PUBLIC) m nil nil cv)]\n (. gen (visitCode))\n (. gen (loadThis))\n (. gen (getField ctype fmap imap-type))\n (. gen (returnValue))\n (. gen (endMethod)))\n\n (Compiler/emitSource (str \"public IPersistentMap __getClojureFnMappings() {\"))\n (Compiler/tab)\n (Compiler/emitSource \"return this.__clojureFnMap;\")\n (Compiler/untab)\n (Compiler/emitSource (str \"}\"))\n\n ;calc set of supers' non-private instance methods\n (let [[mm considered]\n (loop [mm {} considered #{} c super]\n (if c\n (let [[mm considered]\n (loop [mm mm\n considered considered\n meths (concat\n (seq (. c (getDeclaredMethods)))\n (seq (. c (getMethods))))]\n (if (seq meths)\n (let [^java.lang.reflect.Method meth (first meths)\n mods (. meth (getModifiers))\n mk (method-sig meth)]\n (if (or (considered mk)\n (not (or (Modifier/isPublic mods) (Modifier/isProtected mods)))\n ;(. Modifier (isPrivate mods))\n (. Modifier (isStatic mods))\n (. Modifier (isFinal mods))\n (= \"finalize\" (.getName meth)))\n (recur mm (conj considered mk) (next meths))\n (recur (assoc mm mk meth) (conj considered mk) (next meths))))\n [mm considered]))]\n (recur mm considered (. c (getSuperclass))))\n [mm considered]))\n ifaces-meths (into1 {}\n (for [^Class iface interfaces meth (. iface (getMethods))\n :let [msig (method-sig meth)] :when (not (considered msig))]\n {msig meth}))\n mgroups (group-by-sig (concat mm ifaces-meths))\n rtypes (map #(most-specific (keys %)) mgroups)\n mb (map #(vector (%1 %2) (vals (dissoc %1 %2))) mgroups rtypes)\n bridge? (reduce1 into1 #{} (map second mb))\n ifaces-meths (remove bridge? (vals ifaces-meths))\n mm (remove bridge? (vals mm))]\n ;add methods matching supers', if no mapping -> call super\n (doseq [[^java.lang.reflect.Method dest bridges] mb\n ^java.lang.reflect.Method meth bridges]\n (gen-bridge meth dest))\n (doseq [^java.lang.reflect.Method meth mm]\n (gen-method meth\n (fn [^GeneratorAdapter gen ^Method m]\n (. gen (loadThis))\n ;push args\n (. gen (loadArgs))\n ;call super\n (Compiler/emitSource (str \"return \" \"super.\" (. meth (getName)) \"(\"\n (apply str (interpose \", \" (map #(str \"p\" %) (range (count (. meth (getParameterTypes))))))) \");\"))\n (. gen (visitMethodInsn (. Opcodes INVOKESPECIAL)\n (. super-type (getInternalName))\n (. m (getName))\n (. m (getDescriptor)))))))\n\n ;add methods matching interfaces', if no mapping -> throw\n (doseq [^java.lang.reflect.Method meth ifaces-meths]\n (gen-method meth\n (fn [^GeneratorAdapter gen ^Method m]\n (. gen (throwException ex-type (. m (getName))))))))\n\n ;finish class def\n (. cv (visitEnd))\n (Compiler/untab)\n (Compiler/emitSource \"}\")\n (when *compile-files*\n (Compiler/writeSourceFile cname (str *source-writer*)))\n [cname (. cv toByteArray)]))))\n\n(defn- get-super-and-interfaces [bases]\n (if (. ^Class (first bases) (isInterface))\n [Object bases]\n [(first bases) (next bases)]))\n\n(defn get-proxy-class\n \"Takes an optional single class followed by zero or more\n interfaces. If not supplied class defaults to Object. Creates an\n returns an instance of a proxy class derived from the supplied\n classes. The resulting value is cached and used for any subsequent\n requests for the same class set. Returns a Class object.\"\n {:added \"1.0\"}\n [& bases]\n (let [[super interfaces] (get-super-and-interfaces bases)\n pname (proxy-name super interfaces)]\n (or (RT/loadClassForName pname)\n (let [[cname bytecode] (generate-proxy super interfaces)]\n (. ^DynamicClassLoader (deref clojure.lang.Compiler/LOADER) (defineClass pname bytecode [super interfaces]))))))\n\n(defn construct-proxy\n \"Takes a proxy class and any arguments for its superclass ctor and\n creates and returns an instance of the proxy.\"\n {:added \"1.0\"}\n [c & ctor-args]\n (. Reflector (invokeConstructor c (to-array ctor-args))))\n\n(defn init-proxy\n \"Takes a proxy instance and a map of strings (which must\n correspond to methods of the proxy superclass/superinterfaces) to\n fns (which must take arguments matching the corresponding method,\n plus an additional (explicit) first arg corresponding to this, and\n sets the proxy's fn map. Returns the proxy.\"\n {:added \"1.0\"}\n [^IProxy proxy mappings]\n (. proxy (__initClojureFnMappings mappings))\n proxy)\n\n(defn update-proxy\n \"Takes a proxy instance and a map of strings (which must\n correspond to methods of the proxy superclass/superinterfaces) to\n fns (which must take arguments matching the corresponding method,\n plus an additional (explicit) first arg corresponding to this, and\n updates (via assoc) the proxy's fn map. nil can be passed instead of\n a fn, in which case the corresponding method will revert to the\n default behavior. Note that this function can be used to update the\n behavior of an existing instance without changing its identity.\n Returns the proxy.\"\n {:added \"1.0\"}\n [^IProxy proxy mappings]\n (. proxy (__updateClojureFnMappings mappings))\n proxy)\n\n(defn proxy-mappings\n \"Takes a proxy instance and returns the proxy's fn map.\"\n {:added \"1.0\"}\n [^IProxy proxy]\n (. proxy (__getClojureFnMappings)))\n\n(defmacro proxy\n \"class-and-interfaces - a vector of class names\n\n args - a (possibly empty) vector of arguments to the superclass\n constructor.\n\n f => (name [params*] body) or\n (name ([params*] body) ([params+] body) ...)\n\n Expands to code which creates a instance of a proxy class that\n implements the named class/interface(s) by calling the supplied\n fns. A single class, if provided, must be first. If not provided it\n defaults to Object.\n\n The interfaces names must be valid interface types. If a method fn\n is not provided for a class method, the superclass methd will be\n called. If a method fn is not provided for an interface method, an\n UnsupportedOperationException will be thrown should it be\n called. Method fns are closures and can capture the environment in\n which proxy is called. Each method fn takes an additional implicit\n first arg, which is bound to 'this. Note that while method fns can\n be provided to override protected methods, they have no other access\n to protected members, nor to super, as these capabilities cannot be\n proxied.\"\n {:added \"1.0\"}\n [class-and-interfaces args & fs]\n (let [bases (map #(or (resolve %) (throw (Exception. (str \"Can't resolve: \" %))))\n class-and-interfaces)\n [super interfaces] (get-super-and-interfaces bases)\n compile-effect (when *compile-files*\n (let [[cname bytecode] (generate-proxy super interfaces)]\n (clojure.lang.Compiler/writeClassFile cname bytecode)))\n pc-effect (apply get-proxy-class bases)\n pname (proxy-name super interfaces)]\n ;remember the class to prevent it from disappearing before use\n (intern *ns* (symbol pname) pc-effect)\n `(let [;pc# (get-proxy-class ~@class-and-interfaces)\n p# (new ~(symbol pname) ~@args)] ;(construct-proxy pc# ~@args)]\n (init-proxy p#\n ~(loop [fmap {} fs fs]\n (if fs\n (let [[sym & meths] (first fs)\n meths (if (vector? (first meths))\n (list meths)\n meths)\n meths (map (fn [[params & body]]\n (cons (apply vector 'this params) body))\n meths)]\n (if-not (contains? fmap (name sym))\n (recur (assoc fmap (name sym) (cons `fn meths)) (next fs))\n\t\t (throw (IllegalArgumentException.\n\t\t\t (str \"Method '\" (name sym) \"' redefined\")))))\n fmap)))\n p#)))\n\n(defn proxy-call-with-super [call this meth]\n (let [m (proxy-mappings this)]\n (update-proxy this (assoc m meth nil))\n (try\n (call)\n (finally (update-proxy this m)))))\n\n(defmacro proxy-super\n \"Use to call a superclass method in the body of a proxy method.\n Note, expansion captures 'this\"\n {:added \"1.0\"}\n [meth & args]\n `(proxy-call-with-super (fn [] (. ~'this ~meth ~@args)) ~'this ~(name meth)))\n\n(comment\n(defn bean\n \"Takes a Java object and returns a read-only implementation of the\n map abstraction based upon its JavaBean properties.\"\n {:added \"1.0\"}\n [^Object x]\n (let [c (. x (getClass))\n\tpmap (reduce1 (fn [m ^java.beans.PropertyDescriptor pd]\n\t\t\t (let [name (. pd (getName))\n\t\t\t method (. pd (getReadMethod))]\n\t\t\t (if (and method (zero? (alength (. method (getParameterTypes)))))\n\t\t\t (assoc m (keyword name) (fn [] (clojure.lang.Reflector/prepRet (.getPropertyType pd) (. method (invoke x nil)))))\n\t\t\t m)))\n\t\t {}\n\t\t (seq (.. java.beans.Introspector\n\t\t\t (getBeanInfo c)\n\t\t\t (getPropertyDescriptors))))\n\tv (fn [k] ((pmap k)))\n snapshot (fn []\n (reduce1 (fn [m e]\n (assoc m (key e) ((val e))))\n {} (seq pmap)))]\n (proxy [clojure.lang.APersistentMap]\n []\n (iterator [] (.iterator ^Iterable pmap))\n (containsKey [k] (contains? pmap k))\n (entryAt [k] (when (contains? pmap k) (new clojure.lang.MapEntry k (v k))))\n (valAt ([k] (when (contains? pmap k) (v k)))\n\t ([k default] (if (contains? pmap k) (v k) default)))\n (cons [m] (conj (snapshot) m))\n (count [] (count pmap))\n (assoc [k v] (assoc (snapshot) k v))\n (without [k] (dissoc (snapshot) k))\n (seq [] ((fn thisfn [plseq]\n\t\t (lazy-seq\n (when-let [pseq (seq plseq)]\n (cons (new clojure.lang.MapEntry (first pseq) (v (first pseq)))\n (thisfn (rest pseq)))))) (keys pmap)))))))" }, { "path": "src/clj/clojure/data.clj", "content": "; Copyright (c) Rich Hickey. All rights reserved.\n; The use and distribution terms for this software are covered by the\n; Eclipse Public License 1.0 (http://opensource.org/licenses/eclipse-1.0.php)\n; which can be found in the file epl-v10.html at the root of this distribution.\n; By using this software in any fashion, you are agreeing to be bound by\n; the terms of this license.\n; You must not remove this notice, or any other, from this software.\n\n(ns \n ^{:author \"Stuart Halloway\",\n :doc \"Non-core data functions.\"}\n clojure.data\n (:require [clojure.set :as set]))\n\n(declare diff)\n\n(defn- atom-diff\n \"Internal helper for diff.\"\n [a b]\n (if (= a b) [nil nil a] [a b nil]))\n\n;; for big things a sparse vector class would be better\n(defn- vectorize\n \"Convert an associative-by-numeric-index collection into\n an equivalent vector, with nil for any missing keys\"\n [m]\n (when (seq m)\n (reduce\n (fn [result [k v]] (assoc result k v))\n (vec (repeat (apply max (keys m)) nil))\n m)))\n\n(defn- diff-associative-key\n \"Diff associative things a and b, comparing only the key k.\"\n [a b k]\n (let [va (get a k)\n vb (get b k)\n [a* b* ab] (diff va vb)\n in-a (contains? a k)\n in-b (contains? b k)\n same (and in-a in-b\n (or (not (nil? ab))\n (and (nil? va) (nil? vb))))]\n [(when (and in-a (or (not (nil? a*)) (not same))) {k a*})\n (when (and in-b (or (not (nil? b*)) (not same))) {k b*})\n (when same {k ab})\n ]))\n\n(defn- diff-associative\n \"Diff associative things a and b, comparing only keys in ks.\"\n [a b ks]\n (reduce\n (fn [diff1 diff2]\n (doall (map merge diff1 diff2)))\n [nil nil nil]\n (map\n (partial diff-associative-key a b)\n ks)))\n\n(defn- diff-sequential\n [a b]\n (vec (map vectorize (diff-associative\n (if (vector? a) a (vec a))\n (if (vector? b) b (vec b))\n (range (max (count a) (count b)))))))\n\n(defprotocol ^{:added \"1.3\"} EqualityPartition\n \"Implementation detail. Subject to change.\"\n (^{:added \"1.3\"} equality-partition [x] \"Implementation detail. Subject to change.\"))\n\n(defprotocol ^{:added \"1.3\"} Diff\n \"Implementation detail. Subject to change.\"\n (^{:added \"1.3\"} diff-similar [a b] \"Implementation detail. Subject to change.\"))\n\n(extend nil\n Diff\n {:diff-similar atom-diff})\n\n(extend Object\n Diff\n {:diff-similar (fn [a b] ((if (.. a getClass isArray) diff-sequential atom-diff) a b))}\n EqualityPartition\n {:equality-partition (fn [x] (if (.. x getClass isArray) :sequential :atom))})\n\n(extend-protocol EqualityPartition\n nil\n (equality-partition [x] :atom)\n \n java.util.Set\n (equality-partition [x] :set)\n\n java.util.List\n (equality-partition [x] :sequential)\n \n java.util.Map\n (equality-partition [x] :map))\n\n(defn- as-set-value\n [s]\n (if (set? s) s (into #{} s)))\n\n(extend-protocol Diff\n java.util.Set\n (diff-similar\n [a b]\n (let [aval (as-set-value a)\n bval (as-set-value b)]\n [(not-empty (set/difference aval bval))\n (not-empty (set/difference bval aval))\n (not-empty (set/intersection aval bval))]))\n \n java.util.List\n (diff-similar [a b]\n (diff-sequential a b))\n \n java.util.Map\n (diff-similar [a b]\n (diff-associative a b (set/union (keys a) (keys b)))))\n\n(defn diff\n \"Recursively compares a and b, returning a tuple of\n [things-only-in-a things-only-in-b things-in-both].\n Comparison rules:\n\n * For equal a and b, return [nil nil a].\n * Maps are subdiffed where keys match and values differ.\n * Sets are never subdiffed.\n * All sequential things are treated as associative collections\n by their indexes, with results returned as vectors.\n * Everything else (including strings!) is treated as\n an atom and compared for equality.\"\n {:added \"1.3\"}\n [a b]\n (if (= a b)\n [nil nil a]\n (if (= (equality-partition a) (equality-partition b))\n (diff-similar a b)\n (atom-diff a b))))\n \n" }, { "path": "src/clj/clojure/edn.clj", "content": "; Copyright (c) Rich Hickey. All rights reserved.\n; The use and distribution terms for this software are covered by the\n; Eclipse Public License 1.0 (http://opensource.org/licenses/eclipse-1.0.php)\n; which can be found in the file epl-v10.html at the root of this distribution.\n; By using this software in any fashion, you are agreeing to be bound by\n; the terms of this license.\n; You must not remove this notice, or any other, from this software.\n\n(ns ^{:doc \"edn reading.\"\n :author \"Rich Hickey\"}\n clojure.edn\n (:refer-clojure :exclude [read read-string]))\n\n(defn read\n \"Reads the next object from stream, which must be an instance of\n java.io.PushbackReader or some derivee. stream defaults to the\n current value of *in*.\n\n Reads data in the edn format (subset of Clojure data):\n http://edn-format.org\n\n opts is a map that can include the following keys:\n :eof - value to return on end-of-file. When not supplied, eof throws an exception.\n :readers - a map of tag symbols to data-reader functions to be considered before default-data-readers.\n When not supplied, only the default-data-readers will be used.\n :default - A function of two args, that will, if present and no reader is found for a tag,\n be called with the tag and the value.\"\n \n {:added \"1.5\"}\n ([]\n (read *in*))\n ([stream]\n (read {} stream))\n ([opts stream]\n (clojure.lang.EdnReader/read stream opts)))\n\n(defn read-string\n \"Reads one object from the string s. Returns nil when s is nil or empty.\n\n Reads data in the edn format (subset of Clojure data):\n http://edn-format.org\n\n opts is a map as per clojure.edn/read\"\n {:added \"1.5\"}\n ([s] (read-string {:eof nil} s))\n ([opts s] (when s (clojure.lang.EdnReader/readString s opts))))" }, { "path": "src/clj/clojure/genclass.clj", "content": "; Copyright (c) Rich Hickey. All rights reserved.\n; The use and distribution terms for this software are covered by the\n; Eclipse Public License 1.0 (http://opensource.org/licenses/eclipse-1.0.php)\n; which can be found in the file epl-v10.html at the root of this distribution.\n; By using this software in any fashion, you are agreeing to be bound by\n; the terms of this license.\n; You must not remove this notice, or any other, from this software.\n\n(in-ns 'clojure.core)\n\n(import '(java.lang.reflect Modifier Constructor)\n '(clojure.asm ClassWriter ClassVisitor Opcodes Type)\n '(clojure.asm.commons Method GeneratorAdapter)\n '(clojure.lang IPersistentMap Compiler Compiler$HostExpr))\n\n;(defn method-sig [^java.lang.reflect.Method meth]\n; [(. meth (getName)) (seq (. meth (getParameterTypes)))])\n\n(defn- filter-methods [^Class c invalid-method?]\n (loop [mm {}\n considered #{}\n c c]\n (if c\n (let [[mm considered]\n (loop [mm mm\n considered considered\n meths (seq (concat\n (seq (. c (getDeclaredMethods)))\n (seq (. c (getMethods)))))]\n (if meths\n (let [^java.lang.reflect.Method meth (first meths)\n mods (. meth (getModifiers))\n mk (method-sig meth)]\n (if (or (considered mk)\n (invalid-method? meth))\n (recur mm (conj considered mk) (next meths))\n (recur (assoc mm mk meth) (conj considered mk) (next meths))))\n [mm considered]))]\n (recur mm considered (. c (getSuperclass))))\n mm)))\n\n(defn- non-private-methods [^Class c]\n (let [not-overridable? (fn [^java.lang.reflect.Method meth]\n (let [mods (. meth (getModifiers))]\n (or (not (or (Modifier/isPublic mods) (Modifier/isProtected mods)))\n (. Modifier (isStatic mods))\n (. Modifier (isFinal mods))\n (= \"finalize\" (.getName meth)))))]\n (filter-methods c not-overridable?)))\n\n(defn- protected-final-methods [^Class c]\n (let [not-exposable? (fn [^java.lang.reflect.Method meth]\n (let [mods (. meth (getModifiers))]\n (not (and (Modifier/isProtected mods)\n (Modifier/isFinal mods)\n (not (Modifier/isStatic mods))))))]\n (filter-methods c not-exposable?)))\n\n(defn- ctor-sigs [^Class super]\n (for [^Constructor ctor (. super (getDeclaredConstructors))\n :when (not (. Modifier (isPrivate (. ctor (getModifiers)))))]\n (apply vector (. ctor (getParameterTypes)))))\n\n(defn- escape-class-name [^Class c]\n (.. (.getSimpleName c) \n (replace \"[]\" \"<>\")))\n\n(defn- overload-name [mname pclasses]\n (if (seq pclasses)\n (apply str mname (interleave (repeat \\-) \n (map escape-class-name pclasses)))\n (str mname \"-void\")))\n\n(defn- ^java.lang.reflect.Field find-field [^Class c f]\n (let [start-class c]\n (loop [c c]\n (if (= c Object)\n (throw (new Exception (str \"field, \" f \", not defined in class, \" start-class \", or its ancestors\")))\n (let [dflds (.getDeclaredFields c)\n rfld (first (filter #(= f (.getName ^java.lang.reflect.Field %)) dflds))]\n (or rfld (recur (.getSuperclass c))))))))\n\n;(distinct (map first(keys (mapcat non-private-methods [Object IPersistentMap]))))\n\n(def ^{:private true} prim->class\n {'int Integer/TYPE\n 'ints (Class/forName \"[I\")\n 'long Long/TYPE\n 'longs (Class/forName \"[J\")\n 'float Float/TYPE\n 'floats (Class/forName \"[F\")\n 'double Double/TYPE\n 'doubles (Class/forName \"[D\")\n 'void Void/TYPE\n 'short Short/TYPE\n 'shorts (Class/forName \"[S\")\n 'boolean Boolean/TYPE\n 'booleans (Class/forName \"[Z\")\n 'byte Byte/TYPE\n 'bytes (Class/forName \"[B\")\n 'char Character/TYPE\n 'chars (Class/forName \"[C\")})\n\n(defn- ^Class the-class [x] \n (cond \n (class? x) x\n (contains? prim->class x) (prim->class x)\n :else (let [strx (str x)]\n (clojure.lang.RT/classForName \n (if (some #{\\. \\[} strx)\n strx\n (str \"java.lang.\" strx))))))\n\n;; someday this can be made codepoint aware\n(defn- valid-java-method-name\n [^String s]\n (= s (clojure.lang.Compiler/munge s)))\n\n(defn- validate-generate-class-options\n [{:keys [methods]}]\n (let [[mname] (remove valid-java-method-name (map (comp str first) methods))]\n (when mname (throw (IllegalArgumentException. (str \"Not a valid method name: \" mname))))))\n\n(defn- generate-class [options-map]\n (validate-generate-class-options options-map)\n (let [default-options {:prefix \"-\" :load-impl-ns true :impl-ns (ns-name *ns*)}\n {:keys [name extends implements constructors methods main factory state init exposes \n exposes-methods prefix load-impl-ns impl-ns post-init]} \n (merge default-options options-map)\n name-meta (meta name)\n name (str name)\n package-name (subs name 0 (.lastIndexOf name \".\"))\n class-name (subs name (inc (.lastIndexOf name \".\")))\n super (if extends (the-class extends) Object)\n interfaces (map the-class implements)\n supers (cons super interfaces)\n ctor-sig-map (or constructors (zipmap (ctor-sigs super) (ctor-sigs super)))\n cv (new ClassWriter (. ClassWriter COMPUTE_MAXS))\n cname (. name (replace \".\" \"/\"))\n pkg-name name\n impl-pkg-name (str impl-ns)\n impl-cname (.. impl-pkg-name (replace \".\" \"/\") (replace \\- \\_))\n ctype (. Type (getObjectType cname))\n iname (fn [^Class c] (.. Type (getType c) (getInternalName)))\n totype (fn [^Class c] (. Type (getType c)))\n to-types (fn [cs] (if (pos? (count cs))\n (into-array (map totype cs))\n (make-array Type 0)))\n obj-type ^Type (totype Object)\n arg-types (fn [n] (if (pos? n)\n (into-array (replicate n obj-type))\n (make-array Type 0)))\n super-type ^Type (totype super)\n init-name (str init)\n post-init-name (str post-init)\n factory-name (str factory)\n state-name (str state)\n main-name \"main\"\n var-name (fn [s] (clojure.lang.Compiler/munge (str s \"__var\")))\n class-type (totype Class)\n rt-type (totype clojure.lang.RT)\n var-type ^Type (totype clojure.lang.Var)\n ifn-type (totype clojure.lang.IFn)\n iseq-type (totype clojure.lang.ISeq)\n ex-type (totype java.lang.UnsupportedOperationException)\n all-sigs (distinct (concat (map #(let[[m p] (key %)] {m [p]}) (mapcat non-private-methods supers))\n (map (fn [[m p]] {(str m) [p]}) methods)))\n sigs-by-name (apply merge-with concat {} all-sigs)\n overloads (into1 {} (filter (fn [[m s]] (next s)) sigs-by-name))\n var-fields (concat (when init [init-name]) \n (when post-init [post-init-name])\n (when main [main-name])\n ;(when exposes-methods (map str (vals exposes-methods)))\n (distinct (concat (keys sigs-by-name)\n (mapcat (fn [[m s]] (map #(overload-name m (map the-class %)) s)) overloads)\n (mapcat (comp (partial map str) vals val) exposes))))\n emit-get-var (fn [^GeneratorAdapter gen v]\n (let [false-label (. gen newLabel)\n end-label (. gen newLabel)]\n (. gen getStatic ctype (var-name v) var-type)\n (. gen dup)\n (. gen invokeVirtual var-type (. Method (getMethod \"boolean isBound()\")))\n (. gen ifZCmp (. GeneratorAdapter EQ) false-label)\n (. gen invokeVirtual var-type (. Method (getMethod \"Object get()\")))\n (. gen goTo end-label)\n (. gen mark false-label)\n (. gen pop)\n (. gen visitInsn (. Opcodes ACONST_NULL))\n (. gen mark end-label)\n (Compiler/emitSource \"value = null;\")\n (Compiler/emitSource (str \"if (\" (var-name v) \".isBound()) {\"))\n (Compiler/tab)\n (Compiler/emitSource (str \"value = \" (var-name v) \".get();\"))\n (Compiler/untab)\n (Compiler/emitSource \"}\")))\n emit-unsupported (fn [^GeneratorAdapter gen ^Method m]\n (let [msg (str (. m (getName)) \" (\"\n impl-pkg-name \"/\" prefix (.getName m)\n \" not defined?)\")]\n (Compiler/emitSource (str \"throw new \" (Compiler/printClass ex-type) \"(\\\"\" msg \"\\\");\"))\n (. gen (throwException ex-type msg))))\n emit-forwarding-method\n (fn [name pclasses rclass exclasses as-static else-gen]\n (let [mname (str name)\n pmetas (map meta pclasses)\n pclasses (map the-class pclasses)\n rclass (the-class rclass)\n ptypes (to-types pclasses)\n rtype ^Type (totype rclass)\n m (new Method mname rtype ptypes)\n is-overload (seq (overloads mname))\n gen (new GeneratorAdapter (+ (. Opcodes ACC_PUBLIC) (if as-static (. Opcodes ACC_STATIC) 0))\n m nil nil cv)\n found-label (. gen (newLabel))\n else-label (. gen (newLabel))\n end-label (. gen (newLabel))\n rvoid (= (. rtype (getSort)) (. Type VOID))]\n (add-annotations gen (meta name))\n (dotimes [i (count pmetas)]\n (add-annotations gen (nth pmetas i) i))\n (Compiler/emitSource (str \"public \" (if as-static \"static \" \"\") (Compiler/printClass rclass) \" \" mname\n \"(\" (reduce1 str (interpose \", \" (map #(str (Compiler/printClass\n (nth pclasses %)) \" p\" %) (range (count pclasses)))))\n \")\" (if (empty? exclasses) \"\" (str \" throws \"\n (reduce1 str (interpose \", \"\n (map #(Compiler/printClass %) exclasses))))) \" {\"))\n (Compiler/tab)\n (. gen (visitCode))\n (Compiler/emitSource \"Object value = null;\")\n (if (> (count pclasses) 18)\n (else-gen gen m)\n (do\n (when is-overload\n ; TODO ?\n (emit-get-var gen (overload-name mname pclasses))\n (. gen (dup))\n (. gen (ifNonNull found-label))\n (. gen (pop)))\n (emit-get-var gen mname)\n (. gen (dup))\n (Compiler/emitSource (str \"if (value != null) {\"))\n (Compiler/tab)\n (. gen (ifNull else-label))\n (when is-overload\n (. gen (mark found-label)))\n ;if found\n (.checkCast gen ifn-type)\n (when-not as-static\n (. gen (loadThis)))\n ;box args\n (Compiler/emitSource (str (if rvoid \"\" \"return \")\n (Compiler/unboxVal\n rclass (str \"((IFn)value).invoke(\"\n (reduce1\n str (interpose\n \", \"\n (map #(do\n (. gen (loadArg %))\n (. clojure.lang.Compiler$HostExpr (emitBoxReturn nil gen (nth pclasses %) (str \"p\" %))))\n (range (count ptypes))))) \")\")) \";\"))\n\n ;call fn\n (. gen (invokeInterface ifn-type (new Method \"invoke\" obj-type\n (to-types (replicate (+ (count ptypes)\n (if as-static 0 1))\n Object)))))\n ;(into-array (cons obj-type\n ; (replicate (count ptypes) obj-type))))))\n ;unbox return\n (. gen (unbox rtype))\n (when rvoid\n (. gen (pop)))\n (. gen (goTo end-label))\n\n ;else call supplied alternative generator\n (. gen (mark else-label))\n (. gen (pop))\n (Compiler/untab)\n (Compiler/emitSource \"} else {\")\n (Compiler/tab)\n\n (else-gen gen m)\n\n (Compiler/untab)\n (Compiler/emitSource \"}\")\n\n (. gen (mark end-label))))\n (Compiler/untab)\n (Compiler/emitSource \"}\")\n (. gen (returnValue))\n (. gen (endMethod))))\n ]\n (binding [*source-writer* (.getSc cv)]\n (Compiler/emitSource (str \"package \" package-name \";\"))\n (Compiler/emitSource)\n (Compiler/emitSource (str \"import clojure.lang.*;\"))\n (Compiler/emitSource)\n ;start class definition\n (. cv (visit (. Opcodes V1_5) (+ (. Opcodes ACC_PUBLIC) (. Opcodes ACC_SUPER))\n cname nil (iname super)\n (when-let [ifc (seq interfaces)]\n (into-array (map iname ifc)))))\n\n ; class annotations\n (add-annotations cv name-meta)\n (Compiler/emitSource (str \"public class \" class-name \" extends \" (Compiler/printClass super)\n (if (empty? interfaces) \"\" (str \" implements \" (apply str (interpose \", \" (map #(Compiler/printClass %) interfaces))))) \" {\"))\n (Compiler/tab)\n\n ;static fields for vars\n (doseq [v var-fields]\n (. cv (visitField (+ (. Opcodes ACC_PRIVATE) (. Opcodes ACC_FINAL) (. Opcodes ACC_STATIC))\n (var-name v)\n (. var-type getDescriptor)\n nil nil))\n (Compiler/emitSource (str \"private final static Var \" (var-name v) \";\")))\n\n ;instance field for state\n (when state\n (. cv (visitField (+ (. Opcodes ACC_PUBLIC) (. Opcodes ACC_FINAL))\n state-name\n (. obj-type getDescriptor)\n nil nil))\n (Compiler/emitSource (str \"public final Object \" state-name \";\")))\n\n ;static init to set up var fields and load init\n (let [gen (new GeneratorAdapter (+ (. Opcodes ACC_PUBLIC) (. Opcodes ACC_STATIC))\n (. Method getMethod \"void ()\")\n nil nil cv)]\n (Compiler/emitSource \"static {\")\n (Compiler/tab)\n (. gen (visitCode))\n (doseq [v var-fields]\n (. gen push impl-pkg-name)\n (. gen push (str prefix v))\n (. gen (invokeStatic var-type (. Method (getMethod \"clojure.lang.Var internPrivate(String,String)\"))))\n (. gen putStatic ctype (var-name v) var-type)\n (Compiler/emitSource (str (var-name v) \" = Var.internPrivate(\\\"\" impl-pkg-name \"\\\", \\\"\" (str prefix v) \"\\\");\")))\n\n (when load-impl-ns\n (. gen push \"clojure.core\")\n (. gen push \"load\")\n (. gen (invokeStatic rt-type (. Method (getMethod \"clojure.lang.Var var(String,String)\"))))\n (. gen push (str \"/\" impl-cname))\n (. gen (invokeInterface ifn-type (new Method \"invoke\" obj-type (to-types [Object]))))\n ; (. gen push (str (.replace impl-pkg-name \\- \\_) \"__init\"))\n ; (. gen (invokeStatic class-type (. Method (getMethod \"Class forName(String)\"))))\n (. gen pop)\n (Compiler/emitSource (str \"RT.var(\\\"clojure.core\\\", \" \"\\\"load\\\").invoke(\\\"\" (str \"/\" impl-cname) \"\\\");\")))\n\n (Compiler/untab)\n (Compiler/emitSource \"}\")\n (. gen (returnValue))\n (. gen (endMethod)))\n\n ;ctors\n (doseq [[pclasses super-pclasses] ctor-sig-map]\n (let [constructor-annotations (meta pclasses)\n pclasses (map the-class pclasses)\n super-pclasses (map the-class super-pclasses)\n ptypes (to-types pclasses)\n super-ptypes (to-types super-pclasses)\n m (new Method \"\" (. Type VOID_TYPE) ptypes)\n super-m (new Method \"\" (. Type VOID_TYPE) super-ptypes)\n gen (new GeneratorAdapter (. Opcodes ACC_PUBLIC) m nil nil cv)\n _ (add-annotations gen constructor-annotations)\n no-init-label (. gen newLabel)\n end-label (. gen newLabel)\n no-post-init-label (. gen newLabel)\n end-post-init-label (. gen newLabel)\n nth-method (. Method (getMethod \"Object nth(Object,int)\"))\n local (. gen newLocal obj-type)]\n (. gen (visitCode))\n (Compiler/emitSource (str \"public \" class-name \"(\"\n (reduce1 str (interpose \", \" (map #(str (Compiler/printClass\n (nth pclasses %)) \" p\" %) (range (count pclasses))))) \") {\"))\n ; TODO init and post-init\n (comment (Compiler/tab)\n (Compiler/emitSource \"Object value = null;\"))\n (if init\n (do\n (Compiler/emitSource \"{\")\n (Compiler/tab)\n (emit-get-var gen init-name)\n (. gen dup)\n (. gen ifNull no-init-label)\n (Compiler/emitSource \"if (value != null) {\")\n (Compiler/tab)\n (.checkCast gen ifn-type)\n ;box init args\n (Compiler/emitSource\n (str \"final Object found = RT.nth(((IFn)value).invoke(\"\n (reduce1 str\n (interpose \", \"\n (map #(do\n (. gen (loadArg %))\n (. clojure.lang.Compiler$HostExpr\n (emitBoxReturn nil gen (nth pclasses %) (str \"p\" %))))\n (range (count pclasses))))) \"), 0);\"))\n ;call init fn\n (. gen (invokeInterface ifn-type (new Method \"invoke\" obj-type\n (arg-types (count ptypes)))))\n ;expecting [[super-ctor-args] state] returned\n (. gen dup)\n (. gen push (int 0))\n (. gen (invokeStatic rt-type nth-method))\n (. gen storeLocal local)\n\n (. gen (loadThis))\n (. gen dupX1)\n (Compiler/emitSource\n (str \"super(\"\n (reduce1 str\n (interpose \", \"\n (map #(do\n (. gen loadLocal local)\n (. gen push (int %))\n (. gen (invokeStatic rt-type nth-method))\n (. clojure.lang.Compiler$HostExpr (emitUnboxArg nil gen (nth super-pclasses %)\n (str \"RT.nth(\" \"found\" \", \" % \")\"))))\n (range (count super-pclasses))))) \");\"))\n (. gen (invokeConstructor super-type super-m))\n\n (if state\n (do\n (Compiler/emitSource (str state-name \" = RT.nth(\" \"found\" \", 1);\"))\n (. gen push (int 1))\n (. gen (invokeStatic rt-type nth-method))\n (. gen (putField ctype state-name obj-type)))\n (. gen pop))\n\n (. gen goTo end-label)\n ;no init found\n (Compiler/untab)\n (Compiler/emitSource \"} else {\")\n (Compiler/tab)\n (. gen mark no-init-label)\n (let [msg (str impl-pkg-name \"/\" prefix init-name \" not defined\")]\n (. gen (throwException ex-type msg))\n (Compiler/emitSource (str \"throw new \" (Compiler/printClass ex-type) \"(\\\"\" msg \"\\\");\")))\n (. gen mark end-label)\n (Compiler/untab)\n (Compiler/emitSource \"}\")\n (Compiler/untab)\n (Compiler/emitSource \"}\"))\n (if (= pclasses super-pclasses)\n (do\n (. gen (loadThis))\n (. gen (loadArgs))\n (. gen (invokeConstructor super-type super-m))\n (Compiler/emitSource (str \"super(\" (reduce1 str (interpose \", \" (map #(str \"p\" %) (range (count pclasses))))) \");\")))\n (throw (new Exception \":init not specified, but ctor and super ctor args differ\"))))\n\n (when post-init\n (Compiler/emitSource \"{\")\n (Compiler/tab)\n (emit-get-var gen post-init-name)\n (. gen dup)\n (Compiler/emitSource \"if (value != null) {\")\n (Compiler/tab)\n (. gen ifNull no-post-init-label)\n (.checkCast gen ifn-type)\n (. gen (loadThis))\n ;box init args\n (Compiler/emitSource\n (str \"((IFn)value).invoke(\"\n (reduce1 str\n (interpose \", \"\n (map #(do\n (. gen (loadArg %))\n (. clojure.lang.Compiler$HostExpr (emitBoxReturn nil gen (nth pclasses %) (str \"p\" %))))\n (range (count pclasses))))) \")\"))\n ;call init fn\n (. gen (invokeInterface ifn-type (new Method \"invoke\" obj-type\n (arg-types (inc (count ptypes))))))\n (. gen pop)\n (. gen goTo end-post-init-label)\n ;no init found\n (. gen mark no-post-init-label)\n (Compiler/untab)\n (Compiler/emitSource \"} else {\")\n (let [msg (str impl-pkg-name \"/\" prefix post-init-name \" not defined\")]\n (Compiler/emitSource (str \"throw new \" (Compiler/printClass ex-type) \"(\\\"\" msg \"\\\");\"))\n (. gen (throwException ex-type msg)))\n (Compiler/untab)\n (Compiler/emitSource \"}\")\n (Compiler/untab)\n (Compiler/emitSource \"}\")\n (. gen mark end-post-init-label))\n\n (. gen (returnValue))\n (. gen (endMethod))\n (Compiler/untab)\n (Compiler/emitSource \"}\")\n ;factory\n (when factory\n (let [fm (new Method factory-name ctype ptypes)\n gen (new GeneratorAdapter (+ (. Opcodes ACC_PUBLIC) (. Opcodes ACC_STATIC))\n fm nil nil cv)]\n (Compiler/emitSource (str \"public static \" (Compiler/printClass ctype) \" \" factory-name \"(\"\n (reduce1 str (interpose \", \" (map #(str (Compiler/printClass\n (nth pclasses %)) \" p\" %) (range (count pclasses)))))\n \") {\"))\n (Compiler/tab)\n (. gen (visitCode))\n (. gen newInstance ctype)\n (. gen dup)\n (. gen (loadArgs))\n (. gen (invokeConstructor ctype m))\n (Compiler/emitSource (str \"return new \" (Compiler/printClass ctype) \"(\"\n (reduce1 str (interpose \", \" (map #(str \"p\" %) (range (count pclasses))))) \");\"))\n (Compiler/untab)\n (Compiler/emitSource \"}\")\n (. gen (returnValue))\n (. gen (endMethod))))))\n\n ;add methods matching supers', if no fn -> call super\n (let [mm (non-private-methods super)]\n (doseq [^java.lang.reflect.Method meth (vals mm)]\n (emit-forwarding-method (.getName meth) (.getParameterTypes meth) (.getReturnType meth) (.getExceptionTypes meth) false\n (fn [^GeneratorAdapter gen ^Method m]\n (. gen (loadThis))\n ;push args\n (. gen (loadArgs))\n ;call super\n (. gen (visitMethodInsn (. Opcodes INVOKESPECIAL)\n (. super-type (getInternalName))\n (. m (getName))\n (. m (getDescriptor))))\n (let [pclasses (map the-class (.getParameterTypes meth))\n rclass (the-class (.getReturnType meth))\n rtype ^Type (totype rclass)\n rvoid (= (. rtype (getSort)) (. Type VOID))]\n (Compiler/emitSource (str (if rvoid \"\" \"return \") \"super.\" (.getName m)\n \"(\" (reduce1 str (interpose \", \" (map #(str \"p\" %) (range (count pclasses))))) \");\"))))))\n ;add methods matching interfaces', if no fn -> throw\n (reduce1 (fn [mm ^java.lang.reflect.Method meth]\n (if (contains? mm (method-sig meth))\n mm\n (do\n (emit-forwarding-method (.getName meth) (.getParameterTypes meth) (.getReturnType meth) (.getExceptionTypes meth) false\n emit-unsupported)\n (assoc mm (method-sig meth) meth))))\n mm (mapcat #(.getMethods ^Class %) interfaces))\n ;extra methods\n (doseq [[mname pclasses rclass :as msig] methods]\n (emit-forwarding-method mname pclasses rclass nil (:static (meta msig))\n emit-unsupported))\n ;expose specified overridden superclass methods\n (doseq [[local-mname ^java.lang.reflect.Method m] (reduce1 (fn [ms [[name _ _] m]]\n (if (contains? exposes-methods (symbol name))\n (conj ms [((symbol name) exposes-methods) m])\n ms)) [] (concat (seq mm)\n (seq (protected-final-methods super))))]\n (let [pclasses (.getParameterTypes m)\n ptypes (to-types pclasses)\n rtype (totype (.getReturnType m))\n rvoid (= (. rtype (getSort)) (. Type VOID))\n exposer-m (new Method (str local-mname) rtype ptypes)\n target-m (new Method (.getName m) rtype ptypes)\n gen (new GeneratorAdapter (. Opcodes ACC_PUBLIC) exposer-m nil nil cv)]\n (Compiler/emitSource (str \"public \" (Compiler/printClass rtype) \" \" (.getName m) \"(\"\n (reduce1 str (interpose \", \" (map #(str (Compiler/printClass\n (nth pclasses %)) \" p\" %) (range (count pclasses))))) \") {\"))\n (Compiler/tab)\n (. gen (loadThis))\n (. gen (loadArgs))\n (. gen (visitMethodInsn (. Opcodes INVOKESPECIAL)\n (. super-type (getInternalName))\n (. target-m (getName))\n (. target-m (getDescriptor))))\n (Compiler/emitSource (str (if rvoid \"\" \"return \") \"super.\" (.getName target-m) \"(\"\n (reduce1 str (interpose \", \" (map #(str \"p\" %) (range (count pclasses))))) \");\"))\n (. gen (returnValue))\n (Compiler/untab)\n (Compiler/emitSource \"}\")\n (. gen (endMethod)))))\n ;main\n (when main\n (let [m (. Method getMethod \"void main (String[])\")\n gen (new GeneratorAdapter (+ (. Opcodes ACC_PUBLIC) (. Opcodes ACC_STATIC))\n m nil nil cv)\n no-main-label (. gen newLabel)\n end-label (. gen newLabel)]\n (. gen (visitCode))\n (Compiler/emitSource (str \"public static void main(String[] args) {\"))\n (Compiler/tab)\n (Compiler/emitSource \"Object value = null;\")\n (emit-get-var gen main-name)\n\n (Compiler/emitSource (str \"if (value != null) {\"))\n (Compiler/tab)\n (Compiler/emitSource (str \"((IFn)value).applyTo(RT.seq(args));\"))\n (Compiler/emitSource \"return;\")\n (Compiler/untab)\n (Compiler/emitSource \"}\")\n (. gen dup)\n (. gen ifNull no-main-label)\n (.checkCast gen ifn-type)\n (. gen loadArgs)\n (. gen (invokeStatic rt-type (. Method (getMethod \"clojure.lang.ISeq seq(Object)\"))))\n (. gen (invokeInterface ifn-type (new Method \"applyTo\" obj-type\n (into-array [iseq-type]))))\n (. gen pop)\n (. gen goTo end-label)\n ;no main found\n (. gen mark no-main-label)\n (let [msg (str impl-pkg-name \"/\" prefix main-name \" not defined\")]\n (Compiler/emitSource (str \"throw new \" (Compiler/printClass ex-type) \"(\\\"\" msg \"\\\");\"))\n (. gen (throwException ex-type msg)))\n (. gen mark end-label)\n (. gen (returnValue))\n (Compiler/untab)\n (Compiler/emitSource \"}\")\n (. gen (endMethod))))\n ;field exposers\n (doseq [[f {getter :get setter :set}] exposes]\n (let [fld (find-field super (str f))\n ftype (totype (.getType fld))\n static? (Modifier/isStatic (.getModifiers fld))\n acc (+ Opcodes/ACC_PUBLIC (if static? Opcodes/ACC_STATIC 0))]\n (when getter\n (let [m (new Method (str getter) ftype (to-types []))\n gen (new GeneratorAdapter acc m nil nil cv)]\n (Compiler/emitSource (str \"public \" (if static? \"static \" \"\") (Compiler/printClass ftype) \" \" (str getter) \"() {\"))\n (Compiler/tab)\n (. gen (visitCode))\n (Compiler/emitSource (str \"return \" f \";\"))\n (if static?\n (. gen getStatic ctype (str f) ftype)\n (do\n (. gen loadThis)\n (. gen getField ctype (str f) ftype)))\n (Compiler/untab)\n (Compiler/emitSource \"}\")\n (. gen (returnValue))\n (. gen (endMethod))))\n (when setter\n (let [m (new Method (str setter) Type/VOID_TYPE (into-array [ftype]))\n gen (new GeneratorAdapter acc m nil nil cv)]\n (Compiler/emitSource (str \"public \" (if static? \"static \" \"\") \"void \" (str setter) \"(\" (Compiler/printClass ftype) \" value) {\"))\n (Compiler/tab)\n (. gen (visitCode))\n (if static?\n (do\n (Compiler/emitSource (str (Compiler/printClass ctype) \".\" f \" = value;\"))\n (. gen loadArgs)\n (. gen putStatic ctype (str f) ftype))\n (do\n (Compiler/emitSource (str \"this.\" f \" = value;\"))\n (. gen loadThis)\n (. gen loadArgs)\n (. gen putField ctype (str f) ftype)))\n (Compiler/untab)\n (Compiler/emitSource \"}\")\n (. gen (returnValue))\n (. gen (endMethod))))))\n ;finish class def\n (. cv (visitEnd))\n (Compiler/untab)\n (Compiler/emitSource \"}\")\n (Compiler/writeSourceFile cname (str *source-writer*))\n [cname (. cv (toByteArray))])))\n\n(defmacro gen-class\n \"When compiling, generates compiled bytecode for a class with the\n given package-qualified :name (which, as all names in these\n parameters, can be a string or symbol), and writes the .class file\n to the *compile-path* directory. When not compiling, does\n nothing. The gen-class construct contains no implementation, as the\n implementation will be dynamically sought by the generated class in\n functions in an implementing Clojure namespace. Given a generated\n class org.mydomain.MyClass with a method named mymethod, gen-class\n will generate an implementation that looks for a function named by\n (str prefix mymethod) (default prefix: \\\"-\\\") in a\n Clojure namespace specified by :impl-ns\n (defaults to the current namespace). All inherited methods,\n generated methods, and init and main functions (see :methods, :init,\n and :main below) will be found similarly prefixed. By default, the\n static initializer for the generated class will attempt to load the\n Clojure support code for the class as a resource from the classpath,\n e.g. in the example case, ``org/mydomain/MyClass__init.class``. This\n behavior can be controlled by :load-impl-ns\n\n Note that methods with a maximum of 18 parameters are supported.\n\n In all subsequent sections taking types, the primitive types can be\n referred to by their Java names (int, float etc), and classes in the\n java.lang package can be used without a package qualifier. All other\n classes must be fully qualified.\n\n Options should be a set of key/value pairs, all except for :name are optional:\n\n :name aname\n\n The package-qualified name of the class to be generated\n\n :extends aclass\n\n Specifies the superclass, the non-private methods of which will be\n overridden by the class. If not provided, defaults to Object.\n\n :implements [interface ...]\n\n One or more interfaces, the methods of which will be implemented by the class.\n\n :init name\n\n If supplied, names a function that will be called with the arguments\n to the constructor. Must return [ [superclass-constructor-args] state]\n If not supplied, the constructor args are passed directly to\n the superclass constructor and the state will be nil\n\n :constructors {[param-types] [super-param-types], ...}\n\n By default, constructors are created for the generated class which\n match the signature(s) of the constructors for the superclass. This\n parameter may be used to explicitly specify constructors, each entry\n providing a mapping from a constructor signature to a superclass\n constructor signature. When you supply this, you must supply an :init\n specifier.\n\n :post-init name\n\n If supplied, names a function that will be called with the object as\n the first argument, followed by the arguments to the constructor.\n It will be called every time an object of this class is created,\n immediately after all the inherited constructors have completed.\n Its return value is ignored.\n\n :methods [ [name [param-types] return-type], ...]\n\n The generated class automatically defines all of the non-private\n methods of its superclasses/interfaces. This parameter can be used\n to specify the signatures of additional methods of the generated\n class. Static methods can be specified with ^{:static true} in the\n signature's metadata. Do not repeat superclass/interface signatures\n here.\n\n :main boolean\n\n If supplied and true, a static public main function will be generated. It will\n pass each string of the String[] argument as a separate argument to\n a function called (str prefix main).\n\n :factory name\n\n If supplied, a (set of) public static factory function(s) will be\n created with the given name, and the same signature(s) as the\n constructor(s).\n\n :state name\n\n If supplied, a public final instance field with the given name will be\n created. You must supply an :init function in order to provide a\n value for the state. Note that, though final, the state can be a ref\n or agent, supporting the creation of Java objects with transactional\n or asynchronous mutation semantics.\n\n :exposes {protected-field-name {:get name :set name}, ...}\n\n Since the implementations of the methods of the generated class\n occur in Clojure functions, they have no access to the inherited\n protected fields of the superclass. This parameter can be used to\n generate public getter/setter methods exposing the protected field(s)\n for use in the implementation.\n\n :exposes-methods {super-method-name exposed-name, ...}\n\n It is sometimes necessary to call the superclass' implementation of an\n overridden method. Those methods may be exposed and referred in\n the new method implementation by a local name.\n\n :prefix string\n\n Default: \\\"-\\\" Methods called e.g. Foo will be looked up in vars called\n prefixFoo in the implementing ns.\n\n :impl-ns name\n\n Default: the name of the current ns. Implementations of methods will be\n looked up in this namespace.\n\n :load-impl-ns boolean\n\n Default: true. Causes the static initializer for the generated class\n to reference the load code for the implementing namespace. Should be\n true when implementing-ns is the default, false if you intend to\n load the code via some other method.\"\n {:added \"1.0\"}\n\n [& options]\n (when *compile-files*\n (let [options-map (into1 {} (map vec (partition 2 options)))\n [cname bytecode] (generate-class options-map)]\n (Compiler/writeClassFile cname bytecode))))\n\n;;;;;;;;;;;;;;;;;;;; gen-interface ;;;;;;;;;;;;;;;;;;;;;;\n;; based on original contribution by Chris Houser\n\n(defn- ^Type asm-type\n \"Returns an asm Type object for c, which may be a primitive class\n (such as Integer/TYPE), any other class (such as Double), or a\n fully-qualified class name given as a string or symbol\n (such as 'java.lang.String)\"\n [c]\n (if (or (instance? Class c) (prim->class c))\n (Type/getType (the-class c))\n (let [strx (str c)]\n (Type/getObjectType\n (.replace (if (some #{\\. \\[} strx)\n strx\n (str \"java.lang.\" strx))\n \".\" \"/\")))))\n\n(defn- generate-interface\n [{:keys [name extends methods]}]\n (when (some #(-> % first clojure.core/name (.contains \"-\")) methods)\n (throw\n (IllegalArgumentException. \"Interface methods must not contain '-'\")))\n (let [sname (str name)\n iname (.replace sname \".\" \"/\")\n cv (ClassWriter. ClassWriter/COMPUTE_MAXS)\n lastdot (.lastIndexOf sname \".\")\n classname (subs sname (inc lastdot))\n packagename (subs sname 0 lastdot)]\n (binding [*source-writer* (.getSc cv)]\n (Compiler/emitSource (str \"package \" packagename \";\"))\n (Compiler/emitSource)\n (Compiler/emitSource (str \"public interface \" classname \" {\"))\n (Compiler/tab)\n (. cv visit Opcodes/V1_5 (+ Opcodes/ACC_PUBLIC\n Opcodes/ACC_ABSTRACT\n Opcodes/ACC_INTERFACE)\n iname nil \"java/lang/Object\"\n (when (seq extends)\n (into-array (map #(.getInternalName (asm-type %)) extends))))\n (add-annotations cv (meta name))\n (doseq [[mname pclasses rclass pmetas] methods]\n (Compiler/emitSource (str\n (Compiler$HostExpr/tagToCanonical rclass)\n \" \" (str mname) \"(\"\n (let [names (map #(str (let [c (nth pclasses %)]\n (Compiler$HostExpr/tagToCanonical c)) \" p\" %) (range (count pclasses)))]\n (apply str (interpose \", \" names)))\n \");\"))\n (let [mv (. cv visitMethod (+ Opcodes/ACC_PUBLIC Opcodes/ACC_ABSTRACT)\n (str mname)\n (Type/getMethodDescriptor (asm-type rclass)\n (if pclasses\n (into-array Type (map asm-type pclasses))\n (make-array Type 0)))\n nil nil)]\n (add-annotations mv (meta mname))\n (dotimes [i (count pmetas)]\n (add-annotations mv (nth pmetas i) i))\n (. mv visitEnd)))\n (. cv visitEnd)\n (Compiler/untab)\n (Compiler/emitSource \"}\")\n (when *compile-files*\n (Compiler/writeSourceFile iname (str *source-writer*)))\n [iname (. cv toByteArray)])))\n\n(defmacro gen-interface\n \"When compiling, generates compiled bytecode for an interface with\n the given package-qualified :name (which, as all names in these\n parameters, can be a string or symbol), and writes the .class file\n to the *compile-path* directory. When not compiling, does nothing.\n\n In all subsequent sections taking types, the primitive types can be\n referred to by their Java names (int, float etc), and classes in the\n java.lang package can be used without a package qualifier. All other\n classes must be fully qualified.\n\n Options should be a set of key/value pairs, all except for :name are\n optional:\n\n :name aname\n\n The package-qualified name of the class to be generated\n\n :extends [interface ...]\n\n One or more interfaces, which will be extended by this interface.\n\n :methods [ [name [param-types] return-type], ...]\n\n This parameter is used to specify the signatures of the methods of\n the generated interface. Do not repeat superinterface signatures\n here.\"\n {:added \"1.0\"}\n\n [& options]\n (let [options-map (apply hash-map options)\n [cname bytecode] (generate-interface options-map)]\n (when *compile-files*\n (clojure.lang.Compiler/writeClassFile cname bytecode))\n (.defineClass ^DynamicClassLoader (deref clojure.lang.Compiler/LOADER)\n (str (:name options-map)) bytecode options)))\n\n(comment\n\n (defn gen-and-load-class\n \"Generates and immediately loads the bytecode for the specified\n class. Note that a class generated this way can be loaded only once\n - the JVM supports only one class with a given name per\n classloader. Subsequent to generation you can import it into any\n desired namespaces just like any other class. See gen-class for a\n description of the options.\"\n {:added \"1.0\"}\n\n [& options]\n (let [options-map (apply hash-map options)\n [cname bytecode] (generate-class options-map)]\n (.. (clojure.lang.RT/getRootClassLoader) (defineClass cname bytecode options))))\n\n )\n" }, { "path": "src/clj/clojure/gvec.clj", "content": "; Copyright (c) Rich Hickey. All rights reserved.\n; The use and distribution terms for this software are covered by the\n; Eclipse Public License 1.0 (http://opensource.org/licenses/eclipse-1.0.php)\n; which can be found in the file epl-v10.html at the root of this distribution.\n; By using this software in any fashion, you are agreeing to be bound by\n; the terms of this license.\n; You must not remove this notice, or any other, from this software.\n\n;;; a generic vector implementation for vectors of primitives\n\n(in-ns 'clojure.core)\n\n(import '(clojure.lang Murmur3))\n\n(set! *warn-on-reflection* true)\n\n(deftype VecNode [edit arr])\n\n(def EMPTY-NODE (VecNode. nil (object-array 32)))\n\n(definterface IVecImpl\n (^int tailoff [])\n (arrayFor [^int i])\n (pushTail [^int level ^clojure.core.VecNode parent ^clojure.core.VecNode tailnode])\n (popTail [^int level node])\n (newPath [edit ^int level node])\n (doAssoc [^int level node ^int i val]))\n\n(definterface ArrayManager\n (array [^int size])\n (^int alength [arr])\n (aclone [arr])\n (aget [arr ^int i])\n (aset [arr ^int i val]))\n\n(deftype ArrayChunk [^clojure.core.ArrayManager am arr ^int off ^int end]\n \n clojure.lang.Indexed\n (nth [_ i] (.aget am arr (+ off i)))\n \n (count [_] (- end off))\n\n clojure.lang.IChunk\n (dropFirst [_]\n (if (= off end)\n (throw (IllegalStateException. \"dropFirst of empty chunk\"))\n (new ArrayChunk am arr (inc off) end)))\n \n (reduce [_ f init]\n (loop [ret init i off]\n (if (< i end)\n (let [ret (f ret (.aget am arr i))]\n (if (reduced? ret)\n ret\n (recur ret (inc i))))\n ret))))\n\n(deftype VecSeq [^clojure.core.ArrayManager am ^clojure.core.IVecImpl vec anode ^int i ^int offset] \n :no-print true\n\n clojure.core.protocols.InternalReduce\n (internal-reduce\n [_ f val]\n (loop [result val\n aidx (+ i offset)]\n (if (< aidx (count vec))\n (let [node (.arrayFor vec aidx)\n result (loop [result result\n node-idx (bit-and 0x1f aidx)]\n (if (< node-idx (.alength am node))\n (let [result (f result (.aget am node node-idx))]\n (if (reduced? result)\n result\n (recur result (inc node-idx))))\n result))]\n (if (reduced? result)\n @result\n (recur result (bit-and 0xffe0 (+ aidx 32)))))\n result)))\n \n clojure.lang.ISeq\n (first [_] (.aget am anode offset))\n (next [this] \n (if (< (inc offset) (.alength am anode))\n (new VecSeq am vec anode i (inc offset))\n (.chunkedNext this)))\n (more [this]\n (let [s (.next this)]\n (or s (clojure.lang.PersistentList/EMPTY))))\n (cons [this o]\n (clojure.lang.Cons. o this))\n (count [this]\n (loop [i 1\n s (next this)]\n (if s\n (if (instance? clojure.lang.Counted s)\n (+ i (.count s))\n (recur (inc i) (next s)))\n i)))\n (equiv [this o]\n (cond\n (identical? this o) true\n (or (instance? clojure.lang.Sequential o) (instance? java.util.List o))\n (loop [me this\n you (seq o)]\n (if (nil? me)\n (nil? you)\n (and (clojure.lang.Util/equiv (first me) (first you))\n (recur (next me) (next you)))))\n :else false))\n (empty [_]\n clojure.lang.PersistentList/EMPTY)\n\n\n clojure.lang.Seqable\n (seq [this] this)\n\n clojure.lang.IChunkedSeq\n (chunkedFirst [_] (ArrayChunk. am anode offset (.alength am anode)))\n (chunkedNext [_] \n (let [nexti (+ i (.alength am anode))]\n (when (< nexti (count vec))\n (new VecSeq am vec (.arrayFor vec nexti) nexti 0))))\n (chunkedMore [this]\n (let [s (.chunkedNext this)]\n (or s (clojure.lang.PersistentList/EMPTY)))))\n\n(defmethod print-method ::VecSeq [v w]\n ((get (methods print-method) clojure.lang.ISeq) v w))\n\n(deftype Vec [^clojure.core.ArrayManager am ^int cnt ^int shift ^clojure.core.VecNode root tail _meta]\n Object\n (equals [this o]\n (cond \n (identical? this o) true\n (or (instance? clojure.lang.IPersistentVector o) (instance? java.util.RandomAccess o))\n (and (= cnt (count o))\n (loop [i (int 0)]\n (cond\n (= i cnt) true\n (.equals (.nth this i) (nth o i)) (recur (inc i))\n :else false)))\n (or (instance? clojure.lang.Sequential o) (instance? java.util.List o))\n (if-let [st (seq this)]\n (.equals st (seq o))\n (nil? (seq o)))\n :else false))\n\n ;todo - cache\n (hashCode [this]\n (loop [hash (int 1) i (int 0)]\n (if (= i cnt)\n hash\n (let [val (.nth this i)]\n (recur (unchecked-add-int (unchecked-multiply-int 31 hash) \n (clojure.lang.Util/hash val)) \n (inc i))))))\n\n ;todo - cache\n clojure.lang.IHashEq\n (hasheq [this]\n (Murmur3/hashOrdered this))\n\n clojure.lang.Counted\n (count [_] cnt)\n\n clojure.lang.IMeta\n (meta [_] _meta)\n\n clojure.lang.IObj\n (withMeta [_ m] (new Vec am cnt shift root tail m))\n\n clojure.lang.Indexed\n (nth [this i]\n (let [a (.arrayFor this i)]\n (.aget am a (bit-and i (int 0x1f)))))\n (nth [this i not-found]\n (let [z (int 0)]\n (if (and (>= i z) (< i (.count this)))\n (.nth this i)\n not-found)))\n\n clojure.lang.IPersistentCollection\n (cons [this val]\n (if (< (- cnt (.tailoff this)) (int 32))\n (let [new-tail (.array am (inc (.alength am tail)))]\n (System/arraycopy tail 0 new-tail 0 (.alength am tail))\n (.aset am new-tail (.alength am tail) val)\n (new Vec am (inc cnt) shift root new-tail (meta this)))\n (let [tail-node (VecNode. (.edit root) tail)] \n (if (> (bit-shift-right cnt (int 5)) (bit-shift-left (int 1) shift)) ;overflow root?\n (let [new-root (VecNode. (.edit root) (object-array 32))]\n (doto ^objects (.arr new-root)\n (aset 0 root)\n (aset 1 (.newPath this (.edit root) shift tail-node)))\n (new Vec am (inc cnt) (+ shift (int 5)) new-root (let [tl (.array am 1)] (.aset am tl 0 val) tl) (meta this)))\n (new Vec am (inc cnt) shift (.pushTail this shift root tail-node) \n (let [tl (.array am 1)] (.aset am tl 0 val) tl) (meta this))))))\n\n (empty [_] (new Vec am 0 5 EMPTY-NODE (.array am 0) nil)) \n (equiv [this o]\n (cond \n (or (instance? clojure.lang.IPersistentVector o) (instance? java.util.RandomAccess o))\n (and (= cnt (count o))\n (loop [i (int 0)]\n (cond\n (= i cnt) true\n (= (.nth this i) (nth o i)) (recur (inc i))\n :else false)))\n (or (instance? clojure.lang.Sequential o) (instance? java.util.List o))\n (clojure.lang.Util/equiv (seq this) (seq o))\n :else false))\n\n clojure.lang.IPersistentStack\n (peek [this]\n (when (> cnt (int 0)) \n (.nth this (dec cnt))))\n\n (pop [this]\n (cond\n (zero? cnt) \n (throw (IllegalStateException. \"Can't pop empty vector\"))\n (= 1 cnt) \n (new Vec am 0 5 EMPTY-NODE (.array am 0) (meta this))\n (> (- cnt (.tailoff this)) 1)\n (let [new-tail (.array am (dec (.alength am tail)))]\n (System/arraycopy tail 0 new-tail 0 (.alength am new-tail))\n (new Vec am (dec cnt) shift root new-tail (meta this)))\n :else\n (let [new-tail (.arrayFor this (- cnt 2))\n new-root ^clojure.core.VecNode (.popTail this shift root)]\n (cond\n (nil? new-root) \n (new Vec am (dec cnt) shift EMPTY-NODE new-tail (meta this))\n (and (> shift 5) (nil? (aget ^objects (.arr new-root) 1)))\n (new Vec am (dec cnt) (- shift 5) (aget ^objects (.arr new-root) 0) new-tail (meta this))\n :else\n (new Vec am (dec cnt) shift new-root new-tail (meta this))))))\n\n clojure.lang.IPersistentVector\n (assocN [this i val]\n (cond \n (and (<= (int 0) i) (< i cnt))\n (if (>= i (.tailoff this))\n (let [new-tail (.array am (.alength am tail))]\n (System/arraycopy tail 0 new-tail 0 (.alength am tail))\n (.aset am new-tail (bit-and i (int 0x1f)) val)\n (new Vec am cnt shift root new-tail (meta this)))\n (new Vec am cnt shift (.doAssoc this shift root i val) tail (meta this)))\n (= i cnt) (.cons this val)\n :else (throw (IndexOutOfBoundsException.))))\n \n clojure.lang.Reversible\n (rseq [this]\n (if (> (.count this) 0)\n (clojure.lang.APersistentVector$RSeq. this (dec (.count this)))\n nil))\n \n clojure.lang.Associative\n (assoc [this k v]\n (if (clojure.lang.Util/isInteger k)\n (.assocN this k v)\n (throw (IllegalArgumentException. \"Key must be integer\"))))\n (containsKey [this k]\n (and (clojure.lang.Util/isInteger k)\n (<= 0 (int k))\n (< (int k) cnt)))\n (entryAt [this k]\n (if (.containsKey this k)\n (clojure.lang.MapEntry. k (.nth this (int k)))\n nil))\n\n clojure.lang.ILookup\n (valAt [this k not-found]\n (if (clojure.lang.Util/isInteger k)\n (let [i (int k)]\n (if (and (>= i 0) (< i cnt))\n (.nth this i)\n not-found))\n not-found))\n\n (valAt [this k] (.valAt this k nil))\n\n clojure.lang.IFn\n (invoke [this k]\n (if (clojure.lang.Util/isInteger k)\n (let [i (int k)]\n (if (and (>= i 0) (< i cnt))\n (.nth this i)\n (throw (IndexOutOfBoundsException.))))\n (throw (IllegalArgumentException. \"Key must be integer\"))))\n\n \n clojure.lang.Seqable\n (seq [this] \n (if (zero? cnt) \n nil\n (VecSeq. am this (.arrayFor this 0) 0 0)))\n\n clojure.lang.Sequential ;marker, no methods\n\n clojure.core.IVecImpl\n (tailoff [_] \n (- cnt (.alength am tail)))\n\n (arrayFor [this i]\n (if (and (<= (int 0) i) (< i cnt))\n (if (>= i (.tailoff this))\n tail\n (loop [node root level shift]\n (if (zero? level)\n (.arr node)\n (recur (aget ^objects (.arr node) (bit-and (bit-shift-right i level) (int 0x1f))) \n (- level (int 5))))))\n (throw (IndexOutOfBoundsException.))))\n\n (pushTail [this level parent tailnode]\n (let [subidx (bit-and (bit-shift-right (dec cnt) level) (int 0x1f))\n parent ^clojure.core.VecNode parent\n ret (VecNode. (.edit parent) (aclone ^objects (.arr parent)))\n node-to-insert (if (= level (int 5))\n tailnode\n (let [child (aget ^objects (.arr parent) subidx)]\n (if child\n (.pushTail this (- level (int 5)) child tailnode)\n (.newPath this (.edit root) (- level (int 5)) tailnode))))]\n (aset ^objects (.arr ret) subidx node-to-insert)\n ret))\n\n (popTail [this level node]\n (let [node ^clojure.core.VecNode node\n subidx (bit-and (bit-shift-right (- cnt (int 2)) level) (int 0x1f))]\n (cond\n (> level 5) \n (let [new-child (.popTail this (- level 5) (aget ^objects (.arr node) subidx))]\n (if (and (nil? new-child) (zero? subidx))\n nil\n (let [arr (aclone ^objects (.arr node))]\n (aset arr subidx new-child)\n (VecNode. (.edit root) arr))))\n (zero? subidx) nil\n :else (let [arr (aclone ^objects (.arr node))]\n (aset arr subidx nil)\n (VecNode. (.edit root) arr)))))\n\n (newPath [this edit ^int level node]\n (if (zero? level)\n node\n (let [ret (VecNode. edit (object-array 32))]\n (aset ^objects (.arr ret) 0 (.newPath this edit (- level (int 5)) node))\n ret)))\n\n (doAssoc [this level node i val]\n (let [node ^clojure.core.VecNode node] \n (if (zero? level)\n ;on this branch, array will need val type\n (let [arr (.aclone am (.arr node))]\n (.aset am arr (bit-and i (int 0x1f)) val)\n (VecNode. (.edit node) arr))\n (let [arr (aclone ^objects (.arr node))\n subidx (bit-and (bit-shift-right i level) (int 0x1f))]\n (aset arr subidx (.doAssoc this (- level (int 5)) (aget arr subidx) i val))\n (VecNode. (.edit node) arr)))))\n\n java.lang.Comparable\n (compareTo [this o]\n (if (identical? this o)\n 0\n (let [^clojure.lang.IPersistentVector v (cast clojure.lang.IPersistentVector o)\n vcnt (.count v)]\n (cond\n (< cnt vcnt) -1\n (> cnt vcnt) 1\n :else\n (loop [i (int 0)]\n (if (= i cnt)\n 0\n (let [comp (clojure.lang.Util/compare (.nth this i) (.nth v i))]\n (if (= 0 comp)\n (recur (inc i))\n comp))))))))\n\n java.lang.Iterable\n (iterator [this]\n (let [i (java.util.concurrent.atomic.AtomicInteger. 0)]\n (reify java.util.Iterator\n (hasNext [_] (< (.get i) cnt))\n (next [_] (.nth this (dec (.incrementAndGet i))))\n (remove [_] (throw (UnsupportedOperationException.))))))\n\n java.util.Collection\n (contains [this o] (boolean (some #(= % o) this)))\n (containsAll [this c] (every? #(.contains this %) c))\n (isEmpty [_] (zero? cnt))\n (toArray [this] (into-array Object this))\n (toArray [this arr]\n (if (>= (count arr) cnt)\n (do\n (dotimes [i cnt]\n (aset arr i (.nth this i)))\n arr)\n (into-array Object this)))\n (size [_] cnt)\n (add [_ o] (throw (UnsupportedOperationException.)))\n (addAll [_ c] (throw (UnsupportedOperationException.)))\n (clear [_] (throw (UnsupportedOperationException.)))\n (^boolean remove [_ o] (throw (UnsupportedOperationException.)))\n (removeAll [_ c] (throw (UnsupportedOperationException.)))\n (retainAll [_ c] (throw (UnsupportedOperationException.)))\n\n java.util.List\n (get [this i] (.nth this i))\n (indexOf [this o]\n (loop [i (int 0)]\n (cond\n (== i cnt) -1\n (= o (.nth this i)) i\n :else (recur (inc i)))))\n (lastIndexOf [this o]\n (loop [i (dec cnt)]\n (cond\n (< i 0) -1\n (= o (.nth this i)) i\n :else (recur (dec i)))))\n (listIterator [this] (.listIterator this 0))\n (listIterator [this i]\n (let [i (java.util.concurrent.atomic.AtomicInteger. i)]\n (reify java.util.ListIterator\n (hasNext [_] (< (.get i) cnt))\n (hasPrevious [_] (pos? i))\n (next [_] (.nth this (dec (.incrementAndGet i))))\n (nextIndex [_] (.get i))\n (previous [_] (.nth this (.decrementAndGet i)))\n (previousIndex [_] (dec (.get i)))\n (add [_ e] (throw (UnsupportedOperationException.)))\n (remove [_] (throw (UnsupportedOperationException.)))\n (set [_ e] (throw (UnsupportedOperationException.))))))\n (subList [this a z] (subvec this a z))\n (add [_ i o] (throw (UnsupportedOperationException.)))\n (addAll [_ i c] (throw (UnsupportedOperationException.)))\n (^Object remove [_ ^int i] (throw (UnsupportedOperationException.)))\n (set [_ i e] (throw (UnsupportedOperationException.)))\n)\n\n(defmethod print-method ::Vec [v w]\n ((get (methods print-method) clojure.lang.IPersistentVector) v w))\n\n(defmacro mk-am {:private true} [t]\n (let [garr (gensym)\n tgarr (with-meta garr {:tag (symbol (str t \"s\"))})]\n `(reify clojure.core.ArrayManager\n (array [_ size#] (~(symbol (str t \"-array\")) size#))\n (alength [_ ~garr] (alength ~tgarr))\n (aclone [_ ~garr] (aclone ~tgarr))\n (aget [_ ~garr i#] (aget ~tgarr i#))\n (aset [_ ~garr i# val#] (aset ~tgarr i# (~t val#))))))\n\n(def ^{:private true} ams\n {:int (mk-am int)\n :long (mk-am long)\n :float (mk-am float)\n :double (mk-am double)\n :byte (mk-am byte)\n :short (mk-am short)\n :char (mk-am char)\n :boolean (mk-am boolean)})\n\n(defn vector-of \n \"Creates a new vector of a single primitive type t, where t is one\n of :int :long :float :double :byte :short :char or :boolean. The\n resulting vector complies with the interface of vectors in general,\n but stores the values unboxed internally.\n\n Optionally takes one or more elements to populate the vector.\"\n {:added \"1.2\"\n :arglists '([t] [t & elements])}\n ([t]\n (let [am ^clojure.core.ArrayManager (ams t)]\n (Vec. am 0 5 EMPTY-NODE (.array am 0) nil)))\n ([t x1]\n (let [am ^clojure.core.ArrayManager (ams t)\n arr (.array am 1)]\n (.aset am arr 0 x1)\n (Vec. am 1 5 EMPTY-NODE arr nil)))\n ([t x1 x2]\n (let [am ^clojure.core.ArrayManager (ams t)\n arr (.array am 2)]\n (.aset am arr 0 x1)\n (.aset am arr 1 x2)\n (Vec. am 2 5 EMPTY-NODE arr nil)))\n ([t x1 x2 x3]\n (let [am ^clojure.core.ArrayManager (ams t)\n arr (.array am 3)]\n (.aset am arr 0 x1)\n (.aset am arr 1 x2)\n (.aset am arr 2 x3)\n (Vec. am 3 5 EMPTY-NODE arr nil)))\n ([t x1 x2 x3 x4]\n (let [am ^clojure.core.ArrayManager (ams t)\n arr (.array am 4)]\n (.aset am arr 0 x1)\n (.aset am arr 1 x2)\n (.aset am arr 2 x3)\n (.aset am arr 3 x4)\n (Vec. am 4 5 EMPTY-NODE arr nil)))\n ([t x1 x2 x3 x4 & xn]\n (loop [v (vector-of t x1 x2 x3 x4)\n xn xn]\n (if xn\n (recur (conj v (first xn)) (next xn))\n v))))\n" }, { "path": "src/clj/clojure/inspector.clj", "content": "; Copyright (c) Rich Hickey. All rights reserved.\n; The use and distribution terms for this software are covered by the\n; Eclipse Public License 1.0 (http://opensource.org/licenses/eclipse-1.0.php)\n; which can be found in the file epl-v10.html at the root of this distribution.\n; By using this software in any fashion, you are agreeing to be bound by\n; the terms of this license.\n; You must not remove this notice, or any other, from this software.\n\n(ns ^{:doc \"Graphical object inspector for Clojure data structures.\"\n :author \"Rich Hickey\"}\n clojure.inspector\n (:import\n (java.awt BorderLayout)\n (java.awt.event ActionEvent ActionListener)\n (javax.swing.tree TreeModel)\n (javax.swing.table TableModel AbstractTableModel)\n (javax.swing JPanel JTree JTable JScrollPane JFrame JToolBar JButton SwingUtilities)))\n\n(defn atom? [x]\n (not (coll? x)))\n\n(defn collection-tag [x]\n (cond \n (instance? java.util.Map$Entry x) :entry\n (instance? java.util.Map x) :seqable\n (instance? java.util.Set x) :seqable\n (sequential? x) :seq\n (instance? clojure.lang.Seqable x) :seqable\n :else :atom))\n\n(defmulti is-leaf collection-tag)\n(defmulti get-child (fn [parent index] (collection-tag parent)))\n(defmulti get-child-count collection-tag)\n\n(defmethod is-leaf :default [node]\n (atom? node))\n(defmethod get-child :default [parent index]\n (nth parent index))\n(defmethod get-child-count :default [parent]\n (count parent))\n\n(defmethod is-leaf :entry [e]\n (is-leaf (val e)))\n(defmethod get-child :entry [e index]\n (get-child (val e) index))\n(defmethod get-child-count :entry [e]\n (count (val e)))\n\n(defmethod is-leaf :seqable [parent]\n false)\n(defmethod get-child :seqable [parent index]\n (nth (seq parent) index))\n(defmethod get-child-count :seqable [parent]\n (count (seq parent)))\n\n(defn tree-model [data]\n (proxy [TreeModel] []\n (getRoot [] data)\n (addTreeModelListener [treeModelListener])\n (getChild [parent index]\n (get-child parent index))\n (getChildCount [parent]\n (get-child-count parent))\n (isLeaf [node]\n (is-leaf node))\n (valueForPathChanged [path newValue])\n (getIndexOfChild [parent child]\n -1)\n (removeTreeModelListener [treeModelListener])))\n\n\n(defn old-table-model [data]\n (let [row1 (first data)\n\tcolcnt (count row1)\n\tcnt (count data)\n\tvals (if (map? row1) vals identity)]\n (proxy [TableModel] []\n (addTableModelListener [tableModelListener])\n (getColumnClass [columnIndex] Object)\n (getColumnCount [] colcnt)\n (getColumnName [columnIndex]\n\t(if (map? row1)\n\t (name (nth (keys row1) columnIndex))\n\t (str columnIndex)))\n (getRowCount [] cnt)\n (getValueAt [rowIndex columnIndex]\n\t(nth (vals (nth data rowIndex)) columnIndex))\n (isCellEditable [rowIndex columnIndex] false)\n (removeTableModelListener [tableModelListener]))))\n \n(defn inspect-tree \n \"creates a graphical (Swing) inspector on the supplied hierarchical data\"\n {:added \"1.0\"}\n [data]\n (doto (JFrame. \"Clojure Inspector\")\n (.add (JScrollPane. (JTree. (tree-model data))))\n (.setSize 400 600)\n (.setVisible true)))\n\n(defn inspect-table \n \"creates a graphical (Swing) inspector on the supplied regular\n data, which must be a sequential data structure of data structures\n of equal length\"\n {:added \"1.0\"}\n [data]\n (doto (JFrame. \"Clojure Inspector\")\n (.add (JScrollPane. (JTable. (old-table-model data))))\n (.setSize 400 600)\n (.setVisible true)))\n\n\n(defmulti list-provider class)\n\n(defmethod list-provider :default [x]\n {:nrows 1 :get-value (fn [i] x) :get-label (fn [i] (.getName (class x)))})\n\n(defmethod list-provider java.util.List [c]\n (let [v (if (vector? c) c (vec c))]\n {:nrows (count v) \n :get-value (fn [i] (v i)) \n :get-label (fn [i] i)}))\n\n(defmethod list-provider java.util.Map [c]\n (let [v (vec (sort (map (fn [[k v]] (vector k v)) c)))]\n {:nrows (count v) \n :get-value (fn [i] ((v i) 1)) \n :get-label (fn [i] ((v i) 0))}))\n\n(defn list-model [provider]\n (let [{:keys [nrows get-value get-label]} provider]\n (proxy [AbstractTableModel] []\n (getColumnCount [] 2)\n (getRowCount [] nrows)\n (getValueAt [rowIndex columnIndex]\n (cond \n (= 0 columnIndex) (get-label rowIndex)\n (= 1 columnIndex) (print-str (get-value rowIndex)))))))\n\n(defmulti table-model class)\n\n(defmethod table-model :default [x]\n (proxy [AbstractTableModel] []\n (getColumnCount [] 2)\n (getRowCount [] 1)\n (getValueAt [rowIndex columnIndex]\n (if (zero? columnIndex)\n (class x)\n x))))\n\n;(defn make-inspector [x]\n; (agent {:frame frame :data x :parent nil :index 0}))\n\n\n(defn inspect\n \"creates a graphical (Swing) inspector on the supplied object\"\n {:added \"1.0\"}\n [x]\n (doto (JFrame. \"Clojure Inspector\")\n (.add\n (doto (JPanel. (BorderLayout.))\n (.add (doto (JToolBar.)\n (.add (JButton. \"Back\"))\n (.addSeparator)\n (.add (JButton. \"List\"))\n (.add (JButton. \"Table\"))\n (.add (JButton. \"Bean\"))\n (.add (JButton. \"Line\"))\n (.add (JButton. \"Bar\"))\n (.addSeparator)\n (.add (JButton. \"Prev\"))\n (.add (JButton. \"Next\")))\n BorderLayout/NORTH)\n (.add\n (JScrollPane. \n (doto (JTable. (list-model (list-provider x)))\n (.setAutoResizeMode JTable/AUTO_RESIZE_LAST_COLUMN)))\n BorderLayout/CENTER)))\n (.setSize 400 400)\n (.setVisible true)))\n\n\n(comment\n\n(load-file \"src/inspector.clj\")\n(refer 'inspector)\n(inspect-tree {:a 1 :b 2 :c [1 2 3 {:d 4 :e 5 :f [6 7 8]}]})\n(inspect-table [[1 2 3][4 5 6][7 8 9][10 11 12]])\n\n)\n" }, { "path": "src/clj/clojure/instant.clj", "content": "; Copyright (c) Rich Hickey. All rights reserved.\n; The use and distribution terms for this software are covered by the\n; Eclipse Public License 1.0 (http://opensource.org/licenses/eclipse-1.0.php)\n; which can be found in the file epl-v10.html at the root of this distribution.\n; By using this software in any fashion, you are agreeing to be bound by\n; the terms of this license.\n; You must not remove this notice, or any other, from this software.\n\n(ns clojure.instant\n (:import [java.util Calendar Date GregorianCalendar TimeZone]\n [java.sql Timestamp]))\n\n\n;;; ------------------------------------------------------------------------\n;;; convenience macros\n\n(defmacro ^:private fail\n [msg]\n `(throw (RuntimeException. ~msg)))\n\n(defmacro ^:private verify\n ([test msg] `(when-not ~test (fail ~msg)))\n ([test] `(verify ~test ~(str \"failed: \" (pr-str test)))))\n\n(defn- divisible?\n [num div]\n (zero? (mod num div)))\n\n(defn- indivisible?\n [num div]\n (not (divisible? num div)))\n\n\n;;; ------------------------------------------------------------------------\n;;; parser implementation\n\n(defn- parse-int [^String s]\n (Long/parseLong s))\n\n(defn- zero-fill-right [^String s width]\n (cond (= width (count s)) s\n (< width (count s)) (.substring s 0 width)\n :else (loop [b (StringBuilder. s)]\n (if (< (.length b) width)\n (recur (.append b \\0))\n (.toString b)))))\n\n(def parse-timestamp\n \"Parse a string containing an RFC3339-like like timestamp.\n\nThe function new-instant is called with the following arguments.\n\n min max default\n --- ------------ -------\n years 0 9999 N/A (s must provide years)\n months 1 12 1\n days 1 31 1 (actual max days depends\n hours 0 23 0 on month and year)\n minutes 0 59 0\n seconds 0 60 0 (though 60 is only valid\n nanoseconds 0 999999999 0 when minutes is 59)\n offset-sign -1 1 0\n offset-hours 0 23 0\n offset-minutes 0 59 0\n\nThese are all integers and will be non-nil. (The listed defaults\nwill be passed if the corresponding field is not present in s.)\n\nGrammar (of s):\n\n date-fullyear = 4DIGIT\n date-month = 2DIGIT ; 01-12\n date-mday = 2DIGIT ; 01-28, 01-29, 01-30, 01-31 based on\n ; month/year\n time-hour = 2DIGIT ; 00-23\n time-minute = 2DIGIT ; 00-59\n time-second = 2DIGIT ; 00-58, 00-59, 00-60 based on leap second\n ; rules\n time-secfrac = '.' 1*DIGIT\n time-numoffset = ('+' / '-') time-hour ':' time-minute\n time-offset = 'Z' / time-numoffset\n\n time-part = time-hour [ ':' time-minute [ ':' time-second\n [time-secfrac] [time-offset] ] ]\n\n timestamp = date-year [ '-' date-month [ '-' date-mday\n [ 'T' time-part ] ] ]\n\nUnlike RFC3339:\n\n - we only parse the timestamp format\n - timestamp can elide trailing components\n - time-offset is optional (defaults to +00:00)\n\nThough time-offset is syntactically optional, a missing time-offset\nwill be treated as if the time-offset zero (+00:00) had been\nspecified.\n\"\n (let [timestamp #\"(\\d\\d\\d\\d)(?:-(\\d\\d)(?:-(\\d\\d)(?:[T](\\d\\d)(?::(\\d\\d)(?::(\\d\\d)(?:[.](\\d+))?)?)?)?)?)?(?:[Z]|([-+])(\\d\\d):(\\d\\d))?\"]\n\n (fn [new-instant ^CharSequence cs]\n (if-let [[_ years months days hours minutes seconds fraction\n offset-sign offset-hours offset-minutes]\n (re-matches timestamp cs)]\n (new-instant\n (parse-int years)\n (if-not months 1 (parse-int months))\n (if-not days 1 (parse-int days))\n (if-not hours 0 (parse-int hours))\n (if-not minutes 0 (parse-int minutes))\n (if-not seconds 0 (parse-int seconds))\n (if-not fraction 0 (parse-int (zero-fill-right fraction 9)))\n (cond (= \"-\" offset-sign) -1\n (= \"+\" offset-sign) 1\n :else 0)\n (if-not offset-hours 0 (parse-int offset-hours))\n (if-not offset-minutes 0 (parse-int offset-minutes)))\n (fail (str \"Unrecognized date/time syntax: \" cs))))))\n\n\n;;; ------------------------------------------------------------------------\n;;; Verification of Extra-Grammatical Restrictions from RFC3339\n\n(defn- leap-year?\n [year]\n (and (divisible? year 4)\n (or (indivisible? year 100)\n (divisible? year 400))))\n\n(def ^:private days-in-month\n (let [dim-norm [nil 31 28 31 30 31 30 31 31 30 31 30 31]\n dim-leap [nil 31 29 31 30 31 30 31 31 30 31 30 31]]\n (fn [month leap-year?]\n ((if leap-year? dim-leap dim-norm) month))))\n\n(defn validated\n \"Return a function which constructs and instant by calling constructor\nafter first validating that those arguments are in range and otherwise\nplausible. The resulting function will throw an exception if called\nwith invalid arguments.\"\n [new-instance]\n (fn [years months days hours minutes seconds nanoseconds\n offset-sign offset-hours offset-minutes]\n (verify (<= 1 months 12))\n (verify (<= 1 days (days-in-month months (leap-year? years))))\n (verify (<= 0 hours 23))\n (verify (<= 0 minutes 59))\n (verify (<= 0 seconds (if (= minutes 59) 60 59)))\n (verify (<= 0 nanoseconds 999999999))\n (verify (<= -1 offset-sign 1))\n (verify (<= 0 offset-hours 23))\n (verify (<= 0 offset-minutes 59))\n (new-instance years months days hours minutes seconds nanoseconds\n offset-sign offset-hours offset-minutes)))\n\n\n;;; ------------------------------------------------------------------------\n;;; print integration\n\n(def ^{:private true\n :tag ThreadLocal} thread-local-utc-date-format\n ;; SimpleDateFormat is not thread-safe, so we use a ThreadLocal proxy for access.\n ;; http://bugs.sun.com/bugdatabase/view_bug.do?bug_id=4228335\n (proxy [ThreadLocal] []\n (initialValue []\n (doto (java.text.SimpleDateFormat. \"yyyy-MM-dd'T'HH:mm:ss.SSS-00:00\")\n ;; RFC3339 says to use -00:00 when the timezone is unknown (+00:00 implies a known GMT)\n (.setTimeZone (java.util.TimeZone/getTimeZone \"GMT\"))))))\n\n(defn- print-date\n \"Print a java.util.Date as RFC3339 timestamp, always in UTC.\"\n [^java.util.Date d, ^java.io.Writer w]\n (let [^java.text.SimpleDateFormat utc-format (.get thread-local-utc-date-format)]\n (.write w \"#inst \\\"\")\n (.write w (.format utc-format d))\n (.write w \"\\\"\")))\n\n(defmethod print-method java.util.Date\n [^java.util.Date d, ^java.io.Writer w]\n (print-date d w))\n\n(defmethod print-dup java.util.Date\n [^java.util.Date d, ^java.io.Writer w]\n (print-date d w))\n\n(defn- print-calendar\n \"Print a java.util.Calendar as RFC3339 timestamp, preserving timezone.\"\n [^java.util.Calendar c, ^java.io.Writer w]\n (let [calstr (format \"%1$tFT%1$tT.%1$tL%1$tz\" c)\n offset-minutes (- (.length calstr) 2)]\n ;; calstr is almost right, but is missing the colon in the offset\n (.write w \"#inst \\\"\")\n (.write w calstr 0 offset-minutes)\n (.write w \":\")\n (.write w calstr offset-minutes 2)\n (.write w \"\\\"\")))\n\n(defmethod print-method java.util.Calendar\n [^java.util.Calendar c, ^java.io.Writer w]\n (print-calendar c w))\n\n(defmethod print-dup java.util.Calendar\n [^java.util.Calendar c, ^java.io.Writer w]\n (print-calendar c w))\n\n\n(def ^{:private true\n :tag ThreadLocal} thread-local-utc-timestamp-format\n ;; SimpleDateFormat is not thread-safe, so we use a ThreadLocal proxy for access.\n ;; http://bugs.sun.com/bugdatabase/view_bug.do?bug_id=4228335\n (proxy [ThreadLocal] []\n (initialValue []\n (doto (java.text.SimpleDateFormat. \"yyyy-MM-dd'T'HH:mm:ss\")\n (.setTimeZone (java.util.TimeZone/getTimeZone \"GMT\"))))))\n\n(defn- print-timestamp\n \"Print a java.sql.Timestamp as RFC3339 timestamp, always in UTC.\"\n [^java.sql.Timestamp ts, ^java.io.Writer w]\n (let [^java.text.SimpleDateFormat utc-format (.get thread-local-utc-timestamp-format)]\n (.write w \"#inst \\\"\")\n (.write w (.format utc-format ts))\n ;; add on nanos and offset\n ;; RFC3339 says to use -00:00 when the timezone is unknown (+00:00 implies a known GMT)\n (.write w (format \".%09d-00:00\" (.getNanos ts)))\n (.write w \"\\\"\")))\n\n(defmethod print-method java.sql.Timestamp\n [^java.sql.Timestamp ts, ^java.io.Writer w]\n (print-timestamp ts w))\n\n(defmethod print-dup java.sql.Timestamp\n [^java.sql.Timestamp ts, ^java.io.Writer w]\n (print-timestamp ts w))\n\n\n;;; ------------------------------------------------------------------------\n;;; reader integration\n\n(defn- construct-calendar\n \"Construct a java.util.Calendar, preserving the timezone\noffset, but truncating the subsecond fraction to milliseconds.\"\n ^GregorianCalendar\n [years months days hours minutes seconds nanoseconds\n offset-sign offset-hours offset-minutes]\n (doto (GregorianCalendar. years (dec months) days hours minutes seconds)\n (.set Calendar/MILLISECOND (quot nanoseconds 1000000))\n (.setTimeZone (TimeZone/getTimeZone\n (format \"GMT%s%02d:%02d\"\n (if (neg? offset-sign) \"-\" \"+\")\n offset-hours offset-minutes)))))\n\n(defn- construct-date\n \"Construct a java.util.Date, which expresses the original instant as\nmilliseconds since the epoch, UTC.\"\n [years months days hours minutes seconds nanoseconds\n offset-sign offset-hours offset-minutes]\n (.getTime (construct-calendar years months days\n hours minutes seconds nanoseconds\n offset-sign offset-hours offset-minutes)))\n\n(defn- construct-timestamp\n \"Construct a java.sql.Timestamp, which has nanosecond precision.\"\n [years months days hours minutes seconds nanoseconds\n offset-sign offset-hours offset-minutes]\n (doto (Timestamp.\n (.getTimeInMillis\n (construct-calendar years months days\n hours minutes seconds 0\n offset-sign offset-hours offset-minutes)))\n ;; nanos must be set separately, pass 0 above for the base calendar\n (.setNanos nanoseconds)))\n\n(def read-instant-date\n \"To read an instant as a java.util.Date, bind *data-readers* to a map with\nthis var as the value for the 'inst key. The timezone offset will be used\nto convert into UTC.\"\n (partial parse-timestamp (validated construct-date)))\n\n(def read-instant-calendar\n \"To read an instant as a java.util.Calendar, bind *data-readers* to a map with\nthis var as the value for the 'inst key. Calendar preserves the timezone\noffset.\"\n (partial parse-timestamp (validated construct-calendar)))\n\n(def read-instant-timestamp\n \"To read an instant as a java.sql.Timestamp, bind *data-readers* to a\nmap with this var as the value for the 'inst key. Timestamp preserves\nfractional seconds with nanosecond precision. The timezone offset will\nbe used to convert into UTC.\"\n (partial parse-timestamp (validated construct-timestamp)))\n\n" }, { "path": "src/clj/clojure/java/browse.clj", "content": "; Copyright (c) Rich Hickey. All rights reserved.\n; The use and distribution terms for this software are covered by the\n; Eclipse Public License 1.0 (http://opensource.org/licenses/eclipse-1.0.php)\n; which can be found in the file epl-v10.html at the root of this distribution.\n; By using this software in any fashion, you are agreeing to be bound by\n; the terms of this license.\n; You must not remove this notice, or any other, from this software.\n\n(ns\n ^{:author \"Christophe Grand\",\n :doc \"Start a web browser from Clojure\"}\n clojure.java.browse\n (:require [clojure.java.shell :as sh]\n [clojure.string :as str])\n (:import (java.net URI)))\n\n(defn- macosx? []\n (-> \"os.name\" System/getProperty .toLowerCase\n (.startsWith \"mac os x\")))\n\n(defn- xdg-open-loc []\n ;; try/catch needed to mask exception on Windows without Cygwin\n (let [which-out (try (:out (sh/sh \"which\" \"xdg-open\"))\n (catch Exception e \"\"))]\n (if (= which-out \"\")\n nil\n (str/trim-newline which-out))))\n\n(defn- open-url-script-val []\n (if (macosx?)\n \"/usr/bin/open\"\n (xdg-open-loc)))\n\n;; We could assign (open-url-script-val) to *open-url-script* right\n;; away in the def below, but clojure.java.shell/sh creates a future\n;; that causes a long wait for the JVM to exit during Clojure compiles\n;; (unless we can somehow here make it call (shutdown-agents) later).\n;; Better to initialize it when we first need it, in browse-url.\n\n(def ^:dynamic *open-url-script* (atom :uninitialized))\n\n(defn- open-url-in-browser\n \"Opens url (a string) in the default system web browser. May not\n work on all platforms. Returns url on success, nil if not\n supported.\"\n [url]\n (try\n (when (clojure.lang.Reflector/invokeStaticMethod \"java.awt.Desktop\"\n \"isDesktopSupported\" (to-array nil))\n (-> (clojure.lang.Reflector/invokeStaticMethod \"java.awt.Desktop\"\n \"getDesktop\" (to-array nil))\n (.browse (URI. url)))\n url)\n (catch Exception e\n nil)))\n\n(defn- open-url-in-swing\n \"Opens url (a string) in a Swing window.\"\n [url]\n ; the implementation of this function resides in another namespace to be loaded \"on demand\"\n ; this fixes a bug on mac os x where the process turns into a GUI app\n ; see http://code.google.com/p/clojure-contrib/issues/detail?id=32\n (require 'clojure.java.browse-ui)\n ((find-var 'clojure.java.browse-ui/open-url-in-swing) url))\n\n(defn browse-url\n \"Open url in a browser\"\n {:added \"1.2\"}\n [url]\n (let [script @*open-url-script*\n script (if (= :uninitialized script)\n (reset! *open-url-script* (open-url-script-val))\n script)]\n (or (when script (sh/sh script (str url)) true)\n (open-url-in-browser url)\n (open-url-in-swing url))))\n" }, { "path": "src/clj/clojure/java/browse_ui.clj", "content": "; Copyright (c) Rich Hickey. All rights reserved.\n; The use and distribution terms for this software are covered by the\n; Eclipse Public License 1.0 (http://opensource.org/licenses/eclipse-1.0.php)\n; which can be found in the file epl-v10.html at the root of this distribution.\n; By using this software in any fashion, you are agreeing to be bound by\n; the terms of this license.\n; You must not remove this notice, or any other, from this software.\n\n(ns\n ^{:author \"Christophe Grand\",\n :doc \"Helper namespace for clojure.java.browse.\n Prevents console apps from becoming GUI unnecessarily.\"}\n clojure.java.browse-ui)\n\n(defn- open-url-in-swing\n [url]\n (let [htmlpane (javax.swing.JEditorPane. url)]\n (.setEditable htmlpane false)\n (.addHyperlinkListener htmlpane\n (proxy [javax.swing.event.HyperlinkListener] []\n (hyperlinkUpdate [^javax.swing.event.HyperlinkEvent e]\n (when (= (.getEventType e) (. javax.swing.event.HyperlinkEvent$EventType ACTIVATED))\n (if (instance? javax.swing.text.html.HTMLFrameHyperlinkEvent e)\n (-> htmlpane .getDocument (.processHTMLFrameHyperlinkEvent e))\n (.setPage htmlpane (.getURL e)))))))\n (doto (javax.swing.JFrame.)\n (.setContentPane (javax.swing.JScrollPane. htmlpane))\n (.setBounds 32 32 700 900)\n (.show))))\n \n" }, { "path": "src/clj/clojure/java/io.clj", "content": "; Copyright (c) Rich Hickey. All rights reserved.\n; The use and distribution terms for this software are covered by the\n; Eclipse Public License 1.0 (http://opensource.org/licenses/eclipse-1.0.php)\n; which can be found in the file epl-v10.html at the root of this distribution.\n; By using this software in any fashion, you are agreeing to be bound by\n; the terms of this license.\n; You must not remove this notice, or any other, from this software.\n\n(ns \n ^{:author \"Stuart Sierra, Chas Emerick, Stuart Halloway\",\n :doc \"This file defines polymorphic I/O utility functions for Clojure.\"}\n clojure.java.io\n (:require clojure.string)\n (:import \n (java.io Reader InputStream InputStreamReader PushbackReader\n BufferedReader File OutputStream\n OutputStreamWriter BufferedWriter Writer\n FileInputStream FileOutputStream ByteArrayOutputStream\n StringReader ByteArrayInputStream\n BufferedInputStream BufferedOutputStream\n CharArrayReader Closeable)\n (java.net URI URL MalformedURLException Socket URLDecoder URLEncoder)))\n\n(def\n ^{:doc \"Type object for a Java primitive byte array.\"\n :private true\n }\n byte-array-type (class (make-array Byte/TYPE 0)))\n\n(def\n ^{:doc \"Type object for a Java primitive char array.\"\n :private true}\n char-array-type (class (make-array Character/TYPE 0)))\n\n(defprotocol ^{:added \"1.2\"} Coercions\n \"Coerce between various 'resource-namish' things.\"\n (^{:tag java.io.File, :added \"1.2\"} as-file [x] \"Coerce argument to a file.\")\n (^{:tag java.net.URL, :added \"1.2\"} as-url [x] \"Coerce argument to a URL.\"))\n\n(defn- escaped-utf8-urlstring->str [s]\n (-> (clojure.string/replace s \"+\" (URLEncoder/encode \"+\" \"UTF-8\"))\n (URLDecoder/decode \"UTF-8\")))\n\n(extend-protocol Coercions\n nil\n (as-file [_] nil)\n (as-url [_] nil)\n \n String\n (as-file [s] (File. s))\n (as-url [s] (URL. s)) \n \n File\n (as-file [f] f)\n (as-url [f] (.toURL (.toURI f)))\n\n URL\n (as-url [u] u)\n (as-file [u]\n (if (= \"file\" (.getProtocol u))\n (as-file (escaped-utf8-urlstring->str\n (.replace (.getFile u) \\/ File/separatorChar)))\n (throw (IllegalArgumentException. (str \"Not a file: \" u)))))\n\n URI\n (as-url [u] (.toURL u))\n (as-file [u] (as-file (as-url u))))\n\n(defprotocol ^{:added \"1.2\"} IOFactory\n \"Factory functions that create ready-to-use, buffered versions of\n the various Java I/O stream types, on top of anything that can\n be unequivocally converted to the requested kind of stream.\n\n Common options include\n \n :append true to open stream in append mode\n :encoding string name of encoding to use, e.g. \\\"UTF-8\\\".\n\n Callers should generally prefer the higher level API provided by\n reader, writer, input-stream, and output-stream.\"\n (^{:added \"1.2\"} make-reader [x opts] \"Creates a BufferedReader. See also IOFactory docs.\")\n (^{:added \"1.2\"} make-writer [x opts] \"Creates a BufferedWriter. See also IOFactory docs.\")\n (^{:added \"1.2\"} make-input-stream [x opts] \"Creates a BufferedInputStream. See also IOFactory docs.\")\n (^{:added \"1.2\"} make-output-stream [x opts] \"Creates a BufferedOutputStream. See also IOFactory docs.\"))\n\n(defn ^Reader reader\n \"Attempts to coerce its argument into an open java.io.Reader.\n Default implementations always return a java.io.BufferedReader.\n\n Default implementations are provided for Reader, BufferedReader,\n InputStream, File, URI, URL, Socket, byte arrays, character arrays,\n and String.\n\n If argument is a String, it tries to resolve it first as a URI, then\n as a local file name. URIs with a 'file' protocol are converted to\n local file names.\n\n Should be used inside with-open to ensure the Reader is properly\n closed.\"\n {:added \"1.2\"}\n [x & opts]\n (make-reader x (when opts (apply hash-map opts))))\n\n(defn ^Writer writer\n \"Attempts to coerce its argument into an open java.io.Writer.\n Default implementations always return a java.io.BufferedWriter.\n\n Default implementations are provided for Writer, BufferedWriter,\n OutputStream, File, URI, URL, Socket, and String.\n\n If the argument is a String, it tries to resolve it first as a URI, then\n as a local file name. URIs with a 'file' protocol are converted to\n local file names.\n\n Should be used inside with-open to ensure the Writer is properly\n closed.\"\n {:added \"1.2\"}\n [x & opts]\n (make-writer x (when opts (apply hash-map opts))))\n\n(defn ^InputStream input-stream\n \"Attempts to coerce its argument into an open java.io.InputStream.\n Default implementations always return a java.io.BufferedInputStream.\n\n Default implementations are defined for InputStream, File, URI, URL,\n Socket, byte array, and String arguments.\n\n If the argument is a String, it tries to resolve it first as a URI, then\n as a local file name. URIs with a 'file' protocol are converted to\n local file names.\n\n Should be used inside with-open to ensure the InputStream is properly\n closed.\"\n {:added \"1.2\"}\n [x & opts]\n (make-input-stream x (when opts (apply hash-map opts))))\n\n(defn ^OutputStream output-stream\n \"Attempts to coerce its argument into an open java.io.OutputStream.\n Default implementations always return a java.io.BufferedOutputStream.\n\n Default implementations are defined for OutputStream, File, URI, URL,\n Socket, and String arguments.\n\n If the argument is a String, it tries to resolve it first as a URI, then\n as a local file name. URIs with a 'file' protocol are converted to\n local file names.\n\n Should be used inside with-open to ensure the OutputStream is\n properly closed.\"\n {:added \"1.2\"}\n [x & opts]\n (make-output-stream x (when opts (apply hash-map opts))))\n\n(defn- ^Boolean append? [opts]\n (boolean (:append opts)))\n\n(defn- ^String encoding [opts]\n (or (:encoding opts) \"UTF-8\"))\n\n(defn- buffer-size [opts]\n (or (:buffer-size opts) 1024))\n\n(def default-streams-impl\n {:make-reader (fn [x opts] (make-reader (make-input-stream x opts) opts))\n :make-writer (fn [x opts] (make-writer (make-output-stream x opts) opts))\n :make-input-stream (fn [x opts]\n (throw (IllegalArgumentException.\n (str \"Cannot open <\" (pr-str x) \"> as an InputStream.\"))))\n :make-output-stream (fn [x opts]\n (throw (IllegalArgumentException.\n (str \"Cannot open <\" (pr-str x) \"> as an OutputStream.\"))))})\n\n(defn- inputstream->reader\n [^InputStream is opts]\n (make-reader (InputStreamReader. is (encoding opts)) opts))\n\n(defn- outputstream->writer\n [^OutputStream os opts]\n (make-writer (OutputStreamWriter. os (encoding opts)) opts))\n\n(extend BufferedInputStream\n IOFactory\n (assoc default-streams-impl\n :make-input-stream (fn [x opts] x)\n :make-reader inputstream->reader))\n\n(extend InputStream\n IOFactory\n (assoc default-streams-impl\n :make-input-stream (fn [x opts] (BufferedInputStream. x))\n :make-reader inputstream->reader))\n\n(extend Reader\n IOFactory\n (assoc default-streams-impl\n :make-reader (fn [x opts] (BufferedReader. x))))\n\n(extend BufferedReader\n IOFactory\n (assoc default-streams-impl\n :make-reader (fn [x opts] x)))\n\n(extend Writer\n IOFactory\n (assoc default-streams-impl\n :make-writer (fn [x opts] (BufferedWriter. x))))\n\n(extend BufferedWriter\n IOFactory\n (assoc default-streams-impl\n :make-writer (fn [x opts] x)))\n\n(extend OutputStream\n IOFactory\n (assoc default-streams-impl\n :make-output-stream (fn [x opts] (BufferedOutputStream. x))\n :make-writer outputstream->writer))\n\n(extend BufferedOutputStream\n IOFactory\n (assoc default-streams-impl\n :make-output-stream (fn [x opts] x)\n :make-writer outputstream->writer))\n\n(extend File\n IOFactory\n (assoc default-streams-impl\n :make-input-stream (fn [^File x opts] (make-input-stream (FileInputStream. x) opts))\n :make-output-stream (fn [^File x opts] (make-output-stream (FileOutputStream. x (append? opts)) opts))))\n\n(extend URL\n IOFactory\n (assoc default-streams-impl\n :make-input-stream (fn [^URL x opts]\n (make-input-stream\n (if (= \"file\" (.getProtocol x))\n (FileInputStream. (as-file x))\n (.openStream x)) opts))\n :make-output-stream (fn [^URL x opts]\n (if (= \"file\" (.getProtocol x))\n (make-output-stream (as-file x) opts)\n (throw (IllegalArgumentException. (str \"Can not write to non-file URL <\" x \">\")))))))\n\n(extend URI\n IOFactory\n (assoc default-streams-impl\n :make-input-stream (fn [^URI x opts] (make-input-stream (.toURL x) opts))\n :make-output-stream (fn [^URI x opts] (make-output-stream (.toURL x) opts))))\n\n(extend String\n IOFactory\n (assoc default-streams-impl\n :make-input-stream (fn [^String x opts]\n (try\n (make-input-stream (URL. x) opts)\n (catch MalformedURLException e\n (make-input-stream (File. x) opts))))\n :make-output-stream (fn [^String x opts]\n (try\n (make-output-stream (URL. x) opts)\n (catch MalformedURLException err\n (make-output-stream (File. x) opts))))))\n\n(extend Socket\n IOFactory\n (assoc default-streams-impl\n :make-input-stream (fn [^Socket x opts] (make-input-stream (.getInputStream x) opts))\n :make-output-stream (fn [^Socket x opts] (make-output-stream (.getOutputStream x) opts))))\n\n(extend byte-array-type\n IOFactory\n (assoc default-streams-impl\n :make-input-stream (fn [x opts] (make-input-stream (ByteArrayInputStream. x) opts))))\n\n(extend char-array-type\n IOFactory\n (assoc default-streams-impl\n :make-reader (fn [x opts] (make-reader (CharArrayReader. x) opts))))\n\n(extend Object\n IOFactory\n default-streams-impl)\n\n(defmulti\n ^{:doc \"Internal helper for copy\"\n :private true\n :arglists '([input output opts])}\n do-copy\n (fn [input output opts] [(type input) (type output)]))\n\n(defmethod do-copy [InputStream OutputStream] [^InputStream input ^OutputStream output opts]\n (let [buffer (make-array Byte/TYPE (buffer-size opts))]\n (loop []\n (let [size (.read input buffer)]\n (when (pos? size)\n (do (.write output buffer 0 size)\n (recur)))))))\n\n(defmethod do-copy [InputStream Writer] [^InputStream input ^Writer output opts]\n (let [^\"[C\" buffer (make-array Character/TYPE (buffer-size opts))\n in (InputStreamReader. input (encoding opts))]\n (loop []\n (let [size (.read in buffer 0 (alength buffer))]\n (if (pos? size)\n (do (.write output buffer 0 size)\n (recur)))))))\n\n(defmethod do-copy [InputStream File] [^InputStream input ^File output opts]\n (with-open [out (FileOutputStream. output)]\n (do-copy input out opts)))\n\n(defmethod do-copy [Reader OutputStream] [^Reader input ^OutputStream output opts]\n (let [^\"[C\" buffer (make-array Character/TYPE (buffer-size opts))\n out (OutputStreamWriter. output (encoding opts))]\n (loop []\n (let [size (.read input buffer)]\n (if (pos? size)\n (do\n (.write out buffer 0 size)\n (recur))\n (.flush out))))))\n\n(defmethod do-copy [Reader Writer] [^Reader input ^Writer output opts]\n (let [^\"[C\" buffer (make-array Character/TYPE (buffer-size opts))]\n (loop []\n (let [size (.read input buffer)]\n (when (pos? size)\n (do (.write output buffer 0 size)\n (recur)))))))\n\n(defmethod do-copy [Reader File] [^Reader input ^File output opts]\n (with-open [out (FileOutputStream. output)]\n (do-copy input out opts)))\n\n(defmethod do-copy [File OutputStream] [^File input ^OutputStream output opts]\n (with-open [in (FileInputStream. input)]\n (do-copy in output opts)))\n\n(defmethod do-copy [File Writer] [^File input ^Writer output opts]\n (with-open [in (FileInputStream. input)]\n (do-copy in output opts)))\n\n(defmethod do-copy [File File] [^File input ^File output opts]\n (with-open [in (-> input FileInputStream. .getChannel)\n out (-> output FileOutputStream. .getChannel)]\n (let [sz (.size in)]\n (loop [pos 0]\n (let [bytes-xferred (.transferTo in pos (- sz pos) out)\n pos (+ pos bytes-xferred)]\n (when (< pos sz)\n (recur pos)))))))\n\n(defmethod do-copy [String OutputStream] [^String input ^OutputStream output opts]\n (do-copy (StringReader. input) output opts))\n\n(defmethod do-copy [String Writer] [^String input ^Writer output opts]\n (do-copy (StringReader. input) output opts))\n\n(defmethod do-copy [String File] [^String input ^File output opts]\n (do-copy (StringReader. input) output opts))\n\n(defmethod do-copy [char-array-type OutputStream] [input ^OutputStream output opts]\n (do-copy (CharArrayReader. input) output opts))\n\n(defmethod do-copy [char-array-type Writer] [input ^Writer output opts]\n (do-copy (CharArrayReader. input) output opts))\n\n(defmethod do-copy [char-array-type File] [input ^File output opts]\n (do-copy (CharArrayReader. input) output opts))\n\n(defmethod do-copy [byte-array-type OutputStream] [^\"[B\" input ^OutputStream output opts]\n (do-copy (ByteArrayInputStream. input) output opts))\n\n(defmethod do-copy [byte-array-type Writer] [^\"[B\" input ^Writer output opts]\n (do-copy (ByteArrayInputStream. input) output opts))\n\n(defmethod do-copy [byte-array-type File] [^\"[B\" input ^Writer output opts]\n (do-copy (ByteArrayInputStream. input) output opts))\n\n(defn copy\n \"Copies input to output. Returns nil or throws IOException.\n Input may be an InputStream, Reader, File, byte[], or String.\n Output may be an OutputStream, Writer, or File.\n\n Options are key/value pairs and may be one of\n\n :buffer-size buffer size to use, default is 1024.\n :encoding encoding to use if converting between\n byte and char streams. \n\n Does not close any streams except those it opens itself \n (on a File).\"\n {:added \"1.2\"}\n [input output & opts]\n (do-copy input output (when opts (apply hash-map opts))))\n\n(defn ^String as-relative-path\n \"Take an as-file-able thing and return a string if it is\n a relative path, else IllegalArgumentException.\"\n {:added \"1.2\"}\n [x]\n (let [^File f (as-file x)]\n (if (.isAbsolute f)\n (throw (IllegalArgumentException. (str f \" is not a relative path\")))\n (.getPath f))))\n\n(defn ^File file\n \"Returns a java.io.File, passing each arg to as-file. Multiple-arg\n versions treat the first argument as parent and subsequent args as\n children relative to the parent.\"\n {:added \"1.2\"}\n ([arg] \n (as-file arg))\n ([parent child] \n (File. ^File (as-file parent) ^String (as-relative-path child)))\n ([parent child & more]\n (reduce file (file parent child) more)))\n\n(defn delete-file\n \"Delete file f. Raise an exception if it fails unless silently is true.\"\n {:added \"1.2\"}\n [f & [silently]]\n (or (.delete (file f))\n silently\n (throw (java.io.IOException. (str \"Couldn't delete \" f)))))\n\n(defn make-parents\n \"Given the same arg(s) as for file, creates all parent directories of\n the file they represent.\"\n {:added \"1.2\"}\n [f & more]\n (when-let [parent (.getParentFile ^File (apply file f more))]\n (.mkdirs parent)))\n\n(defn ^URL resource\n \"Returns the URL for a named resource. Use the context class loader\n if no loader is specified.\"\n {:added \"1.2\"}\n ([n] (resource n (.getContextClassLoader (Thread/currentThread))))\n ([n ^ClassLoader loader] (.getResource loader n)))\n" }, { "path": "src/clj/clojure/java/javadoc.clj", "content": "; Copyright (c) Rich Hickey. All rights reserved.\n; The use and distribution terms for this software are covered by the\n; Eclipse Public License 1.0 (http://opensource.org/licenses/eclipse-1.0.php)\n; which can be found in the file epl-v10.html at the root of this distribution.\n; By using this software in any fashion, you are agreeing to be bound by\n; the terms of this license.\n; You must not remove this notice, or any other, from this software.\n(ns \n ^{:author \"Christophe Grand, Stuart Sierra\",\n :doc \"A repl helper to quickly open javadocs.\"}\n clojure.java.javadoc\n (:use [clojure.java.browse :only (browse-url)] )\n (:import\n (java.io File)))\n\n(def ^:dynamic *feeling-lucky-url* \"http://www.google.com/search?btnI=I%27m%20Feeling%20Lucky&q=allinurl:\")\n(def ^:dynamic *feeling-lucky* true)\n\n(def ^:dynamic *local-javadocs* (ref (list)))\n \n(def ^:dynamic *core-java-api*\n (case (System/getProperty \"java.specification.version\")\n \"1.6\" \"http://java.sun.com/javase/6/docs/api/\"\n \"http://java.sun.com/javase/7/docs/api/\"))\n\n(def ^:dynamic *remote-javadocs*\n (ref (sorted-map\n \"java.\" *core-java-api*\n \"javax.\" *core-java-api*\n \"org.ietf.jgss.\" *core-java-api*\n \"org.omg.\" *core-java-api*\n \"org.w3c.dom.\" *core-java-api*\n \"org.xml.sax.\" *core-java-api*\n \"org.apache.commons.codec.\" \"http://commons.apache.org/codec/api-release/\"\n \"org.apache.commons.io.\" \"http://commons.apache.org/io/api-release/\"\n \"org.apache.commons.lang.\" \"http://commons.apache.org/lang/api-release/\")))\n\n(defn add-local-javadoc\n \"Adds to the list of local Javadoc paths.\"\n {:added \"1.2\"}\n [path]\n (dosync (commute *local-javadocs* conj path)))\n\n(defn add-remote-javadoc\n \"Adds to the list of remote Javadoc URLs. package-prefix is the\n beginning of the package name that has docs at this URL.\"\n {:added \"1.2\"}\n [package-prefix url]\n (dosync (commute *remote-javadocs* assoc package-prefix url)))\n\n(defn- javadoc-url\n \"Searches for a URL for the given class name. Tries\n *local-javadocs* first, then *remote-javadocs*. Returns a string.\"\n {:tag String,\n :added \"1.2\"}\n [^String classname]\n (let [file-path (.replace classname \\. File/separatorChar)\n url-path (.replace classname \\. \\/)]\n (if-let [file ^File (first\n (filter #(.exists ^File %)\n (map #(File. (str %) (str file-path \".html\"))\n @*local-javadocs*)))]\n (-> file .toURI str)\n ;; If no local file, try remote URLs:\n (or (some (fn [[prefix url]]\n (when (.startsWith classname prefix)\n (str url url-path \".html\")))\n @*remote-javadocs*)\n ;; if *feeling-lucky* try a web search\n (when *feeling-lucky* (str *feeling-lucky-url* url-path \".html\"))))))\n\n(defn javadoc\n \"Opens a browser window displaying the javadoc for the argument.\n Tries *local-javadocs* first, then *remote-javadocs*.\"\n {:added \"1.2\"}\n [class-or-object]\n (let [^Class c (if (instance? Class class-or-object) \n class-or-object \n (class class-or-object))]\n (if-let [url (javadoc-url (.getName c))]\n (browse-url url)\n (println \"Could not find Javadoc for\" c))))\n" }, { "path": "src/clj/clojure/java/shell.clj", "content": "; Copyright (c) Rich Hickey. All rights reserved.\n; The use and distribution terms for this software are covered by the\n; Eclipse Public License 1.0 (http://opensource.org/licenses/eclipse-1.0.php)\n; which can be found in the file epl-v10.html at the root of this distribution.\n; By using this software in any fashion, you are agreeing to be bound by\n; the terms of this license.\n; You must not remove this notice, or any other, from this software.\n\n(ns \n ^{:author \"Chris Houser, Stuart Halloway\",\n :doc \"Conveniently launch a sub-process providing its stdin and\ncollecting its stdout\"}\n clojure.java.shell\n (:use [clojure.java.io :only (as-file copy)])\n (:import (java.io ByteArrayOutputStream StringWriter)\n (java.nio.charset Charset)))\n\n(def ^:dynamic *sh-dir* nil)\n(def ^:dynamic *sh-env* nil)\n\n(defmacro with-sh-dir\n \"Sets the directory for use with sh, see sh for details.\"\n {:added \"1.2\"}\n [dir & forms]\n `(binding [*sh-dir* ~dir]\n ~@forms))\n\n(defmacro with-sh-env\n \"Sets the environment for use with sh, see sh for details.\"\n {:added \"1.2\"}\n [env & forms]\n `(binding [*sh-env* ~env]\n ~@forms))\n \n(defn- aconcat\n \"Concatenates arrays of given type.\"\n [type & xs]\n (let [target (make-array type (apply + (map count xs)))]\n (loop [i 0 idx 0]\n (when-let [a (nth xs i nil)]\n (System/arraycopy a 0 target idx (count a))\n (recur (inc i) (+ idx (count a)))))\n target))\n\n(defn- parse-args\n [args]\n (let [default-encoding \"UTF-8\" ;; see sh doc string\n default-opts {:out-enc default-encoding :in-enc default-encoding :dir *sh-dir* :env *sh-env*}\n [cmd opts] (split-with string? args)]\n [cmd (merge default-opts (apply hash-map opts))]))\n\n(defn- ^\"[Ljava.lang.String;\" as-env-strings \n \"Helper so that callers can pass a Clojure map for the :env to sh.\"\n [arg]\n (cond\n (nil? arg) nil\n (map? arg) (into-array String (map (fn [[k v]] (str (name k) \"=\" v)) arg))\n true arg))\n\n(defn- stream-to-bytes\n [in]\n (with-open [bout (ByteArrayOutputStream.)]\n (copy in bout)\n (.toByteArray bout)))\n\n(defn- stream-to-string\n ([in] (stream-to-string in (.name (Charset/defaultCharset))))\n ([in enc]\n (with-open [bout (StringWriter.)]\n (copy in bout :encoding enc)\n (.toString bout))))\n\n(defn- stream-to-enc\n [stream enc]\n (if (= enc :bytes)\n (stream-to-bytes stream)\n (stream-to-string stream enc)))\n\n(defn sh\n \"Passes the given strings to Runtime.exec() to launch a sub-process.\n\n Options are\n\n :in may be given followed by any legal input source for\n clojure.java.io/copy, e.g. InputStream, Reader, File, byte[],\n or String, to be fed to the sub-process's stdin.\n :in-enc option may be given followed by a String, used as a character\n encoding name (for example \\\"UTF-8\\\" or \\\"ISO-8859-1\\\") to\n convert the input string specified by the :in option to the\n sub-process's stdin. Defaults to UTF-8.\n If the :in option provides a byte array, then the bytes are passed\n unencoded, and this option is ignored.\n :out-enc option may be given followed by :bytes or a String. If a\n String is given, it will be used as a character encoding\n name (for example \\\"UTF-8\\\" or \\\"ISO-8859-1\\\") to convert\n the sub-process's stdout to a String which is returned.\n If :bytes is given, the sub-process's stdout will be stored\n in a byte array and returned. Defaults to UTF-8.\n :env override the process env with a map (or the underlying Java\n String[] if you are a masochist).\n :dir override the process dir with a String or java.io.File.\n\n You can bind :env or :dir for multiple operations using with-sh-env\n and with-sh-dir.\n\n sh returns a map of\n :exit => sub-process's exit code\n :out => sub-process's stdout (as byte[] or String)\n :err => sub-process's stderr (String via platform default encoding)\"\n {:added \"1.2\"}\n [& args]\n (let [[cmd opts] (parse-args args)\n proc (.exec (Runtime/getRuntime) \n ^\"[Ljava.lang.String;\" (into-array cmd)\n (as-env-strings (:env opts))\n (as-file (:dir opts)))\n {:keys [in in-enc out-enc]} opts]\n (if in\n (future\n (with-open [os (.getOutputStream proc)]\n (copy in os :encoding in-enc)))\n (.close (.getOutputStream proc)))\n (with-open [stdout (.getInputStream proc)\n stderr (.getErrorStream proc)]\n (let [out (future (stream-to-enc stdout out-enc))\n err (future (stream-to-string stderr))\n exit-code (.waitFor proc)]\n {:exit exit-code :out @out :err @err}))))\n\n(comment\n\n(println (sh \"ls\" \"-l\"))\n(println (sh \"ls\" \"-l\" \"/no-such-thing\"))\n(println (sh \"sed\" \"s/[aeiou]/oo/g\" :in \"hello there\\n\"))\n(println (sh \"sed\" \"s/[aeiou]/oo/g\" :in (java.io.StringReader. \"hello there\\n\")))\n(println (sh \"cat\" :in \"x\\u25bax\\n\"))\n(println (sh \"echo\" \"x\\u25bax\"))\n(println (sh \"echo\" \"x\\u25bax\" :out-enc \"ISO-8859-1\")) ; reads 4 single-byte chars\n(println (sh \"cat\" \"myimage.png\" :out-enc :bytes)) ; reads binary file into bytes[]\n(println (sh \"cmd\" \"/c dir 1>&2\"))\n\n)\n" }, { "path": "src/clj/clojure/main.clj", "content": ";; Copyright (c) Rich Hickey All rights reserved. The use and\n;; distribution terms for this software are covered by the Eclipse Public\n;; License 1.0 (http://opensource.org/licenses/eclipse-1.0.php) which can be found\n;; in the file epl-v10.html at the root of this distribution. By using this\n;; software in any fashion, you are agreeing to be bound by the terms of\n;; this license. You must not remove this notice, or any other, from this\n;; software.\n\n;; Originally contributed by Stephen C. Gilardi\n\n(ns ^{:doc \"Top-level main function for Clojure REPL and scripts.\"\n :author \"Stephen C. Gilardi and Rich Hickey\"}\n clojure.main\n (:refer-clojure :exclude [with-bindings])\n (:import (clojure.lang Compiler Compiler$CompilerException\n LineNumberingPushbackReader RT))\n ;;(:use [clojure.repl :only (demunge root-cause stack-element-str)])\n )\n\n(declare main)\n\n;;;;;;;;;;;;;;;;;;; redundantly copied from clojure.repl to avoid dep ;;;;;;;;;;;;;;\n#_(defn root-cause [x] x)\n#_(defn stack-element-str\n \"Returns a (possibly unmunged) string representation of a StackTraceElement\"\n {:added \"1.3\"}\n [^StackTraceElement el]\n (.getClassName el))\n\n(defn demunge\n \"Given a string representation of a fn class,\n as in a stack trace element, returns a readable version.\"\n {:added \"1.3\"}\n [fn-name]\n (clojure.lang.Compiler/demunge fn-name))\n\n(defn root-cause\n \"Returns the initial cause of an exception or error by peeling off all of\n its wrappers\"\n {:added \"1.3\"}\n [^Throwable t]\n (loop [cause t]\n (if (and (instance? clojure.lang.Compiler$CompilerException cause)\n (not= (.source ^clojure.lang.Compiler$CompilerException cause) \"NO_SOURCE_FILE\"))\n cause\n (if-let [cause (.getCause cause)]\n (recur cause)\n cause))))\n\n(defn stack-element-str\n \"Returns a (possibly unmunged) string representation of a StackTraceElement\"\n {:added \"1.3\"}\n [^StackTraceElement el]\n (let [file (.getFileName el)\n clojure-fn? (and file (or (.endsWith file \".clj\")\n (.endsWith file \".cljc\")\n (= file \"NO_SOURCE_FILE\")))]\n (str (if clojure-fn?\n (demunge (.getClassName el))\n (str (.getClassName el) \".\" (.getMethodName el)))\n \" (\" (.getFileName el) \":\" (.getLineNumber el) \")\")))\n;;;;;;;;;;;;;;;;;;; end of redundantly copied from clojure.repl to avoid dep ;;;;;;;;;;;;;;\n\n\n(defmacro with-bindings\n \"Executes body in the context of thread-local bindings for several vars\n that often need to be set!: *ns* *warn-on-reflection* *math-context*\n *print-meta* *print-length* *print-level* *compile-path*\n *command-line-args* *1 *2 *3 *e\"\n [& body]\n `(binding [*ns* *ns*\n *warn-on-reflection* *warn-on-reflection*\n *math-context* *math-context*\n *print-meta* *print-meta*\n *print-length* *print-length*\n *print-level* *print-level*\n *data-readers* *data-readers*\n *default-data-reader-fn* *default-data-reader-fn*\n *compile-path* (System/getProperty \"clojure.compile.path\" \"classes\")\n *command-line-args* *command-line-args*\n *unchecked-math* *unchecked-math*\n *assert* *assert*\n *1 nil\n *2 nil\n *3 nil\n *e nil]\n ~@body))\n\n(defn repl-prompt\n \"Default :prompt hook for repl\"\n []\n (printf \"%s=> \" (ns-name *ns*)))\n\n(defn skip-if-eol\n \"If the next character on stream s is a newline, skips it, otherwise\n leaves the stream untouched. Returns :line-start, :stream-end, or :body\n to indicate the relative location of the next character on s. The stream\n must either be an instance of LineNumberingPushbackReader or duplicate\n its behavior of both supporting .unread and collapsing all of CR, LF, and\n CRLF to a single \\\\newline.\"\n [s]\n (let [c (.read s)]\n (cond\n (= c (int \\newline)) :line-start\n (= c -1) :stream-end\n :else (do (.unread s c) :body))))\n\n(defn skip-whitespace\n \"Skips whitespace characters on stream s. Returns :line-start, :stream-end,\n or :body to indicate the relative location of the next character on s.\n Interprets comma as whitespace and semicolon as comment to end of line.\n Does not interpret #! as comment to end of line because only one\n character of lookahead is available. The stream must either be an\n instance of LineNumberingPushbackReader or duplicate its behavior of both\n supporting .unread and collapsing all of CR, LF, and CRLF to a single\n \\\\newline.\"\n [s]\n (loop [c (.read s)]\n (cond\n (= c (int \\newline)) :line-start\n (= c -1) :stream-end\n (= c (int \\;)) (do (.readLine s) :line-start)\n (or (Character/isWhitespace (char c)) (= c (int \\,))) (recur (.read s))\n :else (do (.unread s c) :body))))\n\n(defn repl-read\n \"Default :read hook for repl. Reads from *in* which must either be an\n instance of LineNumberingPushbackReader or duplicate its behavior of both\n supporting .unread and collapsing all of CR, LF, and CRLF into a single\n \\\\newline. repl-read:\n - skips whitespace, then\n - returns request-prompt on start of line, or\n - returns request-exit on end of stream, or\n - reads an object from the input stream, then\n - skips the next input character if it's end of line, then\n - returns the object.\"\n [request-prompt request-exit]\n (or ({:line-start request-prompt :stream-end request-exit}\n (skip-whitespace *in*))\n (let [input (read {:read-cond :allow} *in*)]\n (skip-if-eol *in*)\n input)))\n\n(defn repl-exception\n \"Returns the root cause of throwables\"\n [throwable]\n (root-cause throwable))\n\n(defn repl-caught\n \"Default :caught hook for repl\"\n [e]\n (let [ex (repl-exception e)\n tr (.getStackTrace ex)\n el (when-not (zero? (count tr)) (aget tr 0))]\n (binding [*out* *err*]\n (println (str (-> ex class .getSimpleName)\n \" \" (.getMessage ex) \" \"\n (when-not (instance? clojure.lang.Compiler$CompilerException ex)\n (str \" \" (if el (stack-element-str el) \"[trace missing]\"))))))))\n\n(def ^{:doc \"A sequence of lib specs that are applied to `require`\nby default when a new command-line REPL is started.\"} repl-requires\n '[[clojure.repl :refer (source apropos dir pst doc find-doc)]\n [clojure.java.javadoc :refer (javadoc)]\n [clojure.pprint :refer (pp pprint)]])\n\n(defmacro with-read-known\n \"Evaluates body with *read-eval* set to a \\\"known\\\" value,\n i.e. substituting true for :unknown if necessary.\"\n [& body]\n `(binding [*read-eval* (if (= :unknown *read-eval*) true *read-eval*)]\n ~@body))\n\n(defn repl\n \"Generic, reusable, read-eval-print loop. By default, reads from *in*,\n writes to *out*, and prints exception summaries to *err*. If you use the\n default :read hook, *in* must either be an instance of\n LineNumberingPushbackReader or duplicate its behavior of both supporting\n .unread and collapsing CR, LF, and CRLF into a single \\\\newline. Options\n are sequential keyword-value pairs. Available options and their defaults:\n\n - :init, function of no arguments, initialization hook called with\n bindings for set!-able vars in place.\n default: #()\n\n - :need-prompt, function of no arguments, called before each\n read-eval-print except the first, the user will be prompted if it\n returns true.\n default: (if (instance? LineNumberingPushbackReader *in*)\n #(.atLineStart *in*)\n #(identity true))\n\n - :prompt, function of no arguments, prompts for more input.\n default: repl-prompt\n\n - :flush, function of no arguments, flushes output\n default: flush\n\n - :read, function of two arguments, reads from *in*:\n - returns its first argument to request a fresh prompt\n - depending on need-prompt, this may cause the repl to prompt\n before reading again\n - returns its second argument to request an exit from the repl\n - else returns the next object read from the input stream\n default: repl-read\n\n - :eval, function of one argument, returns the evaluation of its\n argument\n default: eval\n\n - :print, function of one argument, prints its argument to the output\n default: prn\n\n - :caught, function of one argument, a throwable, called when\n read, eval, or print throws an exception or error\n default: repl-caught\"\n [& options]\n (let [cl (.getContextClassLoader (Thread/currentThread))]\n (.setContextClassLoader (Thread/currentThread) (clojure.lang.DynamicClassLoader. cl)))\n (let [{:keys [init need-prompt prompt flush read eval print caught]\n :or {init #()\n need-prompt (if (instance? LineNumberingPushbackReader *in*)\n #(.atLineStart ^LineNumberingPushbackReader *in*)\n #(identity true))\n prompt repl-prompt\n flush flush\n read repl-read\n eval eval\n print prn\n caught repl-caught}}\n (apply hash-map options)\n request-prompt (Object.)\n request-exit (Object.)\n read-eval-print\n (fn []\n (try\n (let [read-eval *read-eval*\n input (with-read-known (read request-prompt request-exit))]\n (or (#{request-prompt request-exit} input)\n (let [value (binding [*read-eval* read-eval] (eval input))]\n (print value)\n (set! *3 *2)\n (set! *2 *1)\n (set! *1 value))))\n (catch Throwable e\n (caught e)\n (set! *e e))))]\n (with-bindings\n (try\n (init)\n (catch Throwable e\n (caught e)\n (set! *e e)))\n (prompt)\n (flush)\n (loop []\n (when-not \n \t (try (identical? (read-eval-print) request-exit)\n\t (catch Throwable e\n\t (caught e)\n\t (set! *e e)\n\t nil))\n (when (need-prompt)\n (prompt)\n (flush))\n (recur))))))\n\n(defn load-script\n \"Loads Clojure source from a file or resource given its path. Paths\n beginning with @ or @/ are considered relative to classpath.\"\n [^String path]\n (if (.startsWith path \"@\")\n (RT/loadResourceScript\n (.substring path (if (.startsWith path \"@/\") 2 1)))\n (Compiler/loadFile path)))\n\n(defn- init-opt\n \"Load a script\"\n [path]\n (load-script path))\n\n(defn- eval-opt\n \"Evals expressions in str, prints each non-nil result using prn\"\n [str]\n (let [eof (Object.)\n reader (LineNumberingPushbackReader. (java.io.StringReader. str))]\n (loop [input (with-read-known (read reader false eof))]\n (when-not (= input eof)\n (let [value (eval input)]\n (when-not (nil? value)\n (prn value))\n (recur (with-read-known (read reader false eof))))))))\n\n(defn- init-dispatch\n \"Returns the handler associated with an init opt\"\n [opt]\n ({\"-i\" init-opt\n \"--init\" init-opt\n \"-e\" eval-opt\n \"--eval\" eval-opt} opt))\n\n(defn- initialize\n \"Common initialize routine for repl, script, and null opts\"\n [args inits]\n (in-ns 'user)\n (set! *command-line-args* args)\n (doseq [[opt arg] inits]\n ((init-dispatch opt) arg)))\n\n(defn- main-opt\n \"Call the -main function from a namespace with string arguments from\n the command line.\"\n [[_ main-ns & args] inits]\n (with-bindings\n (initialize args inits)\n (apply (ns-resolve (doto (symbol main-ns) require) '-main) args)))\n\n(defn- repl-opt\n \"Start a repl with args and inits. Print greeting if no eval options were\n present\"\n [[_ & args] inits]\n (when-not (some #(= eval-opt (init-dispatch (first %))) inits)\n (println \"Clojure\" (clojure-version)))\n (repl :init (fn []\n (initialize args inits)\n (apply require repl-requires)))\n (prn)\n (System/exit 0))\n\n(defn- script-opt\n \"Run a script from a file, resource, or standard in with args and inits\"\n [[path & args] inits]\n (with-bindings\n (initialize args inits)\n (if (= path \"-\")\n (load-reader *in*)\n (load-script path))))\n\n(defn- null-opt\n \"No repl or script opt present, just bind args and run inits\"\n [args inits]\n (with-bindings\n (initialize args inits)))\n\n(defn- help-opt\n \"Print help text for main\"\n [_ _]\n (println (:doc (meta (var main)))))\n\n(defn- main-dispatch\n \"Returns the handler associated with a main option\"\n [opt]\n (or\n ({\"-r\" repl-opt\n \"--repl\" repl-opt\n \"-m\" main-opt\n \"--main\" main-opt\n nil null-opt\n \"-h\" help-opt\n \"--help\" help-opt\n \"-?\" help-opt} opt)\n script-opt))\n\n(defn- legacy-repl\n \"Called by the clojure.lang.Repl.main stub to run a repl with args\n specified the old way\"\n [args]\n (println \"WARNING: clojure.lang.Repl is deprecated.\nInstead, use clojure.main like this:\njava -cp clojure.jar clojure.main -i init.clj -r args...\")\n (let [[inits [sep & args]] (split-with (complement #{\"--\"}) args)]\n (repl-opt (concat [\"-r\"] args) (map vector (repeat \"-i\") inits))))\n\n(defn- legacy-script\n \"Called by the clojure.lang.Script.main stub to run a script with args\n specified the old way\"\n [args]\n (println \"WARNING: clojure.lang.Script is deprecated.\nInstead, use clojure.main like this:\njava -cp clojure.jar clojure.main -i init.clj script.clj args...\")\n (let [[inits [sep & args]] (split-with (complement #{\"--\"}) args)]\n (null-opt args (map vector (repeat \"-i\") inits))))\n\n(defn main\n \"Usage: java -cp clojure.jar clojure.main [init-opt*] [main-opt] [arg*]\n\n With no options or args, runs an interactive Read-Eval-Print Loop\n\n init options:\n -i, --init path Load a file or resource\n -e, --eval string Evaluate expressions in string; print non-nil values\n\n main options:\n -m, --main ns-name Call the -main function from a namespace with args\n -r, --repl Run a repl\n path Run a script from a file or resource\n - Run a script from standard input\n -h, -?, --help Print this help message and exit\n\n operation:\n\n - Establishes thread-local bindings for commonly set!-able vars\n - Enters the user namespace\n - Binds *command-line-args* to a seq of strings containing command line\n args that appear after any main option\n - Runs all init options in order\n - Calls a -main function or runs a repl or script if requested\n\n The init options may be repeated and mixed freely, but must appear before\n any main option. The appearance of any eval option before running a repl\n suppresses the usual repl greeting message: \\\"Clojure ~(clojure-version)\\\".\n\n Paths may be absolute or relative in the filesystem or relative to\n classpath. Classpath-relative paths have prefix of @ or @/\"\n [& args]\n (try\n (if args\n (loop [[opt arg & more :as args] args inits []]\n (if (init-dispatch opt)\n (recur more (conj inits [opt arg]))\n ((main-dispatch opt) args inits)))\n (repl-opt nil nil))\n (finally \n (flush))))\n\n" }, { "path": "src/clj/clojure/parallel.clj", "content": "; Copyright (c) Rich Hickey. All rights reserved.\n; The use and distribution terms for this software are covered by the\n; Eclipse Public License 1.0 (http://opensource.org/licenses/eclipse-1.0.php)\n; which can be found in the file epl-v10.html at the root of this distribution.\n; By using this software in any fashion, you are agreeing to be bound by\n; the terms of this license.\n; You must not remove this notice, or any other, from this software.\n\n(ns ^{:doc \"DEPRECATED Wrapper of the ForkJoin library (JSR-166).\"\n :author \"Rich Hickey\"}\n clojure.parallel)\n(alias 'parallel 'clojure.parallel)\n\n(comment \"\nThe parallel library wraps the ForkJoin library scheduled for inclusion in JDK 7:\n\nhttp://gee.cs.oswego.edu/dl/concurrency-interest/index.html\n\nYou'll need jsr166y.jar in your classpath in order to use this\nlibrary. The basic idea is that Clojure collections, and most\nefficiently vectors, can be turned into parallel arrays for use by\nthis library with the function par, although most of the functions\ntake collections and will call par if needed, so normally you will\nonly need to call par explicitly in order to attach bound/filter/map\nops. Parallel arrays support the attachment of bounds, filters and\nmapping functions prior to realization/calculation, which happens as\nthe result of any of several operations on the\narray (pvec/psort/pfilter-nils/pfilter-dupes). Rather than perform\ncomposite operations in steps, as would normally be done with\nsequences, maps and filters are instead attached and thus composed by\nproviding ops to par. Note that there is an order sensitivity to the\nattachments - bounds precede filters precede mappings. All operations\nthen happen in parallel, using multiple threads and a sophisticated\nwork-stealing system supported by fork-join, either when the array is\nrealized, or to perform aggregate operations like preduce/pmin/pmax\netc. A parallel array can be realized into a Clojure vector using\npvec.\n\")\n\n(import '(jsr166y.forkjoin ParallelArray ParallelArrayWithBounds ParallelArrayWithFilter \n ParallelArrayWithMapping \n Ops$Op Ops$BinaryOp Ops$Reducer Ops$Predicate Ops$BinaryPredicate \n Ops$IntAndObjectPredicate Ops$IntAndObjectToObject))\n\n(defn- op [f]\n (proxy [Ops$Op] []\n (op [x] (f x))))\n\n(defn- binary-op [f]\n (proxy [Ops$BinaryOp] []\n (op [x y] (f x y))))\n\n(defn- int-and-object-to-object [f]\n (proxy [Ops$IntAndObjectToObject] []\n (op [i x] (f x i))))\n\n(defn- reducer [f]\n (proxy [Ops$Reducer] []\n (op [x y] (f x y))))\n\n(defn- predicate [f]\n (proxy [Ops$Predicate] []\n (op [x] (boolean (f x)))))\n\n(defn- binary-predicate [f]\n (proxy [Ops$BinaryPredicate] []\n (op [x y] (boolean (f x y)))))\n\n(defn- int-and-object-predicate [f]\n (proxy [Ops$IntAndObjectPredicate] []\n (op [i x] (boolean (f x i)))))\n\n(defn par\n \"Creates a parallel array from coll. ops, if supplied, perform\n on-the-fly filtering or transformations during parallel realization\n or calculation. ops form a chain, and bounds must precede filters,\n must precede maps. ops must be a set of keyword value pairs of the\n following forms:\n\n :bound [start end] \n\n Only elements from start (inclusive) to end (exclusive) will be\n processed when the array is realized.\n\n :filter pred \n\n Filter preds remove elements from processing when the array is realized. pred\n must be a function of one argument whose return will be processed\n via boolean.\n\n :filter-index pred2 \n\n pred2 must be a function of two arguments, which will be an element\n of the collection and the corresponding index, whose return will be\n processed via boolean.\n\n :filter-with [pred2 coll2] \n\n pred2 must be a function of two arguments, which will be\n corresponding elements of the 2 collections.\n\n :map f \n\n Map fns will be used to transform elements when the array is\n realized. f must be a function of one argument.\n\n :map-index f2 \n\n f2 must be a function of two arguments, which will be an element of\n the collection and the corresponding index.\n\n :map-with [f2 coll2]\n\n f2 must be a function of two arguments, which will be corresponding\n elements of the 2 collections.\"\n\n ([coll] \n (if (instance? ParallelArrayWithMapping coll)\n coll\n (. ParallelArray createUsingHandoff \n (to-array coll) \n (. ParallelArray defaultExecutor))))\n ([coll & ops]\n (reduce (fn [pa [op args]] \n (cond\n (= op :bound) (. pa withBounds (args 0) (args 1))\n (= op :filter) (. pa withFilter (predicate args))\n (= op :filter-with) (. pa withFilter (binary-predicate (args 0)) (par (args 1)))\n (= op :filter-index) (. pa withIndexedFilter (int-and-object-predicate args))\n (= op :map) (. pa withMapping (parallel/op args))\n (= op :map-with) (. pa withMapping (binary-op (args 0)) (par (args 1)))\n (= op :map-index) (. pa withIndexedMapping (int-and-object-to-object args))\n :else (throw (Exception. (str \"Unsupported par op: \" op)))))\n (par coll) \n (partition 2 ops))))\n\n;;;;;;;;;;;;;;;;;;;;; aggregate operations ;;;;;;;;;;;;;;;;;;;;;;\n(defn pany\n \"Returns some (random) element of the coll if it satisfies the bound/filter/map\"\n [coll] \n (. (par coll) any))\n\n(defn pmax\n \"Returns the maximum element, presuming Comparable elements, unless\n a Comparator comp is supplied\"\n ([coll] (. (par coll) max))\n ([coll comp] (. (par coll) max comp)))\n\n(defn pmin\n \"Returns the minimum element, presuming Comparable elements, unless\n a Comparator comp is supplied\"\n ([coll] (. (par coll) min))\n ([coll comp] (. (par coll) min comp)))\n\n(defn- summary-map [s]\n {:min (.min s) :max (.max s) :size (.size s) :min-index (.indexOfMin s) :max-index (.indexOfMax s)})\n\n(defn psummary \n \"Returns a map of summary statistics (min. max, size, min-index, max-index, \n presuming Comparable elements, unless a Comparator comp is supplied\"\n ([coll] (summary-map (. (par coll) summary)))\n ([coll comp] (summary-map (. (par coll) summary comp))))\n\n(defn preduce \n \"Returns the reduction of the realized elements of coll\n using function f. Note f will not necessarily be called\n consecutively, and so must be commutative. Also note that \n (f base an-element) might be performed many times, i.e. base is not\n an initial value as with sequential reduce.\"\n [f base coll]\n (. (par coll) (reduce (reducer f) base)))\n\n;;;;;;;;;;;;;;;;;;;;; collection-producing operations ;;;;;;;;;;;;;;;;;;;;;;\n\n(defn- pa-to-vec [pa]\n (vec (. pa getArray)))\n\n(defn- pall\n \"Realizes a copy of the coll as a parallel array, with any bounds/filters/maps applied\"\n [coll]\n (if (instance? ParallelArrayWithMapping coll)\n (. coll all)\n (par coll)))\n\n(defn pvec \n \"Returns the realized contents of the parallel array pa as a Clojure vector\"\n [pa] (pa-to-vec (pall pa)))\n\n(defn pdistinct\n \"Returns a parallel array of the distinct elements of coll\"\n [coll]\n (pa-to-vec (. (pall coll) allUniqueElements)))\n\n;this doesn't work, passes null to reducer?\n(defn- pcumulate [coll f init]\n (.. (pall coll) (precumulate (reducer f) init)))\n\n(defn psort \n \"Returns a new vector consisting of the realized items in coll, sorted, \n presuming Comparable elements, unless a Comparator comp is supplied\"\n ([coll] (pa-to-vec (. (pall coll) sort)))\n ([coll comp] (pa-to-vec (. (pall coll) sort comp))))\n\n(defn pfilter-nils\n \"Returns a vector containing the non-nil (realized) elements of coll\"\n [coll]\n (pa-to-vec (. (pall coll) removeNulls)))\n\n(defn pfilter-dupes \n \"Returns a vector containing the (realized) elements of coll, \n without any consecutive duplicates\"\n [coll]\n (pa-to-vec (. (pall coll) removeConsecutiveDuplicates)))\n\n\n(comment\n(load-file \"src/parallel.clj\")\n(refer 'parallel)\n(pdistinct [1 2 3 2 1])\n;(pcumulate [1 2 3 2 1] + 0) ;broken, not exposed\n(def a (make-array Object 1000000))\n(dotimes i (count a)\n (aset a i (rand-int i)))\n(time (reduce + 0 a))\n(time (preduce + 0 a))\n(time (count (distinct a)))\n(time (count (pdistinct a)))\n\n(preduce + 0 [1 2 3 2 1])\n(preduce + 0 (psort a))\n(pvec (par [11 2 3 2] :filter-index (fn [x i] (> i x))))\n(pvec (par [11 2 3 2] :filter-with [(fn [x y] (> y x)) [110 2 33 2]]))\n\n(psummary ;or pvec/pmax etc\n (par [11 2 3 2] \n :filter-with [(fn [x y] (> y x)) \n [110 2 33 2]]\n :map #(* % 2)))\n\n(preduce + 0\n (par [11 2 3 2] \n :filter-with [< [110 2 33 2]]))\n\n(time (reduce + 0 (map #(* % %) (range 1000000))))\n(time (preduce + 0 (par (range 1000000) :map-index *)))\n(def v (range 1000000))\n(time (preduce + 0 (par v :map-index *)))\n(time (preduce + 0 (par v :map #(* % %))))\n(time (reduce + 0 (map #(* % %) v)))\n)" }, { "path": "src/clj/clojure/pprint/cl_format.clj", "content": ";;; cl_format.clj -- part of the pretty printer for Clojure\n\n; Copyright (c) Rich Hickey. All rights reserved.\n; The use and distribution terms for this software are covered by the\n; Eclipse Public License 1.0 (http://opensource.org/licenses/eclipse-1.0.php)\n; which can be found in the file epl-v10.html at the root of this distribution.\n; By using this software in any fashion, you are agreeing to be bound by\n; the terms of this license.\n; You must not remove this notice, or any other, from this software.\n\n;; Author: Tom Faulhaber\n;; April 3, 2009\n\n\n;; This module implements the Common Lisp compatible format function as documented\n;; in \"Common Lisp the Language, 2nd edition\", Chapter 22 (available online at:\n;; http://www.cs.cmu.edu/afs/cs.cmu.edu/project/ai-repository/ai/html/cltl/clm/node200.html#SECTION002633000000000000000)\n\n(in-ns 'clojure.pprint)\n\n;;; Forward references\n(declare compile-format)\n(declare execute-format)\n(declare init-navigator)\n;;; End forward references\n\n(defn cl-format \n \"An implementation of a Common Lisp compatible format function. cl-format formats its\narguments to an output stream or string based on the format control string given. It \nsupports sophisticated formatting of structured data.\n\nWriter is an instance of java.io.Writer, true to output to *out* or nil to output \nto a string, format-in is the format control string and the remaining arguments \nare the data to be formatted.\n\nThe format control string is a string to be output with embedded 'format directives' \ndescribing how to format the various arguments passed in.\n\nIf writer is nil, cl-format returns the formatted result string. Otherwise, cl-format \nreturns nil.\n\nFor example:\n (let [results [46 38 22]]\n (cl-format true \\\"There ~[are~;is~:;are~]~:* ~d result~:p: ~{~d~^, ~}~%\\\" \n (count results) results))\n\nPrints to *out*:\n There are 3 results: 46, 38, 22\n\nDetailed documentation on format control strings is available in the \\\"Common Lisp the \nLanguage, 2nd edition\\\", Chapter 22 (available online at:\nhttp://www.cs.cmu.edu/afs/cs.cmu.edu/project/ai-repository/ai/html/cltl/clm/node200.html#SECTION002633000000000000000) \nand in the Common Lisp HyperSpec at \nhttp://www.lispworks.com/documentation/HyperSpec/Body/22_c.htm\n\"\n {:added \"1.2\",\n :see-also [[\"http://www.cs.cmu.edu/afs/cs.cmu.edu/project/ai-repository/ai/html/cltl/clm/node200.html#SECTION002633000000000000000\" \n \"Common Lisp the Language\"]\n [\"http://www.lispworks.com/documentation/HyperSpec/Body/22_c.htm\"\n \"Common Lisp HyperSpec\"]]}\n [writer format-in & args]\n (let [compiled-format (if (string? format-in) (compile-format format-in) format-in)\n navigator (init-navigator args)]\n (execute-format writer compiled-format navigator)))\n\n(def ^:dynamic ^{:private true} *format-str* nil)\n\n(defn- format-error [message offset] \n (let [full-message (str message \\newline *format-str* \\newline \n (apply str (repeat offset \\space)) \"^\" \\newline)]\n (throw (RuntimeException. full-message))))\n\n;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\n;;; Argument navigators manage the argument list\n;;; as the format statement moves through the list\n;;; (possibly going forwards and backwards as it does so)\n;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\n\n(defstruct ^{:private true}\n arg-navigator :seq :rest :pos )\n\n(defn- init-navigator \n \"Create a new arg-navigator from the sequence with the position set to 0\"\n {:skip-wiki true}\n [s]\n (let [s (seq s)]\n (struct arg-navigator s s 0)))\n\n;; TODO call format-error with offset\n(defn- next-arg [ navigator ]\n (let [ rst (:rest navigator) ]\n (if rst\n [(first rst) (struct arg-navigator (:seq navigator ) (next rst) (inc (:pos navigator)))]\n (throw (new Exception \"Not enough arguments for format definition\")))))\n\n(defn- next-arg-or-nil [navigator]\n (let [rst (:rest navigator)]\n (if rst\n [(first rst) (struct arg-navigator (:seq navigator ) (next rst) (inc (:pos navigator)))]\n [nil navigator])))\n\n;; Get an argument off the arg list and compile it if it's not already compiled\n(defn- get-format-arg [navigator]\n (let [[raw-format navigator] (next-arg navigator)\n compiled-format (if (instance? String raw-format) \n (compile-format raw-format)\n raw-format)]\n [compiled-format navigator]))\n\n(declare relative-reposition)\n\n(defn- absolute-reposition [navigator position]\n (if (>= position (:pos navigator))\n (relative-reposition navigator (- (:pos navigator) position))\n (struct arg-navigator (:seq navigator) (drop position (:seq navigator)) position)))\n\n(defn- relative-reposition [navigator position]\n (let [newpos (+ (:pos navigator) position)]\n (if (neg? position)\n (absolute-reposition navigator newpos)\n (struct arg-navigator (:seq navigator) (drop position (:rest navigator)) newpos))))\n\n(defstruct ^{:private true}\n compiled-directive :func :def :params :offset)\n\n;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\n;;; When looking at the parameter list, we may need to manipulate\n;;; the argument list as well (for 'V' and '#' parameter types).\n;;; We hide all of this behind a function, but clients need to\n;;; manage changing arg navigator\n;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\n\n;; TODO: validate parameters when they come from arg list\n(defn- realize-parameter [[param [raw-val offset]] navigator]\n (let [[real-param new-navigator]\n (cond \n (contains? #{ :at :colon } param) ;pass flags through unchanged - this really isn't necessary\n [raw-val navigator]\n\n (= raw-val :parameter-from-args) \n (next-arg navigator)\n\n (= raw-val :remaining-arg-count) \n [(count (:rest navigator)) navigator]\n\n true \n [raw-val navigator])]\n [[param [real-param offset]] new-navigator]))\n \n(defn- realize-parameter-list [parameter-map navigator]\n (let [[pairs new-navigator] \n (map-passing-context realize-parameter navigator parameter-map)]\n [(into {} pairs) new-navigator]))\n\n;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\n;;; Functions that support individual directives\n;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\n\n;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\n;;; Common handling code for ~A and ~S\n;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\n\n(declare opt-base-str)\n\n(def ^{:private true}\n special-radix-markers {2 \"#b\" 8 \"#o\", 16 \"#x\"})\n\n(defn- format-simple-number [n]\n (cond \n (integer? n) (if (= *print-base* 10)\n (str n (if *print-radix* \".\"))\n (str\n (if *print-radix* (or (get special-radix-markers *print-base*) (str \"#\" *print-base* \"r\")))\n (opt-base-str *print-base* n)))\n (ratio? n) (str\n (if *print-radix* (or (get special-radix-markers *print-base*) (str \"#\" *print-base* \"r\")))\n (opt-base-str *print-base* (.numerator n))\n \"/\"\n (opt-base-str *print-base* (.denominator n)))\n :else nil))\n\n(defn- format-ascii [print-func params arg-navigator offsets]\n (let [ [arg arg-navigator] (next-arg arg-navigator) \n ^String base-output (or (format-simple-number arg) (print-func arg))\n base-width (.length base-output)\n min-width (+ base-width (:minpad params))\n width (if (>= min-width (:mincol params)) \n min-width\n (+ min-width \n (* (+ (quot (- (:mincol params) min-width 1) \n (:colinc params) )\n 1)\n (:colinc params))))\n chars (apply str (repeat (- width base-width) (:padchar params)))]\n (if (:at params)\n (print (str chars base-output))\n (print (str base-output chars)))\n arg-navigator))\n\n;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\n;;; Support for the integer directives ~D, ~X, ~O, ~B and some\n;;; of ~R\n;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\n\n(defn- integral?\n \"returns true if a number is actually an integer (that is, has no fractional part)\"\n [x]\n (cond\n (integer? x) true\n (decimal? x) (>= (.ulp (.stripTrailingZeros (bigdec 0))) 1) ; true iff no fractional part\n (float? x) (= x (Math/floor x))\n (ratio? x) (let [^clojure.lang.Ratio r x]\n (= 0 (rem (.numerator r) (.denominator r))))\n :else false))\n\n(defn- remainders\n \"Return the list of remainders (essentially the 'digits') of val in the given base\"\n [base val]\n (reverse \n (first \n (consume #(if (pos? %) \n [(rem % base) (quot % base)] \n [nil nil]) \n val))))\n\n;;; TODO: xlated-val does not seem to be used here.\n(defn- base-str\n \"Return val as a string in the given base\"\n [base val]\n (if (zero? val)\n \"0\"\n (let [xlated-val (cond\n (float? val) (bigdec val)\n (ratio? val) (let [^clojure.lang.Ratio r val] \n (/ (.numerator r) (.denominator r)))\n :else val)] \n (apply str \n (map \n #(if (< % 10) (char (+ (int \\0) %)) (char (+ (int \\a) (- % 10)))) \n (remainders base val))))))\n\n(def ^{:private true}\n java-base-formats {8 \"%o\", 10 \"%d\", 16 \"%x\"})\n\n(defn- opt-base-str\n \"Return val as a string in the given base, using clojure.core/format if supported\nfor improved performance\"\n [base val]\n (let [format-str (get java-base-formats base)]\n (if (and format-str (integer? val) (not (instance? clojure.lang.BigInt val)))\n (clojure.core/format format-str val)\n (base-str base val))))\n\n(defn- group-by* [unit lis]\n (reverse\n (first\n (consume (fn [x] [(seq (reverse (take unit x))) (seq (drop unit x))]) (reverse lis)))))\n\n(defn- format-integer [base params arg-navigator offsets]\n (let [[arg arg-navigator] (next-arg arg-navigator)]\n (if (integral? arg)\n (let [neg (neg? arg)\n pos-arg (if neg (- arg) arg)\n raw-str (opt-base-str base pos-arg)\n group-str (if (:colon params)\n (let [groups (map #(apply str %) (group-by* (:commainterval params) raw-str))\n commas (repeat (count groups) (:commachar params))]\n (apply str (next (interleave commas groups))))\n raw-str)\n ^String signed-str (cond\n neg (str \"-\" group-str)\n (:at params) (str \"+\" group-str)\n true group-str)\n padded-str (if (< (.length signed-str) (:mincol params))\n (str (apply str (repeat (- (:mincol params) (.length signed-str)) \n (:padchar params)))\n signed-str)\n signed-str)]\n (print padded-str))\n (format-ascii print-str {:mincol (:mincol params) :colinc 1 :minpad 0 \n :padchar (:padchar params) :at true} \n (init-navigator [arg]) nil))\n arg-navigator))\n\n;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\n;;; Support for english formats (~R and ~:R)\n;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\n\n(def ^{:private true}\n english-cardinal-units \n [\"zero\" \"one\" \"two\" \"three\" \"four\" \"five\" \"six\" \"seven\" \"eight\" \"nine\"\n \"ten\" \"eleven\" \"twelve\" \"thirteen\" \"fourteen\"\n \"fifteen\" \"sixteen\" \"seventeen\" \"eighteen\" \"nineteen\"])\n\n(def ^{:private true}\n english-ordinal-units \n [\"zeroth\" \"first\" \"second\" \"third\" \"fourth\" \"fifth\" \"sixth\" \"seventh\" \"eighth\" \"ninth\"\n \"tenth\" \"eleventh\" \"twelfth\" \"thirteenth\" \"fourteenth\"\n \"fifteenth\" \"sixteenth\" \"seventeenth\" \"eighteenth\" \"nineteenth\"])\n\n(def ^{:private true}\n english-cardinal-tens\n [\"\" \"\" \"twenty\" \"thirty\" \"forty\" \"fifty\" \"sixty\" \"seventy\" \"eighty\" \"ninety\"])\n\n(def ^{:private true}\n english-ordinal-tens\n [\"\" \"\" \"twentieth\" \"thirtieth\" \"fortieth\" \"fiftieth\"\n \"sixtieth\" \"seventieth\" \"eightieth\" \"ninetieth\"])\n\n;; We use \"short scale\" for our units (see http://en.wikipedia.org/wiki/Long_and_short_scales)\n;; Number names from http://www.jimloy.com/math/billion.htm\n;; We follow the rules for writing numbers from the Blue Book\n;; (http://www.grammarbook.com/numbers/numbers.asp)\n(def ^{:private true}\n english-scale-numbers \n [\"\" \"thousand\" \"million\" \"billion\" \"trillion\" \"quadrillion\" \"quintillion\" \n \"sextillion\" \"septillion\" \"octillion\" \"nonillion\" \"decillion\" \n \"undecillion\" \"duodecillion\" \"tredecillion\" \"quattuordecillion\" \n \"quindecillion\" \"sexdecillion\" \"septendecillion\" \n \"octodecillion\" \"novemdecillion\" \"vigintillion\"])\n\n(defn- format-simple-cardinal\n \"Convert a number less than 1000 to a cardinal english string\"\n [num]\n (let [hundreds (quot num 100)\n tens (rem num 100)]\n (str\n (if (pos? hundreds) (str (nth english-cardinal-units hundreds) \" hundred\"))\n (if (and (pos? hundreds) (pos? tens)) \" \")\n (if (pos? tens) \n (if (< tens 20) \n (nth english-cardinal-units tens)\n (let [ten-digit (quot tens 10)\n unit-digit (rem tens 10)]\n (str\n (if (pos? ten-digit) (nth english-cardinal-tens ten-digit))\n (if (and (pos? ten-digit) (pos? unit-digit)) \"-\")\n (if (pos? unit-digit) (nth english-cardinal-units unit-digit)))))))))\n\n(defn- add-english-scales\n \"Take a sequence of parts, add scale numbers (e.g., million) and combine into a string\noffset is a factor of 10^3 to multiply by\"\n [parts offset]\n (let [cnt (count parts)]\n (loop [acc []\n pos (dec cnt)\n this (first parts)\n remainder (next parts)]\n (if (nil? remainder)\n (str (apply str (interpose \", \" acc))\n (if (and (not (empty? this)) (not (empty? acc))) \", \")\n this\n (if (and (not (empty? this)) (pos? (+ pos offset)))\n (str \" \" (nth english-scale-numbers (+ pos offset)))))\n (recur \n (if (empty? this)\n acc\n (conj acc (str this \" \" (nth english-scale-numbers (+ pos offset)))))\n (dec pos)\n (first remainder)\n (next remainder))))))\n\n(defn- format-cardinal-english [params navigator offsets]\n (let [[arg navigator] (next-arg navigator)]\n (if (= 0 arg)\n (print \"zero\")\n (let [abs-arg (if (neg? arg) (- arg) arg) ; some numbers are too big for Math/abs\n parts (remainders 1000 abs-arg)]\n (if (<= (count parts) (count english-scale-numbers))\n (let [parts-strs (map format-simple-cardinal parts)\n full-str (add-english-scales parts-strs 0)]\n (print (str (if (neg? arg) \"minus \") full-str)))\n (format-integer ;; for numbers > 10^63, we fall back on ~D\n 10\n { :mincol 0, :padchar \\space, :commachar \\, :commainterval 3, :colon true}\n (init-navigator [arg])\n { :mincol 0, :padchar 0, :commachar 0 :commainterval 0}))))\n navigator))\n\n(defn- format-simple-ordinal\n \"Convert a number less than 1000 to a ordinal english string\nNote this should only be used for the last one in the sequence\"\n [num]\n (let [hundreds (quot num 100)\n tens (rem num 100)]\n (str\n (if (pos? hundreds) (str (nth english-cardinal-units hundreds) \" hundred\"))\n (if (and (pos? hundreds) (pos? tens)) \" \")\n (if (pos? tens) \n (if (< tens 20) \n (nth english-ordinal-units tens)\n (let [ten-digit (quot tens 10)\n unit-digit (rem tens 10)]\n (if (and (pos? ten-digit) (not (pos? unit-digit)))\n (nth english-ordinal-tens ten-digit)\n (str\n (if (pos? ten-digit) (nth english-cardinal-tens ten-digit))\n (if (and (pos? ten-digit) (pos? unit-digit)) \"-\")\n (if (pos? unit-digit) (nth english-ordinal-units unit-digit))))))\n (if (pos? hundreds) \"th\")))))\n\n(defn- format-ordinal-english [params navigator offsets]\n (let [[arg navigator] (next-arg navigator)]\n (if (= 0 arg)\n (print \"zeroth\")\n (let [abs-arg (if (neg? arg) (- arg) arg) ; some numbers are too big for Math/abs\n parts (remainders 1000 abs-arg)]\n (if (<= (count parts) (count english-scale-numbers))\n (let [parts-strs (map format-simple-cardinal (drop-last parts))\n head-str (add-english-scales parts-strs 1)\n tail-str (format-simple-ordinal (last parts))]\n (print (str (if (neg? arg) \"minus \") \n (cond \n (and (not (empty? head-str)) (not (empty? tail-str))) \n (str head-str \", \" tail-str)\n \n (not (empty? head-str)) (str head-str \"th\")\n :else tail-str))))\n (do (format-integer ;; for numbers > 10^63, we fall back on ~D\n 10\n { :mincol 0, :padchar \\space, :commachar \\, :commainterval 3, :colon true}\n (init-navigator [arg])\n { :mincol 0, :padchar 0, :commachar 0 :commainterval 0})\n (let [low-two-digits (rem arg 100)\n not-teens (or (< 11 low-two-digits) (> 19 low-two-digits))\n low-digit (rem low-two-digits 10)]\n (print (cond \n (and (== low-digit 1) not-teens) \"st\"\n (and (== low-digit 2) not-teens) \"nd\"\n (and (== low-digit 3) not-teens) \"rd\"\n :else \"th\")))))))\n navigator))\n\n\n;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\n;;; Support for roman numeral formats (~@R and ~@:R)\n;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\n\n(def ^{:private true}\n old-roman-table\n [[ \"I\" \"II\" \"III\" \"IIII\" \"V\" \"VI\" \"VII\" \"VIII\" \"VIIII\"]\n [ \"X\" \"XX\" \"XXX\" \"XXXX\" \"L\" \"LX\" \"LXX\" \"LXXX\" \"LXXXX\"]\n [ \"C\" \"CC\" \"CCC\" \"CCCC\" \"D\" \"DC\" \"DCC\" \"DCCC\" \"DCCCC\"]\n [ \"M\" \"MM\" \"MMM\"]])\n\n(def ^{:private true}\n new-roman-table\n [[ \"I\" \"II\" \"III\" \"IV\" \"V\" \"VI\" \"VII\" \"VIII\" \"IX\"]\n [ \"X\" \"XX\" \"XXX\" \"XL\" \"L\" \"LX\" \"LXX\" \"LXXX\" \"XC\"]\n [ \"C\" \"CC\" \"CCC\" \"CD\" \"D\" \"DC\" \"DCC\" \"DCCC\" \"CM\"]\n [ \"M\" \"MM\" \"MMM\"]])\n\n(defn- format-roman\n \"Format a roman numeral using the specified look-up table\"\n [table params navigator offsets]\n (let [[arg navigator] (next-arg navigator)]\n (if (and (number? arg) (> arg 0) (< arg 4000))\n (let [digits (remainders 10 arg)]\n (loop [acc []\n pos (dec (count digits))\n digits digits]\n (if (empty? digits)\n (print (apply str acc))\n (let [digit (first digits)]\n (recur (if (= 0 digit) \n acc \n (conj acc (nth (nth table pos) (dec digit))))\n (dec pos)\n (next digits))))))\n (format-integer ;; for anything <= 0 or > 3999, we fall back on ~D\n 10\n { :mincol 0, :padchar \\space, :commachar \\, :commainterval 3, :colon true}\n (init-navigator [arg])\n { :mincol 0, :padchar 0, :commachar 0 :commainterval 0}))\n navigator))\n\n(defn- format-old-roman [params navigator offsets]\n (format-roman old-roman-table params navigator offsets))\n\n(defn- format-new-roman [params navigator offsets]\n (format-roman new-roman-table params navigator offsets))\n\n;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\n;;; Support for character formats (~C)\n;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\n\n(def ^{:private true} \n special-chars { 8 \"Backspace\", 9 \"Tab\", 10 \"Newline\", 13 \"Return\", 32 \"Space\"})\n\n(defn- pretty-character [params navigator offsets]\n (let [[c navigator] (next-arg navigator)\n as-int (int c)\n base-char (bit-and as-int 127)\n meta (bit-and as-int 128)\n special (get special-chars base-char)]\n (if (> meta 0) (print \"Meta-\"))\n (print (cond\n special special\n (< base-char 32) (str \"Control-\" (char (+ base-char 64)))\n (= base-char 127) \"Control-?\"\n :else (char base-char)))\n navigator))\n\n(defn- readable-character [params navigator offsets]\n (let [[c navigator] (next-arg navigator)]\n (condp = (:char-format params)\n \\o (cl-format true \"\\\\o~3,'0o\" (int c))\n \\u (cl-format true \"\\\\u~4,'0x\" (int c))\n nil (pr c))\n navigator))\n\n(defn- plain-character [params navigator offsets]\n (let [[char navigator] (next-arg navigator)]\n (print char)\n navigator))\n\n;; Check to see if a result is an abort (~^) construct\n;; TODO: move these funcs somewhere more appropriate\n(defn- abort? [context]\n (let [token (first context)]\n (or (= :up-arrow token) (= :colon-up-arrow token))))\n\n;; Handle the execution of \"sub-clauses\" in bracket constructions\n(defn- execute-sub-format [format args base-args]\n (second\n (map-passing-context \n (fn [element context]\n (if (abort? context)\n [nil context] ; just keep passing it along\n (let [[params args] (realize-parameter-list (:params element) context)\n [params offsets] (unzip-map params)\n params (assoc params :base-args base-args)]\n [nil (apply (:func element) [params args offsets])])))\n args\n format)))\n\n;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\n;;; Support for real number formats\n;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\n\n;; TODO - return exponent as int to eliminate double conversion\n(defn- float-parts-base\n \"Produce string parts for the mantissa (normalized 1-9) and exponent\"\n [^Object f]\n (let [^String s (.toLowerCase (.toString f))\n exploc (.indexOf s (int \\e))\n dotloc (.indexOf s (int \\.))]\n (if (neg? exploc)\n (if (neg? dotloc)\n [s (str (dec (count s)))]\n [(str (subs s 0 dotloc) (subs s (inc dotloc))) (str (dec dotloc))])\n (if (neg? dotloc)\n [(subs s 0 exploc) (subs s (inc exploc))]\n [(str (subs s 0 1) (subs s 2 exploc)) (subs s (inc exploc))]))))\n\n\n(defn- float-parts\n \"Take care of leading and trailing zeros in decomposed floats\"\n [f]\n (let [[m ^String e] (float-parts-base f)\n m1 (rtrim m \\0)\n m2 (ltrim m1 \\0)\n delta (- (count m1) (count m2))\n ^String e (if (and (pos? (count e)) (= (nth e 0) \\+)) (subs e 1) e)]\n (if (empty? m2)\n [\"0\" 0]\n [m2 (- (Integer/valueOf e) delta)])))\n\n(defn- ^String inc-s\n \"Assumption: The input string consists of one or more decimal digits,\nand no other characters. Return a string containing one or more\ndecimal digits containing a decimal number one larger than the input\nstring. The output string will always be the same length as the input\nstring, or one character longer.\"\n [^String s]\n (let [len-1 (dec (count s))]\n (loop [i (int len-1)]\n (cond\n (neg? i) (apply str \"1\" (repeat (inc len-1) \"0\"))\n (= \\9 (.charAt s i)) (recur (dec i))\n :else (apply str (subs s 0 i)\n (char (inc (int (.charAt s i))))\n (repeat (- len-1 i) \"0\"))))))\n\n(defn- round-str [m e d w]\n (if (or d w)\n (let [len (count m)\n ;; Every formatted floating point number should include at\n ;; least one decimal digit and a decimal point.\n w (if w (max 2 w))\n round-pos (cond\n ;; If d was given, that forces the rounding\n ;; position, regardless of any width that may\n ;; have been specified.\n d (+ e d 1)\n ;; Otherwise w was specified, so pick round-pos\n ;; based upon that.\n ;; If e>=0, then abs value of number is >= 1.0,\n ;; and e+1 is number of decimal digits before the\n ;; decimal point when the number is written\n ;; without scientific notation. Never round the\n ;; number before the decimal point.\n (>= e 0) (max (inc e) (dec w))\n ;; e < 0, so number abs value < 1.0\n :else (+ w e))\n [m1 e1 round-pos len] (if (= round-pos 0) \n [(str \"0\" m) (inc e) 1 (inc len)]\n [m e round-pos len])]\n (if round-pos\n (if (neg? round-pos)\n [\"0\" 0 false]\n (if (> len round-pos)\n (let [round-char (nth m1 round-pos)\n ^String result (subs m1 0 round-pos)]\n (if (>= (int round-char) (int \\5))\n (let [round-up-result (inc-s result)\n expanded (> (count round-up-result) (count result))]\n [(if expanded\n (subs round-up-result 0 (dec (count round-up-result)))\n round-up-result)\n e1 expanded])\n [result e1 false]))\n [m e false]))\n [m e false]))\n [m e false]))\n\n(defn- expand-fixed [m e d]\n (let [[m1 e1] (if (neg? e)\n [(str (apply str (repeat (dec (- e)) \\0)) m) -1]\n [m e])\n len (count m1)\n target-len (if d (+ e1 d 1) (inc e1))]\n (if (< len target-len) \n (str m1 (apply str (repeat (- target-len len) \\0))) \n m1)))\n\n(defn- insert-decimal\n \"Insert the decimal point at the right spot in the number to match an exponent\"\n [m e]\n (if (neg? e)\n (str \".\" m)\n (let [loc (inc e)]\n (str (subs m 0 loc) \".\" (subs m loc)))))\n\n(defn- get-fixed [m e d]\n (insert-decimal (expand-fixed m e d) e))\n\n(defn- insert-scaled-decimal\n \"Insert the decimal point at the right spot in the number to match an exponent\"\n [m k]\n (if (neg? k)\n (str \".\" m)\n (str (subs m 0 k) \".\" (subs m k))))\n\n(defn- convert-ratio [x]\n (if (ratio? x)\n ;; Usually convert to a double, only resorting to the slower\n ;; bigdec conversion if the result does not fit within the range\n ;; of a double.\n (let [d (double x)]\n (if (== d 0.0)\n (if (not= x 0)\n (bigdec x)\n d)\n (if (or (== d Double/POSITIVE_INFINITY) (== d Double/NEGATIVE_INFINITY))\n (bigdec x)\n d)))\n x))\n\n;; the function to render ~F directives\n;; TODO: support rationals. Back off to ~D/~A is the appropriate cases\n(defn- fixed-float [params navigator offsets]\n (let [w (:w params)\n d (:d params)\n [arg navigator] (next-arg navigator)\n [sign abs] (if (neg? arg) [\"-\" (- arg)] [\"+\" arg])\n abs (convert-ratio abs)\n [mantissa exp] (float-parts abs)\n scaled-exp (+ exp (:k params))\n add-sign (or (:at params) (neg? arg))\n append-zero (and (not d) (<= (dec (count mantissa)) scaled-exp))\n [rounded-mantissa scaled-exp expanded] (round-str mantissa scaled-exp \n d (if w (- w (if add-sign 1 0))))\n fixed-repr (get-fixed rounded-mantissa (if expanded (inc scaled-exp) scaled-exp) d)\n fixed-repr (if (and w d\n (>= d 1)\n (= (.charAt fixed-repr 0) \\0)\n (= (.charAt fixed-repr 1) \\.)\n (> (count fixed-repr) (- w (if add-sign 1 0))))\n (subs fixed-repr 1) ; chop off leading 0\n fixed-repr)\n prepend-zero (= (first fixed-repr) \\.)]\n (if w\n (let [len (count fixed-repr)\n signed-len (if add-sign (inc len) len)\n prepend-zero (and prepend-zero (not (>= signed-len w)))\n append-zero (and append-zero (not (>= signed-len w)))\n full-len (if (or prepend-zero append-zero)\n (inc signed-len) \n signed-len)]\n (if (and (> full-len w) (:overflowchar params))\n (print (apply str (repeat w (:overflowchar params))))\n (print (str\n (apply str (repeat (- w full-len) (:padchar params)))\n (if add-sign sign) \n (if prepend-zero \"0\")\n fixed-repr\n (if append-zero \"0\")))))\n (print (str\n (if add-sign sign) \n (if prepend-zero \"0\")\n fixed-repr\n (if append-zero \"0\"))))\n navigator))\n\n\n;; the function to render ~E directives\n;; TODO: support rationals. Back off to ~D/~A is the appropriate cases\n;; TODO: define ~E representation for Infinity\n(defn- exponential-float [params navigator offsets]\n (let [[arg navigator] (next-arg navigator)\n arg (convert-ratio arg)]\n (loop [[mantissa exp] (float-parts (if (neg? arg) (- arg) arg))]\n (let [w (:w params)\n d (:d params)\n e (:e params)\n k (:k params)\n expchar (or (:exponentchar params) \\E)\n add-sign (or (:at params) (neg? arg))\n prepend-zero (<= k 0)\n ^Integer scaled-exp (- exp (dec k))\n scaled-exp-str (str (Math/abs scaled-exp))\n scaled-exp-str (str expchar (if (neg? scaled-exp) \\- \\+) \n (if e (apply str \n (repeat \n (- e \n (count scaled-exp-str)) \n \\0))) \n scaled-exp-str)\n exp-width (count scaled-exp-str)\n base-mantissa-width (count mantissa)\n scaled-mantissa (str (apply str (repeat (- k) \\0))\n mantissa\n (if d \n (apply str \n (repeat \n (- d (dec base-mantissa-width)\n (if (neg? k) (- k) 0)) \\0))))\n w-mantissa (if w (- w exp-width))\n [rounded-mantissa _ incr-exp] (round-str \n scaled-mantissa 0\n (cond\n (= k 0) (dec d)\n (pos? k) d\n (neg? k) (dec d))\n (if w-mantissa \n (- w-mantissa (if add-sign 1 0))))\n full-mantissa (insert-scaled-decimal rounded-mantissa k)\n append-zero (and (= k (count rounded-mantissa)) (nil? d))]\n (if (not incr-exp)\n (if w\n (let [len (+ (count full-mantissa) exp-width)\n signed-len (if add-sign (inc len) len)\n prepend-zero (and prepend-zero (not (= signed-len w)))\n full-len (if prepend-zero (inc signed-len) signed-len)\n append-zero (and append-zero (< full-len w))]\n (if (and (or (> full-len w) (and e (> (- exp-width 2) e)))\n (:overflowchar params))\n (print (apply str (repeat w (:overflowchar params))))\n (print (str\n (apply str \n (repeat \n (- w full-len (if append-zero 1 0) )\n (:padchar params)))\n (if add-sign (if (neg? arg) \\- \\+)) \n (if prepend-zero \"0\")\n full-mantissa\n (if append-zero \"0\")\n scaled-exp-str))))\n (print (str\n (if add-sign (if (neg? arg) \\- \\+)) \n (if prepend-zero \"0\")\n full-mantissa\n (if append-zero \"0\")\n scaled-exp-str)))\n (recur [rounded-mantissa (inc exp)]))))\n navigator))\n\n;; the function to render ~G directives\n;; This just figures out whether to pass the request off to ~F or ~E based \n;; on the algorithm in CLtL.\n;; TODO: support rationals. Back off to ~D/~A is the appropriate cases\n;; TODO: refactor so that float-parts isn't called twice\n(defn- general-float [params navigator offsets]\n (let [[arg _] (next-arg navigator)\n arg (convert-ratio arg)\n [mantissa exp] (float-parts (if (neg? arg) (- arg) arg))\n w (:w params)\n d (:d params)\n e (:e params)\n n (if (= arg 0.0) 0 (inc exp))\n ee (if e (+ e 2) 4)\n ww (if w (- w ee))\n d (if d d (max (count mantissa) (min n 7)))\n dd (- d n)]\n (if (<= 0 dd d)\n (let [navigator (fixed-float {:w ww, :d dd, :k 0, \n :overflowchar (:overflowchar params),\n :padchar (:padchar params), :at (:at params)} \n navigator offsets)]\n (print (apply str (repeat ee \\space)))\n navigator)\n (exponential-float params navigator offsets))))\n\n;; the function to render ~$ directives\n;; TODO: support rationals. Back off to ~D/~A is the appropriate cases\n(defn- dollar-float [params navigator offsets]\n (let [[^Double arg navigator] (next-arg navigator)\n [mantissa exp] (float-parts (Math/abs arg))\n d (:d params) ; digits after the decimal\n n (:n params) ; minimum digits before the decimal\n w (:w params) ; minimum field width\n add-sign (or (:at params) (neg? arg))\n [rounded-mantissa scaled-exp expanded] (round-str mantissa exp d nil)\n ^String fixed-repr (get-fixed rounded-mantissa (if expanded (inc scaled-exp) scaled-exp) d)\n full-repr (str (apply str (repeat (- n (.indexOf fixed-repr (int \\.))) \\0)) fixed-repr)\n full-len (+ (count full-repr) (if add-sign 1 0))]\n (print (str\n (if (and (:colon params) add-sign) (if (neg? arg) \\- \\+))\n (apply str (repeat (- w full-len) (:padchar params)))\n (if (and (not (:colon params)) add-sign) (if (neg? arg) \\- \\+))\n full-repr))\n navigator))\n \n;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\n;;; Support for the '~[...~]' conditional construct in its\n;;; different flavors\n;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\n\n;; ~[...~] without any modifiers chooses one of the clauses based on the param or \n;; next argument\n;; TODO check arg is positive int\n(defn- choice-conditional [params arg-navigator offsets]\n (let [arg (:selector params)\n [arg navigator] (if arg [arg arg-navigator] (next-arg arg-navigator))\n clauses (:clauses params)\n clause (if (or (neg? arg) (>= arg (count clauses)))\n (first (:else params))\n (nth clauses arg))]\n (if clause\n (execute-sub-format clause navigator (:base-args params))\n navigator)))\n\n;; ~:[...~] with the colon reads the next argument treating it as a truth value\n(defn- boolean-conditional [params arg-navigator offsets]\n (let [[arg navigator] (next-arg arg-navigator)\n clauses (:clauses params)\n clause (if arg\n (second clauses)\n (first clauses))]\n (if clause\n (execute-sub-format clause navigator (:base-args params))\n navigator)))\n\n;; ~@[...~] with the at sign executes the conditional if the next arg is not\n;; nil/false without consuming the arg\n(defn- check-arg-conditional [params arg-navigator offsets]\n (let [[arg navigator] (next-arg arg-navigator)\n clauses (:clauses params)\n clause (if arg (first clauses))]\n (if arg\n (if clause\n (execute-sub-format clause arg-navigator (:base-args params))\n arg-navigator)\n navigator)))\n\n\n;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\n;;; Support for the '~{...~}' iteration construct in its\n;;; different flavors\n;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\n\n\n;; ~{...~} without any modifiers uses the next argument as an argument list that \n;; is consumed by all the iterations\n(defn- iterate-sublist [params navigator offsets]\n (let [max-count (:max-iterations params)\n param-clause (first (:clauses params))\n [clause navigator] (if (empty? param-clause) \n (get-format-arg navigator)\n [param-clause navigator]) \n [arg-list navigator] (next-arg navigator)\n args (init-navigator arg-list)]\n (loop [count 0\n args args\n last-pos (num -1)]\n (if (and (not max-count) (= (:pos args) last-pos) (> count 1))\n ;; TODO get the offset in here and call format exception\n (throw (RuntimeException. \"%{ construct not consuming any arguments: Infinite loop!\")))\n (if (or (and (empty? (:rest args))\n (or (not (:colon (:right-params params))) (> count 0)))\n (and max-count (>= count max-count)))\n navigator\n (let [iter-result (execute-sub-format clause args (:base-args params))] \n (if (= :up-arrow (first iter-result))\n navigator\n (recur (inc count) iter-result (:pos args))))))))\n\n;; ~:{...~} with the colon treats the next argument as a list of sublists. Each of the\n;; sublists is used as the arglist for a single iteration.\n(defn- iterate-list-of-sublists [params navigator offsets]\n (let [max-count (:max-iterations params)\n param-clause (first (:clauses params))\n [clause navigator] (if (empty? param-clause) \n (get-format-arg navigator)\n [param-clause navigator]) \n [arg-list navigator] (next-arg navigator)]\n (loop [count 0\n arg-list arg-list]\n (if (or (and (empty? arg-list)\n (or (not (:colon (:right-params params))) (> count 0)))\n (and max-count (>= count max-count)))\n navigator\n (let [iter-result (execute-sub-format \n clause \n (init-navigator (first arg-list))\n (init-navigator (next arg-list)))]\n (if (= :colon-up-arrow (first iter-result))\n navigator\n (recur (inc count) (next arg-list))))))))\n\n;; ~@{...~} with the at sign uses the main argument list as the arguments to the iterations\n;; is consumed by all the iterations\n(defn- iterate-main-list [params navigator offsets]\n (let [max-count (:max-iterations params)\n param-clause (first (:clauses params))\n [clause navigator] (if (empty? param-clause) \n (get-format-arg navigator)\n [param-clause navigator])]\n (loop [count 0\n navigator navigator\n last-pos (num -1)]\n (if (and (not max-count) (= (:pos navigator) last-pos) (> count 1))\n ;; TODO get the offset in here and call format exception\n (throw (RuntimeException. \"%@{ construct not consuming any arguments: Infinite loop!\")))\n (if (or (and (empty? (:rest navigator))\n (or (not (:colon (:right-params params))) (> count 0)))\n (and max-count (>= count max-count)))\n navigator\n (let [iter-result (execute-sub-format clause navigator (:base-args params))] \n (if (= :up-arrow (first iter-result))\n (second iter-result)\n (recur \n (inc count) iter-result (:pos navigator))))))))\n\n;; ~@:{...~} with both colon and at sign uses the main argument list as a set of sublists, one\n;; of which is consumed with each iteration\n(defn- iterate-main-sublists [params navigator offsets]\n (let [max-count (:max-iterations params)\n param-clause (first (:clauses params))\n [clause navigator] (if (empty? param-clause) \n (get-format-arg navigator)\n [param-clause navigator]) \n ]\n (loop [count 0\n navigator navigator]\n (if (or (and (empty? (:rest navigator))\n (or (not (:colon (:right-params params))) (> count 0)))\n (and max-count (>= count max-count)))\n navigator\n (let [[sublist navigator] (next-arg-or-nil navigator)\n iter-result (execute-sub-format clause (init-navigator sublist) navigator)]\n (if (= :colon-up-arrow (first iter-result))\n navigator\n (recur (inc count) navigator)))))))\n\n;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\n;;; The '~< directive has two completely different meanings\n;;; in the '~<...~>' form it does justification, but with\n;;; ~<...~:>' it represents the logical block operation of the\n;;; pretty printer.\n;;; \n;;; Unfortunately, the current architecture decides what function\n;;; to call at form parsing time before the sub-clauses have been\n;;; folded, so it is left to run-time to make the decision.\n;;; \n;;; TODO: make it possible to make these decisions at compile-time.\n;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\n\n(declare format-logical-block)\n(declare justify-clauses)\n\n(defn- logical-block-or-justify [params navigator offsets]\n (if (:colon (:right-params params))\n (format-logical-block params navigator offsets)\n (justify-clauses params navigator offsets)))\n\n;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\n;;; Support for the '~<...~>' justification directive\n;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\n\n(defn- render-clauses [clauses navigator base-navigator]\n (loop [clauses clauses\n acc []\n navigator navigator]\n (if (empty? clauses)\n [acc navigator]\n (let [clause (first clauses)\n [iter-result result-str] (binding [*out* (java.io.StringWriter.)]\n [(execute-sub-format clause navigator base-navigator) \n (.toString *out*)])]\n (if (= :up-arrow (first iter-result))\n [acc (second iter-result)]\n (recur (next clauses) (conj acc result-str) iter-result))))))\n\n;; TODO support for ~:; constructions\n(defn- justify-clauses [params navigator offsets]\n (let [[[eol-str] new-navigator] (when-let [else (:else params)]\n (render-clauses else navigator (:base-args params)))\n navigator (or new-navigator navigator)\n [else-params new-navigator] (when-let [p (:else-params params)]\n (realize-parameter-list p navigator))\n navigator (or new-navigator navigator)\n min-remaining (or (first (:min-remaining else-params)) 0)\n max-columns (or (first (:max-columns else-params))\n (get-max-column *out*))\n clauses (:clauses params)\n [strs navigator] (render-clauses clauses navigator (:base-args params))\n slots (max 1\n (+ (dec (count strs)) (if (:colon params) 1 0) (if (:at params) 1 0)))\n chars (reduce + (map count strs))\n mincol (:mincol params)\n minpad (:minpad params)\n colinc (:colinc params)\n minout (+ chars (* slots minpad))\n result-columns (if (<= minout mincol) \n mincol\n (+ mincol (* colinc\n (+ 1 (quot (- minout mincol 1) colinc)))))\n total-pad (- result-columns chars)\n pad (max minpad (quot total-pad slots))\n extra-pad (- total-pad (* pad slots))\n pad-str (apply str (repeat pad (:padchar params)))]\n (if (and eol-str (> (+ (get-column (:base @@*out*)) min-remaining result-columns) \n max-columns))\n (print eol-str))\n (loop [slots slots\n extra-pad extra-pad\n strs strs\n pad-only (or (:colon params)\n (and (= (count strs) 1) (not (:at params))))]\n (if (seq strs)\n (do\n (print (str (if (not pad-only) (first strs))\n (if (or pad-only (next strs) (:at params)) pad-str)\n (if (pos? extra-pad) (:padchar params))))\n (recur \n (dec slots)\n (dec extra-pad)\n (if pad-only strs (next strs))\n false))))\n navigator))\n\n;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\n;;; Support for case modification with ~(...~).\n;;; We do this by wrapping the underlying writer with\n;;; a special writer to do the appropriate modification. This\n;;; allows us to support arbitrary-sized output and sources\n;;; that may block.\n;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\n\n(defn- downcase-writer \n \"Returns a proxy that wraps writer, converting all characters to lower case\"\n [^java.io.Writer writer]\n (proxy [java.io.Writer] []\n (close [] (.close writer))\n (flush [] (.flush writer))\n (write ([^chars cbuf ^Integer off ^Integer len] \n (.write writer cbuf off len))\n ([x]\n (condp = (class x)\n\t\tString \n\t\t(let [s ^String x]\n\t\t (.write writer (.toLowerCase s)))\n\n\t\tInteger\n\t\t(let [c ^Character x]\n\t\t (.write writer (int (Character/toLowerCase (char c))))))))))\n\n(defn- upcase-writer \n \"Returns a proxy that wraps writer, converting all characters to upper case\"\n [^java.io.Writer writer]\n (proxy [java.io.Writer] []\n (close [] (.close writer))\n (flush [] (.flush writer))\n (write ([^chars cbuf ^Integer off ^Integer len] \n (.write writer cbuf off len))\n ([x]\n (condp = (class x)\n\t\tString \n\t\t(let [s ^String x]\n\t\t (.write writer (.toUpperCase s)))\n\n\t\tInteger\n\t\t(let [c ^Character x]\n\t\t (.write writer (int (Character/toUpperCase (char c))))))))))\n\n(defn- capitalize-string\n \"Capitalizes the words in a string. If first? is false, don't capitalize the \n first character of the string even if it's a letter.\"\n [s first?]\n (let [^Character f (first s) \n s (if (and first? f (Character/isLetter f))\n (str (Character/toUpperCase f) (subs s 1))\n s)]\n (apply str \n (first\n (consume\n (fn [s]\n (if (empty? s)\n [nil nil]\n (let [m (re-matcher #\"\\W\\w\" s)\n match (re-find m)\n offset (and match (inc (.start m)))]\n (if offset\n [(str (subs s 0 offset) \n (Character/toUpperCase ^Character (nth s offset)))\n (subs s (inc offset))]\n [s nil]))))\n s)))))\n\n(defn- capitalize-word-writer\n \"Returns a proxy that wraps writer, capitalizing all words\"\n [^java.io.Writer writer]\n (let [last-was-whitespace? (ref true)] \n (proxy [java.io.Writer] []\n (close [] (.close writer))\n (flush [] (.flush writer))\n (write \n ([^chars cbuf ^Integer off ^Integer len] \n (.write writer cbuf off len))\n ([x]\n (condp = (class x)\n String \n (let [s ^String x]\n (.write writer \n ^String (capitalize-string (.toLowerCase s) @last-was-whitespace?))\n (when (pos? (.length s))\n (dosync \n (ref-set last-was-whitespace? \n (Character/isWhitespace \n ^Character (nth s (dec (count s))))))))\n\n Integer\n (let [c (char x)]\n (let [mod-c (if @last-was-whitespace? (Character/toUpperCase (char x)) c)]\n (.write writer (int mod-c))\n (dosync (ref-set last-was-whitespace? (Character/isWhitespace (char x))))))))))))\n\n(defn- init-cap-writer\n \"Returns a proxy that wraps writer, capitalizing the first word\"\n [^java.io.Writer writer]\n (let [capped (ref false)] \n (proxy [java.io.Writer] []\n (close [] (.close writer))\n (flush [] (.flush writer))\n (write ([^chars cbuf ^Integer off ^Integer len] \n (.write writer cbuf off len))\n ([x]\n (condp = (class x)\n String \n (let [s (.toLowerCase ^String x)]\n (if (not @capped) \n (let [m (re-matcher #\"\\S\" s)\n match (re-find m)\n offset (and match (.start m))]\n (if offset\n (do (.write writer \n (str (subs s 0 offset) \n (Character/toUpperCase ^Character (nth s offset))\n (.toLowerCase ^String (subs s (inc offset)))))\n (dosync (ref-set capped true)))\n (.write writer s))) \n (.write writer (.toLowerCase s))))\n\n Integer\n (let [c ^Character (char x)]\n (if (and (not @capped) (Character/isLetter c))\n (do\n (dosync (ref-set capped true))\n (.write writer (int (Character/toUpperCase c))))\n (.write writer (int (Character/toLowerCase c)))))))))))\n\n(defn- modify-case [make-writer params navigator offsets]\n (let [clause (first (:clauses params))]\n (binding [*out* (make-writer *out*)] \n (execute-sub-format clause navigator (:base-args params)))))\n\n;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\n;;; If necessary, wrap the writer in a PrettyWriter object\n;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\n\n(defn get-pretty-writer \n \"Returns the java.io.Writer passed in wrapped in a pretty writer proxy, unless it's \nalready a pretty writer. Generally, it is unnecessary to call this function, since pprint,\nwrite, and cl-format all call it if they need to. However if you want the state to be \npreserved across calls, you will want to wrap them with this. \n\nFor example, when you want to generate column-aware output with multiple calls to cl-format, \ndo it like in this example:\n\n (defn print-table [aseq column-width]\n (binding [*out* (get-pretty-writer *out*)]\n (doseq [row aseq]\n (doseq [col row]\n (cl-format true \\\"~4D~7,vT\\\" col column-width))\n (prn))))\n\nNow when you run:\n\n user> (print-table (map #(vector % (* % %) (* % % %)) (range 1 11)) 8)\n\nIt prints a table of squares and cubes for the numbers from 1 to 10:\n\n 1 1 1 \n 2 4 8 \n 3 9 27 \n 4 16 64 \n 5 25 125 \n 6 36 216 \n 7 49 343 \n 8 64 512 \n 9 81 729 \n 10 100 1000\"\n {:added \"1.2\"}\n [writer]\n (if (pretty-writer? writer) \n writer\n (pretty-writer writer *print-right-margin* *print-miser-width*)))\n \n;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\n;;; Support for column-aware operations ~&, ~T\n;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\n\n(defn fresh-line\n \"Make a newline if *out* is not already at the beginning of the line. If *out* is\nnot a pretty writer (which keeps track of columns), this function always outputs a newline.\"\n {:added \"1.2\"}\n []\n (if (instance? clojure.lang.IDeref *out*)\n (if (not (= 0 (get-column (:base @@*out*))))\n (prn))\n (prn)))\n\n(defn- absolute-tabulation [params navigator offsets]\n (let [colnum (:colnum params) \n colinc (:colinc params)\n current (get-column (:base @@*out*))\n space-count (cond\n (< current colnum) (- colnum current)\n (= colinc 0) 0\n :else (- colinc (rem (- current colnum) colinc)))]\n (print (apply str (repeat space-count \\space))))\n navigator)\n\n(defn- relative-tabulation [params navigator offsets]\n (let [colrel (:colnum params) \n colinc (:colinc params)\n start-col (+ colrel (get-column (:base @@*out*)))\n offset (if (pos? colinc) (rem start-col colinc) 0)\n space-count (+ colrel (if (= 0 offset) 0 (- colinc offset)))]\n (print (apply str (repeat space-count \\space))))\n navigator)\n\n\n;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\n;;; Support for accessing the pretty printer from a format\n;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\n\n;; TODO: support ~@; per-line-prefix separator\n;; TODO: get the whole format wrapped so we can start the lb at any column\n(defn- format-logical-block [params navigator offsets]\n (let [clauses (:clauses params)\n clause-count (count clauses)\n prefix (cond\n (> clause-count 1) (:string (:params (first (first clauses))))\n (:colon params) \"(\")\n body (nth clauses (if (> clause-count 1) 1 0))\n suffix (cond\n (> clause-count 2) (:string (:params (first (nth clauses 2))))\n (:colon params) \")\")\n [arg navigator] (next-arg navigator)]\n (pprint-logical-block :prefix prefix :suffix suffix\n (execute-sub-format \n body \n (init-navigator arg)\n (:base-args params)))\n navigator))\n\n(defn- set-indent [params navigator offsets]\n (let [relative-to (if (:colon params) :current :block)]\n (pprint-indent relative-to (:n params))\n navigator))\n\n;;; TODO: support ~:T section options for ~T\n\n(defn- conditional-newline [params navigator offsets]\n (let [kind (if (:colon params) \n (if (:at params) :mandatory :fill)\n (if (:at params) :miser :linear))]\n (pprint-newline kind)\n navigator))\n\n;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\n;;; The table of directives we support, each with its params,\n;;; properties, and the compilation function\n;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\n\n;; We start with a couple of helpers\n(defn- process-directive-table-element [ [ char params flags bracket-info & generator-fn ] ]\n [char, \n {:directive char,\n :params `(array-map ~@params),\n :flags flags,\n :bracket-info bracket-info,\n :generator-fn (concat '(fn [ params offset]) generator-fn) }])\n\n(defmacro ^{:private true}\n defdirectives \n [ & directives ]\n `(def ^{:private true}\n directive-table (hash-map ~@(mapcat process-directive-table-element directives))))\n\n(defdirectives \n (\\A \n [ :mincol [0 Integer] :colinc [1 Integer] :minpad [0 Integer] :padchar [\\space Character] ] \n #{ :at :colon :both} {}\n #(format-ascii print-str %1 %2 %3))\n\n (\\S \n [ :mincol [0 Integer] :colinc [1 Integer] :minpad [0 Integer] :padchar [\\space Character] ] \n #{ :at :colon :both} {}\n #(format-ascii pr-str %1 %2 %3))\n\n (\\D\n [ :mincol [0 Integer] :padchar [\\space Character] :commachar [\\, Character] \n :commainterval [ 3 Integer]]\n #{ :at :colon :both } {}\n #(format-integer 10 %1 %2 %3))\n\n (\\B\n [ :mincol [0 Integer] :padchar [\\space Character] :commachar [\\, Character] \n :commainterval [ 3 Integer]]\n #{ :at :colon :both } {}\n #(format-integer 2 %1 %2 %3))\n\n (\\O\n [ :mincol [0 Integer] :padchar [\\space Character] :commachar [\\, Character] \n :commainterval [ 3 Integer]]\n #{ :at :colon :both } {}\n #(format-integer 8 %1 %2 %3))\n\n (\\X\n [ :mincol [0 Integer] :padchar [\\space Character] :commachar [\\, Character] \n :commainterval [ 3 Integer]]\n #{ :at :colon :both } {}\n #(format-integer 16 %1 %2 %3))\n\n (\\R\n [:base [nil Integer] :mincol [0 Integer] :padchar [\\space Character] :commachar [\\, Character] \n :commainterval [ 3 Integer]]\n #{ :at :colon :both } {}\n (do\n (cond ; ~R is overloaded with bizareness\n (first (:base params)) #(format-integer (:base %1) %1 %2 %3)\n (and (:at params) (:colon params)) #(format-old-roman %1 %2 %3)\n (:at params) #(format-new-roman %1 %2 %3)\n (:colon params) #(format-ordinal-english %1 %2 %3)\n true #(format-cardinal-english %1 %2 %3))))\n\n (\\P\n [ ]\n #{ :at :colon :both } {}\n (fn [params navigator offsets]\n (let [navigator (if (:colon params) (relative-reposition navigator -1) navigator)\n strs (if (:at params) [\"y\" \"ies\"] [\"\" \"s\"])\n [arg navigator] (next-arg navigator)]\n (print (if (= arg 1) (first strs) (second strs)))\n navigator)))\n\n (\\C\n [:char-format [nil Character]]\n #{ :at :colon :both } {}\n (cond\n (:colon params) pretty-character\n (:at params) readable-character\n :else plain-character))\n\n (\\F\n [ :w [nil Integer] :d [nil Integer] :k [0 Integer] :overflowchar [nil Character] \n :padchar [\\space Character] ]\n #{ :at } {}\n fixed-float)\n\n (\\E\n [ :w [nil Integer] :d [nil Integer] :e [nil Integer] :k [1 Integer] \n :overflowchar [nil Character] :padchar [\\space Character] \n :exponentchar [nil Character] ]\n #{ :at } {}\n exponential-float)\n\n (\\G\n [ :w [nil Integer] :d [nil Integer] :e [nil Integer] :k [1 Integer] \n :overflowchar [nil Character] :padchar [\\space Character] \n :exponentchar [nil Character] ]\n #{ :at } {}\n general-float)\n\n (\\$\n [ :d [2 Integer] :n [1 Integer] :w [0 Integer] :padchar [\\space Character]]\n #{ :at :colon :both} {}\n dollar-float)\n\n (\\% \n [ :count [1 Integer] ] \n #{ } {}\n (fn [params arg-navigator offsets]\n (dotimes [i (:count params)]\n (prn))\n arg-navigator))\n\n (\\&\n [ :count [1 Integer] ] \n #{ :pretty } {}\n (fn [params arg-navigator offsets]\n (let [cnt (:count params)]\n (if (pos? cnt) (fresh-line))\n (dotimes [i (dec cnt)]\n (prn)))\n arg-navigator))\n\n (\\| \n [ :count [1 Integer] ] \n #{ } {}\n (fn [params arg-navigator offsets]\n (dotimes [i (:count params)]\n (print \\formfeed))\n arg-navigator))\n\n (\\~ \n [ :n [1 Integer] ] \n #{ } {}\n (fn [params arg-navigator offsets]\n (let [n (:n params)]\n (print (apply str (repeat n \\~)))\n arg-navigator)))\n\n (\\newline ;; Whitespace supression is handled in the compilation loop\n [ ] \n #{:colon :at} {}\n (fn [params arg-navigator offsets]\n (if (:at params)\n (prn))\n arg-navigator))\n\n (\\T\n [ :colnum [1 Integer] :colinc [1 Integer] ] \n #{ :at :pretty } {}\n (if (:at params)\n #(relative-tabulation %1 %2 %3)\n #(absolute-tabulation %1 %2 %3)))\n\n (\\* \n [ :n [1 Integer] ] \n #{ :colon :at } {}\n (fn [params navigator offsets]\n (let [n (:n params)]\n (if (:at params)\n (absolute-reposition navigator n)\n (relative-reposition navigator (if (:colon params) (- n) n)))\n )))\n\n (\\? \n [ ] \n #{ :at } {}\n (if (:at params)\n (fn [params navigator offsets] ; args from main arg list\n (let [[subformat navigator] (get-format-arg navigator)]\n (execute-sub-format subformat navigator (:base-args params))))\n (fn [params navigator offsets] ; args from sub-list\n (let [[subformat navigator] (get-format-arg navigator)\n [subargs navigator] (next-arg navigator)\n sub-navigator (init-navigator subargs)]\n (execute-sub-format subformat sub-navigator (:base-args params))\n navigator))))\n \n\n (\\(\n [ ]\n #{ :colon :at :both} { :right \\), :allows-separator nil, :else nil }\n (let [mod-case-writer (cond\n (and (:at params) (:colon params))\n upcase-writer\n\n (:colon params)\n capitalize-word-writer\n\n (:at params)\n init-cap-writer\n\n :else\n downcase-writer)]\n #(modify-case mod-case-writer %1 %2 %3)))\n\n (\\) [] #{} {} nil) \n\n (\\[\n [ :selector [nil Integer] ]\n #{ :colon :at } { :right \\], :allows-separator true, :else :last }\n (cond\n (:colon params)\n boolean-conditional\n\n (:at params)\n check-arg-conditional\n\n true\n choice-conditional))\n\n (\\; [:min-remaining [nil Integer] :max-columns [nil Integer]] \n #{ :colon } { :separator true } nil) \n \n (\\] [] #{} {} nil) \n\n (\\{\n [ :max-iterations [nil Integer] ]\n #{ :colon :at :both} { :right \\}, :allows-separator false }\n (cond\n (and (:at params) (:colon params))\n iterate-main-sublists\n\n (:colon params)\n iterate-list-of-sublists\n\n (:at params)\n iterate-main-list\n\n true\n iterate-sublist))\n\n \n (\\} [] #{:colon} {} nil) \n\n (\\<\n [:mincol [0 Integer] :colinc [1 Integer] :minpad [0 Integer] :padchar [\\space Character]]\n #{:colon :at :both :pretty} { :right \\>, :allows-separator true, :else :first }\n logical-block-or-justify)\n\n (\\> [] #{:colon} {} nil) \n\n ;; TODO: detect errors in cases where colon not allowed\n (\\^ [:arg1 [nil Integer] :arg2 [nil Integer] :arg3 [nil Integer]] \n #{:colon} {} \n (fn [params navigator offsets]\n (let [arg1 (:arg1 params)\n arg2 (:arg2 params)\n arg3 (:arg3 params)\n exit (if (:colon params) :colon-up-arrow :up-arrow)]\n (cond\n (and arg1 arg2 arg3)\n (if (<= arg1 arg2 arg3) [exit navigator] navigator)\n\n (and arg1 arg2)\n (if (= arg1 arg2) [exit navigator] navigator)\n\n arg1\n (if (= arg1 0) [exit navigator] navigator)\n\n true ; TODO: handle looking up the arglist stack for info\n (if (if (:colon params) \n (empty? (:rest (:base-args params)))\n (empty? (:rest navigator)))\n [exit navigator] navigator))))) \n\n (\\W \n [] \n #{:at :colon :both :pretty} {}\n (if (or (:at params) (:colon params))\n (let [bindings (concat\n (if (:at params) [:level nil :length nil] [])\n (if (:colon params) [:pretty true] []))]\n (fn [params navigator offsets]\n (let [[arg navigator] (next-arg navigator)]\n (if (apply write arg bindings)\n [:up-arrow navigator]\n navigator))))\n (fn [params navigator offsets]\n (let [[arg navigator] (next-arg navigator)]\n (if (write-out arg)\n [:up-arrow navigator]\n navigator)))))\n\n (\\_\n []\n #{:at :colon :both} {}\n conditional-newline)\n\n (\\I\n [:n [0 Integer]]\n #{:colon} {}\n set-indent)\n )\n\n;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\n;;; Code to manage the parameters and flags associated with each\n;;; directive in the format string.\n;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\n\n(def ^{:private true}\n param-pattern #\"^([vV]|#|('.)|([+-]?\\d+)|(?=,))\")\n(def ^{:private true}\n special-params #{ :parameter-from-args :remaining-arg-count })\n\n(defn- extract-param [[s offset saw-comma]]\n (let [m (re-matcher param-pattern s)\n param (re-find m)]\n (if param\n (let [token-str (first (re-groups m))\n remainder (subs s (.end m))\n new-offset (+ offset (.end m))]\n (if (not (= \\, (nth remainder 0)))\n [ [token-str offset] [remainder new-offset false]]\n [ [token-str offset] [(subs remainder 1) (inc new-offset) true]]))\n (if saw-comma \n (format-error \"Badly formed parameters in format directive\" offset)\n [ nil [s offset]]))))\n\n\n(defn- extract-params [s offset] \n (consume extract-param [s offset false]))\n\n(defn- translate-param\n \"Translate the string representation of a param to the internalized\n representation\"\n [[^String p offset]]\n [(cond \n (= (.length p) 0) nil\n (and (= (.length p) 1) (contains? #{\\v \\V} (nth p 0))) :parameter-from-args\n (and (= (.length p) 1) (= \\# (nth p 0))) :remaining-arg-count\n (and (= (.length p) 2) (= \\' (nth p 0))) (nth p 1)\n true (new Integer p))\n offset])\n \n(def ^{:private true}\n flag-defs { \\: :colon, \\@ :at })\n\n(defn- extract-flags [s offset]\n (consume\n (fn [[s offset flags]]\n (if (empty? s)\n [nil [s offset flags]]\n (let [flag (get flag-defs (first s))]\n (if flag\n (if (contains? flags flag)\n (format-error \n (str \"Flag \\\"\" (first s) \"\\\" appears more than once in a directive\")\n offset)\n [true [(subs s 1) (inc offset) (assoc flags flag [true offset])]])\n [nil [s offset flags]]))))\n [s offset {}]))\n\n(defn- check-flags [def flags]\n (let [allowed (:flags def)]\n (if (and (not (:at allowed)) (:at flags))\n (format-error (str \"\\\"@\\\" is an illegal flag for format directive \\\"\" (:directive def) \"\\\"\")\n (nth (:at flags) 1)))\n (if (and (not (:colon allowed)) (:colon flags))\n (format-error (str \"\\\":\\\" is an illegal flag for format directive \\\"\" (:directive def) \"\\\"\")\n (nth (:colon flags) 1)))\n (if (and (not (:both allowed)) (:at flags) (:colon flags))\n (format-error (str \"Cannot combine \\\"@\\\" and \\\":\\\" flags for format directive \\\"\" \n (:directive def) \"\\\"\")\n (min (nth (:colon flags) 1) (nth (:at flags) 1))))))\n\n(defn- map-params\n \"Takes a directive definition and the list of actual parameters and\na map of flags and returns a map of the parameters and flags with defaults\nfilled in. We check to make sure that there are the right types and number\nof parameters as well.\"\n [def params flags offset]\n (check-flags def flags)\n (if (> (count params) (count (:params def)))\n (format-error \n (cl-format \n nil \n \"Too many parameters for directive \\\"~C\\\": ~D~:* ~[were~;was~:;were~] specified but only ~D~:* ~[are~;is~:;are~] allowed\"\n (:directive def) (count params) (count (:params def)))\n (second (first params))))\n (doall\n (map #(let [val (first %1)]\n (if (not (or (nil? val) (contains? special-params val) \n (instance? (second (second %2)) val)))\n (format-error (str \"Parameter \" (name (first %2))\n \" has bad type in directive \\\"\" (:directive def) \"\\\": \"\n (class val))\n (second %1))) )\n params (:params def)))\n \n (merge ; create the result map\n (into (array-map) ; start with the default values, make sure the order is right\n (reverse (for [[name [default]] (:params def)] [name [default offset]])))\n (reduce #(apply assoc %1 %2) {} (filter #(first (nth % 1)) (zipmap (keys (:params def)) params))) ; add the specified parameters, filtering out nils\n flags)) ; and finally add the flags\n\n(defn- compile-directive [s offset]\n (let [[raw-params [rest offset]] (extract-params s offset)\n [_ [rest offset flags]] (extract-flags rest offset)\n directive (first rest)\n def (get directive-table (Character/toUpperCase ^Character directive))\n params (if def (map-params def (map translate-param raw-params) flags offset))]\n (if (not directive)\n (format-error \"Format string ended in the middle of a directive\" offset))\n (if (not def)\n (format-error (str \"Directive \\\"\" directive \"\\\" is undefined\") offset))\n [(struct compiled-directive ((:generator-fn def) params offset) def params offset)\n (let [remainder (subs rest 1) \n offset (inc offset)\n trim? (and (= \\newline (:directive def))\n (not (:colon params)))\n trim-count (if trim? (prefix-count remainder [\\space \\tab]) 0)\n remainder (subs remainder trim-count)\n offset (+ offset trim-count)]\n [remainder offset])]))\n \n(defn- compile-raw-string [s offset]\n (struct compiled-directive (fn [_ a _] (print s) a) nil { :string s } offset))\n\n(defn- right-bracket [this] (:right (:bracket-info (:def this))))\n(defn- separator? [this] (:separator (:bracket-info (:def this))))\n(defn- else-separator? [this] \n (and (:separator (:bracket-info (:def this)))\n (:colon (:params this))))\n \n\n(declare collect-clauses)\n\n(defn- process-bracket [this remainder]\n (let [[subex remainder] (collect-clauses (:bracket-info (:def this))\n (:offset this) remainder)]\n [(struct compiled-directive \n (:func this) (:def this) \n (merge (:params this) (tuple-map subex (:offset this)))\n (:offset this))\n remainder]))\n\n(defn- process-clause [bracket-info offset remainder]\n (consume \n (fn [remainder]\n (if (empty? remainder)\n (format-error \"No closing bracket found.\" offset)\n (let [this (first remainder)\n remainder (next remainder)]\n (cond\n (right-bracket this)\n (process-bracket this remainder)\n\n (= (:right bracket-info) (:directive (:def this)))\n [ nil [:right-bracket (:params this) nil remainder]]\n\n (else-separator? this)\n [nil [:else nil (:params this) remainder]]\n\n (separator? this)\n [nil [:separator nil nil remainder]] ;; TODO: check to make sure that there are no params on ~;\n\n true\n [this remainder]))))\n remainder))\n\n(defn- collect-clauses [bracket-info offset remainder]\n (second\n (consume\n (fn [[clause-map saw-else remainder]]\n (let [[clause [type right-params else-params remainder]] \n (process-clause bracket-info offset remainder)]\n (cond\n (= type :right-bracket)\n [nil [(merge-with concat clause-map \n {(if saw-else :else :clauses) [clause] \n :right-params right-params})\n remainder]]\n\n (= type :else)\n (cond\n (:else clause-map)\n (format-error \"Two else clauses (\\\"~:;\\\") inside bracket construction.\" offset)\n \n (not (:else bracket-info))\n (format-error \"An else clause (\\\"~:;\\\") is in a bracket type that doesn't support it.\" \n offset)\n\n (and (= :first (:else bracket-info)) (seq (:clauses clause-map)))\n (format-error\n \"The else clause (\\\"~:;\\\") is only allowed in the first position for this directive.\" \n offset)\n \n true ; if the ~:; is in the last position, the else clause\n ; is next, this was a regular clause\n (if (= :first (:else bracket-info))\n [true [(merge-with concat clause-map { :else [clause] :else-params else-params})\n false remainder]]\n [true [(merge-with concat clause-map { :clauses [clause] })\n true remainder]]))\n\n (= type :separator)\n (cond\n saw-else\n (format-error \"A plain clause (with \\\"~;\\\") follows an else clause (\\\"~:;\\\") inside bracket construction.\" offset)\n \n (not (:allows-separator bracket-info))\n (format-error \"A separator (\\\"~;\\\") is in a bracket type that doesn't support it.\" \n offset)\n \n true\n [true [(merge-with concat clause-map { :clauses [clause] })\n false remainder]]))))\n [{ :clauses [] } false remainder])))\n\n(defn- process-nesting\n \"Take a linearly compiled format and process the bracket directives to give it \n the appropriate tree structure\"\n [format]\n (first\n (consume \n (fn [remainder]\n (let [this (first remainder)\n remainder (next remainder)\n bracket (:bracket-info (:def this))]\n (if (:right bracket)\n (process-bracket this remainder)\n [this remainder])))\n format)))\n\n(defn- compile-format \n \"Compiles format-str into a compiled format which can be used as an argument\nto cl-format just like a plain format string. Use this function for improved \nperformance when you're using the same format string repeatedly\"\n [ format-str ]\n; (prlabel compiling format-str)\n (binding [*format-str* format-str]\n (process-nesting\n (first \n (consume \n (fn [[^String s offset]]\n (if (empty? s)\n [nil s]\n (let [tilde (.indexOf s (int \\~))]\n (cond\n (neg? tilde) [(compile-raw-string s offset) [\"\" (+ offset (.length s))]]\n (zero? tilde) (compile-directive (subs s 1) (inc offset))\n true \n [(compile-raw-string (subs s 0 tilde) offset) [(subs s tilde) (+ tilde offset)]]))))\n [format-str 0])))))\n\n(defn- needs-pretty \n \"determine whether a given compiled format has any directives that depend on the\ncolumn number or pretty printing\"\n [format]\n (loop [format format]\n (if (empty? format)\n false\n (if (or (:pretty (:flags (:def (first format))))\n (some needs-pretty (first (:clauses (:params (first format)))))\n (some needs-pretty (first (:else (:params (first format))))))\n true\n (recur (next format))))))\n\n(defn- execute-format \n \"Executes the format with the arguments.\"\n {:skip-wiki true}\n ([stream format args]\n (let [^java.io.Writer real-stream (cond \n (not stream) (java.io.StringWriter.)\n (true? stream) *out*\n :else stream)\n ^java.io.Writer wrapped-stream (if (and (needs-pretty format) \n (not (pretty-writer? real-stream)))\n (get-pretty-writer real-stream)\n real-stream)]\n (binding [*out* wrapped-stream]\n (try\n (execute-format format args)\n (finally\n (if-not (identical? real-stream wrapped-stream)\n (.flush wrapped-stream))))\n (if (not stream) (.toString real-stream)))))\n ([format args]\n (map-passing-context \n (fn [element context]\n (if (abort? context)\n [nil context]\n (let [[params args] (realize-parameter-list \n (:params element) context)\n [params offsets] (unzip-map params)\n params (assoc params :base-args args)]\n [nil (apply (:func element) [params args offsets])])))\n args\n format)\n nil))\n\n;;; This is a bad idea, but it prevents us from leaking private symbols\n;;; This should all be replaced by really compiled formats anyway.\n(def ^{:private true} cached-compile (memoize compile-format))\n\n(defmacro formatter\n \"Makes a function which can directly run format-in. The function is\nfn [stream & args] ... and returns nil unless the stream is nil (meaning \noutput to a string) in which case it returns the resulting string.\n\nformat-in can be either a control string or a previously compiled format.\"\n {:added \"1.2\"}\n [format-in]\n `(let [format-in# ~format-in\n my-c-c# (var-get (get (ns-interns (the-ns 'clojure.pprint))\n '~'cached-compile))\n my-e-f# (var-get (get (ns-interns (the-ns 'clojure.pprint))\n '~'execute-format))\n my-i-n# (var-get (get (ns-interns (the-ns 'clojure.pprint))\n '~'init-navigator))\n cf# (if (string? format-in#) (my-c-c# format-in#) format-in#)]\n (fn [stream# & args#]\n (let [navigator# (my-i-n# args#)]\n (my-e-f# stream# cf# navigator#)))))\n\n(defmacro formatter-out\n \"Makes a function which can directly run format-in. The function is\nfn [& args] ... and returns nil. This version of the formatter macro is\ndesigned to be used with *out* set to an appropriate Writer. In particular,\nthis is meant to be used as part of a pretty printer dispatch method.\n\nformat-in can be either a control string or a previously compiled format.\"\n {:added \"1.2\"}\n [format-in]\n `(let [format-in# ~format-in\n cf# (if (string? format-in#) (#'clojure.pprint/cached-compile format-in#) format-in#)]\n (fn [& args#]\n (let [navigator# (#'clojure.pprint/init-navigator args#)]\n (#'clojure.pprint/execute-format cf# navigator#)))))\n" }, { "path": "src/clj/clojure/pprint/column_writer.clj", "content": ";;; column_writer.clj -- part of the pretty printer for Clojure\n\n\n; Copyright (c) Rich Hickey. All rights reserved.\n; The use and distribution terms for this software are covered by the\n; Eclipse Public License 1.0 (http://opensource.org/licenses/eclipse-1.0.php)\n; which can be found in the file epl-v10.html at the root of this distribution.\n; By using this software in any fashion, you are agreeing to be bound by\n; the terms of this license.\n; You must not remove this notice, or any other, from this software.\n\n;; Author: Tom Faulhaber\n;; April 3, 2009\n;; Revised to use proxy instead of gen-class April 2010\n\n;; This module implements a column-aware wrapper around an instance of java.io.Writer\n\n(in-ns 'clojure.pprint)\n\n(import [clojure.lang IDeref]\n [java.io Writer])\n\n(def ^:dynamic ^{:private true} *default-page-width* 72)\n\n(defn- get-field [^Writer this sym]\n (sym @@this))\n\n(defn- set-field [^Writer this sym new-val] \n (alter @this assoc sym new-val))\n\n(defn- get-column [this]\n (get-field this :cur))\n\n(defn- get-line [this]\n (get-field this :line))\n\n(defn- get-max-column [this]\n (get-field this :max))\n\n(defn- set-max-column [this new-max]\n (dosync (set-field this :max new-max))\n nil)\n\n(defn- get-writer [this]\n (get-field this :base))\n\n(defn- c-write-char [^Writer this ^Integer c]\n (dosync (if (= c (int \\newline))\n\t (do\n (set-field this :cur 0)\n (set-field this :line (inc (get-field this :line))))\n\t (set-field this :cur (inc (get-field this :cur)))))\n (.write ^Writer (get-field this :base) c))\n\n(defn- column-writer \n ([writer] (column-writer writer *default-page-width*))\n ([writer max-columns]\n (let [fields (ref {:max max-columns, :cur 0, :line 0 :base writer})]\n (proxy [Writer IDeref] []\n (deref [] fields)\n (flush []\n (.flush writer))\n (write\n ([^chars cbuf ^Integer off ^Integer len] \n (let [^Writer writer (get-field this :base)] \n (.write writer cbuf off len)))\n ([x]\n (condp = (class x)\n String \n (let [^String s x\n nl (.lastIndexOf s (int \\newline))]\n (dosync (if (neg? nl)\n (set-field this :cur (+ (get-field this :cur) (count s)))\n (do\n (set-field this :cur (- (count s) nl 1))\n (set-field this :line (+ (get-field this :line)\n (count (filter #(= % \\newline) s)))))))\n (.write ^Writer (get-field this :base) s))\n\n Integer\n (c-write-char this x)\n Long\n (c-write-char this x))))))))\n" }, { "path": "src/clj/clojure/pprint/dispatch.clj", "content": ";; dispatch.clj -- part of the pretty printer for Clojure\n\n; Copyright (c) Rich Hickey. All rights reserved.\n; The use and distribution terms for this software are covered by the\n; Eclipse Public License 1.0 (http://opensource.org/licenses/eclipse-1.0.php)\n; which can be found in the file epl-v10.html at the root of this distribution.\n; By using this software in any fashion, you are agreeing to be bound by\n; the terms of this license.\n; You must not remove this notice, or any other, from this software.\n\n;; Author: Tom Faulhaber\n;; April 3, 2009\n\n\n;; This module implements the default dispatch tables for pretty printing code and\n;; data.\n\n(in-ns 'clojure.pprint)\n\n(defn- use-method\n \"Installs a function as a new method of multimethod associated with dispatch-value. \"\n [multifn dispatch-val func]\n (. multifn addMethod dispatch-val func))\n\n;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\n;; Implementations of specific dispatch table entries\n;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\n\n;;; Handle forms that can be \"back-translated\" to reader macros\n;;; Not all reader macros can be dealt with this way or at all. \n;;; Macros that we can't deal with at all are:\n;;; ; - The comment character is absorbed by the reader and never is part of the form\n;;; ` - Is fully processed at read time into a lisp expression (which will contain concats\n;;; and regular quotes).\n;;; ~@ - Also fully eaten by the processing of ` and can't be used outside.\n;;; , - is whitespace and is lost (like all other whitespace). Formats can generate commas\n;;; where they deem them useful to help readability.\n;;; ^ - Adding metadata completely disappears at read time and the data appears to be\n;;; completely lost.\n;;;\n;;; Most other syntax stuff is dealt with directly by the formats (like (), [], {}, and #{})\n;;; or directly by printing the objects using Clojure's built-in print functions (like\n;;; :keyword, \\char, or \"\"). The notable exception is #() which is special-cased.\n\n(def ^{:private true} reader-macros\n {'quote \"'\", 'clojure.core/deref \"@\", \n 'var \"#'\", 'clojure.core/unquote \"~\"})\n\n(defn- pprint-reader-macro [alis]\n (let [^String macro-char (reader-macros (first alis))]\n (when (and macro-char (= 2 (count alis)))\n (.write ^java.io.Writer *out* macro-char)\n (write-out (second alis))\n true)))\n\n;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\n;; Dispatch for the basic data types when interpreted\n;; as data (as opposed to code).\n;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\n\n;;; TODO: inline these formatter statements into funcs so that we\n;;; are a little easier on the stack. (Or, do \"real\" compilation, a\n;;; la Common Lisp)\n\n;;; (def pprint-simple-list (formatter-out \"~:<~@{~w~^ ~_~}~:>\"))\n(defn- pprint-simple-list [alis]\n (pprint-logical-block :prefix \"(\" :suffix \")\"\n (print-length-loop [alis (seq alis)]\n (when alis\n\t(write-out (first alis))\n\t(when (next alis)\n\t (.write ^java.io.Writer *out* \" \")\n\t (pprint-newline :linear)\n\t (recur (next alis)))))))\n\n(defn- pprint-list [alis]\n (if-not (pprint-reader-macro alis)\n (pprint-simple-list alis)))\n\n;;; (def pprint-vector (formatter-out \"~<[~;~@{~w~^ ~_~}~;]~:>\"))\n(defn- pprint-vector [avec]\n (pprint-logical-block :prefix \"[\" :suffix \"]\"\n (print-length-loop [aseq (seq avec)]\n (when aseq\n\t(write-out (first aseq))\n\t(when (next aseq)\n\t (.write ^java.io.Writer *out* \" \")\n\t (pprint-newline :linear)\n\t (recur (next aseq)))))))\n\n(def ^{:private true} pprint-array (formatter-out \"~<[~;~@{~w~^, ~:_~}~;]~:>\"))\n\n;;; (def pprint-map (formatter-out \"~<{~;~@{~<~w~^ ~_~w~:>~^, ~_~}~;}~:>\"))\n(defn- pprint-map [amap]\n (pprint-logical-block :prefix \"{\" :suffix \"}\"\n (print-length-loop [aseq (seq amap)]\n (when aseq\n\t(pprint-logical-block \n (write-out (ffirst aseq))\n (.write ^java.io.Writer *out* \" \")\n (pprint-newline :linear)\n (set! *current-length* 0) ; always print both parts of the [k v] pair\n (write-out (fnext (first aseq))))\n (when (next aseq)\n (.write ^java.io.Writer *out* \", \")\n (pprint-newline :linear)\n (recur (next aseq)))))))\n\n(def ^{:private true} pprint-set (formatter-out \"~<#{~;~@{~w~^ ~:_~}~;}~:>\"))\n\n(def ^{:private true} \n type-map {\"core$future_call\" \"Future\",\n \"core$promise\" \"Promise\"})\n\n(defn- map-ref-type \n \"Map ugly type names to something simpler\"\n [name]\n (or (when-let [match (re-find #\"^[^$]+\\$[^$]+\" name)]\n (type-map match))\n name))\n\n(defn- pprint-ideref [o]\n (let [prefix (format \"#<%s@%x%s: \"\n (map-ref-type (.getSimpleName (class o)))\n (System/identityHashCode o)\n (if (and (instance? clojure.lang.Agent o)\n (agent-error o))\n \" FAILED\"\n \"\"))]\n (pprint-logical-block :prefix prefix :suffix \">\"\n (pprint-indent :block (-> (count prefix) (- 2) -))\n (pprint-newline :linear)\n (write-out (cond \n (and (future? o) (not (future-done? o))) :pending\n (and (instance? clojure.lang.IPending o) (not (.isRealized o))) :not-delivered\n :else @o)))))\n\n(def ^{:private true} pprint-pqueue (formatter-out \"~<<-(~;~@{~w~^ ~_~}~;)-<~:>\"))\n\n(defn- pprint-simple-default [obj]\n (cond \n (.isArray (class obj)) (pprint-array obj)\n (and *print-suppress-namespaces* (symbol? obj)) (print (name obj))\n :else (pr obj)))\n\n\n(defmulti \n simple-dispatch\n \"The pretty print dispatch function for simple data structure format.\"\n {:added \"1.2\" :arglists '[[object]]} \n class)\n\n(use-method simple-dispatch clojure.lang.ISeq pprint-list)\n(use-method simple-dispatch clojure.lang.IPersistentVector pprint-vector)\n(use-method simple-dispatch clojure.lang.IPersistentMap pprint-map)\n(use-method simple-dispatch clojure.lang.IPersistentSet pprint-set)\n(use-method simple-dispatch clojure.lang.PersistentQueue pprint-pqueue)\n(use-method simple-dispatch clojure.lang.IDeref pprint-ideref)\n(use-method simple-dispatch nil pr)\n(use-method simple-dispatch :default pprint-simple-default)\n\n;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\n;;; Dispatch for the code table\n;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\n\n(declare pprint-simple-code-list)\n\n;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\n;;; Format the namespace (\"ns\") macro. This is quite complicated because of all the\n;;; different forms supported and because programmers can choose lists or vectors\n;;; in various places.\n;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\n\n(defn- brackets\n \"Figure out which kind of brackets to use\"\n [form]\n (if (vector? form)\n [\"[\" \"]\"]\n [\"(\" \")\"]))\n\n(defn- pprint-ns-reference\n \"Pretty print a single reference (import, use, etc.) from a namespace decl\"\n [reference]\n (if (sequential? reference)\n (let [[start end] (brackets reference)\n [keyw & args] reference]\n (pprint-logical-block :prefix start :suffix end\n ((formatter-out \"~w~:i\") keyw)\n (loop [args args]\n (when (seq args)\n ((formatter-out \" \"))\n (let [arg (first args)]\n (if (sequential? arg)\n (let [[start end] (brackets arg)]\n (pprint-logical-block :prefix start :suffix end\n (if (and (= (count arg) 3) (keyword? (second arg)))\n (let [[ns kw lis] arg]\n ((formatter-out \"~w ~w \") ns kw)\n (if (sequential? lis)\n ((formatter-out (if (vector? lis)\n \"~<[~;~@{~w~^ ~:_~}~;]~:>\"\n \"~<(~;~@{~w~^ ~:_~}~;)~:>\"))\n lis)\n (write-out lis)))\n (apply (formatter-out \"~w ~:i~@{~w~^ ~:_~}\") arg)))\n (when (next args)\n ((formatter-out \"~_\"))))\n (do\n (write-out arg)\n (when (next args)\n ((formatter-out \"~:_\"))))))\n (recur (next args))))))\n (write-out reference)))\n\n(defn- pprint-ns\n \"The pretty print dispatch chunk for the ns macro\"\n [alis]\n (if (next alis) \n (let [[ns-sym ns-name & stuff] alis\n [doc-str stuff] (if (string? (first stuff))\n [(first stuff) (next stuff)]\n [nil stuff])\n [attr-map references] (if (map? (first stuff))\n [(first stuff) (next stuff)]\n [nil stuff])]\n (pprint-logical-block :prefix \"(\" :suffix \")\"\n ((formatter-out \"~w ~1I~@_~w\") ns-sym ns-name)\n (when (or doc-str attr-map (seq references))\n ((formatter-out \"~@:_\")))\n (when doc-str\n (cl-format true \"\\\"~a\\\"~:[~;~:@_~]\" doc-str (or attr-map (seq references))))\n (when attr-map\n ((formatter-out \"~w~:[~;~:@_~]\") attr-map (seq references)))\n (loop [references references]\n (pprint-ns-reference (first references))\n (when-let [references (next references)]\n (pprint-newline :linear)\n (recur references)))))\n (write-out alis)))\n\n;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\n;;; Format something that looks like a simple def (sans metadata, since the reader\n;;; won't give it to us now).\n;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\n\n(def ^{:private true} pprint-hold-first (formatter-out \"~:<~w~^ ~@_~w~^ ~_~@{~w~^ ~_~}~:>\"))\n\n;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\n;;; Format something that looks like a defn or defmacro\n;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\n\n;;; Format the params and body of a defn with a single arity\n(defn- single-defn [alis has-doc-str?]\n (if (seq alis)\n (do\n (if has-doc-str?\n ((formatter-out \" ~_\"))\n ((formatter-out \" ~@_\")))\n ((formatter-out \"~{~w~^ ~_~}\") alis))))\n\n;;; Format the param and body sublists of a defn with multiple arities\n(defn- multi-defn [alis has-doc-str?]\n (if (seq alis)\n ((formatter-out \" ~_~{~w~^ ~_~}\") alis)))\n\n;;; TODO: figure out how to support capturing metadata in defns (we might need a \n;;; special reader)\n(defn- pprint-defn [alis]\n (if (next alis) \n (let [[defn-sym defn-name & stuff] alis\n [doc-str stuff] (if (string? (first stuff))\n [(first stuff) (next stuff)]\n [nil stuff])\n [attr-map stuff] (if (map? (first stuff))\n [(first stuff) (next stuff)]\n [nil stuff])]\n (pprint-logical-block :prefix \"(\" :suffix \")\"\n ((formatter-out \"~w ~1I~@_~w\") defn-sym defn-name)\n (if doc-str\n ((formatter-out \" ~_~w\") doc-str))\n (if attr-map\n ((formatter-out \" ~_~w\") attr-map))\n ;; Note: the multi-defn case will work OK for malformed defns too\n (cond\n (vector? (first stuff)) (single-defn stuff (or doc-str attr-map))\n :else (multi-defn stuff (or doc-str attr-map)))))\n (pprint-simple-code-list alis)))\n\n;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\n;;; Format something with a binding form\n;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\n\n(defn- pprint-binding-form [binding-vec]\n (pprint-logical-block :prefix \"[\" :suffix \"]\"\n (print-length-loop [binding binding-vec]\n (when (seq binding)\n (pprint-logical-block binding\n (write-out (first binding))\n (when (next binding)\n (.write ^java.io.Writer *out* \" \")\n (pprint-newline :miser)\n (write-out (second binding))))\n (when (next (rest binding))\n (.write ^java.io.Writer *out* \" \")\n (pprint-newline :linear)\n (recur (next (rest binding))))))))\n\n(defn- pprint-let [alis]\n (let [base-sym (first alis)]\n (pprint-logical-block :prefix \"(\" :suffix \")\"\n (if (and (next alis) (vector? (second alis)))\n (do\n ((formatter-out \"~w ~1I~@_\") base-sym)\n (pprint-binding-form (second alis))\n ((formatter-out \" ~_~{~w~^ ~_~}\") (next (rest alis))))\n (pprint-simple-code-list alis)))))\n\n\n;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\n;;; Format something that looks like \"if\"\n;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\n\n(def ^{:private true} pprint-if (formatter-out \"~:<~1I~w~^ ~@_~w~@{ ~_~w~}~:>\"))\n\n(defn- pprint-cond [alis]\n (pprint-logical-block :prefix \"(\" :suffix \")\"\n (pprint-indent :block 1)\n (write-out (first alis))\n (when (next alis)\n (.write ^java.io.Writer *out* \" \")\n (pprint-newline :linear)\n (print-length-loop [alis (next alis)]\n (when alis\n (pprint-logical-block alis\n (write-out (first alis))\n (when (next alis)\n (.write ^java.io.Writer *out* \" \")\n (pprint-newline :miser)\n (write-out (second alis))))\n (when (next (rest alis))\n (.write ^java.io.Writer *out* \" \")\n (pprint-newline :linear)\n (recur (next (rest alis)))))))))\n\n(defn- pprint-condp [alis]\n (if (> (count alis) 3) \n (pprint-logical-block :prefix \"(\" :suffix \")\"\n (pprint-indent :block 1)\n (apply (formatter-out \"~w ~@_~w ~@_~w ~_\") alis)\n (print-length-loop [alis (seq (drop 3 alis))]\n (when alis\n (pprint-logical-block alis\n (write-out (first alis))\n (when (next alis)\n (.write ^java.io.Writer *out* \" \")\n (pprint-newline :miser)\n (write-out (second alis))))\n (when (next (rest alis))\n (.write ^java.io.Writer *out* \" \")\n (pprint-newline :linear)\n (recur (next (rest alis)))))))\n (pprint-simple-code-list alis)))\n\n;;; The map of symbols that are defined in an enclosing #() anonymous function\n(def ^:dynamic ^{:private true} *symbol-map* {})\n\n(defn- pprint-anon-func [alis]\n (let [args (second alis)\n nlis (first (rest (rest alis)))]\n (if (vector? args)\n (binding [*symbol-map* (if (= 1 (count args)) \n {(first args) \"%\"}\n (into {} \n (map \n #(vector %1 (str \\% %2)) \n args \n (range 1 (inc (count args))))))]\n ((formatter-out \"~<#(~;~@{~w~^ ~_~}~;)~:>\") nlis))\n (pprint-simple-code-list alis))))\n\n;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\n;;; The master definitions for formatting lists in code (that is, (fn args...) or\n;;; special forms).\n;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\n\n;;; This is the equivalent of (formatter-out \"~:<~1I~@{~w~^ ~_~}~:>\"), but is\n;;; easier on the stack.\n\n(defn- pprint-simple-code-list [alis]\n (pprint-logical-block :prefix \"(\" :suffix \")\"\n (pprint-indent :block 1)\n (print-length-loop [alis (seq alis)]\n (when alis\n\t(write-out (first alis))\n\t(when (next alis)\n\t (.write ^java.io.Writer *out* \" \")\n\t (pprint-newline :linear)\n\t (recur (next alis)))))))\n\n;;; Take a map with symbols as keys and add versions with no namespace.\n;;; That is, if ns/sym->val is in the map, add sym->val to the result.\n(defn- two-forms [amap]\n (into {} \n (mapcat \n identity \n (for [x amap] \n [x [(symbol (name (first x))) (second x)]]))))\n\n(defn- add-core-ns [amap]\n (let [core \"clojure.core\"]\n (into {}\n (map #(let [[s f] %] \n (if (not (or (namespace s) (special-symbol? s)))\n [(symbol core (name s)) f]\n %))\n amap))))\n\n(def ^:dynamic ^{:private true} *code-table*\n (two-forms\n (add-core-ns\n {'def pprint-hold-first, 'defonce pprint-hold-first, \n\t'defn pprint-defn, 'defn- pprint-defn, 'defmacro pprint-defn, 'fn pprint-defn,\n 'let pprint-let, 'loop pprint-let, 'binding pprint-let,\n 'with-local-vars pprint-let, 'with-open pprint-let, 'when-let pprint-let,\n\t'if-let pprint-let, 'doseq pprint-let, 'dotimes pprint-let,\n\t'when-first pprint-let,\n 'if pprint-if, 'if-not pprint-if, 'when pprint-if, 'when-not pprint-if,\n 'cond pprint-cond, 'condp pprint-condp,\n 'fn* pprint-anon-func,\n '. pprint-hold-first, '.. pprint-hold-first, '-> pprint-hold-first,\n 'locking pprint-hold-first, 'struct pprint-hold-first,\n 'struct-map pprint-hold-first, 'ns pprint-ns \n })))\n\n(defn- pprint-code-list [alis]\n (if-not (pprint-reader-macro alis) \n (if-let [special-form (*code-table* (first alis))]\n (special-form alis)\n (pprint-simple-code-list alis))))\n\n(defn- pprint-code-symbol [sym] \n (if-let [arg-num (sym *symbol-map*)]\n (print arg-num)\n (if *print-suppress-namespaces* \n (print (name sym))\n (pr sym))))\n\n(defmulti \n code-dispatch\n \"The pretty print dispatch function for pretty printing Clojure code.\"\n {:added \"1.2\" :arglists '[[object]]} \n class)\n\n(use-method code-dispatch clojure.lang.ISeq pprint-code-list)\n(use-method code-dispatch clojure.lang.Symbol pprint-code-symbol)\n\n;; The following are all exact copies of simple-dispatch\n(use-method code-dispatch clojure.lang.IPersistentVector pprint-vector)\n(use-method code-dispatch clojure.lang.IPersistentMap pprint-map)\n(use-method code-dispatch clojure.lang.IPersistentSet pprint-set)\n(use-method code-dispatch clojure.lang.PersistentQueue pprint-pqueue)\n(use-method code-dispatch clojure.lang.IDeref pprint-ideref)\n(use-method code-dispatch nil pr)\n(use-method code-dispatch :default pprint-simple-default)\n\n(set-pprint-dispatch simple-dispatch)\n\n\n;;; For testing\n(comment\n\n(with-pprint-dispatch code-dispatch \n (pprint \n '(defn cl-format \n \"An implementation of a Common Lisp compatible format function\"\n [stream format-in & args]\n (let [compiled-format (if (string? format-in) (compile-format format-in) format-in)\n navigator (init-navigator args)]\n (execute-format stream compiled-format navigator)))))\n\n(with-pprint-dispatch code-dispatch \n (pprint \n '(defn cl-format \n [stream format-in & args]\n (let [compiled-format (if (string? format-in) (compile-format format-in) format-in)\n navigator (init-navigator args)]\n (execute-format stream compiled-format navigator)))))\n\n(with-pprint-dispatch code-dispatch \n (pprint\n '(defn- -write \n ([this x]\n (condp = (class x)\n String \n (let [s0 (write-initial-lines this x)\n s (.replaceFirst s0 \"\\\\s+$\" \"\")\n white-space (.substring s0 (count s))\n mode (getf :mode)]\n (if (= mode :writing)\n (dosync\n (write-white-space this)\n (.col_write this s)\n (setf :trailing-white-space white-space))\n (add-to-buffer this (make-buffer-blob s white-space))))\n\n Integer\n (let [c ^Character x]\n (if (= (getf :mode) :writing)\n (do \n (write-white-space this)\n (.col_write this x))\n (if (= c (int \\newline))\n (write-initial-lines this \"\\n\")\n (add-to-buffer this (make-buffer-blob (str (char c)) nil))))))))))\n\n(with-pprint-dispatch code-dispatch \n (pprint \n '(defn pprint-defn [writer alis]\n (if (next alis) \n (let [[defn-sym defn-name & stuff] alis\n [doc-str stuff] (if (string? (first stuff))\n [(first stuff) (next stuff)]\n [nil stuff])\n [attr-map stuff] (if (map? (first stuff))\n [(first stuff) (next stuff)]\n [nil stuff])]\n (pprint-logical-block writer :prefix \"(\" :suffix \")\"\n (cl-format true \"~w ~1I~@_~w\" defn-sym defn-name)\n (if doc-str\n (cl-format true \" ~_~w\" doc-str))\n (if attr-map\n (cl-format true \" ~_~w\" attr-map))\n ;; Note: the multi-defn case will work OK for malformed defns too\n (cond\n (vector? (first stuff)) (single-defn stuff (or doc-str attr-map))\n :else (multi-defn stuff (or doc-str attr-map)))))\n (pprint-simple-code-list writer alis)))))\n)\nnil\n\n" }, { "path": "src/clj/clojure/pprint/pprint_base.clj", "content": ";;; pprint_base.clj -- part of the pretty printer for Clojure\n\n; Copyright (c) Rich Hickey. All rights reserved.\n; The use and distribution terms for this software are covered by the\n; Eclipse Public License 1.0 (http://opensource.org/licenses/eclipse-1.0.php)\n; which can be found in the file epl-v10.html at the root of this distribution.\n; By using this software in any fashion, you are agreeing to be bound by\n; the terms of this license.\n; You must not remove this notice, or any other, from this software.\n\n;; Author: Tom Faulhaber\n;; April 3, 2009\n\n\n;; This module implements the generic pretty print functions and special variables\n\n(in-ns 'clojure.pprint)\n\n;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\n;; Variables that control the pretty printer\n;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\n\n;;;\n;;; *print-length*, *print-level* and *print-dup* are defined in clojure.core\n;;; TODO: use *print-dup* here (or is it supplanted by other variables?)\n;;; TODO: make dispatch items like \"(let...\" get counted in *print-length*\n;;; constructs\n\n\n(def ^:dynamic\n ^{:doc \"Bind to true if you want write to use pretty printing\", :added \"1.2\"}\n *print-pretty* true)\n\n(defonce ^:dynamic ; If folks have added stuff here, don't overwrite\n ^{:doc \"The pretty print dispatch function. Use with-pprint-dispatch or set-pprint-dispatch\nto modify.\",\n :added \"1.2\"}\n *print-pprint-dispatch* nil)\n\n(def ^:dynamic\n ^{:doc \"Pretty printing will try to avoid anything going beyond this column.\nSet it to nil to have pprint let the line be arbitrarily long. This will ignore all \nnon-mandatory newlines.\",\n :added \"1.2\"}\n *print-right-margin* 72)\n\n(def ^:dynamic\n ^{:doc \"The column at which to enter miser style. Depending on the dispatch table, \nmiser style add newlines in more places to try to keep lines short allowing for further \nlevels of nesting.\",\n :added \"1.2\"}\n *print-miser-width* 40)\n\n;;; TODO implement output limiting\n(def ^:dynamic\n ^{:private true,\n :doc \"Maximum number of lines to print in a pretty print instance (N.B. This is not yet used)\"}\n *print-lines* nil)\n\n;;; TODO: implement circle and shared\n(def ^:dynamic\n ^{:private true,\n :doc \"Mark circular structures (N.B. This is not yet used)\"}\n *print-circle* nil)\n\n;;; TODO: should we just use *print-dup* here?\n(def ^:dynamic\n ^{:private true,\n :doc \"Mark repeated structures rather than repeat them (N.B. This is not yet used)\"}\n *print-shared* nil)\n\n(def ^:dynamic\n ^{:doc \"Don't print namespaces with symbols. This is particularly useful when \npretty printing the results of macro expansions\"\n :added \"1.2\"}\n *print-suppress-namespaces* nil)\n\n;;; TODO: support print-base and print-radix in cl-format\n;;; TODO: support print-base and print-radix in rationals\n(def ^:dynamic\n ^{:doc \"Print a radix specifier in front of integers and rationals. If *print-base* is 2, 8, \nor 16, then the radix specifier used is #b, #o, or #x, respectively. Otherwise the \nradix specifier is in the form #XXr where XX is the decimal value of *print-base* \"\n :added \"1.2\"}\n *print-radix* nil)\n\n(def ^:dynamic\n ^{:doc \"The base to use for printing integers and rationals.\"\n :added \"1.2\"}\n *print-base* 10)\n\n\n\n;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\n;; Internal variables that keep track of where we are in the \n;; structure\n;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\n\n(def ^:dynamic ^{ :private true } *current-level* 0)\n\n(def ^:dynamic ^{ :private true } *current-length* nil)\n\n;; TODO: add variables for length, lines.\n\n;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\n;; Support for the write function\n;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\n\n(declare format-simple-number)\n\n(def ^{:private true} orig-pr pr)\n\n(defn- pr-with-base [x]\n (if-let [s (format-simple-number x)]\n (print s)\n (orig-pr x)))\n\n(def ^{:private true} write-option-table\n {;:array *print-array*\n :base 'clojure.pprint/*print-base*,\n ;;:case *print-case*,\n :circle 'clojure.pprint/*print-circle*,\n ;;:escape *print-escape*,\n ;;:gensym *print-gensym*,\n :length 'clojure.core/*print-length*,\n :level 'clojure.core/*print-level*,\n :lines 'clojure.pprint/*print-lines*,\n :miser-width 'clojure.pprint/*print-miser-width*,\n :dispatch 'clojure.pprint/*print-pprint-dispatch*,\n :pretty 'clojure.pprint/*print-pretty*,\n :radix 'clojure.pprint/*print-radix*,\n :readably 'clojure.core/*print-readably*,\n :right-margin 'clojure.pprint/*print-right-margin*,\n :suppress-namespaces 'clojure.pprint/*print-suppress-namespaces*})\n\n\n(defmacro ^{:private true} binding-map [amap & body]\n (let []\n `(do\n (. clojure.lang.Var (pushThreadBindings ~amap))\n (try\n ~@body\n (finally\n (. clojure.lang.Var (popThreadBindings)))))))\n\n(defn- table-ize [t m] \n (apply hash-map (mapcat \n #(when-let [v (get t (key %))] [(find-var v) (val %)]) \n m)))\n\n(defn- pretty-writer? \n \"Return true iff x is a PrettyWriter\"\n [x] (and (instance? clojure.lang.IDeref x) (:pretty-writer @@x)))\n\n(defn- make-pretty-writer \n \"Wrap base-writer in a PrettyWriter with the specified right-margin and miser-width\"\n [base-writer right-margin miser-width]\n (pretty-writer base-writer right-margin miser-width))\n\n(defmacro ^{:private true} with-pretty-writer [base-writer & body]\n `(let [base-writer# ~base-writer\n new-writer# (not (pretty-writer? base-writer#))]\n (binding [*out* (if new-writer#\n (make-pretty-writer base-writer# *print-right-margin* *print-miser-width*)\n base-writer#)]\n ~@body\n (.ppflush *out*))))\n\n\n;;;TODO: if pretty print is not set, don't use pr but rather something that respects *print-base*, etc.\n(defn write-out \n \"Write an object to *out* subject to the current bindings of the printer control \nvariables. Use the kw-args argument to override individual variables for this call (and \nany recursive calls).\n\n*out* must be a PrettyWriter if pretty printing is enabled. This is the responsibility\nof the caller.\n\nThis method is primarily intended for use by pretty print dispatch functions that \nalready know that the pretty printer will have set up their environment appropriately.\nNormal library clients should use the standard \\\"write\\\" interface. \"\n {:added \"1.2\"}\n [object]\n (let [length-reached (and \n *current-length*\n *print-length*\n (>= *current-length* *print-length*))]\n (if-not *print-pretty*\n (pr object)\n (if length-reached\n (print \"...\")\n (do\n (if *current-length* (set! *current-length* (inc *current-length*)))\n (*print-pprint-dispatch* object))))\n length-reached))\n\n(defn write \n \"Write an object subject to the current bindings of the printer control variables.\nUse the kw-args argument to override individual variables for this call (and any \nrecursive calls). Returns the string result if :stream is nil or nil otherwise.\n\nThe following keyword arguments can be passed with values:\n Keyword Meaning Default value\n :stream Writer for output or nil true (indicates *out*)\n :base Base to use for writing rationals Current value of *print-base*\n :circle* If true, mark circular structures Current value of *print-circle*\n :length Maximum elements to show in sublists Current value of *print-length*\n :level Maximum depth Current value of *print-level*\n :lines* Maximum lines of output Current value of *print-lines*\n :miser-width Width to enter miser mode Current value of *print-miser-width*\n :dispatch The pretty print dispatch function Current value of *print-pprint-dispatch*\n :pretty If true, do pretty printing Current value of *print-pretty*\n :radix If true, prepend a radix specifier Current value of *print-radix*\n :readably* If true, print readably Current value of *print-readably*\n :right-margin The column for the right margin Current value of *print-right-margin*\n :suppress-namespaces If true, no namespaces in symbols Current value of *print-suppress-namespaces*\n\n * = not yet supported\n\"\n {:added \"1.2\"}\n [object & kw-args]\n (let [options (merge {:stream true} (apply hash-map kw-args))]\n (binding-map (table-ize write-option-table options) \n (binding-map (if (or (not (= *print-base* 10)) *print-radix*) {#'pr pr-with-base} {}) \n (let [optval (if (contains? options :stream) \n (:stream options)\n true) \n base-writer (condp = optval\n nil (java.io.StringWriter.)\n true *out*\n optval)]\n (if *print-pretty*\n (with-pretty-writer base-writer\n (write-out object))\n (binding [*out* base-writer]\n (pr object)))\n (if (nil? optval) \n (.toString ^java.io.StringWriter base-writer)))))))\n\n\n(defn pprint \n \"Pretty print object to the optional output writer. If the writer is not provided, \nprint the object to the currently bound value of *out*.\"\n {:added \"1.2\"}\n ([object] (pprint object *out*)) \n ([object writer]\n (with-pretty-writer writer\n (binding [*print-pretty* true]\n (binding-map (if (or (not (= *print-base* 10)) *print-radix*) {#'pr pr-with-base} {}) \n (write-out object)))\n (if (not (= 0 (get-column *out*)))\n (prn)))))\n\n(defmacro pp \n \"A convenience macro that pretty prints the last thing output. This is\nexactly equivalent to (pprint *1).\"\n {:added \"1.2\"}\n [] `(pprint *1))\n\n(defn set-pprint-dispatch \n \"Set the pretty print dispatch function to a function matching (fn [obj] ...)\nwhere obj is the object to pretty print. That function will be called with *out* set\nto a pretty printing writer to which it should do its printing.\n\nFor example functions, see simple-dispatch and code-dispatch in \nclojure.pprint.dispatch.clj.\"\n {:added \"1.2\"}\n [function]\n (let [old-meta (meta #'*print-pprint-dispatch*)]\n (alter-var-root #'*print-pprint-dispatch* (constantly function))\n (alter-meta! #'*print-pprint-dispatch* (constantly old-meta)))\n nil)\n\n(defmacro with-pprint-dispatch \n \"Execute body with the pretty print dispatch function bound to function.\"\n {:added \"1.2\"}\n [function & body]\n `(binding [*print-pprint-dispatch* ~function]\n ~@body))\n\n;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\n;; Support for the functional interface to the pretty printer\n;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\n\n(defn- parse-lb-options [opts body]\n (loop [body body\n acc []]\n (if (opts (first body))\n (recur (drop 2 body) (concat acc (take 2 body)))\n [(apply hash-map acc) body])))\n\n(defn- check-enumerated-arg [arg choices]\n (if-not (choices arg)\n (throw\n (IllegalArgumentException.\n ;; TODO clean up choices string\n (str \"Bad argument: \" arg \". It must be one of \" choices)))))\n\n(defn- level-exceeded []\n (and *print-level* (>= *current-level* *print-level*)))\n\n(defmacro pprint-logical-block \n \"Execute the body as a pretty printing logical block with output to *out* which \nmust be a pretty printing writer. When used from pprint or cl-format, this can be \nassumed. \n\nThis function is intended for use when writing custom dispatch functions.\n\nBefore the body, the caller can optionally specify options: :prefix, :per-line-prefix, \nand :suffix.\"\n {:added \"1.2\", :arglists '[[options* body]]}\n [& args]\n (let [[options body] (parse-lb-options #{:prefix :per-line-prefix :suffix} args)]\n `(do (if (#'clojure.pprint/level-exceeded) \n (.write ^java.io.Writer *out* \"#\")\n (do \n (push-thread-bindings {#'clojure.pprint/*current-level*\n (inc (var-get #'clojure.pprint/*current-level*))\n #'clojure.pprint/*current-length* 0})\n (try \n (#'clojure.pprint/start-block *out*\n ~(:prefix options) ~(:per-line-prefix options) ~(:suffix options))\n ~@body\n (#'clojure.pprint/end-block *out*)\n (finally \n (pop-thread-bindings)))))\n nil)))\n\n(defn pprint-newline\n \"Print a conditional newline to a pretty printing stream. kind specifies if the \nnewline is :linear, :miser, :fill, or :mandatory. \n\nThis function is intended for use when writing custom dispatch functions.\n\nOutput is sent to *out* which must be a pretty printing writer.\"\n {:added \"1.2\"}\n [kind] \n (check-enumerated-arg kind #{:linear :miser :fill :mandatory})\n (nl *out* kind))\n\n(defn pprint-indent \n \"Create an indent at this point in the pretty printing stream. This defines how \nfollowing lines are indented. relative-to can be either :block or :current depending \nwhether the indent should be computed relative to the start of the logical block or\nthe current column position. n is an offset. \n\nThis function is intended for use when writing custom dispatch functions.\n\nOutput is sent to *out* which must be a pretty printing writer.\"\n {:added \"1.2\"}\n [relative-to n] \n (check-enumerated-arg relative-to #{:block :current})\n (indent *out* relative-to n))\n\n;; TODO a real implementation for pprint-tab\n(defn pprint-tab \n \"Tab at this point in the pretty printing stream. kind specifies whether the tab\nis :line, :section, :line-relative, or :section-relative. \n\nColnum and colinc specify the target column and the increment to move the target\nforward if the output is already past the original target.\n\nThis function is intended for use when writing custom dispatch functions.\n\nOutput is sent to *out* which must be a pretty printing writer.\n\nTHIS FUNCTION IS NOT YET IMPLEMENTED.\"\n {:added \"1.2\"}\n [kind colnum colinc] \n (check-enumerated-arg kind #{:line :section :line-relative :section-relative})\n (throw (UnsupportedOperationException. \"pprint-tab is not yet implemented\")))\n\n\n;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\n;;;\n;;; Helpers for dispatch function writing\n;;;\n;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\n\n(defn- pll-mod-body [var-sym body]\n (letfn [(inner [form]\n (if (seq? form)\n (let [form (macroexpand form)] \n (condp = (first form)\n 'loop* form\n 'recur (concat `(recur (inc ~var-sym)) (rest form))\n (walk inner identity form)))\n form))]\n (walk inner identity body)))\n\n(defmacro print-length-loop\n \"A version of loop that iterates at most *print-length* times. This is designed \nfor use in pretty-printer dispatch functions.\"\n {:added \"1.3\"}\n [bindings & body]\n (let [count-var (gensym \"length-count\")\n mod-body (pll-mod-body count-var body)]\n `(loop ~(apply vector count-var 0 bindings)\n (if (or (not *print-length*) (< ~count-var *print-length*))\n (do ~@mod-body)\n (.write ^java.io.Writer *out* \"...\")))))\n\nnil\n" }, { "path": "src/clj/clojure/pprint/pretty_writer.clj", "content": ";;; pretty_writer.clj -- part of the pretty printer for Clojure\n\n; Copyright (c) Rich Hickey. All rights reserved.\n; The use and distribution terms for this software are covered by the\n; Eclipse Public License 1.0 (http://opensource.org/licenses/eclipse-1.0.php)\n; which can be found in the file epl-v10.html at the root of this distribution.\n; By using this software in any fashion, you are agreeing to be bound by\n; the terms of this license.\n; You must not remove this notice, or any other, from this software.\n\n;; Author: Tom Faulhaber\n;; April 3, 2009\n;; Revised to use proxy instead of gen-class April 2010\n\n;; This module implements a wrapper around a java.io.Writer which implements the\n;; core of the XP algorithm.\n\n(in-ns 'clojure.pprint)\n\n(import [clojure.lang IDeref]\n [java.io Writer])\n\n;; TODO: Support for tab directives\n\n\n;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\n;;; Forward declarations\n;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\n\n(declare get-miser-width)\n\n;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\n;;; Macros to simplify dealing with types and classes. These are\n;;; really utilities, but I'm experimenting with them here.\n;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\n\n(defmacro ^{:private true} \n getf \n \"Get the value of the field a named by the argument (which should be a keyword).\"\n [sym]\n `(~sym @@~'this))\n\n(defmacro ^{:private true} \n setf [sym new-val] \n \"Set the value of the field SYM to NEW-VAL\"\n `(alter @~'this assoc ~sym ~new-val))\n\n(defmacro ^{:private true} \n deftype [type-name & fields]\n (let [name-str (name type-name)]\n `(do\n (defstruct ~type-name :type-tag ~@fields)\n (alter-meta! #'~type-name assoc :private true)\n (defn- ~(symbol (str \"make-\" name-str)) \n [& vals#] (apply struct ~type-name ~(keyword name-str) vals#))\n (defn- ~(symbol (str name-str \"?\")) [x#] (= (:type-tag x#) ~(keyword name-str))))))\n\n;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\n;;; The data structures used by pretty-writer\n;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\n\n(defstruct ^{:private true} logical-block\n :parent :section :start-col :indent\n :done-nl :intra-block-nl\n :prefix :per-line-prefix :suffix\n :logical-block-callback)\n\n(defn- ancestor? [parent child]\n (loop [child (:parent child)]\n (cond \n (nil? child) false\n (identical? parent child) true\n :else (recur (:parent child)))))\n\n(defstruct ^{:private true} section :parent)\n\n(defn- buffer-length [l] \n (let [l (seq l)]\n (if l \n (- (:end-pos (last l)) (:start-pos (first l)))\n 0)))\n\n; A blob of characters (aka a string)\n(deftype buffer-blob :data :trailing-white-space :start-pos :end-pos)\n\n; A newline\n(deftype nl-t :type :logical-block :start-pos :end-pos)\n\n(deftype start-block-t :logical-block :start-pos :end-pos)\n\n(deftype end-block-t :logical-block :start-pos :end-pos)\n\n(deftype indent-t :logical-block :relative-to :offset :start-pos :end-pos)\n\n;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\n;;; Functions to write tokens in the output buffer\n;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\n\n(def ^:private pp-newline (memoize #(System/getProperty \"line.separator\")))\n\n(declare emit-nl)\n\n(defmulti ^{:private true} write-token #(:type-tag %2))\n(defmethod write-token :start-block-t [^Writer this token]\n (when-let [cb (getf :logical-block-callback)] (cb :start))\n (let [lb (:logical-block token)]\n (dosync\n (when-let [^String prefix (:prefix lb)] \n (.write (getf :base) prefix))\n (let [col (get-column (getf :base))]\n (ref-set (:start-col lb) col)\n (ref-set (:indent lb) col)))))\n\n(defmethod write-token :end-block-t [^Writer this token]\n (when-let [cb (getf :logical-block-callback)] (cb :end))\n (when-let [^String suffix (:suffix (:logical-block token))] \n (.write (getf :base) suffix)))\n\n(defmethod write-token :indent-t [^Writer this token]\n (let [lb (:logical-block token)]\n (ref-set (:indent lb) \n (+ (:offset token)\n (condp = (:relative-to token)\n\t\t :block @(:start-col lb)\n\t\t :current (get-column (getf :base)))))))\n\n(defmethod write-token :buffer-blob [^Writer this token]\n (.write (getf :base) ^String (:data token)))\n\n(defmethod write-token :nl-t [^Writer this token]\n; (prlabel wt @(:done-nl (:logical-block token)))\n; (prlabel wt (:type token) (= (:type token) :mandatory))\n (if (or (= (:type token) :mandatory)\n (and (not (= (:type token) :fill))\n @(:done-nl (:logical-block token))))\n (emit-nl this token)\n (if-let [^String tws (getf :trailing-white-space)]\n (.write (getf :base) tws)))\n (dosync (setf :trailing-white-space nil)))\n\n(defn- write-tokens [^Writer this tokens force-trailing-whitespace]\n (doseq [token tokens]\n (if-not (= (:type-tag token) :nl-t)\n (if-let [^String tws (getf :trailing-white-space)]\n\t(.write (getf :base) tws)))\n (write-token this token)\n (setf :trailing-white-space (:trailing-white-space token)))\n (let [^String tws (getf :trailing-white-space)] \n (when (and force-trailing-whitespace tws)\n (.write (getf :base) tws)\n (setf :trailing-white-space nil))))\n\n;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\n;;; emit-nl? method defs for each type of new line. This makes\n;;; the decision about whether to print this type of new line.\n;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\n\n\n(defn- tokens-fit? [^Writer this tokens]\n;;; (prlabel tf? (get-column (getf :base) (buffer-length tokens))\n (let [maxcol (get-max-column (getf :base))]\n (or \n (nil? maxcol) \n (< (+ (get-column (getf :base)) (buffer-length tokens)) maxcol))))\n\n(defn- linear-nl? [this lb section]\n; (prlabel lnl? @(:done-nl lb) (tokens-fit? this section))\n (or @(:done-nl lb)\n (not (tokens-fit? this section))))\n\n(defn- miser-nl? [^Writer this lb section]\n (let [miser-width (get-miser-width this)\n maxcol (get-max-column (getf :base))]\n (and miser-width maxcol\n (>= @(:start-col lb) (- maxcol miser-width))\n (linear-nl? this lb section))))\n\n(defmulti ^{:private true} emit-nl? (fn [t _ _ _] (:type t)))\n\n(defmethod emit-nl? :linear [newl this section _]\n (let [lb (:logical-block newl)]\n (linear-nl? this lb section)))\n\n(defmethod emit-nl? :miser [newl this section _]\n (let [lb (:logical-block newl)]\n (miser-nl? this lb section)))\n\n(defmethod emit-nl? :fill [newl this section subsection]\n (let [lb (:logical-block newl)]\n (or @(:intra-block-nl lb)\n (not (tokens-fit? this subsection))\n (miser-nl? this lb section))))\n\n(defmethod emit-nl? :mandatory [_ _ _ _]\n true)\n\n;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\n;;; Various support functions\n;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\n\n\n(defn- get-section [buffer]\n (let [nl (first buffer) \n lb (:logical-block nl)\n section (seq (take-while #(not (and (nl-t? %) (ancestor? (:logical-block %) lb)))\n (next buffer)))]\n [section (seq (drop (inc (count section)) buffer))])) \n\n(defn- get-sub-section [buffer]\n (let [nl (first buffer) \n lb (:logical-block nl)\n section (seq (take-while #(let [nl-lb (:logical-block %)]\n (not (and (nl-t? %) (or (= nl-lb lb) (ancestor? nl-lb lb)))))\n (next buffer)))]\n section)) \n\n(defn- update-nl-state [lb]\n (dosync\n (ref-set (:intra-block-nl lb) false)\n (ref-set (:done-nl lb) true)\n (loop [lb (:parent lb)]\n (if lb\n (do (ref-set (:done-nl lb) true)\n (ref-set (:intra-block-nl lb) true)\n (recur (:parent lb)))))))\n\n(defn- emit-nl [^Writer this nl]\n (.write (getf :base) (pp-newline))\n (dosync (setf :trailing-white-space nil))\n (let [lb (:logical-block nl)\n ^String prefix (:per-line-prefix lb)] \n (if prefix \n (.write (getf :base) prefix))\n (let [^String istr (apply str (repeat (- @(:indent lb) (count prefix))\n\t\t\t\t\t \\space))] \n (.write (getf :base) istr))\n (update-nl-state lb)))\n\n(defn- split-at-newline [tokens]\n (let [pre (seq (take-while #(not (nl-t? %)) tokens))]\n [pre (seq (drop (count pre) tokens))]))\n\n;;; Methods for showing token strings for debugging\n\n(defmulti ^{:private true} tok :type-tag)\n(defmethod tok :nl-t [token]\n (:type token))\n(defmethod tok :buffer-blob [token]\n (str \\\" (:data token) (:trailing-white-space token) \\\"))\n(defmethod tok :default [token]\n (:type-tag token))\n(defn- toks [toks] (map tok toks))\n\n;;; write-token-string is called when the set of tokens in the buffer\n;;; is longer than the available space on the line\n\n(defn- write-token-string [this tokens]\n (let [[a b] (split-at-newline tokens)]\n;; (prlabel wts (toks a) (toks b))\n (if a (write-tokens this a false))\n (if b\n (let [[section remainder] (get-section b)\n newl (first b)]\n;; (prlabel wts (toks section)) (prlabel wts (:type newl)) (prlabel wts (toks remainder)) \n (let [do-nl (emit-nl? newl this section (get-sub-section b))\n result (if do-nl \n (do\n;; (prlabel emit-nl (:type newl))\n (emit-nl this newl)\n (next b))\n b)\n long-section (not (tokens-fit? this result))\n result (if long-section\n (let [rem2 (write-token-string this section)]\n;;; (prlabel recurse (toks rem2))\n (if (= rem2 section)\n (do ; If that didn't produce any output, it has no nls\n ; so we'll force it\n (write-tokens this section false)\n remainder)\n (into [] (concat rem2 remainder))))\n result)\n;; ff (prlabel wts (toks result))\n ] \n result)))))\n\n(defn- write-line [^Writer this]\n (dosync\n (loop [buffer (getf :buffer)]\n;; (prlabel wl1 (toks buffer))\n (setf :buffer (into [] buffer))\n (if (not (tokens-fit? this buffer))\n (let [new-buffer (write-token-string this buffer)]\n;; (prlabel wl new-buffer)\n (if-not (identical? buffer new-buffer)\n (recur new-buffer)))))))\n\n;;; Add a buffer token to the buffer and see if it's time to start\n;;; writing\n(defn- add-to-buffer [^Writer this token]\n; (prlabel a2b token)\n (dosync\n (setf :buffer (conj (getf :buffer) token))\n (if (not (tokens-fit? this (getf :buffer)))\n (write-line this))))\n\n;;; Write all the tokens that have been buffered\n(defn- write-buffered-output [^Writer this]\n (write-line this)\n (if-let [buf (getf :buffer)]\n (do\n (write-tokens this buf true)\n (setf :buffer []))))\n\n(defn- write-white-space [^Writer this]\n (when-let [^String tws (getf :trailing-white-space)]\n ; (prlabel wws (str \"*\" tws \"*\"))\n (.write (getf :base) tws)\n (dosync\n (setf :trailing-white-space nil))))\n\n;;; If there are newlines in the string, print the lines up until the last newline, \n;;; making the appropriate adjustments. Return the remainder of the string\n(defn- write-initial-lines \n [^Writer this ^String s] \n (let [lines (.split s \"\\n\" -1)]\n (if (= (count lines) 1)\n s\n (dosync \n (let [^String prefix (:per-line-prefix (first (getf :logical-blocks)))\n ^String l (first lines)] \n (if (= :buffering (getf :mode))\n (let [oldpos (getf :pos)\n newpos (+ oldpos (count l))]\n (setf :pos newpos)\n (add-to-buffer this (make-buffer-blob l nil oldpos newpos))\n (write-buffered-output this))\n (do\n (write-white-space this)\n (.write (getf :base) l)))\n (.write (getf :base) (int \\newline))\n (doseq [^String l (next (butlast lines))]\n (.write (getf :base) l)\n (.write (getf :base) (pp-newline))\n (if prefix\n (.write (getf :base) prefix)))\n (setf :buffering :writing)\n (last lines))))))\n\n\n(defn- p-write-char [^Writer this ^Integer c]\n (if (= (getf :mode) :writing)\n (do \n (write-white-space this)\n (.write (getf :base) c))\n (if (= c \\newline)\n (write-initial-lines this \"\\n\")\n (let [oldpos (getf :pos)\n newpos (inc oldpos)]\n (dosync\n (setf :pos newpos)\n (add-to-buffer this (make-buffer-blob (str (char c)) nil oldpos newpos)))))))\n\n\n;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\n;;; Initialize the pretty-writer instance\n;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\n\n\n(defn- pretty-writer [writer max-columns miser-width]\n (let [lb (struct logical-block nil nil (ref 0) (ref 0) (ref false) (ref false))\n fields (ref {:pretty-writer true\n :base (column-writer writer max-columns)\n :logical-blocks lb \n :sections nil\n :mode :writing\n :buffer []\n :buffer-block lb\n :buffer-level 1\n :miser-width miser-width\n :trailing-white-space nil\n :pos 0})]\n (proxy [Writer IDeref PrettyFlush] []\n (deref [] fields)\n\n (write \n ([x]\n ;; (prlabel write x (getf :mode))\n (condp = (class x)\n String \n (let [^String s0 (write-initial-lines this x)\n ^String s (.replaceFirst s0 \"\\\\s+$\" \"\")\n white-space (.substring s0 (count s))\n mode (getf :mode)]\n (dosync\n (if (= mode :writing)\n (do\n (write-white-space this)\n (.write (getf :base) s)\n (setf :trailing-white-space white-space))\n (let [oldpos (getf :pos)\n newpos (+ oldpos (count s0))]\n (setf :pos newpos)\n (add-to-buffer this (make-buffer-blob s white-space oldpos newpos))))))\n\n Integer\n (p-write-char this x)\n Long\n (p-write-char this x))))\n\n (ppflush []\n (if (= (getf :mode) :buffering)\n (dosync\n (write-tokens this (getf :buffer) true)\n (setf :buffer []))\n (write-white-space this)))\n\n (flush []\n (.ppflush this)\n (.flush (getf :base)))\n\n (close []\n (.flush this)))))\n\n\n;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\n;;; Methods for pretty-writer\n;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\n\n(defn- start-block \n [^Writer this \n ^String prefix ^String per-line-prefix ^String suffix]\n (dosync \n (let [lb (struct logical-block (getf :logical-blocks) nil (ref 0) (ref 0)\n (ref false) (ref false)\n prefix per-line-prefix suffix)]\n (setf :logical-blocks lb)\n (if (= (getf :mode) :writing)\n (do\n (write-white-space this)\n (when-let [cb (getf :logical-block-callback)] (cb :start))\n (if prefix \n (.write (getf :base) prefix))\n (let [col (get-column (getf :base))]\n (ref-set (:start-col lb) col)\n (ref-set (:indent lb) col)))\n (let [oldpos (getf :pos)\n newpos (+ oldpos (if prefix (count prefix) 0))]\n (setf :pos newpos)\n (add-to-buffer this (make-start-block-t lb oldpos newpos)))))))\n\n(defn- end-block [^Writer this]\n (dosync\n (let [lb (getf :logical-blocks)\n ^String suffix (:suffix lb)]\n (if (= (getf :mode) :writing)\n (do\n (write-white-space this)\n (if suffix\n (.write (getf :base) suffix))\n (when-let [cb (getf :logical-block-callback)] (cb :end)))\n (let [oldpos (getf :pos)\n newpos (+ oldpos (if suffix (count suffix) 0))]\n (setf :pos newpos)\n (add-to-buffer this (make-end-block-t lb oldpos newpos))))\n (setf :logical-blocks (:parent lb)))))\n\n(defn- nl [^Writer this type]\n (dosync \n (setf :mode :buffering)\n (let [pos (getf :pos)]\n (add-to-buffer this (make-nl-t type (getf :logical-blocks) pos pos)))))\n\n(defn- indent [^Writer this relative-to offset]\n (dosync \n (let [lb (getf :logical-blocks)]\n (if (= (getf :mode) :writing)\n (do\n (write-white-space this)\n (ref-set (:indent lb) \n (+ offset (condp = relative-to\n\t\t\t :block @(:start-col lb)\n\t\t\t :current (get-column (getf :base))))))\n (let [pos (getf :pos)]\n (add-to-buffer this (make-indent-t lb relative-to offset pos pos)))))))\n\n(defn- get-miser-width [^Writer this]\n (getf :miser-width))\n\n(defn- set-miser-width [^Writer this new-miser-width]\n (dosync (setf :miser-width new-miser-width)))\n\n(defn- set-logical-block-callback [^Writer this f]\n (dosync (setf :logical-block-callback f)))\n" }, { "path": "src/clj/clojure/pprint/print_table.clj", "content": "; Copyright (c) Rich Hickey. All rights reserved.\n; The use and distribution terms for this software are covered by the\n; Eclipse Public License 1.0 (http://opensource.org/licenses/eclipse-1.0.php)\n; which can be found in the file epl-v10.html at the root of this distribution.\n; By using this software in any fashion, you are agreeing to be bound by\n; the terms of this license.\n; You must not remove this notice, or any other, from this software.\n\n(in-ns 'clojure.pprint)\n\n(defn print-table\n \"Prints a collection of maps in a textual table. Prints table headings\n ks, and then a line of output for each row, corresponding to the keys\n in ks. If ks are not specified, use the keys of the first item in rows.\"\n {:added \"1.3\"}\n ([ks rows]\n (when (seq rows)\n (let [widths (map\n (fn [k]\n (apply max (count (str k)) (map #(count (str (get % k))) rows)))\n ks)\n spacers (map #(apply str (repeat % \"-\")) widths)\n fmts (map #(str \"%\" % \"s\") widths)\n fmt-row (fn [leader divider trailer row]\n (str leader\n (apply str (interpose divider\n (for [[col fmt] (map vector (map #(get row %) ks) fmts)]\n (format fmt (str col)))))\n trailer))]\n (println)\n (println (fmt-row \"| \" \" | \" \" |\" (zipmap ks ks)))\n (println (fmt-row \"|-\" \"-+-\" \"-|\" (zipmap ks spacers)))\n (doseq [row rows]\n (println (fmt-row \"| \" \" | \" \" |\" row))))))\n ([rows] (print-table (keys (first rows)) rows)))\n" }, { "path": "src/clj/clojure/pprint/utilities.clj", "content": ";;; utilities.clj -- part of the pretty printer for Clojure\n\n; Copyright (c) Rich Hickey. All rights reserved.\n; The use and distribution terms for this software are covered by the\n; Eclipse Public License 1.0 (http://opensource.org/licenses/eclipse-1.0.php)\n; which can be found in the file epl-v10.html at the root of this distribution.\n; By using this software in any fashion, you are agreeing to be bound by\n; the terms of this license.\n; You must not remove this notice, or any other, from this software.\n\n;; Author: Tom Faulhaber\n;; April 3, 2009\n\n;; This module implements some utility function used in formatting and pretty\n;; printing. The functions here could go in a more general purpose library,\n;; perhaps.\n\n(in-ns 'clojure.pprint)\n\n;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\n;;; Helper functions for digesting formats in the various\n;;; phases of their lives.\n;;; These functions are actually pretty general.\n;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\n\n(defn- map-passing-context [func initial-context lis]\n (loop [context initial-context\n lis lis\n acc []]\n (if (empty? lis)\n [acc context]\n (let [this (first lis)\n remainder (next lis)\n [result new-context] (apply func [this context])]\n (recur new-context remainder (conj acc result))))))\n\n(defn- consume [func initial-context]\n (loop [context initial-context\n acc []]\n (let [[result new-context] (apply func [context])]\n (if (not result)\n [acc new-context]\n (recur new-context (conj acc result))))))\n\n(defn- consume-while [func initial-context]\n (loop [context initial-context\n acc []]\n (let [[result continue new-context] (apply func [context])]\n (if (not continue)\n [acc context]\n (recur new-context (conj acc result))))))\n\n(defn- unzip-map [m]\n \"Take a map that has pairs in the value slots and produce a pair of maps, \n the first having all the first elements of the pairs and the second all \n the second elements of the pairs\"\n [(into {} (for [[k [v1 v2]] m] [k v1]))\n (into {} (for [[k [v1 v2]] m] [k v2]))])\n\n(defn- tuple-map [m v1]\n \"For all the values, v, in the map, replace them with [v v1]\"\n (into {} (for [[k v] m] [k [v v1]])))\n\n(defn- rtrim [s c]\n \"Trim all instances of c from the end of sequence s\"\n (let [len (count s)]\n (if (and (pos? len) (= (nth s (dec (count s))) c))\n (loop [n (dec len)]\n (cond \n (neg? n) \"\"\n (not (= (nth s n) c)) (subs s 0 (inc n))\n true (recur (dec n))))\n s)))\n\n(defn- ltrim [s c]\n \"Trim all instances of c from the beginning of sequence s\"\n (let [len (count s)]\n (if (and (pos? len) (= (nth s 0) c))\n (loop [n 0]\n (if (or (= n len) (not (= (nth s n) c)))\n (subs s n)\n (recur (inc n))))\n s)))\n\n(defn- prefix-count [aseq val]\n \"Return the number of times that val occurs at the start of sequence aseq, \nif val is a seq itself, count the number of times any element of val occurs at the\nbeginning of aseq\"\n (let [test (if (coll? val) (set val) #{val})]\n (loop [pos 0]\n (if (or (= pos (count aseq)) (not (test (nth aseq pos))))\n pos\n (recur (inc pos))))))\n\n(defn- prerr [& args]\n \"Println to *err*\"\n (binding [*out* *err*]\n (apply println args)))\n \n(defmacro ^{:private true} prlabel [prefix arg & more-args]\n \"Print args to *err* in name = value format\"\n `(prerr ~@(cons (list 'quote prefix) (mapcat #(list (list 'quote %) \"=\" %) \n (cons arg (seq more-args))))))\n\n;; Flush the pretty-print buffer without flushing the underlying stream\n(definterface PrettyFlush\n (^void ppflush []))\n" }, { "path": "src/clj/clojure/pprint.clj", "content": ";;; pprint.clj -- Pretty printer and Common Lisp compatible format function (cl-format) for Clojure\n\n; Copyright (c) Rich Hickey. All rights reserved.\n; The use and distribution terms for this software are covered by the\n; Eclipse Public License 1.0 (http://opensource.org/licenses/eclipse-1.0.php)\n; which can be found in the file epl-v10.html at the root of this distribution.\n; By using this software in any fashion, you are agreeing to be bound by\n; the terms of this license.\n; You must not remove this notice, or any other, from this software.\n\n;; Author: Tom Faulhaber\n;; April 3, 2009\n\n(ns \n ^{:author \"Tom Faulhaber\",\n :doc \"A Pretty Printer for Clojure\n\nclojure.pprint implements a flexible system for printing structured data\nin a pleasing, easy-to-understand format. Basic use of the pretty printer is \nsimple, just call pprint instead of println. More advanced users can use \nthe building blocks provided to create custom output formats. \n\nOut of the box, pprint supports a simple structured format for basic data \nand a specialized format for Clojure source code. More advanced formats, \nincluding formats that don't look like Clojure data at all like XML and \nJSON, can be rendered by creating custom dispatch functions. \n\nIn addition to the pprint function, this module contains cl-format, a text \nformatting function which is fully compatible with the format function in \nCommon Lisp. Because pretty printing directives are directly integrated with\ncl-format, it supports very concise custom dispatch. It also provides\na more powerful alternative to Clojure's standard format function.\n\nSee documentation for pprint and cl-format for more information or \ncomplete documentation on the the clojure web site on github.\",\n :added \"1.2\"}\n clojure.pprint\n (:refer-clojure :exclude (deftype))\n (:use [clojure.walk :only [walk]]))\n\n\n(load \"pprint/utilities\")\n(load \"pprint/column_writer\")\n(load \"pprint/pretty_writer\")\n(load \"pprint/pprint_base\")\n(load \"pprint/cl_format\")\n(load \"pprint/dispatch\")\n(load \"pprint/print_table\")\n\nnil\n" }, { "path": "src/clj/clojure/reflect/java.clj", "content": "; Copyright (c) Rich Hickey. All rights reserved.\n; The use and distribution terms for this software are covered by the\n; Eclipse Public License 1.0 (http://opensource.org/licenses/eclipse-1.0.php)\n; which can be found in the file epl-v10.html at the root of this distribution.\n; By using this software in any fashion, you are agreeing to be bound by\n; the terms of this license.\n; You must not remove this notice, or any other, from this software.\n\n;; Java-specific parts of clojure.reflect\n(in-ns 'clojure.reflect)\n\n(require '[clojure.set :as set]\n '[clojure.string :as str])\n(import '[clojure.asm ClassReader ClassVisitor Type Opcodes]\n '[java.lang.reflect Modifier]\n java.io.InputStream)\n\n(extend-protocol TypeReference\n clojure.lang.Symbol\n (typename [s] (str/replace (str s) \"<>\" \"[]\"))\n \n Class\n ;; neither .getName not .getSimpleName returns the right thing, so best to delegate to Type\n (typename\n [c]\n (typename (Type/getType c)))\n \n Type\n (typename\n [t]\n (-> (.getClassName t))))\n\n(defn- typesym\n \"Given a typeref, create a legal Clojure symbol version of the\n type's name.\"\n [t]\n (-> (typename t)\n (str/replace \"[]\" \"<>\")\n (symbol)))\n\n(defn- resource-name\n \"Given a typeref, return implied resource name. Used by Reflectors\n such as ASM that need to find and read classbytes from files.\"\n [typeref]\n (-> (typename typeref)\n (str/replace \".\" \"/\")\n (str \".class\")))\n\n(defn- access-flag\n [[name flag & contexts]]\n {:name name :flag flag :contexts (set (map keyword contexts))})\n\n(defn- field-descriptor->class-symbol\n \"Convert a Java field descriptor to a Clojure class symbol. Field\n descriptors are described in section 4.3.2 of the JVM spec, 2nd ed.:\n http://java.sun.com/docs/books/jvms/second_edition/html/ClassFile.doc.html#14152\"\n [^String d]\n {:pre [(string? d)]}\n (typesym (Type/getType d)))\n\n(defn- internal-name->class-symbol\n \"Convert a Java internal name to a Clojure class symbol. Internal\n names uses slashes instead of dots, e.g. java/lang/String. See\n Section 4.2 of the JVM spec, 2nd ed.:\n\n http://java.sun.com/docs/books/jvms/second_edition/html/ClassFile.doc.html#14757\"\n [d]\n {:pre [(string? d)]}\n (typesym (Type/getObjectType d)))\n\n(def ^{:doc \"The Java access bitflags, along with their friendly names and\nthe kinds of objects to which they can apply.\"}\n flag-descriptors\n (vec\n (map access-flag\n [[:public 0x0001 :class :field :method]\n [:private 0x002 :class :field :method]\n [:protected 0x0004 :class :field :method]\n [:static 0x0008 :field :method]\n [:final 0x0010 :class :field :method]\n ;; :super is ancient history and is unfindable (?) by\n ;; reflection. skip it\n #_[:super 0x0020 :class] \n [:synchronized 0x0020 :method]\n [:volatile 0x0040 :field]\n [:bridge 0x0040 :method]\n [:varargs 0x0080 :method]\n [:transient 0x0080 :field]\n [:native 0x0100 :method]\n [:interface 0x0200 :class]\n [:abstract 0x0400 :class :method]\n [:strict 0x0800 :method]\n [:synthetic 0x1000 :class :field :method]\n [:annotation 0x2000 :class]\n [:enum 0x4000 :class :field :inner]])))\n\n(defn- parse-flags\n \"Convert reflection bitflags into a set of keywords.\"\n [flags context]\n (reduce\n (fn [result fd]\n (if (and (get (:contexts fd) context)\n (not (zero? (bit-and flags (:flag fd)))))\n (conj result (:name fd))\n result))\n #{}\n flag-descriptors))\n\n(defrecord Constructor\n [name declaring-class parameter-types exception-types flags])\n\n(defn- constructor->map\n [^java.lang.reflect.Constructor constructor]\n (Constructor.\n (symbol (.getName constructor))\n (typesym (.getDeclaringClass constructor))\n (vec (map typesym (.getParameterTypes constructor)))\n (vec (map typesym (.getExceptionTypes constructor)))\n (parse-flags (.getModifiers constructor) :method)))\n\n(defn- declared-constructors\n \"Return a set of the declared constructors of class as a Clojure map.\"\n [^Class cls]\n (set (map\n constructor->map\n (.getDeclaredConstructors cls))))\n\n(defrecord Method\n [name return-type declaring-class parameter-types exception-types flags])\n\n(defn- method->map\n [^java.lang.reflect.Method method]\n (Method.\n (symbol (.getName method))\n (typesym (.getReturnType method))\n (typesym (.getDeclaringClass method))\n (vec (map typesym (.getParameterTypes method)))\n (vec (map typesym (.getExceptionTypes method)))\n (parse-flags (.getModifiers method) :method)))\n\n(defn- declared-methods\n \"Return a set of the declared constructors of class as a Clojure map.\"\n [^Class cls]\n (set (map\n method->map\n (.getDeclaredMethods cls))))\n\n(defrecord Field\n [name type declaring-class flags])\n\n(defn- field->map\n [^java.lang.reflect.Field field]\n (Field.\n (symbol (.getName field))\n (typesym (.getType field))\n (typesym (.getDeclaringClass field))\n (parse-flags (.getModifiers field) :field)))\n\n(defn- declared-fields\n \"Return a set of the declared fields of class as a Clojure map.\"\n [^Class cls]\n (set (map\n field->map\n (.getDeclaredFields cls))))\n\n(deftype JavaReflector [classloader]\n Reflector\n (do-reflect [_ typeref]\n (let [cls (clojure.lang.RT/classForName (typename typeref) false classloader)]\n {:bases (not-empty (set (map typesym (bases cls))))\n :flags (parse-flags (.getModifiers cls) :class)\n :members (set/union (declared-fields cls)\n (declared-methods cls)\n (declared-constructors cls))})))\n\n(def ^:private default-reflector\n (JavaReflector. (.getContextClassLoader (Thread/currentThread))))\n\n(defn- parse-method-descriptor\n [^String md]\n {:parameter-types (vec (map typesym (Type/getArgumentTypes md)))\n :return-type (typesym (Type/getReturnType md))})\n\n(defprotocol ClassResolver\n (^InputStream resolve-class [this name]\n \"Given a class name, return that typeref's class bytes as an InputStream.\"))\n\n(extend-protocol ClassResolver\n clojure.lang.Fn\n (resolve-class [this typeref] (this typeref))\n \n ClassLoader\n (resolve-class [this typeref]\n (.getResourceAsStream this (resource-name typeref))))\n\n(deftype AsmReflector [class-resolver]\n Reflector\n (do-reflect [_ typeref]\n (with-open [is (resolve-class class-resolver typeref)]\n (let [class-symbol (typesym typeref)\n r (ClassReader. is)\n result (atom {:bases #{} :flags #{} :members #{}})]\n (.accept\n r\n (proxy\n [ClassVisitor]\n [Opcodes/ASM4]\n (visit [version access name signature superName interfaces]\n (let [flags (parse-flags access :class)\n ;; ignore java.lang.Object on interfaces to match reflection\n superName (if (and (flags :interface)\n (= superName \"java/lang/Object\"))\n nil\n superName)\n bases (->> (cons superName interfaces)\n (remove nil?)\n (map internal-name->class-symbol)\n (map symbol)\n (set)\n (not-empty))]\n (swap! result merge {:bases bases \n :flags flags})))\n (visitAnnotation [desc visible])\n (visitSource [name debug])\n (visitInnerClass [name outerName innerName access])\n (visitField [access name desc signature value]\n (swap! result update :members (fnil conj #{})\n (Field. (symbol name)\n (field-descriptor->class-symbol desc)\n class-symbol\n (parse-flags access :field)))\n nil)\n (visitMethod [access name desc signature exceptions]\n (when-not (= name \"\")\n (let [constructor? (= name \"\")]\n (swap! result update :members (fnil conj #{})\n (let [{:keys [parameter-types return-type]} (parse-method-descriptor desc)\n flags (parse-flags access :method)]\n (if constructor?\n (Constructor. class-symbol\n class-symbol\n parameter-types\n (vec (map internal-name->class-symbol exceptions))\n flags)\n (Method. (symbol name)\n return-type\n class-symbol\n parameter-types\n (vec (map internal-name->class-symbol exceptions))\n flags))))))\n nil)\n (visitEnd [])\n ) 0)\n @result))))\n\n" }, { "path": "src/clj/clojure/reflect.clj", "content": "; Copyright (c) Rich Hickey. All rights reserved.\n; The use and distribution terms for this software are covered by the\n; Eclipse Public License 1.0 (http://opensource.org/licenses/eclipse-1.0.php)\n; which can be found in the file epl-v10.html at the root of this distribution.\n; By using this software in any fashion, you are agreeing to be bound by\n; the terms of this license.\n; You must not remove this notice, or any other, from this software.\n\n(ns ^{:author \"Stuart Halloway\"\n :added \"1.3\"\n :doc \"Reflection on Host Types\nAlpha - subject to change.\n\nTwo main entry points: \n\n* type-reflect reflects on something that implements TypeReference.\n* reflect (for REPL use) reflects on the class of an instance, or\n on a class if passed a class\n\nKey features:\n\n* Exposes the read side of reflection as pure data. Reflecting\n on a type returns a map with keys :bases, :flags, and :members.\n\n* Canonicalizes class names as Clojure symbols. Types can extend\n to the TypeReference protocol to indicate that they can be\n unambiguously resolved as a type name. The canonical format\n requires one non-Java-ish convention: array brackets are <>\n instead of [] so they can be part of a Clojure symbol.\n\n* Pluggable Reflectors for different implementations. The default\n JavaReflector is good when you have a class in hand, or use\n the AsmReflector for \\\"hands off\\\" reflection without forcing\n classes to load.\n\nPlatform implementers must:\n\n* Create an implementation of Reflector.\n* Create one or more implementations of TypeReference.\n* def default-reflector to be an instance that satisfies Reflector.\"}\n clojure.reflect\n (:require [clojure.set :as set]))\n\n(defprotocol Reflector\n \"Protocol for reflection implementers.\"\n (do-reflect [reflector typeref]))\n\n(defprotocol TypeReference\n \"A TypeReference can be unambiguously converted to a type name on\n the host platform.\n\n All typerefs are normalized into symbols. If you need to\n normalize a typeref yourself, call typesym.\"\n (typename [o] \"Returns Java name as returned by ASM getClassName, e.g. byte[], java.lang.String[]\"))\n\n(declare default-reflector)\n\n(defn type-reflect\n \"Alpha - subject to change.\n Reflect on a typeref, returning a map with :bases, :flags, and\n :members. In the discussion below, names are always Clojure symbols.\n\n :bases a set of names of the type's bases\n :flags a set of keywords naming the boolean attributes\n of the type.\n :members a set of the type's members. Each member is a map\n and can be a constructor, method, or field.\n\n Keys common to all members:\n :name name of the type \n :declaring-class name of the declarer\n :flags keyword naming boolean attributes of the member\n\n Keys specific to constructors:\n :parameter-types vector of parameter type names\n :exception-types vector of exception type names\n\n Key specific to methods:\n :parameter-types vector of parameter type names\n :exception-types vector of exception type names\n :return-type return type name\n\n Keys specific to fields:\n :type type name\n\n Options:\n\n :ancestors in addition to the keys described above, also\n include an :ancestors key with the entire set of\n ancestors, and add all ancestor members to\n :members.\n :reflector implementation to use. Defaults to JavaReflector,\n AsmReflector is also an option.\"\n {:added \"1.3\"}\n [typeref & options]\n (let [{:keys [ancestors reflector]}\n (merge {:reflector default-reflector}\n (apply hash-map options))\n refl (partial do-reflect reflector)\n result (refl typeref)]\n ;; could make simpler loop of two args: names an\n (if ancestors\n (let [make-ancestor-map (fn [names]\n (zipmap names (map refl names)))]\n (loop [reflections (make-ancestor-map (:bases result))]\n (let [ancestors-visited (set (keys reflections))\n ancestors-to-visit (set/difference (set (mapcat :bases (vals reflections)))\n ancestors-visited)]\n (if (seq ancestors-to-visit)\n (recur (merge reflections (make-ancestor-map ancestors-to-visit)))\n (apply merge-with into result {:ancestors ancestors-visited}\n (map #(select-keys % [:members]) (vals reflections)))))))\n result)))\n\n(defn reflect\n \"Alpha - subject to change.\n Reflect on the type of obj (or obj itself if obj is a class).\n Return value and options are the same as for type-reflect. \"\n {:added \"1.3\"}\n [obj & options]\n (apply type-reflect (if (class? obj) obj (class obj)) options))\n\n(load \"reflect/java\")\n" }, { "path": "src/clj/clojure/remoterepl.clj", "content": "(ns clojure.remoterepl\n (:import [java.net ServerSocket Socket]\n [clojure.lang LineNumberingPushbackReader]\n [java.io PrintWriter InputStreamReader OutputStreamWriter]))\n\n(defn uuid [] (str (java.util.UUID/randomUUID)))\n\n(def server1 (atom nil))\n(def server2 (atom nil))\n(def repl-main-thread (atom nil))\n(def socket (atom nil))\n(def socket1 (atom nil))\n(def socket2 (atom nil))\n\n(defn socket-println [s d]\n (let [c (str (count (.getBytes d \"UTF-8\")))]\n (.println s \n (str \n (apply str (for [n (range (- 10 (count c)))] \" \")) \n c))\n (.println s d)))\n\n(defn process-msg [out f]\n (let [[run-in-main id f args] f]\n (->> [id (binding [force-main-thread true]\n (apply f args))]\n pr-str \n (socket-println out))))\n\n(defn call-remote [sel args]\n (let [args (vec args)\n id (keyword (uuid))]\n (socket-println (:out @socket)\n (pr-str [(or (= (Thread/currentThread) @repl-main-thread) force-main-thread)\n id sel args]))\n (loop [msg (read (:in @socket))]\n (if (instance? String msg)\n (throw (Exception. msg))\n (if (= 2 (count msg))\n (let [[rid r] msg]\n (if (= rid id)\n r\n (do\n (socket-println (:out @socket) (pr-str [:retry id]))\n ; retries until the sender gets the response\n (recur (read (:in @socket))))))\n (do\n (process-msg (:out @socket) msg)\n (recur (read (:in @socket)))))))))\n\n(defn start-remote-repl []\n (clojure.lang.RemoteRef/reset)\n (let [s (.accept @server1)\n s2 (.accept @server2)\n out (PrintWriter. (.getOutputStream s) true)\n in (LineNumberingPushbackReader. (InputStreamReader. (.getInputStream s)))\n out2 (PrintWriter. (.getOutputStream s2) true)\n in2 (LineNumberingPushbackReader. (InputStreamReader. (.getInputStream s2)))]\n (clojure.lang.RemoteRepl/setConnected true)\n (reset! socket {:out out :in in})\n (reset! socket1 {:out out :in in}) \n (reset! socket2 {:out out2 :in in2})\n (future\n (try\n (loop [f (read in2)]\n (let [s @socket]\n (reset! socket @socket2)\n (process-msg out2 f)\n (reset! socket s))\n (recur (read in2)))\n (catch Exception e\n (println \"REPL DISCONNECTED\")\n (.printStackTrace e)\n (.close s)\n (.close s2)\n (start-remote-repl))))))\n\n(defn connected? []\n clojure.lang.RemoteRepl/connected)\n\n(defn listen []\n (reset! repl-main-thread (Thread/currentThread))\n (reset! server1 (ServerSocket. 35813))\n (reset! server2 (ServerSocket. 35814))\n (start-remote-repl))\n" }, { "path": "src/clj/clojure/repl.clj", "content": "; Copyright (c) Chris Houser, Dec 2008. All rights reserved.\n; The use and distribution terms for this software are covered by the\n; Common Public License 1.0 (http://opensource.org/licenses/cpl.php)\n; which can be found in the file CPL.TXT at the root of this distribution.\n; By using this software in any fashion, you are agreeing to be bound by\n; the terms of this license.\n; You must not remove this notice, or any other, from this software.\n\n; Utilities meant to be used interactively at the REPL\n\n(ns\n ^{:author \"Chris Houser, Christophe Grand, Stephen Gilardi, Michel Salim\"\n :doc \"Utilities meant to be used interactively at the REPL\"}\n clojure.repl\n (:import (java.io LineNumberReader InputStreamReader PushbackReader)\n (clojure.lang RT Reflector)))\n\n(def ^:private special-doc-map\n '{. {:url \"java_interop#dot\"\n :forms [(.instanceMember instance args*)\n (.instanceMember Classname args*)\n (Classname/staticMethod args*)\n Classname/staticField]\n :doc \"The instance member form works for both fields and methods.\n They all expand into calls to the dot operator at macroexpansion time.\"}\n def {:forms [(def symbol doc-string? init?)]\n :doc \"Creates and interns a global var with the name\n of symbol in the current namespace (*ns*) or locates such a var if\n it already exists. If init is supplied, it is evaluated, and the\n root binding of the var is set to the resulting value. If init is\n not supplied, the root binding of the var is unaffected.\"}\n do {:forms [(do exprs*)]\n :doc \"Evaluates the expressions in order and returns the value of\n the last. If no expressions are supplied, returns nil.\"}\n if {:forms [(if test then else?)]\n :doc \"Evaluates test. If not the singular values nil or false,\n evaluates and yields then, otherwise, evaluates and yields else. If\n else is not supplied it defaults to nil.\"}\n monitor-enter {:forms [(monitor-enter x)]\n :doc \"Synchronization primitive that should be avoided\n in user code. Use the 'locking' macro.\"}\n monitor-exit {:forms [(monitor-exit x)]\n :doc \"Synchronization primitive that should be avoided\n in user code. Use the 'locking' macro.\"}\n new {:forms [(Classname. args*) (new Classname args*)]\n :url \"java_interop#new\"\n :doc \"The args, if any, are evaluated from left to right, and\n passed to the constructor of the class named by Classname. The\n constructed object is returned.\"}\n quote {:forms [(quote form)]\n :doc \"Yields the unevaluated form.\"}\n recur {:forms [(recur exprs*)]\n :doc \"Evaluates the exprs in order, then, in parallel, rebinds\n the bindings of the recursion point to the values of the exprs.\n Execution then jumps back to the recursion point, a loop or fn method.\"}\n set! {:forms[(set! var-symbol expr)\n (set! (. instance-expr instanceFieldName-symbol) expr)\n (set! (. Classname-symbol staticFieldName-symbol) expr)]\n :url \"vars#set\"\n :doc \"Used to set thread-local-bound vars, Java object instance\nfields, and Java class static fields.\"}\n throw {:forms [(throw expr)]\n :doc \"The expr is evaluated and thrown, therefore it should\n yield an instance of some derivee of Throwable.\"}\n try {:forms [(try expr* catch-clause* finally-clause?)]\n :doc \"catch-clause => (catch classname name expr*)\n finally-clause => (finally expr*)\n\n Catches and handles Java exceptions.\"}\n var {:forms [(var symbol)]\n :doc \"The symbol must resolve to a var, and the Var object\nitself (not its value) is returned. The reader macro #'x expands to (var x).\"}})\n\n(defn- special-doc [name-symbol]\n (assoc (or (special-doc-map name-symbol) (meta (resolve name-symbol)))\n :name name-symbol\n :special-form true))\n\n(defn- namespace-doc [nspace]\n (assoc (meta nspace) :name (ns-name nspace)))\n\n(defn- print-doc [m]\n (println \"-------------------------\")\n (println (str (when-let [ns (:ns m)] (str (ns-name ns) \"/\")) (:name m)))\n (cond\n (:forms m) (doseq [f (:forms m)]\n (print \" \")\n (prn f))\n (:arglists m) (prn (:arglists m)))\n (if (:special-form m)\n (do\n (println \"Special Form\")\n (println \" \" (:doc m)) \n (if (contains? m :url)\n (when (:url m)\n (println (str \"\\n Please see http://clojure.org/\" (:url m))))\n (println (str \"\\n Please see http://clojure.org/special_forms#\"\n (:name m)))))\n (do\n (when (:macro m)\n (println \"Macro\")) \n (println \" \" (:doc m)))))\n\n(defn find-doc\n \"Prints documentation for any var whose documentation or name\n contains a match for re-string-or-pattern\"\n {:added \"1.0\"}\n [re-string-or-pattern]\n (let [re (re-pattern re-string-or-pattern)\n ms (concat (mapcat #(sort-by :name (map meta (vals (ns-interns %))))\n (all-ns))\n (map namespace-doc (all-ns))\n (map special-doc (keys special-doc-map)))]\n (doseq [m ms\n :when (and (:doc m)\n (or (re-find (re-matcher re (:doc m)))\n (re-find (re-matcher re (str (:name m))))))]\n (print-doc m))))\n\n(defmacro doc\n \"Prints documentation for a var or special form given its name\"\n {:added \"1.0\"}\n [name]\n (if-let [special-name ('{& fn catch try finally try} name)]\n (#'print-doc (#'special-doc special-name))\n (cond\n (special-doc-map name) `(#'print-doc (#'special-doc '~name))\n (find-ns name) `(#'print-doc (#'namespace-doc (find-ns '~name)))\n (resolve name) `(#'print-doc (meta (var ~name))))))\n\n;; ----------------------------------------------------------------------\n;; Examine Clojure functions (Vars, really)\n\n(defn source-fn\n \"Returns a string of the source code for the given symbol, if it can\n find it. This requires that the symbol resolve to a Var defined in\n a namespace for which the .clj is in the classpath. Returns nil if\n it can't find the source. For most REPL usage, 'source' is more\n convenient.\n\n Example: (source-fn 'filter)\"\n [x]\n (when-let [v (resolve x)]\n (when-let [filepath (:file (meta v))]\n (when-let [strm (.getResourceAsStream (RT/baseLoader) filepath)]\n (with-open [rdr (LineNumberReader. (InputStreamReader. strm))]\n (dotimes [_ (dec (:line (meta v)))] (.readLine rdr))\n (let [text (StringBuilder.)\n pbr (proxy [PushbackReader] [rdr]\n (read [] (let [i (proxy-super read)]\n (.append text (char i))\n i)))\n read-opts (if (.endsWith ^String filepath \"cljc\") {:read-cond :allow} {})]\n (if (= :unknown *read-eval*)\n (throw (IllegalStateException. \"Unable to read source while *read-eval* is :unknown.\"))\n (read read-opts (PushbackReader. pbr)))\n (str text)))))))\n\n(defmacro source\n \"Prints the source code for the given symbol, if it can find it.\n This requires that the symbol resolve to a Var defined in a\n namespace for which the .clj is in the classpath.\n\n Example: (source filter)\"\n [n]\n `(println (or (source-fn '~n) (str \"Source not found\"))))\n\n(defn apropos\n \"Given a regular expression or stringable thing, return a seq of all\npublic definitions in all currently-loaded namespaces that match the\nstr-or-pattern.\"\n [str-or-pattern]\n (let [matches? (if (instance? java.util.regex.Pattern str-or-pattern)\n #(re-find str-or-pattern (str %))\n #(.contains (str %) (str str-or-pattern)))]\n (sort (mapcat (fn [ns]\n (let [ns-name (str ns)]\n (map #(symbol ns-name (str %))\n (filter matches? (keys (ns-publics ns))))))\n (all-ns)))))\n\n(defn dir-fn\n \"Returns a sorted seq of symbols naming public vars in\n a namespace\"\n [ns]\n (sort (map first (ns-publics (the-ns ns)))))\n\n(defmacro dir\n \"Prints a sorted directory of public vars in a namespace\"\n [nsname]\n `(doseq [v# (dir-fn '~nsname)]\n (println v#)))\n\n(defn demunge\n \"Given a string representation of a fn class,\n as in a stack trace element, returns a readable version.\"\n {:added \"1.3\"}\n [fn-name]\n (clojure.lang.Compiler/demunge fn-name))\n\n(defn root-cause\n \"Returns the initial cause of an exception or error by peeling off all of\n its wrappers\"\n {:added \"1.3\"}\n [^Throwable t]\n (loop [cause t]\n (if (and (instance? clojure.lang.Compiler$CompilerException cause)\n (not= (.source ^clojure.lang.Compiler$CompilerException cause) \"NO_SOURCE_FILE\"))\n cause\n (if-let [cause (.getCause cause)]\n (recur cause)\n cause))))\n\n(defn stack-element-str\n \"Returns a (possibly unmunged) string representation of a StackTraceElement\"\n {:added \"1.3\"}\n [^StackTraceElement el]\n (let [file (.getFileName el)\n clojure-fn? (and file (or (.endsWith file \".clj\")\n (.endsWith file \".cljc\")\n (= file \"NO_SOURCE_FILE\")))]\n (str (if clojure-fn?\n (demunge (.getClassName el))\n (str (.getClassName el) \".\" (.getMethodName el)))\n \" (\" (.getFileName el) \":\" (.getLineNumber el) \")\")))\n\n(defn pst\n \"Prints a stack trace of the exception, to the depth requested. If none supplied, uses the root cause of the\n most recent repl exception (*e), and a depth of 12.\"\n {:added \"1.3\"}\n ([] (pst 12))\n ([e-or-depth]\n (if (instance? Throwable e-or-depth)\n (pst e-or-depth 12)\n (when-let [e *e]\n (pst (root-cause e) e-or-depth))))\n ([^Throwable e depth]\n (binding [*out* *err*]\n (println (str (-> e class .getSimpleName) \" \"\n (.getMessage e)\n (when-let [info (ex-data e)] (str \" \" (pr-str info)))))\n (let [st (.getStackTrace e)\n cause (.getCause e)]\n (doseq [el (take depth\n (remove #(#{\"clojure.lang.RestFn\" \"clojure.lang.AFn\"} (.getClassName %))\n st))]\n (println (str \\tab (stack-element-str el))))\n (when cause\n (println \"Caused by:\")\n (pst cause (min depth\n (+ 2 (- (count (.getStackTrace cause))\n (count st))))))))))\n\n;; ----------------------------------------------------------------------\n;; Handle Ctrl-C keystrokes\n\n(defn thread-stopper\n \"Returns a function that takes one arg and uses that as an exception message\n to stop the given thread. Defaults to the current thread\"\n ([] (thread-stopper (Thread/currentThread)))\n ([thread] (fn [msg] (.stop thread (Error. msg)))))\n\n(defn set-break-handler!\n \"Register INT signal handler. After calling this, Ctrl-C will cause\n the given function f to be called with a single argument, the signal.\n Uses thread-stopper if no function given.\"\n ([] (set-break-handler! (thread-stopper)))\n ([f]\n (sun.misc.Signal/handle\n (sun.misc.Signal. \"INT\")\n (proxy [sun.misc.SignalHandler] []\n (handle [signal]\n (f (str \"-- caught signal \" signal)))))))\n" }, { "path": "src/clj/clojure/set.clj", "content": "; Copyright (c) Rich Hickey. All rights reserved.\n; The use and distribution terms for this software are covered by the\n; Eclipse Public License 1.0 (http://opensource.org/licenses/eclipse-1.0.php)\n; which can be found in the file epl-v10.html at the root of this distribution.\n; By using this software in any fashion, you are agreeing to be bound by\n; the terms of this license.\n; You must not remove this notice, or any other, from this software.\n\n(ns ^{:doc \"Set operations such as union/intersection.\"\n :author \"Rich Hickey\"}\n clojure.set)\n\n(defn- bubble-max-key [k coll]\n \"Move a maximal element of coll according to fn k (which returns a number) \n to the front of coll.\"\n (let [max (apply max-key k coll)]\n (cons max (remove #(identical? max %) coll))))\n\n(defn union\n \"Return a set that is the union of the input sets\"\n {:added \"1.0\"}\n ([] #{})\n ([s1] s1)\n ([s1 s2]\n (if (< (count s1) (count s2))\n (reduce conj s2 s1)\n (reduce conj s1 s2)))\n ([s1 s2 & sets]\n (let [bubbled-sets (bubble-max-key count (conj sets s2 s1))]\n (reduce into (first bubbled-sets) (rest bubbled-sets)))))\n\n(defn intersection\n \"Return a set that is the intersection of the input sets\"\n {:added \"1.0\"}\n ([s1] s1)\n ([s1 s2]\n (if (< (count s2) (count s1))\n (recur s2 s1)\n (reduce (fn [result item]\n (if (contains? s2 item)\n\t\t result\n (disj result item)))\n\t s1 s1)))\n ([s1 s2 & sets] \n (let [bubbled-sets (bubble-max-key #(- (count %)) (conj sets s2 s1))]\n (reduce intersection (first bubbled-sets) (rest bubbled-sets)))))\n\n(defn difference\n \"Return a set that is the first set without elements of the remaining sets\"\n {:added \"1.0\"}\n ([s1] s1)\n ([s1 s2] \n (if (< (count s1) (count s2))\n (reduce (fn [result item] \n (if (contains? s2 item) \n (disj result item) \n result))\n s1 s1)\n (reduce disj s1 s2)))\n ([s1 s2 & sets] \n (reduce difference s1 (conj sets s2))))\n\n\n(defn select\n \"Returns a set of the elements for which pred is true\"\n {:added \"1.0\"}\n [pred xset]\n (reduce (fn [s k] (if (pred k) s (disj s k)))\n xset xset))\n\n(defn project\n \"Returns a rel of the elements of xrel with only the keys in ks\"\n {:added \"1.0\"}\n [xrel ks]\n (with-meta (set (map #(select-keys % ks) xrel)) (meta xrel)))\n\n(defn rename-keys\n \"Returns the map with the keys in kmap renamed to the vals in kmap\"\n {:added \"1.0\"}\n [map kmap]\n (reduce \n (fn [m [old new]]\n (if (contains? map old)\n (assoc m new (get map old))\n m)) \n (apply dissoc map (keys kmap)) kmap))\n\n(defn rename\n \"Returns a rel of the maps in xrel with the keys in kmap renamed to the vals in kmap\"\n {:added \"1.0\"}\n [xrel kmap]\n (with-meta (set (map #(rename-keys % kmap) xrel)) (meta xrel)))\n\n(defn index\n \"Returns a map of the distinct values of ks in the xrel mapped to a\n set of the maps in xrel with the corresponding values of ks.\"\n {:added \"1.0\"}\n [xrel ks]\n (reduce\n (fn [m x]\n (let [ik (select-keys x ks)]\n (assoc m ik (conj (get m ik #{}) x))))\n {} xrel))\n \n(defn map-invert\n \"Returns the map with the vals mapped to the keys.\"\n {:added \"1.0\"}\n [m] (reduce (fn [m [k v]] (assoc m v k)) {} m))\n\n(defn join\n \"When passed 2 rels, returns the rel corresponding to the natural\n join. When passed an additional keymap, joins on the corresponding\n keys.\"\n {:added \"1.0\"}\n ([xrel yrel] ;natural join\n (if (and (seq xrel) (seq yrel))\n (let [ks (intersection (set (keys (first xrel))) (set (keys (first yrel))))\n [r s] (if (<= (count xrel) (count yrel))\n [xrel yrel]\n [yrel xrel])\n idx (index r ks)]\n (reduce (fn [ret x]\n (let [found (idx (select-keys x ks))]\n (if found\n (reduce #(conj %1 (merge %2 x)) ret found)\n ret)))\n #{} s))\n #{}))\n ([xrel yrel km] ;arbitrary key mapping\n (let [[r s k] (if (<= (count xrel) (count yrel))\n [xrel yrel (map-invert km)]\n [yrel xrel km])\n idx (index r (vals k))]\n (reduce (fn [ret x]\n (let [found (idx (rename-keys (select-keys x (keys k)) k))]\n (if found\n (reduce #(conj %1 (merge %2 x)) ret found)\n ret)))\n #{} s))))\n\n(defn subset? \n \"Is set1 a subset of set2?\"\n {:added \"1.2\",\n :tag Boolean}\n [set1 set2]\n (and (<= (count set1) (count set2))\n (every? #(contains? set2 %) set1)))\n\n(defn superset? \n \"Is set1 a superset of set2?\"\n {:added \"1.2\",\n :tag Boolean}\n [set1 set2]\n (and (>= (count set1) (count set2))\n (every? #(contains? set1 %) set2)))\n\n(comment\n(refer 'set)\n(def xs #{{:a 11 :b 1 :c 1 :d 4}\n {:a 2 :b 12 :c 2 :d 6}\n {:a 3 :b 3 :c 3 :d 8 :f 42}})\n\n(def ys #{{:a 11 :b 11 :c 11 :e 5}\n {:a 12 :b 11 :c 12 :e 3}\n {:a 3 :b 3 :c 3 :e 7 }})\n\n(join xs ys)\n(join xs (rename ys {:b :yb :c :yc}) {:a :a})\n\n(union #{:a :b :c} #{:c :d :e })\n(difference #{:a :b :c} #{:c :d :e})\n(intersection #{:a :b :c} #{:c :d :e})\n\n(index ys [:b])\n)\n\n" }, { "path": "src/clj/clojure/stacktrace.clj", "content": "; Copyright (c) Rich Hickey. All rights reserved.\n; The use and distribution terms for this software are covered by the\n; Eclipse Public License 1.0 (http://opensource.org/licenses/eclipse-1.0.php)\n; which can be found in the file epl-v10.html at the root of this distribution.\n; By using this software in any fashion, you are agreeing to be bound by\n; the terms of this license.\n; You must not remove this notice, or any other, from this software.\n\n;;; stacktrace.clj: print Clojure-centric stack traces\n\n;; by Stuart Sierra\n;; January 6, 2009\n\n(ns ^{:doc \"Print stack traces oriented towards Clojure, not Java.\"\n :author \"Stuart Sierra\"}\n clojure.stacktrace)\n\n(defn root-cause\n \"Returns the last 'cause' Throwable in a chain of Throwables.\"\n {:added \"1.1\"}\n [^Throwable tr]\n (if-let [cause (.getCause tr)]\n (recur cause)\n tr))\n\n(defn print-trace-element\n \"Prints a Clojure-oriented view of one element in a stack trace.\"\n {:added \"1.1\"}\n [^StackTraceElement e]\n (let [class (.getClassName e)\n\tmethod (.getMethodName e)]\n (let [match (re-matches #\"^([A-Za-z0-9_.-]+)\\$(\\w+)__\\d+$\" (str class))]\n (if (and match (= \"invoke\" method))\n\t(apply printf \"%s/%s\" (rest match))\n\t(printf \"%s.%s\" class method))))\n (printf \" (%s:%d)\" (or (.getFileName e) \"\") (.getLineNumber e)))\n\n(defn print-throwable\n \"Prints the class and message of a Throwable.\"\n {:added \"1.1\"}\n [^Throwable tr]\n (printf \"%s: %s\" (.getName (class tr)) (.getMessage tr)))\n\n(defn print-stack-trace\n \"Prints a Clojure-oriented stack trace of tr, a Throwable.\n Prints a maximum of n stack frames (default: unlimited).\n Does not print chained exceptions (causes).\"\n {:added \"1.1\"}\n ([tr] (print-stack-trace tr nil))\n ([^Throwable tr n]\n (let [^StackTraceElement st (.getStackTrace tr)]\n (print-throwable tr)\n (newline)\n (print \" at \")\n (if-let [e (first st)]\n (print-trace-element e)\n (print \"[empty stack trace]\"))\n (newline)\n (doseq [e (if (nil? n)\n\t\t (rest st)\n\t\t (take (dec n) (rest st)))]\n\t (print \" \")\n\t (print-trace-element e)\n\t (newline)))))\n\n(defn print-cause-trace\n \"Like print-stack-trace but prints chained exceptions (causes).\"\n {:added \"1.1\"}\n ([^Throwable tr] (print-cause-trace tr nil))\n ([^Throwable tr n]\n (print-stack-trace tr n)\n (when-let [cause (.getCause tr)]\n (print \"Caused by: \" )\n (recur cause n))))\n\n(defn e\n \"REPL utility. Prints a brief stack trace for the root cause of the\n most recent exception.\"\n {:added \"1.1\"}\n []\n (print-stack-trace (root-cause *e) 8))\n" }, { "path": "src/clj/clojure/string.clj", "content": "; Copyright (c) Rich Hickey. All rights reserved.\n; The use and distribution terms for this software are covered by the\n; Eclipse Public License 1.0 (http://opensource.org/licenses/eclipse-1.0.php)\n; which can be found in the file epl-v10.html at the root of this distribution.\n; By using this software in any fashion, you are agreeing to be bound by\n; the terms of this license.\n; You must not remove this notice, or any other, from this software.\n\n(ns ^{:doc \"Clojure String utilities\n\nIt is poor form to (:use clojure.string). Instead, use require\nwith :as to specify a prefix, e.g.\n\n(ns your.namespace.here\n (:require [clojure.string :as str]))\n\nDesign notes for clojure.string:\n\n1. Strings are objects (as opposed to sequences). As such, the\n string being manipulated is the first argument to a function;\n passing nil will result in a NullPointerException unless\n documented otherwise. If you want sequence-y behavior instead,\n use a sequence.\n\n2. Functions are generally not lazy, and call straight to host\n methods where those are available and efficient.\n\n3. Functions take advantage of String implementation details to\n write high-performing loop/recurs instead of using higher-order\n functions. (This is not idiomatic in general-purpose application\n code.)\n\n4. When a function is documented to accept a string argument, it\n will take any implementation of the correct *interface* on the\n host platform. In Java, this is CharSequence, which is more\n general than String. In ordinary usage you will almost always\n pass concrete strings. If you are doing something unusual,\n e.g. passing a mutable implementation of CharSequence, then\n thread-safety is your responsibility.\"\n :author \"Stuart Sierra, Stuart Halloway, David Liebke\"}\n clojure.string\n (:refer-clojure :exclude (replace reverse))\n (:import (java.util.regex Pattern Matcher)\n clojure.lang.LazilyPersistentVector))\n\n(defn ^String reverse\n \"Returns s with its characters reversed.\"\n {:added \"1.2\"}\n [^CharSequence s]\n (.toString (.reverse (StringBuilder. s))))\n\n(defn ^String re-quote-replacement\n \"Given a replacement string that you wish to be a literal\n replacement for a pattern match in replace or replace-first, do the\n necessary escaping of special characters in the replacement.\"\n {:added \"1.5\"}\n [^CharSequence replacement]\n (Matcher/quoteReplacement (.toString ^CharSequence replacement)))\n\n(defn- replace-by\n [^CharSequence s re f]\n (let [m (re-matcher re s)]\n (if (.find m)\n (let [buffer (StringBuffer. (.length s))]\n (loop [found true]\n (if found\n (do (.appendReplacement m buffer (Matcher/quoteReplacement (f (re-groups m))))\n (recur (.find m)))\n (do (.appendTail m buffer)\n (.toString buffer)))))\n s)))\n\n(defn ^String replace\n \"Replaces all instance of match with replacement in s.\n\n match/replacement can be:\n\n string / string\n char / char\n pattern / (string or function of match).\n\n See also replace-first.\n\n The replacement is literal (i.e. none of its characters are treated\n specially) for all cases above except pattern / string.\n\n For pattern / string, $1, $2, etc. in the replacement string are\n substituted with the string that matched the corresponding\n parenthesized group in the pattern. If you wish your replacement\n string r to be used literally, use (re-quote-replacement r) as the\n replacement argument. See also documentation for\n java.util.regex.Matcher's appendReplacement method.\n\n Example:\n (clojure.string/replace \\\"Almost Pig Latin\\\" #\\\"\\\\b(\\\\w)(\\\\w+)\\\\b\\\" \\\"$2$1ay\\\")\n -> \\\"lmostAay igPay atinLay\\\"\"\n {:added \"1.2\"}\n [^CharSequence s match replacement]\n (let [s (.toString s)]\n (cond\n (instance? Character match) (.replace s ^Character match ^Character replacement)\n (instance? CharSequence match) (.replace s ^CharSequence match ^CharSequence replacement)\n (instance? Pattern match) (if (instance? CharSequence replacement)\n (.replaceAll (re-matcher ^Pattern match s)\n (.toString ^CharSequence replacement))\n (replace-by s match replacement))\n :else (throw (IllegalArgumentException. (str \"Invalid match arg: \" match))))))\n\n(defn- replace-first-by\n [^CharSequence s ^Pattern re f]\n (let [m (re-matcher re s)]\n (if (.find m)\n (let [buffer (StringBuffer. (.length s))\n rep (Matcher/quoteReplacement (f (re-groups m)))]\n (.appendReplacement m buffer rep)\n (.appendTail m buffer)\n (str buffer))\n s)))\n\n(defn- replace-first-char\n [^CharSequence s ^Character match replace]\n (let [s (.toString s)\n i (.indexOf s (int match))]\n (if (= -1 i)\n s\n (str (subs s 0 i) replace (subs s (inc i))))))\n\n(defn- replace-first-str\n [^CharSequence s ^String match ^String replace]\n (let [^String s (.toString s)\n i (.indexOf s match)]\n (if (= -1 i)\n s\n (str (subs s 0 i) replace (subs s (+ i (.length match)))))))\n\n(defn ^String replace-first\n \"Replaces the first instance of match with replacement in s.\n\n match/replacement can be:\n\n char / char\n string / string\n pattern / (string or function of match).\n\n See also replace.\n\n The replacement is literal (i.e. none of its characters are treated\n specially) for all cases above except pattern / string.\n\n For pattern / string, $1, $2, etc. in the replacement string are\n substituted with the string that matched the corresponding\n parenthesized group in the pattern. If you wish your replacement\n string r to be used literally, use (re-quote-replacement r) as the\n replacement argument. See also documentation for\n java.util.regex.Matcher's appendReplacement method.\n\n Example:\n (clojure.string/replace-first \\\"swap first two words\\\"\n #\\\"(\\\\w+)(\\\\s+)(\\\\w+)\\\" \\\"$3$2$1\\\")\n -> \\\"first swap two words\\\"\"\n {:added \"1.2\"}\n [^CharSequence s match replacement]\n (let [s (.toString s)]\n (cond\n (instance? Character match)\n (replace-first-char s match replacement)\n (instance? CharSequence match)\n (replace-first-str s (.toString ^CharSequence match)\n (.toString ^CharSequence replacement))\n (instance? Pattern match)\n (if (instance? CharSequence replacement)\n (.replaceFirst (re-matcher ^Pattern match s)\n (.toString ^CharSequence replacement))\n (replace-first-by s match replacement))\n :else (throw (IllegalArgumentException. (str \"Invalid match arg: \" match))))))\n\n\n(defn ^String join\n \"Returns a string of all elements in coll, as returned by (seq coll),\n separated by an optional separator.\"\n {:added \"1.2\"}\n ([coll]\n (apply str coll))\n ([separator coll]\n (loop [sb (StringBuilder. (str (first coll)))\n more (next coll)\n sep (str separator)]\n (if more\n (recur (-> sb (.append sep) (.append (str (first more))))\n (next more)\n sep)\n (str sb)))))\n\n(defn ^String capitalize\n \"Converts first character of the string to upper-case, all other\n characters to lower-case.\"\n {:added \"1.2\"}\n [^CharSequence s]\n (let [s (.toString s)]\n (if (< (count s) 2)\n (.toUpperCase s)\n (str (.toUpperCase (subs s 0 1))\n (.toLowerCase (subs s 1))))))\n\n(defn ^String upper-case\n \"Converts string to all upper-case.\"\n {:added \"1.2\"}\n [^CharSequence s]\n (.. s toString toUpperCase))\n\n(defn ^String lower-case\n \"Converts string to all lower-case.\"\n {:added \"1.2\"}\n [^CharSequence s]\n (.. s toString toLowerCase))\n\n(defn split\n \"Splits string on a regular expression. Optional argument limit is\n the maximum number of splits. Not lazy. Returns vector of the splits.\"\n {:added \"1.2\"}\n ([^CharSequence s ^Pattern re]\n (LazilyPersistentVector/createOwning (.split re s)))\n ([ ^CharSequence s ^Pattern re limit]\n (LazilyPersistentVector/createOwning (.split re s limit))))\n\n(defn split-lines\n \"Splits s on \\\\n or \\\\r\\\\n.\"\n {:added \"1.2\"}\n [^CharSequence s]\n (split s #\"\\r?\\n\"))\n\n(defn ^String trim\n \"Removes whitespace from both ends of string.\"\n {:added \"1.2\"}\n [^CharSequence s]\n (let [len (.length s)]\n (loop [rindex len]\n (if (zero? rindex)\n \"\"\n (if (Character/isWhitespace (.charAt s (dec rindex)))\n (recur (dec rindex))\n ;; there is at least one non-whitespace char in the string,\n ;; so no need to check for lindex reaching len.\n (loop [lindex 0]\n (if (Character/isWhitespace (.charAt s lindex))\n (recur (inc lindex))\n (.. s (subSequence lindex rindex) toString))))))))\n\n(defn ^String triml\n \"Removes whitespace from the left side of string.\"\n {:added \"1.2\"}\n [^CharSequence s]\n (let [len (.length s)]\n (loop [index 0]\n (if (= len index)\n \"\"\n (if (Character/isWhitespace (.charAt s index))\n (recur (unchecked-inc index))\n (.. s (subSequence index len) toString))))))\n\n(defn ^String trimr\n \"Removes whitespace from the right side of string.\"\n {:added \"1.2\"}\n [^CharSequence s]\n (loop [index (.length s)]\n (if (zero? index)\n \"\"\n (if (Character/isWhitespace (.charAt s (unchecked-dec index)))\n (recur (unchecked-dec index))\n (.. s (subSequence 0 index) toString)))))\n\n(defn ^String trim-newline\n \"Removes all trailing newline \\\\n or return \\\\r characters from\n string. Similar to Perl's chomp.\"\n {:added \"1.2\"}\n [^CharSequence s]\n (loop [index (.length s)]\n (if (zero? index)\n \"\"\n (let [ch (.charAt s (dec index))]\n (if (or (= ch \\newline) (= ch \\return))\n (recur (dec index))\n (.. s (subSequence 0 index) toString))))))\n\n(defn blank?\n \"True if s is nil, empty, or contains only whitespace.\"\n {:added \"1.2\"}\n [^CharSequence s]\n (if s\n (loop [index (int 0)]\n (if (= (.length s) index)\n true\n (if (Character/isWhitespace (.charAt s index))\n (recur (inc index))\n false)))\n true))\n\n(defn ^String escape\n \"Return a new string, using cmap to escape each character ch\n from s as follows:\n\n If (cmap ch) is nil, append ch to the new string.\n If (cmap ch) is non-nil, append (str (cmap ch)) instead.\"\n {:added \"1.2\"}\n [^CharSequence s cmap]\n (loop [index (int 0)\n buffer (StringBuilder. (.length s))]\n (if (= (.length s) index)\n (.toString buffer)\n (let [ch (.charAt s index)]\n (if-let [replacement (cmap ch)]\n (.append buffer replacement)\n (.append buffer ch))\n (recur (inc index) buffer)))))\n" }, { "path": "src/clj/clojure/template.clj", "content": "; Copyright (c) Rich Hickey. All rights reserved.\n; The use and distribution terms for this software are covered by the\n; Eclipse Public License 1.0 (http://opensource.org/licenses/eclipse-1.0.php)\n; which can be found in the file epl-v10.html at the root of this distribution.\n; By using this software in any fashion, you are agreeing to be bound by\n; the terms of this license.\n; You must not remove this notice, or any other, from this software.\n\n;;; template.clj - anonymous functions that pre-evaluate sub-expressions\n\n;; By Stuart Sierra\n;; June 23, 2009\n\n;; CHANGE LOG\n;;\n;; June 23, 2009: complete rewrite, eliminated _1,_2,... argument\n;; syntax\n;;\n;; January 20, 2009: added \"template?\" and checks for valid template\n;; expressions.\n;;\n;; December 15, 2008: first version\n\n(ns ^{:doc \"Macros that expand to repeated copies of a template expression.\"\n :author \"Stuart Sierra\"}\n clojure.template\n (:require [clojure.walk :as walk]))\n\n(defn apply-template\n \"For use in macros. argv is an argument list, as in defn. expr is\n a quoted expression using the symbols in argv. values is a sequence\n of values to be used for the arguments.\n\n apply-template will recursively replace argument symbols in expr\n with their corresponding values, returning a modified expr.\n\n Example: (apply-template '[x] '(+ x x) '[2])\n ;=> (+ 2 2)\"\n [argv expr values]\n (assert (vector? argv))\n (assert (every? symbol? argv))\n (walk/prewalk-replace (zipmap argv values) expr))\n\n(defmacro do-template\n \"Repeatedly copies expr (in a do block) for each group of arguments\n in values. values are automatically partitioned by the number of\n arguments in argv, an argument vector as in defn.\n\n Example: (macroexpand '(do-template [x y] (+ y x) 2 4 3 5))\n ;=> (do (+ 4 2) (+ 5 3))\"\n [argv expr & values]\n (let [c (count argv)]\n `(do ~@(map (fn [a] (apply-template argv expr a))\n (partition c values)))))\n" }, { "path": "src/clj/clojure/test/junit.clj", "content": "; Copyright (c) Rich Hickey. All rights reserved.\n; The use and distribution terms for this software are covered by the\n; Eclipse Public License 1.0 (http://opensource.org/licenses/eclipse-1.0.php)\n; which can be found in the file epl-v10.html at the root of this distribution.\n; By using this software in any fashion, you are agreeing to be bound by\n; the terms of this license.\n; You must not remove this notice, or any other, from this software.\n\n;; test/junit.clj: Extension to clojure.test for JUnit-compatible XML output\n\n;; by Jason Sankey\n;; June 2009\n\n;; DOCUMENTATION\n;;\n\n(ns ^{:doc \"clojure.test extension for JUnit-compatible XML output.\n\n JUnit (http://junit.org/) is the most popular unit-testing library\n for Java. As such, tool support for JUnit output formats is\n common. By producing compatible output from tests, this tool\n support can be exploited.\n\n To use, wrap any calls to clojure.test/run-tests in the\n with-junit-output macro, like this:\n\n (use 'clojure.test)\n (use 'clojure.test.junit)\n\n (with-junit-output\n (run-tests 'my.cool.library))\n\n To write the output to a file, rebind clojure.test/*test-out* to\n your own PrintWriter (perhaps opened using\n clojure.java.io/writer).\"\n :author \"Jason Sankey\"}\n clojure.test.junit\n (:require [clojure.stacktrace :as stack]\n [clojure.test :as t]))\n\n;; copied from clojure.contrib.lazy-xml\n(def ^{:private true}\n escape-xml-map\n (zipmap \"'<>\\\"&\" (map #(str \\& % \\;) '[apos lt gt quot amp])))\n(defn- escape-xml [text]\n (apply str (map #(escape-xml-map % %) text)))\n\n(def ^:dynamic *var-context*)\n(def ^:dynamic *depth*)\n\n(defn indent\n []\n (dotimes [n (* *depth* 4)] (print \" \")))\n\n(defn start-element\n [tag pretty & [attrs]]\n (if pretty (indent))\n (print (str \"<\" tag))\n (if (seq attrs)\n (doseq [[key value] attrs]\n (print (str \" \" (name key) \"=\\\"\" (escape-xml value) \"\\\"\"))))\n (print \">\")\n (if pretty (println))\n (set! *depth* (inc *depth*)))\n\n(defn element-content\n [content]\n (print (escape-xml content)))\n\n(defn finish-element\n [tag pretty]\n (set! *depth* (dec *depth*))\n (if pretty (indent))\n (print (str \"\"))\n (if pretty (println)))\n\n(defn test-name\n [vars]\n (apply str (interpose \".\"\n (reverse (map #(:name (meta %)) vars)))))\n\n(defn package-class\n [name]\n (let [i (.lastIndexOf name \".\")]\n (if (< i 0)\n [nil name]\n [(.substring name 0 i) (.substring name (+ i 1))])))\n\n(defn start-case\n [name classname]\n (start-element 'testcase true {:name name :classname classname}))\n\n(defn finish-case\n []\n (finish-element 'testcase true))\n\n(defn suite-attrs\n [package classname]\n (let [attrs {:name classname}]\n (if package\n (assoc attrs :package package)\n attrs)))\n\n(defn start-suite\n [name]\n (let [[package classname] (package-class name)]\n (start-element 'testsuite true (suite-attrs package classname))))\n\n(defn finish-suite\n []\n (finish-element 'testsuite true))\n\n(defn message-el\n [tag message expected-str actual-str]\n (indent)\n (start-element tag false (if message {:message message} {}))\n (element-content\n (let [[file line] (t/file-position 5)\n detail (apply str (interpose\n \"\\n\"\n [(str \"expected: \" expected-str)\n (str \" actual: \" actual-str)\n (str \" at: \" file \":\" line)]))]\n (if message (str message \"\\n\" detail) detail)))\n (finish-element tag false)\n (println))\n\n(defn failure-el\n [message expected actual]\n (message-el 'failure message (pr-str expected) (pr-str actual)))\n\n(defn error-el\n [message expected actual]\n (message-el 'error\n message\n (pr-str expected)\n (if (instance? Throwable actual)\n (with-out-str (stack/print-cause-trace actual t/*stack-trace-depth*))\n (prn actual))))\n\n;; This multimethod will override test-is/report\n(defmulti ^:dynamic junit-report :type)\n\n(defmethod junit-report :begin-test-ns [m]\n (t/with-test-out\n (start-suite (name (ns-name (:ns m))))))\n\n(defmethod junit-report :end-test-ns [_]\n (t/with-test-out\n (finish-suite)))\n\n(defmethod junit-report :begin-test-var [m]\n (t/with-test-out\n (let [var (:var m)]\n (binding [*var-context* (conj *var-context* var)]\n (start-case (test-name *var-context*) (name (ns-name (:ns (meta var)))))))))\n\n(defmethod junit-report :end-test-var [m]\n (t/with-test-out\n (finish-case)))\n\n(defmethod junit-report :pass [m]\n (t/with-test-out\n (t/inc-report-counter :pass)))\n\n(defmethod junit-report :fail [m]\n (t/with-test-out\n (t/inc-report-counter :fail)\n (failure-el (:message m)\n (:expected m)\n (:actual m))))\n\n(defmethod junit-report :error [m]\n (t/with-test-out\n (t/inc-report-counter :error)\n (error-el (:message m)\n (:expected m)\n (:actual m))))\n\n(defmethod junit-report :default [_])\n\n(defmacro with-junit-output\n \"Execute body with modified test-is reporting functions that write\n JUnit-compatible XML output.\"\n {:added \"1.1\"}\n [& body]\n `(binding [t/report junit-report\n *var-context* (list)\n *depth* 1]\n (t/with-test-out\n (println \"\")\n (println \"\"))\n (let [result# ~@body]\n (t/with-test-out (println \"\"))\n result#)))\n" }, { "path": "src/clj/clojure/test/tap.clj", "content": "; Copyright (c) Rich Hickey. All rights reserved.\n; The use and distribution terms for this software are covered by the\n; Eclipse Public License 1.0 (http://opensource.org/licenses/eclipse-1.0.php)\n; which can be found in the file epl-v10.html at the root of this distribution.\n; By using this software in any fashion, you are agreeing to be bound by\n; the terms of this license.\n; You must not remove this notice, or any other, from this software.\n\n;;; test_is/tap.clj: Extension to test for TAP output\n\n;; by Stuart Sierra\n;; March 31, 2009\n\n;; Inspired by ClojureCheck by Meikel Brandmeyer:\n;; http://kotka.de/projects/clojure/clojurecheck.html\n\n\n;; DOCUMENTATION\n;;\n\n\n\n(ns ^{:doc \"clojure.test extensions for the Test Anything Protocol (TAP)\n\n TAP is a simple text-based syntax for reporting test results. TAP\n was originally developed for Perl, and now has implementations in\n several languages. For more information on TAP, see\n http://testanything.org/ and\n http://search.cpan.org/~petdance/TAP-1.0.0/TAP.pm\n\n To use this library, wrap any calls to\n clojure.test/run-tests in the with-tap-output macro,\n like this:\n\n (use 'clojure.test)\n (use 'clojure.test.tap)\n\n (with-tap-output\n (run-tests 'my.cool.library))\"\n :author \"Stuart Sierra\"}\n clojure.test.tap\n (:require [clojure.test :as t]\n [clojure.stacktrace :as stack]))\n\n(defn print-tap-plan\n \"Prints a TAP plan line like '1..n'. n is the number of tests\"\n {:added \"1.1\"}\n [n]\n (println (str \"1..\" n)))\n\n(defn print-tap-diagnostic\n \"Prints a TAP diagnostic line. data is a (possibly multi-line)\n string.\"\n {:added \"1.1\"}\n [data]\n (doseq [line (.split ^String data \"\\n\")]\n (println \"#\" line)))\n\n(defn print-tap-pass\n \"Prints a TAP 'ok' line. msg is a string, with no line breaks\"\n {:added \"1.1\"}\n [msg]\n (println \"ok\" msg))\n\n(defn print-tap-fail \n \"Prints a TAP 'not ok' line. msg is a string, with no line breaks\"\n {:added \"1.1\"}\n [msg]\n (println \"not ok\" msg))\n\n;; This multimethod will override test/report\n(defmulti ^:dynamic tap-report :type)\n\n(defmethod tap-report :default [data]\n (t/with-test-out\n (print-tap-diagnostic (pr-str data))))\n\n(defn print-diagnostics [data]\n (when (seq t/*testing-contexts*)\n (print-tap-diagnostic (t/testing-contexts-str)))\n (when (:message data)\n (print-tap-diagnostic (:message data)))\n (print-tap-diagnostic (str \"expected:\" (pr-str (:expected data))))\n (if (= :pass (:type data))\n (print-tap-diagnostic (str \" actual:\" (pr-str (:actual data))))\n (do\n (print-tap-diagnostic\n (str \" actual:\"\n (with-out-str\n (if (instance? Throwable (:actual data))\n (stack/print-cause-trace (:actual data) t/*stack-trace-depth*)\n (prn (:actual data)))))))))\n\n(defmethod tap-report :pass [data]\n (t/with-test-out\n (t/inc-report-counter :pass)\n (print-tap-pass (t/testing-vars-str data))\n (print-diagnostics data)))\n\n(defmethod tap-report :error [data]\n (t/with-test-out\n (t/inc-report-counter :error)\n (print-tap-fail (t/testing-vars-str data))\n (print-diagnostics data)))\n\n(defmethod tap-report :fail [data]\n (t/with-test-out\n (t/inc-report-counter :fail)\n (print-tap-fail (t/testing-vars-str data))\n (print-diagnostics data)))\n\n(defmethod tap-report :summary [data]\n (t/with-test-out\n (print-tap-plan (+ (:pass data) (:fail data) (:error data)))))\n\n\n(defmacro with-tap-output\n \"Execute body with modified test reporting functions that produce\n TAP output\"\n {:added \"1.1\"}\n [& body]\n `(binding [t/report tap-report]\n ~@body))\n" }, { "path": "src/clj/clojure/test.clj", "content": "; Copyright (c) Rich Hickey. All rights reserved.\n; The use and distribution terms for this software are covered by the\n; Eclipse Public License 1.0 (http://opensource.org/licenses/eclipse-1.0.php)\n; which can be found in the file epl-v10.html at the root of this distribution.\n; By using this software in any fashion, you are agreeing to be bound by\n; the terms of this license.\n; You must not remove this notice, or any other, from this software.\n\n;;; test.clj: test framework for Clojure\n\n;; by Stuart Sierra\n;; March 28, 2009\n\n;; Thanks to Chas Emerick, Allen Rohner, and Stuart Halloway for\n;; contributions and suggestions.\n\n(ns\n ^{:author \"Stuart Sierra, with contributions and suggestions by\n Chas Emerick, Allen Rohner, and Stuart Halloway\",\n :doc \"A unit testing framework.\n\n ASSERTIONS\n\n The core of the library is the \\\"is\\\" macro, which lets you make\n assertions of any arbitrary expression:\n\n (is (= 4 (+ 2 2)))\n (is (instance? Integer 256))\n (is (.startsWith \\\"abcde\\\" \\\"ab\\\"))\n\n You can type an \\\"is\\\" expression directly at the REPL, which will\n print a message if it fails.\n\n user> (is (= 5 (+ 2 2)))\n\n FAIL in (:1)\n expected: (= 5 (+ 2 2))\n actual: (not (= 5 4))\n false\n\n The \\\"expected:\\\" line shows you the original expression, and the\n \\\"actual:\\\" shows you what actually happened. In this case, it\n shows that (+ 2 2) returned 4, which is not = to 5. Finally, the\n \\\"false\\\" on the last line is the value returned from the\n expression. The \\\"is\\\" macro always returns the result of the\n inner expression.\n\n There are two special assertions for testing exceptions. The\n \\\"(is (thrown? c ...))\\\" form tests if an exception of class c is\n thrown:\n\n (is (thrown? ArithmeticException (/ 1 0)))\n\n \\\"(is (thrown-with-msg? c re ...))\\\" does the same thing and also\n tests that the message on the exception matches the regular\n expression re:\n\n (is (thrown-with-msg? ArithmeticException #\\\"Divide by zero\\\"\n (/ 1 0)))\n\n DOCUMENTING TESTS\n\n \\\"is\\\" takes an optional second argument, a string describing the\n assertion. This message will be included in the error report.\n\n (is (= 5 (+ 2 2)) \\\"Crazy arithmetic\\\")\n\n In addition, you can document groups of assertions with the\n \\\"testing\\\" macro, which takes a string followed by any number of\n assertions. The string will be included in failure reports.\n Calls to \\\"testing\\\" may be nested, and all of the strings will be\n joined together with spaces in the final report, in a style\n similar to RSpec \n\n (testing \\\"Arithmetic\\\"\n (testing \\\"with positive integers\\\"\n (is (= 4 (+ 2 2)))\n (is (= 7 (+ 3 4))))\n (testing \\\"with negative integers\\\"\n (is (= -4 (+ -2 -2)))\n (is (= -1 (+ 3 -4)))))\n\n Note that, unlike RSpec, the \\\"testing\\\" macro may only be used\n INSIDE a \\\"deftest\\\" or \\\"with-test\\\" form (see below).\n\n\n DEFINING TESTS\n\n There are two ways to define tests. The \\\"with-test\\\" macro takes\n a defn or def form as its first argument, followed by any number\n of assertions. The tests will be stored as metadata on the\n definition.\n\n (with-test\n (defn my-function [x y]\n (+ x y))\n (is (= 4 (my-function 2 2)))\n (is (= 7 (my-function 3 4))))\n\n As of Clojure SVN rev. 1221, this does not work with defmacro.\n See http://code.google.com/p/clojure/issues/detail?id=51\n\n The other way lets you define tests separately from the rest of\n your code, even in a different namespace:\n\n (deftest addition\n (is (= 4 (+ 2 2)))\n (is (= 7 (+ 3 4))))\n\n (deftest subtraction\n (is (= 1 (- 4 3)))\n (is (= 3 (- 7 4))))\n\n This creates functions named \\\"addition\\\" and \\\"subtraction\\\", which\n can be called like any other function. Therefore, tests can be\n grouped and composed, in a style similar to the test framework in\n Peter Seibel's \\\"Practical Common Lisp\\\"\n \n\n (deftest arithmetic\n (addition)\n (subtraction))\n\n The names of the nested tests will be joined in a list, like\n \\\"(arithmetic addition)\\\", in failure reports. You can use nested\n tests to set up a context shared by several tests.\n\n\n RUNNING TESTS\n\n Run tests with the function \\\"(run-tests namespaces...)\\\":\n\n (run-tests 'your.namespace 'some.other.namespace)\n\n If you don't specify any namespaces, the current namespace is\n used. To run all tests in all namespaces, use \\\"(run-all-tests)\\\".\n\n By default, these functions will search for all tests defined in\n a namespace and run them in an undefined order. However, if you\n are composing tests, as in the \\\"arithmetic\\\" example above, you\n probably do not want the \\\"addition\\\" and \\\"subtraction\\\" tests run\n separately. In that case, you must define a special function\n named \\\"test-ns-hook\\\" that runs your tests in the correct order:\n\n (defn test-ns-hook []\n (arithmetic))\n\n Note: test-ns-hook prevents execution of fixtures (see below).\n\n\n OMITTING TESTS FROM PRODUCTION CODE\n\n You can bind the variable \\\"*load-tests*\\\" to false when loading or\n compiling code in production. This will prevent any tests from\n being created by \\\"with-test\\\" or \\\"deftest\\\".\n\n\n FIXTURES\n\n Fixtures allow you to run code before and after tests, to set up\n the context in which tests should be run.\n\n A fixture is just a function that calls another function passed as\n an argument. It looks like this:\n\n (defn my-fixture [f]\n Perform setup, establish bindings, whatever.\n (f) Then call the function we were passed.\n Tear-down / clean-up code here.\n )\n\n Fixtures are attached to namespaces in one of two ways. \\\"each\\\"\n fixtures are run repeatedly, once for each test function created\n with \\\"deftest\\\" or \\\"with-test\\\". \\\"each\\\" fixtures are useful for\n establishing a consistent before/after state for each test, like\n clearing out database tables.\n\n \\\"each\\\" fixtures can be attached to the current namespace like this:\n (use-fixtures :each fixture1 fixture2 ...)\n The fixture1, fixture2 are just functions like the example above.\n They can also be anonymous functions, like this:\n (use-fixtures :each (fn [f] setup... (f) cleanup...))\n\n The other kind of fixture, a \\\"once\\\" fixture, is only run once,\n around ALL the tests in the namespace. \\\"once\\\" fixtures are useful\n for tasks that only need to be performed once, like establishing\n database connections, or for time-consuming tasks.\n\n Attach \\\"once\\\" fixtures to the current namespace like this:\n (use-fixtures :once fixture1 fixture2 ...)\n\n Note: Fixtures and test-ns-hook are mutually incompatible. If you\n are using test-ns-hook, fixture functions will *never* be run.\n\n\n SAVING TEST OUTPUT TO A FILE\n\n All the test reporting functions write to the var *test-out*. By\n default, this is the same as *out*, but you can rebind it to any\n PrintWriter. For example, it could be a file opened with\n clojure.java.io/writer.\n\n\n EXTENDING TEST-IS (ADVANCED)\n\n You can extend the behavior of the \\\"is\\\" macro by defining new\n methods for the \\\"assert-expr\\\" multimethod. These methods are\n called during expansion of the \\\"is\\\" macro, so they should return\n quoted forms to be evaluated.\n\n You can plug in your own test-reporting framework by rebinding\n the \\\"report\\\" function: (report event)\n\n The 'event' argument is a map. It will always have a :type key,\n whose value will be a keyword signaling the type of event being\n reported. Standard events with :type value of :pass, :fail, and\n :error are called when an assertion passes, fails, and throws an\n exception, respectively. In that case, the event will also have\n the following keys:\n\n :expected The form that was expected to be true\n :actual A form representing what actually occurred\n :message The string message given as an argument to 'is'\n\n The \\\"testing\\\" strings will be a list in \\\"*testing-contexts*\\\", and\n the vars being tested will be a list in \\\"*testing-vars*\\\".\n\n Your \\\"report\\\" function should wrap any printing calls in the\n \\\"with-test-out\\\" macro, which rebinds *out* to the current value\n of *test-out*.\n\n For additional event types, see the examples in the code.\n \"}\n clojure.test\n (:require [clojure.stacktrace :as stack]))\n\n\n(require '[clojure.template :as temp])\n\n;; Nothing is marked \"private\" here, so you can rebind things to plug\n;; in your own testing or reporting frameworks.\n\n\n;;; USER-MODIFIABLE GLOBALS\n\n(defonce ^:dynamic\n ^{:doc \"True by default. If set to false, no test functions will\n be created by deftest, set-test, or with-test. Use this to omit\n tests when compiling or loading production code.\"\n :added \"1.1\"}\n *load-tests* true)\n\n(def ^:dynamic\n ^{:doc \"The maximum depth of stack traces to print when an Exception\n is thrown during a test. Defaults to nil, which means print the\n complete stack trace.\"\n :added \"1.1\"}\n *stack-trace-depth* nil)\n\n\n;;; GLOBALS USED BY THE REPORTING FUNCTIONS\n\n(def ^:dynamic *report-counters* nil)\t ; bound to a ref of a map in test-ns\n\n(def ^:dynamic *initial-report-counters* ; used to initialize *report-counters*\n {:test 0, :pass 0, :fail 0, :error 0})\n\n(def ^:dynamic *testing-vars* (list)) ; bound to hierarchy of vars being tested\n\n(def ^:dynamic *testing-contexts* (list)) ; bound to hierarchy of \"testing\" strings\n\n(def ^:dynamic *test-out* *out*) ; PrintWriter for test reporting output\n\n(defmacro with-test-out\n \"Runs body with *out* bound to the value of *test-out*.\"\n {:added \"1.1\"}\n [& body]\n `(binding [*out* *test-out*]\n ~@body))\n\n;;; UTILITIES FOR REPORTING FUNCTIONS\n\n(defn file-position\n \"Returns a vector [filename line-number] for the nth call up the\n stack.\n\n Deprecated in 1.2: The information needed for test reporting is\n now on :file and :line keys in the result map.\"\n {:added \"1.1\"\n :deprecated \"1.2\"}\n [n]\n (let [^StackTraceElement s (nth (.getStackTrace (new java.lang.Throwable)) n)]\n [(.getFileName s) (.getLineNumber s)]))\n\n(defn testing-vars-str\n \"Returns a string representation of the current test. Renders names\n in *testing-vars* as a list, then the source file and line of\n current assertion.\"\n {:added \"1.1\"}\n [m]\n (let [{:keys [file line]} m]\n (str\n ;; Uncomment to include namespace in failure report:\n ;;(ns-name (:ns (meta (first *testing-vars*)))) \"/ \"\n (reverse (map #(:name (meta %)) *testing-vars*))\n \" (\" file \":\" line \")\")))\n\n(defn testing-contexts-str\n \"Returns a string representation of the current test context. Joins\n strings in *testing-contexts* with spaces.\"\n {:added \"1.1\"}\n []\n (apply str (interpose \" \" (reverse *testing-contexts*))))\n\n(defn inc-report-counter\n \"Increments the named counter in *report-counters*, a ref to a map.\n Does nothing if *report-counters* is nil.\"\n {:added \"1.1\"}\n [name]\n (when *report-counters*\n (dosync (commute *report-counters* assoc name\n (inc (or (*report-counters* name) 0))))))\n\n;;; TEST RESULT REPORTING\n\n(defmulti\n ^{:doc \"Generic reporting function, may be overridden to plug in\n different report formats (e.g., TAP, JUnit). Assertions such as\n 'is' call 'report' to indicate results. The argument given to\n 'report' will be a map with a :type key. See the documentation at\n the top of test_is.clj for more information on the types of\n arguments for 'report'.\"\n :dynamic true\n :added \"1.1\"}\n report :type)\n\n(defn- file-and-line\n [^Throwable exception depth]\n (let [stacktrace (.getStackTrace exception)]\n (if (< depth (count stacktrace))\n (let [^StackTraceElement s (nth stacktrace depth)]\n {:file (.getFileName s) :line (.getLineNumber s)})\n {:file nil :line nil})))\n\n(defn do-report\n \"Add file and line information to a test result and call report.\n If you are writing a custom assert-expr method, call this function\n to pass test results to report.\"\n {:added \"1.2\"}\n [m]\n (report\n (case\n (:type m)\n :fail (merge (file-and-line (new java.lang.Throwable) 1) m)\n :error (merge (file-and-line (:actual m) 0) m)\n m)))\n\n(defmethod report :default [m]\n (with-test-out (prn m)))\n\n(defmethod report :pass [m]\n (with-test-out (inc-report-counter :pass)))\n\n(defmethod report :fail [m]\n (with-test-out\n (inc-report-counter :fail)\n (println \"\\nFAIL in\" (testing-vars-str m))\n (when (seq *testing-contexts*) (println (testing-contexts-str)))\n (when-let [message (:message m)] (println message))\n (println \"expected:\" (pr-str (:expected m)))\n (println \" actual:\" (pr-str (:actual m)))))\n\n(defmethod report :error [m]\n (with-test-out\n (inc-report-counter :error)\n (println \"\\nERROR in\" (testing-vars-str m))\n (when (seq *testing-contexts*) (println (testing-contexts-str)))\n (when-let [message (:message m)] (println message))\n (println \"expected:\" (pr-str (:expected m)))\n (print \" actual: \")\n (let [actual (:actual m)]\n (if (instance? Throwable actual)\n (stack/print-cause-trace actual *stack-trace-depth*)\n (prn actual)))))\n\n(defmethod report :summary [m]\n (with-test-out\n (println \"\\nRan\" (:test m) \"tests containing\"\n (+ (:pass m) (:fail m) (:error m)) \"assertions.\")\n (println (:fail m) \"failures,\" (:error m) \"errors.\")))\n\n(defmethod report :begin-test-ns [m]\n (with-test-out\n (println \"\\nTesting\" (ns-name (:ns m)))))\n\n;; Ignore these message types:\n(defmethod report :end-test-ns [m])\n(defmethod report :begin-test-var [m])\n(defmethod report :end-test-var [m])\n\n\n\n;;; UTILITIES FOR ASSERTIONS\n\n(defn get-possibly-unbound-var\n \"Like var-get but returns nil if the var is unbound.\"\n {:added \"1.1\"}\n [v]\n (try (var-get v)\n (catch IllegalStateException e\n nil)))\n\n(defn function?\n \"Returns true if argument is a function or a symbol that resolves to\n a function (not a macro).\"\n {:added \"1.1\"}\n [x]\n (if (symbol? x)\n (when-let [v (resolve x)]\n (when-let [value (get-possibly-unbound-var v)]\n (and (fn? value)\n (not (:macro (meta v))))))\n (fn? x)))\n\n(defn assert-predicate\n \"Returns generic assertion code for any functional predicate. The\n 'expected' argument to 'report' will contains the original form, the\n 'actual' argument will contain the form with all its sub-forms\n evaluated. If the predicate returns false, the 'actual' form will\n be wrapped in (not...).\"\n {:added \"1.1\"}\n [msg form]\n (let [args (rest form)\n pred (first form)]\n `(let [values# (list ~@args)\n result# (apply ~pred values#)]\n (if result#\n (do-report {:type :pass, :message ~msg,\n :expected '~form, :actual (cons ~pred values#)})\n (do-report {:type :fail, :message ~msg,\n :expected '~form, :actual (list '~'not (cons '~pred values#))}))\n result#)))\n\n(defn assert-any\n \"Returns generic assertion code for any test, including macros, Java\n method calls, or isolated symbols.\"\n {:added \"1.1\"}\n [msg form]\n `(let [value# ~form]\n (if value#\n (do-report {:type :pass, :message ~msg,\n :expected '~form, :actual value#})\n (do-report {:type :fail, :message ~msg,\n :expected '~form, :actual value#}))\n value#))\n\n\n\n;;; ASSERTION METHODS\n\n;; You don't call these, but you can add methods to extend the 'is'\n;; macro. These define different kinds of tests, based on the first\n;; symbol in the test expression.\n\n(defmulti assert-expr\n (fn [msg form]\n (cond\n (nil? form) :always-fail\n (seq? form) (first form)\n :else :default)))\n\n(defmethod assert-expr :always-fail [msg form]\n ;; nil test: always fail\n `(do-report {:type :fail, :message ~msg}))\n\n(defmethod assert-expr :default [msg form]\n (if (and (sequential? form) (function? (first form)))\n (assert-predicate msg form)\n (assert-any msg form)))\n\n(defmethod assert-expr 'instance? [msg form]\n ;; Test if x is an instance of y.\n `(let [klass# ~(nth form 1)\n object# ~(nth form 2)]\n (let [result# (instance? klass# object#)]\n (if result#\n (do-report {:type :pass, :message ~msg,\n :expected '~form, :actual (class object#)})\n (do-report {:type :fail, :message ~msg,\n :expected '~form, :actual (class object#)}))\n result#)))\n\n(defmethod assert-expr 'thrown? [msg form]\n ;; (is (thrown? c expr))\n ;; Asserts that evaluating expr throws an exception of class c.\n ;; Returns the exception thrown.\n (let [klass (second form)\n body (nthnext form 2)]\n `(try ~@body\n (do-report {:type :fail, :message ~msg,\n :expected '~form, :actual nil})\n (catch ~klass e#\n (do-report {:type :pass, :message ~msg,\n :expected '~form, :actual e#})\n e#))))\n\n(defmethod assert-expr 'thrown-with-msg? [msg form]\n ;; (is (thrown-with-msg? c re expr))\n ;; Asserts that evaluating expr throws an exception of class c.\n ;; Also asserts that the message string of the exception matches\n ;; (with re-find) the regular expression re.\n (let [klass (nth form 1)\n re (nth form 2)\n body (nthnext form 3)]\n `(try ~@body\n (do-report {:type :fail, :message ~msg, :expected '~form, :actual nil})\n (catch ~klass e#\n (let [m# (.getMessage e#)]\n (if (re-find ~re m#)\n (do-report {:type :pass, :message ~msg,\n :expected '~form, :actual e#})\n (do-report {:type :fail, :message ~msg,\n :expected '~form, :actual e#})))\n e#))))\n\n(defmacro try-expr\n \"Used by the 'is' macro to catch unexpected exceptions.\n You don't call this.\"\n {:added \"1.1\"}\n [msg form]\n `(try ~(assert-expr msg form)\n (catch Throwable t#\n (do-report {:type :error, :message ~msg,\n :expected '~form, :actual t#}))))\n\n\n\n;;; ASSERTION MACROS\n\n;; You use these in your tests.\n\n(defmacro is\n \"Generic assertion macro. 'form' is any predicate test.\n 'msg' is an optional message to attach to the assertion.\n\n Example: (is (= 4 (+ 2 2)) \\\"Two plus two should be 4\\\")\n\n Special forms:\n\n (is (thrown? c body)) checks that an instance of c is thrown from\n body, fails if not; then returns the thing thrown.\n\n (is (thrown-with-msg? c re body)) checks that an instance of c is\n thrown AND that the message on the exception matches (with\n re-find) the regular expression re.\"\n {:added \"1.1\"}\n ([form] `(is ~form nil))\n ([form msg] `(try-expr ~msg ~form)))\n\n(defmacro are\n \"Checks multiple assertions with a template expression.\n See clojure.template/do-template for an explanation of\n templates.\n\n Example: (are [x y] (= x y)\n 2 (+ 1 1)\n 4 (* 2 2))\n Expands to:\n (do (is (= 2 (+ 1 1)))\n (is (= 4 (* 2 2))))\n\n Note: This breaks some reporting features, such as line numbers.\"\n {:added \"1.1\"}\n [argv expr & args]\n (if (or\n ;; (are [] true) is meaningless but ok\n (and (empty? argv) (empty? args))\n ;; Catch wrong number of args\n (and (pos? (count argv))\n (pos? (count args))\n (zero? (mod (count args) (count argv)))))\n `(temp/do-template ~argv (is ~expr) ~@args)\n (throw (IllegalArgumentException. \"The number of args doesn't match are's argv.\"))))\n\n(defmacro testing\n \"Adds a new string to the list of testing contexts. May be nested,\n but must occur inside a test function (deftest).\"\n {:added \"1.1\"}\n [string & body]\n `(binding [*testing-contexts* (conj *testing-contexts* ~string)]\n ~@body))\n\n\n\n;;; DEFINING TESTS\n\n(defmacro with-test\n \"Takes any definition form (that returns a Var) as the first argument.\n Remaining body goes in the :test metadata function for that Var.\n\n When *load-tests* is false, only evaluates the definition, ignoring\n the tests.\"\n {:added \"1.1\"}\n [definition & body]\n (if *load-tests*\n `(doto ~definition (alter-meta! assoc :test (fn [] ~@body)))\n definition))\n\n\n(defmacro deftest\n \"Defines a test function with no arguments. Test functions may call\n other tests, so tests may be composed. If you compose tests, you\n should also define a function named test-ns-hook; run-tests will\n call test-ns-hook instead of testing all vars.\n\n Note: Actually, the test body goes in the :test metadata on the var,\n and the real function (the value of the var) calls test-var on\n itself.\n\n When *load-tests* is false, deftest is ignored.\"\n {:added \"1.1\"}\n [name & body]\n (when *load-tests*\n `(def ~(vary-meta name assoc :test `(fn [] ~@body))\n (fn [] (test-var (var ~name))))))\n\n(defmacro deftest-\n \"Like deftest but creates a private var.\"\n {:added \"1.1\"}\n [name & body]\n (when *load-tests*\n `(def ~(vary-meta name assoc :test `(fn [] ~@body) :private true)\n (fn [] (test-var (var ~name))))))\n\n\n(defmacro set-test\n \"Experimental.\n Sets :test metadata of the named var to a fn with the given body.\n The var must already exist. Does not modify the value of the var.\n\n When *load-tests* is false, set-test is ignored.\"\n {:added \"1.1\"}\n [name & body]\n (when *load-tests*\n `(alter-meta! (var ~name) assoc :test (fn [] ~@body))))\n\n;;; DEFINING FIXTURES\n\n(defn- add-ns-meta\n \"Adds elements in coll to the current namespace metadata as the\n value of key.\"\n {:added \"1.1\"}\n [key coll]\n (alter-meta! *ns* assoc key coll))\n\n(defmulti use-fixtures\n \"Wrap test runs in a fixture function to perform setup and\n teardown. Using a fixture-type of :each wraps every test\n individually, while:once wraps the whole run in a single function.\"\n {:added \"1.1\"}\n (fn [fixture-type & args] fixture-type))\n\n(defmethod use-fixtures :each [fixture-type & args]\n (add-ns-meta ::each-fixtures args))\n\n(defmethod use-fixtures :once [fixture-type & args]\n (add-ns-meta ::once-fixtures args))\n\n(defn- default-fixture\n \"The default, empty, fixture function. Just calls its argument.\"\n {:added \"1.1\"}\n [f]\n (f))\n\n(defn compose-fixtures\n \"Composes two fixture functions, creating a new fixture function\n that combines their behavior.\"\n {:added \"1.1\"}\n [f1 f2]\n (fn [g] (f1 (fn [] (f2 g)))))\n\n(defn join-fixtures\n \"Composes a collection of fixtures, in order. Always returns a valid\n fixture function, even if the collection is empty.\"\n {:added \"1.1\"}\n [fixtures]\n (reduce compose-fixtures default-fixture fixtures))\n\n\n\n\n;;; RUNNING TESTS: LOW-LEVEL FUNCTIONS\n\n(defn test-var\n \"If v has a function in its :test metadata, calls that function,\n with *testing-vars* bound to (conj *testing-vars* v).\"\n {:dynamic true, :added \"1.1\"}\n [v]\n (when-let [t (:test (meta v))]\n (binding [*testing-vars* (conj *testing-vars* v)]\n (do-report {:type :begin-test-var, :var v})\n (inc-report-counter :test)\n (try (t)\n (catch Throwable e\n (do-report {:type :error, :message \"Uncaught exception, not in assertion.\"\n :expected nil, :actual e})))\n (do-report {:type :end-test-var, :var v}))))\n\n(defn test-vars\n \"Groups vars by their namespace and runs test-vars on them with\n appropriate fixtures applied.\"\n {:added \"1.6\"}\n [vars]\n (doseq [[ns vars] (group-by (comp :ns meta) vars)]\n (let [once-fixture-fn (join-fixtures (::once-fixtures (meta ns)))\n each-fixture-fn (join-fixtures (::each-fixtures (meta ns)))]\n (once-fixture-fn\n (fn []\n (doseq [v vars]\n (when (:test (meta v))\n (each-fixture-fn (fn [] (test-var v))))))))))\n\n(defn test-all-vars\n \"Calls test-vars on every var interned in the namespace, with fixtures.\"\n {:added \"1.1\"}\n [ns]\n (test-vars (vals (ns-interns ns))))\n\n(defn test-ns\n \"If the namespace defines a function named test-ns-hook, calls that.\n Otherwise, calls test-all-vars on the namespace. 'ns' is a\n namespace object or a symbol.\n\n Internally binds *report-counters* to a ref initialized to\n *initial-report-counters*. Returns the final, dereferenced state of\n *report-counters*.\"\n {:added \"1.1\"}\n [ns]\n (binding [*report-counters* (ref *initial-report-counters*)]\n (let [ns-obj (the-ns ns)]\n (do-report {:type :begin-test-ns, :ns ns-obj})\n ;; If the namespace has a test-ns-hook function, call that:\n (if-let [v (find-var (symbol (str (ns-name ns-obj)) \"test-ns-hook\"))]\n ((var-get v))\n ;; Otherwise, just test every var in the namespace.\n (test-all-vars ns-obj))\n (do-report {:type :end-test-ns, :ns ns-obj}))\n @*report-counters*))\n\n\n\n;;; RUNNING TESTS: HIGH-LEVEL FUNCTIONS\n\n(defn run-tests\n \"Runs all tests in the given namespaces; prints results.\n Defaults to current namespace if none given. Returns a map\n summarizing test results.\"\n {:added \"1.1\"}\n ([] (run-tests *ns*))\n ([& namespaces]\n (let [summary (assoc (apply merge-with + (map test-ns namespaces))\n :type :summary)]\n (do-report summary)\n summary)))\n\n(defn run-all-tests\n \"Runs all tests in all namespaces; prints results.\n Optional argument is a regular expression; only namespaces with\n names matching the regular expression (with re-matches) will be\n tested.\"\n {:added \"1.1\"}\n ([] (apply run-tests (all-ns)))\n ([re] (apply run-tests (filter #(re-matches re (name (ns-name %))) (all-ns)))))\n\n(defn successful?\n \"Returns true if the given test summary indicates all tests\n were successful, false otherwise.\"\n {:added \"1.1\"}\n [summary]\n (and (zero? (:fail summary 0))\n (zero? (:error summary 0))))\n" }, { "path": "src/clj/clojure/uuid.clj", "content": "; Copyright (c) Rich Hickey. All rights reserved.\n; The use and distribution terms for this software are covered by the\n; Eclipse Public License 1.0 (http://opensource.org/licenses/eclipse-1.0.php)\n; which can be found in the file epl-v10.html at the root of this distribution.\n; By using this software in any fashion, you are agreeing to be bound by\n; the terms of this license.\n; You must not remove this notice, or any other, from this software.\n\n(ns clojure.uuid)\n\n(defn- default-uuid-reader [form]\n {:pre [(string? form)]}\n (java.util.UUID/fromString form))\n\n(defmethod print-method java.util.UUID [uuid ^java.io.Writer w]\n (.write w (str \"#uuid \\\"\" (str uuid) \"\\\"\")))\n\n(defmethod print-dup java.util.UUID [o w]\n (print-method o w))\n" }, { "path": "src/clj/clojure/walk.clj", "content": "; Copyright (c) Rich Hickey. All rights reserved.\n; The use and distribution terms for this software are covered by the\n; Eclipse Public License 1.0 (http://opensource.org/licenses/eclipse-1.0.php)\n; which can be found in the file epl-v10.html at the root of this distribution.\n; By using this software in any fashion, you are agreeing to be bound by\n; the terms of this license.\n; You must not remove this notice, or any other, from this software.\n\n;;; walk.clj - generic tree walker with replacement\n\n;; by Stuart Sierra\n;; December 15, 2008\n\n;; CHANGE LOG:\n;;\n;; * December 15, 2008: replaced 'walk' with 'prewalk' & 'postwalk'\n;;\n;; * December 9, 2008: first version\n\n\n(ns \n ^{:author \"Stuart Sierra\",\n :doc \"This file defines a generic tree walker for Clojure data\nstructures. It takes any data structure (list, vector, map, set,\nseq), calls a function on every element, and uses the return value\nof the function in place of the original. This makes it fairly\neasy to write recursive search-and-replace functions, as shown in\nthe examples.\n\nNote: \\\"walk\\\" supports all Clojure data structures EXCEPT maps\ncreated with sorted-map-by. There is no (obvious) way to retrieve\nthe sorting function.\"}\n clojure.walk)\n\n(defn walk\n \"Traverses form, an arbitrary data structure. inner and outer are\n functions. Applies inner to each element of form, building up a\n data structure of the same type, then applies outer to the result.\n Recognizes all Clojure data structures. Consumes seqs as with doall.\"\n\n {:added \"1.1\"}\n [inner outer form]\n (cond\n (list? form) (outer (apply list (map inner form)))\n (instance? clojure.lang.IMapEntry form) (outer (vec (map inner form)))\n (seq? form) (outer (doall (map inner form)))\n (instance? clojure.lang.IRecord form)\n (outer (reduce (fn [r x] (conj r (inner x))) form form))\n (coll? form) (outer (into (empty form) (map inner form)))\n :else (outer form)))\n\n(defn postwalk\n \"Performs a depth-first, post-order traversal of form. Calls f on\n each sub-form, uses f's return value in place of the original.\n Recognizes all Clojure data structures. Consumes seqs as with doall.\"\n {:added \"1.1\"}\n [f form]\n (walk (partial postwalk f) f form))\n\n(defn prewalk\n \"Like postwalk, but does pre-order traversal.\"\n {:added \"1.1\"}\n [f form]\n (walk (partial prewalk f) identity (f form)))\n\n\n;; Note: I wanted to write:\n;;\n;; (defn walk\n;; [f form]\n;; (let [pf (partial walk f)]\n;; (if (coll? form)\n;; (f (into (empty form) (map pf form)))\n;; (f form))))\n;;\n;; but this throws a ClassCastException when applied to a map.\n\n\n(defn postwalk-demo\n \"Demonstrates the behavior of postwalk by printing each form as it is\n walked. Returns form.\"\n {:added \"1.1\"}\n [form]\n (postwalk (fn [x] (print \"Walked: \") (prn x) x) form))\n\n(defn prewalk-demo\n \"Demonstrates the behavior of prewalk by printing each form as it is\n walked. Returns form.\"\n {:added \"1.1\"}\n [form]\n (prewalk (fn [x] (print \"Walked: \") (prn x) x) form))\n\n(defn keywordize-keys\n \"Recursively transforms all map keys from strings to keywords.\"\n {:added \"1.1\"}\n [m]\n (let [f (fn [[k v]] (if (string? k) [(keyword k) v] [k v]))]\n ;; only apply to maps\n (postwalk (fn [x] (if (map? x) (into {} (map f x)) x)) m)))\n\n(defn stringify-keys\n \"Recursively transforms all map keys from keywords to strings.\"\n {:added \"1.1\"}\n [m]\n (let [f (fn [[k v]] (if (keyword? k) [(name k) v] [k v]))]\n ;; only apply to maps\n (postwalk (fn [x] (if (map? x) (into {} (map f x)) x)) m)))\n\n(defn prewalk-replace\n \"Recursively transforms form by replacing keys in smap with their\n values. Like clojure/replace but works on any data structure. Does\n replacement at the root of the tree first.\"\n {:added \"1.1\"}\n [smap form]\n (prewalk (fn [x] (if (contains? smap x) (smap x) x)) form))\n\n(defn postwalk-replace\n \"Recursively transforms form by replacing keys in smap with their\n values. Like clojure/replace but works on any data structure. Does\n replacement at the leaves of the tree first.\"\n {:added \"1.1\"}\n [smap form]\n (postwalk (fn [x] (if (contains? smap x) (smap x) x)) form))\n\n(defn macroexpand-all\n \"Recursively performs all possible macroexpansions in form.\"\n {:added \"1.1\"}\n [form]\n (prewalk (fn [x] (if (seq? x) (macroexpand x) x)) form))\n\n" }, { "path": "src/clj/clojure/xml.clj", "content": "; Copyright (c) Rich Hickey. All rights reserved.\n; The use and distribution terms for this software are covered by the\n; Eclipse Public License 1.0 (http://opensource.org/licenses/eclipse-1.0.php)\n; which can be found in the file epl-v10.html at the root of this distribution.\n; By using this software in any fashion, you are agreeing to be bound by\n; the terms of this license.\n; You must not remove this notice, or any other, from this software.\n\n(ns ^{:doc \"XML reading/writing.\"\n :author \"Rich Hickey\"}\n clojure.xml\n (:import (org.xml.sax ContentHandler Attributes SAXException)\n (javax.xml.parsers SAXParser SAXParserFactory)))\n\n(def ^:dynamic *stack*)\n(def ^:dynamic *current*)\n(def ^:dynamic *state*) ; :element :chars :between\n(def ^:dynamic *sb*)\n\n(defstruct element :tag :attrs :content)\n\n(def tag (accessor element :tag))\n(def attrs (accessor element :attrs))\n(def content (accessor element :content))\n\n(def content-handler\n (let [push-content (fn [e c]\n (assoc e :content (conj (or (:content e) []) c)))\n push-chars (fn []\n (when (and (= *state* :chars)\n (some (complement #(Character/isWhitespace (char %))) (str *sb*)))\n (set! *current* (push-content *current* (str *sb*)))))]\n (new clojure.lang.XMLHandler\n (proxy [ContentHandler] []\n (startElement [uri local-name q-name ^Attributes atts]\n (let [attrs (fn [ret i]\n (if (neg? i)\n ret\n (recur (assoc ret\n (clojure.lang.Keyword/intern (symbol (.getQName atts i)))\n (.getValue atts (int i)))\n (dec i))))\n e (struct element\n (. clojure.lang.Keyword (intern (symbol q-name)))\n (when (pos? (.getLength atts))\n (attrs {} (dec (.getLength atts)))))]\n (push-chars)\n (set! *stack* (conj *stack* *current*))\n (set! *current* e)\n (set! *state* :element))\n nil)\n (endElement [uri local-name q-name]\n (push-chars)\n (set! *current* (push-content (peek *stack*) *current*))\n (set! *stack* (pop *stack*))\n (set! *state* :between)\n nil)\n (characters [^chars ch start length]\n (when-not (= *state* :chars)\n (set! *sb* (new StringBuilder)))\n (let [^StringBuilder sb *sb*]\n (.append sb ch (int start) (int length))\n (set! *state* :chars))\n nil)\n (setDocumentLocator [locator])\n (startDocument [])\n (endDocument [])\n (startPrefixMapping [prefix uri])\n (endPrefixMapping [prefix])\n (ignorableWhitespace [ch start length])\n (processingInstruction [target data])\n (skippedEntity [name])\n ))))\n\n(defn startparse-sax [s ch]\n (.parse ^javax.xml.parsers.SAXParser\n (.. SAXParserFactory (newInstance) (newSAXParser)) s ch))\n\n(defn parse\n \"Parses and loads the source s, which can be a File, InputStream or\n String naming a URI. Returns a tree of the xml/element struct-map,\n which has the keys :tag, :attrs, and :content. and accessor fns tag,\n attrs, and content. Other parsers can be supplied by passing\n startparse, a fn taking a source and a ContentHandler and returning\n a parser\"\n {:added \"1.0\"}\n ([s] (parse s startparse-sax))\n ([s startparse]\n (binding [*stack* nil\n *current* (struct element)\n *state* :between\n *sb* nil]\n (startparse s content-handler)\n ((:content *current*) 0))))\n\n(defn emit-element [e]\n (if (instance? String e)\n (println e)\n (do\n (print (str \"<\" (name (:tag e))))\n (when (:attrs e)\n\t(doseq [attr (:attrs e)]\n\t (print (str \" \" (name (key attr)) \"='\" (val attr)\"'\"))))\n (if (:content e)\n\t(do\n\t (println \">\")\n\t (doseq [c (:content e)]\n\t (emit-element c))\n\t (println (str \"\")))\n\t(println \"/>\")))))\n\n(defn emit [x]\n (println \"\")\n (emit-element x))\n\n;(export '(tag attrs content parse element emit emit-element))\n\n;(load-file \"/Users/rich/dev/clojure/src/xml.clj\")\n;(def x (xml/parse \"http://arstechnica.com/journals.rssx\"))\n" }, { "path": "src/clj/clojure/zip.clj", "content": "; Copyright (c) Rich Hickey. All rights reserved.\n; The use and distribution terms for this software are covered by the\n; Eclipse Public License 1.0 (http://opensource.org/licenses/eclipse-1.0.php)\n; which can be found in the file epl-v10.html at the root of this distribution.\n; By using this software in any fashion, you are agreeing to be bound by\n; the terms of this license.\n; You must not remove this notice, or any other, from this software.\n\n;functional hierarchical zipper, with navigation, editing and enumeration\n;see Huet\n\n(ns ^{:doc \"Functional hierarchical zipper, with navigation, editing,\n and enumeration. See Huet\"\n :author \"Rich Hickey\"}\n clojure.zip\n (:refer-clojure :exclude (replace remove next)))\n\n(defn zipper\n \"Creates a new zipper structure. \n\n branch? is a fn that, given a node, returns true if can have\n children, even if it currently doesn't.\n\n children is a fn that, given a branch node, returns a seq of its\n children.\n\n make-node is a fn that, given an existing node and a seq of\n children, returns a new branch node with the supplied children.\n root is the root node.\"\n {:added \"1.0\"}\n [branch? children make-node root]\n ^{:zip/branch? branch? :zip/children children :zip/make-node make-node}\n [root nil])\n\n(defn seq-zip\n \"Returns a zipper for nested sequences, given a root sequence\"\n {:added \"1.0\"}\n [root]\n (zipper seq?\n identity\n (fn [node children] (with-meta children (meta node)))\n root))\n\n(defn vector-zip\n \"Returns a zipper for nested vectors, given a root vector\"\n {:added \"1.0\"}\n [root]\n (zipper vector?\n seq\n (fn [node children] (with-meta (vec children) (meta node)))\n root))\n\n(defn xml-zip\n \"Returns a zipper for xml elements (as from xml/parse),\n given a root element\"\n {:added \"1.0\"}\n [root]\n (zipper (complement string?) \n (comp seq :content)\n (fn [node children]\n (assoc node :content (and children (apply vector children))))\n root))\n\n(defn node\n \"Returns the node at loc\"\n {:added \"1.0\"}\n [loc] (loc 0))\n\n(defn branch?\n \"Returns true if the node at loc is a branch\"\n {:added \"1.0\"}\n [loc]\n ((:zip/branch? (meta loc)) (node loc)))\n\n(defn children\n \"Returns a seq of the children of node at loc, which must be a branch\"\n {:added \"1.0\"}\n [loc]\n (if (branch? loc)\n ((:zip/children (meta loc)) (node loc))\n (throw (Exception. \"called children on a leaf node\"))))\n\n(defn make-node\n \"Returns a new branch node, given an existing node and new\n children. The loc is only used to supply the constructor.\"\n {:added \"1.0\"}\n [loc node children]\n ((:zip/make-node (meta loc)) node children))\n\n(defn path\n \"Returns a seq of nodes leading to this loc\"\n {:added \"1.0\"}\n [loc]\n (:pnodes (loc 1)))\n\n(defn lefts\n \"Returns a seq of the left siblings of this loc\"\n {:added \"1.0\"}\n [loc]\n (seq (:l (loc 1))))\n\n(defn rights\n \"Returns a seq of the right siblings of this loc\"\n {:added \"1.0\"}\n [loc]\n (:r (loc 1)))\n\n\n(defn down\n \"Returns the loc of the leftmost child of the node at this loc, or\n nil if no children\"\n {:added \"1.0\"}\n [loc]\n (when (branch? loc)\n (let [[node path] loc\n [c & cnext :as cs] (children loc)]\n (when cs\n (with-meta [c {:l [] \n :pnodes (if path (conj (:pnodes path) node) [node]) \n :ppath path \n :r cnext}] (meta loc))))))\n\n(defn up\n \"Returns the loc of the parent of the node at this loc, or nil if at\n the top\"\n {:added \"1.0\"}\n [loc]\n (let [[node {l :l, ppath :ppath, pnodes :pnodes r :r, changed? :changed?, :as path}] loc]\n (when pnodes\n (let [pnode (peek pnodes)]\n (with-meta (if changed?\n [(make-node loc pnode (concat l (cons node r))) \n (and ppath (assoc ppath :changed? true))]\n [pnode ppath])\n (meta loc))))))\n\n(defn root\n \"zips all the way up and returns the root node, reflecting any\n changes.\"\n {:added \"1.0\"}\n [loc]\n (if (= :end (loc 1))\n (node loc)\n (let [p (up loc)]\n (if p\n (recur p)\n (node loc)))))\n\n(defn right\n \"Returns the loc of the right sibling of the node at this loc, or nil\"\n {:added \"1.0\"}\n [loc]\n (let [[node {l :l [r & rnext :as rs] :r :as path}] loc]\n (when (and path rs)\n (with-meta [r (assoc path :l (conj l node) :r rnext)] (meta loc)))))\n\n(defn rightmost\n \"Returns the loc of the rightmost sibling of the node at this loc, or self\"\n {:added \"1.0\"}\n [loc]\n (let [[node {l :l r :r :as path}] loc]\n (if (and path r)\n (with-meta [(last r) (assoc path :l (apply conj l node (butlast r)) :r nil)] (meta loc))\n loc)))\n\n(defn left\n \"Returns the loc of the left sibling of the node at this loc, or nil\"\n {:added \"1.0\"}\n [loc]\n (let [[node {l :l r :r :as path}] loc]\n (when (and path (seq l))\n (with-meta [(peek l) (assoc path :l (pop l) :r (cons node r))] (meta loc)))))\n\n(defn leftmost\n \"Returns the loc of the leftmost sibling of the node at this loc, or self\"\n {:added \"1.0\"}\n [loc]\n (let [[node {l :l r :r :as path}] loc]\n (if (and path (seq l))\n (with-meta [(first l) (assoc path :l [] :r (concat (rest l) [node] r))] (meta loc))\n loc)))\n\n(defn insert-left\n \"Inserts the item as the left sibling of the node at this loc,\n without moving\"\n {:added \"1.0\"}\n [loc item]\n (let [[node {l :l :as path}] loc]\n (if (nil? path)\n (throw (new Exception \"Insert at top\"))\n (with-meta [node (assoc path :l (conj l item) :changed? true)] (meta loc)))))\n\n(defn insert-right\n \"Inserts the item as the right sibling of the node at this loc,\n without moving\"\n {:added \"1.0\"}\n [loc item]\n (let [[node {r :r :as path}] loc]\n (if (nil? path)\n (throw (new Exception \"Insert at top\"))\n (with-meta [node (assoc path :r (cons item r) :changed? true)] (meta loc)))))\n\n(defn replace\n \"Replaces the node at this loc, without moving\"\n {:added \"1.0\"}\n [loc node]\n (let [[_ path] loc]\n (with-meta [node (assoc path :changed? true)] (meta loc))))\n\n(defn edit\n \"Replaces the node at this loc with the value of (f node args)\"\n {:added \"1.0\"}\n [loc f & args]\n (replace loc (apply f (node loc) args)))\n\n(defn insert-child\n \"Inserts the item as the leftmost child of the node at this loc,\n without moving\"\n {:added \"1.0\"}\n [loc item]\n (replace loc (make-node loc (node loc) (cons item (children loc)))))\n\n(defn append-child\n \"Inserts the item as the rightmost child of the node at this loc,\n without moving\"\n {:added \"1.0\"}\n [loc item]\n (replace loc (make-node loc (node loc) (concat (children loc) [item]))))\n\n(defn next\n \"Moves to the next loc in the hierarchy, depth-first. When reaching\n the end, returns a distinguished loc detectable via end?. If already\n at the end, stays there.\"\n {:added \"1.0\"}\n [loc]\n (if (= :end (loc 1))\n loc\n (or \n (and (branch? loc) (down loc))\n (right loc)\n (loop [p loc]\n (if (up p)\n (or (right (up p)) (recur (up p)))\n [(node p) :end])))))\n\n(defn prev\n \"Moves to the previous loc in the hierarchy, depth-first. If already\n at the root, returns nil.\"\n {:added \"1.0\"}\n [loc]\n (if-let [lloc (left loc)]\n (loop [loc lloc]\n (if-let [child (and (branch? loc) (down loc))]\n (recur (rightmost child))\n loc))\n (up loc)))\n\n(defn end?\n \"Returns true if loc represents the end of a depth-first walk\"\n {:added \"1.0\"}\n [loc]\n (= :end (loc 1)))\n\n(defn remove\n \"Removes the node at loc, returning the loc that would have preceded\n it in a depth-first walk.\"\n {:added \"1.0\"}\n [loc]\n (let [[node {l :l, ppath :ppath, pnodes :pnodes, rs :r, :as path}] loc]\n (if (nil? path)\n (throw (new Exception \"Remove at top\"))\n (if (pos? (count l))\n (loop [loc (with-meta [(peek l) (assoc path :l (pop l) :changed? true)] (meta loc))]\n (if-let [child (and (branch? loc) (down loc))]\n (recur (rightmost child))\n loc))\n (with-meta [(make-node loc (peek pnodes) rs) \n (and ppath (assoc ppath :changed? true))]\n (meta loc))))))\n \n(comment\n\n(load-file \"/Users/rich/dev/clojure/src/zip.clj\")\n(refer 'zip)\n(def data '[[a * b] + [c * d]])\n(def dz (vector-zip data))\n\n(right (down (right (right (down dz)))))\n(lefts (right (down (right (right (down dz))))))\n(rights (right (down (right (right (down dz))))))\n(up (up (right (down (right (right (down dz)))))))\n(path (right (down (right (right (down dz))))))\n\n(-> dz down right right down right)\n(-> dz down right right down right (replace '/) root)\n(-> dz next next (edit str) next next next (replace '/) root)\n(-> dz next next next next next next next next next remove root)\n(-> dz next next next next next next next next next remove (insert-right 'e) root)\n(-> dz next next next next next next next next next remove up (append-child 'e) root)\n\n(end? (-> dz next next next next next next next next next remove next))\n\n(-> dz next remove next remove root)\n\n(loop [loc dz]\n (if (end? loc)\n (root loc)\n (recur (next (if (= '* (node loc)) \n (replace loc '/)\n loc)))))\n\n(loop [loc dz]\n (if (end? loc)\n (root loc)\n (recur (next (if (= '* (node loc)) \n (remove loc)\n loc)))))\n)\n" }, { "path": "src/ffi/ffi.h", "content": "#ifdef __arm64__\n\n#include \"ffi_arm64.h\"\n\n\n#endif\n#ifdef __i386__\n\n#include \"ffi_i386.h\"\n\n\n#endif\n#ifdef __arm__\n\n#include \"ffi_armv7.h\"\n\n\n#endif\n#ifdef __x86_64__\n\n#include \"ffi_x86_64.h\"\n\n\n#endif\n" }, { "path": "src/ffi/ffi_arm64.h", "content": "#ifdef __arm64__\n\n/* -----------------------------------------------------------------*-C-*-\n libffi 3.1-rc1 - Copyright (c) 2011 Anthony Green\n - Copyright (c) 1996-2003, 2007, 2008 Red Hat, Inc.\n\n Permission is hereby granted, free of charge, to any person\n obtaining a copy of this software and associated documentation\n files (the ``Software''), to deal in the Software without\n restriction, including without limitation the rights to use, copy,\n modify, merge, publish, distribute, sublicense, and/or sell copies\n of the Software, and to permit persons to whom the Software is\n furnished to do so, subject to the following conditions:\n\n The above copyright notice and this permission notice shall be\n included in all copies or substantial portions of the Software.\n\n THE SOFTWARE IS PROVIDED ``AS IS'', WITHOUT WARRANTY OF ANY KIND,\n EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\n MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND\n NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT\n HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,\n WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER\n DEALINGS IN THE SOFTWARE.\n\n ----------------------------------------------------------------------- */\n\n/* -------------------------------------------------------------------\n The basic API is described in the README file.\n\n The raw API is designed to bypass some of the argument packing\n and unpacking on architectures for which it can be avoided.\n\n The closure API allows interpreted functions to be packaged up\n inside a C function pointer, so that they can be called as C functions,\n with no understanding on the client side that they are interpreted.\n It can also be used in other cases in which it is necessary to package\n up a user specified parameter and a function pointer as a single\n function pointer.\n\n The closure API must be implemented in order to get its functionality,\n e.g. for use by gij. Routines are provided to emulate the raw API\n if the underlying platform doesn't allow faster implementation.\n\n More details on the raw and cloure API can be found in:\n\n http://gcc.gnu.org/ml/java/1999-q3/msg00138.html\n\n and\n\n http://gcc.gnu.org/ml/java/1999-q3/msg00174.html\n -------------------------------------------------------------------- */\n\n#ifndef LIBFFI_H\n#define LIBFFI_H\n\n#ifdef __cplusplus\nextern \"C\" {\n#endif\n\n/* Specify which architecture libffi is configured for. */\n#ifndef AARCH64\n#define AARCH64\n#endif\n\n/* ---- System configuration information --------------------------------- */\n\n#include \"ffitarget.h\"\n\n#ifndef LIBFFI_ASM\n\n#ifdef _MSC_VER\n#define __attribute__(X)\n#endif\n\n#include \n#include \n\n/* LONG_LONG_MAX is not always defined (not if STRICT_ANSI, for example).\n But we can find it either under the correct ANSI name, or under GNU\n C's internal name. */\n\n#define FFI_64_BIT_MAX 9223372036854775807\n\n#ifdef LONG_LONG_MAX\n# define FFI_LONG_LONG_MAX LONG_LONG_MAX\n#else\n# ifdef LLONG_MAX\n# define FFI_LONG_LONG_MAX LLONG_MAX\n# ifdef _AIX52 /* or newer has C99 LLONG_MAX */\n# undef FFI_64_BIT_MAX\n# define FFI_64_BIT_MAX 9223372036854775807LL\n# endif /* _AIX52 or newer */\n# else\n# ifdef __GNUC__\n# define FFI_LONG_LONG_MAX __LONG_LONG_MAX__\n# endif\n# ifdef _AIX /* AIX 5.1 and earlier have LONGLONG_MAX */\n# ifndef __PPC64__\n# if defined (__IBMC__) || defined (__IBMCPP__)\n# define FFI_LONG_LONG_MAX LONGLONG_MAX\n# endif\n# endif /* __PPC64__ */\n# undef FFI_64_BIT_MAX\n# define FFI_64_BIT_MAX 9223372036854775807LL\n# endif\n# endif\n#endif\n\n/* The closure code assumes that this works on pointers, i.e. a size_t\t*/\n/* can hold a pointer.\t\t\t\t\t\t\t*/\n\ntypedef struct _ffi_type\n{\n size_t size;\n unsigned short alignment;\n unsigned short type;\n struct _ffi_type **elements;\n} ffi_type;\n\n#ifndef LIBFFI_HIDE_BASIC_TYPES\n#if SCHAR_MAX == 127\n# define ffi_type_uchar ffi_type_uint8\n# define ffi_type_schar ffi_type_sint8\n#else\n #error \"char size not supported\"\n#endif\n\n#if SHRT_MAX == 32767\n# define ffi_type_ushort ffi_type_uint16\n# define ffi_type_sshort ffi_type_sint16\n#elif SHRT_MAX == 2147483647\n# define ffi_type_ushort ffi_type_uint32\n# define ffi_type_sshort ffi_type_sint32\n#else\n #error \"short size not supported\"\n#endif\n\n#if INT_MAX == 32767\n# define ffi_type_uint ffi_type_uint16\n# define ffi_type_sint ffi_type_sint16\n#elif INT_MAX == 2147483647\n# define ffi_type_uint ffi_type_uint32\n# define ffi_type_sint ffi_type_sint32\n#elif INT_MAX == 9223372036854775807\n# define ffi_type_uint ffi_type_uint64\n# define ffi_type_sint ffi_type_sint64\n#else\n #error \"int size not supported\"\n#endif\n\n#if LONG_MAX == 2147483647\n# if FFI_LONG_LONG_MAX != FFI_64_BIT_MAX\n #error \"no 64-bit data type supported\"\n# endif\n#elif LONG_MAX != FFI_64_BIT_MAX\n #error \"long size not supported\"\n#endif\n\n#if LONG_MAX == 2147483647\n# define ffi_type_ulong ffi_type_uint32\n# define ffi_type_slong ffi_type_sint32\n#elif LONG_MAX == FFI_64_BIT_MAX\n# define ffi_type_ulong ffi_type_uint64\n# define ffi_type_slong ffi_type_sint64\n#else\n #error \"long size not supported\"\n#endif\n\n/* Need minimal decorations for DLLs to works on Windows. */\n/* GCC has autoimport and autoexport. Rely on Libtool to */\n/* help MSVC export from a DLL, but always declare data */\n/* to be imported for MSVC clients. This costs an extra */\n/* indirection for MSVC clients using the static version */\n/* of the library, but don't worry about that. Besides, */\n/* as a workaround, they can define FFI_BUILDING if they */\n/* *know* they are going to link with the static library. */\n#if defined _MSC_VER && !defined FFI_BUILDING\n#define FFI_EXTERN extern __declspec(dllimport)\n#else\n#define FFI_EXTERN extern\n#endif\n\n/* These are defined in types.c */\nFFI_EXTERN ffi_type ffi_type_void;\nFFI_EXTERN ffi_type ffi_type_uint8;\nFFI_EXTERN ffi_type ffi_type_sint8;\nFFI_EXTERN ffi_type ffi_type_uint16;\nFFI_EXTERN ffi_type ffi_type_sint16;\nFFI_EXTERN ffi_type ffi_type_uint32;\nFFI_EXTERN ffi_type ffi_type_sint32;\nFFI_EXTERN ffi_type ffi_type_uint64;\nFFI_EXTERN ffi_type ffi_type_sint64;\nFFI_EXTERN ffi_type ffi_type_float;\nFFI_EXTERN ffi_type ffi_type_double;\nFFI_EXTERN ffi_type ffi_type_pointer;\n\n#if 0\nFFI_EXTERN ffi_type ffi_type_longdouble;\n#else\n#define ffi_type_longdouble ffi_type_double\n#endif\n#endif /* LIBFFI_HIDE_BASIC_TYPES */\n\ntypedef enum {\n FFI_OK = 0,\n FFI_BAD_TYPEDEF,\n FFI_BAD_ABI\n} ffi_status;\n\ntypedef unsigned FFI_TYPE;\n\ntypedef struct {\n ffi_abi abi;\n unsigned nargs;\n ffi_type **arg_types;\n ffi_type *rtype;\n unsigned bytes;\n unsigned flags;\n#ifdef FFI_EXTRA_CIF_FIELDS\n FFI_EXTRA_CIF_FIELDS;\n#endif\n} ffi_cif;\n\n#if HAVE_LONG_DOUBLE_VARIANT\n/* Used to adjust size/alignment of ffi types. */\nvoid ffi_prep_types (ffi_abi abi);\n# endif\n\n/* Used internally, but overridden by some architectures */\nffi_status ffi_prep_cif_core(ffi_cif *cif,\n\t\t\t ffi_abi abi,\n\t\t\t unsigned int isvariadic,\n\t\t\t unsigned int nfixedargs,\n\t\t\t unsigned int ntotalargs,\n\t\t\t ffi_type *rtype,\n\t\t\t ffi_type **atypes);\n\n/* ---- Definitions for the raw API -------------------------------------- */\n\n#ifndef FFI_SIZEOF_ARG\n# if LONG_MAX == 2147483647\n# define FFI_SIZEOF_ARG 4\n# elif LONG_MAX == FFI_64_BIT_MAX\n# define FFI_SIZEOF_ARG 8\n# endif\n#endif\n\n#ifndef FFI_SIZEOF_JAVA_RAW\n# define FFI_SIZEOF_JAVA_RAW FFI_SIZEOF_ARG\n#endif\n\ntypedef union {\n ffi_sarg sint;\n ffi_arg uint;\n float\t flt;\n char data[FFI_SIZEOF_ARG];\n void* ptr;\n} ffi_raw;\n\n#if FFI_SIZEOF_JAVA_RAW == 4 && FFI_SIZEOF_ARG == 8\n/* This is a special case for mips64/n32 ABI (and perhaps others) where\n sizeof(void *) is 4 and FFI_SIZEOF_ARG is 8. */\ntypedef union {\n signed int\tsint;\n unsigned int\tuint;\n float\t\tflt;\n char\t\tdata[FFI_SIZEOF_JAVA_RAW];\n void*\t\tptr;\n} ffi_java_raw;\n#else\ntypedef ffi_raw ffi_java_raw;\n#endif\n\n\nvoid ffi_raw_call (ffi_cif *cif,\n\t\t void (*fn)(void),\n\t\t void *rvalue,\n\t\t ffi_raw *avalue);\n\nvoid ffi_ptrarray_to_raw (ffi_cif *cif, void **args, ffi_raw *raw);\nvoid ffi_raw_to_ptrarray (ffi_cif *cif, ffi_raw *raw, void **args);\nsize_t ffi_raw_size (ffi_cif *cif);\n\n/* This is analogous to the raw API, except it uses Java parameter\t*/\n/* packing, even on 64-bit machines. I.e. on 64-bit machines\t\t*/\n/* longs and doubles are followed by an empty 64-bit word.\t\t*/\n\nvoid ffi_java_raw_call (ffi_cif *cif,\n\t\t\tvoid (*fn)(void),\n\t\t\tvoid *rvalue,\n\t\t\tffi_java_raw *avalue);\n\nvoid ffi_java_ptrarray_to_raw (ffi_cif *cif, void **args, ffi_java_raw *raw);\nvoid ffi_java_raw_to_ptrarray (ffi_cif *cif, ffi_java_raw *raw, void **args);\nsize_t ffi_java_raw_size (ffi_cif *cif);\n\n/* ---- Definitions for closures ----------------------------------------- */\n\n#if FFI_CLOSURES\n\n#ifdef _MSC_VER\n__declspec(align(8))\n#endif\ntypedef struct {\n#if 0\n void *trampoline_table;\n void *trampoline_table_entry;\n#else\n char tramp[FFI_TRAMPOLINE_SIZE];\n#endif\n ffi_cif *cif;\n void (*fun)(ffi_cif*,void*,void**,void*);\n void *user_data;\n#ifdef __GNUC__\n} ffi_closure __attribute__((aligned (8)));\n#else\n} ffi_closure;\n# ifdef __sgi\n# pragma pack 0\n# endif\n#endif\n\nvoid *ffi_closure_alloc (size_t size, void **code);\nvoid ffi_closure_free (void *);\n\nffi_status\nffi_prep_closure (ffi_closure*,\n\t\t ffi_cif *,\n\t\t void (*fun)(ffi_cif*,void*,void**,void*),\n\t\t void *user_data);\n\nffi_status\nffi_prep_closure_loc (ffi_closure*,\n\t\t ffi_cif *,\n\t\t void (*fun)(ffi_cif*,void*,void**,void*),\n\t\t void *user_data,\n\t\t void*codeloc);\n\n#ifdef __sgi\n# pragma pack 8\n#endif\ntypedef struct {\n#if 0\n void *trampoline_table;\n void *trampoline_table_entry;\n#else\n char tramp[FFI_TRAMPOLINE_SIZE];\n#endif\n ffi_cif *cif;\n\n#if !FFI_NATIVE_RAW_API\n\n /* if this is enabled, then a raw closure has the same layout \n as a regular closure. We use this to install an intermediate \n handler to do the transaltion, void** -> ffi_raw*. */\n\n void (*translate_args)(ffi_cif*,void*,void**,void*);\n void *this_closure;\n\n#endif\n\n void (*fun)(ffi_cif*,void*,ffi_raw*,void*);\n void *user_data;\n\n} ffi_raw_closure;\n\ntypedef struct {\n#if 0\n void *trampoline_table;\n void *trampoline_table_entry;\n#else\n char tramp[FFI_TRAMPOLINE_SIZE];\n#endif\n\n ffi_cif *cif;\n\n#if !FFI_NATIVE_RAW_API\n\n /* if this is enabled, then a raw closure has the same layout \n as a regular closure. We use this to install an intermediate \n handler to do the transaltion, void** -> ffi_raw*. */\n\n void (*translate_args)(ffi_cif*,void*,void**,void*);\n void *this_closure;\n\n#endif\n\n void (*fun)(ffi_cif*,void*,ffi_java_raw*,void*);\n void *user_data;\n\n} ffi_java_raw_closure;\n\nffi_status\nffi_prep_raw_closure (ffi_raw_closure*,\n\t\t ffi_cif *cif,\n\t\t void (*fun)(ffi_cif*,void*,ffi_raw*,void*),\n\t\t void *user_data);\n\nffi_status\nffi_prep_raw_closure_loc (ffi_raw_closure*,\n\t\t\t ffi_cif *cif,\n\t\t\t void (*fun)(ffi_cif*,void*,ffi_raw*,void*),\n\t\t\t void *user_data,\n\t\t\t void *codeloc);\n\nffi_status\nffi_prep_java_raw_closure (ffi_java_raw_closure*,\n\t\t ffi_cif *cif,\n\t\t void (*fun)(ffi_cif*,void*,ffi_java_raw*,void*),\n\t\t void *user_data);\n\nffi_status\nffi_prep_java_raw_closure_loc (ffi_java_raw_closure*,\n\t\t\t ffi_cif *cif,\n\t\t\t void (*fun)(ffi_cif*,void*,ffi_java_raw*,void*),\n\t\t\t void *user_data,\n\t\t\t void *codeloc);\n\n#endif /* FFI_CLOSURES */\n\n/* ---- Public interface definition -------------------------------------- */\n\nffi_status ffi_prep_cif(ffi_cif *cif,\n\t\t\tffi_abi abi,\n\t\t\tunsigned int nargs,\n\t\t\tffi_type *rtype,\n\t\t\tffi_type **atypes);\n\nffi_status ffi_prep_cif_var(ffi_cif *cif,\n\t\t\t ffi_abi abi,\n\t\t\t unsigned int nfixedargs,\n\t\t\t unsigned int ntotalargs,\n\t\t\t ffi_type *rtype,\n\t\t\t ffi_type **atypes);\n\nvoid ffi_call(ffi_cif *cif,\n\t void (*fn)(void),\n\t void *rvalue,\n\t void **avalue);\n\n/* Useful for eliminating compiler warnings */\n#define FFI_FN(f) ((void (*)(void))f)\n\n/* ---- Definitions shared with assembly code ---------------------------- */\n\n#endif\n\n/* If these change, update src/mips/ffitarget.h. */\n#define FFI_TYPE_VOID 0 \n#define FFI_TYPE_INT 1\n#define FFI_TYPE_FLOAT 2 \n#define FFI_TYPE_DOUBLE 3\n#if 0\n#define FFI_TYPE_LONGDOUBLE 4\n#else\n#define FFI_TYPE_LONGDOUBLE FFI_TYPE_DOUBLE\n#endif\n#define FFI_TYPE_UINT8 5 \n#define FFI_TYPE_SINT8 6\n#define FFI_TYPE_UINT16 7 \n#define FFI_TYPE_SINT16 8\n#define FFI_TYPE_UINT32 9\n#define FFI_TYPE_SINT32 10\n#define FFI_TYPE_UINT64 11\n#define FFI_TYPE_SINT64 12\n#define FFI_TYPE_STRUCT 13\n#define FFI_TYPE_POINTER 14\n\n/* This should always refer to the last type code (for sanity checks) */\n#define FFI_TYPE_LAST FFI_TYPE_POINTER\n\n#ifdef __cplusplus\n}\n#endif\n\n#endif\n\n\n#endif" }, { "path": "src/ffi/ffi_armv7.h", "content": "#ifdef __arm__\n\n/* -----------------------------------------------------------------*-C-*-\n libffi 3.1-rc1 - Copyright (c) 2011 Anthony Green\n - Copyright (c) 1996-2003, 2007, 2008 Red Hat, Inc.\n\n Permission is hereby granted, free of charge, to any person\n obtaining a copy of this software and associated documentation\n files (the ``Software''), to deal in the Software without\n restriction, including without limitation the rights to use, copy,\n modify, merge, publish, distribute, sublicense, and/or sell copies\n of the Software, and to permit persons to whom the Software is\n furnished to do so, subject to the following conditions:\n\n The above copyright notice and this permission notice shall be\n included in all copies or substantial portions of the Software.\n\n THE SOFTWARE IS PROVIDED ``AS IS'', WITHOUT WARRANTY OF ANY KIND,\n EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\n MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND\n NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT\n HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,\n WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER\n DEALINGS IN THE SOFTWARE.\n\n ----------------------------------------------------------------------- */\n\n/* -------------------------------------------------------------------\n The basic API is described in the README file.\n\n The raw API is designed to bypass some of the argument packing\n and unpacking on architectures for which it can be avoided.\n\n The closure API allows interpreted functions to be packaged up\n inside a C function pointer, so that they can be called as C functions,\n with no understanding on the client side that they are interpreted.\n It can also be used in other cases in which it is necessary to package\n up a user specified parameter and a function pointer as a single\n function pointer.\n\n The closure API must be implemented in order to get its functionality,\n e.g. for use by gij. Routines are provided to emulate the raw API\n if the underlying platform doesn't allow faster implementation.\n\n More details on the raw and cloure API can be found in:\n\n http://gcc.gnu.org/ml/java/1999-q3/msg00138.html\n\n and\n\n http://gcc.gnu.org/ml/java/1999-q3/msg00174.html\n -------------------------------------------------------------------- */\n\n#ifndef LIBFFI_H\n#define LIBFFI_H\n\n#ifdef __cplusplus\nextern \"C\" {\n#endif\n\n/* Specify which architecture libffi is configured for. */\n#ifndef ARM\n#define ARM\n#endif\n\n/* ---- System configuration information --------------------------------- */\n\n#include \"ffitarget.h\"\n\n#ifndef LIBFFI_ASM\n\n#ifdef _MSC_VER\n#define __attribute__(X)\n#endif\n\n#include \n#include \n\n/* LONG_LONG_MAX is not always defined (not if STRICT_ANSI, for example).\n But we can find it either under the correct ANSI name, or under GNU\n C's internal name. */\n\n#define FFI_64_BIT_MAX 9223372036854775807\n\n#ifdef LONG_LONG_MAX\n# define FFI_LONG_LONG_MAX LONG_LONG_MAX\n#else\n# ifdef LLONG_MAX\n# define FFI_LONG_LONG_MAX LLONG_MAX\n# ifdef _AIX52 /* or newer has C99 LLONG_MAX */\n# undef FFI_64_BIT_MAX\n# define FFI_64_BIT_MAX 9223372036854775807LL\n# endif /* _AIX52 or newer */\n# else\n# ifdef __GNUC__\n# define FFI_LONG_LONG_MAX __LONG_LONG_MAX__\n# endif\n# ifdef _AIX /* AIX 5.1 and earlier have LONGLONG_MAX */\n# ifndef __PPC64__\n# if defined (__IBMC__) || defined (__IBMCPP__)\n# define FFI_LONG_LONG_MAX LONGLONG_MAX\n# endif\n# endif /* __PPC64__ */\n# undef FFI_64_BIT_MAX\n# define FFI_64_BIT_MAX 9223372036854775807LL\n# endif\n# endif\n#endif\n\n/* The closure code assumes that this works on pointers, i.e. a size_t\t*/\n/* can hold a pointer.\t\t\t\t\t\t\t*/\n\ntypedef struct _ffi_type\n{\n size_t size;\n unsigned short alignment;\n unsigned short type;\n struct _ffi_type **elements;\n} ffi_type;\n\n#ifndef LIBFFI_HIDE_BASIC_TYPES\n#if SCHAR_MAX == 127\n# define ffi_type_uchar ffi_type_uint8\n# define ffi_type_schar ffi_type_sint8\n#else\n #error \"char size not supported\"\n#endif\n\n#if SHRT_MAX == 32767\n# define ffi_type_ushort ffi_type_uint16\n# define ffi_type_sshort ffi_type_sint16\n#elif SHRT_MAX == 2147483647\n# define ffi_type_ushort ffi_type_uint32\n# define ffi_type_sshort ffi_type_sint32\n#else\n #error \"short size not supported\"\n#endif\n\n#if INT_MAX == 32767\n# define ffi_type_uint ffi_type_uint16\n# define ffi_type_sint ffi_type_sint16\n#elif INT_MAX == 2147483647\n# define ffi_type_uint ffi_type_uint32\n# define ffi_type_sint ffi_type_sint32\n#elif INT_MAX == 9223372036854775807\n# define ffi_type_uint ffi_type_uint64\n# define ffi_type_sint ffi_type_sint64\n#else\n #error \"int size not supported\"\n#endif\n\n#if LONG_MAX == 2147483647\n# if FFI_LONG_LONG_MAX != FFI_64_BIT_MAX\n #error \"no 64-bit data type supported\"\n# endif\n#elif LONG_MAX != FFI_64_BIT_MAX\n #error \"long size not supported\"\n#endif\n\n#if LONG_MAX == 2147483647\n# define ffi_type_ulong ffi_type_uint32\n# define ffi_type_slong ffi_type_sint32\n#elif LONG_MAX == FFI_64_BIT_MAX\n# define ffi_type_ulong ffi_type_uint64\n# define ffi_type_slong ffi_type_sint64\n#else\n #error \"long size not supported\"\n#endif\n\n/* Need minimal decorations for DLLs to works on Windows. */\n/* GCC has autoimport and autoexport. Rely on Libtool to */\n/* help MSVC export from a DLL, but always declare data */\n/* to be imported for MSVC clients. This costs an extra */\n/* indirection for MSVC clients using the static version */\n/* of the library, but don't worry about that. Besides, */\n/* as a workaround, they can define FFI_BUILDING if they */\n/* *know* they are going to link with the static library. */\n#if defined _MSC_VER && !defined FFI_BUILDING\n#define FFI_EXTERN extern __declspec(dllimport)\n#else\n#define FFI_EXTERN extern\n#endif\n\n/* These are defined in types.c */\nFFI_EXTERN ffi_type ffi_type_void;\nFFI_EXTERN ffi_type ffi_type_uint8;\nFFI_EXTERN ffi_type ffi_type_sint8;\nFFI_EXTERN ffi_type ffi_type_uint16;\nFFI_EXTERN ffi_type ffi_type_sint16;\nFFI_EXTERN ffi_type ffi_type_uint32;\nFFI_EXTERN ffi_type ffi_type_sint32;\nFFI_EXTERN ffi_type ffi_type_uint64;\nFFI_EXTERN ffi_type ffi_type_sint64;\nFFI_EXTERN ffi_type ffi_type_float;\nFFI_EXTERN ffi_type ffi_type_double;\nFFI_EXTERN ffi_type ffi_type_pointer;\n\n#if 0\nFFI_EXTERN ffi_type ffi_type_longdouble;\n#else\n#define ffi_type_longdouble ffi_type_double\n#endif\n#endif /* LIBFFI_HIDE_BASIC_TYPES */\n\ntypedef enum {\n FFI_OK = 0,\n FFI_BAD_TYPEDEF,\n FFI_BAD_ABI\n} ffi_status;\n\ntypedef unsigned FFI_TYPE;\n\ntypedef struct {\n ffi_abi abi;\n unsigned nargs;\n ffi_type **arg_types;\n ffi_type *rtype;\n unsigned bytes;\n unsigned flags;\n#ifdef FFI_EXTRA_CIF_FIELDS\n FFI_EXTRA_CIF_FIELDS;\n#endif\n} ffi_cif;\n\n#if HAVE_LONG_DOUBLE_VARIANT\n/* Used to adjust size/alignment of ffi types. */\nvoid ffi_prep_types (ffi_abi abi);\n# endif\n\n/* Used internally, but overridden by some architectures */\nffi_status ffi_prep_cif_core(ffi_cif *cif,\n\t\t\t ffi_abi abi,\n\t\t\t unsigned int isvariadic,\n\t\t\t unsigned int nfixedargs,\n\t\t\t unsigned int ntotalargs,\n\t\t\t ffi_type *rtype,\n\t\t\t ffi_type **atypes);\n\n/* ---- Definitions for the raw API -------------------------------------- */\n\n#ifndef FFI_SIZEOF_ARG\n# if LONG_MAX == 2147483647\n# define FFI_SIZEOF_ARG 4\n# elif LONG_MAX == FFI_64_BIT_MAX\n# define FFI_SIZEOF_ARG 8\n# endif\n#endif\n\n#ifndef FFI_SIZEOF_JAVA_RAW\n# define FFI_SIZEOF_JAVA_RAW FFI_SIZEOF_ARG\n#endif\n\ntypedef union {\n ffi_sarg sint;\n ffi_arg uint;\n float\t flt;\n char data[FFI_SIZEOF_ARG];\n void* ptr;\n} ffi_raw;\n\n#if FFI_SIZEOF_JAVA_RAW == 4 && FFI_SIZEOF_ARG == 8\n/* This is a special case for mips64/n32 ABI (and perhaps others) where\n sizeof(void *) is 4 and FFI_SIZEOF_ARG is 8. */\ntypedef union {\n signed int\tsint;\n unsigned int\tuint;\n float\t\tflt;\n char\t\tdata[FFI_SIZEOF_JAVA_RAW];\n void*\t\tptr;\n} ffi_java_raw;\n#else\ntypedef ffi_raw ffi_java_raw;\n#endif\n\n\nvoid ffi_raw_call (ffi_cif *cif,\n\t\t void (*fn)(void),\n\t\t void *rvalue,\n\t\t ffi_raw *avalue);\n\nvoid ffi_ptrarray_to_raw (ffi_cif *cif, void **args, ffi_raw *raw);\nvoid ffi_raw_to_ptrarray (ffi_cif *cif, ffi_raw *raw, void **args);\nsize_t ffi_raw_size (ffi_cif *cif);\n\n/* This is analogous to the raw API, except it uses Java parameter\t*/\n/* packing, even on 64-bit machines. I.e. on 64-bit machines\t\t*/\n/* longs and doubles are followed by an empty 64-bit word.\t\t*/\n\nvoid ffi_java_raw_call (ffi_cif *cif,\n\t\t\tvoid (*fn)(void),\n\t\t\tvoid *rvalue,\n\t\t\tffi_java_raw *avalue);\n\nvoid ffi_java_ptrarray_to_raw (ffi_cif *cif, void **args, ffi_java_raw *raw);\nvoid ffi_java_raw_to_ptrarray (ffi_cif *cif, ffi_java_raw *raw, void **args);\nsize_t ffi_java_raw_size (ffi_cif *cif);\n\n/* ---- Definitions for closures ----------------------------------------- */\n\n#if FFI_CLOSURES\n\n#ifdef _MSC_VER\n__declspec(align(8))\n#endif\ntypedef struct {\n#if 1\n void *trampoline_table;\n void *trampoline_table_entry;\n#else\n char tramp[FFI_TRAMPOLINE_SIZE];\n#endif\n ffi_cif *cif;\n void (*fun)(ffi_cif*,void*,void**,void*);\n void *user_data;\n#ifdef __GNUC__\n} ffi_closure __attribute__((aligned (8)));\n#else\n} ffi_closure;\n# ifdef __sgi\n# pragma pack 0\n# endif\n#endif\n\nvoid *ffi_closure_alloc (size_t size, void **code);\nvoid ffi_closure_free (void *);\n\nffi_status\nffi_prep_closure (ffi_closure*,\n\t\t ffi_cif *,\n\t\t void (*fun)(ffi_cif*,void*,void**,void*),\n\t\t void *user_data);\n\nffi_status\nffi_prep_closure_loc (ffi_closure*,\n\t\t ffi_cif *,\n\t\t void (*fun)(ffi_cif*,void*,void**,void*),\n\t\t void *user_data,\n\t\t void*codeloc);\n\n#ifdef __sgi\n# pragma pack 8\n#endif\ntypedef struct {\n#if 1\n void *trampoline_table;\n void *trampoline_table_entry;\n#else\n char tramp[FFI_TRAMPOLINE_SIZE];\n#endif\n ffi_cif *cif;\n\n#if !FFI_NATIVE_RAW_API\n\n /* if this is enabled, then a raw closure has the same layout \n as a regular closure. We use this to install an intermediate \n handler to do the transaltion, void** -> ffi_raw*. */\n\n void (*translate_args)(ffi_cif*,void*,void**,void*);\n void *this_closure;\n\n#endif\n\n void (*fun)(ffi_cif*,void*,ffi_raw*,void*);\n void *user_data;\n\n} ffi_raw_closure;\n\ntypedef struct {\n#if 1\n void *trampoline_table;\n void *trampoline_table_entry;\n#else\n char tramp[FFI_TRAMPOLINE_SIZE];\n#endif\n\n ffi_cif *cif;\n\n#if !FFI_NATIVE_RAW_API\n\n /* if this is enabled, then a raw closure has the same layout \n as a regular closure. We use this to install an intermediate \n handler to do the transaltion, void** -> ffi_raw*. */\n\n void (*translate_args)(ffi_cif*,void*,void**,void*);\n void *this_closure;\n\n#endif\n\n void (*fun)(ffi_cif*,void*,ffi_java_raw*,void*);\n void *user_data;\n\n} ffi_java_raw_closure;\n\nffi_status\nffi_prep_raw_closure (ffi_raw_closure*,\n\t\t ffi_cif *cif,\n\t\t void (*fun)(ffi_cif*,void*,ffi_raw*,void*),\n\t\t void *user_data);\n\nffi_status\nffi_prep_raw_closure_loc (ffi_raw_closure*,\n\t\t\t ffi_cif *cif,\n\t\t\t void (*fun)(ffi_cif*,void*,ffi_raw*,void*),\n\t\t\t void *user_data,\n\t\t\t void *codeloc);\n\nffi_status\nffi_prep_java_raw_closure (ffi_java_raw_closure*,\n\t\t ffi_cif *cif,\n\t\t void (*fun)(ffi_cif*,void*,ffi_java_raw*,void*),\n\t\t void *user_data);\n\nffi_status\nffi_prep_java_raw_closure_loc (ffi_java_raw_closure*,\n\t\t\t ffi_cif *cif,\n\t\t\t void (*fun)(ffi_cif*,void*,ffi_java_raw*,void*),\n\t\t\t void *user_data,\n\t\t\t void *codeloc);\n\n#endif /* FFI_CLOSURES */\n\n/* ---- Public interface definition -------------------------------------- */\n\nffi_status ffi_prep_cif(ffi_cif *cif,\n\t\t\tffi_abi abi,\n\t\t\tunsigned int nargs,\n\t\t\tffi_type *rtype,\n\t\t\tffi_type **atypes);\n\nffi_status ffi_prep_cif_var(ffi_cif *cif,\n\t\t\t ffi_abi abi,\n\t\t\t unsigned int nfixedargs,\n\t\t\t unsigned int ntotalargs,\n\t\t\t ffi_type *rtype,\n\t\t\t ffi_type **atypes);\n\nvoid ffi_call(ffi_cif *cif,\n\t void (*fn)(void),\n\t void *rvalue,\n\t void **avalue);\n\n/* Useful for eliminating compiler warnings */\n#define FFI_FN(f) ((void (*)(void))f)\n\n/* ---- Definitions shared with assembly code ---------------------------- */\n\n#endif\n\n/* If these change, update src/mips/ffitarget.h. */\n#define FFI_TYPE_VOID 0 \n#define FFI_TYPE_INT 1\n#define FFI_TYPE_FLOAT 2 \n#define FFI_TYPE_DOUBLE 3\n#if 0\n#define FFI_TYPE_LONGDOUBLE 4\n#else\n#define FFI_TYPE_LONGDOUBLE FFI_TYPE_DOUBLE\n#endif\n#define FFI_TYPE_UINT8 5 \n#define FFI_TYPE_SINT8 6\n#define FFI_TYPE_UINT16 7 \n#define FFI_TYPE_SINT16 8\n#define FFI_TYPE_UINT32 9\n#define FFI_TYPE_SINT32 10\n#define FFI_TYPE_UINT64 11\n#define FFI_TYPE_SINT64 12\n#define FFI_TYPE_STRUCT 13\n#define FFI_TYPE_POINTER 14\n\n/* This should always refer to the last type code (for sanity checks) */\n#define FFI_TYPE_LAST FFI_TYPE_POINTER\n\n#ifdef __cplusplus\n}\n#endif\n\n#endif\n\n\n#endif" }, { "path": "src/ffi/ffi_common.h", "content": "/* -----------------------------------------------------------------------\n ffi_common.h - Copyright (C) 2011, 2012, 2013 Anthony Green\n Copyright (C) 2007 Free Software Foundation, Inc\n Copyright (c) 1996 Red Hat, Inc.\n \n Common internal definitions and macros. Only necessary for building\n libffi.\n ----------------------------------------------------------------------- */\n\n#ifndef FFI_COMMON_H\n#define FFI_COMMON_H\n\n#ifdef __cplusplus\nextern \"C\" {\n#endif\n\n#include \n\n/* Do not move this. Some versions of AIX are very picky about where\n this is positioned. */\n#ifdef __GNUC__\n# if HAVE_ALLOCA_H\n# include \n# else\n /* mingw64 defines this already in malloc.h. */\n# ifndef alloca\n# define alloca __builtin_alloca\n# endif\n# endif\n# define MAYBE_UNUSED __attribute__((__unused__))\n#else\n# define MAYBE_UNUSED\n# if HAVE_ALLOCA_H\n# include \n# else\n# ifdef _AIX\n# pragma alloca\n# else\n# ifndef alloca /* predefined by HP cc +Olibcalls */\n# ifdef _MSC_VER\n# define alloca _alloca\n# else\nchar *alloca ();\n# endif\n# endif\n# endif\n# endif\n#endif\n\n/* Check for the existence of memcpy. */\n#if STDC_HEADERS\n# include \n#else\n# ifndef HAVE_MEMCPY\n# define memcpy(d, s, n) bcopy ((s), (d), (n))\n# endif\n#endif\n\n#if defined(FFI_DEBUG)\n#include \n#endif\n\n#ifdef FFI_DEBUG\nvoid ffi_assert(char *expr, char *file, int line);\nvoid ffi_stop_here(void);\nvoid ffi_type_test(ffi_type *a, char *file, int line);\n\n#define FFI_ASSERT(x) ((x) ? (void)0 : ffi_assert(#x, __FILE__,__LINE__))\n#define FFI_ASSERT_AT(x, f, l) ((x) ? 0 : ffi_assert(#x, (f), (l)))\n#define FFI_ASSERT_VALID_TYPE(x) ffi_type_test (x, __FILE__, __LINE__)\n#else\n#define FFI_ASSERT(x)\n#define FFI_ASSERT_AT(x, f, l)\n#define FFI_ASSERT_VALID_TYPE(x)\n#endif\n\n#define ALIGN(v, a) (((((size_t) (v))-1) | ((a)-1))+1)\n#define ALIGN_DOWN(v, a) (((size_t) (v)) & -a)\n\n/* Perform machine dependent cif processing */\nffi_status ffi_prep_cif_machdep(ffi_cif *cif);\nffi_status ffi_prep_cif_machdep_var(ffi_cif *cif,\n\t unsigned int nfixedargs, unsigned int ntotalargs);\n\n/* Extended cif, used in callback from assembly routine */\ntypedef struct\n{\n ffi_cif *cif;\n void *rvalue;\n void **avalue;\n} extended_cif;\n\n/* Terse sized type definitions. */\n#if defined(_MSC_VER) || defined(__sgi) || defined(__SUNPRO_C)\ntypedef unsigned char UINT8;\ntypedef signed char SINT8;\ntypedef unsigned short UINT16;\ntypedef signed short SINT16;\ntypedef unsigned int UINT32;\ntypedef signed int SINT32;\n# ifdef _MSC_VER\ntypedef unsigned __int64 UINT64;\ntypedef signed __int64 SINT64;\n# else\n# include \ntypedef uint64_t UINT64;\ntypedef int64_t SINT64;\n# endif\n#else\ntypedef unsigned int UINT8 __attribute__((__mode__(__QI__)));\ntypedef signed int SINT8 __attribute__((__mode__(__QI__)));\ntypedef unsigned int UINT16 __attribute__((__mode__(__HI__)));\ntypedef signed int SINT16 __attribute__((__mode__(__HI__)));\ntypedef unsigned int UINT32 __attribute__((__mode__(__SI__)));\ntypedef signed int SINT32 __attribute__((__mode__(__SI__)));\ntypedef unsigned int UINT64 __attribute__((__mode__(__DI__)));\ntypedef signed int SINT64 __attribute__((__mode__(__DI__)));\n#endif\n\ntypedef float FLOAT32;\n\n#ifndef __GNUC__\n#define __builtin_expect(x, expected_value) (x)\n#endif\n#define LIKELY(x) __builtin_expect(!!(x),1)\n#define UNLIKELY(x) __builtin_expect((x)!=0,0)\n\n#ifdef __cplusplus\n}\n#endif\n\n#endif\n" }, { "path": "src/ffi/ffi_i386.h", "content": "#ifdef __i386__\n\n/* -----------------------------------------------------------------*-C-*-\n libffi 3.1-rc1 - Copyright (c) 2011 Anthony Green\n - Copyright (c) 1996-2003, 2007, 2008 Red Hat, Inc.\n\n Permission is hereby granted, free of charge, to any person\n obtaining a copy of this software and associated documentation\n files (the ``Software''), to deal in the Software without\n restriction, including without limitation the rights to use, copy,\n modify, merge, publish, distribute, sublicense, and/or sell copies\n of the Software, and to permit persons to whom the Software is\n furnished to do so, subject to the following conditions:\n\n The above copyright notice and this permission notice shall be\n included in all copies or substantial portions of the Software.\n\n THE SOFTWARE IS PROVIDED ``AS IS'', WITHOUT WARRANTY OF ANY KIND,\n EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\n MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND\n NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT\n HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,\n WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER\n DEALINGS IN THE SOFTWARE.\n\n ----------------------------------------------------------------------- */\n\n/* -------------------------------------------------------------------\n The basic API is described in the README file.\n\n The raw API is designed to bypass some of the argument packing\n and unpacking on architectures for which it can be avoided.\n\n The closure API allows interpreted functions to be packaged up\n inside a C function pointer, so that they can be called as C functions,\n with no understanding on the client side that they are interpreted.\n It can also be used in other cases in which it is necessary to package\n up a user specified parameter and a function pointer as a single\n function pointer.\n\n The closure API must be implemented in order to get its functionality,\n e.g. for use by gij. Routines are provided to emulate the raw API\n if the underlying platform doesn't allow faster implementation.\n\n More details on the raw and cloure API can be found in:\n\n http://gcc.gnu.org/ml/java/1999-q3/msg00138.html\n\n and\n\n http://gcc.gnu.org/ml/java/1999-q3/msg00174.html\n -------------------------------------------------------------------- */\n\n#ifndef LIBFFI_H\n#define LIBFFI_H\n\n#ifdef __cplusplus\nextern \"C\" {\n#endif\n\n/* Specify which architecture libffi is configured for. */\n#ifndef X86_DARWIN\n#define X86_DARWIN\n#endif\n\n/* ---- System configuration information --------------------------------- */\n\n#include \"ffitarget.h\"\n\n#ifndef LIBFFI_ASM\n\n#ifdef _MSC_VER\n#define __attribute__(X)\n#endif\n\n#include \n#include \n\n/* LONG_LONG_MAX is not always defined (not if STRICT_ANSI, for example).\n But we can find it either under the correct ANSI name, or under GNU\n C's internal name. */\n\n#define FFI_64_BIT_MAX 9223372036854775807\n\n#ifdef LONG_LONG_MAX\n# define FFI_LONG_LONG_MAX LONG_LONG_MAX\n#else\n# ifdef LLONG_MAX\n# define FFI_LONG_LONG_MAX LLONG_MAX\n# ifdef _AIX52 /* or newer has C99 LLONG_MAX */\n# undef FFI_64_BIT_MAX\n# define FFI_64_BIT_MAX 9223372036854775807LL\n# endif /* _AIX52 or newer */\n# else\n# ifdef __GNUC__\n# define FFI_LONG_LONG_MAX __LONG_LONG_MAX__\n# endif\n# ifdef _AIX /* AIX 5.1 and earlier have LONGLONG_MAX */\n# ifndef __PPC64__\n# if defined (__IBMC__) || defined (__IBMCPP__)\n# define FFI_LONG_LONG_MAX LONGLONG_MAX\n# endif\n# endif /* __PPC64__ */\n# undef FFI_64_BIT_MAX\n# define FFI_64_BIT_MAX 9223372036854775807LL\n# endif\n# endif\n#endif\n\n/* The closure code assumes that this works on pointers, i.e. a size_t\t*/\n/* can hold a pointer.\t\t\t\t\t\t\t*/\n\ntypedef struct _ffi_type\n{\n size_t size;\n unsigned short alignment;\n unsigned short type;\n struct _ffi_type **elements;\n} ffi_type;\n\n#ifndef LIBFFI_HIDE_BASIC_TYPES\n#if SCHAR_MAX == 127\n# define ffi_type_uchar ffi_type_uint8\n# define ffi_type_schar ffi_type_sint8\n#else\n #error \"char size not supported\"\n#endif\n\n#if SHRT_MAX == 32767\n# define ffi_type_ushort ffi_type_uint16\n# define ffi_type_sshort ffi_type_sint16\n#elif SHRT_MAX == 2147483647\n# define ffi_type_ushort ffi_type_uint32\n# define ffi_type_sshort ffi_type_sint32\n#else\n #error \"short size not supported\"\n#endif\n\n#if INT_MAX == 32767\n# define ffi_type_uint ffi_type_uint16\n# define ffi_type_sint ffi_type_sint16\n#elif INT_MAX == 2147483647\n# define ffi_type_uint ffi_type_uint32\n# define ffi_type_sint ffi_type_sint32\n#elif INT_MAX == 9223372036854775807\n# define ffi_type_uint ffi_type_uint64\n# define ffi_type_sint ffi_type_sint64\n#else\n #error \"int size not supported\"\n#endif\n\n#if LONG_MAX == 2147483647\n# if FFI_LONG_LONG_MAX != FFI_64_BIT_MAX\n #error \"no 64-bit data type supported\"\n# endif\n#elif LONG_MAX != FFI_64_BIT_MAX\n #error \"long size not supported\"\n#endif\n\n#if LONG_MAX == 2147483647\n# define ffi_type_ulong ffi_type_uint32\n# define ffi_type_slong ffi_type_sint32\n#elif LONG_MAX == FFI_64_BIT_MAX\n# define ffi_type_ulong ffi_type_uint64\n# define ffi_type_slong ffi_type_sint64\n#else\n #error \"long size not supported\"\n#endif\n\n/* Need minimal decorations for DLLs to works on Windows. */\n/* GCC has autoimport and autoexport. Rely on Libtool to */\n/* help MSVC export from a DLL, but always declare data */\n/* to be imported for MSVC clients. This costs an extra */\n/* indirection for MSVC clients using the static version */\n/* of the library, but don't worry about that. Besides, */\n/* as a workaround, they can define FFI_BUILDING if they */\n/* *know* they are going to link with the static library. */\n#if defined _MSC_VER && !defined FFI_BUILDING\n#define FFI_EXTERN extern __declspec(dllimport)\n#else\n#define FFI_EXTERN extern\n#endif\n\n/* These are defined in types.c */\nFFI_EXTERN ffi_type ffi_type_void;\nFFI_EXTERN ffi_type ffi_type_uint8;\nFFI_EXTERN ffi_type ffi_type_sint8;\nFFI_EXTERN ffi_type ffi_type_uint16;\nFFI_EXTERN ffi_type ffi_type_sint16;\nFFI_EXTERN ffi_type ffi_type_uint32;\nFFI_EXTERN ffi_type ffi_type_sint32;\nFFI_EXTERN ffi_type ffi_type_uint64;\nFFI_EXTERN ffi_type ffi_type_sint64;\nFFI_EXTERN ffi_type ffi_type_float;\nFFI_EXTERN ffi_type ffi_type_double;\nFFI_EXTERN ffi_type ffi_type_pointer;\n\n#if 1\nFFI_EXTERN ffi_type ffi_type_longdouble;\n#else\n#define ffi_type_longdouble ffi_type_double\n#endif\n#endif /* LIBFFI_HIDE_BASIC_TYPES */\n\ntypedef enum {\n FFI_OK = 0,\n FFI_BAD_TYPEDEF,\n FFI_BAD_ABI\n} ffi_status;\n\ntypedef unsigned FFI_TYPE;\n\ntypedef struct {\n ffi_abi abi;\n unsigned nargs;\n ffi_type **arg_types;\n ffi_type *rtype;\n unsigned bytes;\n unsigned flags;\n#ifdef FFI_EXTRA_CIF_FIELDS\n FFI_EXTRA_CIF_FIELDS;\n#endif\n} ffi_cif;\n\n#if HAVE_LONG_DOUBLE_VARIANT\n/* Used to adjust size/alignment of ffi types. */\nvoid ffi_prep_types (ffi_abi abi);\n# endif\n\n/* Used internally, but overridden by some architectures */\nffi_status ffi_prep_cif_core(ffi_cif *cif,\n\t\t\t ffi_abi abi,\n\t\t\t unsigned int isvariadic,\n\t\t\t unsigned int nfixedargs,\n\t\t\t unsigned int ntotalargs,\n\t\t\t ffi_type *rtype,\n\t\t\t ffi_type **atypes);\n\n/* ---- Definitions for the raw API -------------------------------------- */\n\n#ifndef FFI_SIZEOF_ARG\n# if LONG_MAX == 2147483647\n# define FFI_SIZEOF_ARG 4\n# elif LONG_MAX == FFI_64_BIT_MAX\n# define FFI_SIZEOF_ARG 8\n# endif\n#endif\n\n#ifndef FFI_SIZEOF_JAVA_RAW\n# define FFI_SIZEOF_JAVA_RAW FFI_SIZEOF_ARG\n#endif\n\ntypedef union {\n ffi_sarg sint;\n ffi_arg uint;\n float\t flt;\n char data[FFI_SIZEOF_ARG];\n void* ptr;\n} ffi_raw;\n\n#if FFI_SIZEOF_JAVA_RAW == 4 && FFI_SIZEOF_ARG == 8\n/* This is a special case for mips64/n32 ABI (and perhaps others) where\n sizeof(void *) is 4 and FFI_SIZEOF_ARG is 8. */\ntypedef union {\n signed int\tsint;\n unsigned int\tuint;\n float\t\tflt;\n char\t\tdata[FFI_SIZEOF_JAVA_RAW];\n void*\t\tptr;\n} ffi_java_raw;\n#else\ntypedef ffi_raw ffi_java_raw;\n#endif\n\n\nvoid ffi_raw_call (ffi_cif *cif,\n\t\t void (*fn)(void),\n\t\t void *rvalue,\n\t\t ffi_raw *avalue);\n\nvoid ffi_ptrarray_to_raw (ffi_cif *cif, void **args, ffi_raw *raw);\nvoid ffi_raw_to_ptrarray (ffi_cif *cif, ffi_raw *raw, void **args);\nsize_t ffi_raw_size (ffi_cif *cif);\n\n/* This is analogous to the raw API, except it uses Java parameter\t*/\n/* packing, even on 64-bit machines. I.e. on 64-bit machines\t\t*/\n/* longs and doubles are followed by an empty 64-bit word.\t\t*/\n\nvoid ffi_java_raw_call (ffi_cif *cif,\n\t\t\tvoid (*fn)(void),\n\t\t\tvoid *rvalue,\n\t\t\tffi_java_raw *avalue);\n\nvoid ffi_java_ptrarray_to_raw (ffi_cif *cif, void **args, ffi_java_raw *raw);\nvoid ffi_java_raw_to_ptrarray (ffi_cif *cif, ffi_java_raw *raw, void **args);\nsize_t ffi_java_raw_size (ffi_cif *cif);\n\n/* ---- Definitions for closures ----------------------------------------- */\n\n#if FFI_CLOSURES\n\n#ifdef _MSC_VER\n__declspec(align(8))\n#endif\ntypedef struct {\n#if 0\n void *trampoline_table;\n void *trampoline_table_entry;\n#else\n char tramp[FFI_TRAMPOLINE_SIZE];\n#endif\n ffi_cif *cif;\n void (*fun)(ffi_cif*,void*,void**,void*);\n void *user_data;\n#ifdef __GNUC__\n} ffi_closure __attribute__((aligned (8)));\n#else\n} ffi_closure;\n# ifdef __sgi\n# pragma pack 0\n# endif\n#endif\n\nvoid *ffi_closure_alloc (size_t size, void **code);\nvoid ffi_closure_free (void *);\n\nffi_status\nffi_prep_closure (ffi_closure*,\n\t\t ffi_cif *,\n\t\t void (*fun)(ffi_cif*,void*,void**,void*),\n\t\t void *user_data);\n\nffi_status\nffi_prep_closure_loc (ffi_closure*,\n\t\t ffi_cif *,\n\t\t void (*fun)(ffi_cif*,void*,void**,void*),\n\t\t void *user_data,\n\t\t void*codeloc);\n\n#ifdef __sgi\n# pragma pack 8\n#endif\ntypedef struct {\n#if 0\n void *trampoline_table;\n void *trampoline_table_entry;\n#else\n char tramp[FFI_TRAMPOLINE_SIZE];\n#endif\n ffi_cif *cif;\n\n#if !FFI_NATIVE_RAW_API\n\n /* if this is enabled, then a raw closure has the same layout \n as a regular closure. We use this to install an intermediate \n handler to do the transaltion, void** -> ffi_raw*. */\n\n void (*translate_args)(ffi_cif*,void*,void**,void*);\n void *this_closure;\n\n#endif\n\n void (*fun)(ffi_cif*,void*,ffi_raw*,void*);\n void *user_data;\n\n} ffi_raw_closure;\n\ntypedef struct {\n#if 0\n void *trampoline_table;\n void *trampoline_table_entry;\n#else\n char tramp[FFI_TRAMPOLINE_SIZE];\n#endif\n\n ffi_cif *cif;\n\n#if !FFI_NATIVE_RAW_API\n\n /* if this is enabled, then a raw closure has the same layout \n as a regular closure. We use this to install an intermediate \n handler to do the transaltion, void** -> ffi_raw*. */\n\n void (*translate_args)(ffi_cif*,void*,void**,void*);\n void *this_closure;\n\n#endif\n\n void (*fun)(ffi_cif*,void*,ffi_java_raw*,void*);\n void *user_data;\n\n} ffi_java_raw_closure;\n\nffi_status\nffi_prep_raw_closure (ffi_raw_closure*,\n\t\t ffi_cif *cif,\n\t\t void (*fun)(ffi_cif*,void*,ffi_raw*,void*),\n\t\t void *user_data);\n\nffi_status\nffi_prep_raw_closure_loc (ffi_raw_closure*,\n\t\t\t ffi_cif *cif,\n\t\t\t void (*fun)(ffi_cif*,void*,ffi_raw*,void*),\n\t\t\t void *user_data,\n\t\t\t void *codeloc);\n\nffi_status\nffi_prep_java_raw_closure (ffi_java_raw_closure*,\n\t\t ffi_cif *cif,\n\t\t void (*fun)(ffi_cif*,void*,ffi_java_raw*,void*),\n\t\t void *user_data);\n\nffi_status\nffi_prep_java_raw_closure_loc (ffi_java_raw_closure*,\n\t\t\t ffi_cif *cif,\n\t\t\t void (*fun)(ffi_cif*,void*,ffi_java_raw*,void*),\n\t\t\t void *user_data,\n\t\t\t void *codeloc);\n\n#endif /* FFI_CLOSURES */\n\n/* ---- Public interface definition -------------------------------------- */\n\nffi_status ffi_prep_cif(ffi_cif *cif,\n\t\t\tffi_abi abi,\n\t\t\tunsigned int nargs,\n\t\t\tffi_type *rtype,\n\t\t\tffi_type **atypes);\n\nffi_status ffi_prep_cif_var(ffi_cif *cif,\n\t\t\t ffi_abi abi,\n\t\t\t unsigned int nfixedargs,\n\t\t\t unsigned int ntotalargs,\n\t\t\t ffi_type *rtype,\n\t\t\t ffi_type **atypes);\n\nvoid ffi_call(ffi_cif *cif,\n\t void (*fn)(void),\n\t void *rvalue,\n\t void **avalue);\n\n/* Useful for eliminating compiler warnings */\n#define FFI_FN(f) ((void (*)(void))f)\n\n/* ---- Definitions shared with assembly code ---------------------------- */\n\n#endif\n\n/* If these change, update src/mips/ffitarget.h. */\n#define FFI_TYPE_VOID 0 \n#define FFI_TYPE_INT 1\n#define FFI_TYPE_FLOAT 2 \n#define FFI_TYPE_DOUBLE 3\n#if 1\n#define FFI_TYPE_LONGDOUBLE 4\n#else\n#define FFI_TYPE_LONGDOUBLE FFI_TYPE_DOUBLE\n#endif\n#define FFI_TYPE_UINT8 5 \n#define FFI_TYPE_SINT8 6\n#define FFI_TYPE_UINT16 7 \n#define FFI_TYPE_SINT16 8\n#define FFI_TYPE_UINT32 9\n#define FFI_TYPE_SINT32 10\n#define FFI_TYPE_UINT64 11\n#define FFI_TYPE_SINT64 12\n#define FFI_TYPE_STRUCT 13\n#define FFI_TYPE_POINTER 14\n\n/* This should always refer to the last type code (for sanity checks) */\n#define FFI_TYPE_LAST FFI_TYPE_POINTER\n\n#ifdef __cplusplus\n}\n#endif\n\n#endif\n\n\n#endif" }, { "path": "src/ffi/ffi_x86_64.h", "content": "#ifdef __x86_64__\n\n/* -----------------------------------------------------------------*-C-*-\n libffi 3.1-rc1 - Copyright (c) 2011 Anthony Green\n - Copyright (c) 1996-2003, 2007, 2008 Red Hat, Inc.\n\n Permission is hereby granted, free of charge, to any person\n obtaining a copy of this software and associated documentation\n files (the ``Software''), to deal in the Software without\n restriction, including without limitation the rights to use, copy,\n modify, merge, publish, distribute, sublicense, and/or sell copies\n of the Software, and to permit persons to whom the Software is\n furnished to do so, subject to the following conditions:\n\n The above copyright notice and this permission notice shall be\n included in all copies or substantial portions of the Software.\n\n THE SOFTWARE IS PROVIDED ``AS IS'', WITHOUT WARRANTY OF ANY KIND,\n EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\n MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND\n NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT\n HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,\n WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER\n DEALINGS IN THE SOFTWARE.\n\n ----------------------------------------------------------------------- */\n\n/* -------------------------------------------------------------------\n The basic API is described in the README file.\n\n The raw API is designed to bypass some of the argument packing\n and unpacking on architectures for which it can be avoided.\n\n The closure API allows interpreted functions to be packaged up\n inside a C function pointer, so that they can be called as C functions,\n with no understanding on the client side that they are interpreted.\n It can also be used in other cases in which it is necessary to package\n up a user specified parameter and a function pointer as a single\n function pointer.\n\n The closure API must be implemented in order to get its functionality,\n e.g. for use by gij. Routines are provided to emulate the raw API\n if the underlying platform doesn't allow faster implementation.\n\n More details on the raw and cloure API can be found in:\n\n http://gcc.gnu.org/ml/java/1999-q3/msg00138.html\n\n and\n\n http://gcc.gnu.org/ml/java/1999-q3/msg00174.html\n -------------------------------------------------------------------- */\n\n#ifndef LIBFFI_H\n#define LIBFFI_H\n\n#ifdef __cplusplus\nextern \"C\" {\n#endif\n\n/* Specify which architecture libffi is configured for. */\n#ifndef X86_DARWIN\n#define X86_DARWIN\n#endif\n\n/* ---- System configuration information --------------------------------- */\n\n#include \"ffitarget.h\"\n\n#ifndef LIBFFI_ASM\n\n#ifdef _MSC_VER\n#define __attribute__(X)\n#endif\n\n#include \n#include \n\n/* LONG_LONG_MAX is not always defined (not if STRICT_ANSI, for example).\n But we can find it either under the correct ANSI name, or under GNU\n C's internal name. */\n\n#define FFI_64_BIT_MAX 9223372036854775807\n\n#ifdef LONG_LONG_MAX\n# define FFI_LONG_LONG_MAX LONG_LONG_MAX\n#else\n# ifdef LLONG_MAX\n# define FFI_LONG_LONG_MAX LLONG_MAX\n# ifdef _AIX52 /* or newer has C99 LLONG_MAX */\n# undef FFI_64_BIT_MAX\n# define FFI_64_BIT_MAX 9223372036854775807LL\n# endif /* _AIX52 or newer */\n# else\n# ifdef __GNUC__\n# define FFI_LONG_LONG_MAX __LONG_LONG_MAX__\n# endif\n# ifdef _AIX /* AIX 5.1 and earlier have LONGLONG_MAX */\n# ifndef __PPC64__\n# if defined (__IBMC__) || defined (__IBMCPP__)\n# define FFI_LONG_LONG_MAX LONGLONG_MAX\n# endif\n# endif /* __PPC64__ */\n# undef FFI_64_BIT_MAX\n# define FFI_64_BIT_MAX 9223372036854775807LL\n# endif\n# endif\n#endif\n\n/* The closure code assumes that this works on pointers, i.e. a size_t\t*/\n/* can hold a pointer.\t\t\t\t\t\t\t*/\n\ntypedef struct _ffi_type\n{\n size_t size;\n unsigned short alignment;\n unsigned short type;\n struct _ffi_type **elements;\n} ffi_type;\n\n#ifndef LIBFFI_HIDE_BASIC_TYPES\n#if SCHAR_MAX == 127\n# define ffi_type_uchar ffi_type_uint8\n# define ffi_type_schar ffi_type_sint8\n#else\n #error \"char size not supported\"\n#endif\n\n#if SHRT_MAX == 32767\n# define ffi_type_ushort ffi_type_uint16\n# define ffi_type_sshort ffi_type_sint16\n#elif SHRT_MAX == 2147483647\n# define ffi_type_ushort ffi_type_uint32\n# define ffi_type_sshort ffi_type_sint32\n#else\n #error \"short size not supported\"\n#endif\n\n#if INT_MAX == 32767\n# define ffi_type_uint ffi_type_uint16\n# define ffi_type_sint ffi_type_sint16\n#elif INT_MAX == 2147483647\n# define ffi_type_uint ffi_type_uint32\n# define ffi_type_sint ffi_type_sint32\n#elif INT_MAX == 9223372036854775807\n# define ffi_type_uint ffi_type_uint64\n# define ffi_type_sint ffi_type_sint64\n#else\n #error \"int size not supported\"\n#endif\n\n#if LONG_MAX == 2147483647\n# if FFI_LONG_LONG_MAX != FFI_64_BIT_MAX\n #error \"no 64-bit data type supported\"\n# endif\n#elif LONG_MAX != FFI_64_BIT_MAX\n #error \"long size not supported\"\n#endif\n\n#if LONG_MAX == 2147483647\n# define ffi_type_ulong ffi_type_uint32\n# define ffi_type_slong ffi_type_sint32\n#elif LONG_MAX == FFI_64_BIT_MAX\n# define ffi_type_ulong ffi_type_uint64\n# define ffi_type_slong ffi_type_sint64\n#else\n #error \"long size not supported\"\n#endif\n\n/* Need minimal decorations for DLLs to works on Windows. */\n/* GCC has autoimport and autoexport. Rely on Libtool to */\n/* help MSVC export from a DLL, but always declare data */\n/* to be imported for MSVC clients. This costs an extra */\n/* indirection for MSVC clients using the static version */\n/* of the library, but don't worry about that. Besides, */\n/* as a workaround, they can define FFI_BUILDING if they */\n/* *know* they are going to link with the static library. */\n#if defined _MSC_VER && !defined FFI_BUILDING\n#define FFI_EXTERN extern __declspec(dllimport)\n#else\n#define FFI_EXTERN extern\n#endif\n\n/* These are defined in types.c */\nFFI_EXTERN ffi_type ffi_type_void;\nFFI_EXTERN ffi_type ffi_type_uint8;\nFFI_EXTERN ffi_type ffi_type_sint8;\nFFI_EXTERN ffi_type ffi_type_uint16;\nFFI_EXTERN ffi_type ffi_type_sint16;\nFFI_EXTERN ffi_type ffi_type_uint32;\nFFI_EXTERN ffi_type ffi_type_sint32;\nFFI_EXTERN ffi_type ffi_type_uint64;\nFFI_EXTERN ffi_type ffi_type_sint64;\nFFI_EXTERN ffi_type ffi_type_float;\nFFI_EXTERN ffi_type ffi_type_double;\nFFI_EXTERN ffi_type ffi_type_pointer;\n\n#if 1\nFFI_EXTERN ffi_type ffi_type_longdouble;\n#else\n#define ffi_type_longdouble ffi_type_double\n#endif\n#endif /* LIBFFI_HIDE_BASIC_TYPES */\n\ntypedef enum {\n FFI_OK = 0,\n FFI_BAD_TYPEDEF,\n FFI_BAD_ABI\n} ffi_status;\n\ntypedef unsigned FFI_TYPE;\n\ntypedef struct {\n ffi_abi abi;\n unsigned nargs;\n ffi_type **arg_types;\n ffi_type *rtype;\n unsigned bytes;\n unsigned flags;\n#ifdef FFI_EXTRA_CIF_FIELDS\n FFI_EXTRA_CIF_FIELDS;\n#endif\n} ffi_cif;\n\n#if HAVE_LONG_DOUBLE_VARIANT\n/* Used to adjust size/alignment of ffi types. */\nvoid ffi_prep_types (ffi_abi abi);\n# endif\n\n/* Used internally, but overridden by some architectures */\nffi_status ffi_prep_cif_core(ffi_cif *cif,\n\t\t\t ffi_abi abi,\n\t\t\t unsigned int isvariadic,\n\t\t\t unsigned int nfixedargs,\n\t\t\t unsigned int ntotalargs,\n\t\t\t ffi_type *rtype,\n\t\t\t ffi_type **atypes);\n\n/* ---- Definitions for the raw API -------------------------------------- */\n\n#ifndef FFI_SIZEOF_ARG\n# if LONG_MAX == 2147483647\n# define FFI_SIZEOF_ARG 4\n# elif LONG_MAX == FFI_64_BIT_MAX\n# define FFI_SIZEOF_ARG 8\n# endif\n#endif\n\n#ifndef FFI_SIZEOF_JAVA_RAW\n# define FFI_SIZEOF_JAVA_RAW FFI_SIZEOF_ARG\n#endif\n\ntypedef union {\n ffi_sarg sint;\n ffi_arg uint;\n float\t flt;\n char data[FFI_SIZEOF_ARG];\n void* ptr;\n} ffi_raw;\n\n#if FFI_SIZEOF_JAVA_RAW == 4 && FFI_SIZEOF_ARG == 8\n/* This is a special case for mips64/n32 ABI (and perhaps others) where\n sizeof(void *) is 4 and FFI_SIZEOF_ARG is 8. */\ntypedef union {\n signed int\tsint;\n unsigned int\tuint;\n float\t\tflt;\n char\t\tdata[FFI_SIZEOF_JAVA_RAW];\n void*\t\tptr;\n} ffi_java_raw;\n#else\ntypedef ffi_raw ffi_java_raw;\n#endif\n\n\nvoid ffi_raw_call (ffi_cif *cif,\n\t\t void (*fn)(void),\n\t\t void *rvalue,\n\t\t ffi_raw *avalue);\n\nvoid ffi_ptrarray_to_raw (ffi_cif *cif, void **args, ffi_raw *raw);\nvoid ffi_raw_to_ptrarray (ffi_cif *cif, ffi_raw *raw, void **args);\nsize_t ffi_raw_size (ffi_cif *cif);\n\n/* This is analogous to the raw API, except it uses Java parameter\t*/\n/* packing, even on 64-bit machines. I.e. on 64-bit machines\t\t*/\n/* longs and doubles are followed by an empty 64-bit word.\t\t*/\n\nvoid ffi_java_raw_call (ffi_cif *cif,\n\t\t\tvoid (*fn)(void),\n\t\t\tvoid *rvalue,\n\t\t\tffi_java_raw *avalue);\n\nvoid ffi_java_ptrarray_to_raw (ffi_cif *cif, void **args, ffi_java_raw *raw);\nvoid ffi_java_raw_to_ptrarray (ffi_cif *cif, ffi_java_raw *raw, void **args);\nsize_t ffi_java_raw_size (ffi_cif *cif);\n\n/* ---- Definitions for closures ----------------------------------------- */\n\n#if FFI_CLOSURES\n\n#ifdef _MSC_VER\n__declspec(align(8))\n#endif\ntypedef struct {\n#if 0\n void *trampoline_table;\n void *trampoline_table_entry;\n#else\n char tramp[FFI_TRAMPOLINE_SIZE];\n#endif\n ffi_cif *cif;\n void (*fun)(ffi_cif*,void*,void**,void*);\n void *user_data;\n#ifdef __GNUC__\n} ffi_closure __attribute__((aligned (8)));\n#else\n} ffi_closure;\n# ifdef __sgi\n# pragma pack 0\n# endif\n#endif\n\nvoid *ffi_closure_alloc (size_t size, void **code);\nvoid ffi_closure_free (void *);\n\nffi_status\nffi_prep_closure (ffi_closure*,\n\t\t ffi_cif *,\n\t\t void (*fun)(ffi_cif*,void*,void**,void*),\n\t\t void *user_data);\n\nffi_status\nffi_prep_closure_loc (ffi_closure*,\n\t\t ffi_cif *,\n\t\t void (*fun)(ffi_cif*,void*,void**,void*),\n\t\t void *user_data,\n\t\t void*codeloc);\n\n#ifdef __sgi\n# pragma pack 8\n#endif\ntypedef struct {\n#if 0\n void *trampoline_table;\n void *trampoline_table_entry;\n#else\n char tramp[FFI_TRAMPOLINE_SIZE];\n#endif\n ffi_cif *cif;\n\n#if !FFI_NATIVE_RAW_API\n\n /* if this is enabled, then a raw closure has the same layout \n as a regular closure. We use this to install an intermediate \n handler to do the transaltion, void** -> ffi_raw*. */\n\n void (*translate_args)(ffi_cif*,void*,void**,void*);\n void *this_closure;\n\n#endif\n\n void (*fun)(ffi_cif*,void*,ffi_raw*,void*);\n void *user_data;\n\n} ffi_raw_closure;\n\ntypedef struct {\n#if 0\n void *trampoline_table;\n void *trampoline_table_entry;\n#else\n char tramp[FFI_TRAMPOLINE_SIZE];\n#endif\n\n ffi_cif *cif;\n\n#if !FFI_NATIVE_RAW_API\n\n /* if this is enabled, then a raw closure has the same layout \n as a regular closure. We use this to install an intermediate \n handler to do the transaltion, void** -> ffi_raw*. */\n\n void (*translate_args)(ffi_cif*,void*,void**,void*);\n void *this_closure;\n\n#endif\n\n void (*fun)(ffi_cif*,void*,ffi_java_raw*,void*);\n void *user_data;\n\n} ffi_java_raw_closure;\n\nffi_status\nffi_prep_raw_closure (ffi_raw_closure*,\n\t\t ffi_cif *cif,\n\t\t void (*fun)(ffi_cif*,void*,ffi_raw*,void*),\n\t\t void *user_data);\n\nffi_status\nffi_prep_raw_closure_loc (ffi_raw_closure*,\n\t\t\t ffi_cif *cif,\n\t\t\t void (*fun)(ffi_cif*,void*,ffi_raw*,void*),\n\t\t\t void *user_data,\n\t\t\t void *codeloc);\n\nffi_status\nffi_prep_java_raw_closure (ffi_java_raw_closure*,\n\t\t ffi_cif *cif,\n\t\t void (*fun)(ffi_cif*,void*,ffi_java_raw*,void*),\n\t\t void *user_data);\n\nffi_status\nffi_prep_java_raw_closure_loc (ffi_java_raw_closure*,\n\t\t\t ffi_cif *cif,\n\t\t\t void (*fun)(ffi_cif*,void*,ffi_java_raw*,void*),\n\t\t\t void *user_data,\n\t\t\t void *codeloc);\n\n#endif /* FFI_CLOSURES */\n\n/* ---- Public interface definition -------------------------------------- */\n\nffi_status ffi_prep_cif(ffi_cif *cif,\n\t\t\tffi_abi abi,\n\t\t\tunsigned int nargs,\n\t\t\tffi_type *rtype,\n\t\t\tffi_type **atypes);\n\nffi_status ffi_prep_cif_var(ffi_cif *cif,\n\t\t\t ffi_abi abi,\n\t\t\t unsigned int nfixedargs,\n\t\t\t unsigned int ntotalargs,\n\t\t\t ffi_type *rtype,\n\t\t\t ffi_type **atypes);\n\nvoid ffi_call(ffi_cif *cif,\n\t void (*fn)(void),\n\t void *rvalue,\n\t void **avalue);\n\n/* Useful for eliminating compiler warnings */\n#define FFI_FN(f) ((void (*)(void))f)\n\n/* ---- Definitions shared with assembly code ---------------------------- */\n\n#endif\n\n/* If these change, update src/mips/ffitarget.h. */\n#define FFI_TYPE_VOID 0 \n#define FFI_TYPE_INT 1\n#define FFI_TYPE_FLOAT 2 \n#define FFI_TYPE_DOUBLE 3\n#if 1\n#define FFI_TYPE_LONGDOUBLE 4\n#else\n#define FFI_TYPE_LONGDOUBLE FFI_TYPE_DOUBLE\n#endif\n#define FFI_TYPE_UINT8 5 \n#define FFI_TYPE_SINT8 6\n#define FFI_TYPE_UINT16 7 \n#define FFI_TYPE_SINT16 8\n#define FFI_TYPE_UINT32 9\n#define FFI_TYPE_SINT32 10\n#define FFI_TYPE_UINT64 11\n#define FFI_TYPE_SINT64 12\n#define FFI_TYPE_STRUCT 13\n#define FFI_TYPE_POINTER 14\n\n/* This should always refer to the last type code (for sanity checks) */\n#define FFI_TYPE_LAST FFI_TYPE_POINTER\n\n#ifdef __cplusplus\n}\n#endif\n\n#endif\n\n\n#endif" }, { "path": "src/ffi/fficonfig.h", "content": "#ifdef __arm64__\n\n#include \n\n\n#endif\n#ifdef __i386__\n\n#include \n\n\n#endif\n#ifdef __arm__\n\n#include \n\n\n#endif\n#ifdef __x86_64__\n\n#include \n\n\n#endif\n" }, { "path": "src/ffi/fficonfig_arm64.h", "content": "#ifdef __arm64__\n\n/* fficonfig.h. Generated from fficonfig.h.in by configure. */\n/* fficonfig.h.in. Generated from configure.ac by autoheader. */\n\n/* Define if building universal (internal helper macro) */\n/* #undef AC_APPLE_UNIVERSAL_BUILD */\n\n/* Define to one of `_getb67', `GETB67', `getb67' for Cray-2 and Cray-YMP\n systems. This function is required for `alloca.c' support on those systems.\n */\n/* #undef CRAY_STACKSEG_END */\n\n/* Define to 1 if using `alloca.c'. */\n/* #undef C_ALLOCA */\n\n/* Define to the flags needed for the .section .eh_frame directive. */\n#define EH_FRAME_FLAGS \"aw\"\n\n/* Define this if you want extra debugging. */\n/* #undef FFI_DEBUG */\n\n/* Cannot use PROT_EXEC on this target, so, we revert to alternative means */\n/* #undef FFI_EXEC_TRAMPOLINE_TABLE */\n\n/* Define this if you want to enable pax emulated trampolines */\n/* #undef FFI_MMAP_EXEC_EMUTRAMP_PAX */\n\n/* Cannot use malloc on this target, so, we revert to alternative means */\n#define FFI_MMAP_EXEC_WRIT 1\n\n/* Define this if you do not want support for the raw API. */\n/* #undef FFI_NO_RAW_API */\n\n/* Define this if you do not want support for aggregate types. */\n/* #undef FFI_NO_STRUCTS */\n\n/* Define to 1 if you have `alloca', as a function or macro. */\n#define HAVE_ALLOCA 1\n\n/* Define to 1 if you have and it should be used (not on Ultrix).\n */\n#define HAVE_ALLOCA_H 1\n\n/* Define if your assembler supports .ascii. */\n/* #undef HAVE_AS_ASCII_PSEUDO_OP */\n\n/* Define if your assembler supports .cfi_* directives. */\n#define HAVE_AS_CFI_PSEUDO_OP 1\n\n/* Define if your assembler supports .register. */\n/* #undef HAVE_AS_REGISTER_PSEUDO_OP */\n\n/* Define if your assembler and linker support unaligned PC relative relocs.\n */\n/* #undef HAVE_AS_SPARC_UA_PCREL */\n\n/* Define if your assembler supports .string. */\n/* #undef HAVE_AS_STRING_PSEUDO_OP */\n\n/* Define if your assembler supports unwind section type. */\n/* #undef HAVE_AS_X86_64_UNWIND_SECTION_TYPE */\n\n/* Define if your assembler supports PC relative relocs. */\n/* #undef HAVE_AS_X86_PCREL */\n\n/* Define to 1 if you have the header file. */\n#define HAVE_DLFCN_H 1\n\n/* Define if __attribute__((visibility(\"hidden\"))) is supported. */\n/* #undef HAVE_HIDDEN_VISIBILITY_ATTRIBUTE */\n\n/* Define to 1 if you have the header file. */\n#define HAVE_INTTYPES_H 1\n\n/* Define if you have the long double type and it is bigger than a double */\n/* #undef HAVE_LONG_DOUBLE */\n\n/* Define if you support more than one size of the long double type */\n/* #undef HAVE_LONG_DOUBLE_VARIANT */\n\n/* Define to 1 if you have the `memcpy' function. */\n#define HAVE_MEMCPY 1\n\n/* Define to 1 if you have the header file. */\n#define HAVE_MEMORY_H 1\n\n/* Define to 1 if you have the `mmap' function. */\n#define HAVE_MMAP 1\n\n/* Define if mmap with MAP_ANON(YMOUS) works. */\n#define HAVE_MMAP_ANON 1\n\n/* Define if mmap of /dev/zero works. */\n/* #undef HAVE_MMAP_DEV_ZERO */\n\n/* Define if read-only mmap of a plain file works. */\n#define HAVE_MMAP_FILE 1\n\n/* Define if .eh_frame sections should be read-only. */\n/* #undef HAVE_RO_EH_FRAME */\n\n/* Define to 1 if you have the header file. */\n#define HAVE_STDINT_H 1\n\n/* Define to 1 if you have the header file. */\n#define HAVE_STDLIB_H 1\n\n/* Define to 1 if you have the header file. */\n#define HAVE_STRINGS_H 1\n\n/* Define to 1 if you have the header file. */\n#define HAVE_STRING_H 1\n\n/* Define to 1 if you have the header file. */\n#define HAVE_SYS_MMAN_H 1\n\n/* Define to 1 if you have the header file. */\n#define HAVE_SYS_STAT_H 1\n\n/* Define to 1 if you have the header file. */\n#define HAVE_SYS_TYPES_H 1\n\n/* Define to 1 if you have the header file. */\n#define HAVE_UNISTD_H 1\n\n/* Define to the sub-directory in which libtool stores uninstalled libraries.\n */\n#define LT_OBJDIR \".libs/\"\n\n/* Name of package */\n#define PACKAGE \"libffi\"\n\n/* Define to the address where bug reports for this package should be sent. */\n#define PACKAGE_BUGREPORT \"http://github.com/atgreen/libffi/issues\"\n\n/* Define to the full name of this package. */\n#define PACKAGE_NAME \"libffi\"\n\n/* Define to the full name and version of this package. */\n#define PACKAGE_STRING \"libffi 3.1-rc1\"\n\n/* Define to the one symbol short name of this package. */\n#define PACKAGE_TARNAME \"libffi\"\n\n/* Define to the home page for this package. */\n#define PACKAGE_URL \"\"\n\n/* Define to the version of this package. */\n#define PACKAGE_VERSION \"3.1-rc1\"\n\n/* The size of `double', as computed by sizeof. */\n#define SIZEOF_DOUBLE 8\n\n/* The size of `long double', as computed by sizeof. */\n#define SIZEOF_LONG_DOUBLE 8\n\n/* The size of `size_t', as computed by sizeof. */\n#define SIZEOF_SIZE_T 8\n\n/* If using the C implementation of alloca, define if you know the\n direction of stack growth for your system; otherwise it will be\n automatically deduced at runtime.\n\tSTACK_DIRECTION > 0 => grows toward higher addresses\n\tSTACK_DIRECTION < 0 => grows toward lower addresses\n\tSTACK_DIRECTION = 0 => direction of growth unknown */\n/* #undef STACK_DIRECTION */\n\n/* Define to 1 if you have the ANSI C header files. */\n#define STDC_HEADERS 1\n\n/* Define if symbols are underscored. */\n#define SYMBOL_UNDERSCORE 1\n\n/* Define this if you are using Purify and want to suppress spurious messages.\n */\n/* #undef USING_PURIFY */\n\n/* Version number of package */\n#define VERSION \"3.1-rc1\"\n\n/* Define WORDS_BIGENDIAN to 1 if your processor stores words with the most\n significant byte first (like Motorola and SPARC, unlike Intel). */\n#if defined AC_APPLE_UNIVERSAL_BUILD\n# if defined __BIG_ENDIAN__\n# define WORDS_BIGENDIAN 1\n# endif\n#else\n# ifndef WORDS_BIGENDIAN\n/* # undef WORDS_BIGENDIAN */\n# endif\n#endif\n\n/* Define to `unsigned int' if does not define. */\n/* #undef size_t */\n\n\n#ifdef HAVE_HIDDEN_VISIBILITY_ATTRIBUTE\n#ifdef LIBFFI_ASM\n#define FFI_HIDDEN(name) .hidden name\n#else\n#define FFI_HIDDEN __attribute__ ((visibility (\"hidden\")))\n#endif\n#else\n#ifdef LIBFFI_ASM\n#define FFI_HIDDEN(name)\n#else\n#define FFI_HIDDEN\n#endif\n#endif\n\n\n\n#endif" }, { "path": "src/ffi/fficonfig_armv7.h", "content": "#ifdef __arm__\n\n/* fficonfig.h. Generated from fficonfig.h.in by configure. */\n/* fficonfig.h.in. Generated from configure.ac by autoheader. */\n\n/* Define if building universal (internal helper macro) */\n/* #undef AC_APPLE_UNIVERSAL_BUILD */\n\n/* Define to one of `_getb67', `GETB67', `getb67' for Cray-2 and Cray-YMP\n systems. This function is required for `alloca.c' support on those systems.\n */\n/* #undef CRAY_STACKSEG_END */\n\n/* Define to 1 if using `alloca.c'. */\n/* #undef C_ALLOCA */\n\n/* Define to the flags needed for the .section .eh_frame directive. */\n#define EH_FRAME_FLAGS \"aw\"\n\n/* Define this if you want extra debugging. */\n/* #undef FFI_DEBUG */\n\n/* Cannot use PROT_EXEC on this target, so, we revert to alternative means */\n#define FFI_EXEC_TRAMPOLINE_TABLE 1\n\n/* Define this if you want to enable pax emulated trampolines */\n/* #undef FFI_MMAP_EXEC_EMUTRAMP_PAX */\n\n/* Cannot use malloc on this target, so, we revert to alternative means */\n/* #undef FFI_MMAP_EXEC_WRIT */\n\n/* Define this if you do not want support for the raw API. */\n/* #undef FFI_NO_RAW_API */\n\n/* Define this if you do not want support for aggregate types. */\n/* #undef FFI_NO_STRUCTS */\n\n/* Define to 1 if you have `alloca', as a function or macro. */\n#define HAVE_ALLOCA 1\n\n/* Define to 1 if you have and it should be used (not on Ultrix).\n */\n#define HAVE_ALLOCA_H 1\n\n/* Define if your assembler supports .ascii. */\n/* #undef HAVE_AS_ASCII_PSEUDO_OP */\n\n/* Define if your assembler supports .cfi_* directives. */\n#define HAVE_AS_CFI_PSEUDO_OP 1\n\n/* Define if your assembler supports .register. */\n/* #undef HAVE_AS_REGISTER_PSEUDO_OP */\n\n/* Define if your assembler and linker support unaligned PC relative relocs.\n */\n/* #undef HAVE_AS_SPARC_UA_PCREL */\n\n/* Define if your assembler supports .string. */\n/* #undef HAVE_AS_STRING_PSEUDO_OP */\n\n/* Define if your assembler supports unwind section type. */\n/* #undef HAVE_AS_X86_64_UNWIND_SECTION_TYPE */\n\n/* Define if your assembler supports PC relative relocs. */\n/* #undef HAVE_AS_X86_PCREL */\n\n/* Define to 1 if you have the header file. */\n#define HAVE_DLFCN_H 1\n\n/* Define if __attribute__((visibility(\"hidden\"))) is supported. */\n/* #undef HAVE_HIDDEN_VISIBILITY_ATTRIBUTE */\n\n/* Define to 1 if you have the header file. */\n#define HAVE_INTTYPES_H 1\n\n/* Define if you have the long double type and it is bigger than a double */\n/* #undef HAVE_LONG_DOUBLE */\n\n/* Define if you support more than one size of the long double type */\n/* #undef HAVE_LONG_DOUBLE_VARIANT */\n\n/* Define to 1 if you have the `memcpy' function. */\n#define HAVE_MEMCPY 1\n\n/* Define to 1 if you have the header file. */\n#define HAVE_MEMORY_H 1\n\n/* Define to 1 if you have the `mmap' function. */\n#define HAVE_MMAP 1\n\n/* Define if mmap with MAP_ANON(YMOUS) works. */\n#define HAVE_MMAP_ANON 1\n\n/* Define if mmap of /dev/zero works. */\n/* #undef HAVE_MMAP_DEV_ZERO */\n\n/* Define if read-only mmap of a plain file works. */\n#define HAVE_MMAP_FILE 1\n\n/* Define if .eh_frame sections should be read-only. */\n/* #undef HAVE_RO_EH_FRAME */\n\n/* Define to 1 if you have the header file. */\n#define HAVE_STDINT_H 1\n\n/* Define to 1 if you have the header file. */\n#define HAVE_STDLIB_H 1\n\n/* Define to 1 if you have the header file. */\n#define HAVE_STRINGS_H 1\n\n/* Define to 1 if you have the header file. */\n#define HAVE_STRING_H 1\n\n/* Define to 1 if you have the header file. */\n#define HAVE_SYS_MMAN_H 1\n\n/* Define to 1 if you have the header file. */\n#define HAVE_SYS_STAT_H 1\n\n/* Define to 1 if you have the header file. */\n#define HAVE_SYS_TYPES_H 1\n\n/* Define to 1 if you have the header file. */\n#define HAVE_UNISTD_H 1\n\n/* Define to the sub-directory in which libtool stores uninstalled libraries.\n */\n#define LT_OBJDIR \".libs/\"\n\n/* Name of package */\n#define PACKAGE \"libffi\"\n\n/* Define to the address where bug reports for this package should be sent. */\n#define PACKAGE_BUGREPORT \"http://github.com/atgreen/libffi/issues\"\n\n/* Define to the full name of this package. */\n#define PACKAGE_NAME \"libffi\"\n\n/* Define to the full name and version of this package. */\n#define PACKAGE_STRING \"libffi 3.1-rc1\"\n\n/* Define to the one symbol short name of this package. */\n#define PACKAGE_TARNAME \"libffi\"\n\n/* Define to the home page for this package. */\n#define PACKAGE_URL \"\"\n\n/* Define to the version of this package. */\n#define PACKAGE_VERSION \"3.1-rc1\"\n\n/* The size of `double', as computed by sizeof. */\n#define SIZEOF_DOUBLE 8\n\n/* The size of `long double', as computed by sizeof. */\n#define SIZEOF_LONG_DOUBLE 8\n\n/* The size of `size_t', as computed by sizeof. */\n#define SIZEOF_SIZE_T 4\n\n/* If using the C implementation of alloca, define if you know the\n direction of stack growth for your system; otherwise it will be\n automatically deduced at runtime.\n\tSTACK_DIRECTION > 0 => grows toward higher addresses\n\tSTACK_DIRECTION < 0 => grows toward lower addresses\n\tSTACK_DIRECTION = 0 => direction of growth unknown */\n/* #undef STACK_DIRECTION */\n\n/* Define to 1 if you have the ANSI C header files. */\n#define STDC_HEADERS 1\n\n/* Define if symbols are underscored. */\n#define SYMBOL_UNDERSCORE 1\n\n/* Define this if you are using Purify and want to suppress spurious messages.\n */\n/* #undef USING_PURIFY */\n\n/* Version number of package */\n#define VERSION \"3.1-rc1\"\n\n/* Define WORDS_BIGENDIAN to 1 if your processor stores words with the most\n significant byte first (like Motorola and SPARC, unlike Intel). */\n#if defined AC_APPLE_UNIVERSAL_BUILD\n# if defined __BIG_ENDIAN__\n# define WORDS_BIGENDIAN 1\n# endif\n#else\n# ifndef WORDS_BIGENDIAN\n/* # undef WORDS_BIGENDIAN */\n# endif\n#endif\n\n/* Define to `unsigned int' if does not define. */\n/* #undef size_t */\n\n\n#ifdef HAVE_HIDDEN_VISIBILITY_ATTRIBUTE\n#ifdef LIBFFI_ASM\n#define FFI_HIDDEN(name) .hidden name\n#else\n#define FFI_HIDDEN __attribute__ ((visibility (\"hidden\")))\n#endif\n#else\n#ifdef LIBFFI_ASM\n#define FFI_HIDDEN(name)\n#else\n#define FFI_HIDDEN\n#endif\n#endif\n\n\n\n#endif" }, { "path": "src/ffi/fficonfig_i386.h", "content": "#ifdef __i386__\n\n/* fficonfig.h. Generated from fficonfig.h.in by configure. */\n/* fficonfig.h.in. Generated from configure.ac by autoheader. */\n\n/* Define if building universal (internal helper macro) */\n/* #undef AC_APPLE_UNIVERSAL_BUILD */\n\n/* Define to one of `_getb67', `GETB67', `getb67' for Cray-2 and Cray-YMP\n systems. This function is required for `alloca.c' support on those systems.\n */\n/* #undef CRAY_STACKSEG_END */\n\n/* Define to 1 if using `alloca.c'. */\n/* #undef C_ALLOCA */\n\n/* Define to the flags needed for the .section .eh_frame directive. */\n#define EH_FRAME_FLAGS \"aw\"\n\n/* Define this if you want extra debugging. */\n/* #undef FFI_DEBUG */\n\n/* Cannot use PROT_EXEC on this target, so, we revert to alternative means */\n/* #undef FFI_EXEC_TRAMPOLINE_TABLE */\n\n/* Define this if you want to enable pax emulated trampolines */\n/* #undef FFI_MMAP_EXEC_EMUTRAMP_PAX */\n\n/* Cannot use malloc on this target, so, we revert to alternative means */\n#define FFI_MMAP_EXEC_WRIT 1\n\n/* Define this if you do not want support for the raw API. */\n/* #undef FFI_NO_RAW_API */\n\n/* Define this if you do not want support for aggregate types. */\n/* #undef FFI_NO_STRUCTS */\n\n/* Define to 1 if you have `alloca', as a function or macro. */\n#define HAVE_ALLOCA 1\n\n/* Define to 1 if you have and it should be used (not on Ultrix).\n */\n#define HAVE_ALLOCA_H 1\n\n/* Define if your assembler supports .ascii. */\n/* #undef HAVE_AS_ASCII_PSEUDO_OP */\n\n/* Define if your assembler supports .cfi_* directives. */\n#define HAVE_AS_CFI_PSEUDO_OP 1\n\n/* Define if your assembler supports .register. */\n/* #undef HAVE_AS_REGISTER_PSEUDO_OP */\n\n/* Define if your assembler and linker support unaligned PC relative relocs.\n */\n/* #undef HAVE_AS_SPARC_UA_PCREL */\n\n/* Define if your assembler supports .string. */\n/* #undef HAVE_AS_STRING_PSEUDO_OP */\n\n/* Define if your assembler supports unwind section type. */\n/* #undef HAVE_AS_X86_64_UNWIND_SECTION_TYPE */\n\n/* Define if your assembler supports PC relative relocs. */\n/* #undef HAVE_AS_X86_PCREL */\n\n/* Define to 1 if you have the header file. */\n#define HAVE_DLFCN_H 1\n\n/* Define if __attribute__((visibility(\"hidden\"))) is supported. */\n/* #undef HAVE_HIDDEN_VISIBILITY_ATTRIBUTE */\n\n/* Define to 1 if you have the header file. */\n#define HAVE_INTTYPES_H 1\n\n/* Define if you have the long double type and it is bigger than a double */\n#define HAVE_LONG_DOUBLE 1\n\n/* Define if you support more than one size of the long double type */\n/* #undef HAVE_LONG_DOUBLE_VARIANT */\n\n/* Define to 1 if you have the `memcpy' function. */\n#define HAVE_MEMCPY 1\n\n/* Define to 1 if you have the header file. */\n#define HAVE_MEMORY_H 1\n\n/* Define to 1 if you have the `mmap' function. */\n#define HAVE_MMAP 1\n\n/* Define if mmap with MAP_ANON(YMOUS) works. */\n#define HAVE_MMAP_ANON 1\n\n/* Define if mmap of /dev/zero works. */\n/* #undef HAVE_MMAP_DEV_ZERO */\n\n/* Define if read-only mmap of a plain file works. */\n#define HAVE_MMAP_FILE 1\n\n/* Define if .eh_frame sections should be read-only. */\n/* #undef HAVE_RO_EH_FRAME */\n\n/* Define to 1 if you have the header file. */\n#define HAVE_STDINT_H 1\n\n/* Define to 1 if you have the header file. */\n#define HAVE_STDLIB_H 1\n\n/* Define to 1 if you have the header file. */\n#define HAVE_STRINGS_H 1\n\n/* Define to 1 if you have the header file. */\n#define HAVE_STRING_H 1\n\n/* Define to 1 if you have the header file. */\n#define HAVE_SYS_MMAN_H 1\n\n/* Define to 1 if you have the header file. */\n#define HAVE_SYS_STAT_H 1\n\n/* Define to 1 if you have the header file. */\n#define HAVE_SYS_TYPES_H 1\n\n/* Define to 1 if you have the header file. */\n#define HAVE_UNISTD_H 1\n\n/* Define to the sub-directory in which libtool stores uninstalled libraries.\n */\n#define LT_OBJDIR \".libs/\"\n\n/* Name of package */\n#define PACKAGE \"libffi\"\n\n/* Define to the address where bug reports for this package should be sent. */\n#define PACKAGE_BUGREPORT \"http://github.com/atgreen/libffi/issues\"\n\n/* Define to the full name of this package. */\n#define PACKAGE_NAME \"libffi\"\n\n/* Define to the full name and version of this package. */\n#define PACKAGE_STRING \"libffi 3.1-rc1\"\n\n/* Define to the one symbol short name of this package. */\n#define PACKAGE_TARNAME \"libffi\"\n\n/* Define to the home page for this package. */\n#define PACKAGE_URL \"\"\n\n/* Define to the version of this package. */\n#define PACKAGE_VERSION \"3.1-rc1\"\n\n/* The size of `double', as computed by sizeof. */\n#define SIZEOF_DOUBLE 8\n\n/* The size of `long double', as computed by sizeof. */\n#define SIZEOF_LONG_DOUBLE 16\n\n/* The size of `size_t', as computed by sizeof. */\n#define SIZEOF_SIZE_T 4\n\n/* If using the C implementation of alloca, define if you know the\n direction of stack growth for your system; otherwise it will be\n automatically deduced at runtime.\n\tSTACK_DIRECTION > 0 => grows toward higher addresses\n\tSTACK_DIRECTION < 0 => grows toward lower addresses\n\tSTACK_DIRECTION = 0 => direction of growth unknown */\n/* #undef STACK_DIRECTION */\n\n/* Define to 1 if you have the ANSI C header files. */\n#define STDC_HEADERS 1\n\n/* Define if symbols are underscored. */\n#define SYMBOL_UNDERSCORE 1\n\n/* Define this if you are using Purify and want to suppress spurious messages.\n */\n/* #undef USING_PURIFY */\n\n/* Version number of package */\n#define VERSION \"3.1-rc1\"\n\n/* Define WORDS_BIGENDIAN to 1 if your processor stores words with the most\n significant byte first (like Motorola and SPARC, unlike Intel). */\n#if defined AC_APPLE_UNIVERSAL_BUILD\n# if defined __BIG_ENDIAN__\n# define WORDS_BIGENDIAN 1\n# endif\n#else\n# ifndef WORDS_BIGENDIAN\n/* # undef WORDS_BIGENDIAN */\n# endif\n#endif\n\n/* Define to `unsigned int' if does not define. */\n/* #undef size_t */\n\n\n#ifdef HAVE_HIDDEN_VISIBILITY_ATTRIBUTE\n#ifdef LIBFFI_ASM\n#define FFI_HIDDEN(name) .hidden name\n#else\n#define FFI_HIDDEN __attribute__ ((visibility (\"hidden\")))\n#endif\n#else\n#ifdef LIBFFI_ASM\n#define FFI_HIDDEN(name)\n#else\n#define FFI_HIDDEN\n#endif\n#endif\n\n\n\n#endif" }, { "path": "src/ffi/fficonfig_x86_64.h", "content": "#ifdef __x86_64__\n\n/* fficonfig.h. Generated from fficonfig.h.in by configure. */\n/* fficonfig.h.in. Generated from configure.ac by autoheader. */\n\n/* Define if building universal (internal helper macro) */\n/* #undef AC_APPLE_UNIVERSAL_BUILD */\n\n/* Define to one of `_getb67', `GETB67', `getb67' for Cray-2 and Cray-YMP\n systems. This function is required for `alloca.c' support on those systems.\n */\n/* #undef CRAY_STACKSEG_END */\n\n/* Define to 1 if using `alloca.c'. */\n/* #undef C_ALLOCA */\n\n/* Define to the flags needed for the .section .eh_frame directive. */\n#define EH_FRAME_FLAGS \"aw\"\n\n/* Define this if you want extra debugging. */\n/* #undef FFI_DEBUG */\n\n/* Cannot use PROT_EXEC on this target, so, we revert to alternative means */\n/* #undef FFI_EXEC_TRAMPOLINE_TABLE */\n\n/* Define this if you want to enable pax emulated trampolines */\n/* #undef FFI_MMAP_EXEC_EMUTRAMP_PAX */\n\n/* Cannot use malloc on this target, so, we revert to alternative means */\n#define FFI_MMAP_EXEC_WRIT 1\n\n/* Define this if you do not want support for the raw API. */\n/* #undef FFI_NO_RAW_API */\n\n/* Define this if you do not want support for aggregate types. */\n/* #undef FFI_NO_STRUCTS */\n\n/* Define to 1 if you have `alloca', as a function or macro. */\n#define HAVE_ALLOCA 1\n\n/* Define to 1 if you have and it should be used (not on Ultrix).\n */\n#define HAVE_ALLOCA_H 1\n\n/* Define if your assembler supports .ascii. */\n/* #undef HAVE_AS_ASCII_PSEUDO_OP */\n\n/* Define if your assembler supports .cfi_* directives. */\n#define HAVE_AS_CFI_PSEUDO_OP 1\n\n/* Define if your assembler supports .register. */\n/* #undef HAVE_AS_REGISTER_PSEUDO_OP */\n\n/* Define if your assembler and linker support unaligned PC relative relocs.\n */\n/* #undef HAVE_AS_SPARC_UA_PCREL */\n\n/* Define if your assembler supports .string. */\n/* #undef HAVE_AS_STRING_PSEUDO_OP */\n\n/* Define if your assembler supports unwind section type. */\n/* #undef HAVE_AS_X86_64_UNWIND_SECTION_TYPE */\n\n/* Define if your assembler supports PC relative relocs. */\n/* #undef HAVE_AS_X86_PCREL */\n\n/* Define to 1 if you have the header file. */\n#define HAVE_DLFCN_H 1\n\n/* Define if __attribute__((visibility(\"hidden\"))) is supported. */\n/* #undef HAVE_HIDDEN_VISIBILITY_ATTRIBUTE */\n\n/* Define to 1 if you have the header file. */\n#define HAVE_INTTYPES_H 1\n\n/* Define if you have the long double type and it is bigger than a double */\n#define HAVE_LONG_DOUBLE 1\n\n/* Define if you support more than one size of the long double type */\n/* #undef HAVE_LONG_DOUBLE_VARIANT */\n\n/* Define to 1 if you have the `memcpy' function. */\n#define HAVE_MEMCPY 1\n\n/* Define to 1 if you have the header file. */\n#define HAVE_MEMORY_H 1\n\n/* Define to 1 if you have the `mmap' function. */\n#define HAVE_MMAP 1\n\n/* Define if mmap with MAP_ANON(YMOUS) works. */\n#define HAVE_MMAP_ANON 1\n\n/* Define if mmap of /dev/zero works. */\n/* #undef HAVE_MMAP_DEV_ZERO */\n\n/* Define if read-only mmap of a plain file works. */\n#define HAVE_MMAP_FILE 1\n\n/* Define if .eh_frame sections should be read-only. */\n/* #undef HAVE_RO_EH_FRAME */\n\n/* Define to 1 if you have the header file. */\n#define HAVE_STDINT_H 1\n\n/* Define to 1 if you have the header file. */\n#define HAVE_STDLIB_H 1\n\n/* Define to 1 if you have the header file. */\n#define HAVE_STRINGS_H 1\n\n/* Define to 1 if you have the header file. */\n#define HAVE_STRING_H 1\n\n/* Define to 1 if you have the header file. */\n#define HAVE_SYS_MMAN_H 1\n\n/* Define to 1 if you have the header file. */\n#define HAVE_SYS_STAT_H 1\n\n/* Define to 1 if you have the header file. */\n#define HAVE_SYS_TYPES_H 1\n\n/* Define to 1 if you have the header file. */\n#define HAVE_UNISTD_H 1\n\n/* Define to the sub-directory in which libtool stores uninstalled libraries.\n */\n#define LT_OBJDIR \".libs/\"\n\n/* Name of package */\n#define PACKAGE \"libffi\"\n\n/* Define to the address where bug reports for this package should be sent. */\n#define PACKAGE_BUGREPORT \"http://github.com/atgreen/libffi/issues\"\n\n/* Define to the full name of this package. */\n#define PACKAGE_NAME \"libffi\"\n\n/* Define to the full name and version of this package. */\n#define PACKAGE_STRING \"libffi 3.1-rc1\"\n\n/* Define to the one symbol short name of this package. */\n#define PACKAGE_TARNAME \"libffi\"\n\n/* Define to the home page for this package. */\n#define PACKAGE_URL \"\"\n\n/* Define to the version of this package. */\n#define PACKAGE_VERSION \"3.1-rc1\"\n\n/* The size of `double', as computed by sizeof. */\n#define SIZEOF_DOUBLE 8\n\n/* The size of `long double', as computed by sizeof. */\n#define SIZEOF_LONG_DOUBLE 16\n\n/* The size of `size_t', as computed by sizeof. */\n#define SIZEOF_SIZE_T 8\n\n/* If using the C implementation of alloca, define if you know the\n direction of stack growth for your system; otherwise it will be\n automatically deduced at runtime.\n\tSTACK_DIRECTION > 0 => grows toward higher addresses\n\tSTACK_DIRECTION < 0 => grows toward lower addresses\n\tSTACK_DIRECTION = 0 => direction of growth unknown */\n/* #undef STACK_DIRECTION */\n\n/* Define to 1 if you have the ANSI C header files. */\n#define STDC_HEADERS 1\n\n/* Define if symbols are underscored. */\n#define SYMBOL_UNDERSCORE 1\n\n/* Define this if you are using Purify and want to suppress spurious messages.\n */\n/* #undef USING_PURIFY */\n\n/* Version number of package */\n#define VERSION \"3.1-rc1\"\n\n/* Define WORDS_BIGENDIAN to 1 if your processor stores words with the most\n significant byte first (like Motorola and SPARC, unlike Intel). */\n#if defined AC_APPLE_UNIVERSAL_BUILD\n# if defined __BIG_ENDIAN__\n# define WORDS_BIGENDIAN 1\n# endif\n#else\n# ifndef WORDS_BIGENDIAN\n/* # undef WORDS_BIGENDIAN */\n# endif\n#endif\n\n/* Define to `unsigned int' if does not define. */\n/* #undef size_t */\n\n\n#ifdef HAVE_HIDDEN_VISIBILITY_ATTRIBUTE\n#ifdef LIBFFI_ASM\n#define FFI_HIDDEN(name) .hidden name\n#else\n#define FFI_HIDDEN __attribute__ ((visibility (\"hidden\")))\n#endif\n#else\n#ifdef LIBFFI_ASM\n#define FFI_HIDDEN(name)\n#else\n#define FFI_HIDDEN\n#endif\n#endif\n\n\n\n#endif" }, { "path": "src/ffi/ffitarget.h", "content": "#ifdef __arm64__\n\n#include \"ffitarget_arm64.h\"\n\n\n#endif\n#ifdef __i386__\n\n#include \"ffitarget_i386.h\"\n\n\n#endif\n#ifdef __arm__\n\n#include \"ffitarget_armv7.h\"\n\n\n#endif\n#ifdef __x86_64__\n\n#include \"ffitarget_x86_64.h\"\n\n\n#endif\n" }, { "path": "src/ffi/ffitarget_arm64.h", "content": "#ifdef __arm64__\n\n/* Copyright (c) 2009, 2010, 2011, 2012 ARM Ltd.\n\nPermission is hereby granted, free of charge, to any person obtaining\na copy of this software and associated documentation files (the\n``Software''), to deal in the Software without restriction, including\nwithout limitation the rights to use, copy, modify, merge, publish,\ndistribute, sublicense, and/or sell copies of the Software, and to\npermit persons to whom the Software is furnished to do so, subject to\nthe following conditions:\n\nThe above copyright notice and this permission notice shall be\nincluded in all copies or substantial portions of the Software.\n\nTHE SOFTWARE IS PROVIDED ``AS IS'', WITHOUT WARRANTY OF ANY KIND,\nEXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\nMERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.\nIN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY\nCLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,\nTORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE\nSOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. */\n\n#ifndef LIBFFI_TARGET_H\n#define LIBFFI_TARGET_H\n\n#ifndef LIBFFI_H\n#error \"Please do not include ffitarget.h directly into your source. Use ffi.h instead.\"\n#endif\n\n#ifndef LIBFFI_ASM\ntypedef unsigned long ffi_arg;\ntypedef signed long ffi_sarg;\n\ntypedef enum ffi_abi\n {\n FFI_FIRST_ABI = 0,\n FFI_SYSV,\n FFI_LAST_ABI,\n FFI_DEFAULT_ABI = FFI_SYSV\n } ffi_abi;\n#endif\n\n/* ---- Definitions for closures ----------------------------------------- */\n\n#define FFI_CLOSURES 1\n#define FFI_TRAMPOLINE_SIZE 36\n#define FFI_NATIVE_RAW_API 0\n\n/* ---- Internal ---- */\n\n\n#define FFI_EXTRA_CIF_FIELDS unsigned aarch64_flags\n\n#define AARCH64_FFI_WITH_V_BIT 0\n\n#define AARCH64_N_XREG 32\n#define AARCH64_N_VREG 32\n#define AARCH64_CALL_CONTEXT_SIZE (AARCH64_N_XREG * 8 + AARCH64_N_VREG * 16)\n\n#endif\n\n\n#endif" }, { "path": "src/ffi/ffitarget_armv7.h", "content": "#ifdef __arm__\n\n/* -----------------------------------------------------------------*-C-*-\n ffitarget.h - Copyright (c) 2012 Anthony Green\n Copyright (c) 2010 CodeSourcery\n Copyright (c) 1996-2003 Red Hat, Inc.\n\n Target configuration macros for ARM.\n\n Permission is hereby granted, free of charge, to any person obtaining\n a copy of this software and associated documentation files (the\n ``Software''), to deal in the Software without restriction, including\n without limitation the rights to use, copy, modify, merge, publish,\n distribute, sublicense, and/or sell copies of the Software, and to\n permit persons to whom the Software is furnished to do so, subject to\n the following conditions:\n\n The above copyright notice and this permission notice shall be included\n in all copies or substantial portions of the Software.\n\n THE SOFTWARE IS PROVIDED ``AS IS'', WITHOUT WARRANTY OF ANY KIND,\n EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\n MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND\n NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT\n HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,\n WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER\n DEALINGS IN THE SOFTWARE.\n\n ----------------------------------------------------------------------- */\n\n#ifndef LIBFFI_TARGET_H\n#define LIBFFI_TARGET_H\n\n#ifndef LIBFFI_H\n#error \"Please do not include ffitarget.h directly into your source. Use ffi.h instead.\"\n#endif\n\n#ifndef LIBFFI_ASM\ntypedef unsigned long ffi_arg;\ntypedef signed long ffi_sarg;\n\ntypedef enum ffi_abi {\n FFI_FIRST_ABI = 0,\n FFI_SYSV,\n FFI_VFP,\n FFI_LAST_ABI,\n#ifdef __ARM_PCS_VFP\n FFI_DEFAULT_ABI = FFI_VFP,\n#else\n FFI_DEFAULT_ABI = FFI_SYSV,\n#endif\n} ffi_abi;\n#endif\n\n#define FFI_EXTRA_CIF_FIELDS\t\t\t\\\n int vfp_used;\t\t\t\t\t\\\n short vfp_reg_free, vfp_nargs;\t\t\\\n signed char vfp_args[16]\t\t\t\\\n\n/* Internally used. */\n#define FFI_TYPE_STRUCT_VFP_FLOAT (FFI_TYPE_LAST + 1)\n#define FFI_TYPE_STRUCT_VFP_DOUBLE (FFI_TYPE_LAST + 2)\n\n#define FFI_TARGET_SPECIFIC_VARIADIC\n\n/* ---- Definitions for closures ----------------------------------------- */\n\n#define FFI_CLOSURES 1\n#define FFI_TRAMPOLINE_SIZE 20\n#define FFI_NATIVE_RAW_API 0\n\n#endif\n\n\n#endif" }, { "path": "src/ffi/ffitarget_i386.h", "content": "#ifdef __i386__\n\n/* -----------------------------------------------------------------*-C-*-\n ffitarget.h - Copyright (c) 2012 Anthony Green\n Copyright (c) 1996-2003, 2010 Red Hat, Inc.\n Copyright (C) 2008 Free Software Foundation, Inc.\n\n Target configuration macros for x86 and x86-64.\n\n Permission is hereby granted, free of charge, to any person obtaining\n a copy of this software and associated documentation files (the\n ``Software''), to deal in the Software without restriction, including\n without limitation the rights to use, copy, modify, merge, publish,\n distribute, sublicense, and/or sell copies of the Software, and to\n permit persons to whom the Software is furnished to do so, subject to\n the following conditions:\n\n The above copyright notice and this permission notice shall be included\n in all copies or substantial portions of the Software.\n\n THE SOFTWARE IS PROVIDED ``AS IS'', WITHOUT WARRANTY OF ANY KIND,\n EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\n MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND\n NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT\n HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,\n WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER\n DEALINGS IN THE SOFTWARE.\n\n ----------------------------------------------------------------------- */\n\n#ifndef LIBFFI_TARGET_H\n#define LIBFFI_TARGET_H\n\n#ifndef LIBFFI_H\n#error \"Please do not include ffitarget.h directly into your source. Use ffi.h instead.\"\n#endif\n\n/* ---- System specific configurations ----------------------------------- */\n\n/* For code common to all platforms on x86 and x86_64. */\n#define X86_ANY\n\n#if defined (X86_64) && defined (__i386__)\n#undef X86_64\n#define X86\n#endif\n\n#ifdef X86_WIN64\n#define FFI_SIZEOF_ARG 8\n#define USE_BUILTIN_FFS 0 /* not yet implemented in mingw-64 */\n#endif\n\n/* ---- Generic type definitions ----------------------------------------- */\n\n#ifndef LIBFFI_ASM\n#ifdef X86_WIN64\n#ifdef _MSC_VER\ntypedef unsigned __int64 ffi_arg;\ntypedef __int64 ffi_sarg;\n#else\ntypedef unsigned long long ffi_arg;\ntypedef long long ffi_sarg;\n#endif\n#else\n#if defined __x86_64__ && defined __ILP32__\n#define FFI_SIZEOF_ARG 8\n#define FFI_SIZEOF_JAVA_RAW 4\ntypedef unsigned long long ffi_arg;\ntypedef long long ffi_sarg;\n#else\ntypedef unsigned long ffi_arg;\ntypedef signed long ffi_sarg;\n#endif\n#endif\n\ntypedef enum ffi_abi {\n FFI_FIRST_ABI = 0,\n\n /* ---- Intel x86 Win32 ---------- */\n#ifdef X86_WIN32\n FFI_SYSV,\n FFI_STDCALL,\n FFI_THISCALL,\n FFI_FASTCALL,\n FFI_MS_CDECL,\n FFI_LAST_ABI,\n#ifdef _MSC_VER\n FFI_DEFAULT_ABI = FFI_MS_CDECL\n#else\n FFI_DEFAULT_ABI = FFI_SYSV\n#endif\n\n#elif defined(X86_WIN64)\n FFI_WIN64,\n FFI_LAST_ABI,\n FFI_DEFAULT_ABI = FFI_WIN64\n\n#else\n /* ---- Intel x86 and AMD x86-64 - */\n FFI_SYSV,\n FFI_UNIX64, /* Unix variants all use the same ABI for x86-64 */\n FFI_THISCALL,\n FFI_FASTCALL,\n FFI_STDCALL,\n FFI_LAST_ABI,\n#if defined(__i386__) || defined(__i386)\n FFI_DEFAULT_ABI = FFI_SYSV\n#else\n FFI_DEFAULT_ABI = FFI_UNIX64\n#endif\n#endif\n} ffi_abi;\n#endif\n\n/* ---- Definitions for closures ----------------------------------------- */\n\n#define FFI_CLOSURES 1\n#define FFI_TYPE_SMALL_STRUCT_1B (FFI_TYPE_LAST + 1)\n#define FFI_TYPE_SMALL_STRUCT_2B (FFI_TYPE_LAST + 2)\n#define FFI_TYPE_SMALL_STRUCT_4B (FFI_TYPE_LAST + 3)\n#define FFI_TYPE_MS_STRUCT (FFI_TYPE_LAST + 4)\n\n#if defined (X86_64) || (defined (__x86_64__) && defined (X86_DARWIN))\n#define FFI_TRAMPOLINE_SIZE 24\n#define FFI_NATIVE_RAW_API 0\n#elif defined(X86_WIN64)\n#define FFI_TRAMPOLINE_SIZE 29\n#define FFI_NATIVE_RAW_API 0\n#define FFI_NO_RAW_API 1\n#else\n#define FFI_TRAMPOLINE_SIZE 52\n#define FFI_NATIVE_RAW_API 1\t/* x86 has native raw api support */\n#endif\n\n#endif\n\n\n\n#endif" }, { "path": "src/ffi/ffitarget_x86_64.h", "content": "#ifdef __x86_64__\n\n/* -----------------------------------------------------------------*-C-*-\n ffitarget.h - Copyright (c) 2012 Anthony Green\n Copyright (c) 1996-2003, 2010 Red Hat, Inc.\n Copyright (C) 2008 Free Software Foundation, Inc.\n\n Target configuration macros for x86 and x86-64.\n\n Permission is hereby granted, free of charge, to any person obtaining\n a copy of this software and associated documentation files (the\n ``Software''), to deal in the Software without restriction, including\n without limitation the rights to use, copy, modify, merge, publish,\n distribute, sublicense, and/or sell copies of the Software, and to\n permit persons to whom the Software is furnished to do so, subject to\n the following conditions:\n\n The above copyright notice and this permission notice shall be included\n in all copies or substantial portions of the Software.\n\n THE SOFTWARE IS PROVIDED ``AS IS'', WITHOUT WARRANTY OF ANY KIND,\n EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\n MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND\n NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT\n HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,\n WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER\n DEALINGS IN THE SOFTWARE.\n\n ----------------------------------------------------------------------- */\n\n#ifndef LIBFFI_TARGET_H\n#define LIBFFI_TARGET_H\n\n#ifndef LIBFFI_H\n#error \"Please do not include ffitarget.h directly into your source. Use ffi.h instead.\"\n#endif\n\n/* ---- System specific configurations ----------------------------------- */\n\n/* For code common to all platforms on x86 and x86_64. */\n#define X86_ANY\n\n#if defined (X86_64) && defined (__i386__)\n#undef X86_64\n#define X86\n#endif\n\n#ifdef X86_WIN64\n#define FFI_SIZEOF_ARG 8\n#define USE_BUILTIN_FFS 0 /* not yet implemented in mingw-64 */\n#endif\n\n/* ---- Generic type definitions ----------------------------------------- */\n\n#ifndef LIBFFI_ASM\n#ifdef X86_WIN64\n#ifdef _MSC_VER\ntypedef unsigned __int64 ffi_arg;\ntypedef __int64 ffi_sarg;\n#else\ntypedef unsigned long long ffi_arg;\ntypedef long long ffi_sarg;\n#endif\n#else\n#if defined __x86_64__ && defined __ILP32__\n#define FFI_SIZEOF_ARG 8\n#define FFI_SIZEOF_JAVA_RAW 4\ntypedef unsigned long long ffi_arg;\ntypedef long long ffi_sarg;\n#else\ntypedef unsigned long ffi_arg;\ntypedef signed long ffi_sarg;\n#endif\n#endif\n\ntypedef enum ffi_abi {\n FFI_FIRST_ABI = 0,\n\n /* ---- Intel x86 Win32 ---------- */\n#ifdef X86_WIN32\n FFI_SYSV,\n FFI_STDCALL,\n FFI_THISCALL,\n FFI_FASTCALL,\n FFI_MS_CDECL,\n FFI_LAST_ABI,\n#ifdef _MSC_VER\n FFI_DEFAULT_ABI = FFI_MS_CDECL\n#else\n FFI_DEFAULT_ABI = FFI_SYSV\n#endif\n\n#elif defined(X86_WIN64)\n FFI_WIN64,\n FFI_LAST_ABI,\n FFI_DEFAULT_ABI = FFI_WIN64\n\n#else\n /* ---- Intel x86 and AMD x86-64 - */\n FFI_SYSV,\n FFI_UNIX64, /* Unix variants all use the same ABI for x86-64 */\n FFI_THISCALL,\n FFI_FASTCALL,\n FFI_STDCALL,\n FFI_LAST_ABI,\n#if defined(__i386__) || defined(__i386)\n FFI_DEFAULT_ABI = FFI_SYSV\n#else\n FFI_DEFAULT_ABI = FFI_UNIX64\n#endif\n#endif\n} ffi_abi;\n#endif\n\n/* ---- Definitions for closures ----------------------------------------- */\n\n#define FFI_CLOSURES 1\n#define FFI_TYPE_SMALL_STRUCT_1B (FFI_TYPE_LAST + 1)\n#define FFI_TYPE_SMALL_STRUCT_2B (FFI_TYPE_LAST + 2)\n#define FFI_TYPE_SMALL_STRUCT_4B (FFI_TYPE_LAST + 3)\n#define FFI_TYPE_MS_STRUCT (FFI_TYPE_LAST + 4)\n\n#if defined (X86_64) || (defined (__x86_64__) && defined (X86_DARWIN))\n#define FFI_TRAMPOLINE_SIZE 24\n#define FFI_NATIVE_RAW_API 0\n#elif defined(X86_WIN64)\n#define FFI_TRAMPOLINE_SIZE 29\n#define FFI_NATIVE_RAW_API 0\n#define FFI_NO_RAW_API 1\n#else\n#define FFI_TRAMPOLINE_SIZE 52\n#define FFI_NATIVE_RAW_API 1\t/* x86 has native raw api support */\n#endif\n\n#endif\n\n\n\n#endif" }, { "path": "src/jvm/clojure/asm/AnnotationVisitor.java", "content": "/***\n * ASM: a very small and fast Java bytecode manipulation framework\n * Copyright (c) 2000-2011 INRIA, France Telecom\n * All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions\n * are met:\n * 1. Redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer.\n * 2. Redistributions in binary form must reproduce the above copyright\n * notice, this list of conditions and the following disclaimer in the\n * documentation and/or other materials provided with the distribution.\n * 3. Neither the name of the copyright holders nor the names of its\n * contributors may be used to endorse or promote products derived from\n * this software without specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\n * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\n * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE\n * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR\n * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF\n * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\n * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN\n * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\n * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF\n * THE POSSIBILITY OF SUCH DAMAGE.\n */\npackage clojure.asm;\n\n/**\n * A visitor to visit a Java annotation. The methods of this class must be\n * called in the following order: ( visit | visitEnum |\n * visitAnnotation | visitArray )* visitEnd.\n *\n * @author Eric Bruneton\n * @author Eugene Kuleshov\n */\npublic abstract class AnnotationVisitor {\n\n /**\n * The ASM API version implemented by this visitor. The value of this field\n * must be one of {@link Opcodes#ASM4}.\n */\n protected final int api;\n\n /**\n * The annotation visitor to which this visitor must delegate method calls.\n * May be null.\n */\n protected AnnotationVisitor av;\n\n /**\n * Constructs a new {@link AnnotationVisitor}.\n *\n * @param api\n * the ASM API version implemented by this visitor. Must be one\n * of {@link Opcodes#ASM4}.\n */\n public AnnotationVisitor(final int api) {\n this(api, null);\n }\n\n /**\n * Constructs a new {@link AnnotationVisitor}.\n *\n * @param api\n * the ASM API version implemented by this visitor. Must be one\n * of {@link Opcodes#ASM4}.\n * @param av\n * the annotation visitor to which this visitor must delegate\n * method calls. May be null.\n */\n public AnnotationVisitor(final int api, final AnnotationVisitor av) {\n if (api != Opcodes.ASM4) {\n throw new IllegalArgumentException();\n }\n this.api = api;\n this.av = av;\n }\n\n /**\n * Visits a primitive value of the annotation.\n *\n * @param name\n * the value name.\n * @param value\n * the actual value, whose type must be {@link Byte},\n * {@link Boolean}, {@link Character}, {@link Short},\n * {@link Integer} , {@link Long}, {@link Float}, {@link Double},\n * {@link String} or {@link Type} or OBJECT or ARRAY sort. This\n * value can also be an array of byte, boolean, short, char, int,\n * long, float or double values (this is equivalent to using\n * {@link #visitArray visitArray} and visiting each array element\n * in turn, but is more convenient).\n */\n public void visit(String name, Object value) {\n if (av != null) {\n av.visit(name, value);\n }\n }\n\n /**\n * Visits an enumeration value of the annotation.\n *\n * @param name\n * the value name.\n * @param desc\n * the class descriptor of the enumeration class.\n * @param value\n * the actual enumeration value.\n */\n public void visitEnum(String name, String desc, String value) {\n if (av != null) {\n av.visitEnum(name, desc, value);\n }\n }\n\n /**\n * Visits a nested annotation value of the annotation.\n *\n * @param name\n * the value name.\n * @param desc\n * the class descriptor of the nested annotation class.\n * @return a visitor to visit the actual nested annotation value, or\n * null if this visitor is not interested in visiting this\n * nested annotation. The nested annotation value must be fully\n * visited before calling other methods on this annotation\n * visitor.\n */\n public AnnotationVisitor visitAnnotation(String name, String desc) {\n if (av != null) {\n return av.visitAnnotation(name, desc);\n }\n return null;\n }\n\n /**\n * Visits an array value of the annotation. Note that arrays of primitive\n * types (such as byte, boolean, short, char, int, long, float or double)\n * can be passed as value to {@link #visit visit}. This is what\n * {@link ClassReader} does.\n *\n * @param name\n * the value name.\n * @return a visitor to visit the actual array value elements, or\n * null if this visitor is not interested in visiting these\n * values. The 'name' parameters passed to the methods of this\n * visitor are ignored. All the array values must be visited\n * before calling other methods on this annotation visitor.\n */\n public AnnotationVisitor visitArray(String name) {\n if (av != null) {\n return av.visitArray(name);\n }\n return null;\n }\n\n /**\n * Visits the end of the annotation.\n */\n public void visitEnd() {\n if (av != null) {\n av.visitEnd();\n }\n }\n}\n" }, { "path": "src/jvm/clojure/asm/AnnotationWriter.java", "content": "/***\n * ASM: a very small and fast Java bytecode manipulation framework\n * Copyright (c) 2000-2011 INRIA, France Telecom\n * All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions\n * are met:\n * 1. Redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer.\n * 2. Redistributions in binary form must reproduce the above copyright\n * notice, this list of conditions and the following disclaimer in the\n * documentation and/or other materials provided with the distribution.\n * 3. Neither the name of the copyright holders nor the names of its\n * contributors may be used to endorse or promote products derived from\n * this software without specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\n * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\n * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE\n * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR\n * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF\n * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\n * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN\n * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\n * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF\n * THE POSSIBILITY OF SUCH DAMAGE.\n */\npackage clojure.asm;\n\n/**\n * An {@link AnnotationVisitor} that generates annotations in bytecode form.\n *\n * @author Eric Bruneton\n * @author Eugene Kuleshov\n */\nfinal class AnnotationWriter extends AnnotationVisitor {\n\n /**\n * The class writer to which this annotation must be added.\n */\n private final ClassWriter cw;\n\n /**\n * The number of values in this annotation.\n */\n private int size;\n\n /**\n * true if values are named, false otherwise. Annotation\n * writers used for annotation default and annotation arrays use unnamed\n * values.\n */\n private final boolean named;\n\n /**\n * The annotation values in bytecode form. This byte vector only contains\n * the values themselves, i.e. the number of values must be stored as a\n * unsigned short just before these bytes.\n */\n private final ByteVector bv;\n\n /**\n * The byte vector to be used to store the number of values of this\n * annotation. See {@link #bv}.\n */\n private final ByteVector parent;\n\n /**\n * Where the number of values of this annotation must be stored in\n * {@link #parent}.\n */\n private final int offset;\n\n /**\n * Next annotation writer. This field is used to store annotation lists.\n */\n AnnotationWriter next;\n\n /**\n * Previous annotation writer. This field is used to store annotation lists.\n */\n AnnotationWriter prev;\n\n // ------------------------------------------------------------------------\n // Constructor\n // ------------------------------------------------------------------------\n\n /**\n * Constructs a new {@link AnnotationWriter}.\n *\n * @param cw\n * the class writer to which this annotation must be added.\n * @param named\n * true if values are named, false otherwise.\n * @param bv\n * where the annotation values must be stored.\n * @param parent\n * where the number of annotation values must be stored.\n * @param offset\n * where in parent the number of annotation values must\n * be stored.\n */\n AnnotationWriter(final ClassWriter cw, final boolean named,\n final ByteVector bv, final ByteVector parent, final int offset) {\n super(Opcodes.ASM4);\n this.cw = cw;\n this.named = named;\n this.bv = bv;\n this.parent = parent;\n this.offset = offset;\n }\n\n // ------------------------------------------------------------------------\n // Implementation of the AnnotationVisitor abstract class\n // ------------------------------------------------------------------------\n\n @Override\n public void visit(final String name, final Object value) {\n ++size;\n if (named) {\n bv.putShort(cw.newUTF8(name));\n }\n if (value instanceof String) {\n bv.put12('s', cw.newUTF8((String) value));\n } else if (value instanceof Byte) {\n bv.put12('B', cw.newInteger(((Byte) value).byteValue()).index);\n } else if (value instanceof Boolean) {\n int v = ((Boolean) value).booleanValue() ? 1 : 0;\n bv.put12('Z', cw.newInteger(v).index);\n } else if (value instanceof Character) {\n bv.put12('C', cw.newInteger(((Character) value).charValue()).index);\n } else if (value instanceof Short) {\n bv.put12('S', cw.newInteger(((Short) value).shortValue()).index);\n } else if (value instanceof Type) {\n bv.put12('c', cw.newUTF8(((Type) value).getDescriptor()));\n } else if (value instanceof byte[]) {\n byte[] v = (byte[]) value;\n bv.put12('[', v.length);\n for (int i = 0; i < v.length; i++) {\n bv.put12('B', cw.newInteger(v[i]).index);\n }\n } else if (value instanceof boolean[]) {\n boolean[] v = (boolean[]) value;\n bv.put12('[', v.length);\n for (int i = 0; i < v.length; i++) {\n bv.put12('Z', cw.newInteger(v[i] ? 1 : 0).index);\n }\n } else if (value instanceof short[]) {\n short[] v = (short[]) value;\n bv.put12('[', v.length);\n for (int i = 0; i < v.length; i++) {\n bv.put12('S', cw.newInteger(v[i]).index);\n }\n } else if (value instanceof char[]) {\n char[] v = (char[]) value;\n bv.put12('[', v.length);\n for (int i = 0; i < v.length; i++) {\n bv.put12('C', cw.newInteger(v[i]).index);\n }\n } else if (value instanceof int[]) {\n int[] v = (int[]) value;\n bv.put12('[', v.length);\n for (int i = 0; i < v.length; i++) {\n bv.put12('I', cw.newInteger(v[i]).index);\n }\n } else if (value instanceof long[]) {\n long[] v = (long[]) value;\n bv.put12('[', v.length);\n for (int i = 0; i < v.length; i++) {\n bv.put12('J', cw.newLong(v[i]).index);\n }\n } else if (value instanceof float[]) {\n float[] v = (float[]) value;\n bv.put12('[', v.length);\n for (int i = 0; i < v.length; i++) {\n bv.put12('F', cw.newFloat(v[i]).index);\n }\n } else if (value instanceof double[]) {\n double[] v = (double[]) value;\n bv.put12('[', v.length);\n for (int i = 0; i < v.length; i++) {\n bv.put12('D', cw.newDouble(v[i]).index);\n }\n } else {\n Item i = cw.newConstItem(value);\n bv.put12(\".s.IFJDCS\".charAt(i.type), i.index);\n }\n }\n\n @Override\n public void visitEnum(final String name, final String desc,\n final String value) {\n ++size;\n if (named) {\n bv.putShort(cw.newUTF8(name));\n }\n bv.put12('e', cw.newUTF8(desc)).putShort(cw.newUTF8(value));\n }\n\n @Override\n public AnnotationVisitor visitAnnotation(final String name,\n final String desc) {\n ++size;\n if (named) {\n bv.putShort(cw.newUTF8(name));\n }\n // write tag and type, and reserve space for values count\n bv.put12('@', cw.newUTF8(desc)).putShort(0);\n return new AnnotationWriter(cw, true, bv, bv, bv.length - 2);\n }\n\n @Override\n public AnnotationVisitor visitArray(final String name) {\n ++size;\n if (named) {\n bv.putShort(cw.newUTF8(name));\n }\n // write tag, and reserve space for array size\n bv.put12('[', 0);\n return new AnnotationWriter(cw, false, bv, bv, bv.length - 2);\n }\n\n @Override\n public void visitEnd() {\n if (parent != null) {\n byte[] data = parent.data;\n data[offset] = (byte) (size >>> 8);\n data[offset + 1] = (byte) size;\n }\n }\n\n // ------------------------------------------------------------------------\n // Utility methods\n // ------------------------------------------------------------------------\n\n /**\n * Returns the size of this annotation writer list.\n *\n * @return the size of this annotation writer list.\n */\n int getSize() {\n int size = 0;\n AnnotationWriter aw = this;\n while (aw != null) {\n size += aw.bv.length;\n aw = aw.next;\n }\n return size;\n }\n\n /**\n * Puts the annotations of this annotation writer list into the given byte\n * vector.\n *\n * @param out\n * where the annotations must be put.\n */\n void put(final ByteVector out) {\n int n = 0;\n int size = 2;\n AnnotationWriter aw = this;\n AnnotationWriter last = null;\n while (aw != null) {\n ++n;\n size += aw.bv.length;\n aw.visitEnd(); // in case user forgot to call visitEnd\n aw.prev = last;\n last = aw;\n aw = aw.next;\n }\n out.putInt(size);\n out.putShort(n);\n aw = last;\n while (aw != null) {\n out.putByteArray(aw.bv.data, 0, aw.bv.length);\n aw = aw.prev;\n }\n }\n\n /**\n * Puts the given annotation lists into the given byte vector.\n *\n * @param panns\n * an array of annotation writer lists.\n * @param off\n * index of the first annotation to be written.\n * @param out\n * where the annotations must be put.\n */\n static void put(final AnnotationWriter[] panns, final int off,\n final ByteVector out) {\n int size = 1 + 2 * (panns.length - off);\n for (int i = off; i < panns.length; ++i) {\n size += panns[i] == null ? 0 : panns[i].getSize();\n }\n out.putInt(size).putByte(panns.length - off);\n for (int i = off; i < panns.length; ++i) {\n AnnotationWriter aw = panns[i];\n AnnotationWriter last = null;\n int n = 0;\n while (aw != null) {\n ++n;\n aw.visitEnd(); // in case user forgot to call visitEnd\n aw.prev = last;\n last = aw;\n aw = aw.next;\n }\n out.putShort(n);\n aw = last;\n while (aw != null) {\n out.putByteArray(aw.bv.data, 0, aw.bv.length);\n aw = aw.prev;\n }\n }\n }\n}\n" }, { "path": "src/jvm/clojure/asm/Attribute.java", "content": "/***\n * ASM: a very small and fast Java bytecode manipulation framework\n * Copyright (c) 2000-2011 INRIA, France Telecom\n * All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions\n * are met:\n * 1. Redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer.\n * 2. Redistributions in binary form must reproduce the above copyright\n * notice, this list of conditions and the following disclaimer in the\n * documentation and/or other materials provided with the distribution.\n * 3. Neither the name of the copyright holders nor the names of its\n * contributors may be used to endorse or promote products derived from\n * this software without specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\n * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\n * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE\n * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR\n * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF\n * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\n * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN\n * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\n * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF\n * THE POSSIBILITY OF SUCH DAMAGE.\n */\npackage clojure.asm;\n\n/**\n * A non standard class, field, method or code attribute.\n *\n * @author Eric Bruneton\n * @author Eugene Kuleshov\n */\npublic class Attribute {\n\n /**\n * The type of this attribute.\n */\n public final String type;\n\n /**\n * The raw value of this attribute, used only for unknown attributes.\n */\n byte[] value;\n\n /**\n * The next attribute in this attribute list. May be null.\n */\n Attribute next;\n\n /**\n * Constructs a new empty attribute.\n *\n * @param type\n * the type of the attribute.\n */\n protected Attribute(final String type) {\n this.type = type;\n }\n\n /**\n * Returns true if this type of attribute is unknown. The default\n * implementation of this method always returns true.\n *\n * @return true if this type of attribute is unknown.\n */\n public boolean isUnknown() {\n return true;\n }\n\n /**\n * Returns true if this type of attribute is a code attribute.\n *\n * @return true if this type of attribute is a code attribute.\n */\n public boolean isCodeAttribute() {\n return false;\n }\n\n /**\n * Returns the labels corresponding to this attribute.\n *\n * @return the labels corresponding to this attribute, or null if\n * this attribute is not a code attribute that contains labels.\n */\n protected Label[] getLabels() {\n return null;\n }\n\n /**\n * Reads a {@link #type type} attribute. This method must return a\n * new {@link Attribute} object, of type {@link #type type},\n * corresponding to the len bytes starting at the given offset, in\n * the given class reader.\n *\n * @param cr\n * the class that contains the attribute to be read.\n * @param off\n * index of the first byte of the attribute's content in\n * {@link ClassReader#b cr.b}. The 6 attribute header bytes,\n * containing the type and the length of the attribute, are not\n * taken into account here.\n * @param len\n * the length of the attribute's content.\n * @param buf\n * buffer to be used to call {@link ClassReader#readUTF8\n * readUTF8}, {@link ClassReader#readClass(int,char[]) readClass}\n * or {@link ClassReader#readConst readConst}.\n * @param codeOff\n * index of the first byte of code's attribute content in\n * {@link ClassReader#b cr.b}, or -1 if the attribute to be read\n * is not a code attribute. The 6 attribute header bytes,\n * containing the type and the length of the attribute, are not\n * taken into account here.\n * @param labels\n * the labels of the method's code, or null if the\n * attribute to be read is not a code attribute.\n * @return a new {@link Attribute} object corresponding to the given\n * bytes.\n */\n protected Attribute read(final ClassReader cr, final int off,\n final int len, final char[] buf, final int codeOff,\n final Label[] labels) {\n Attribute attr = new Attribute(type);\n attr.value = new byte[len];\n System.arraycopy(cr.b, off, attr.value, 0, len);\n return attr;\n }\n\n /**\n * Returns the byte array form of this attribute.\n *\n * @param cw\n * the class to which this attribute must be added. This\n * parameter can be used to add to the constant pool of this\n * class the items that corresponds to this attribute.\n * @param code\n * the bytecode of the method corresponding to this code\n * attribute, or null if this attribute is not a code\n * attributes.\n * @param len\n * the length of the bytecode of the method corresponding to this\n * code attribute, or null if this attribute is not a\n * code attribute.\n * @param maxStack\n * the maximum stack size of the method corresponding to this\n * code attribute, or -1 if this attribute is not a code\n * attribute.\n * @param maxLocals\n * the maximum number of local variables of the method\n * corresponding to this code attribute, or -1 if this attribute\n * is not a code attribute.\n * @return the byte array form of this attribute.\n */\n protected ByteVector write(final ClassWriter cw, final byte[] code,\n final int len, final int maxStack, final int maxLocals) {\n ByteVector v = new ByteVector();\n v.data = value;\n v.length = value.length;\n return v;\n }\n\n /**\n * Returns the length of the attribute list that begins with this attribute.\n *\n * @return the length of the attribute list that begins with this attribute.\n */\n final int getCount() {\n int count = 0;\n Attribute attr = this;\n while (attr != null) {\n count += 1;\n attr = attr.next;\n }\n return count;\n }\n\n /**\n * Returns the size of all the attributes in this attribute list.\n *\n * @param cw\n * the class writer to be used to convert the attributes into\n * byte arrays, with the {@link #write write} method.\n * @param code\n * the bytecode of the method corresponding to these code\n * attributes, or null if these attributes are not code\n * attributes.\n * @param len\n * the length of the bytecode of the method corresponding to\n * these code attributes, or null if these attributes\n * are not code attributes.\n * @param maxStack\n * the maximum stack size of the method corresponding to these\n * code attributes, or -1 if these attributes are not code\n * attributes.\n * @param maxLocals\n * the maximum number of local variables of the method\n * corresponding to these code attributes, or -1 if these\n * attributes are not code attributes.\n * @return the size of all the attributes in this attribute list. This size\n * includes the size of the attribute headers.\n */\n final int getSize(final ClassWriter cw, final byte[] code, final int len,\n final int maxStack, final int maxLocals) {\n Attribute attr = this;\n int size = 0;\n while (attr != null) {\n cw.newUTF8(attr.type);\n size += attr.write(cw, code, len, maxStack, maxLocals).length + 6;\n attr = attr.next;\n }\n return size;\n }\n\n /**\n * Writes all the attributes of this attribute list in the given byte\n * vector.\n *\n * @param cw\n * the class writer to be used to convert the attributes into\n * byte arrays, with the {@link #write write} method.\n * @param code\n * the bytecode of the method corresponding to these code\n * attributes, or null if these attributes are not code\n * attributes.\n * @param len\n * the length of the bytecode of the method corresponding to\n * these code attributes, or null if these attributes\n * are not code attributes.\n * @param maxStack\n * the maximum stack size of the method corresponding to these\n * code attributes, or -1 if these attributes are not code\n * attributes.\n * @param maxLocals\n * the maximum number of local variables of the method\n * corresponding to these code attributes, or -1 if these\n * attributes are not code attributes.\n * @param out\n * where the attributes must be written.\n */\n final void put(final ClassWriter cw, final byte[] code, final int len,\n final int maxStack, final int maxLocals, final ByteVector out) {\n Attribute attr = this;\n while (attr != null) {\n ByteVector b = attr.write(cw, code, len, maxStack, maxLocals);\n out.putShort(cw.newUTF8(attr.type)).putInt(b.length);\n out.putByteArray(b.data, 0, b.length);\n attr = attr.next;\n }\n }\n}\n" }, { "path": "src/jvm/clojure/asm/ByteVector.java", "content": "/***\n * ASM: a very small and fast Java bytecode manipulation framework\n * Copyright (c) 2000-2011 INRIA, France Telecom\n * All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions\n * are met:\n * 1. Redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer.\n * 2. Redistributions in binary form must reproduce the above copyright\n * notice, this list of conditions and the following disclaimer in the\n * documentation and/or other materials provided with the distribution.\n * 3. Neither the name of the copyright holders nor the names of its\n * contributors may be used to endorse or promote products derived from\n * this software without specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\n * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\n * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE\n * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR\n * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF\n * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\n * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN\n * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\n * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF\n * THE POSSIBILITY OF SUCH DAMAGE.\n */\npackage clojure.asm;\n\n/**\n * A dynamically extensible vector of bytes. This class is roughly equivalent to\n * a DataOutputStream on top of a ByteArrayOutputStream, but is more efficient.\n *\n * @author Eric Bruneton\n */\npublic class ByteVector {\n\n /**\n * The content of this vector.\n */\n byte[] data;\n\n /**\n * Actual number of bytes in this vector.\n */\n int length;\n\n /**\n * Constructs a new {@link ByteVector ByteVector} with a default initial\n * size.\n */\n public ByteVector() {\n data = new byte[64];\n }\n\n /**\n * Constructs a new {@link ByteVector ByteVector} with the given initial\n * size.\n *\n * @param initialSize\n * the initial size of the byte vector to be constructed.\n */\n public ByteVector(final int initialSize) {\n data = new byte[initialSize];\n }\n\n /**\n * Puts a byte into this byte vector. The byte vector is automatically\n * enlarged if necessary.\n *\n * @param b\n * a byte.\n * @return this byte vector.\n */\n public ByteVector putByte(final int b) {\n int length = this.length;\n if (length + 1 > data.length) {\n enlarge(1);\n }\n data[length++] = (byte) b;\n this.length = length;\n return this;\n }\n\n /**\n * Puts two bytes into this byte vector. The byte vector is automatically\n * enlarged if necessary.\n *\n * @param b1\n * a byte.\n * @param b2\n * another byte.\n * @return this byte vector.\n */\n ByteVector put11(final int b1, final int b2) {\n int length = this.length;\n if (length + 2 > data.length) {\n enlarge(2);\n }\n byte[] data = this.data;\n data[length++] = (byte) b1;\n data[length++] = (byte) b2;\n this.length = length;\n return this;\n }\n\n /**\n * Puts a short into this byte vector. The byte vector is automatically\n * enlarged if necessary.\n *\n * @param s\n * a short.\n * @return this byte vector.\n */\n public ByteVector putShort(final int s) {\n int length = this.length;\n if (length + 2 > data.length) {\n enlarge(2);\n }\n byte[] data = this.data;\n data[length++] = (byte) (s >>> 8);\n data[length++] = (byte) s;\n this.length = length;\n return this;\n }\n\n /**\n * Puts a byte and a short into this byte vector. The byte vector is\n * automatically enlarged if necessary.\n *\n * @param b\n * a byte.\n * @param s\n * a short.\n * @return this byte vector.\n */\n ByteVector put12(final int b, final int s) {\n int length = this.length;\n if (length + 3 > data.length) {\n enlarge(3);\n }\n byte[] data = this.data;\n data[length++] = (byte) b;\n data[length++] = (byte) (s >>> 8);\n data[length++] = (byte) s;\n this.length = length;\n return this;\n }\n\n /**\n * Puts an int into this byte vector. The byte vector is automatically\n * enlarged if necessary.\n *\n * @param i\n * an int.\n * @return this byte vector.\n */\n public ByteVector putInt(final int i) {\n int length = this.length;\n if (length + 4 > data.length) {\n enlarge(4);\n }\n byte[] data = this.data;\n data[length++] = (byte) (i >>> 24);\n data[length++] = (byte) (i >>> 16);\n data[length++] = (byte) (i >>> 8);\n data[length++] = (byte) i;\n this.length = length;\n return this;\n }\n\n /**\n * Puts a long into this byte vector. The byte vector is automatically\n * enlarged if necessary.\n *\n * @param l\n * a long.\n * @return this byte vector.\n */\n public ByteVector putLong(final long l) {\n int length = this.length;\n if (length + 8 > data.length) {\n enlarge(8);\n }\n byte[] data = this.data;\n int i = (int) (l >>> 32);\n data[length++] = (byte) (i >>> 24);\n data[length++] = (byte) (i >>> 16);\n data[length++] = (byte) (i >>> 8);\n data[length++] = (byte) i;\n i = (int) l;\n data[length++] = (byte) (i >>> 24);\n data[length++] = (byte) (i >>> 16);\n data[length++] = (byte) (i >>> 8);\n data[length++] = (byte) i;\n this.length = length;\n return this;\n }\n\n /**\n * Puts an UTF8 string into this byte vector. The byte vector is\n * automatically enlarged if necessary.\n *\n * @param s\n * a String.\n * @return this byte vector.\n */\n public ByteVector putUTF8(final String s) {\n int charLength = s.length();\n int len = length;\n if (len + 2 + charLength > data.length) {\n enlarge(2 + charLength);\n }\n byte[] data = this.data;\n // optimistic algorithm: instead of computing the byte length and then\n // serializing the string (which requires two loops), we assume the byte\n // length is equal to char length (which is the most frequent case), and\n // we start serializing the string right away. During the serialization,\n // if we find that this assumption is wrong, we continue with the\n // general method.\n data[len++] = (byte) (charLength >>> 8);\n data[len++] = (byte) charLength;\n for (int i = 0; i < charLength; ++i) {\n char c = s.charAt(i);\n if (c >= '\\001' && c <= '\\177') {\n data[len++] = (byte) c;\n } else {\n int byteLength = i;\n for (int j = i; j < charLength; ++j) {\n c = s.charAt(j);\n if (c >= '\\001' && c <= '\\177') {\n byteLength++;\n } else if (c > '\\u07FF') {\n byteLength += 3;\n } else {\n byteLength += 2;\n }\n }\n data[length] = (byte) (byteLength >>> 8);\n data[length + 1] = (byte) byteLength;\n if (length + 2 + byteLength > data.length) {\n length = len;\n enlarge(2 + byteLength);\n data = this.data;\n }\n for (int j = i; j < charLength; ++j) {\n c = s.charAt(j);\n if (c >= '\\001' && c <= '\\177') {\n data[len++] = (byte) c;\n } else if (c > '\\u07FF') {\n data[len++] = (byte) (0xE0 | c >> 12 & 0xF);\n data[len++] = (byte) (0x80 | c >> 6 & 0x3F);\n data[len++] = (byte) (0x80 | c & 0x3F);\n } else {\n data[len++] = (byte) (0xC0 | c >> 6 & 0x1F);\n data[len++] = (byte) (0x80 | c & 0x3F);\n }\n }\n break;\n }\n }\n length = len;\n return this;\n }\n\n /**\n * Puts an array of bytes into this byte vector. The byte vector is\n * automatically enlarged if necessary.\n *\n * @param b\n * an array of bytes. May be null to put len\n * null bytes into this byte vector.\n * @param off\n * index of the fist byte of b that must be copied.\n * @param len\n * number of bytes of b that must be copied.\n * @return this byte vector.\n */\n public ByteVector putByteArray(final byte[] b, final int off, final int len) {\n if (length + len > data.length) {\n enlarge(len);\n }\n if (b != null) {\n System.arraycopy(b, off, data, length, len);\n }\n length += len;\n return this;\n }\n\n /**\n * Enlarge this byte vector so that it can receive n more bytes.\n *\n * @param size\n * number of additional bytes that this byte vector should be\n * able to receive.\n */\n private void enlarge(final int size) {\n int length1 = 2 * data.length;\n int length2 = length + size;\n byte[] newData = new byte[length1 > length2 ? length1 : length2];\n System.arraycopy(data, 0, newData, 0, length);\n data = newData;\n }\n}\n" }, { "path": "src/jvm/clojure/asm/ClassReader.java", "content": "/***\n * ASM: a very small and fast Java bytecode manipulation framework\n * Copyright (c) 2000-2011 INRIA, France Telecom\n * All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions\n * are met:\n * 1. Redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer.\n * 2. Redistributions in binary form must reproduce the above copyright\n * notice, this list of conditions and the following disclaimer in the\n * documentation and/or other materials provided with the distribution.\n * 3. Neither the name of the copyright holders nor the names of its\n * contributors may be used to endorse or promote products derived from\n * this software without specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\n * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\n * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE\n * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR\n * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF\n * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\n * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN\n * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\n * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF\n * THE POSSIBILITY OF SUCH DAMAGE.\n */\npackage clojure.asm;\n\nimport java.io.IOException;\nimport java.io.InputStream;\n\n/**\n * A Java class parser to make a {@link ClassVisitor} visit an existing class.\n * This class parses a byte array conforming to the Java class file format and\n * calls the appropriate visit methods of a given class visitor for each field,\n * method and bytecode instruction encountered.\n *\n * @author Eric Bruneton\n * @author Eugene Kuleshov\n */\npublic class ClassReader {\n\n /**\n * True to enable signatures support.\n */\n static final boolean SIGNATURES = true;\n\n /**\n * True to enable annotations support.\n */\n static final boolean ANNOTATIONS = true;\n\n /**\n * True to enable stack map frames support.\n */\n static final boolean FRAMES = true;\n\n /**\n * True to enable bytecode writing support.\n */\n static final boolean WRITER = true;\n\n /**\n * True to enable JSR_W and GOTO_W support.\n */\n static final boolean RESIZE = true;\n\n /**\n * Flag to skip method code. If this class is set CODE\n * attribute won't be visited. This can be used, for example, to retrieve\n * annotations for methods and method parameters.\n */\n public static final int SKIP_CODE = 1;\n\n /**\n * Flag to skip the debug information in the class. If this flag is set the\n * debug information of the class is not visited, i.e. the\n * {@link MethodVisitor#visitLocalVariable visitLocalVariable} and\n * {@link MethodVisitor#visitLineNumber visitLineNumber} methods will not be\n * called.\n */\n public static final int SKIP_DEBUG = 2;\n\n /**\n * Flag to skip the stack map frames in the class. If this flag is set the\n * stack map frames of the class is not visited, i.e. the\n * {@link MethodVisitor#visitFrame visitFrame} method will not be called.\n * This flag is useful when the {@link ClassWriter#COMPUTE_FRAMES} option is\n * used: it avoids visiting frames that will be ignored and recomputed from\n * scratch in the class writer.\n */\n public static final int SKIP_FRAMES = 4;\n\n /**\n * Flag to expand the stack map frames. By default stack map frames are\n * visited in their original format (i.e. \"expanded\" for classes whose\n * version is less than V1_6, and \"compressed\" for the other classes). If\n * this flag is set, stack map frames are always visited in expanded format\n * (this option adds a decompression/recompression step in ClassReader and\n * ClassWriter which degrades performances quite a lot).\n */\n public static final int EXPAND_FRAMES = 8;\n\n /**\n * The class to be parsed. The content of this array must not be\n * modified. This field is intended for {@link Attribute} sub classes, and\n * is normally not needed by class generators or adapters.\n */\n public final byte[] b;\n\n /**\n * The start index of each constant pool item in {@link #b b}, plus one. The\n * one byte offset skips the constant pool item tag that indicates its type.\n */\n private final int[] items;\n\n /**\n * The String objects corresponding to the CONSTANT_Utf8 items. This cache\n * avoids multiple parsing of a given CONSTANT_Utf8 constant pool item,\n * which GREATLY improves performances (by a factor 2 to 3). This caching\n * strategy could be extended to all constant pool items, but its benefit\n * would not be so great for these items (because they are much less\n * expensive to parse than CONSTANT_Utf8 items).\n */\n private final String[] strings;\n\n /**\n * Maximum length of the strings contained in the constant pool of the\n * class.\n */\n private final int maxStringLength;\n\n /**\n * Start index of the class header information (access, name...) in\n * {@link #b b}.\n */\n public final int header;\n\n // ------------------------------------------------------------------------\n // Constructors\n // ------------------------------------------------------------------------\n\n /**\n * Constructs a new {@link ClassReader} object.\n *\n * @param b\n * the bytecode of the class to be read.\n */\n public ClassReader(final byte[] b) {\n this(b, 0, b.length);\n }\n\n /**\n * Constructs a new {@link ClassReader} object.\n *\n * @param b\n * the bytecode of the class to be read.\n * @param off\n * the start offset of the class data.\n * @param len\n * the length of the class data.\n */\n public ClassReader(final byte[] b, final int off, final int len) {\n this.b = b;\n // checks the class version\n if (readShort(off + 6) > Opcodes.V1_7) {\n throw new IllegalArgumentException();\n }\n // parses the constant pool\n items = new int[readUnsignedShort(off + 8)];\n int n = items.length;\n strings = new String[n];\n int max = 0;\n int index = off + 10;\n for (int i = 1; i < n; ++i) {\n items[i] = index + 1;\n int size;\n switch (b[index]) {\n case ClassWriter.FIELD:\n case ClassWriter.METH:\n case ClassWriter.IMETH:\n case ClassWriter.INT:\n case ClassWriter.FLOAT:\n case ClassWriter.NAME_TYPE:\n case ClassWriter.INDY:\n size = 5;\n break;\n case ClassWriter.LONG:\n case ClassWriter.DOUBLE:\n size = 9;\n ++i;\n break;\n case ClassWriter.UTF8:\n size = 3 + readUnsignedShort(index + 1);\n if (size > max) {\n max = size;\n }\n break;\n case ClassWriter.HANDLE:\n size = 4;\n break;\n // case ClassWriter.CLASS:\n // case ClassWriter.STR:\n // case ClassWriter.MTYPE\n default:\n size = 3;\n break;\n }\n index += size;\n }\n maxStringLength = max;\n // the class header information starts just after the constant pool\n header = index;\n }\n\n /**\n * Returns the class's access flags (see {@link Opcodes}). This value may\n * not reflect Deprecated and Synthetic flags when bytecode is before 1.5\n * and those flags are represented by attributes.\n *\n * @return the class access flags\n *\n * @see ClassVisitor#visit(int, int, String, String, String, String[])\n */\n public int getAccess() {\n return readUnsignedShort(header);\n }\n\n /**\n * Returns the internal name of the class (see\n * {@link Type#getInternalName() getInternalName}).\n *\n * @return the internal class name\n *\n * @see ClassVisitor#visit(int, int, String, String, String, String[])\n */\n public String getClassName() {\n return readClass(header + 2, new char[maxStringLength]);\n }\n\n /**\n * Returns the internal of name of the super class (see\n * {@link Type#getInternalName() getInternalName}). For interfaces, the\n * super class is {@link Object}.\n *\n * @return the internal name of super class, or null for\n * {@link Object} class.\n *\n * @see ClassVisitor#visit(int, int, String, String, String, String[])\n */\n public String getSuperName() {\n return readClass(header + 4, new char[maxStringLength]);\n }\n\n /**\n * Returns the internal names of the class's interfaces (see\n * {@link Type#getInternalName() getInternalName}).\n *\n * @return the array of internal names for all implemented interfaces or\n * null.\n *\n * @see ClassVisitor#visit(int, int, String, String, String, String[])\n */\n public String[] getInterfaces() {\n int index = header + 6;\n int n = readUnsignedShort(index);\n String[] interfaces = new String[n];\n if (n > 0) {\n char[] buf = new char[maxStringLength];\n for (int i = 0; i < n; ++i) {\n index += 2;\n interfaces[i] = readClass(index, buf);\n }\n }\n return interfaces;\n }\n\n /**\n * Copies the constant pool data into the given {@link ClassWriter}. Should\n * be called before the {@link #accept(ClassVisitor,int)} method.\n *\n * @param classWriter\n * the {@link ClassWriter} to copy constant pool into.\n */\n void copyPool(final ClassWriter classWriter) {\n char[] buf = new char[maxStringLength];\n int ll = items.length;\n Item[] items2 = new Item[ll];\n for (int i = 1; i < ll; i++) {\n int index = items[i];\n int tag = b[index - 1];\n Item item = new Item(i);\n int nameType;\n switch (tag) {\n case ClassWriter.FIELD:\n case ClassWriter.METH:\n case ClassWriter.IMETH:\n nameType = items[readUnsignedShort(index + 2)];\n item.set(tag, readClass(index, buf), readUTF8(nameType, buf),\n readUTF8(nameType + 2, buf));\n break;\n case ClassWriter.INT:\n item.set(readInt(index));\n break;\n case ClassWriter.FLOAT:\n item.set(Float.intBitsToFloat(readInt(index)));\n break;\n case ClassWriter.NAME_TYPE:\n item.set(tag, readUTF8(index, buf), readUTF8(index + 2, buf),\n null);\n break;\n case ClassWriter.LONG:\n item.set(readLong(index));\n ++i;\n break;\n case ClassWriter.DOUBLE:\n item.set(Double.longBitsToDouble(readLong(index)));\n ++i;\n break;\n case ClassWriter.UTF8: {\n String s = strings[i];\n if (s == null) {\n index = items[i];\n s = strings[i] = readUTF(index + 2,\n readUnsignedShort(index), buf);\n }\n item.set(tag, s, null, null);\n break;\n }\n case ClassWriter.HANDLE: {\n int fieldOrMethodRef = items[readUnsignedShort(index + 1)];\n nameType = items[readUnsignedShort(fieldOrMethodRef + 2)];\n item.set(ClassWriter.HANDLE_BASE + readByte(index),\n readClass(fieldOrMethodRef, buf),\n readUTF8(nameType, buf), readUTF8(nameType + 2, buf));\n break;\n }\n case ClassWriter.INDY:\n if (classWriter.bootstrapMethods == null) {\n copyBootstrapMethods(classWriter, items2, buf);\n }\n nameType = items[readUnsignedShort(index + 2)];\n item.set(readUTF8(nameType, buf), readUTF8(nameType + 2, buf),\n readUnsignedShort(index));\n break;\n // case ClassWriter.STR:\n // case ClassWriter.CLASS:\n // case ClassWriter.MTYPE\n default:\n item.set(tag, readUTF8(index, buf), null, null);\n break;\n }\n\n int index2 = item.hashCode % items2.length;\n item.next = items2[index2];\n items2[index2] = item;\n }\n\n int off = items[1] - 1;\n classWriter.pool.putByteArray(b, off, header - off);\n classWriter.items = items2;\n classWriter.threshold = (int) (0.75d * ll);\n classWriter.index = ll;\n }\n\n /**\n * Copies the bootstrap method data into the given {@link ClassWriter}.\n * Should be called before the {@link #accept(ClassVisitor,int)} method.\n *\n * @param classWriter\n * the {@link ClassWriter} to copy bootstrap methods into.\n */\n private void copyBootstrapMethods(final ClassWriter classWriter,\n final Item[] items, final char[] c) {\n // finds the \"BootstrapMethods\" attribute\n int u = getAttributes();\n boolean found = false;\n for (int i = readUnsignedShort(u); i > 0; --i) {\n String attrName = readUTF8(u + 2, c);\n if (\"BootstrapMethods\".equals(attrName)) {\n found = true;\n break;\n }\n u += 6 + readInt(u + 4);\n }\n if (!found) {\n return;\n }\n // copies the bootstrap methods in the class writer\n int boostrapMethodCount = readUnsignedShort(u + 8);\n for (int j = 0, v = u + 10; j < boostrapMethodCount; j++) {\n int position = v - u - 10;\n int hashCode = readConst(readUnsignedShort(v), c).hashCode();\n for (int k = readUnsignedShort(v + 2); k > 0; --k) {\n hashCode ^= readConst(readUnsignedShort(v + 4), c).hashCode();\n v += 2;\n }\n v += 4;\n Item item = new Item(j);\n item.set(position, hashCode & 0x7FFFFFFF);\n int index = item.hashCode % items.length;\n item.next = items[index];\n items[index] = item;\n }\n int attrSize = readInt(u + 4);\n ByteVector bootstrapMethods = new ByteVector(attrSize + 62);\n bootstrapMethods.putByteArray(b, u + 10, attrSize - 2);\n classWriter.bootstrapMethodsCount = boostrapMethodCount;\n classWriter.bootstrapMethods = bootstrapMethods;\n }\n\n /**\n * Constructs a new {@link ClassReader} object.\n *\n * @param is\n * an input stream from which to read the class.\n * @throws IOException\n * if a problem occurs during reading.\n */\n public ClassReader(final InputStream is) throws IOException {\n this(readClass(is, false));\n }\n\n /**\n * Constructs a new {@link ClassReader} object.\n *\n * @param name\n * the binary qualified name of the class to be read.\n * @throws IOException\n * if an exception occurs during reading.\n */\n public ClassReader(final String name) throws IOException {\n this(readClass(\n ClassLoader.getSystemResourceAsStream(name.replace('.', '/')\n + \".class\"), true));\n }\n\n /**\n * Reads the bytecode of a class.\n *\n * @param is\n * an input stream from which to read the class.\n * @param close\n * true to close the input stream after reading.\n * @return the bytecode read from the given input stream.\n * @throws IOException\n * if a problem occurs during reading.\n */\n private static byte[] readClass(final InputStream is, boolean close)\n throws IOException {\n if (is == null) {\n throw new IOException(\"Class not found\");\n }\n try {\n byte[] b = new byte[is.available()];\n int len = 0;\n while (true) {\n int n = is.read(b, len, b.length - len);\n if (n == -1) {\n if (len < b.length) {\n byte[] c = new byte[len];\n System.arraycopy(b, 0, c, 0, len);\n b = c;\n }\n return b;\n }\n len += n;\n if (len == b.length) {\n int last = is.read();\n if (last < 0) {\n return b;\n }\n byte[] c = new byte[b.length + 1000];\n System.arraycopy(b, 0, c, 0, len);\n c[len++] = (byte) last;\n b = c;\n }\n }\n } finally {\n if (close) {\n is.close();\n }\n }\n }\n\n // ------------------------------------------------------------------------\n // Public methods\n // ------------------------------------------------------------------------\n\n /**\n * Makes the given visitor visit the Java class of this {@link ClassReader}\n * . This class is the one specified in the constructor (see\n * {@link #ClassReader(byte[]) ClassReader}).\n *\n * @param classVisitor\n * the visitor that must visit this class.\n * @param flags\n * option flags that can be used to modify the default behavior\n * of this class. See {@link #SKIP_DEBUG}, {@link #EXPAND_FRAMES}\n * , {@link #SKIP_FRAMES}, {@link #SKIP_CODE}.\n */\n public void accept(final ClassVisitor classVisitor, final int flags) {\n accept(classVisitor, new Attribute[0], flags);\n }\n\n /**\n * Makes the given visitor visit the Java class of this {@link ClassReader}.\n * This class is the one specified in the constructor (see\n * {@link #ClassReader(byte[]) ClassReader}).\n *\n * @param classVisitor\n * the visitor that must visit this class.\n * @param attrs\n * prototypes of the attributes that must be parsed during the\n * visit of the class. Any attribute whose type is not equal to\n * the type of one the prototypes will not be parsed: its byte\n * array value will be passed unchanged to the ClassWriter.\n * This may corrupt it if this value contains references to\n * the constant pool, or has syntactic or semantic links with a\n * class element that has been transformed by a class adapter\n * between the reader and the writer.\n * @param flags\n * option flags that can be used to modify the default behavior\n * of this class. See {@link #SKIP_DEBUG}, {@link #EXPAND_FRAMES}\n * , {@link #SKIP_FRAMES}, {@link #SKIP_CODE}.\n */\n public void accept(final ClassVisitor classVisitor,\n final Attribute[] attrs, final int flags) {\n int u = header; // current offset in the class file\n char[] c = new char[maxStringLength]; // buffer used to read strings\n\n Context context = new Context();\n context.attrs = attrs;\n context.flags = flags;\n context.buffer = c;\n\n // reads the class declaration\n int access = readUnsignedShort(u);\n String name = readClass(u + 2, c);\n String superClass = readClass(u + 4, c);\n String[] interfaces = new String[readUnsignedShort(u + 6)];\n u += 8;\n for (int i = 0; i < interfaces.length; ++i) {\n interfaces[i] = readClass(u, c);\n u += 2;\n }\n\n // reads the class attributes\n String signature = null;\n String sourceFile = null;\n String sourceDebug = null;\n String enclosingOwner = null;\n String enclosingName = null;\n String enclosingDesc = null;\n int anns = 0;\n int ianns = 0;\n int innerClasses = 0;\n Attribute attributes = null;\n\n u = getAttributes();\n for (int i = readUnsignedShort(u); i > 0; --i) {\n String attrName = readUTF8(u + 2, c);\n // tests are sorted in decreasing frequency order\n // (based on frequencies observed on typical classes)\n if (\"SourceFile\".equals(attrName)) {\n sourceFile = readUTF8(u + 8, c);\n } else if (\"InnerClasses\".equals(attrName)) {\n innerClasses = u + 8;\n } else if (\"EnclosingMethod\".equals(attrName)) {\n enclosingOwner = readClass(u + 8, c);\n int item = readUnsignedShort(u + 10);\n if (item != 0) {\n enclosingName = readUTF8(items[item], c);\n enclosingDesc = readUTF8(items[item] + 2, c);\n }\n } else if (SIGNATURES && \"Signature\".equals(attrName)) {\n signature = readUTF8(u + 8, c);\n } else if (ANNOTATIONS\n && \"RuntimeVisibleAnnotations\".equals(attrName)) {\n anns = u + 8;\n } else if (\"Deprecated\".equals(attrName)) {\n access |= Opcodes.ACC_DEPRECATED;\n } else if (\"Synthetic\".equals(attrName)) {\n access |= Opcodes.ACC_SYNTHETIC\n | ClassWriter.ACC_SYNTHETIC_ATTRIBUTE;\n } else if (\"SourceDebugExtension\".equals(attrName)) {\n int len = readInt(u + 4);\n sourceDebug = readUTF(u + 8, len, new char[len]);\n } else if (ANNOTATIONS\n && \"RuntimeInvisibleAnnotations\".equals(attrName)) {\n ianns = u + 8;\n } else if (\"BootstrapMethods\".equals(attrName)) {\n int[] bootstrapMethods = new int[readUnsignedShort(u + 8)];\n for (int j = 0, v = u + 10; j < bootstrapMethods.length; j++) {\n bootstrapMethods[j] = v;\n v += 2 + readUnsignedShort(v + 2) << 1;\n }\n context.bootstrapMethods = bootstrapMethods;\n } else {\n Attribute attr = readAttribute(attrs, attrName, u + 8,\n readInt(u + 4), c, -1, null);\n if (attr != null) {\n attr.next = attributes;\n attributes = attr;\n }\n }\n u += 6 + readInt(u + 4);\n }\n\n // visits the class declaration\n classVisitor.visit(readInt(items[1] - 7), access, name, signature,\n superClass, interfaces);\n\n // visits the source and debug info\n if ((flags & SKIP_DEBUG) == 0\n && (sourceFile != null || sourceDebug != null)) {\n classVisitor.visitSource(sourceFile, sourceDebug);\n }\n\n // visits the outer class\n if (enclosingOwner != null) {\n classVisitor.visitOuterClass(enclosingOwner, enclosingName,\n enclosingDesc);\n }\n\n // visits the class annotations\n if (ANNOTATIONS && anns != 0) {\n for (int i = readUnsignedShort(anns), v = anns + 2; i > 0; --i) {\n v = readAnnotationValues(v + 2, c, true,\n classVisitor.visitAnnotation(readUTF8(v, c), true));\n }\n }\n if (ANNOTATIONS && ianns != 0) {\n for (int i = readUnsignedShort(ianns), v = ianns + 2; i > 0; --i) {\n v = readAnnotationValues(v + 2, c, true,\n classVisitor.visitAnnotation(readUTF8(v, c), false));\n }\n }\n\n // visits the attributes\n while (attributes != null) {\n Attribute attr = attributes.next;\n attributes.next = null;\n classVisitor.visitAttribute(attributes);\n attributes = attr;\n }\n\n // visits the inner classes\n if (innerClasses != 0) {\n int v = innerClasses + 2;\n for (int i = readUnsignedShort(innerClasses); i > 0; --i) {\n classVisitor.visitInnerClass(readClass(v, c),\n readClass(v + 2, c), readUTF8(v + 4, c),\n readUnsignedShort(v + 6));\n v += 8;\n }\n }\n\n // visits the fields and methods\n u = header + 10 + 2 * interfaces.length;\n for (int i = readUnsignedShort(u - 2); i > 0; --i) {\n u = readField(classVisitor, context, u);\n }\n u += 2;\n for (int i = readUnsignedShort(u - 2); i > 0; --i) {\n u = readMethod(classVisitor, context, u);\n }\n\n // visits the end of the class\n classVisitor.visitEnd();\n }\n\n /**\n * Reads a field and makes the given visitor visit it.\n *\n * @param classVisitor\n * the visitor that must visit the field.\n * @param context\n * information about the class being parsed.\n * @param u\n * the start offset of the field in the class file.\n * @return the offset of the first byte following the field in the class.\n */\n private int readField(final ClassVisitor classVisitor,\n final Context context, int u) {\n // reads the field declaration\n char[] c = context.buffer;\n int access = readUnsignedShort(u);\n String name = readUTF8(u + 2, c);\n String desc = readUTF8(u + 4, c);\n u += 6;\n\n // reads the field attributes\n String signature = null;\n int anns = 0;\n int ianns = 0;\n Object value = null;\n Attribute attributes = null;\n\n for (int i = readUnsignedShort(u); i > 0; --i) {\n String attrName = readUTF8(u + 2, c);\n // tests are sorted in decreasing frequency order\n // (based on frequencies observed on typical classes)\n if (\"ConstantValue\".equals(attrName)) {\n int item = readUnsignedShort(u + 8);\n value = item == 0 ? null : readConst(item, c);\n } else if (SIGNATURES && \"Signature\".equals(attrName)) {\n signature = readUTF8(u + 8, c);\n } else if (\"Deprecated\".equals(attrName)) {\n access |= Opcodes.ACC_DEPRECATED;\n } else if (\"Synthetic\".equals(attrName)) {\n access |= Opcodes.ACC_SYNTHETIC\n | ClassWriter.ACC_SYNTHETIC_ATTRIBUTE;\n } else if (ANNOTATIONS\n && \"RuntimeVisibleAnnotations\".equals(attrName)) {\n anns = u + 8;\n } else if (ANNOTATIONS\n && \"RuntimeInvisibleAnnotations\".equals(attrName)) {\n ianns = u + 8;\n } else {\n Attribute attr = readAttribute(context.attrs, attrName, u + 8,\n readInt(u + 4), c, -1, null);\n if (attr != null) {\n attr.next = attributes;\n attributes = attr;\n }\n }\n u += 6 + readInt(u + 4);\n }\n u += 2;\n\n // visits the field declaration\n FieldVisitor fv = classVisitor.visitField(access, name, desc,\n signature, value);\n if (fv == null) {\n return u;\n }\n\n // visits the field annotations\n if (ANNOTATIONS && anns != 0) {\n for (int i = readUnsignedShort(anns), v = anns + 2; i > 0; --i) {\n v = readAnnotationValues(v + 2, c, true,\n fv.visitAnnotation(readUTF8(v, c), true));\n }\n }\n if (ANNOTATIONS && ianns != 0) {\n for (int i = readUnsignedShort(ianns), v = ianns + 2; i > 0; --i) {\n v = readAnnotationValues(v + 2, c, true,\n fv.visitAnnotation(readUTF8(v, c), false));\n }\n }\n\n // visits the field attributes\n while (attributes != null) {\n Attribute attr = attributes.next;\n attributes.next = null;\n fv.visitAttribute(attributes);\n attributes = attr;\n }\n\n // visits the end of the field\n fv.visitEnd();\n\n return u;\n }\n\n /**\n * Reads a method and makes the given visitor visit it.\n *\n * @param classVisitor\n * the visitor that must visit the method.\n * @param context\n * information about the class being parsed.\n * @param u\n * the start offset of the method in the class file.\n * @return the offset of the first byte following the method in the class.\n */\n private int readMethod(final ClassVisitor classVisitor,\n final Context context, int u) {\n // reads the method declaration\n char[] c = context.buffer;\n int access = readUnsignedShort(u);\n String name = readUTF8(u + 2, c);\n String desc = readUTF8(u + 4, c);\n u += 6;\n\n // reads the method attributes\n int code = 0;\n int exception = 0;\n String[] exceptions = null;\n String signature = null;\n int anns = 0;\n int ianns = 0;\n int dann = 0;\n int mpanns = 0;\n int impanns = 0;\n int firstAttribute = u;\n Attribute attributes = null;\n\n for (int i = readUnsignedShort(u); i > 0; --i) {\n String attrName = readUTF8(u + 2, c);\n // tests are sorted in decreasing frequency order\n // (based on frequencies observed on typical classes)\n if (\"Code\".equals(attrName)) {\n if ((context.flags & SKIP_CODE) == 0) {\n code = u + 8;\n }\n } else if (\"Exceptions\".equals(attrName)) {\n exceptions = new String[readUnsignedShort(u + 8)];\n exception = u + 10;\n for (int j = 0; j < exceptions.length; ++j) {\n exceptions[j] = readClass(exception, c);\n exception += 2;\n }\n } else if (SIGNATURES && \"Signature\".equals(attrName)) {\n signature = readUTF8(u + 8, c);\n } else if (\"Deprecated\".equals(attrName)) {\n access |= Opcodes.ACC_DEPRECATED;\n } else if (ANNOTATIONS\n && \"RuntimeVisibleAnnotations\".equals(attrName)) {\n anns = u + 8;\n } else if (ANNOTATIONS && \"AnnotationDefault\".equals(attrName)) {\n dann = u + 8;\n } else if (\"Synthetic\".equals(attrName)) {\n access |= Opcodes.ACC_SYNTHETIC\n | ClassWriter.ACC_SYNTHETIC_ATTRIBUTE;\n } else if (ANNOTATIONS\n && \"RuntimeInvisibleAnnotations\".equals(attrName)) {\n ianns = u + 8;\n } else if (ANNOTATIONS\n && \"RuntimeVisibleParameterAnnotations\".equals(attrName)) {\n mpanns = u + 8;\n } else if (ANNOTATIONS\n && \"RuntimeInvisibleParameterAnnotations\".equals(attrName)) {\n impanns = u + 8;\n } else {\n Attribute attr = readAttribute(context.attrs, attrName, u + 8,\n readInt(u + 4), c, -1, null);\n if (attr != null) {\n attr.next = attributes;\n attributes = attr;\n }\n }\n u += 6 + readInt(u + 4);\n }\n u += 2;\n\n // visits the method declaration\n MethodVisitor mv = classVisitor.visitMethod(access, name, desc,\n signature, exceptions);\n if (mv == null) {\n return u;\n }\n\n /*\n * if the returned MethodVisitor is in fact a MethodWriter, it means\n * there is no method adapter between the reader and the writer. If, in\n * addition, the writer's constant pool was copied from this reader\n * (mw.cw.cr == this), and the signature and exceptions of the method\n * have not been changed, then it is possible to skip all visit events\n * and just copy the original code of the method to the writer (the\n * access, name and descriptor can have been changed, this is not\n * important since they are not copied as is from the reader).\n */\n if (WRITER && mv instanceof MethodWriter) {\n MethodWriter mw = (MethodWriter) mv;\n if (mw.cw.cr == this && signature == mw.signature) {\n boolean sameExceptions = false;\n if (exceptions == null) {\n sameExceptions = mw.exceptionCount == 0;\n } else if (exceptions.length == mw.exceptionCount) {\n sameExceptions = true;\n for (int j = exceptions.length - 1; j >= 0; --j) {\n exception -= 2;\n if (mw.exceptions[j] != readUnsignedShort(exception)) {\n sameExceptions = false;\n break;\n }\n }\n }\n if (sameExceptions) {\n /*\n * we do not copy directly the code into MethodWriter to\n * save a byte array copy operation. The real copy will be\n * done in ClassWriter.toByteArray().\n */\n mw.classReaderOffset = firstAttribute;\n mw.classReaderLength = u - firstAttribute;\n return u;\n }\n }\n }\n\n // visits the method annotations\n if (ANNOTATIONS && dann != 0) {\n AnnotationVisitor dv = mv.visitAnnotationDefault();\n readAnnotationValue(dann, c, null, dv);\n if (dv != null) {\n dv.visitEnd();\n }\n }\n if (ANNOTATIONS && anns != 0) {\n for (int i = readUnsignedShort(anns), v = anns + 2; i > 0; --i) {\n v = readAnnotationValues(v + 2, c, true,\n mv.visitAnnotation(readUTF8(v, c), true));\n }\n }\n if (ANNOTATIONS && ianns != 0) {\n for (int i = readUnsignedShort(ianns), v = ianns + 2; i > 0; --i) {\n v = readAnnotationValues(v + 2, c, true,\n mv.visitAnnotation(readUTF8(v, c), false));\n }\n }\n if (ANNOTATIONS && mpanns != 0) {\n readParameterAnnotations(mpanns, desc, c, true, mv);\n }\n if (ANNOTATIONS && impanns != 0) {\n readParameterAnnotations(impanns, desc, c, false, mv);\n }\n\n // visits the method attributes\n while (attributes != null) {\n Attribute attr = attributes.next;\n attributes.next = null;\n mv.visitAttribute(attributes);\n attributes = attr;\n }\n\n // visits the method code\n if (code != 0) {\n context.access = access;\n context.name = name;\n context.desc = desc;\n mv.visitCode();\n readCode(mv, context, code);\n }\n\n // visits the end of the method\n mv.visitEnd();\n\n return u;\n }\n\n /**\n * Reads the bytecode of a method and makes the given visitor visit it.\n *\n * @param mv\n * the visitor that must visit the method's code.\n * @param context\n * information about the class being parsed.\n * @param u\n * the start offset of the code attribute in the class file.\n */\n private void readCode(final MethodVisitor mv, final Context context, int u) {\n // reads the header\n byte[] b = this.b;\n char[] c = context.buffer;\n int maxStack = readUnsignedShort(u);\n int maxLocals = readUnsignedShort(u + 2);\n int codeLength = readInt(u + 4);\n u += 8;\n\n // reads the bytecode to find the labels\n int codeStart = u;\n int codeEnd = u + codeLength;\n Label[] labels = new Label[codeLength + 2];\n readLabel(codeLength + 1, labels);\n while (u < codeEnd) {\n int offset = u - codeStart;\n int opcode = b[u] & 0xFF;\n switch (ClassWriter.TYPE[opcode]) {\n case ClassWriter.NOARG_INSN:\n case ClassWriter.IMPLVAR_INSN:\n u += 1;\n break;\n case ClassWriter.LABEL_INSN:\n readLabel(offset + readShort(u + 1), labels);\n u += 3;\n break;\n case ClassWriter.LABELW_INSN:\n readLabel(offset + readInt(u + 1), labels);\n u += 5;\n break;\n case ClassWriter.WIDE_INSN:\n opcode = b[u + 1] & 0xFF;\n if (opcode == Opcodes.IINC) {\n u += 6;\n } else {\n u += 4;\n }\n break;\n case ClassWriter.TABL_INSN:\n // skips 0 to 3 padding bytes\n u = u + 4 - (offset & 3);\n // reads instruction\n readLabel(offset + readInt(u), labels);\n for (int i = readInt(u + 8) - readInt(u + 4) + 1; i > 0; --i) {\n readLabel(offset + readInt(u + 12), labels);\n u += 4;\n }\n u += 12;\n break;\n case ClassWriter.LOOK_INSN:\n // skips 0 to 3 padding bytes\n u = u + 4 - (offset & 3);\n // reads instruction\n readLabel(offset + readInt(u), labels);\n for (int i = readInt(u + 4); i > 0; --i) {\n readLabel(offset + readInt(u + 12), labels);\n u += 8;\n }\n u += 8;\n break;\n case ClassWriter.VAR_INSN:\n case ClassWriter.SBYTE_INSN:\n case ClassWriter.LDC_INSN:\n u += 2;\n break;\n case ClassWriter.SHORT_INSN:\n case ClassWriter.LDCW_INSN:\n case ClassWriter.FIELDORMETH_INSN:\n case ClassWriter.TYPE_INSN:\n case ClassWriter.IINC_INSN:\n u += 3;\n break;\n case ClassWriter.ITFMETH_INSN:\n case ClassWriter.INDYMETH_INSN:\n u += 5;\n break;\n // case MANA_INSN:\n default:\n u += 4;\n break;\n }\n }\n\n // reads the try catch entries to find the labels, and also visits them\n for (int i = readUnsignedShort(u); i > 0; --i) {\n Label start = readLabel(readUnsignedShort(u + 2), labels);\n Label end = readLabel(readUnsignedShort(u + 4), labels);\n Label handler = readLabel(readUnsignedShort(u + 6), labels);\n String type = readUTF8(items[readUnsignedShort(u + 8)], c);\n mv.visitTryCatchBlock(start, end, handler, type);\n u += 8;\n }\n u += 2;\n\n // reads the code attributes\n int varTable = 0;\n int varTypeTable = 0;\n boolean zip = true;\n boolean unzip = (context.flags & EXPAND_FRAMES) != 0;\n int stackMap = 0;\n int stackMapSize = 0;\n int frameCount = 0;\n Context frame = null;\n Attribute attributes = null;\n\n for (int i = readUnsignedShort(u); i > 0; --i) {\n String attrName = readUTF8(u + 2, c);\n if (\"LocalVariableTable\".equals(attrName)) {\n if ((context.flags & SKIP_DEBUG) == 0) {\n varTable = u + 8;\n for (int j = readUnsignedShort(u + 8), v = u; j > 0; --j) {\n int label = readUnsignedShort(v + 10);\n if (labels[label] == null) {\n readLabel(label, labels).status |= Label.DEBUG;\n }\n label += readUnsignedShort(v + 12);\n if (labels[label] == null) {\n readLabel(label, labels).status |= Label.DEBUG;\n }\n v += 10;\n }\n }\n } else if (\"LocalVariableTypeTable\".equals(attrName)) {\n varTypeTable = u + 8;\n } else if (\"LineNumberTable\".equals(attrName)) {\n if ((context.flags & SKIP_DEBUG) == 0) {\n for (int j = readUnsignedShort(u + 8), v = u; j > 0; --j) {\n int label = readUnsignedShort(v + 10);\n if (labels[label] == null) {\n readLabel(label, labels).status |= Label.DEBUG;\n }\n labels[label].line = readUnsignedShort(v + 12);\n v += 4;\n }\n }\n } else if (FRAMES && \"StackMapTable\".equals(attrName)) {\n if ((context.flags & SKIP_FRAMES) == 0) {\n stackMap = u + 10;\n stackMapSize = readInt(u + 4);\n frameCount = readUnsignedShort(u + 8);\n }\n /*\n * here we do not extract the labels corresponding to the\n * attribute content. This would require a full parsing of the\n * attribute, which would need to be repeated in the second\n * phase (see below). Instead the content of the attribute is\n * read one frame at a time (i.e. after a frame has been\n * visited, the next frame is read), and the labels it contains\n * are also extracted one frame at a time. Thanks to the\n * ordering of frames, having only a \"one frame lookahead\" is\n * not a problem, i.e. it is not possible to see an offset\n * smaller than the offset of the current insn and for which no\n * Label exist.\n */\n /*\n * This is not true for UNINITIALIZED type offsets. We solve\n * this by parsing the stack map table without a full decoding\n * (see below).\n */\n } else if (FRAMES && \"StackMap\".equals(attrName)) {\n if ((context.flags & SKIP_FRAMES) == 0) {\n zip = false;\n stackMap = u + 10;\n stackMapSize = readInt(u + 4);\n frameCount = readUnsignedShort(u + 8);\n }\n /*\n * IMPORTANT! here we assume that the frames are ordered, as in\n * the StackMapTable attribute, although this is not guaranteed\n * by the attribute format.\n */\n } else {\n for (int j = 0; j < context.attrs.length; ++j) {\n if (context.attrs[j].type.equals(attrName)) {\n Attribute attr = context.attrs[j].read(this, u + 8,\n readInt(u + 4), c, codeStart - 8, labels);\n if (attr != null) {\n attr.next = attributes;\n attributes = attr;\n }\n }\n }\n }\n u += 6 + readInt(u + 4);\n }\n u += 2;\n\n // generates the first (implicit) stack map frame\n if (FRAMES && stackMap != 0) {\n /*\n * for the first explicit frame the offset is not offset_delta + 1\n * but only offset_delta; setting the implicit frame offset to -1\n * allow the use of the \"offset_delta + 1\" rule in all cases\n */\n frame = context;\n frame.offset = -1;\n frame.mode = 0;\n frame.localCount = 0;\n frame.localDiff = 0;\n frame.stackCount = 0;\n frame.local = new Object[maxLocals];\n frame.stack = new Object[maxStack];\n if (unzip) {\n getImplicitFrame(context);\n }\n /*\n * Finds labels for UNINITIALIZED frame types. Instead of decoding\n * each element of the stack map table, we look for 3 consecutive\n * bytes that \"look like\" an UNINITIALIZED type (tag 8, offset\n * within code bounds, NEW instruction at this offset). We may find\n * false positives (i.e. not real UNINITIALIZED types), but this\n * should be rare, and the only consequence will be the creation of\n * an unneeded label. This is better than creating a label for each\n * NEW instruction, and faster than fully decoding the whole stack\n * map table.\n */\n for (int i = stackMap; i < stackMap + stackMapSize - 2; ++i) {\n if (b[i] == 8) { // UNINITIALIZED FRAME TYPE\n int v = readUnsignedShort(i + 1);\n if (v >= 0 && v < codeLength) {\n if ((b[codeStart + v] & 0xFF) == Opcodes.NEW) {\n readLabel(v, labels);\n }\n }\n }\n }\n }\n\n // visits the instructions\n u = codeStart;\n while (u < codeEnd) {\n int offset = u - codeStart;\n\n // visits the label and line number for this offset, if any\n Label l = labels[offset];\n if (l != null) {\n mv.visitLabel(l);\n if ((context.flags & SKIP_DEBUG) == 0 && l.line > 0) {\n mv.visitLineNumber(l.line, l);\n }\n }\n\n // visits the frame for this offset, if any\n while (FRAMES && frame != null\n && (frame.offset == offset || frame.offset == -1)) {\n // if there is a frame for this offset, makes the visitor visit\n // it, and reads the next frame if there is one.\n if (frame.offset != -1) {\n if (!zip || unzip) {\n mv.visitFrame(Opcodes.F_NEW, frame.localCount,\n frame.local, frame.stackCount, frame.stack);\n } else {\n mv.visitFrame(frame.mode, frame.localDiff, frame.local,\n frame.stackCount, frame.stack);\n }\n }\n if (frameCount > 0) {\n stackMap = readFrame(stackMap, zip, unzip, labels, frame);\n --frameCount;\n } else {\n frame = null;\n }\n }\n\n // visits the instruction at this offset\n int opcode = b[u] & 0xFF;\n switch (ClassWriter.TYPE[opcode]) {\n case ClassWriter.NOARG_INSN:\n mv.visitInsn(opcode);\n u += 1;\n break;\n case ClassWriter.IMPLVAR_INSN:\n if (opcode > Opcodes.ISTORE) {\n opcode -= 59; // ISTORE_0\n mv.visitVarInsn(Opcodes.ISTORE + (opcode >> 2),\n opcode & 0x3);\n } else {\n opcode -= 26; // ILOAD_0\n mv.visitVarInsn(Opcodes.ILOAD + (opcode >> 2), opcode & 0x3);\n }\n u += 1;\n break;\n case ClassWriter.LABEL_INSN:\n mv.visitJumpInsn(opcode, labels[offset + readShort(u + 1)]);\n u += 3;\n break;\n case ClassWriter.LABELW_INSN:\n mv.visitJumpInsn(opcode - 33, labels[offset + readInt(u + 1)]);\n u += 5;\n break;\n case ClassWriter.WIDE_INSN:\n opcode = b[u + 1] & 0xFF;\n if (opcode == Opcodes.IINC) {\n mv.visitIincInsn(readUnsignedShort(u + 2), readShort(u + 4));\n u += 6;\n } else {\n mv.visitVarInsn(opcode, readUnsignedShort(u + 2));\n u += 4;\n }\n break;\n case ClassWriter.TABL_INSN: {\n // skips 0 to 3 padding bytes\n u = u + 4 - (offset & 3);\n // reads instruction\n int label = offset + readInt(u);\n int min = readInt(u + 4);\n int max = readInt(u + 8);\n Label[] table = new Label[max - min + 1];\n u += 12;\n for (int i = 0; i < table.length; ++i) {\n table[i] = labels[offset + readInt(u)];\n u += 4;\n }\n mv.visitTableSwitchInsn(min, max, labels[label], table);\n break;\n }\n case ClassWriter.LOOK_INSN: {\n // skips 0 to 3 padding bytes\n u = u + 4 - (offset & 3);\n // reads instruction\n int label = offset + readInt(u);\n int len = readInt(u + 4);\n int[] keys = new int[len];\n Label[] values = new Label[len];\n u += 8;\n for (int i = 0; i < len; ++i) {\n keys[i] = readInt(u);\n values[i] = labels[offset + readInt(u + 4)];\n u += 8;\n }\n mv.visitLookupSwitchInsn(labels[label], keys, values);\n break;\n }\n case ClassWriter.VAR_INSN:\n mv.visitVarInsn(opcode, b[u + 1] & 0xFF);\n u += 2;\n break;\n case ClassWriter.SBYTE_INSN:\n mv.visitIntInsn(opcode, b[u + 1]);\n u += 2;\n break;\n case ClassWriter.SHORT_INSN:\n mv.visitIntInsn(opcode, readShort(u + 1));\n u += 3;\n break;\n case ClassWriter.LDC_INSN:\n mv.visitLdcInsn(readConst(b[u + 1] & 0xFF, c));\n u += 2;\n break;\n case ClassWriter.LDCW_INSN:\n mv.visitLdcInsn(readConst(readUnsignedShort(u + 1), c));\n u += 3;\n break;\n case ClassWriter.FIELDORMETH_INSN:\n case ClassWriter.ITFMETH_INSN: {\n int cpIndex = items[readUnsignedShort(u + 1)];\n String iowner = readClass(cpIndex, c);\n cpIndex = items[readUnsignedShort(cpIndex + 2)];\n String iname = readUTF8(cpIndex, c);\n String idesc = readUTF8(cpIndex + 2, c);\n if (opcode < Opcodes.INVOKEVIRTUAL) {\n mv.visitFieldInsn(opcode, iowner, iname, idesc);\n } else {\n mv.visitMethodInsn(opcode, iowner, iname, idesc);\n }\n if (opcode == Opcodes.INVOKEINTERFACE) {\n u += 5;\n } else {\n u += 3;\n }\n break;\n }\n case ClassWriter.INDYMETH_INSN: {\n int cpIndex = items[readUnsignedShort(u + 1)];\n int bsmIndex = context.bootstrapMethods[readUnsignedShort(cpIndex)];\n Handle bsm = (Handle) readConst(readUnsignedShort(bsmIndex), c);\n int bsmArgCount = readUnsignedShort(bsmIndex + 2);\n Object[] bsmArgs = new Object[bsmArgCount];\n bsmIndex += 4;\n for (int i = 0; i < bsmArgCount; i++) {\n bsmArgs[i] = readConst(readUnsignedShort(bsmIndex), c);\n bsmIndex += 2;\n }\n cpIndex = items[readUnsignedShort(cpIndex + 2)];\n String iname = readUTF8(cpIndex, c);\n String idesc = readUTF8(cpIndex + 2, c);\n mv.visitInvokeDynamicInsn(iname, idesc, bsm, bsmArgs);\n u += 5;\n break;\n }\n case ClassWriter.TYPE_INSN:\n mv.visitTypeInsn(opcode, readClass(u + 1, c));\n u += 3;\n break;\n case ClassWriter.IINC_INSN:\n mv.visitIincInsn(b[u + 1] & 0xFF, b[u + 2]);\n u += 3;\n break;\n // case MANA_INSN:\n default:\n mv.visitMultiANewArrayInsn(readClass(u + 1, c), b[u + 3] & 0xFF);\n u += 4;\n break;\n }\n }\n if (labels[codeLength] != null) {\n mv.visitLabel(labels[codeLength]);\n }\n\n // visits the local variable tables\n if ((context.flags & SKIP_DEBUG) == 0 && varTable != 0) {\n int[] typeTable = null;\n if (varTypeTable != 0) {\n u = varTypeTable + 2;\n typeTable = new int[readUnsignedShort(varTypeTable) * 3];\n for (int i = typeTable.length; i > 0;) {\n typeTable[--i] = u + 6; // signature\n typeTable[--i] = readUnsignedShort(u + 8); // index\n typeTable[--i] = readUnsignedShort(u); // start\n u += 10;\n }\n }\n u = varTable + 2;\n for (int i = readUnsignedShort(varTable); i > 0; --i) {\n int start = readUnsignedShort(u);\n int length = readUnsignedShort(u + 2);\n int index = readUnsignedShort(u + 8);\n String vsignature = null;\n if (typeTable != null) {\n for (int j = 0; j < typeTable.length; j += 3) {\n if (typeTable[j] == start && typeTable[j + 1] == index) {\n vsignature = readUTF8(typeTable[j + 2], c);\n break;\n }\n }\n }\n mv.visitLocalVariable(readUTF8(u + 4, c), readUTF8(u + 6, c),\n vsignature, labels[start], labels[start + length],\n index);\n u += 10;\n }\n }\n\n // visits the code attributes\n while (attributes != null) {\n Attribute attr = attributes.next;\n attributes.next = null;\n mv.visitAttribute(attributes);\n attributes = attr;\n }\n\n // visits the max stack and max locals values\n mv.visitMaxs(maxStack, maxLocals);\n }\n\n /**\n * Reads parameter annotations and makes the given visitor visit them.\n *\n * @param v\n * start offset in {@link #b b} of the annotations to be read.\n * @param desc\n * the method descriptor.\n * @param buf\n * buffer to be used to call {@link #readUTF8 readUTF8},\n * {@link #readClass(int,char[]) readClass} or {@link #readConst\n * readConst}.\n * @param visible\n * true if the annotations to be read are visible at\n * runtime.\n * @param mv\n * the visitor that must visit the annotations.\n */\n private void readParameterAnnotations(int v, final String desc,\n final char[] buf, final boolean visible, final MethodVisitor mv) {\n int i;\n int n = b[v++] & 0xFF;\n // workaround for a bug in javac (javac compiler generates a parameter\n // annotation array whose size is equal to the number of parameters in\n // the Java source file, while it should generate an array whose size is\n // equal to the number of parameters in the method descriptor - which\n // includes the synthetic parameters added by the compiler). This work-\n // around supposes that the synthetic parameters are the first ones.\n int synthetics = Type.getArgumentTypes(desc).length - n;\n AnnotationVisitor av;\n for (i = 0; i < synthetics; ++i) {\n // virtual annotation to detect synthetic parameters in MethodWriter\n av = mv.visitParameterAnnotation(i, \"Ljava/lang/Synthetic;\", false);\n if (av != null) {\n av.visitEnd();\n }\n }\n for (; i < n + synthetics; ++i) {\n int j = readUnsignedShort(v);\n v += 2;\n for (; j > 0; --j) {\n av = mv.visitParameterAnnotation(i, readUTF8(v, buf), visible);\n v = readAnnotationValues(v + 2, buf, true, av);\n }\n }\n }\n\n /**\n * Reads the values of an annotation and makes the given visitor visit them.\n *\n * @param v\n * the start offset in {@link #b b} of the values to be read\n * (including the unsigned short that gives the number of\n * values).\n * @param buf\n * buffer to be used to call {@link #readUTF8 readUTF8},\n * {@link #readClass(int,char[]) readClass} or {@link #readConst\n * readConst}.\n * @param named\n * if the annotation values are named or not.\n * @param av\n * the visitor that must visit the values.\n * @return the end offset of the annotation values.\n */\n private int readAnnotationValues(int v, final char[] buf,\n final boolean named, final AnnotationVisitor av) {\n int i = readUnsignedShort(v);\n v += 2;\n if (named) {\n for (; i > 0; --i) {\n v = readAnnotationValue(v + 2, buf, readUTF8(v, buf), av);\n }\n } else {\n for (; i > 0; --i) {\n v = readAnnotationValue(v, buf, null, av);\n }\n }\n if (av != null) {\n av.visitEnd();\n }\n return v;\n }\n\n /**\n * Reads a value of an annotation and makes the given visitor visit it.\n *\n * @param v\n * the start offset in {@link #b b} of the value to be read\n * (not including the value name constant pool index).\n * @param buf\n * buffer to be used to call {@link #readUTF8 readUTF8},\n * {@link #readClass(int,char[]) readClass} or {@link #readConst\n * readConst}.\n * @param name\n * the name of the value to be read.\n * @param av\n * the visitor that must visit the value.\n * @return the end offset of the annotation value.\n */\n private int readAnnotationValue(int v, final char[] buf, final String name,\n final AnnotationVisitor av) {\n int i;\n if (av == null) {\n switch (b[v] & 0xFF) {\n case 'e': // enum_const_value\n return v + 5;\n case '@': // annotation_value\n return readAnnotationValues(v + 3, buf, true, null);\n case '[': // array_value\n return readAnnotationValues(v + 1, buf, false, null);\n default:\n return v + 3;\n }\n }\n switch (b[v++] & 0xFF) {\n case 'I': // pointer to CONSTANT_Integer\n case 'J': // pointer to CONSTANT_Long\n case 'F': // pointer to CONSTANT_Float\n case 'D': // pointer to CONSTANT_Double\n av.visit(name, readConst(readUnsignedShort(v), buf));\n v += 2;\n break;\n case 'B': // pointer to CONSTANT_Byte\n av.visit(name,\n new Byte((byte) readInt(items[readUnsignedShort(v)])));\n v += 2;\n break;\n case 'Z': // pointer to CONSTANT_Boolean\n av.visit(name,\n readInt(items[readUnsignedShort(v)]) == 0 ? Boolean.FALSE\n : Boolean.TRUE);\n v += 2;\n break;\n case 'S': // pointer to CONSTANT_Short\n av.visit(name, new Short(\n (short) readInt(items[readUnsignedShort(v)])));\n v += 2;\n break;\n case 'C': // pointer to CONSTANT_Char\n av.visit(name, new Character(\n (char) readInt(items[readUnsignedShort(v)])));\n v += 2;\n break;\n case 's': // pointer to CONSTANT_Utf8\n av.visit(name, readUTF8(v, buf));\n v += 2;\n break;\n case 'e': // enum_const_value\n av.visitEnum(name, readUTF8(v, buf), readUTF8(v + 2, buf));\n v += 4;\n break;\n case 'c': // class_info\n av.visit(name, Type.getType(readUTF8(v, buf)));\n v += 2;\n break;\n case '@': // annotation_value\n v = readAnnotationValues(v + 2, buf, true,\n av.visitAnnotation(name, readUTF8(v, buf)));\n break;\n case '[': // array_value\n int size = readUnsignedShort(v);\n v += 2;\n if (size == 0) {\n return readAnnotationValues(v - 2, buf, false,\n av.visitArray(name));\n }\n switch (this.b[v++] & 0xFF) {\n case 'B':\n byte[] bv = new byte[size];\n for (i = 0; i < size; i++) {\n bv[i] = (byte) readInt(items[readUnsignedShort(v)]);\n v += 3;\n }\n av.visit(name, bv);\n --v;\n break;\n case 'Z':\n boolean[] zv = new boolean[size];\n for (i = 0; i < size; i++) {\n zv[i] = readInt(items[readUnsignedShort(v)]) != 0;\n v += 3;\n }\n av.visit(name, zv);\n --v;\n break;\n case 'S':\n short[] sv = new short[size];\n for (i = 0; i < size; i++) {\n sv[i] = (short) readInt(items[readUnsignedShort(v)]);\n v += 3;\n }\n av.visit(name, sv);\n --v;\n break;\n case 'C':\n char[] cv = new char[size];\n for (i = 0; i < size; i++) {\n cv[i] = (char) readInt(items[readUnsignedShort(v)]);\n v += 3;\n }\n av.visit(name, cv);\n --v;\n break;\n case 'I':\n int[] iv = new int[size];\n for (i = 0; i < size; i++) {\n iv[i] = readInt(items[readUnsignedShort(v)]);\n v += 3;\n }\n av.visit(name, iv);\n --v;\n break;\n case 'J':\n long[] lv = new long[size];\n for (i = 0; i < size; i++) {\n lv[i] = readLong(items[readUnsignedShort(v)]);\n v += 3;\n }\n av.visit(name, lv);\n --v;\n break;\n case 'F':\n float[] fv = new float[size];\n for (i = 0; i < size; i++) {\n fv[i] = Float\n .intBitsToFloat(readInt(items[readUnsignedShort(v)]));\n v += 3;\n }\n av.visit(name, fv);\n --v;\n break;\n case 'D':\n double[] dv = new double[size];\n for (i = 0; i < size; i++) {\n dv[i] = Double\n .longBitsToDouble(readLong(items[readUnsignedShort(v)]));\n v += 3;\n }\n av.visit(name, dv);\n --v;\n break;\n default:\n v = readAnnotationValues(v - 3, buf, false, av.visitArray(name));\n }\n }\n return v;\n }\n\n /**\n * Computes the implicit frame of the method currently being parsed (as\n * defined in the given {@link Context}) and stores it in the given context.\n *\n * @param frame\n * information about the class being parsed.\n */\n private void getImplicitFrame(final Context frame) {\n String desc = frame.desc;\n Object[] locals = frame.local;\n int local = 0;\n if ((frame.access & Opcodes.ACC_STATIC) == 0) {\n if (\"\".equals(frame.name)) {\n locals[local++] = Opcodes.UNINITIALIZED_THIS;\n } else {\n locals[local++] = readClass(header + 2, frame.buffer);\n }\n }\n int i = 1;\n loop: while (true) {\n int j = i;\n switch (desc.charAt(i++)) {\n case 'Z':\n case 'C':\n case 'B':\n case 'S':\n case 'I':\n locals[local++] = Opcodes.INTEGER;\n break;\n case 'F':\n locals[local++] = Opcodes.FLOAT;\n break;\n case 'J':\n locals[local++] = Opcodes.LONG;\n break;\n case 'D':\n locals[local++] = Opcodes.DOUBLE;\n break;\n case '[':\n while (desc.charAt(i) == '[') {\n ++i;\n }\n if (desc.charAt(i) == 'L') {\n ++i;\n while (desc.charAt(i) != ';') {\n ++i;\n }\n }\n locals[local++] = desc.substring(j, ++i);\n break;\n case 'L':\n while (desc.charAt(i) != ';') {\n ++i;\n }\n locals[local++] = desc.substring(j + 1, i++);\n break;\n default:\n break loop;\n }\n }\n frame.localCount = local;\n }\n\n /**\n * Reads a stack map frame and stores the result in the given\n * {@link Context} object.\n *\n * @param stackMap\n * the start offset of a stack map frame in the class file.\n * @param zip\n * if the stack map frame at stackMap is compressed or not.\n * @param unzip\n * if the stack map frame must be uncompressed.\n * @param labels\n * the labels of the method currently being parsed, indexed by\n * their offset. A new label for the parsed stack map frame is\n * stored in this array if it does not already exist.\n * @param frame\n * where the parsed stack map frame must be stored.\n * @return the offset of the first byte following the parsed frame.\n */\n private int readFrame(int stackMap, boolean zip, boolean unzip,\n Label[] labels, Context frame) {\n char[] c = frame.buffer;\n int tag;\n int delta;\n if (zip) {\n tag = b[stackMap++] & 0xFF;\n } else {\n tag = MethodWriter.FULL_FRAME;\n frame.offset = -1;\n }\n frame.localDiff = 0;\n if (tag < MethodWriter.SAME_LOCALS_1_STACK_ITEM_FRAME) {\n delta = tag;\n frame.mode = Opcodes.F_SAME;\n frame.stackCount = 0;\n } else if (tag < MethodWriter.RESERVED) {\n delta = tag - MethodWriter.SAME_LOCALS_1_STACK_ITEM_FRAME;\n stackMap = readFrameType(frame.stack, 0, stackMap, c, labels);\n frame.mode = Opcodes.F_SAME1;\n frame.stackCount = 1;\n } else {\n delta = readUnsignedShort(stackMap);\n stackMap += 2;\n if (tag == MethodWriter.SAME_LOCALS_1_STACK_ITEM_FRAME_EXTENDED) {\n stackMap = readFrameType(frame.stack, 0, stackMap, c, labels);\n frame.mode = Opcodes.F_SAME1;\n frame.stackCount = 1;\n } else if (tag >= MethodWriter.CHOP_FRAME\n && tag < MethodWriter.SAME_FRAME_EXTENDED) {\n frame.mode = Opcodes.F_CHOP;\n frame.localDiff = MethodWriter.SAME_FRAME_EXTENDED - tag;\n frame.localCount -= frame.localDiff;\n frame.stackCount = 0;\n } else if (tag == MethodWriter.SAME_FRAME_EXTENDED) {\n frame.mode = Opcodes.F_SAME;\n frame.stackCount = 0;\n } else if (tag < MethodWriter.FULL_FRAME) {\n int local = unzip ? frame.localCount : 0;\n for (int i = tag - MethodWriter.SAME_FRAME_EXTENDED; i > 0; i--) {\n stackMap = readFrameType(frame.local, local++, stackMap, c,\n labels);\n }\n frame.mode = Opcodes.F_APPEND;\n frame.localDiff = tag - MethodWriter.SAME_FRAME_EXTENDED;\n frame.localCount += frame.localDiff;\n frame.stackCount = 0;\n } else { // if (tag == FULL_FRAME) {\n frame.mode = Opcodes.F_FULL;\n int n = readUnsignedShort(stackMap);\n stackMap += 2;\n frame.localDiff = n;\n frame.localCount = n;\n for (int local = 0; n > 0; n--) {\n stackMap = readFrameType(frame.local, local++, stackMap, c,\n labels);\n }\n n = readUnsignedShort(stackMap);\n stackMap += 2;\n frame.stackCount = n;\n for (int stack = 0; n > 0; n--) {\n stackMap = readFrameType(frame.stack, stack++, stackMap, c,\n labels);\n }\n }\n }\n frame.offset += delta + 1;\n readLabel(frame.offset, labels);\n return stackMap;\n }\n\n /**\n * Reads a stack map frame type and stores it at the given index in the\n * given array.\n *\n * @param frame\n * the array where the parsed type must be stored.\n * @param index\n * the index in 'frame' where the parsed type must be stored.\n * @param v\n * the start offset of the stack map frame type to read.\n * @param buf\n * a buffer to read strings.\n * @param labels\n * the labels of the method currently being parsed, indexed by\n * their offset. If the parsed type is an Uninitialized type, a\n * new label for the corresponding NEW instruction is stored in\n * this array if it does not already exist.\n * @return the offset of the first byte after the parsed type.\n */\n private int readFrameType(final Object[] frame, final int index, int v,\n final char[] buf, final Label[] labels) {\n int type = b[v++] & 0xFF;\n switch (type) {\n case 0:\n frame[index] = Opcodes.TOP;\n break;\n case 1:\n frame[index] = Opcodes.INTEGER;\n break;\n case 2:\n frame[index] = Opcodes.FLOAT;\n break;\n case 3:\n frame[index] = Opcodes.DOUBLE;\n break;\n case 4:\n frame[index] = Opcodes.LONG;\n break;\n case 5:\n frame[index] = Opcodes.NULL;\n break;\n case 6:\n frame[index] = Opcodes.UNINITIALIZED_THIS;\n break;\n case 7: // Object\n frame[index] = readClass(v, buf);\n v += 2;\n break;\n default: // Uninitialized\n frame[index] = readLabel(readUnsignedShort(v), labels);\n v += 2;\n }\n return v;\n }\n\n /**\n * Returns the label corresponding to the given offset. The default\n * implementation of this method creates a label for the given offset if it\n * has not been already created.\n *\n * @param offset\n * a bytecode offset in a method.\n * @param labels\n * the already created labels, indexed by their offset. If a\n * label already exists for offset this method must not create a\n * new one. Otherwise it must store the new label in this array.\n * @return a non null Label, which must be equal to labels[offset].\n */\n protected Label readLabel(int offset, Label[] labels) {\n if (labels[offset] == null) {\n labels[offset] = new Label();\n }\n return labels[offset];\n }\n\n /**\n * Returns the start index of the attribute_info structure of this class.\n *\n * @return the start index of the attribute_info structure of this class.\n */\n private int getAttributes() {\n // skips the header\n int u = header + 8 + readUnsignedShort(header + 6) * 2;\n // skips fields and methods\n for (int i = readUnsignedShort(u); i > 0; --i) {\n for (int j = readUnsignedShort(u + 8); j > 0; --j) {\n u += 6 + readInt(u + 12);\n }\n u += 8;\n }\n u += 2;\n for (int i = readUnsignedShort(u); i > 0; --i) {\n for (int j = readUnsignedShort(u + 8); j > 0; --j) {\n u += 6 + readInt(u + 12);\n }\n u += 8;\n }\n // the attribute_info structure starts just after the methods\n return u + 2;\n }\n\n /**\n * Reads an attribute in {@link #b b}.\n *\n * @param attrs\n * prototypes of the attributes that must be parsed during the\n * visit of the class. Any attribute whose type is not equal to\n * the type of one the prototypes is ignored (i.e. an empty\n * {@link Attribute} instance is returned).\n * @param type\n * the type of the attribute.\n * @param off\n * index of the first byte of the attribute's content in\n * {@link #b b}. The 6 attribute header bytes, containing the\n * type and the length of the attribute, are not taken into\n * account here (they have already been read).\n * @param len\n * the length of the attribute's content.\n * @param buf\n * buffer to be used to call {@link #readUTF8 readUTF8},\n * {@link #readClass(int,char[]) readClass} or {@link #readConst\n * readConst}.\n * @param codeOff\n * index of the first byte of code's attribute content in\n * {@link #b b}, or -1 if the attribute to be read is not a code\n * attribute. The 6 attribute header bytes, containing the type\n * and the length of the attribute, are not taken into account\n * here.\n * @param labels\n * the labels of the method's code, or null if the\n * attribute to be read is not a code attribute.\n * @return the attribute that has been read, or null to skip this\n * attribute.\n */\n private Attribute readAttribute(final Attribute[] attrs, final String type,\n final int off, final int len, final char[] buf, final int codeOff,\n final Label[] labels) {\n for (int i = 0; i < attrs.length; ++i) {\n if (attrs[i].type.equals(type)) {\n return attrs[i].read(this, off, len, buf, codeOff, labels);\n }\n }\n return new Attribute(type).read(this, off, len, null, -1, null);\n }\n\n // ------------------------------------------------------------------------\n // Utility methods: low level parsing\n // ------------------------------------------------------------------------\n\n /**\n * Returns the number of constant pool items in {@link #b b}.\n *\n * @return the number of constant pool items in {@link #b b}.\n */\n public int getItemCount() {\n return items.length;\n }\n\n /**\n * Returns the start index of the constant pool item in {@link #b b}, plus\n * one. This method is intended for {@link Attribute} sub classes, and is\n * normally not needed by class generators or adapters.\n *\n * @param item\n * the index a constant pool item.\n * @return the start index of the constant pool item in {@link #b b}, plus\n * one.\n */\n public int getItem(final int item) {\n return items[item];\n }\n\n /**\n * Returns the maximum length of the strings contained in the constant pool\n * of the class.\n *\n * @return the maximum length of the strings contained in the constant pool\n * of the class.\n */\n public int getMaxStringLength() {\n return maxStringLength;\n }\n\n /**\n * Reads a byte value in {@link #b b}. This method is intended for\n * {@link Attribute} sub classes, and is normally not needed by class\n * generators or adapters.\n *\n * @param index\n * the start index of the value to be read in {@link #b b}.\n * @return the read value.\n */\n public int readByte(final int index) {\n return b[index] & 0xFF;\n }\n\n /**\n * Reads an unsigned short value in {@link #b b}. This method is intended\n * for {@link Attribute} sub classes, and is normally not needed by class\n * generators or adapters.\n *\n * @param index\n * the start index of the value to be read in {@link #b b}.\n * @return the read value.\n */\n public int readUnsignedShort(final int index) {\n byte[] b = this.b;\n return ((b[index] & 0xFF) << 8) | (b[index + 1] & 0xFF);\n }\n\n /**\n * Reads a signed short value in {@link #b b}. This method is intended\n * for {@link Attribute} sub classes, and is normally not needed by class\n * generators or adapters.\n *\n * @param index\n * the start index of the value to be read in {@link #b b}.\n * @return the read value.\n */\n public short readShort(final int index) {\n byte[] b = this.b;\n return (short) (((b[index] & 0xFF) << 8) | (b[index + 1] & 0xFF));\n }\n\n /**\n * Reads a signed int value in {@link #b b}. This method is intended for\n * {@link Attribute} sub classes, and is normally not needed by class\n * generators or adapters.\n *\n * @param index\n * the start index of the value to be read in {@link #b b}.\n * @return the read value.\n */\n public int readInt(final int index) {\n byte[] b = this.b;\n return ((b[index] & 0xFF) << 24) | ((b[index + 1] & 0xFF) << 16)\n | ((b[index + 2] & 0xFF) << 8) | (b[index + 3] & 0xFF);\n }\n\n /**\n * Reads a signed long value in {@link #b b}. This method is intended for\n * {@link Attribute} sub classes, and is normally not needed by class\n * generators or adapters.\n *\n * @param index\n * the start index of the value to be read in {@link #b b}.\n * @return the read value.\n */\n public long readLong(final int index) {\n long l1 = readInt(index);\n long l0 = readInt(index + 4) & 0xFFFFFFFFL;\n return (l1 << 32) | l0;\n }\n\n /**\n * Reads an UTF8 string constant pool item in {@link #b b}. This method\n * is intended for {@link Attribute} sub classes, and is normally not needed\n * by class generators or adapters.\n *\n * @param index\n * the start index of an unsigned short value in {@link #b b},\n * whose value is the index of an UTF8 constant pool item.\n * @param buf\n * buffer to be used to read the item. This buffer must be\n * sufficiently large. It is not automatically resized.\n * @return the String corresponding to the specified UTF8 item.\n */\n public String readUTF8(int index, final char[] buf) {\n int item = readUnsignedShort(index);\n if (index == 0 || item == 0) {\n return null;\n }\n String s = strings[item];\n if (s != null) {\n return s;\n }\n index = items[item];\n return strings[item] = readUTF(index + 2, readUnsignedShort(index), buf);\n }\n\n /**\n * Reads UTF8 string in {@link #b b}.\n *\n * @param index\n * start offset of the UTF8 string to be read.\n * @param utfLen\n * length of the UTF8 string to be read.\n * @param buf\n * buffer to be used to read the string. This buffer must be\n * sufficiently large. It is not automatically resized.\n * @return the String corresponding to the specified UTF8 string.\n */\n private String readUTF(int index, final int utfLen, final char[] buf) {\n int endIndex = index + utfLen;\n byte[] b = this.b;\n int strLen = 0;\n int c;\n int st = 0;\n char cc = 0;\n while (index < endIndex) {\n c = b[index++];\n switch (st) {\n case 0:\n c = c & 0xFF;\n if (c < 0x80) { // 0xxxxxxx\n buf[strLen++] = (char) c;\n } else if (c < 0xE0 && c > 0xBF) { // 110x xxxx 10xx xxxx\n cc = (char) (c & 0x1F);\n st = 1;\n } else { // 1110 xxxx 10xx xxxx 10xx xxxx\n cc = (char) (c & 0x0F);\n st = 2;\n }\n break;\n\n case 1: // byte 2 of 2-byte char or byte 3 of 3-byte char\n buf[strLen++] = (char) ((cc << 6) | (c & 0x3F));\n st = 0;\n break;\n\n case 2: // byte 2 of 3-byte char\n cc = (char) ((cc << 6) | (c & 0x3F));\n st = 1;\n break;\n }\n }\n return new String(buf, 0, strLen);\n }\n\n /**\n * Reads a class constant pool item in {@link #b b}. This method is\n * intended for {@link Attribute} sub classes, and is normally not needed by\n * class generators or adapters.\n *\n * @param index\n * the start index of an unsigned short value in {@link #b b},\n * whose value is the index of a class constant pool item.\n * @param buf\n * buffer to be used to read the item. This buffer must be\n * sufficiently large. It is not automatically resized.\n * @return the String corresponding to the specified class item.\n */\n public String readClass(final int index, final char[] buf) {\n // computes the start index of the CONSTANT_Class item in b\n // and reads the CONSTANT_Utf8 item designated by\n // the first two bytes of this CONSTANT_Class item\n return readUTF8(items[readUnsignedShort(index)], buf);\n }\n\n /**\n * Reads a numeric or string constant pool item in {@link #b b}. This\n * method is intended for {@link Attribute} sub classes, and is normally not\n * needed by class generators or adapters.\n *\n * @param item\n * the index of a constant pool item.\n * @param buf\n * buffer to be used to read the item. This buffer must be\n * sufficiently large. It is not automatically resized.\n * @return the {@link Integer}, {@link Float}, {@link Long}, {@link Double},\n * {@link String}, {@link Type} or {@link Handle} corresponding to\n * the given constant pool item.\n */\n public Object readConst(final int item, final char[] buf) {\n int index = items[item];\n switch (b[index - 1]) {\n case ClassWriter.INT:\n return new Integer(readInt(index));\n case ClassWriter.FLOAT:\n return new Float(Float.intBitsToFloat(readInt(index)));\n case ClassWriter.LONG:\n return new Long(readLong(index));\n case ClassWriter.DOUBLE:\n return new Double(Double.longBitsToDouble(readLong(index)));\n case ClassWriter.CLASS:\n return Type.getObjectType(readUTF8(index, buf));\n case ClassWriter.STR:\n return readUTF8(index, buf);\n case ClassWriter.MTYPE:\n return Type.getMethodType(readUTF8(index, buf));\n default: // case ClassWriter.HANDLE_BASE + [1..9]:\n int tag = readByte(index);\n int[] items = this.items;\n int cpIndex = items[readUnsignedShort(index + 1)];\n String owner = readClass(cpIndex, buf);\n cpIndex = items[readUnsignedShort(cpIndex + 2)];\n String name = readUTF8(cpIndex, buf);\n String desc = readUTF8(cpIndex + 2, buf);\n return new Handle(tag, owner, name, desc);\n }\n }\n}\n" }, { "path": "src/jvm/clojure/asm/ClassVisitor.java", "content": "/***\n * ASM: a very small and fast Java bytecode manipulation framework\n * Copyright (c) 2000-2011 INRIA, France Telecom\n * All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions\n * are met:\n * 1. Redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer.\n * 2. Redistributions in binary form must reproduce the above copyright\n * notice, this list of conditions and the following disclaimer in the\n * documentation and/or other materials provided with the distribution.\n * 3. Neither the name of the copyright holders nor the names of its\n * contributors may be used to endorse or promote products derived from\n * this software without specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\n * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\n * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE\n * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR\n * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF\n * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\n * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN\n * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\n * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF\n * THE POSSIBILITY OF SUCH DAMAGE.\n */\npackage clojure.asm;\n\n/**\n * A visitor to visit a Java class. The methods of this class must be called in\n * the following order: visit [ visitSource ] [\n * visitOuterClass ] ( visitAnnotation |\n * visitAttribute )* ( visitInnerClass | visitField |\n * visitMethod )* visitEnd.\n *\n * @author Eric Bruneton\n */\npublic abstract class ClassVisitor {\n\n /**\n * The ASM API version implemented by this visitor. The value of this field\n * must be one of {@link Opcodes#ASM4}.\n */\n protected final int api;\n\n /**\n * The class visitor to which this visitor must delegate method calls. May\n * be null.\n */\n protected ClassVisitor cv;\n\n /**\n * Constructs a new {@link ClassVisitor}.\n *\n * @param api\n * the ASM API version implemented by this visitor. Must be one\n * of {@link Opcodes#ASM4}.\n */\n public ClassVisitor(final int api) {\n this(api, null);\n }\n\n /**\n * Constructs a new {@link ClassVisitor}.\n *\n * @param api\n * the ASM API version implemented by this visitor. Must be one\n * of {@link Opcodes#ASM4}.\n * @param cv\n * the class visitor to which this visitor must delegate method\n * calls. May be null.\n */\n public ClassVisitor(final int api, final ClassVisitor cv) {\n if (api != Opcodes.ASM4) {\n throw new IllegalArgumentException();\n }\n this.api = api;\n this.cv = cv;\n }\n\n /**\n * Visits the header of the class.\n *\n * @param version\n * the class version.\n * @param access\n * the class's access flags (see {@link Opcodes}). This parameter\n * also indicates if the class is deprecated.\n * @param name\n * the internal name of the class (see\n * {@link Type#getInternalName() getInternalName}).\n * @param signature\n * the signature of this class. May be null if the class\n * is not a generic one, and does not extend or implement generic\n * classes or interfaces.\n * @param superName\n * the internal of name of the super class (see\n * {@link Type#getInternalName() getInternalName}). For\n * interfaces, the super class is {@link Object}. May be\n * null, but only for the {@link Object} class.\n * @param interfaces\n * the internal names of the class's interfaces (see\n * {@link Type#getInternalName() getInternalName}). May be\n * null.\n */\n public void visit(int version, int access, String name, String signature,\n String superName, String[] interfaces) {\n if (cv != null) {\n cv.visit(version, access, name, signature, superName, interfaces);\n }\n }\n\n /**\n * Visits the source of the class.\n *\n * @param source\n * the name of the source file from which the class was compiled.\n * May be null.\n * @param debug\n * additional debug information to compute the correspondance\n * between source and compiled elements of the class. May be\n * null.\n */\n public void visitSource(String source, String debug) {\n if (cv != null) {\n cv.visitSource(source, debug);\n }\n }\n\n /**\n * Visits the enclosing class of the class. This method must be called only\n * if the class has an enclosing class.\n *\n * @param owner\n * internal name of the enclosing class of the class.\n * @param name\n * the name of the method that contains the class, or\n * null if the class is not enclosed in a method of its\n * enclosing class.\n * @param desc\n * the descriptor of the method that contains the class, or\n * null if the class is not enclosed in a method of its\n * enclosing class.\n */\n public void visitOuterClass(String owner, String name, String desc) {\n if (cv != null) {\n cv.visitOuterClass(owner, name, desc);\n }\n }\n\n /**\n * Visits an annotation of the class.\n *\n * @param desc\n * the class descriptor of the annotation class.\n * @param visible\n * true if the annotation is visible at runtime.\n * @return a visitor to visit the annotation values, or null if\n * this visitor is not interested in visiting this annotation.\n */\n public AnnotationVisitor visitAnnotation(String desc, boolean visible) {\n if (cv != null) {\n return cv.visitAnnotation(desc, visible);\n }\n return null;\n }\n\n /**\n * Visits a non standard attribute of the class.\n *\n * @param attr\n * an attribute.\n */\n public void visitAttribute(Attribute attr) {\n if (cv != null) {\n cv.visitAttribute(attr);\n }\n }\n\n /**\n * Visits information about an inner class. This inner class is not\n * necessarily a member of the class being visited.\n *\n * @param name\n * the internal name of an inner class (see\n * {@link Type#getInternalName() getInternalName}).\n * @param outerName\n * the internal name of the class to which the inner class\n * belongs (see {@link Type#getInternalName() getInternalName}).\n * May be null for not member classes.\n * @param innerName\n * the (simple) name of the inner class inside its enclosing\n * class. May be null for anonymous inner classes.\n * @param access\n * the access flags of the inner class as originally declared in\n * the enclosing class.\n */\n public void visitInnerClass(String name, String outerName,\n String innerName, int access) {\n if (cv != null) {\n cv.visitInnerClass(name, outerName, innerName, access);\n }\n }\n\n /**\n * Visits a field of the class.\n *\n * @param access\n * the field's access flags (see {@link Opcodes}). This parameter\n * also indicates if the field is synthetic and/or deprecated.\n * @param name\n * the field's name.\n * @param desc\n * the field's descriptor (see {@link Type Type}).\n * @param signature\n * the field's signature. May be null if the field's\n * type does not use generic types.\n * @param value\n * the field's initial value. This parameter, which may be\n * null if the field does not have an initial value,\n * must be an {@link Integer}, a {@link Float}, a {@link Long}, a\n * {@link Double} or a {@link String} (for int,\n * float, long or String fields\n * respectively). This parameter is only used for static\n * fields. Its value is ignored for non static fields, which\n * must be initialized through bytecode instructions in\n * constructors or methods.\n * @return a visitor to visit field annotations and attributes, or\n * null if this class visitor is not interested in visiting\n * these annotations and attributes.\n */\n public FieldVisitor visitField(int access, String name, String desc,\n String signature, Object value) {\n if (cv != null) {\n return cv.visitField(access, name, desc, signature, value);\n }\n return null;\n }\n\n /**\n * Visits a method of the class. This method must return a new\n * {@link MethodVisitor} instance (or null) each time it is called,\n * i.e., it should not return a previously returned visitor.\n *\n * @param access\n * the method's access flags (see {@link Opcodes}). This\n * parameter also indicates if the method is synthetic and/or\n * deprecated.\n * @param name\n * the method's name.\n * @param desc\n * the method's descriptor (see {@link Type Type}).\n * @param signature\n * the method's signature. May be null if the method\n * parameters, return type and exceptions do not use generic\n * types.\n * @param exceptions\n * the internal names of the method's exception classes (see\n * {@link Type#getInternalName() getInternalName}). May be\n * null.\n * @return an object to visit the byte code of the method, or null\n * if this class visitor is not interested in visiting the code of\n * this method.\n */\n public MethodVisitor visitMethod(int access, String name, String desc,\n String signature, String[] exceptions) {\n if (cv != null) {\n return cv.visitMethod(access, name, desc, signature, exceptions);\n }\n return null;\n }\n\n /**\n * Visits the end of the class. This method, which is the last one to be\n * called, is used to inform the visitor that all the fields and methods of\n * the class have been visited.\n */\n public void visitEnd() {\n if (cv != null) {\n cv.visitEnd();\n }\n }\n}\n" }, { "path": "src/jvm/clojure/asm/ClassWriter.java", "content": "/***\n * ASM: a very small and fast Java bytecode manipulation framework\n * Copyright (c) 2000-2011 INRIA, France Telecom\n * All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions\n * are met:\n * 1. Redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer.\n * 2. Redistributions in binary form must reproduce the above copyright\n * notice, this list of conditions and the following disclaimer in the\n * documentation and/or other materials provided with the distribution.\n * 3. Neither the name of the copyright holders nor the names of its\n * contributors may be used to endorse or promote products derived from\n * this software without specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\n * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\n * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE\n * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR\n * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF\n * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\n * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN\n * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\n * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF\n * THE POSSIBILITY OF SUCH DAMAGE.\n */\npackage clojure.asm;\n\nimport clojure.lang.SourceWriter;\n\n/**\n * A {@link ClassVisitor} that generates classes in bytecode form. More\n * precisely this visitor generates a byte array conforming to the Java class\n * file format. It can be used alone, to generate a Java class \"from scratch\",\n * or with one or more {@link ClassReader ClassReader} and adapter class visitor\n * to generate a modified class from one or more existing Java classes.\n *\n * @author Eric Bruneton\n */\npublic class ClassWriter extends ClassVisitor {\n \n private final SourceWriter sc;\n\n /**\n * Flag to automatically compute the maximum stack size and the maximum\n * number of local variables of methods. If this flag is set, then the\n * arguments of the {@link MethodVisitor#visitMaxs visitMaxs} method of the\n * {@link MethodVisitor} returned by the {@link #visitMethod visitMethod}\n * method will be ignored, and computed automatically from the signature and\n * the bytecode of each method.\n *\n * @see #ClassWriter(int)\n */\n public static final int COMPUTE_MAXS = 1;\n\n /**\n * Flag to automatically compute the stack map frames of methods from\n * scratch. If this flag is set, then the calls to the\n * {@link MethodVisitor#visitFrame} method are ignored, and the stack map\n * frames are recomputed from the methods bytecode. The arguments of the\n * {@link MethodVisitor#visitMaxs visitMaxs} method are also ignored and\n * recomputed from the bytecode. In other words, computeFrames implies\n * computeMaxs.\n *\n * @see #ClassWriter(int)\n */\n public static final int COMPUTE_FRAMES = 2;\n\n /**\n * Pseudo access flag to distinguish between the synthetic attribute and the\n * synthetic access flag.\n */\n static final int ACC_SYNTHETIC_ATTRIBUTE = 0x40000;\n\n /**\n * Factor to convert from ACC_SYNTHETIC_ATTRIBUTE to Opcode.ACC_SYNTHETIC.\n */\n static final int TO_ACC_SYNTHETIC = ACC_SYNTHETIC_ATTRIBUTE\n / Opcodes.ACC_SYNTHETIC;\n\n /**\n * The type of instructions without any argument.\n */\n static final int NOARG_INSN = 0;\n\n /**\n * The type of instructions with an signed byte argument.\n */\n static final int SBYTE_INSN = 1;\n\n /**\n * The type of instructions with an signed short argument.\n */\n static final int SHORT_INSN = 2;\n\n /**\n * The type of instructions with a local variable index argument.\n */\n static final int VAR_INSN = 3;\n\n /**\n * The type of instructions with an implicit local variable index argument.\n */\n static final int IMPLVAR_INSN = 4;\n\n /**\n * The type of instructions with a type descriptor argument.\n */\n static final int TYPE_INSN = 5;\n\n /**\n * The type of field and method invocations instructions.\n */\n static final int FIELDORMETH_INSN = 6;\n\n /**\n * The type of the INVOKEINTERFACE/INVOKEDYNAMIC instruction.\n */\n static final int ITFMETH_INSN = 7;\n\n /**\n * The type of the INVOKEDYNAMIC instruction.\n */\n static final int INDYMETH_INSN = 8;\n\n /**\n * The type of instructions with a 2 bytes bytecode offset label.\n */\n static final int LABEL_INSN = 9;\n\n /**\n * The type of instructions with a 4 bytes bytecode offset label.\n */\n static final int LABELW_INSN = 10;\n\n /**\n * The type of the LDC instruction.\n */\n static final int LDC_INSN = 11;\n\n /**\n * The type of the LDC_W and LDC2_W instructions.\n */\n static final int LDCW_INSN = 12;\n\n /**\n * The type of the IINC instruction.\n */\n static final int IINC_INSN = 13;\n\n /**\n * The type of the TABLESWITCH instruction.\n */\n static final int TABL_INSN = 14;\n\n /**\n * The type of the LOOKUPSWITCH instruction.\n */\n static final int LOOK_INSN = 15;\n\n /**\n * The type of the MULTIANEWARRAY instruction.\n */\n static final int MANA_INSN = 16;\n\n /**\n * The type of the WIDE instruction.\n */\n static final int WIDE_INSN = 17;\n\n /**\n * The instruction types of all JVM opcodes.\n */\n static final byte[] TYPE;\n\n /**\n * The type of CONSTANT_Class constant pool items.\n */\n static final int CLASS = 7;\n\n /**\n * The type of CONSTANT_Fieldref constant pool items.\n */\n static final int FIELD = 9;\n\n /**\n * The type of CONSTANT_Methodref constant pool items.\n */\n static final int METH = 10;\n\n /**\n * The type of CONSTANT_InterfaceMethodref constant pool items.\n */\n static final int IMETH = 11;\n\n /**\n * The type of CONSTANT_String constant pool items.\n */\n static final int STR = 8;\n\n /**\n * The type of CONSTANT_Integer constant pool items.\n */\n static final int INT = 3;\n\n /**\n * The type of CONSTANT_Float constant pool items.\n */\n static final int FLOAT = 4;\n\n /**\n * The type of CONSTANT_Long constant pool items.\n */\n static final int LONG = 5;\n\n /**\n * The type of CONSTANT_Double constant pool items.\n */\n static final int DOUBLE = 6;\n\n /**\n * The type of CONSTANT_NameAndType constant pool items.\n */\n static final int NAME_TYPE = 12;\n\n /**\n * The type of CONSTANT_Utf8 constant pool items.\n */\n static final int UTF8 = 1;\n\n /**\n * The type of CONSTANT_MethodType constant pool items.\n */\n static final int MTYPE = 16;\n\n /**\n * The type of CONSTANT_MethodHandle constant pool items.\n */\n static final int HANDLE = 15;\n\n /**\n * The type of CONSTANT_InvokeDynamic constant pool items.\n */\n static final int INDY = 18;\n\n /**\n * The base value for all CONSTANT_MethodHandle constant pool items.\n * Internally, ASM store the 9 variations of CONSTANT_MethodHandle into 9\n * different items.\n */\n static final int HANDLE_BASE = 20;\n\n /**\n * Normal type Item stored in the ClassWriter {@link ClassWriter#typeTable},\n * instead of the constant pool, in order to avoid clashes with normal\n * constant pool items in the ClassWriter constant pool's hash table.\n */\n static final int TYPE_NORMAL = 30;\n\n /**\n * Uninitialized type Item stored in the ClassWriter\n * {@link ClassWriter#typeTable}, instead of the constant pool, in order to\n * avoid clashes with normal constant pool items in the ClassWriter constant\n * pool's hash table.\n */\n static final int TYPE_UNINIT = 31;\n\n /**\n * Merged type Item stored in the ClassWriter {@link ClassWriter#typeTable},\n * instead of the constant pool, in order to avoid clashes with normal\n * constant pool items in the ClassWriter constant pool's hash table.\n */\n static final int TYPE_MERGED = 32;\n\n /**\n * The type of BootstrapMethods items. These items are stored in a special\n * class attribute named BootstrapMethods and not in the constant pool.\n */\n static final int BSM = 33;\n\n /**\n * The class reader from which this class writer was constructed, if any.\n */\n ClassReader cr;\n\n /**\n * Minor and major version numbers of the class to be generated.\n */\n int version;\n\n /**\n * Index of the next item to be added in the constant pool.\n */\n int index;\n\n /**\n * The constant pool of this class.\n */\n final ByteVector pool;\n\n /**\n * The constant pool's hash table data.\n */\n Item[] items;\n\n /**\n * The threshold of the constant pool's hash table.\n */\n int threshold;\n\n /**\n * A reusable key used to look for items in the {@link #items} hash table.\n */\n final Item key;\n\n /**\n * A reusable key used to look for items in the {@link #items} hash table.\n */\n final Item key2;\n\n /**\n * A reusable key used to look for items in the {@link #items} hash table.\n */\n final Item key3;\n\n /**\n * A reusable key used to look for items in the {@link #items} hash table.\n */\n final Item key4;\n\n /**\n * A type table used to temporarily store internal names that will not\n * necessarily be stored in the constant pool. This type table is used by\n * the control flow and data flow analysis algorithm used to compute stack\n * map frames from scratch. This array associates to each index i\n * the Item whose index is i. All Item objects stored in this array\n * are also stored in the {@link #items} hash table. These two arrays allow\n * to retrieve an Item from its index or, conversely, to get the index of an\n * Item from its value. Each Item stores an internal name in its\n * {@link Item#strVal1} field.\n */\n Item[] typeTable;\n\n /**\n * Number of elements in the {@link #typeTable} array.\n */\n private short typeCount;\n\n /**\n * The access flags of this class.\n */\n private int access;\n\n /**\n * The constant pool item that contains the internal name of this class.\n */\n private int name;\n\n /**\n * The internal name of this class.\n */\n String thisName;\n\n /**\n * The constant pool item that contains the signature of this class.\n */\n private int signature;\n\n /**\n * The constant pool item that contains the internal name of the super class\n * of this class.\n */\n private int superName;\n\n /**\n * Number of interfaces implemented or extended by this class or interface.\n */\n private int interfaceCount;\n\n /**\n * The interfaces implemented or extended by this class or interface. More\n * precisely, this array contains the indexes of the constant pool items\n * that contain the internal names of these interfaces.\n */\n private int[] interfaces;\n\n /**\n * The index of the constant pool item that contains the name of the source\n * file from which this class was compiled.\n */\n private int sourceFile;\n\n /**\n * The SourceDebug attribute of this class.\n */\n private ByteVector sourceDebug;\n\n /**\n * The constant pool item that contains the name of the enclosing class of\n * this class.\n */\n private int enclosingMethodOwner;\n\n /**\n * The constant pool item that contains the name and descriptor of the\n * enclosing method of this class.\n */\n private int enclosingMethod;\n\n /**\n * The runtime visible annotations of this class.\n */\n private AnnotationWriter anns;\n\n /**\n * The runtime invisible annotations of this class.\n */\n private AnnotationWriter ianns;\n\n /**\n * The non standard attributes of this class.\n */\n private Attribute attrs;\n\n /**\n * The number of entries in the InnerClasses attribute.\n */\n private int innerClassesCount;\n\n /**\n * The InnerClasses attribute.\n */\n private ByteVector innerClasses;\n\n /**\n * The number of entries in the BootstrapMethods attribute.\n */\n int bootstrapMethodsCount;\n\n /**\n * The BootstrapMethods attribute.\n */\n ByteVector bootstrapMethods;\n\n /**\n * The fields of this class. These fields are stored in a linked list of\n * {@link FieldWriter} objects, linked to each other by their\n * {@link FieldWriter#fv} field. This field stores the first element of this\n * list.\n */\n FieldWriter firstField;\n\n /**\n * The fields of this class. These fields are stored in a linked list of\n * {@link FieldWriter} objects, linked to each other by their\n * {@link FieldWriter#fv} field. This field stores the last element of this\n * list.\n */\n FieldWriter lastField;\n\n /**\n * The methods of this class. These methods are stored in a linked list of\n * {@link MethodWriter} objects, linked to each other by their\n * {@link MethodWriter#mv} field. This field stores the first element of\n * this list.\n */\n MethodWriter firstMethod;\n\n /**\n * The methods of this class. These methods are stored in a linked list of\n * {@link MethodWriter} objects, linked to each other by their\n * {@link MethodWriter#mv} field. This field stores the last element of this\n * list.\n */\n MethodWriter lastMethod;\n\n /**\n * true if the maximum stack size and number of local variables\n * must be automatically computed.\n */\n private final boolean computeMaxs;\n\n /**\n * true if the stack map frames must be recomputed from scratch.\n */\n private final boolean computeFrames;\n\n /**\n * true if the stack map tables of this class are invalid. The\n * {@link MethodWriter#resizeInstructions} method cannot transform existing\n * stack map tables, and so produces potentially invalid classes when it is\n * executed. In this case the class is reread and rewritten with the\n * {@link #COMPUTE_FRAMES} option (the resizeInstructions method can resize\n * stack map tables when this option is used).\n */\n boolean invalidFrames;\n\n // ------------------------------------------------------------------------\n // Static initializer\n // ------------------------------------------------------------------------\n\n /**\n * Computes the instruction types of JVM opcodes.\n */\n static {\n int i;\n byte[] b = new byte[220];\n String s = \"AAAAAAAAAAAAAAAABCLMMDDDDDEEEEEEEEEEEEEEEEEEEEAAAAAAAADD\"\n + \"DDDEEEEEEEEEEEEEEEEEEEEAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA\"\n + \"AAAAAAAAAAAAAAAAANAAAAAAAAAAAAAAAAAAAAJJJJJJJJJJJJJJJJDOPAA\"\n + \"AAAAGGGGGGGHIFBFAAFFAARQJJKKJJJJJJJJJJJJJJJJJJ\";\n for (i = 0; i < b.length; ++i) {\n b[i] = (byte) (s.charAt(i) - 'A');\n }\n TYPE = b;\n\n // code to generate the above string\n //\n // // SBYTE_INSN instructions\n // b[Constants.NEWARRAY] = SBYTE_INSN;\n // b[Constants.BIPUSH] = SBYTE_INSN;\n //\n // // SHORT_INSN instructions\n // b[Constants.SIPUSH] = SHORT_INSN;\n //\n // // (IMPL)VAR_INSN instructions\n // b[Constants.RET] = VAR_INSN;\n // for (i = Constants.ILOAD; i <= Constants.ALOAD; ++i) {\n // b[i] = VAR_INSN;\n // }\n // for (i = Constants.ISTORE; i <= Constants.ASTORE; ++i) {\n // b[i] = VAR_INSN;\n // }\n // for (i = 26; i <= 45; ++i) { // ILOAD_0 to ALOAD_3\n // b[i] = IMPLVAR_INSN;\n // }\n // for (i = 59; i <= 78; ++i) { // ISTORE_0 to ASTORE_3\n // b[i] = IMPLVAR_INSN;\n // }\n //\n // // TYPE_INSN instructions\n // b[Constants.NEW] = TYPE_INSN;\n // b[Constants.ANEWARRAY] = TYPE_INSN;\n // b[Constants.CHECKCAST] = TYPE_INSN;\n // b[Constants.INSTANCEOF] = TYPE_INSN;\n //\n // // (Set)FIELDORMETH_INSN instructions\n // for (i = Constants.GETSTATIC; i <= Constants.INVOKESTATIC; ++i) {\n // b[i] = FIELDORMETH_INSN;\n // }\n // b[Constants.INVOKEINTERFACE] = ITFMETH_INSN;\n // b[Constants.INVOKEDYNAMIC] = INDYMETH_INSN;\n //\n // // LABEL(W)_INSN instructions\n // for (i = Constants.IFEQ; i <= Constants.JSR; ++i) {\n // b[i] = LABEL_INSN;\n // }\n // b[Constants.IFNULL] = LABEL_INSN;\n // b[Constants.IFNONNULL] = LABEL_INSN;\n // b[200] = LABELW_INSN; // GOTO_W\n // b[201] = LABELW_INSN; // JSR_W\n // // temporary opcodes used internally by ASM - see Label and\n // MethodWriter\n // for (i = 202; i < 220; ++i) {\n // b[i] = LABEL_INSN;\n // }\n //\n // // LDC(_W) instructions\n // b[Constants.LDC] = LDC_INSN;\n // b[19] = LDCW_INSN; // LDC_W\n // b[20] = LDCW_INSN; // LDC2_W\n //\n // // special instructions\n // b[Constants.IINC] = IINC_INSN;\n // b[Constants.TABLESWITCH] = TABL_INSN;\n // b[Constants.LOOKUPSWITCH] = LOOK_INSN;\n // b[Constants.MULTIANEWARRAY] = MANA_INSN;\n // b[196] = WIDE_INSN; // WIDE\n //\n // for (i = 0; i < b.length; ++i) {\n // System.err.print((char)('A' + b[i]));\n // }\n // System.err.println();\n }\n\n // ------------------------------------------------------------------------\n // Constructor\n // ------------------------------------------------------------------------\n\n /**\n * Constructs a new {@link ClassWriter} object.\n *\n * @param flags\n * option flags that can be used to modify the default behavior\n * of this class. See {@link #COMPUTE_MAXS},\n * {@link #COMPUTE_FRAMES}.\n */\n public ClassWriter(final int flags) {\n super(Opcodes.ASM4);\n this.sc = new SourceWriter();\n index = 1;\n pool = new ByteVector();\n items = new Item[256];\n threshold = (int) (0.75d * items.length);\n key = new Item();\n key2 = new Item();\n key3 = new Item();\n key4 = new Item();\n this.computeMaxs = (flags & COMPUTE_MAXS) != 0;\n this.computeFrames = (flags & COMPUTE_FRAMES) != 0;\n }\n\n /**\n * Constructs a new {@link ClassWriter} object and enables optimizations for\n * \"mostly add\" bytecode transformations. These optimizations are the\n * following:\n *\n *
    \n *
  • The constant pool from the original class is copied as is in the new\n * class, which saves time. New constant pool entries will be added at the\n * end if necessary, but unused constant pool entries won't be\n * removed.
    • \n *
  • Methods that are not transformed are copied as is in the new class,\n * directly from the original class bytecode (i.e. without emitting visit\n * events for all the method instructions), which saves a lot of\n * time. Untransformed methods are detected by the fact that the\n * {@link ClassReader} receives {@link MethodVisitor} objects that come from\n * a {@link ClassWriter} (and not from any other {@link ClassVisitor}\n * instance).
    • \n *
\n *\n * @param classReader\n * the {@link ClassReader} used to read the original class. It\n * will be used to copy the entire constant pool from the\n * original class and also to copy other fragments of original\n * bytecode where applicable.\n * @param flags\n * option flags that can be used to modify the default behavior\n * of this class. These option flags do not affect methods\n * that are copied as is in the new class. This means that the\n * maximum stack size nor the stack frames will be computed for\n * these methods. See {@link #COMPUTE_MAXS},\n * {@link #COMPUTE_FRAMES}.\n */\n public ClassWriter(final ClassReader classReader, final int flags) {\n this(flags);\n classReader.copyPool(this);\n this.cr = classReader;\n }\n\n // ------------------------------------------------------------------------\n // Implementation of the ClassVisitor abstract class\n // ------------------------------------------------------------------------\n\n @Override\n public final void visit(final int version, final int access,\n final String name, final String signature, final String superName,\n final String[] interfaces) {\n this.version = version;\n this.access = access;\n this.name = newClass(name);\n thisName = name;\n if (ClassReader.SIGNATURES && signature != null) {\n this.signature = newUTF8(signature);\n }\n this.superName = superName == null ? 0 : newClass(superName);\n if (interfaces != null && interfaces.length > 0) {\n interfaceCount = interfaces.length;\n this.interfaces = new int[interfaceCount];\n for (int i = 0; i < interfaceCount; ++i) {\n this.interfaces[i] = newClass(interfaces[i]);\n }\n }\n }\n\n @Override\n public final void visitSource(final String file, final String debug) {\n if (file != null) {\n sourceFile = newUTF8(file);\n }\n if (debug != null) {\n sourceDebug = new ByteVector().putUTF8(debug);\n }\n }\n\n @Override\n public final void visitOuterClass(final String owner, final String name,\n final String desc) {\n enclosingMethodOwner = newClass(owner);\n if (name != null && desc != null) {\n enclosingMethod = newNameType(name, desc);\n }\n }\n\n @Override\n public final AnnotationVisitor visitAnnotation(final String desc,\n final boolean visible) {\n if (!ClassReader.ANNOTATIONS) {\n return null;\n }\n ByteVector bv = new ByteVector();\n // write type, and reserve space for values count\n bv.putShort(newUTF8(desc)).putShort(0);\n AnnotationWriter aw = new AnnotationWriter(this, true, bv, bv, 2);\n if (visible) {\n aw.next = anns;\n anns = aw;\n } else {\n aw.next = ianns;\n ianns = aw;\n }\n return aw;\n }\n\n @Override\n public final void visitAttribute(final Attribute attr) {\n attr.next = attrs;\n attrs = attr;\n }\n\n @Override\n public final void visitInnerClass(final String name,\n final String outerName, final String innerName, final int access) {\n if (innerClasses == null) {\n innerClasses = new ByteVector();\n }\n ++innerClassesCount;\n innerClasses.putShort(name == null ? 0 : newClass(name));\n innerClasses.putShort(outerName == null ? 0 : newClass(outerName));\n innerClasses.putShort(innerName == null ? 0 : newUTF8(innerName));\n innerClasses.putShort(access);\n }\n\n @Override\n public final FieldVisitor visitField(final int access, final String name,\n final String desc, final String signature, final Object value) {\n return new FieldWriter(this, access, name, desc, signature, value);\n }\n\n @Override\n public final MethodVisitor visitMethod(final int access, final String name,\n final String desc, final String signature, final String[] exceptions) {\n return new MethodWriter(this, access, name, desc, signature,\n exceptions, computeMaxs, computeFrames);\n }\n\n @Override\n public final void visitEnd() {\n }\n\n // ------------------------------------------------------------------------\n // Other public methods\n // ------------------------------------------------------------------------\n\n /**\n * Returns the bytecode of the class that was build with this class writer.\n *\n * @return the bytecode of the class that was build with this class writer.\n */\n public byte[] toByteArray() {\n if (index > 0xFFFF) {\n throw new RuntimeException(\"Class file too large!\");\n }\n // computes the real size of the bytecode of this class\n int size = 24 + 2 * interfaceCount;\n int nbFields = 0;\n FieldWriter fb = firstField;\n while (fb != null) {\n ++nbFields;\n size += fb.getSize();\n fb = (FieldWriter) fb.fv;\n }\n int nbMethods = 0;\n MethodWriter mb = firstMethod;\n while (mb != null) {\n ++nbMethods;\n size += mb.getSize();\n mb = (MethodWriter) mb.mv;\n }\n int attributeCount = 0;\n if (bootstrapMethods != null) {\n // we put it as first attribute in order to improve a bit\n // ClassReader.copyBootstrapMethods\n ++attributeCount;\n size += 8 + bootstrapMethods.length;\n newUTF8(\"BootstrapMethods\");\n }\n if (ClassReader.SIGNATURES && signature != 0) {\n ++attributeCount;\n size += 8;\n newUTF8(\"Signature\");\n }\n if (sourceFile != 0) {\n ++attributeCount;\n size += 8;\n newUTF8(\"SourceFile\");\n }\n if (sourceDebug != null) {\n ++attributeCount;\n size += sourceDebug.length + 4;\n newUTF8(\"SourceDebugExtension\");\n }\n if (enclosingMethodOwner != 0) {\n ++attributeCount;\n size += 10;\n newUTF8(\"EnclosingMethod\");\n }\n if ((access & Opcodes.ACC_DEPRECATED) != 0) {\n ++attributeCount;\n size += 6;\n newUTF8(\"Deprecated\");\n }\n if ((access & Opcodes.ACC_SYNTHETIC) != 0) {\n if ((version & 0xFFFF) < Opcodes.V1_5\n || (access & ACC_SYNTHETIC_ATTRIBUTE) != 0) {\n ++attributeCount;\n size += 6;\n newUTF8(\"Synthetic\");\n }\n }\n if (innerClasses != null) {\n ++attributeCount;\n size += 8 + innerClasses.length;\n newUTF8(\"InnerClasses\");\n }\n if (ClassReader.ANNOTATIONS && anns != null) {\n ++attributeCount;\n size += 8 + anns.getSize();\n newUTF8(\"RuntimeVisibleAnnotations\");\n }\n if (ClassReader.ANNOTATIONS && ianns != null) {\n ++attributeCount;\n size += 8 + ianns.getSize();\n newUTF8(\"RuntimeInvisibleAnnotations\");\n }\n if (attrs != null) {\n attributeCount += attrs.getCount();\n size += attrs.getSize(this, null, 0, -1, -1);\n }\n size += pool.length;\n // allocates a byte vector of this size, in order to avoid unnecessary\n // arraycopy operations in the ByteVector.enlarge() method\n ByteVector out = new ByteVector(size);\n out.putInt(0xCAFEBABE).putInt(version);\n out.putShort(index).putByteArray(pool.data, 0, pool.length);\n int mask = Opcodes.ACC_DEPRECATED | ACC_SYNTHETIC_ATTRIBUTE\n | ((access & ACC_SYNTHETIC_ATTRIBUTE) / TO_ACC_SYNTHETIC);\n out.putShort(access & ~mask).putShort(name).putShort(superName);\n out.putShort(interfaceCount);\n for (int i = 0; i < interfaceCount; ++i) {\n out.putShort(interfaces[i]);\n }\n out.putShort(nbFields);\n fb = firstField;\n while (fb != null) {\n fb.put(out);\n fb = (FieldWriter) fb.fv;\n }\n out.putShort(nbMethods);\n mb = firstMethod;\n while (mb != null) {\n mb.put(out);\n mb = (MethodWriter) mb.mv;\n }\n out.putShort(attributeCount);\n if (bootstrapMethods != null) {\n out.putShort(newUTF8(\"BootstrapMethods\"));\n out.putInt(bootstrapMethods.length + 2).putShort(\n bootstrapMethodsCount);\n out.putByteArray(bootstrapMethods.data, 0, bootstrapMethods.length);\n }\n if (ClassReader.SIGNATURES && signature != 0) {\n out.putShort(newUTF8(\"Signature\")).putInt(2).putShort(signature);\n }\n if (sourceFile != 0) {\n out.putShort(newUTF8(\"SourceFile\")).putInt(2).putShort(sourceFile);\n }\n if (sourceDebug != null) {\n int len = sourceDebug.length - 2;\n out.putShort(newUTF8(\"SourceDebugExtension\")).putInt(len);\n out.putByteArray(sourceDebug.data, 2, len);\n }\n if (enclosingMethodOwner != 0) {\n out.putShort(newUTF8(\"EnclosingMethod\")).putInt(4);\n out.putShort(enclosingMethodOwner).putShort(enclosingMethod);\n }\n if ((access & Opcodes.ACC_DEPRECATED) != 0) {\n out.putShort(newUTF8(\"Deprecated\")).putInt(0);\n }\n if ((access & Opcodes.ACC_SYNTHETIC) != 0) {\n if ((version & 0xFFFF) < Opcodes.V1_5\n || (access & ACC_SYNTHETIC_ATTRIBUTE) != 0) {\n out.putShort(newUTF8(\"Synthetic\")).putInt(0);\n }\n }\n if (innerClasses != null) {\n out.putShort(newUTF8(\"InnerClasses\"));\n out.putInt(innerClasses.length + 2).putShort(innerClassesCount);\n out.putByteArray(innerClasses.data, 0, innerClasses.length);\n }\n if (ClassReader.ANNOTATIONS && anns != null) {\n out.putShort(newUTF8(\"RuntimeVisibleAnnotations\"));\n anns.put(out);\n }\n if (ClassReader.ANNOTATIONS && ianns != null) {\n out.putShort(newUTF8(\"RuntimeInvisibleAnnotations\"));\n ianns.put(out);\n }\n if (attrs != null) {\n attrs.put(this, null, 0, -1, -1, out);\n }\n if (invalidFrames) {\n ClassWriter cw = new ClassWriter(COMPUTE_FRAMES);\n new ClassReader(out.data).accept(cw, ClassReader.SKIP_FRAMES);\n return cw.toByteArray();\n }\n return out.data;\n }\n\n // ------------------------------------------------------------------------\n // Utility methods: constant pool management\n // ------------------------------------------------------------------------\n\n /**\n * Adds a number or string constant to the constant pool of the class being\n * build. Does nothing if the constant pool already contains a similar item.\n *\n * @param cst\n * the value of the constant to be added to the constant pool.\n * This parameter must be an {@link Integer}, a {@link Float}, a\n * {@link Long}, a {@link Double}, a {@link String} or a\n * {@link Type}.\n * @return a new or already existing constant item with the given value.\n */\n Item newConstItem(final Object cst) {\n if (cst instanceof Integer) {\n int val = ((Integer) cst).intValue();\n return newInteger(val);\n } else if (cst instanceof Byte) {\n int val = ((Byte) cst).intValue();\n return newInteger(val);\n } else if (cst instanceof Character) {\n int val = ((Character) cst).charValue();\n return newInteger(val);\n } else if (cst instanceof Short) {\n int val = ((Short) cst).intValue();\n return newInteger(val);\n } else if (cst instanceof Boolean) {\n int val = ((Boolean) cst).booleanValue() ? 1 : 0;\n return newInteger(val);\n } else if (cst instanceof Float) {\n float val = ((Float) cst).floatValue();\n return newFloat(val);\n } else if (cst instanceof Long) {\n long val = ((Long) cst).longValue();\n return newLong(val);\n } else if (cst instanceof Double) {\n double val = ((Double) cst).doubleValue();\n return newDouble(val);\n } else if (cst instanceof String) {\n return newString((String) cst);\n } else if (cst instanceof Type) {\n Type t = (Type) cst;\n int s = t.getSort();\n if (s == Type.OBJECT) {\n return newClassItem(t.getInternalName());\n } else if (s == Type.METHOD) {\n return newMethodTypeItem(t.getDescriptor());\n } else { // s == primitive type or array\n return newClassItem(t.getDescriptor());\n }\n } else if (cst instanceof Handle) {\n Handle h = (Handle) cst;\n return newHandleItem(h.tag, h.owner, h.name, h.desc);\n } else {\n throw new IllegalArgumentException(\"value \" + cst);\n }\n }\n\n /**\n * Adds a number or string constant to the constant pool of the class being\n * build. Does nothing if the constant pool already contains a similar item.\n * This method is intended for {@link Attribute} sub classes, and is\n * normally not needed by class generators or adapters.\n *\n * @param cst\n * the value of the constant to be added to the constant pool.\n * This parameter must be an {@link Integer}, a {@link Float}, a\n * {@link Long}, a {@link Double} or a {@link String}.\n * @return the index of a new or already existing constant item with the\n * given value.\n */\n public int newConst(final Object cst) {\n return newConstItem(cst).index;\n }\n\n /**\n * Adds an UTF8 string to the constant pool of the class being build. Does\n * nothing if the constant pool already contains a similar item. This\n * method is intended for {@link Attribute} sub classes, and is normally not\n * needed by class generators or adapters.\n *\n * @param value\n * the String value.\n * @return the index of a new or already existing UTF8 item.\n */\n public int newUTF8(final String value) {\n key.set(UTF8, value, null, null);\n Item result = get(key);\n if (result == null) {\n pool.putByte(UTF8).putUTF8(value);\n result = new Item(index++, key);\n put(result);\n }\n return result.index;\n }\n\n /**\n * Adds a class reference to the constant pool of the class being build.\n * Does nothing if the constant pool already contains a similar item.\n * This method is intended for {@link Attribute} sub classes, and is\n * normally not needed by class generators or adapters.\n *\n * @param value\n * the internal name of the class.\n * @return a new or already existing class reference item.\n */\n Item newClassItem(final String value) {\n key2.set(CLASS, value, null, null);\n Item result = get(key2);\n if (result == null) {\n pool.put12(CLASS, newUTF8(value));\n result = new Item(index++, key2);\n put(result);\n }\n return result;\n }\n\n /**\n * Adds a class reference to the constant pool of the class being build.\n * Does nothing if the constant pool already contains a similar item.\n * This method is intended for {@link Attribute} sub classes, and is\n * normally not needed by class generators or adapters.\n *\n * @param value\n * the internal name of the class.\n * @return the index of a new or already existing class reference item.\n */\n public int newClass(final String value) {\n return newClassItem(value).index;\n }\n\n /**\n * Adds a method type reference to the constant pool of the class being\n * build. Does nothing if the constant pool already contains a similar item.\n * This method is intended for {@link Attribute} sub classes, and is\n * normally not needed by class generators or adapters.\n *\n * @param methodDesc\n * method descriptor of the method type.\n * @return a new or already existing method type reference item.\n */\n Item newMethodTypeItem(final String methodDesc) {\n key2.set(MTYPE, methodDesc, null, null);\n Item result = get(key2);\n if (result == null) {\n pool.put12(MTYPE, newUTF8(methodDesc));\n result = new Item(index++, key2);\n put(result);\n }\n return result;\n }\n\n /**\n * Adds a method type reference to the constant pool of the class being\n * build. Does nothing if the constant pool already contains a similar item.\n * This method is intended for {@link Attribute} sub classes, and is\n * normally not needed by class generators or adapters.\n *\n * @param methodDesc\n * method descriptor of the method type.\n * @return the index of a new or already existing method type reference\n * item.\n */\n public int newMethodType(final String methodDesc) {\n return newMethodTypeItem(methodDesc).index;\n }\n\n /**\n * Adds a handle to the constant pool of the class being build. Does nothing\n * if the constant pool already contains a similar item. This method is\n * intended for {@link Attribute} sub classes, and is normally not needed by\n * class generators or adapters.\n *\n * @param tag\n * the kind of this handle. Must be {@link Opcodes#H_GETFIELD},\n * {@link Opcodes#H_GETSTATIC}, {@link Opcodes#H_PUTFIELD},\n * {@link Opcodes#H_PUTSTATIC}, {@link Opcodes#H_INVOKEVIRTUAL},\n * {@link Opcodes#H_INVOKESTATIC},\n * {@link Opcodes#H_INVOKESPECIAL},\n * {@link Opcodes#H_NEWINVOKESPECIAL} or\n * {@link Opcodes#H_INVOKEINTERFACE}.\n * @param owner\n * the internal name of the field or method owner class.\n * @param name\n * the name of the field or method.\n * @param desc\n * the descriptor of the field or method.\n * @return a new or an already existing method type reference item.\n */\n Item newHandleItem(final int tag, final String owner, final String name,\n final String desc) {\n key4.set(HANDLE_BASE + tag, owner, name, desc);\n Item result = get(key4);\n if (result == null) {\n if (tag <= Opcodes.H_PUTSTATIC) {\n put112(HANDLE, tag, newField(owner, name, desc));\n } else {\n put112(HANDLE,\n tag,\n newMethod(owner, name, desc,\n tag == Opcodes.H_INVOKEINTERFACE));\n }\n result = new Item(index++, key4);\n put(result);\n }\n return result;\n }\n\n /**\n * Adds a handle to the constant pool of the class being build. Does nothing\n * if the constant pool already contains a similar item. This method is\n * intended for {@link Attribute} sub classes, and is normally not needed by\n * class generators or adapters.\n *\n * @param tag\n * the kind of this handle. Must be {@link Opcodes#H_GETFIELD},\n * {@link Opcodes#H_GETSTATIC}, {@link Opcodes#H_PUTFIELD},\n * {@link Opcodes#H_PUTSTATIC}, {@link Opcodes#H_INVOKEVIRTUAL},\n * {@link Opcodes#H_INVOKESTATIC},\n * {@link Opcodes#H_INVOKESPECIAL},\n * {@link Opcodes#H_NEWINVOKESPECIAL} or\n * {@link Opcodes#H_INVOKEINTERFACE}.\n * @param owner\n * the internal name of the field or method owner class.\n * @param name\n * the name of the field or method.\n * @param desc\n * the descriptor of the field or method.\n * @return the index of a new or already existing method type reference\n * item.\n */\n public int newHandle(final int tag, final String owner, final String name,\n final String desc) {\n return newHandleItem(tag, owner, name, desc).index;\n }\n\n /**\n * Adds an invokedynamic reference to the constant pool of the class being\n * build. Does nothing if the constant pool already contains a similar item.\n * This method is intended for {@link Attribute} sub classes, and is\n * normally not needed by class generators or adapters.\n *\n * @param name\n * name of the invoked method.\n * @param desc\n * descriptor of the invoke method.\n * @param bsm\n * the bootstrap method.\n * @param bsmArgs\n * the bootstrap method constant arguments.\n *\n * @return a new or an already existing invokedynamic type reference item.\n */\n Item newInvokeDynamicItem(final String name, final String desc,\n final Handle bsm, final Object... bsmArgs) {\n // cache for performance\n ByteVector bootstrapMethods = this.bootstrapMethods;\n if (bootstrapMethods == null) {\n bootstrapMethods = this.bootstrapMethods = new ByteVector();\n }\n\n int position = bootstrapMethods.length; // record current position\n\n int hashCode = bsm.hashCode();\n bootstrapMethods.putShort(newHandle(bsm.tag, bsm.owner, bsm.name,\n bsm.desc));\n\n int argsLength = bsmArgs.length;\n bootstrapMethods.putShort(argsLength);\n\n for (int i = 0; i < argsLength; i++) {\n Object bsmArg = bsmArgs[i];\n hashCode ^= bsmArg.hashCode();\n bootstrapMethods.putShort(newConst(bsmArg));\n }\n\n byte[] data = bootstrapMethods.data;\n int length = (1 + 1 + argsLength) << 1; // (bsm + argCount + arguments)\n hashCode &= 0x7FFFFFFF;\n Item result = items[hashCode % items.length];\n loop: while (result != null) {\n if (result.type != BSM || result.hashCode != hashCode) {\n result = result.next;\n continue;\n }\n\n // because the data encode the size of the argument\n // we don't need to test if these size are equals\n int resultPosition = result.intVal;\n for (int p = 0; p < length; p++) {\n if (data[position + p] != data[resultPosition + p]) {\n result = result.next;\n continue loop;\n }\n }\n break;\n }\n\n int bootstrapMethodIndex;\n if (result != null) {\n bootstrapMethodIndex = result.index;\n bootstrapMethods.length = position; // revert to old position\n } else {\n bootstrapMethodIndex = bootstrapMethodsCount++;\n result = new Item(bootstrapMethodIndex);\n result.set(position, hashCode);\n put(result);\n }\n\n // now, create the InvokeDynamic constant\n key3.set(name, desc, bootstrapMethodIndex);\n result = get(key3);\n if (result == null) {\n put122(INDY, bootstrapMethodIndex, newNameType(name, desc));\n result = new Item(index++, key3);\n put(result);\n }\n return result;\n }\n\n /**\n * Adds an invokedynamic reference to the constant pool of the class being\n * build. Does nothing if the constant pool already contains a similar item.\n * This method is intended for {@link Attribute} sub classes, and is\n * normally not needed by class generators or adapters.\n *\n * @param name\n * name of the invoked method.\n * @param desc\n * descriptor of the invoke method.\n * @param bsm\n * the bootstrap method.\n * @param bsmArgs\n * the bootstrap method constant arguments.\n *\n * @return the index of a new or already existing invokedynamic reference\n * item.\n */\n public int newInvokeDynamic(final String name, final String desc,\n final Handle bsm, final Object... bsmArgs) {\n return newInvokeDynamicItem(name, desc, bsm, bsmArgs).index;\n }\n\n /**\n * Adds a field reference to the constant pool of the class being build.\n * Does nothing if the constant pool already contains a similar item.\n *\n * @param owner\n * the internal name of the field's owner class.\n * @param name\n * the field's name.\n * @param desc\n * the field's descriptor.\n * @return a new or already existing field reference item.\n */\n Item newFieldItem(final String owner, final String name, final String desc) {\n key3.set(FIELD, owner, name, desc);\n Item result = get(key3);\n if (result == null) {\n put122(FIELD, newClass(owner), newNameType(name, desc));\n result = new Item(index++, key3);\n put(result);\n }\n return result;\n }\n\n /**\n * Adds a field reference to the constant pool of the class being build.\n * Does nothing if the constant pool already contains a similar item.\n * This method is intended for {@link Attribute} sub classes, and is\n * normally not needed by class generators or adapters.\n *\n * @param owner\n * the internal name of the field's owner class.\n * @param name\n * the field's name.\n * @param desc\n * the field's descriptor.\n * @return the index of a new or already existing field reference item.\n */\n public int newField(final String owner, final String name, final String desc) {\n return newFieldItem(owner, name, desc).index;\n }\n\n /**\n * Adds a method reference to the constant pool of the class being build.\n * Does nothing if the constant pool already contains a similar item.\n *\n * @param owner\n * the internal name of the method's owner class.\n * @param name\n * the method's name.\n * @param desc\n * the method's descriptor.\n * @param itf\n * true if owner is an interface.\n * @return a new or already existing method reference item.\n */\n Item newMethodItem(final String owner, final String name,\n final String desc, final boolean itf) {\n int type = itf ? IMETH : METH;\n key3.set(type, owner, name, desc);\n Item result = get(key3);\n if (result == null) {\n put122(type, newClass(owner), newNameType(name, desc));\n result = new Item(index++, key3);\n put(result);\n }\n return result;\n }\n\n /**\n * Adds a method reference to the constant pool of the class being build.\n * Does nothing if the constant pool already contains a similar item.\n * This method is intended for {@link Attribute} sub classes, and is\n * normally not needed by class generators or adapters.\n *\n * @param owner\n * the internal name of the method's owner class.\n * @param name\n * the method's name.\n * @param desc\n * the method's descriptor.\n * @param itf\n * true if owner is an interface.\n * @return the index of a new or already existing method reference item.\n */\n public int newMethod(final String owner, final String name,\n final String desc, final boolean itf) {\n return newMethodItem(owner, name, desc, itf).index;\n }\n\n /**\n * Adds an integer to the constant pool of the class being build. Does\n * nothing if the constant pool already contains a similar item.\n *\n * @param value\n * the int value.\n * @return a new or already existing int item.\n */\n Item newInteger(final int value) {\n key.set(value);\n Item result = get(key);\n if (result == null) {\n pool.putByte(INT).putInt(value);\n result = new Item(index++, key);\n put(result);\n }\n return result;\n }\n\n /**\n * Adds a float to the constant pool of the class being build. Does nothing\n * if the constant pool already contains a similar item.\n *\n * @param value\n * the float value.\n * @return a new or already existing float item.\n */\n Item newFloat(final float value) {\n key.set(value);\n Item result = get(key);\n if (result == null) {\n pool.putByte(FLOAT).putInt(key.intVal);\n result = new Item(index++, key);\n put(result);\n }\n return result;\n }\n\n /**\n * Adds a long to the constant pool of the class being build. Does nothing\n * if the constant pool already contains a similar item.\n *\n * @param value\n * the long value.\n * @return a new or already existing long item.\n */\n Item newLong(final long value) {\n key.set(value);\n Item result = get(key);\n if (result == null) {\n pool.putByte(LONG).putLong(value);\n result = new Item(index, key);\n index += 2;\n put(result);\n }\n return result;\n }\n\n /**\n * Adds a double to the constant pool of the class being build. Does nothing\n * if the constant pool already contains a similar item.\n *\n * @param value\n * the double value.\n * @return a new or already existing double item.\n */\n Item newDouble(final double value) {\n key.set(value);\n Item result = get(key);\n if (result == null) {\n pool.putByte(DOUBLE).putLong(key.longVal);\n result = new Item(index, key);\n index += 2;\n put(result);\n }\n return result;\n }\n\n /**\n * Adds a string to the constant pool of the class being build. Does nothing\n * if the constant pool already contains a similar item.\n *\n * @param value\n * the String value.\n * @return a new or already existing string item.\n */\n private Item newString(final String value) {\n key2.set(STR, value, null, null);\n Item result = get(key2);\n if (result == null) {\n pool.put12(STR, newUTF8(value));\n result = new Item(index++, key2);\n put(result);\n }\n return result;\n }\n\n /**\n * Adds a name and type to the constant pool of the class being build. Does\n * nothing if the constant pool already contains a similar item. This\n * method is intended for {@link Attribute} sub classes, and is normally not\n * needed by class generators or adapters.\n *\n * @param name\n * a name.\n * @param desc\n * a type descriptor.\n * @return the index of a new or already existing name and type item.\n */\n public int newNameType(final String name, final String desc) {\n return newNameTypeItem(name, desc).index;\n }\n\n /**\n * Adds a name and type to the constant pool of the class being build. Does\n * nothing if the constant pool already contains a similar item.\n *\n * @param name\n * a name.\n * @param desc\n * a type descriptor.\n * @return a new or already existing name and type item.\n */\n Item newNameTypeItem(final String name, final String desc) {\n key2.set(NAME_TYPE, name, desc, null);\n Item result = get(key2);\n if (result == null) {\n put122(NAME_TYPE, newUTF8(name), newUTF8(desc));\n result = new Item(index++, key2);\n put(result);\n }\n return result;\n }\n\n /**\n * Adds the given internal name to {@link #typeTable} and returns its index.\n * Does nothing if the type table already contains this internal name.\n *\n * @param type\n * the internal name to be added to the type table.\n * @return the index of this internal name in the type table.\n */\n int addType(final String type) {\n key.set(TYPE_NORMAL, type, null, null);\n Item result = get(key);\n if (result == null) {\n result = addType(key);\n }\n return result.index;\n }\n\n /**\n * Adds the given \"uninitialized\" type to {@link #typeTable} and returns its\n * index. This method is used for UNINITIALIZED types, made of an internal\n * name and a bytecode offset.\n *\n * @param type\n * the internal name to be added to the type table.\n * @param offset\n * the bytecode offset of the NEW instruction that created this\n * UNINITIALIZED type value.\n * @return the index of this internal name in the type table.\n */\n int addUninitializedType(final String type, final int offset) {\n key.type = TYPE_UNINIT;\n key.intVal = offset;\n key.strVal1 = type;\n key.hashCode = 0x7FFFFFFF & (TYPE_UNINIT + type.hashCode() + offset);\n Item result = get(key);\n if (result == null) {\n result = addType(key);\n }\n return result.index;\n }\n\n /**\n * Adds the given Item to {@link #typeTable}.\n *\n * @param item\n * the value to be added to the type table.\n * @return the added Item, which a new Item instance with the same value as\n * the given Item.\n */\n private Item addType(final Item item) {\n ++typeCount;\n Item result = new Item(typeCount, key);\n put(result);\n if (typeTable == null) {\n typeTable = new Item[16];\n }\n if (typeCount == typeTable.length) {\n Item[] newTable = new Item[2 * typeTable.length];\n System.arraycopy(typeTable, 0, newTable, 0, typeTable.length);\n typeTable = newTable;\n }\n typeTable[typeCount] = result;\n return result;\n }\n\n /**\n * Returns the index of the common super type of the two given types. This\n * method calls {@link #getCommonSuperClass} and caches the result in the\n * {@link #items} hash table to speedup future calls with the same\n * parameters.\n *\n * @param type1\n * index of an internal name in {@link #typeTable}.\n * @param type2\n * index of an internal name in {@link #typeTable}.\n * @return the index of the common super type of the two given types.\n */\n int getMergedType(final int type1, final int type2) {\n key2.type = TYPE_MERGED;\n key2.longVal = type1 | (((long) type2) << 32);\n key2.hashCode = 0x7FFFFFFF & (TYPE_MERGED + type1 + type2);\n Item result = get(key2);\n if (result == null) {\n String t = typeTable[type1].strVal1;\n String u = typeTable[type2].strVal1;\n key2.intVal = addType(getCommonSuperClass(t, u));\n result = new Item((short) 0, key2);\n put(result);\n }\n return result.intVal;\n }\n\n /**\n * Returns the common super type of the two given types. The default\n * implementation of this method loads the two given classes and uses\n * the java.lang.Class methods to find the common super class. It can be\n * overridden to compute this common super type in other ways, in particular\n * without actually loading any class, or to take into account the class\n * that is currently being generated by this ClassWriter, which can of\n * course not be loaded since it is under construction.\n *\n * @param type1\n * the internal name of a class.\n * @param type2\n * the internal name of another class.\n * @return the internal name of the common super class of the two given\n * classes.\n */\n protected String getCommonSuperClass(final String type1, final String type2) {\n Class c, d;\n ClassLoader classLoader = getClass().getClassLoader();\n try {\n c = Class.forName(type1.replace('/', '.'), false, classLoader);\n d = Class.forName(type2.replace('/', '.'), false, classLoader);\n } catch (Exception e) {\n throw new RuntimeException(e.toString());\n }\n if (c.isAssignableFrom(d)) {\n return type1;\n }\n if (d.isAssignableFrom(c)) {\n return type2;\n }\n if (c.isInterface() || d.isInterface()) {\n return \"java/lang/Object\";\n } else {\n do {\n c = c.getSuperclass();\n } while (!c.isAssignableFrom(d));\n return c.getName().replace('.', '/');\n }\n }\n\n /**\n * Returns the constant pool's hash table item which is equal to the given\n * item.\n *\n * @param key\n * a constant pool item.\n * @return the constant pool's hash table item which is equal to the given\n * item, or null if there is no such item.\n */\n private Item get(final Item key) {\n Item i = items[key.hashCode % items.length];\n while (i != null && (i.type != key.type || !key.isEqualTo(i))) {\n i = i.next;\n }\n return i;\n }\n\n /**\n * Puts the given item in the constant pool's hash table. The hash table\n * must not already contains this item.\n *\n * @param i\n * the item to be added to the constant pool's hash table.\n */\n private void put(final Item i) {\n if (index + typeCount > threshold) {\n int ll = items.length;\n int nl = ll * 2 + 1;\n Item[] newItems = new Item[nl];\n for (int l = ll - 1; l >= 0; --l) {\n Item j = items[l];\n while (j != null) {\n int index = j.hashCode % newItems.length;\n Item k = j.next;\n j.next = newItems[index];\n newItems[index] = j;\n j = k;\n }\n }\n items = newItems;\n threshold = (int) (nl * 0.75);\n }\n int index = i.hashCode % items.length;\n i.next = items[index];\n items[index] = i;\n }\n\n /**\n * Puts one byte and two shorts into the constant pool.\n *\n * @param b\n * a byte.\n * @param s1\n * a short.\n * @param s2\n * another short.\n */\n private void put122(final int b, final int s1, final int s2) {\n pool.put12(b, s1).putShort(s2);\n }\n\n /**\n * Puts two bytes and one short into the constant pool.\n *\n * @param b1\n * a byte.\n * @param b2\n * another byte.\n * @param s\n * a short.\n */\n private void put112(final int b1, final int b2, final int s) {\n pool.put11(b1, b2).putShort(s);\n }\n \n public SourceWriter getSc() {\n return sc;\n }\n}\n" }, { "path": "src/jvm/clojure/asm/Context.java", "content": "/***\n * ASM: a very small and fast Java bytecode manipulation framework\n * Copyright (c) 2000-2011 INRIA, France Telecom\n * All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions\n * are met:\n * 1. Redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer.\n * 2. Redistributions in binary form must reproduce the above copyright\n * notice, this list of conditions and the following disclaimer in the\n * documentation and/or other materials provided with the distribution.\n * 3. Neither the name of the copyright holders nor the names of its\n * contributors may be used to endorse or promote products derived from\n * this software without specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\n * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\n * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE\n * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR\n * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF\n * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\n * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN\n * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\n * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF\n * THE POSSIBILITY OF SUCH DAMAGE.\n */\n\npackage clojure.asm;\n\n/**\n * Information about a class being parsed in a {@link ClassReader}.\n *\n * @author Eric Bruneton\n */\nclass Context {\n\n /**\n * Prototypes of the attributes that must be parsed for this class.\n */\n Attribute[] attrs;\n\n /**\n * The {@link ClassReader} option flags for the parsing of this class.\n */\n int flags;\n\n /**\n * The buffer used to read strings.\n */\n char[] buffer;\n\n /**\n * The start index of each bootstrap method.\n */\n int[] bootstrapMethods;\n\n /**\n * The access flags of the method currently being parsed.\n */\n int access;\n\n /**\n * The name of the method currently being parsed.\n */\n String name;\n\n /**\n * The descriptor of the method currently being parsed.\n */\n String desc;\n\n /**\n * The offset of the latest stack map frame that has been parsed.\n */\n int offset;\n\n /**\n * The encoding of the latest stack map frame that has been parsed.\n */\n int mode;\n\n /**\n * The number of locals in the latest stack map frame that has been parsed.\n */\n int localCount;\n\n /**\n * The number locals in the latest stack map frame that has been parsed,\n * minus the number of locals in the previous frame.\n */\n int localDiff;\n\n /**\n * The local values of the latest stack map frame that has been parsed.\n */\n Object[] local;\n\n /**\n * The stack size of the latest stack map frame that has been parsed.\n */\n int stackCount;\n\n /**\n * The stack values of the latest stack map frame that has been parsed.\n */\n Object[] stack;\n}" }, { "path": "src/jvm/clojure/asm/Edge.java", "content": "/***\n * ASM: a very small and fast Java bytecode manipulation framework\n * Copyright (c) 2000-2011 INRIA, France Telecom\n * All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions\n * are met:\n * 1. Redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer.\n * 2. Redistributions in binary form must reproduce the above copyright\n * notice, this list of conditions and the following disclaimer in the\n * documentation and/or other materials provided with the distribution.\n * 3. Neither the name of the copyright holders nor the names of its\n * contributors may be used to endorse or promote products derived from\n * this software without specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\n * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\n * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE\n * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR\n * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF\n * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\n * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN\n * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\n * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF\n * THE POSSIBILITY OF SUCH DAMAGE.\n */\npackage clojure.asm;\n\n/**\n * An edge in the control flow graph of a method body. See {@link Label Label}.\n *\n * @author Eric Bruneton\n */\nclass Edge {\n\n /**\n * Denotes a normal control flow graph edge.\n */\n static final int NORMAL = 0;\n\n /**\n * Denotes a control flow graph edge corresponding to an exception handler.\n * More precisely any {@link Edge} whose {@link #info} is strictly positive\n * corresponds to an exception handler. The actual value of {@link #info} is\n * the index, in the {@link ClassWriter} type table, of the exception that\n * is catched.\n */\n static final int EXCEPTION = 0x7FFFFFFF;\n\n /**\n * Information about this control flow graph edge. If\n * {@link ClassWriter#COMPUTE_MAXS} is used this field is the (relative)\n * stack size in the basic block from which this edge originates. This size\n * is equal to the stack size at the \"jump\" instruction to which this edge\n * corresponds, relatively to the stack size at the beginning of the\n * originating basic block. If {@link ClassWriter#COMPUTE_FRAMES} is used,\n * this field is the kind of this control flow graph edge (i.e. NORMAL or\n * EXCEPTION).\n */\n int info;\n\n /**\n * The successor block of the basic block from which this edge originates.\n */\n Label successor;\n\n /**\n * The next edge in the list of successors of the originating basic block.\n * See {@link Label#successors successors}.\n */\n Edge next;\n}\n" }, { "path": "src/jvm/clojure/asm/FieldVisitor.java", "content": "/***\n * ASM: a very small and fast Java bytecode manipulation framework\n * Copyright (c) 2000-2011 INRIA, France Telecom\n * All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions\n * are met:\n * 1. Redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer.\n * 2. Redistributions in binary form must reproduce the above copyright\n * notice, this list of conditions and the following disclaimer in the\n * documentation and/or other materials provided with the distribution.\n * 3. Neither the name of the copyright holders nor the names of its\n * contributors may be used to endorse or promote products derived from\n * this software without specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\n * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\n * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE\n * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR\n * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF\n * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\n * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN\n * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\n * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF\n * THE POSSIBILITY OF SUCH DAMAGE.\n */\npackage clojure.asm;\n\n/**\n * A visitor to visit a Java field. The methods of this class must be called in\n * the following order: ( visitAnnotation | visitAttribute )*\n * visitEnd.\n *\n * @author Eric Bruneton\n */\npublic abstract class FieldVisitor {\n\n /**\n * The ASM API version implemented by this visitor. The value of this field\n * must be one of {@link Opcodes#ASM4}.\n */\n protected final int api;\n\n /**\n * The field visitor to which this visitor must delegate method calls. May\n * be null.\n */\n protected FieldVisitor fv;\n\n /**\n * Constructs a new {@link FieldVisitor}.\n *\n * @param api\n * the ASM API version implemented by this visitor. Must be one\n * of {@link Opcodes#ASM4}.\n */\n public FieldVisitor(final int api) {\n this(api, null);\n }\n\n /**\n * Constructs a new {@link FieldVisitor}.\n *\n * @param api\n * the ASM API version implemented by this visitor. Must be one\n * of {@link Opcodes#ASM4}.\n * @param fv\n * the field visitor to which this visitor must delegate method\n * calls. May be null.\n */\n public FieldVisitor(final int api, final FieldVisitor fv) {\n if (api != Opcodes.ASM4) {\n throw new IllegalArgumentException();\n }\n this.api = api;\n this.fv = fv;\n }\n\n /**\n * Visits an annotation of the field.\n *\n * @param desc\n * the class descriptor of the annotation class.\n * @param visible\n * true if the annotation is visible at runtime.\n * @return a visitor to visit the annotation values, or null if\n * this visitor is not interested in visiting this annotation.\n */\n public AnnotationVisitor visitAnnotation(String desc, boolean visible) {\n if (fv != null) {\n return fv.visitAnnotation(desc, visible);\n }\n return null;\n }\n\n /**\n * Visits a non standard attribute of the field.\n *\n * @param attr\n * an attribute.\n */\n public void visitAttribute(Attribute attr) {\n if (fv != null) {\n fv.visitAttribute(attr);\n }\n }\n\n /**\n * Visits the end of the field. This method, which is the last one to be\n * called, is used to inform the visitor that all the annotations and\n * attributes of the field have been visited.\n */\n public void visitEnd() {\n if (fv != null) {\n fv.visitEnd();\n }\n }\n}\n" }, { "path": "src/jvm/clojure/asm/FieldWriter.java", "content": "/***\n * ASM: a very small and fast Java bytecode manipulation framework\n * Copyright (c) 2000-2011 INRIA, France Telecom\n * All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions\n * are met:\n * 1. Redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer.\n * 2. Redistributions in binary form must reproduce the above copyright\n * notice, this list of conditions and the following disclaimer in the\n * documentation and/or other materials provided with the distribution.\n * 3. Neither the name of the copyright holders nor the names of its\n * contributors may be used to endorse or promote products derived from\n * this software without specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\n * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\n * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE\n * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR\n * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF\n * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\n * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN\n * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\n * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF\n * THE POSSIBILITY OF SUCH DAMAGE.\n */\npackage clojure.asm;\n\n/**\n * An {@link FieldVisitor} that generates Java fields in bytecode form.\n *\n * @author Eric Bruneton\n */\nfinal class FieldWriter extends FieldVisitor {\n\n /**\n * The class writer to which this field must be added.\n */\n private final ClassWriter cw;\n\n /**\n * Access flags of this field.\n */\n private final int access;\n\n /**\n * The index of the constant pool item that contains the name of this\n * method.\n */\n private final int name;\n\n /**\n * The index of the constant pool item that contains the descriptor of this\n * field.\n */\n private final int desc;\n\n /**\n * The index of the constant pool item that contains the signature of this\n * field.\n */\n private int signature;\n\n /**\n * The index of the constant pool item that contains the constant value of\n * this field.\n */\n private int value;\n\n /**\n * The runtime visible annotations of this field. May be null.\n */\n private AnnotationWriter anns;\n\n /**\n * The runtime invisible annotations of this field. May be null.\n */\n private AnnotationWriter ianns;\n\n /**\n * The non standard attributes of this field. May be null.\n */\n private Attribute attrs;\n\n // ------------------------------------------------------------------------\n // Constructor\n // ------------------------------------------------------------------------\n\n /**\n * Constructs a new {@link FieldWriter}.\n *\n * @param cw\n * the class writer to which this field must be added.\n * @param access\n * the field's access flags (see {@link Opcodes}).\n * @param name\n * the field's name.\n * @param desc\n * the field's descriptor (see {@link Type}).\n * @param signature\n * the field's signature. May be null.\n * @param value\n * the field's constant value. May be null.\n */\n FieldWriter(final ClassWriter cw, final int access, final String name,\n final String desc, final String signature, final Object value) {\n super(Opcodes.ASM4);\n if (cw.firstField == null) {\n cw.firstField = this;\n } else {\n cw.lastField.fv = this;\n }\n cw.lastField = this;\n this.cw = cw;\n this.access = access;\n this.name = cw.newUTF8(name);\n this.desc = cw.newUTF8(desc);\n if (ClassReader.SIGNATURES && signature != null) {\n this.signature = cw.newUTF8(signature);\n }\n if (value != null) {\n this.value = cw.newConstItem(value).index;\n }\n }\n\n // ------------------------------------------------------------------------\n // Implementation of the FieldVisitor abstract class\n // ------------------------------------------------------------------------\n\n @Override\n public AnnotationVisitor visitAnnotation(final String desc,\n final boolean visible) {\n if (!ClassReader.ANNOTATIONS) {\n return null;\n }\n ByteVector bv = new ByteVector();\n // write type, and reserve space for values count\n bv.putShort(cw.newUTF8(desc)).putShort(0);\n AnnotationWriter aw = new AnnotationWriter(cw, true, bv, bv, 2);\n if (visible) {\n aw.next = anns;\n anns = aw;\n } else {\n aw.next = ianns;\n ianns = aw;\n }\n return aw;\n }\n\n @Override\n public void visitAttribute(final Attribute attr) {\n attr.next = attrs;\n attrs = attr;\n }\n\n @Override\n public void visitEnd() {\n }\n\n // ------------------------------------------------------------------------\n // Utility methods\n // ------------------------------------------------------------------------\n\n /**\n * Returns the size of this field.\n *\n * @return the size of this field.\n */\n int getSize() {\n int size = 8;\n if (value != 0) {\n cw.newUTF8(\"ConstantValue\");\n size += 8;\n }\n if ((access & Opcodes.ACC_SYNTHETIC) != 0) {\n if ((cw.version & 0xFFFF) < Opcodes.V1_5\n || (access & ClassWriter.ACC_SYNTHETIC_ATTRIBUTE) != 0) {\n cw.newUTF8(\"Synthetic\");\n size += 6;\n }\n }\n if ((access & Opcodes.ACC_DEPRECATED) != 0) {\n cw.newUTF8(\"Deprecated\");\n size += 6;\n }\n if (ClassReader.SIGNATURES && signature != 0) {\n cw.newUTF8(\"Signature\");\n size += 8;\n }\n if (ClassReader.ANNOTATIONS && anns != null) {\n cw.newUTF8(\"RuntimeVisibleAnnotations\");\n size += 8 + anns.getSize();\n }\n if (ClassReader.ANNOTATIONS && ianns != null) {\n cw.newUTF8(\"RuntimeInvisibleAnnotations\");\n size += 8 + ianns.getSize();\n }\n if (attrs != null) {\n size += attrs.getSize(cw, null, 0, -1, -1);\n }\n return size;\n }\n\n /**\n * Puts the content of this field into the given byte vector.\n *\n * @param out\n * where the content of this field must be put.\n */\n void put(final ByteVector out) {\n final int FACTOR = ClassWriter.TO_ACC_SYNTHETIC;\n int mask = Opcodes.ACC_DEPRECATED | ClassWriter.ACC_SYNTHETIC_ATTRIBUTE\n | ((access & ClassWriter.ACC_SYNTHETIC_ATTRIBUTE) / FACTOR);\n out.putShort(access & ~mask).putShort(name).putShort(desc);\n int attributeCount = 0;\n if (value != 0) {\n ++attributeCount;\n }\n if ((access & Opcodes.ACC_SYNTHETIC) != 0) {\n if ((cw.version & 0xFFFF) < Opcodes.V1_5\n || (access & ClassWriter.ACC_SYNTHETIC_ATTRIBUTE) != 0) {\n ++attributeCount;\n }\n }\n if ((access & Opcodes.ACC_DEPRECATED) != 0) {\n ++attributeCount;\n }\n if (ClassReader.SIGNATURES && signature != 0) {\n ++attributeCount;\n }\n if (ClassReader.ANNOTATIONS && anns != null) {\n ++attributeCount;\n }\n if (ClassReader.ANNOTATIONS && ianns != null) {\n ++attributeCount;\n }\n if (attrs != null) {\n attributeCount += attrs.getCount();\n }\n out.putShort(attributeCount);\n if (value != 0) {\n out.putShort(cw.newUTF8(\"ConstantValue\"));\n out.putInt(2).putShort(value);\n }\n if ((access & Opcodes.ACC_SYNTHETIC) != 0) {\n if ((cw.version & 0xFFFF) < Opcodes.V1_5\n || (access & ClassWriter.ACC_SYNTHETIC_ATTRIBUTE) != 0) {\n out.putShort(cw.newUTF8(\"Synthetic\")).putInt(0);\n }\n }\n if ((access & Opcodes.ACC_DEPRECATED) != 0) {\n out.putShort(cw.newUTF8(\"Deprecated\")).putInt(0);\n }\n if (ClassReader.SIGNATURES && signature != 0) {\n out.putShort(cw.newUTF8(\"Signature\"));\n out.putInt(2).putShort(signature);\n }\n if (ClassReader.ANNOTATIONS && anns != null) {\n out.putShort(cw.newUTF8(\"RuntimeVisibleAnnotations\"));\n anns.put(out);\n }\n if (ClassReader.ANNOTATIONS && ianns != null) {\n out.putShort(cw.newUTF8(\"RuntimeInvisibleAnnotations\"));\n ianns.put(out);\n }\n if (attrs != null) {\n attrs.put(cw, null, 0, -1, -1, out);\n }\n }\n}\n" }, { "path": "src/jvm/clojure/asm/Frame.java", "content": "/***\n * ASM: a very small and fast Java bytecode manipulation framework\n * Copyright (c) 2000-2011 INRIA, France Telecom\n * All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions\n * are met:\n * 1. Redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer.\n * 2. Redistributions in binary form must reproduce the above copyright\n * notice, this list of conditions and the following disclaimer in the\n * documentation and/or other materials provided with the distribution.\n * 3. Neither the name of the copyright holders nor the names of its\n * contributors may be used to endorse or promote products derived from\n * this software without specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\n * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\n * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE\n * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR\n * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF\n * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\n * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN\n * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\n * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF\n * THE POSSIBILITY OF SUCH DAMAGE.\n */\npackage clojure.asm;\n\n/**\n * Information about the input and output stack map frames of a basic block.\n *\n * @author Eric Bruneton\n */\nfinal class Frame {\n\n /*\n * Frames are computed in a two steps process: during the visit of each\n * instruction, the state of the frame at the end of current basic block is\n * updated by simulating the action of the instruction on the previous state\n * of this so called \"output frame\". In visitMaxs, a fix point algorithm is\n * used to compute the \"input frame\" of each basic block, i.e. the stack map\n * frame at the beginning of the basic block, starting from the input frame\n * of the first basic block (which is computed from the method descriptor),\n * and by using the previously computed output frames to compute the input\n * state of the other blocks.\n *\n * All output and input frames are stored as arrays of integers. Reference\n * and array types are represented by an index into a type table (which is\n * not the same as the constant pool of the class, in order to avoid adding\n * unnecessary constants in the pool - not all computed frames will end up\n * being stored in the stack map table). This allows very fast type\n * comparisons.\n *\n * Output stack map frames are computed relatively to the input frame of the\n * basic block, which is not yet known when output frames are computed. It\n * is therefore necessary to be able to represent abstract types such as\n * \"the type at position x in the input frame locals\" or \"the type at\n * position x from the top of the input frame stack\" or even \"the type at\n * position x in the input frame, with y more (or less) array dimensions\".\n * This explains the rather complicated type format used in output frames.\n *\n * This format is the following: DIM KIND VALUE (4, 4 and 24 bits). DIM is a\n * signed number of array dimensions (from -8 to 7). KIND is either BASE,\n * LOCAL or STACK. BASE is used for types that are not relative to the input\n * frame. LOCAL is used for types that are relative to the input local\n * variable types. STACK is used for types that are relative to the input\n * stack types. VALUE depends on KIND. For LOCAL types, it is an index in\n * the input local variable types. For STACK types, it is a position\n * relatively to the top of input frame stack. For BASE types, it is either\n * one of the constants defined in FrameVisitor, or for OBJECT and\n * UNINITIALIZED types, a tag and an index in the type table.\n *\n * Output frames can contain types of any kind and with a positive or\n * negative dimension (and even unassigned types, represented by 0 - which\n * does not correspond to any valid type value). Input frames can only\n * contain BASE types of positive or null dimension. In all cases the type\n * table contains only internal type names (array type descriptors are\n * forbidden - dimensions must be represented through the DIM field).\n *\n * The LONG and DOUBLE types are always represented by using two slots (LONG\n * + TOP or DOUBLE + TOP), for local variable types as well as in the\n * operand stack. This is necessary to be able to simulate DUPx_y\n * instructions, whose effect would be dependent on the actual type values\n * if types were always represented by a single slot in the stack (and this\n * is not possible, since actual type values are not always known - cf LOCAL\n * and STACK type kinds).\n */\n\n /**\n * Mask to get the dimension of a frame type. This dimension is a signed\n * integer between -8 and 7.\n */\n static final int DIM = 0xF0000000;\n\n /**\n * Constant to be added to a type to get a type with one more dimension.\n */\n static final int ARRAY_OF = 0x10000000;\n\n /**\n * Constant to be added to a type to get a type with one less dimension.\n */\n static final int ELEMENT_OF = 0xF0000000;\n\n /**\n * Mask to get the kind of a frame type.\n *\n * @see #BASE\n * @see #LOCAL\n * @see #STACK\n */\n static final int KIND = 0xF000000;\n\n /**\n * Flag used for LOCAL and STACK types. Indicates that if this type happens\n * to be a long or double type (during the computations of input frames),\n * then it must be set to TOP because the second word of this value has been\n * reused to store other data in the basic block. Hence the first word no\n * longer stores a valid long or double value.\n */\n static final int TOP_IF_LONG_OR_DOUBLE = 0x800000;\n\n /**\n * Mask to get the value of a frame type.\n */\n static final int VALUE = 0x7FFFFF;\n\n /**\n * Mask to get the kind of base types.\n */\n static final int BASE_KIND = 0xFF00000;\n\n /**\n * Mask to get the value of base types.\n */\n static final int BASE_VALUE = 0xFFFFF;\n\n /**\n * Kind of the types that are not relative to an input stack map frame.\n */\n static final int BASE = 0x1000000;\n\n /**\n * Base kind of the base reference types. The BASE_VALUE of such types is an\n * index into the type table.\n */\n static final int OBJECT = BASE | 0x700000;\n\n /**\n * Base kind of the uninitialized base types. The BASE_VALUE of such types\n * in an index into the type table (the Item at that index contains both an\n * instruction offset and an internal class name).\n */\n static final int UNINITIALIZED = BASE | 0x800000;\n\n /**\n * Kind of the types that are relative to the local variable types of an\n * input stack map frame. The value of such types is a local variable index.\n */\n private static final int LOCAL = 0x2000000;\n\n /**\n * Kind of the the types that are relative to the stack of an input stack\n * map frame. The value of such types is a position relatively to the top of\n * this stack.\n */\n private static final int STACK = 0x3000000;\n\n /**\n * The TOP type. This is a BASE type.\n */\n static final int TOP = BASE | 0;\n\n /**\n * The BOOLEAN type. This is a BASE type mainly used for array types.\n */\n static final int BOOLEAN = BASE | 9;\n\n /**\n * The BYTE type. This is a BASE type mainly used for array types.\n */\n static final int BYTE = BASE | 10;\n\n /**\n * The CHAR type. This is a BASE type mainly used for array types.\n */\n static final int CHAR = BASE | 11;\n\n /**\n * The SHORT type. This is a BASE type mainly used for array types.\n */\n static final int SHORT = BASE | 12;\n\n /**\n * The INTEGER type. This is a BASE type.\n */\n static final int INTEGER = BASE | 1;\n\n /**\n * The FLOAT type. This is a BASE type.\n */\n static final int FLOAT = BASE | 2;\n\n /**\n * The DOUBLE type. This is a BASE type.\n */\n static final int DOUBLE = BASE | 3;\n\n /**\n * The LONG type. This is a BASE type.\n */\n static final int LONG = BASE | 4;\n\n /**\n * The NULL type. This is a BASE type.\n */\n static final int NULL = BASE | 5;\n\n /**\n * The UNINITIALIZED_THIS type. This is a BASE type.\n */\n static final int UNINITIALIZED_THIS = BASE | 6;\n\n /**\n * The stack size variation corresponding to each JVM instruction. This\n * stack variation is equal to the size of the values produced by an\n * instruction, minus the size of the values consumed by this instruction.\n */\n static final int[] SIZE;\n\n /**\n * Computes the stack size variation corresponding to each JVM instruction.\n */\n static {\n int i;\n int[] b = new int[202];\n String s = \"EFFFFFFFFGGFFFGGFFFEEFGFGFEEEEEEEEEEEEEEEEEEEEDEDEDDDDD\"\n + \"CDCDEEEEEEEEEEEEEEEEEEEEBABABBBBDCFFFGGGEDCDCDCDCDCDCDCDCD\"\n + \"CDCEEEEDDDDDDDCDCDCEFEFDDEEFFDEDEEEBDDBBDDDDDDCCCCCCCCEFED\"\n + \"DDCDCDEEEEEEEEEEFEEEEEEDDEEDDEE\";\n for (i = 0; i < b.length; ++i) {\n b[i] = s.charAt(i) - 'E';\n }\n SIZE = b;\n\n // code to generate the above string\n //\n // int NA = 0; // not applicable (unused opcode or variable size opcode)\n //\n // b = new int[] {\n // 0, //NOP, // visitInsn\n // 1, //ACONST_NULL, // -\n // 1, //ICONST_M1, // -\n // 1, //ICONST_0, // -\n // 1, //ICONST_1, // -\n // 1, //ICONST_2, // -\n // 1, //ICONST_3, // -\n // 1, //ICONST_4, // -\n // 1, //ICONST_5, // -\n // 2, //LCONST_0, // -\n // 2, //LCONST_1, // -\n // 1, //FCONST_0, // -\n // 1, //FCONST_1, // -\n // 1, //FCONST_2, // -\n // 2, //DCONST_0, // -\n // 2, //DCONST_1, // -\n // 1, //BIPUSH, // visitIntInsn\n // 1, //SIPUSH, // -\n // 1, //LDC, // visitLdcInsn\n // NA, //LDC_W, // -\n // NA, //LDC2_W, // -\n // 1, //ILOAD, // visitVarInsn\n // 2, //LLOAD, // -\n // 1, //FLOAD, // -\n // 2, //DLOAD, // -\n // 1, //ALOAD, // -\n // NA, //ILOAD_0, // -\n // NA, //ILOAD_1, // -\n // NA, //ILOAD_2, // -\n // NA, //ILOAD_3, // -\n // NA, //LLOAD_0, // -\n // NA, //LLOAD_1, // -\n // NA, //LLOAD_2, // -\n // NA, //LLOAD_3, // -\n // NA, //FLOAD_0, // -\n // NA, //FLOAD_1, // -\n // NA, //FLOAD_2, // -\n // NA, //FLOAD_3, // -\n // NA, //DLOAD_0, // -\n // NA, //DLOAD_1, // -\n // NA, //DLOAD_2, // -\n // NA, //DLOAD_3, // -\n // NA, //ALOAD_0, // -\n // NA, //ALOAD_1, // -\n // NA, //ALOAD_2, // -\n // NA, //ALOAD_3, // -\n // -1, //IALOAD, // visitInsn\n // 0, //LALOAD, // -\n // -1, //FALOAD, // -\n // 0, //DALOAD, // -\n // -1, //AALOAD, // -\n // -1, //BALOAD, // -\n // -1, //CALOAD, // -\n // -1, //SALOAD, // -\n // -1, //ISTORE, // visitVarInsn\n // -2, //LSTORE, // -\n // -1, //FSTORE, // -\n // -2, //DSTORE, // -\n // -1, //ASTORE, // -\n // NA, //ISTORE_0, // -\n // NA, //ISTORE_1, // -\n // NA, //ISTORE_2, // -\n // NA, //ISTORE_3, // -\n // NA, //LSTORE_0, // -\n // NA, //LSTORE_1, // -\n // NA, //LSTORE_2, // -\n // NA, //LSTORE_3, // -\n // NA, //FSTORE_0, // -\n // NA, //FSTORE_1, // -\n // NA, //FSTORE_2, // -\n // NA, //FSTORE_3, // -\n // NA, //DSTORE_0, // -\n // NA, //DSTORE_1, // -\n // NA, //DSTORE_2, // -\n // NA, //DSTORE_3, // -\n // NA, //ASTORE_0, // -\n // NA, //ASTORE_1, // -\n // NA, //ASTORE_2, // -\n // NA, //ASTORE_3, // -\n // -3, //IASTORE, // visitInsn\n // -4, //LASTORE, // -\n // -3, //FASTORE, // -\n // -4, //DASTORE, // -\n // -3, //AASTORE, // -\n // -3, //BASTORE, // -\n // -3, //CASTORE, // -\n // -3, //SASTORE, // -\n // -1, //POP, // -\n // -2, //POP2, // -\n // 1, //DUP, // -\n // 1, //DUP_X1, // -\n // 1, //DUP_X2, // -\n // 2, //DUP2, // -\n // 2, //DUP2_X1, // -\n // 2, //DUP2_X2, // -\n // 0, //SWAP, // -\n // -1, //IADD, // -\n // -2, //LADD, // -\n // -1, //FADD, // -\n // -2, //DADD, // -\n // -1, //ISUB, // -\n // -2, //LSUB, // -\n // -1, //FSUB, // -\n // -2, //DSUB, // -\n // -1, //IMUL, // -\n // -2, //LMUL, // -\n // -1, //FMUL, // -\n // -2, //DMUL, // -\n // -1, //IDIV, // -\n // -2, //LDIV, // -\n // -1, //FDIV, // -\n // -2, //DDIV, // -\n // -1, //IREM, // -\n // -2, //LREM, // -\n // -1, //FREM, // -\n // -2, //DREM, // -\n // 0, //INEG, // -\n // 0, //LNEG, // -\n // 0, //FNEG, // -\n // 0, //DNEG, // -\n // -1, //ISHL, // -\n // -1, //LSHL, // -\n // -1, //ISHR, // -\n // -1, //LSHR, // -\n // -1, //IUSHR, // -\n // -1, //LUSHR, // -\n // -1, //IAND, // -\n // -2, //LAND, // -\n // -1, //IOR, // -\n // -2, //LOR, // -\n // -1, //IXOR, // -\n // -2, //LXOR, // -\n // 0, //IINC, // visitIincInsn\n // 1, //I2L, // visitInsn\n // 0, //I2F, // -\n // 1, //I2D, // -\n // -1, //L2I, // -\n // -1, //L2F, // -\n // 0, //L2D, // -\n // 0, //F2I, // -\n // 1, //F2L, // -\n // 1, //F2D, // -\n // -1, //D2I, // -\n // 0, //D2L, // -\n // -1, //D2F, // -\n // 0, //I2B, // -\n // 0, //I2C, // -\n // 0, //I2S, // -\n // -3, //LCMP, // -\n // -1, //FCMPL, // -\n // -1, //FCMPG, // -\n // -3, //DCMPL, // -\n // -3, //DCMPG, // -\n // -1, //IFEQ, // visitJumpInsn\n // -1, //IFNE, // -\n // -1, //IFLT, // -\n // -1, //IFGE, // -\n // -1, //IFGT, // -\n // -1, //IFLE, // -\n // -2, //IF_ICMPEQ, // -\n // -2, //IF_ICMPNE, // -\n // -2, //IF_ICMPLT, // -\n // -2, //IF_ICMPGE, // -\n // -2, //IF_ICMPGT, // -\n // -2, //IF_ICMPLE, // -\n // -2, //IF_ACMPEQ, // -\n // -2, //IF_ACMPNE, // -\n // 0, //GOTO, // -\n // 1, //JSR, // -\n // 0, //RET, // visitVarInsn\n // -1, //TABLESWITCH, // visiTableSwitchInsn\n // -1, //LOOKUPSWITCH, // visitLookupSwitch\n // -1, //IRETURN, // visitInsn\n // -2, //LRETURN, // -\n // -1, //FRETURN, // -\n // -2, //DRETURN, // -\n // -1, //ARETURN, // -\n // 0, //RETURN, // -\n // NA, //GETSTATIC, // visitFieldInsn\n // NA, //PUTSTATIC, // -\n // NA, //GETFIELD, // -\n // NA, //PUTFIELD, // -\n // NA, //INVOKEVIRTUAL, // visitMethodInsn\n // NA, //INVOKESPECIAL, // -\n // NA, //INVOKESTATIC, // -\n // NA, //INVOKEINTERFACE, // -\n // NA, //INVOKEDYNAMIC, // visitInvokeDynamicInsn\n // 1, //NEW, // visitTypeInsn\n // 0, //NEWARRAY, // visitIntInsn\n // 0, //ANEWARRAY, // visitTypeInsn\n // 0, //ARRAYLENGTH, // visitInsn\n // NA, //ATHROW, // -\n // 0, //CHECKCAST, // visitTypeInsn\n // 0, //INSTANCEOF, // -\n // -1, //MONITORENTER, // visitInsn\n // -1, //MONITOREXIT, // -\n // NA, //WIDE, // NOT VISITED\n // NA, //MULTIANEWARRAY, // visitMultiANewArrayInsn\n // -1, //IFNULL, // visitJumpInsn\n // -1, //IFNONNULL, // -\n // NA, //GOTO_W, // -\n // NA, //JSR_W, // -\n // };\n // for (i = 0; i < b.length; ++i) {\n // System.err.print((char)('E' + b[i]));\n // }\n // System.err.println();\n }\n\n /**\n * The label (i.e. basic block) to which these input and output stack map\n * frames correspond.\n */\n Label owner;\n\n /**\n * The input stack map frame locals.\n */\n int[] inputLocals;\n\n /**\n * The input stack map frame stack.\n */\n int[] inputStack;\n\n /**\n * The output stack map frame locals.\n */\n private int[] outputLocals;\n\n /**\n * The output stack map frame stack.\n */\n private int[] outputStack;\n\n /**\n * Relative size of the output stack. The exact semantics of this field\n * depends on the algorithm that is used.\n *\n * When only the maximum stack size is computed, this field is the size of\n * the output stack relatively to the top of the input stack.\n *\n * When the stack map frames are completely computed, this field is the\n * actual number of types in {@link #outputStack}.\n */\n private int outputStackTop;\n\n /**\n * Number of types that are initialized in the basic block.\n *\n * @see #initializations\n */\n private int initializationCount;\n\n /**\n * The types that are initialized in the basic block. A constructor\n * invocation on an UNINITIALIZED or UNINITIALIZED_THIS type must replace\n * every occurence of this type in the local variables and in the\n * operand stack. This cannot be done during the first phase of the\n * algorithm since, during this phase, the local variables and the operand\n * stack are not completely computed. It is therefore necessary to store the\n * types on which constructors are invoked in the basic block, in order to\n * do this replacement during the second phase of the algorithm, where the\n * frames are fully computed. Note that this array can contain types that\n * are relative to input locals or to the input stack (see below for the\n * description of the algorithm).\n */\n private int[] initializations;\n\n /**\n * Returns the output frame local variable type at the given index.\n *\n * @param local\n * the index of the local that must be returned.\n * @return the output frame local variable type at the given index.\n */\n private int get(final int local) {\n if (outputLocals == null || local >= outputLocals.length) {\n // this local has never been assigned in this basic block,\n // so it is still equal to its value in the input frame\n return LOCAL | local;\n } else {\n int type = outputLocals[local];\n if (type == 0) {\n // this local has never been assigned in this basic block,\n // so it is still equal to its value in the input frame\n type = outputLocals[local] = LOCAL | local;\n }\n return type;\n }\n }\n\n /**\n * Sets the output frame local variable type at the given index.\n *\n * @param local\n * the index of the local that must be set.\n * @param type\n * the value of the local that must be set.\n */\n private void set(final int local, final int type) {\n // creates and/or resizes the output local variables array if necessary\n if (outputLocals == null) {\n outputLocals = new int[10];\n }\n int n = outputLocals.length;\n if (local >= n) {\n int[] t = new int[Math.max(local + 1, 2 * n)];\n System.arraycopy(outputLocals, 0, t, 0, n);\n outputLocals = t;\n }\n // sets the local variable\n outputLocals[local] = type;\n }\n\n /**\n * Pushes a new type onto the output frame stack.\n *\n * @param type\n * the type that must be pushed.\n */\n private void push(final int type) {\n // creates and/or resizes the output stack array if necessary\n if (outputStack == null) {\n outputStack = new int[10];\n }\n int n = outputStack.length;\n if (outputStackTop >= n) {\n int[] t = new int[Math.max(outputStackTop + 1, 2 * n)];\n System.arraycopy(outputStack, 0, t, 0, n);\n outputStack = t;\n }\n // pushes the type on the output stack\n outputStack[outputStackTop++] = type;\n // updates the maximun height reached by the output stack, if needed\n int top = owner.inputStackTop + outputStackTop;\n if (top > owner.outputStackMax) {\n owner.outputStackMax = top;\n }\n }\n\n /**\n * Pushes a new type onto the output frame stack.\n *\n * @param cw\n * the ClassWriter to which this label belongs.\n * @param desc\n * the descriptor of the type to be pushed. Can also be a method\n * descriptor (in this case this method pushes its return type\n * onto the output frame stack).\n */\n private void push(final ClassWriter cw, final String desc) {\n int type = type(cw, desc);\n if (type != 0) {\n push(type);\n if (type == LONG || type == DOUBLE) {\n push(TOP);\n }\n }\n }\n\n /**\n * Returns the int encoding of the given type.\n *\n * @param cw\n * the ClassWriter to which this label belongs.\n * @param desc\n * a type descriptor.\n * @return the int encoding of the given type.\n */\n private static int type(final ClassWriter cw, final String desc) {\n String t;\n int index = desc.charAt(0) == '(' ? desc.indexOf(')') + 1 : 0;\n switch (desc.charAt(index)) {\n case 'V':\n return 0;\n case 'Z':\n case 'C':\n case 'B':\n case 'S':\n case 'I':\n return INTEGER;\n case 'F':\n return FLOAT;\n case 'J':\n return LONG;\n case 'D':\n return DOUBLE;\n case 'L':\n // stores the internal name, not the descriptor!\n t = desc.substring(index + 1, desc.length() - 1);\n return OBJECT | cw.addType(t);\n // case '[':\n default:\n // extracts the dimensions and the element type\n int data;\n int dims = index + 1;\n while (desc.charAt(dims) == '[') {\n ++dims;\n }\n switch (desc.charAt(dims)) {\n case 'Z':\n data = BOOLEAN;\n break;\n case 'C':\n data = CHAR;\n break;\n case 'B':\n data = BYTE;\n break;\n case 'S':\n data = SHORT;\n break;\n case 'I':\n data = INTEGER;\n break;\n case 'F':\n data = FLOAT;\n break;\n case 'J':\n data = LONG;\n break;\n case 'D':\n data = DOUBLE;\n break;\n // case 'L':\n default:\n // stores the internal name, not the descriptor\n t = desc.substring(dims + 1, desc.length() - 1);\n data = OBJECT | cw.addType(t);\n }\n return (dims - index) << 28 | data;\n }\n }\n\n /**\n * Pops a type from the output frame stack and returns its value.\n *\n * @return the type that has been popped from the output frame stack.\n */\n private int pop() {\n if (outputStackTop > 0) {\n return outputStack[--outputStackTop];\n } else {\n // if the output frame stack is empty, pops from the input stack\n return STACK | -(--owner.inputStackTop);\n }\n }\n\n /**\n * Pops the given number of types from the output frame stack.\n *\n * @param elements\n * the number of types that must be popped.\n */\n private void pop(final int elements) {\n if (outputStackTop >= elements) {\n outputStackTop -= elements;\n } else {\n // if the number of elements to be popped is greater than the number\n // of elements in the output stack, clear it, and pops the remaining\n // elements from the input stack.\n owner.inputStackTop -= elements - outputStackTop;\n outputStackTop = 0;\n }\n }\n\n /**\n * Pops a type from the output frame stack.\n *\n * @param desc\n * the descriptor of the type to be popped. Can also be a method\n * descriptor (in this case this method pops the types\n * corresponding to the method arguments).\n */\n private void pop(final String desc) {\n char c = desc.charAt(0);\n if (c == '(') {\n pop((Type.getArgumentsAndReturnSizes(desc) >> 2) - 1);\n } else if (c == 'J' || c == 'D') {\n pop(2);\n } else {\n pop(1);\n }\n }\n\n /**\n * Adds a new type to the list of types on which a constructor is invoked in\n * the basic block.\n *\n * @param var\n * a type on a which a constructor is invoked.\n */\n private void init(final int var) {\n // creates and/or resizes the initializations array if necessary\n if (initializations == null) {\n initializations = new int[2];\n }\n int n = initializations.length;\n if (initializationCount >= n) {\n int[] t = new int[Math.max(initializationCount + 1, 2 * n)];\n System.arraycopy(initializations, 0, t, 0, n);\n initializations = t;\n }\n // stores the type to be initialized\n initializations[initializationCount++] = var;\n }\n\n /**\n * Replaces the given type with the appropriate type if it is one of the\n * types on which a constructor is invoked in the basic block.\n *\n * @param cw\n * the ClassWriter to which this label belongs.\n * @param t\n * a type\n * @return t or, if t is one of the types on which a constructor is invoked\n * in the basic block, the type corresponding to this constructor.\n */\n private int init(final ClassWriter cw, final int t) {\n int s;\n if (t == UNINITIALIZED_THIS) {\n s = OBJECT | cw.addType(cw.thisName);\n } else if ((t & (DIM | BASE_KIND)) == UNINITIALIZED) {\n String type = cw.typeTable[t & BASE_VALUE].strVal1;\n s = OBJECT | cw.addType(type);\n } else {\n return t;\n }\n for (int j = 0; j < initializationCount; ++j) {\n int u = initializations[j];\n int dim = u & DIM;\n int kind = u & KIND;\n if (kind == LOCAL) {\n u = dim + inputLocals[u & VALUE];\n } else if (kind == STACK) {\n u = dim + inputStack[inputStack.length - (u & VALUE)];\n }\n if (t == u) {\n return s;\n }\n }\n return t;\n }\n\n /**\n * Initializes the input frame of the first basic block from the method\n * descriptor.\n *\n * @param cw\n * the ClassWriter to which this label belongs.\n * @param access\n * the access flags of the method to which this label belongs.\n * @param args\n * the formal parameter types of this method.\n * @param maxLocals\n * the maximum number of local variables of this method.\n */\n void initInputFrame(final ClassWriter cw, final int access,\n final Type[] args, final int maxLocals) {\n inputLocals = new int[maxLocals];\n inputStack = new int[0];\n int i = 0;\n if ((access & Opcodes.ACC_STATIC) == 0) {\n if ((access & MethodWriter.ACC_CONSTRUCTOR) == 0) {\n inputLocals[i++] = OBJECT | cw.addType(cw.thisName);\n } else {\n inputLocals[i++] = UNINITIALIZED_THIS;\n }\n }\n for (int j = 0; j < args.length; ++j) {\n int t = type(cw, args[j].getDescriptor());\n inputLocals[i++] = t;\n if (t == LONG || t == DOUBLE) {\n inputLocals[i++] = TOP;\n }\n }\n while (i < maxLocals) {\n inputLocals[i++] = TOP;\n }\n }\n\n /**\n * Simulates the action of the given instruction on the output stack frame.\n *\n * @param opcode\n * the opcode of the instruction.\n * @param arg\n * the operand of the instruction, if any.\n * @param cw\n * the class writer to which this label belongs.\n * @param item\n * the operand of the instructions, if any.\n */\n void execute(final int opcode, final int arg, final ClassWriter cw,\n final Item item) {\n int t1, t2, t3, t4;\n switch (opcode) {\n case Opcodes.NOP:\n case Opcodes.INEG:\n case Opcodes.LNEG:\n case Opcodes.FNEG:\n case Opcodes.DNEG:\n case Opcodes.I2B:\n case Opcodes.I2C:\n case Opcodes.I2S:\n case Opcodes.GOTO:\n case Opcodes.RETURN:\n break;\n case Opcodes.ACONST_NULL:\n push(NULL);\n break;\n case Opcodes.ICONST_M1:\n case Opcodes.ICONST_0:\n case Opcodes.ICONST_1:\n case Opcodes.ICONST_2:\n case Opcodes.ICONST_3:\n case Opcodes.ICONST_4:\n case Opcodes.ICONST_5:\n case Opcodes.BIPUSH:\n case Opcodes.SIPUSH:\n case Opcodes.ILOAD:\n push(INTEGER);\n break;\n case Opcodes.LCONST_0:\n case Opcodes.LCONST_1:\n case Opcodes.LLOAD:\n push(LONG);\n push(TOP);\n break;\n case Opcodes.FCONST_0:\n case Opcodes.FCONST_1:\n case Opcodes.FCONST_2:\n case Opcodes.FLOAD:\n push(FLOAT);\n break;\n case Opcodes.DCONST_0:\n case Opcodes.DCONST_1:\n case Opcodes.DLOAD:\n push(DOUBLE);\n push(TOP);\n break;\n case Opcodes.LDC:\n switch (item.type) {\n case ClassWriter.INT:\n push(INTEGER);\n break;\n case ClassWriter.LONG:\n push(LONG);\n push(TOP);\n break;\n case ClassWriter.FLOAT:\n push(FLOAT);\n break;\n case ClassWriter.DOUBLE:\n push(DOUBLE);\n push(TOP);\n break;\n case ClassWriter.CLASS:\n push(OBJECT | cw.addType(\"java/lang/Class\"));\n break;\n case ClassWriter.STR:\n push(OBJECT | cw.addType(\"java/lang/String\"));\n break;\n case ClassWriter.MTYPE:\n push(OBJECT | cw.addType(\"java/lang/invoke/MethodType\"));\n break;\n // case ClassWriter.HANDLE_BASE + [1..9]:\n default:\n push(OBJECT | cw.addType(\"java/lang/invoke/MethodHandle\"));\n }\n break;\n case Opcodes.ALOAD:\n push(get(arg));\n break;\n case Opcodes.IALOAD:\n case Opcodes.BALOAD:\n case Opcodes.CALOAD:\n case Opcodes.SALOAD:\n pop(2);\n push(INTEGER);\n break;\n case Opcodes.LALOAD:\n case Opcodes.D2L:\n pop(2);\n push(LONG);\n push(TOP);\n break;\n case Opcodes.FALOAD:\n pop(2);\n push(FLOAT);\n break;\n case Opcodes.DALOAD:\n case Opcodes.L2D:\n pop(2);\n push(DOUBLE);\n push(TOP);\n break;\n case Opcodes.AALOAD:\n pop(1);\n t1 = pop();\n push(ELEMENT_OF + t1);\n break;\n case Opcodes.ISTORE:\n case Opcodes.FSTORE:\n case Opcodes.ASTORE:\n t1 = pop();\n set(arg, t1);\n if (arg > 0) {\n t2 = get(arg - 1);\n // if t2 is of kind STACK or LOCAL we cannot know its size!\n if (t2 == LONG || t2 == DOUBLE) {\n set(arg - 1, TOP);\n } else if ((t2 & KIND) != BASE) {\n set(arg - 1, t2 | TOP_IF_LONG_OR_DOUBLE);\n }\n }\n break;\n case Opcodes.LSTORE:\n case Opcodes.DSTORE:\n pop(1);\n t1 = pop();\n set(arg, t1);\n set(arg + 1, TOP);\n if (arg > 0) {\n t2 = get(arg - 1);\n // if t2 is of kind STACK or LOCAL we cannot know its size!\n if (t2 == LONG || t2 == DOUBLE) {\n set(arg - 1, TOP);\n } else if ((t2 & KIND) != BASE) {\n set(arg - 1, t2 | TOP_IF_LONG_OR_DOUBLE);\n }\n }\n break;\n case Opcodes.IASTORE:\n case Opcodes.BASTORE:\n case Opcodes.CASTORE:\n case Opcodes.SASTORE:\n case Opcodes.FASTORE:\n case Opcodes.AASTORE:\n pop(3);\n break;\n case Opcodes.LASTORE:\n case Opcodes.DASTORE:\n pop(4);\n break;\n case Opcodes.POP:\n case Opcodes.IFEQ:\n case Opcodes.IFNE:\n case Opcodes.IFLT:\n case Opcodes.IFGE:\n case Opcodes.IFGT:\n case Opcodes.IFLE:\n case Opcodes.IRETURN:\n case Opcodes.FRETURN:\n case Opcodes.ARETURN:\n case Opcodes.TABLESWITCH:\n case Opcodes.LOOKUPSWITCH:\n case Opcodes.ATHROW:\n case Opcodes.MONITORENTER:\n case Opcodes.MONITOREXIT:\n case Opcodes.IFNULL:\n case Opcodes.IFNONNULL:\n pop(1);\n break;\n case Opcodes.POP2:\n case Opcodes.IF_ICMPEQ:\n case Opcodes.IF_ICMPNE:\n case Opcodes.IF_ICMPLT:\n case Opcodes.IF_ICMPGE:\n case Opcodes.IF_ICMPGT:\n case Opcodes.IF_ICMPLE:\n case Opcodes.IF_ACMPEQ:\n case Opcodes.IF_ACMPNE:\n case Opcodes.LRETURN:\n case Opcodes.DRETURN:\n pop(2);\n break;\n case Opcodes.DUP:\n t1 = pop();\n push(t1);\n push(t1);\n break;\n case Opcodes.DUP_X1:\n t1 = pop();\n t2 = pop();\n push(t1);\n push(t2);\n push(t1);\n break;\n case Opcodes.DUP_X2:\n t1 = pop();\n t2 = pop();\n t3 = pop();\n push(t1);\n push(t3);\n push(t2);\n push(t1);\n break;\n case Opcodes.DUP2:\n t1 = pop();\n t2 = pop();\n push(t2);\n push(t1);\n push(t2);\n push(t1);\n break;\n case Opcodes.DUP2_X1:\n t1 = pop();\n t2 = pop();\n t3 = pop();\n push(t2);\n push(t1);\n push(t3);\n push(t2);\n push(t1);\n break;\n case Opcodes.DUP2_X2:\n t1 = pop();\n t2 = pop();\n t3 = pop();\n t4 = pop();\n push(t2);\n push(t1);\n push(t4);\n push(t3);\n push(t2);\n push(t1);\n break;\n case Opcodes.SWAP:\n t1 = pop();\n t2 = pop();\n push(t1);\n push(t2);\n break;\n case Opcodes.IADD:\n case Opcodes.ISUB:\n case Opcodes.IMUL:\n case Opcodes.IDIV:\n case Opcodes.IREM:\n case Opcodes.IAND:\n case Opcodes.IOR:\n case Opcodes.IXOR:\n case Opcodes.ISHL:\n case Opcodes.ISHR:\n case Opcodes.IUSHR:\n case Opcodes.L2I:\n case Opcodes.D2I:\n case Opcodes.FCMPL:\n case Opcodes.FCMPG:\n pop(2);\n push(INTEGER);\n break;\n case Opcodes.LADD:\n case Opcodes.LSUB:\n case Opcodes.LMUL:\n case Opcodes.LDIV:\n case Opcodes.LREM:\n case Opcodes.LAND:\n case Opcodes.LOR:\n case Opcodes.LXOR:\n pop(4);\n push(LONG);\n push(TOP);\n break;\n case Opcodes.FADD:\n case Opcodes.FSUB:\n case Opcodes.FMUL:\n case Opcodes.FDIV:\n case Opcodes.FREM:\n case Opcodes.L2F:\n case Opcodes.D2F:\n pop(2);\n push(FLOAT);\n break;\n case Opcodes.DADD:\n case Opcodes.DSUB:\n case Opcodes.DMUL:\n case Opcodes.DDIV:\n case Opcodes.DREM:\n pop(4);\n push(DOUBLE);\n push(TOP);\n break;\n case Opcodes.LSHL:\n case Opcodes.LSHR:\n case Opcodes.LUSHR:\n pop(3);\n push(LONG);\n push(TOP);\n break;\n case Opcodes.IINC:\n set(arg, INTEGER);\n break;\n case Opcodes.I2L:\n case Opcodes.F2L:\n pop(1);\n push(LONG);\n push(TOP);\n break;\n case Opcodes.I2F:\n pop(1);\n push(FLOAT);\n break;\n case Opcodes.I2D:\n case Opcodes.F2D:\n pop(1);\n push(DOUBLE);\n push(TOP);\n break;\n case Opcodes.F2I:\n case Opcodes.ARRAYLENGTH:\n case Opcodes.INSTANCEOF:\n pop(1);\n push(INTEGER);\n break;\n case Opcodes.LCMP:\n case Opcodes.DCMPL:\n case Opcodes.DCMPG:\n pop(4);\n push(INTEGER);\n break;\n case Opcodes.JSR:\n case Opcodes.RET:\n throw new RuntimeException(\n \"JSR/RET are not supported with computeFrames option\");\n case Opcodes.GETSTATIC:\n push(cw, item.strVal3);\n break;\n case Opcodes.PUTSTATIC:\n pop(item.strVal3);\n break;\n case Opcodes.GETFIELD:\n pop(1);\n push(cw, item.strVal3);\n break;\n case Opcodes.PUTFIELD:\n pop(item.strVal3);\n pop();\n break;\n case Opcodes.INVOKEVIRTUAL:\n case Opcodes.INVOKESPECIAL:\n case Opcodes.INVOKESTATIC:\n case Opcodes.INVOKEINTERFACE:\n pop(item.strVal3);\n if (opcode != Opcodes.INVOKESTATIC) {\n t1 = pop();\n if (opcode == Opcodes.INVOKESPECIAL\n && item.strVal2.charAt(0) == '<') {\n init(t1);\n }\n }\n push(cw, item.strVal3);\n break;\n case Opcodes.INVOKEDYNAMIC:\n pop(item.strVal2);\n push(cw, item.strVal2);\n break;\n case Opcodes.NEW:\n push(UNINITIALIZED | cw.addUninitializedType(item.strVal1, arg));\n break;\n case Opcodes.NEWARRAY:\n pop();\n switch (arg) {\n case Opcodes.T_BOOLEAN:\n push(ARRAY_OF | BOOLEAN);\n break;\n case Opcodes.T_CHAR:\n push(ARRAY_OF | CHAR);\n break;\n case Opcodes.T_BYTE:\n push(ARRAY_OF | BYTE);\n break;\n case Opcodes.T_SHORT:\n push(ARRAY_OF | SHORT);\n break;\n case Opcodes.T_INT:\n push(ARRAY_OF | INTEGER);\n break;\n case Opcodes.T_FLOAT:\n push(ARRAY_OF | FLOAT);\n break;\n case Opcodes.T_DOUBLE:\n push(ARRAY_OF | DOUBLE);\n break;\n // case Opcodes.T_LONG:\n default:\n push(ARRAY_OF | LONG);\n break;\n }\n break;\n case Opcodes.ANEWARRAY:\n String s = item.strVal1;\n pop();\n if (s.charAt(0) == '[') {\n push(cw, '[' + s);\n } else {\n push(ARRAY_OF | OBJECT | cw.addType(s));\n }\n break;\n case Opcodes.CHECKCAST:\n s = item.strVal1;\n pop();\n if (s.charAt(0) == '[') {\n push(cw, s);\n } else {\n push(OBJECT | cw.addType(s));\n }\n break;\n // case Opcodes.MULTIANEWARRAY:\n default:\n pop(arg);\n push(cw, item.strVal1);\n break;\n }\n }\n\n /**\n * Merges the input frame of the given basic block with the input and output\n * frames of this basic block. Returns true if the input frame of\n * the given label has been changed by this operation.\n *\n * @param cw\n * the ClassWriter to which this label belongs.\n * @param frame\n * the basic block whose input frame must be updated.\n * @param edge\n * the kind of the {@link Edge} between this label and 'label'.\n * See {@link Edge#info}.\n * @return true if the input frame of the given label has been\n * changed by this operation.\n */\n boolean merge(final ClassWriter cw, final Frame frame, final int edge) {\n boolean changed = false;\n int i, s, dim, kind, t;\n\n int nLocal = inputLocals.length;\n int nStack = inputStack.length;\n if (frame.inputLocals == null) {\n frame.inputLocals = new int[nLocal];\n changed = true;\n }\n\n for (i = 0; i < nLocal; ++i) {\n if (outputLocals != null && i < outputLocals.length) {\n s = outputLocals[i];\n if (s == 0) {\n t = inputLocals[i];\n } else {\n dim = s & DIM;\n kind = s & KIND;\n if (kind == BASE) {\n t = s;\n } else {\n if (kind == LOCAL) {\n t = dim + inputLocals[s & VALUE];\n } else {\n t = dim + inputStack[nStack - (s & VALUE)];\n }\n if ((s & TOP_IF_LONG_OR_DOUBLE) != 0\n && (t == LONG || t == DOUBLE)) {\n t = TOP;\n }\n }\n }\n } else {\n t = inputLocals[i];\n }\n if (initializations != null) {\n t = init(cw, t);\n }\n changed |= merge(cw, t, frame.inputLocals, i);\n }\n\n if (edge > 0) {\n for (i = 0; i < nLocal; ++i) {\n t = inputLocals[i];\n changed |= merge(cw, t, frame.inputLocals, i);\n }\n if (frame.inputStack == null) {\n frame.inputStack = new int[1];\n changed = true;\n }\n changed |= merge(cw, edge, frame.inputStack, 0);\n return changed;\n }\n\n int nInputStack = inputStack.length + owner.inputStackTop;\n if (frame.inputStack == null) {\n frame.inputStack = new int[nInputStack + outputStackTop];\n changed = true;\n }\n\n for (i = 0; i < nInputStack; ++i) {\n t = inputStack[i];\n if (initializations != null) {\n t = init(cw, t);\n }\n changed |= merge(cw, t, frame.inputStack, i);\n }\n for (i = 0; i < outputStackTop; ++i) {\n s = outputStack[i];\n dim = s & DIM;\n kind = s & KIND;\n if (kind == BASE) {\n t = s;\n } else {\n if (kind == LOCAL) {\n t = dim + inputLocals[s & VALUE];\n } else {\n t = dim + inputStack[nStack - (s & VALUE)];\n }\n if ((s & TOP_IF_LONG_OR_DOUBLE) != 0\n && (t == LONG || t == DOUBLE)) {\n t = TOP;\n }\n }\n if (initializations != null) {\n t = init(cw, t);\n }\n changed |= merge(cw, t, frame.inputStack, nInputStack + i);\n }\n return changed;\n }\n\n /**\n * Merges the type at the given index in the given type array with the given\n * type. Returns true if the type array has been modified by this\n * operation.\n *\n * @param cw\n * the ClassWriter to which this label belongs.\n * @param t\n * the type with which the type array element must be merged.\n * @param types\n * an array of types.\n * @param index\n * the index of the type that must be merged in 'types'.\n * @return true if the type array has been modified by this\n * operation.\n */\n private static boolean merge(final ClassWriter cw, int t,\n final int[] types, final int index) {\n int u = types[index];\n if (u == t) {\n // if the types are equal, merge(u,t)=u, so there is no change\n return false;\n }\n if ((t & ~DIM) == NULL) {\n if (u == NULL) {\n return false;\n }\n t = NULL;\n }\n if (u == 0) {\n // if types[index] has never been assigned, merge(u,t)=t\n types[index] = t;\n return true;\n }\n int v;\n if ((u & BASE_KIND) == OBJECT || (u & DIM) != 0) {\n // if u is a reference type of any dimension\n if (t == NULL) {\n // if t is the NULL type, merge(u,t)=u, so there is no change\n return false;\n } else if ((t & (DIM | BASE_KIND)) == (u & (DIM | BASE_KIND))) {\n if ((u & BASE_KIND) == OBJECT) {\n // if t is also a reference type, and if u and t have the\n // same dimension merge(u,t) = dim(t) | common parent of the\n // element types of u and t\n v = (t & DIM) | OBJECT\n | cw.getMergedType(t & BASE_VALUE, u & BASE_VALUE);\n } else {\n // if u and t are array types, but not with the same element\n // type, merge(u,t)=java/lang/Object\n v = OBJECT | cw.addType(\"java/lang/Object\");\n }\n } else if ((t & BASE_KIND) == OBJECT || (t & DIM) != 0) {\n // if t is any other reference or array type,\n // merge(u,t)=java/lang/Object\n v = OBJECT | cw.addType(\"java/lang/Object\");\n } else {\n // if t is any other type, merge(u,t)=TOP\n v = TOP;\n }\n } else if (u == NULL) {\n // if u is the NULL type, merge(u,t)=t,\n // or TOP if t is not a reference type\n v = (t & BASE_KIND) == OBJECT || (t & DIM) != 0 ? t : TOP;\n } else {\n // if u is any other type, merge(u,t)=TOP whatever t\n v = TOP;\n }\n if (u != v) {\n types[index] = v;\n return true;\n }\n return false;\n }\n}\n" }, { "path": "src/jvm/clojure/asm/Handle.java", "content": "/***\n * ASM: a very small and fast Java bytecode manipulation framework\n * Copyright (c) 2000-2011 INRIA, France Telecom\n * All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions\n * are met:\n * 1. Redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer.\n * 2. Redistributions in binary form must reproduce the above copyright\n * notice, this list of conditions and the following disclaimer in the\n * documentation and/or other materials provided with the distribution.\n * 3. Neither the name of the copyright holders nor the names of its\n * contributors may be used to endorse or promote products derived from\n * this software without specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\n * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\n * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE\n * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR\n * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF\n * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\n * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN\n * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\n * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF\n * THE POSSIBILITY OF SUCH DAMAGE.\n */\n\npackage clojure.asm;\n\n/**\n * A reference to a field or a method.\n *\n * @author Remi Forax\n * @author Eric Bruneton\n */\npublic final class Handle {\n\n /**\n * The kind of field or method designated by this Handle. Should be\n * {@link Opcodes#H_GETFIELD}, {@link Opcodes#H_GETSTATIC},\n * {@link Opcodes#H_PUTFIELD}, {@link Opcodes#H_PUTSTATIC},\n * {@link Opcodes#H_INVOKEVIRTUAL}, {@link Opcodes#H_INVOKESTATIC},\n * {@link Opcodes#H_INVOKESPECIAL}, {@link Opcodes#H_NEWINVOKESPECIAL} or\n * {@link Opcodes#H_INVOKEINTERFACE}.\n */\n final int tag;\n\n /**\n * The internal name of the field or method designed by this handle.\n */\n final String owner;\n\n /**\n * The name of the field or method designated by this handle.\n */\n final String name;\n\n /**\n * The descriptor of the field or method designated by this handle.\n */\n final String desc;\n\n /**\n * Constructs a new field or method handle.\n *\n * @param tag\n * the kind of field or method designated by this Handle. Must be\n * {@link Opcodes#H_GETFIELD}, {@link Opcodes#H_GETSTATIC},\n * {@link Opcodes#H_PUTFIELD}, {@link Opcodes#H_PUTSTATIC},\n * {@link Opcodes#H_INVOKEVIRTUAL},\n * {@link Opcodes#H_INVOKESTATIC},\n * {@link Opcodes#H_INVOKESPECIAL},\n * {@link Opcodes#H_NEWINVOKESPECIAL} or\n * {@link Opcodes#H_INVOKEINTERFACE}.\n * @param owner\n * the internal name of the field or method designed by this\n * handle.\n * @param name\n * the name of the field or method designated by this handle.\n * @param desc\n * the descriptor of the field or method designated by this\n * handle.\n */\n public Handle(int tag, String owner, String name, String desc) {\n this.tag = tag;\n this.owner = owner;\n this.name = name;\n this.desc = desc;\n }\n\n /**\n * Returns the kind of field or method designated by this handle.\n *\n * @return {@link Opcodes#H_GETFIELD}, {@link Opcodes#H_GETSTATIC},\n * {@link Opcodes#H_PUTFIELD}, {@link Opcodes#H_PUTSTATIC},\n * {@link Opcodes#H_INVOKEVIRTUAL}, {@link Opcodes#H_INVOKESTATIC},\n * {@link Opcodes#H_INVOKESPECIAL},\n * {@link Opcodes#H_NEWINVOKESPECIAL} or\n * {@link Opcodes#H_INVOKEINTERFACE}.\n */\n public int getTag() {\n return tag;\n }\n\n /**\n * Returns the internal name of the field or method designed by this handle.\n *\n * @return the internal name of the field or method designed by this handle.\n */\n public String getOwner() {\n return owner;\n }\n\n /**\n * Returns the name of the field or method designated by this handle.\n *\n * @return the name of the field or method designated by this handle.\n */\n public String getName() {\n return name;\n }\n\n /**\n * Returns the descriptor of the field or method designated by this handle.\n *\n * @return the descriptor of the field or method designated by this handle.\n */\n public String getDesc() {\n return desc;\n }\n\n @Override\n public boolean equals(Object obj) {\n if (obj == this) {\n return true;\n }\n if (!(obj instanceof Handle)) {\n return false;\n }\n Handle h = (Handle) obj;\n return tag == h.tag && owner.equals(h.owner) && name.equals(h.name)\n && desc.equals(h.desc);\n }\n\n @Override\n public int hashCode() {\n return tag + owner.hashCode() * name.hashCode() * desc.hashCode();\n }\n\n /**\n * Returns the textual representation of this handle. The textual\n * representation is:\n *\n * 
\n     * owner '.' name desc ' ' '(' tag ')'\n     *
\n *\n * . As this format is unambiguous, it can be parsed if necessary.\n */\n @Override\n public String toString() {\n return owner + '.' + name + desc + \" (\" + tag + ')';\n }\n}\n" }, { "path": "src/jvm/clojure/asm/Handler.java", "content": "/***\n * ASM: a very small and fast Java bytecode manipulation framework\n * Copyright (c) 2000-2011 INRIA, France Telecom\n * All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions\n * are met:\n * 1. Redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer.\n * 2. Redistributions in binary form must reproduce the above copyright\n * notice, this list of conditions and the following disclaimer in the\n * documentation and/or other materials provided with the distribution.\n * 3. Neither the name of the copyright holders nor the names of its\n * contributors may be used to endorse or promote products derived from\n * this software without specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\n * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\n * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE\n * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR\n * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF\n * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\n * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN\n * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\n * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF\n * THE POSSIBILITY OF SUCH DAMAGE.\n */\npackage clojure.asm;\n\n/**\n * Information about an exception handler block.\n *\n * @author Eric Bruneton\n */\nclass Handler {\n\n /**\n * Beginning of the exception handler's scope (inclusive).\n */\n Label start;\n\n /**\n * End of the exception handler's scope (exclusive).\n */\n Label end;\n\n /**\n * Beginning of the exception handler's code.\n */\n Label handler;\n\n /**\n * Internal name of the type of exceptions handled by this handler, or\n * null to catch any exceptions.\n */\n String desc;\n\n /**\n * Constant pool index of the internal name of the type of exceptions\n * handled by this handler, or 0 to catch any exceptions.\n */\n int type;\n\n /**\n * Next exception handler block info.\n */\n Handler next;\n\n /**\n * Removes the range between start and end from the given exception\n * handlers.\n *\n * @param h\n * an exception handler list.\n * @param start\n * the start of the range to be removed.\n * @param end\n * the end of the range to be removed. Maybe null.\n * @return the exception handler list with the start-end range removed.\n */\n static Handler remove(Handler h, Label start, Label end) {\n if (h == null) {\n return null;\n } else {\n h.next = remove(h.next, start, end);\n }\n int hstart = h.start.position;\n int hend = h.end.position;\n int s = start.position;\n int e = end == null ? Integer.MAX_VALUE : end.position;\n // if [hstart,hend[ and [s,e[ intervals intersect...\n if (s < hend && e > hstart) {\n if (s <= hstart) {\n if (e >= hend) {\n // [hstart,hend[ fully included in [s,e[, h removed\n h = h.next;\n } else {\n // [hstart,hend[ minus [s,e[ = [e,hend[\n h.start = end;\n }\n } else if (e >= hend) {\n // [hstart,hend[ minus [s,e[ = [hstart,s[\n h.end = start;\n } else {\n // [hstart,hend[ minus [s,e[ = [hstart,s[ + [e,hend[\n Handler g = new Handler();\n g.start = end;\n g.end = h.end;\n g.handler = h.handler;\n g.desc = h.desc;\n g.type = h.type;\n g.next = h.next;\n h.end = start;\n h.next = g;\n }\n }\n return h;\n }\n}\n" }, { "path": "src/jvm/clojure/asm/Item.java", "content": "/***\n * ASM: a very small and fast Java bytecode manipulation framework\n * Copyright (c) 2000-2011 INRIA, France Telecom\n * All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions\n * are met:\n * 1. Redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer.\n * 2. Redistributions in binary form must reproduce the above copyright\n * notice, this list of conditions and the following disclaimer in the\n * documentation and/or other materials provided with the distribution.\n * 3. Neither the name of the copyright holders nor the names of its\n * contributors may be used to endorse or promote products derived from\n * this software without specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\n * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\n * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE\n * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR\n * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF\n * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\n * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN\n * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\n * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF\n * THE POSSIBILITY OF SUCH DAMAGE.\n */\npackage clojure.asm;\n\n/**\n * A constant pool item. Constant pool items can be created with the 'newXXX'\n * methods in the {@link ClassWriter} class.\n *\n * @author Eric Bruneton\n */\nfinal class Item {\n\n /**\n * Index of this item in the constant pool.\n */\n int index;\n\n /**\n * Type of this constant pool item. A single class is used to represent all\n * constant pool item types, in order to minimize the bytecode size of this\n * package. The value of this field is one of {@link ClassWriter#INT},\n * {@link ClassWriter#LONG}, {@link ClassWriter#FLOAT},\n * {@link ClassWriter#DOUBLE}, {@link ClassWriter#UTF8},\n * {@link ClassWriter#STR}, {@link ClassWriter#CLASS},\n * {@link ClassWriter#NAME_TYPE}, {@link ClassWriter#FIELD},\n * {@link ClassWriter#METH}, {@link ClassWriter#IMETH},\n * {@link ClassWriter#MTYPE}, {@link ClassWriter#INDY}.\n *\n * MethodHandle constant 9 variations are stored using a range of 9 values\n * from {@link ClassWriter#HANDLE_BASE} + 1 to\n * {@link ClassWriter#HANDLE_BASE} + 9.\n *\n * Special Item types are used for Items that are stored in the ClassWriter\n * {@link ClassWriter#typeTable}, instead of the constant pool, in order to\n * avoid clashes with normal constant pool items in the ClassWriter constant\n * pool's hash table. These special item types are\n * {@link ClassWriter#TYPE_NORMAL}, {@link ClassWriter#TYPE_UNINIT} and\n * {@link ClassWriter#TYPE_MERGED}.\n */\n int type;\n\n /**\n * Value of this item, for an integer item.\n */\n int intVal;\n\n /**\n * Value of this item, for a long item.\n */\n long longVal;\n\n /**\n * First part of the value of this item, for items that do not hold a\n * primitive value.\n */\n String strVal1;\n\n /**\n * Second part of the value of this item, for items that do not hold a\n * primitive value.\n */\n String strVal2;\n\n /**\n * Third part of the value of this item, for items that do not hold a\n * primitive value.\n */\n String strVal3;\n\n /**\n * The hash code value of this constant pool item.\n */\n int hashCode;\n\n /**\n * Link to another constant pool item, used for collision lists in the\n * constant pool's hash table.\n */\n Item next;\n\n /**\n * Constructs an uninitialized {@link Item}.\n */\n Item() {\n }\n\n /**\n * Constructs an uninitialized {@link Item} for constant pool element at\n * given position.\n *\n * @param index\n * index of the item to be constructed.\n */\n Item(final int index) {\n this.index = index;\n }\n\n /**\n * Constructs a copy of the given item.\n *\n * @param index\n * index of the item to be constructed.\n * @param i\n * the item that must be copied into the item to be constructed.\n */\n Item(final int index, final Item i) {\n this.index = index;\n type = i.type;\n intVal = i.intVal;\n longVal = i.longVal;\n strVal1 = i.strVal1;\n strVal2 = i.strVal2;\n strVal3 = i.strVal3;\n hashCode = i.hashCode;\n }\n\n /**\n * Sets this item to an integer item.\n *\n * @param intVal\n * the value of this item.\n */\n void set(final int intVal) {\n this.type = ClassWriter.INT;\n this.intVal = intVal;\n this.hashCode = 0x7FFFFFFF & (type + intVal);\n }\n\n /**\n * Sets this item to a long item.\n *\n * @param longVal\n * the value of this item.\n */\n void set(final long longVal) {\n this.type = ClassWriter.LONG;\n this.longVal = longVal;\n this.hashCode = 0x7FFFFFFF & (type + (int) longVal);\n }\n\n /**\n * Sets this item to a float item.\n *\n * @param floatVal\n * the value of this item.\n */\n void set(final float floatVal) {\n this.type = ClassWriter.FLOAT;\n this.intVal = Float.floatToRawIntBits(floatVal);\n this.hashCode = 0x7FFFFFFF & (type + (int) floatVal);\n }\n\n /**\n * Sets this item to a double item.\n *\n * @param doubleVal\n * the value of this item.\n */\n void set(final double doubleVal) {\n this.type = ClassWriter.DOUBLE;\n this.longVal = Double.doubleToRawLongBits(doubleVal);\n this.hashCode = 0x7FFFFFFF & (type + (int) doubleVal);\n }\n\n /**\n * Sets this item to an item that do not hold a primitive value.\n *\n * @param type\n * the type of this item.\n * @param strVal1\n * first part of the value of this item.\n * @param strVal2\n * second part of the value of this item.\n * @param strVal3\n * third part of the value of this item.\n */\n void set(final int type, final String strVal1, final String strVal2,\n final String strVal3) {\n this.type = type;\n this.strVal1 = strVal1;\n this.strVal2 = strVal2;\n this.strVal3 = strVal3;\n switch (type) {\n case ClassWriter.UTF8:\n case ClassWriter.STR:\n case ClassWriter.CLASS:\n case ClassWriter.MTYPE:\n case ClassWriter.TYPE_NORMAL:\n hashCode = 0x7FFFFFFF & (type + strVal1.hashCode());\n return;\n case ClassWriter.NAME_TYPE: {\n hashCode = 0x7FFFFFFF & (type + strVal1.hashCode()\n * strVal2.hashCode());\n return;\n }\n // ClassWriter.FIELD:\n // ClassWriter.METH:\n // ClassWriter.IMETH:\n // ClassWriter.HANDLE_BASE + 1..9\n default:\n hashCode = 0x7FFFFFFF & (type + strVal1.hashCode()\n * strVal2.hashCode() * strVal3.hashCode());\n }\n }\n\n /**\n * Sets the item to an InvokeDynamic item.\n *\n * @param name\n * invokedynamic's name.\n * @param desc\n * invokedynamic's desc.\n * @param bsmIndex\n * zero based index into the class attribute BootrapMethods.\n */\n void set(String name, String desc, int bsmIndex) {\n this.type = ClassWriter.INDY;\n this.longVal = bsmIndex;\n this.strVal1 = name;\n this.strVal2 = desc;\n this.hashCode = 0x7FFFFFFF & (ClassWriter.INDY + bsmIndex\n * strVal1.hashCode() * strVal2.hashCode());\n }\n\n /**\n * Sets the item to a BootstrapMethod item.\n *\n * @param position\n * position in byte in the class attribute BootrapMethods.\n * @param hashCode\n * hashcode of the item. This hashcode is processed from the\n * hashcode of the bootstrap method and the hashcode of all\n * bootstrap arguments.\n */\n void set(int position, int hashCode) {\n this.type = ClassWriter.BSM;\n this.intVal = position;\n this.hashCode = hashCode;\n }\n\n /**\n * Indicates if the given item is equal to this one. This method assumes\n * that the two items have the same {@link #type}.\n *\n * @param i\n * the item to be compared to this one. Both items must have the\n * same {@link #type}.\n * @return true if the given item if equal to this one,\n * false otherwise.\n */\n boolean isEqualTo(final Item i) {\n switch (type) {\n case ClassWriter.UTF8:\n case ClassWriter.STR:\n case ClassWriter.CLASS:\n case ClassWriter.MTYPE:\n case ClassWriter.TYPE_NORMAL:\n return i.strVal1.equals(strVal1);\n case ClassWriter.TYPE_MERGED:\n case ClassWriter.LONG:\n case ClassWriter.DOUBLE:\n return i.longVal == longVal;\n case ClassWriter.INT:\n case ClassWriter.FLOAT:\n return i.intVal == intVal;\n case ClassWriter.TYPE_UNINIT:\n return i.intVal == intVal && i.strVal1.equals(strVal1);\n case ClassWriter.NAME_TYPE:\n return i.strVal1.equals(strVal1) && i.strVal2.equals(strVal2);\n case ClassWriter.INDY: {\n return i.longVal == longVal && i.strVal1.equals(strVal1)\n && i.strVal2.equals(strVal2);\n }\n // case ClassWriter.FIELD:\n // case ClassWriter.METH:\n // case ClassWriter.IMETH:\n // case ClassWriter.HANDLE_BASE + 1..9\n default:\n return i.strVal1.equals(strVal1) && i.strVal2.equals(strVal2)\n && i.strVal3.equals(strVal3);\n }\n }\n\n}\n" }, { "path": "src/jvm/clojure/asm/Label.java", "content": "/***\n * ASM: a very small and fast Java bytecode manipulation framework\n * Copyright (c) 2000-2011 INRIA, France Telecom\n * All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions\n * are met:\n * 1. Redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer.\n * 2. Redistributions in binary form must reproduce the above copyright\n * notice, this list of conditions and the following disclaimer in the\n * documentation and/or other materials provided with the distribution.\n * 3. Neither the name of the copyright holders nor the names of its\n * contributors may be used to endorse or promote products derived from\n * this software without specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\n * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\n * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE\n * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR\n * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF\n * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\n * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN\n * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\n * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF\n * THE POSSIBILITY OF SUCH DAMAGE.\n */\npackage clojure.asm;\n\n/**\n * A label represents a position in the bytecode of a method. Labels are used\n * for jump, goto, and switch instructions, and for try catch blocks. A label\n * designates the instruction that is just after. Note however that there\n * can be other elements between a label and the instruction it designates (such\n * as other labels, stack map frames, line numbers, etc.).\n *\n * @author Eric Bruneton\n */\npublic class Label {\n\n /**\n * Indicates if this label is only used for debug attributes. Such a label\n * is not the start of a basic block, the target of a jump instruction, or\n * an exception handler. It can be safely ignored in control flow graph\n * analysis algorithms (for optimization purposes).\n */\n static final int DEBUG = 1;\n\n /**\n * Indicates if the position of this label is known.\n */\n static final int RESOLVED = 2;\n\n /**\n * Indicates if this label has been updated, after instruction resizing.\n */\n static final int RESIZED = 4;\n\n /**\n * Indicates if this basic block has been pushed in the basic block stack.\n * See {@link MethodWriter#visitMaxs visitMaxs}.\n */\n static final int PUSHED = 8;\n\n /**\n * Indicates if this label is the target of a jump instruction, or the start\n * of an exception handler.\n */\n static final int TARGET = 16;\n\n /**\n * Indicates if a stack map frame must be stored for this label.\n */\n static final int STORE = 32;\n\n /**\n * Indicates if this label corresponds to a reachable basic block.\n */\n static final int REACHABLE = 64;\n\n /**\n * Indicates if this basic block ends with a JSR instruction.\n */\n static final int JSR = 128;\n\n /**\n * Indicates if this basic block ends with a RET instruction.\n */\n static final int RET = 256;\n\n /**\n * Indicates if this basic block is the start of a subroutine.\n */\n static final int SUBROUTINE = 512;\n\n /**\n * Indicates if this subroutine basic block has been visited by a\n * visitSubroutine(null, ...) call.\n */\n static final int VISITED = 1024;\n\n /**\n * Indicates if this subroutine basic block has been visited by a\n * visitSubroutine(!null, ...) call.\n */\n static final int VISITED2 = 2048;\n\n /**\n * Field used to associate user information to a label. Warning: this field\n * is used by the ASM tree package. In order to use it with the ASM tree\n * package you must override the\n * {@link clojure.asm.tree.MethodNode#getLabelNode} method.\n */\n public Object info;\n\n /**\n * Flags that indicate the status of this label.\n *\n * @see #DEBUG\n * @see #RESOLVED\n * @see #RESIZED\n * @see #PUSHED\n * @see #TARGET\n * @see #STORE\n * @see #REACHABLE\n * @see #JSR\n * @see #RET\n */\n int status;\n\n /**\n * The line number corresponding to this label, if known.\n */\n int line;\n\n /**\n * The position of this label in the code, if known.\n */\n int position;\n\n /**\n * Number of forward references to this label, times two.\n */\n private int referenceCount;\n\n /**\n * Informations about forward references. Each forward reference is\n * described by two consecutive integers in this array: the first one is the\n * position of the first byte of the bytecode instruction that contains the\n * forward reference, while the second is the position of the first byte of\n * the forward reference itself. In fact the sign of the first integer\n * indicates if this reference uses 2 or 4 bytes, and its absolute value\n * gives the position of the bytecode instruction. This array is also used\n * as a bitset to store the subroutines to which a basic block belongs. This\n * information is needed in {@linked MethodWriter#visitMaxs}, after all\n * forward references have been resolved. Hence the same array can be used\n * for both purposes without problems.\n */\n private int[] srcAndRefPositions;\n\n // ------------------------------------------------------------------------\n\n /*\n * Fields for the control flow and data flow graph analysis algorithms (used\n * to compute the maximum stack size or the stack map frames). A control\n * flow graph contains one node per \"basic block\", and one edge per \"jump\"\n * from one basic block to another. Each node (i.e., each basic block) is\n * represented by the Label object that corresponds to the first instruction\n * of this basic block. Each node also stores the list of its successors in\n * the graph, as a linked list of Edge objects.\n *\n * The control flow analysis algorithms used to compute the maximum stack\n * size or the stack map frames are similar and use two steps. The first\n * step, during the visit of each instruction, builds information about the\n * state of the local variables and the operand stack at the end of each\n * basic block, called the \"output frame\", relatively to the frame\n * state at the beginning of the basic block, which is called the \"input\n * frame\", and which is unknown during this step. The second step, in\n * {@link MethodWriter#visitMaxs}, is a fix point algorithm that computes\n * information about the input frame of each basic block, from the input\n * state of the first basic block (known from the method signature), and by\n * the using the previously computed relative output frames.\n *\n * The algorithm used to compute the maximum stack size only computes the\n * relative output and absolute input stack heights, while the algorithm\n * used to compute stack map frames computes relative output frames and\n * absolute input frames.\n */\n\n /**\n * Start of the output stack relatively to the input stack. The exact\n * semantics of this field depends on the algorithm that is used.\n *\n * When only the maximum stack size is computed, this field is the number of\n * elements in the input stack.\n *\n * When the stack map frames are completely computed, this field is the\n * offset of the first output stack element relatively to the top of the\n * input stack. This offset is always negative or null. A null offset means\n * that the output stack must be appended to the input stack. A -n offset\n * means that the first n output stack elements must replace the top n input\n * stack elements, and that the other elements must be appended to the input\n * stack.\n */\n int inputStackTop;\n\n /**\n * Maximum height reached by the output stack, relatively to the top of the\n * input stack. This maximum is always positive or null.\n */\n int outputStackMax;\n\n /**\n * Information about the input and output stack map frames of this basic\n * block. This field is only used when {@link ClassWriter#COMPUTE_FRAMES}\n * option is used.\n */\n Frame frame;\n\n /**\n * The successor of this label, in the order they are visited. This linked\n * list does not include labels used for debug info only. If\n * {@link ClassWriter#COMPUTE_FRAMES} option is used then, in addition, it\n * does not contain successive labels that denote the same bytecode position\n * (in this case only the first label appears in this list).\n */\n Label successor;\n\n /**\n * The successors of this node in the control flow graph. These successors\n * are stored in a linked list of {@link Edge Edge} objects, linked to each\n * other by their {@link Edge#next} field.\n */\n Edge successors;\n\n /**\n * The next basic block in the basic block stack. This stack is used in the\n * main loop of the fix point algorithm used in the second step of the\n * control flow analysis algorithms. It is also used in\n * {@link #visitSubroutine} to avoid using a recursive method.\n *\n * @see MethodWriter#visitMaxs\n */\n Label next;\n\n // ------------------------------------------------------------------------\n // Constructor\n // ------------------------------------------------------------------------\n\n /**\n * Constructs a new label.\n */\n public Label() {\n }\n\n // ------------------------------------------------------------------------\n // Methods to compute offsets and to manage forward references\n // ------------------------------------------------------------------------\n\n /**\n * Returns the offset corresponding to this label. This offset is computed\n * from the start of the method's bytecode. This method is intended for\n * {@link Attribute} sub classes, and is normally not needed by class\n * generators or adapters.\n *\n * @return the offset corresponding to this label.\n * @throws IllegalStateException\n * if this label is not resolved yet.\n */\n public int getOffset() {\n if ((status & RESOLVED) == 0) {\n throw new IllegalStateException(\n \"Label offset position has not been resolved yet\");\n }\n return position;\n }\n\n /**\n * Puts a reference to this label in the bytecode of a method. If the\n * position of the label is known, the offset is computed and written\n * directly. Otherwise, a null offset is written and a new forward reference\n * is declared for this label.\n *\n * @param owner\n * the code writer that calls this method.\n * @param out\n * the bytecode of the method.\n * @param source\n * the position of first byte of the bytecode instruction that\n * contains this label.\n * @param wideOffset\n * true if the reference must be stored in 4 bytes, or\n * false if it must be stored with 2 bytes.\n * @throws IllegalArgumentException\n * if this label has not been created by the given code writer.\n */\n void put(final MethodWriter owner, final ByteVector out, final int source,\n final boolean wideOffset) {\n if ((status & RESOLVED) == 0) {\n if (wideOffset) {\n addReference(-1 - source, out.length);\n out.putInt(-1);\n } else {\n addReference(source, out.length);\n out.putShort(-1);\n }\n } else {\n if (wideOffset) {\n out.putInt(position - source);\n } else {\n out.putShort(position - source);\n }\n }\n }\n\n /**\n * Adds a forward reference to this label. This method must be called only\n * for a true forward reference, i.e. only if this label is not resolved\n * yet. For backward references, the offset of the reference can be, and\n * must be, computed and stored directly.\n *\n * @param sourcePosition\n * the position of the referencing instruction. This position\n * will be used to compute the offset of this forward reference.\n * @param referencePosition\n * the position where the offset for this forward reference must\n * be stored.\n */\n private void addReference(final int sourcePosition,\n final int referencePosition) {\n if (srcAndRefPositions == null) {\n srcAndRefPositions = new int[6];\n }\n if (referenceCount >= srcAndRefPositions.length) {\n int[] a = new int[srcAndRefPositions.length + 6];\n System.arraycopy(srcAndRefPositions, 0, a, 0,\n srcAndRefPositions.length);\n srcAndRefPositions = a;\n }\n srcAndRefPositions[referenceCount++] = sourcePosition;\n srcAndRefPositions[referenceCount++] = referencePosition;\n }\n\n /**\n * Resolves all forward references to this label. This method must be called\n * when this label is added to the bytecode of the method, i.e. when its\n * position becomes known. This method fills in the blanks that where left\n * in the bytecode by each forward reference previously added to this label.\n *\n * @param owner\n * the code writer that calls this method.\n * @param position\n * the position of this label in the bytecode.\n * @param data\n * the bytecode of the method.\n * @return true if a blank that was left for this label was to\n * small to store the offset. In such a case the corresponding jump\n * instruction is replaced with a pseudo instruction (using unused\n * opcodes) using an unsigned two bytes offset. These pseudo\n * instructions will need to be replaced with true instructions with\n * wider offsets (4 bytes instead of 2). This is done in\n * {@link MethodWriter#resizeInstructions}.\n * @throws IllegalArgumentException\n * if this label has already been resolved, or if it has not\n * been created by the given code writer.\n */\n boolean resolve(final MethodWriter owner, final int position,\n final byte[] data) {\n boolean needUpdate = false;\n this.status |= RESOLVED;\n this.position = position;\n int i = 0;\n while (i < referenceCount) {\n int source = srcAndRefPositions[i++];\n int reference = srcAndRefPositions[i++];\n int offset;\n if (source >= 0) {\n offset = position - source;\n if (offset < Short.MIN_VALUE || offset > Short.MAX_VALUE) {\n /*\n * changes the opcode of the jump instruction, in order to\n * be able to find it later (see resizeInstructions in\n * MethodWriter). These temporary opcodes are similar to\n * jump instruction opcodes, except that the 2 bytes offset\n * is unsigned (and can therefore represent values from 0 to\n * 65535, which is sufficient since the size of a method is\n * limited to 65535 bytes).\n */\n int opcode = data[reference - 1] & 0xFF;\n if (opcode <= Opcodes.JSR) {\n // changes IFEQ ... JSR to opcodes 202 to 217\n data[reference - 1] = (byte) (opcode + 49);\n } else {\n // changes IFNULL and IFNONNULL to opcodes 218 and 219\n data[reference - 1] = (byte) (opcode + 20);\n }\n needUpdate = true;\n }\n data[reference++] = (byte) (offset >>> 8);\n data[reference] = (byte) offset;\n } else {\n offset = position + source + 1;\n data[reference++] = (byte) (offset >>> 24);\n data[reference++] = (byte) (offset >>> 16);\n data[reference++] = (byte) (offset >>> 8);\n data[reference] = (byte) offset;\n }\n }\n return needUpdate;\n }\n\n /**\n * Returns the first label of the series to which this label belongs. For an\n * isolated label or for the first label in a series of successive labels,\n * this method returns the label itself. For other labels it returns the\n * first label of the series.\n *\n * @return the first label of the series to which this label belongs.\n */\n Label getFirst() {\n return !ClassReader.FRAMES || frame == null ? this : frame.owner;\n }\n\n // ------------------------------------------------------------------------\n // Methods related to subroutines\n // ------------------------------------------------------------------------\n\n /**\n * Returns true is this basic block belongs to the given subroutine.\n *\n * @param id\n * a subroutine id.\n * @return true is this basic block belongs to the given subroutine.\n */\n boolean inSubroutine(final long id) {\n if ((status & Label.VISITED) != 0) {\n return (srcAndRefPositions[(int) (id >>> 32)] & (int) id) != 0;\n }\n return false;\n }\n\n /**\n * Returns true if this basic block and the given one belong to a common\n * subroutine.\n *\n * @param block\n * another basic block.\n * @return true if this basic block and the given one belong to a common\n * subroutine.\n */\n boolean inSameSubroutine(final Label block) {\n if ((status & VISITED) == 0 || (block.status & VISITED) == 0) {\n return false;\n }\n for (int i = 0; i < srcAndRefPositions.length; ++i) {\n if ((srcAndRefPositions[i] & block.srcAndRefPositions[i]) != 0) {\n return true;\n }\n }\n return false;\n }\n\n /**\n * Marks this basic block as belonging to the given subroutine.\n *\n * @param id\n * a subroutine id.\n * @param nbSubroutines\n * the total number of subroutines in the method.\n */\n void addToSubroutine(final long id, final int nbSubroutines) {\n if ((status & VISITED) == 0) {\n status |= VISITED;\n srcAndRefPositions = new int[(nbSubroutines - 1) / 32 + 1];\n }\n srcAndRefPositions[(int) (id >>> 32)] |= (int) id;\n }\n\n /**\n * Finds the basic blocks that belong to a given subroutine, and marks these\n * blocks as belonging to this subroutine. This method follows the control\n * flow graph to find all the blocks that are reachable from the current\n * block WITHOUT following any JSR target.\n *\n * @param JSR\n * a JSR block that jumps to this subroutine. If this JSR is not\n * null it is added to the successor of the RET blocks found in\n * the subroutine.\n * @param id\n * the id of this subroutine.\n * @param nbSubroutines\n * the total number of subroutines in the method.\n */\n void visitSubroutine(final Label JSR, final long id, final int nbSubroutines) {\n // user managed stack of labels, to avoid using a recursive method\n // (recursivity can lead to stack overflow with very large methods)\n Label stack = this;\n while (stack != null) {\n // removes a label l from the stack\n Label l = stack;\n stack = l.next;\n l.next = null;\n\n if (JSR != null) {\n if ((l.status & VISITED2) != 0) {\n continue;\n }\n l.status |= VISITED2;\n // adds JSR to the successors of l, if it is a RET block\n if ((l.status & RET) != 0) {\n if (!l.inSameSubroutine(JSR)) {\n Edge e = new Edge();\n e.info = l.inputStackTop;\n e.successor = JSR.successors.successor;\n e.next = l.successors;\n l.successors = e;\n }\n }\n } else {\n // if the l block already belongs to subroutine 'id', continue\n if (l.inSubroutine(id)) {\n continue;\n }\n // marks the l block as belonging to subroutine 'id'\n l.addToSubroutine(id, nbSubroutines);\n }\n // pushes each successor of l on the stack, except JSR targets\n Edge e = l.successors;\n while (e != null) {\n // if the l block is a JSR block, then 'l.successors.next' leads\n // to the JSR target (see {@link #visitJumpInsn}) and must\n // therefore not be followed\n if ((l.status & Label.JSR) == 0 || e != l.successors.next) {\n // pushes e.successor on the stack if it not already added\n if (e.successor.next == null) {\n e.successor.next = stack;\n stack = e.successor;\n }\n }\n e = e.next;\n }\n }\n }\n\n // ------------------------------------------------------------------------\n // Overriden Object methods\n // ------------------------------------------------------------------------\n\n /**\n * Returns a string representation of this label.\n *\n * @return a string representation of this label.\n */\n @Override\n public String toString() {\n return \"L\" + System.identityHashCode(this);\n }\n}\n" }, { "path": "src/jvm/clojure/asm/MethodVisitor.java", "content": "/***\n * ASM: a very small and fast Java bytecode manipulation framework\n * Copyright (c) 2000-2011 INRIA, France Telecom\n * All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions\n * are met:\n * 1. Redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer.\n * 2. Redistributions in binary form must reproduce the above copyright\n * notice, this list of conditions and the following disclaimer in the\n * documentation and/or other materials provided with the distribution.\n * 3. Neither the name of the copyright holders nor the names of its\n * contributors may be used to endorse or promote products derived from\n * this software without specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\n * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\n * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE\n * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR\n * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF\n * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\n * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN\n * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\n * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF\n * THE POSSIBILITY OF SUCH DAMAGE.\n */\npackage clojure.asm;\n\n/**\n * A visitor to visit a Java method. The methods of this class must be called in\n * the following order: [ visitAnnotationDefault ] (\n * visitAnnotation | visitParameterAnnotation |\n * visitAttribute )* [ visitCode ( visitFrame |\n * visitXInsn | visitLabel |\n * visitTryCatchBlock | visitLocalVariable |\n * visitLineNumber )* visitMaxs ] visitEnd. In\n * addition, the visitXInsn and visitLabel methods\n * must be called in the sequential order of the bytecode instructions of the\n * visited code, visitTryCatchBlock must be called before the\n * labels passed as arguments have been visited, and the\n * visitLocalVariable and visitLineNumber methods must be\n * called after the labels passed as arguments have been visited.\n *\n * @author Eric Bruneton\n */\npublic abstract class MethodVisitor {\n\n /**\n * The ASM API version implemented by this visitor. The value of this field\n * must be one of {@link Opcodes#ASM4}.\n */\n protected final int api;\n\n /**\n * The method visitor to which this visitor must delegate method calls. May\n * be null.\n */\n protected MethodVisitor mv;\n\n /**\n * Constructs a new {@link MethodVisitor}.\n *\n * @param api\n * the ASM API version implemented by this visitor. Must be one\n * of {@link Opcodes#ASM4}.\n */\n public MethodVisitor(final int api) {\n this(api, null);\n }\n\n /**\n * Constructs a new {@link MethodVisitor}.\n *\n * @param api\n * the ASM API version implemented by this visitor. Must be one\n * of {@link Opcodes#ASM4}.\n * @param mv\n * the method visitor to which this visitor must delegate method\n * calls. May be null.\n */\n public MethodVisitor(final int api, final MethodVisitor mv) {\n if (api != Opcodes.ASM4) {\n throw new IllegalArgumentException();\n }\n this.api = api;\n this.mv = mv;\n }\n\n // -------------------------------------------------------------------------\n // Annotations and non standard attributes\n // -------------------------------------------------------------------------\n\n /**\n * Visits the default value of this annotation interface method.\n *\n * @return a visitor to the visit the actual default value of this\n * annotation interface method, or null if this visitor is\n * not interested in visiting this default value. The 'name'\n * parameters passed to the methods of this annotation visitor are\n * ignored. Moreover, exacly one visit method must be called on this\n * annotation visitor, followed by visitEnd.\n */\n public AnnotationVisitor visitAnnotationDefault() {\n if (mv != null) {\n return mv.visitAnnotationDefault();\n }\n return null;\n }\n\n /**\n * Visits an annotation of this method.\n *\n * @param desc\n * the class descriptor of the annotation class.\n * @param visible\n * true if the annotation is visible at runtime.\n * @return a visitor to visit the annotation values, or null if\n * this visitor is not interested in visiting this annotation.\n */\n public AnnotationVisitor visitAnnotation(String desc, boolean visible) {\n if (mv != null) {\n return mv.visitAnnotation(desc, visible);\n }\n return null;\n }\n\n /**\n * Visits an annotation of a parameter this method.\n *\n * @param parameter\n * the parameter index.\n * @param desc\n * the class descriptor of the annotation class.\n * @param visible\n * true if the annotation is visible at runtime.\n * @return a visitor to visit the annotation values, or null if\n * this visitor is not interested in visiting this annotation.\n */\n public AnnotationVisitor visitParameterAnnotation(int parameter,\n String desc, boolean visible) {\n if (mv != null) {\n return mv.visitParameterAnnotation(parameter, desc, visible);\n }\n return null;\n }\n\n /**\n * Visits a non standard attribute of this method.\n *\n * @param attr\n * an attribute.\n */\n public void visitAttribute(Attribute attr) {\n if (mv != null) {\n mv.visitAttribute(attr);\n }\n }\n\n /**\n * Starts the visit of the method's code, if any (i.e. non abstract method).\n */\n public void visitCode() {\n if (mv != null) {\n mv.visitCode();\n }\n }\n\n /**\n * Visits the current state of the local variables and operand stack\n * elements. This method must(*) be called just before any\n * instruction i that follows an unconditional branch instruction\n * such as GOTO or THROW, that is the target of a jump instruction, or that\n * starts an exception handler block. The visited types must describe the\n * values of the local variables and of the operand stack elements just\n * before i is executed.
\n *
\n * (*) this is mandatory only for classes whose version is greater than or\n * equal to {@link Opcodes#V1_6 V1_6}.
\n *
\n * The frames of a method must be given either in expanded form, or in\n * compressed form (all frames must use the same format, i.e. you must not\n * mix expanded and compressed frames within a single method):\n *
    \n *
  • In expanded form, all frames must have the F_NEW type.
    • \n *
  • In compressed form, frames are basically \"deltas\" from the state of\n * the previous frame:\n *
      \n *
    • {@link Opcodes#F_SAME} representing frame with exactly the same\n * locals as the previous frame and with the empty stack.
      • \n *
    • {@link Opcodes#F_SAME1} representing frame with exactly the same\n * locals as the previous frame and with single value on the stack (\n * nStack is 1 and stack[0] contains value for the\n * type of the stack item).
      • \n *
    • {@link Opcodes#F_APPEND} representing frame with current locals are\n * the same as the locals in the previous frame, except that additional\n * locals are defined (nLocal is 1, 2 or 3 and\n * local elements contains values representing added types).
      • \n *
    • {@link Opcodes#F_CHOP} representing frame with current locals are the\n * same as the locals in the previous frame, except that the last 1-3 locals\n * are absent and with the empty stack (nLocals is 1, 2 or 3).
      • \n *
    • {@link Opcodes#F_FULL} representing complete frame data.
      • \n *
    \n *

\n * In both cases the first frame, corresponding to the method's parameters\n * and access flags, is implicit and must not be visited. Also, it is\n * illegal to visit two or more frames for the same code location (i.e., at\n * least one instruction must be visited between two calls to visitFrame).\n *\n * @param type\n * the type of this stack map frame. Must be\n * {@link Opcodes#F_NEW} for expanded frames, or\n * {@link Opcodes#F_FULL}, {@link Opcodes#F_APPEND},\n * {@link Opcodes#F_CHOP}, {@link Opcodes#F_SAME} or\n * {@link Opcodes#F_APPEND}, {@link Opcodes#F_SAME1} for\n * compressed frames.\n * @param nLocal\n * the number of local variables in the visited frame.\n * @param local\n * the local variable types in this frame. This array must not be\n * modified. Primitive types are represented by\n * {@link Opcodes#TOP}, {@link Opcodes#INTEGER},\n * {@link Opcodes#FLOAT}, {@link Opcodes#LONG},\n * {@link Opcodes#DOUBLE},{@link Opcodes#NULL} or\n * {@link Opcodes#UNINITIALIZED_THIS} (long and double are\n * represented by a single element). Reference types are\n * represented by String objects (representing internal names),\n * and uninitialized types by Label objects (this label\n * designates the NEW instruction that created this uninitialized\n * value).\n * @param nStack\n * the number of operand stack elements in the visited frame.\n * @param stack\n * the operand stack types in this frame. This array must not be\n * modified. Its content has the same format as the \"local\"\n * array.\n * @throws IllegalStateException\n * if a frame is visited just after another one, without any\n * instruction between the two (unless this frame is a\n * Opcodes#F_SAME frame, in which case it is silently ignored).\n */\n public void visitFrame(int type, int nLocal, Object[] local, int nStack,\n Object[] stack) {\n if (mv != null) {\n mv.visitFrame(type, nLocal, local, nStack, stack);\n }\n }\n\n // -------------------------------------------------------------------------\n // Normal instructions\n // -------------------------------------------------------------------------\n\n /**\n * Visits a zero operand instruction.\n *\n * @param opcode\n * the opcode of the instruction to be visited. This opcode is\n * either NOP, ACONST_NULL, ICONST_M1, ICONST_0, ICONST_1,\n * ICONST_2, ICONST_3, ICONST_4, ICONST_5, LCONST_0, LCONST_1,\n * FCONST_0, FCONST_1, FCONST_2, DCONST_0, DCONST_1, IALOAD,\n * LALOAD, FALOAD, DALOAD, AALOAD, BALOAD, CALOAD, SALOAD,\n * IASTORE, LASTORE, FASTORE, DASTORE, AASTORE, BASTORE, CASTORE,\n * SASTORE, POP, POP2, DUP, DUP_X1, DUP_X2, DUP2, DUP2_X1,\n * DUP2_X2, SWAP, IADD, LADD, FADD, DADD, ISUB, LSUB, FSUB, DSUB,\n * IMUL, LMUL, FMUL, DMUL, IDIV, LDIV, FDIV, DDIV, IREM, LREM,\n * FREM, DREM, INEG, LNEG, FNEG, DNEG, ISHL, LSHL, ISHR, LSHR,\n * IUSHR, LUSHR, IAND, LAND, IOR, LOR, IXOR, LXOR, I2L, I2F, I2D,\n * L2I, L2F, L2D, F2I, F2L, F2D, D2I, D2L, D2F, I2B, I2C, I2S,\n * LCMP, FCMPL, FCMPG, DCMPL, DCMPG, IRETURN, LRETURN, FRETURN,\n * DRETURN, ARETURN, RETURN, ARRAYLENGTH, ATHROW, MONITORENTER,\n * or MONITOREXIT.\n */\n public void visitInsn(int opcode) {\n if (mv != null) {\n mv.visitInsn(opcode);\n }\n }\n\n /**\n * Visits an instruction with a single int operand.\n *\n * @param opcode\n * the opcode of the instruction to be visited. This opcode is\n * either BIPUSH, SIPUSH or NEWARRAY.\n * @param operand\n * the operand of the instruction to be visited.
\n * When opcode is BIPUSH, operand value should be between\n * Byte.MIN_VALUE and Byte.MAX_VALUE.
\n * When opcode is SIPUSH, operand value should be between\n * Short.MIN_VALUE and Short.MAX_VALUE.
\n * When opcode is NEWARRAY, operand value should be one of\n * {@link Opcodes#T_BOOLEAN}, {@link Opcodes#T_CHAR},\n * {@link Opcodes#T_FLOAT}, {@link Opcodes#T_DOUBLE},\n * {@link Opcodes#T_BYTE}, {@link Opcodes#T_SHORT},\n * {@link Opcodes#T_INT} or {@link Opcodes#T_LONG}.\n */\n public void visitIntInsn(int opcode, int operand) {\n if (mv != null) {\n mv.visitIntInsn(opcode, operand);\n }\n }\n\n /**\n * Visits a local variable instruction. A local variable instruction is an\n * instruction that loads or stores the value of a local variable.\n *\n * @param opcode\n * the opcode of the local variable instruction to be visited.\n * This opcode is either ILOAD, LLOAD, FLOAD, DLOAD, ALOAD,\n * ISTORE, LSTORE, FSTORE, DSTORE, ASTORE or RET.\n * @param var\n * the operand of the instruction to be visited. This operand is\n * the index of a local variable.\n */\n public void visitVarInsn(int opcode, int var) {\n if (mv != null) {\n mv.visitVarInsn(opcode, var);\n }\n }\n\n /**\n * Visits a type instruction. A type instruction is an instruction that\n * takes the internal name of a class as parameter.\n *\n * @param opcode\n * the opcode of the type instruction to be visited. This opcode\n * is either NEW, ANEWARRAY, CHECKCAST or INSTANCEOF.\n * @param type\n * the operand of the instruction to be visited. This operand\n * must be the internal name of an object or array class (see\n * {@link Type#getInternalName() getInternalName}).\n */\n public void visitTypeInsn(int opcode, String type) {\n if (mv != null) {\n mv.visitTypeInsn(opcode, type);\n }\n }\n\n /**\n * Visits a field instruction. A field instruction is an instruction that\n * loads or stores the value of a field of an object.\n *\n * @param opcode\n * the opcode of the type instruction to be visited. This opcode\n * is either GETSTATIC, PUTSTATIC, GETFIELD or PUTFIELD.\n * @param owner\n * the internal name of the field's owner class (see\n * {@link Type#getInternalName() getInternalName}).\n * @param name\n * the field's name.\n * @param desc\n * the field's descriptor (see {@link Type Type}).\n */\n public void visitFieldInsn(int opcode, String owner, String name,\n String desc) {\n if (mv != null) {\n mv.visitFieldInsn(opcode, owner, name, desc);\n }\n }\n\n /**\n * Visits a method instruction. A method instruction is an instruction that\n * invokes a method.\n *\n * @param opcode\n * the opcode of the type instruction to be visited. This opcode\n * is either INVOKEVIRTUAL, INVOKESPECIAL, INVOKESTATIC or\n * INVOKEINTERFACE.\n * @param owner\n * the internal name of the method's owner class (see\n * {@link Type#getInternalName() getInternalName}).\n * @param name\n * the method's name.\n * @param desc\n * the method's descriptor (see {@link Type Type}).\n */\n public void visitMethodInsn(int opcode, String owner, String name,\n String desc) {\n if (mv != null) {\n mv.visitMethodInsn(opcode, owner, name, desc);\n }\n }\n\n /**\n * Visits an invokedynamic instruction.\n *\n * @param name\n * the method's name.\n * @param desc\n * the method's descriptor (see {@link Type Type}).\n * @param bsm\n * the bootstrap method.\n * @param bsmArgs\n * the bootstrap method constant arguments. Each argument must be\n * an {@link Integer}, {@link Float}, {@link Long},\n * {@link Double}, {@link String}, {@link Type} or {@link Handle}\n * value. This method is allowed to modify the content of the\n * array so a caller should expect that this array may change.\n */\n public void visitInvokeDynamicInsn(String name, String desc, Handle bsm,\n Object... bsmArgs) {\n if (mv != null) {\n mv.visitInvokeDynamicInsn(name, desc, bsm, bsmArgs);\n }\n }\n\n /**\n * Visits a jump instruction. A jump instruction is an instruction that may\n * jump to another instruction.\n *\n * @param opcode\n * the opcode of the type instruction to be visited. This opcode\n * is either IFEQ, IFNE, IFLT, IFGE, IFGT, IFLE, IF_ICMPEQ,\n * IF_ICMPNE, IF_ICMPLT, IF_ICMPGE, IF_ICMPGT, IF_ICMPLE,\n * IF_ACMPEQ, IF_ACMPNE, GOTO, JSR, IFNULL or IFNONNULL.\n * @param label\n * the operand of the instruction to be visited. This operand is\n * a label that designates the instruction to which the jump\n * instruction may jump.\n */\n public void visitJumpInsn(int opcode, Label label) {\n if (mv != null) {\n mv.visitJumpInsn(opcode, label);\n }\n }\n\n /**\n * Visits a label. A label designates the instruction that will be visited\n * just after it.\n *\n * @param label\n * a {@link Label Label} object.\n */\n public void visitLabel(Label label) {\n if (mv != null) {\n mv.visitLabel(label);\n }\n }\n\n // -------------------------------------------------------------------------\n // Special instructions\n // -------------------------------------------------------------------------\n\n /**\n * Visits a LDC instruction. Note that new constant types may be added in\n * future versions of the Java Virtual Machine. To easily detect new\n * constant types, implementations of this method should check for\n * unexpected constant types, like this:\n *\n * 
\n     * if (cst instanceof Integer) {\n     *     // ...\n     * } else if (cst instanceof Float) {\n     *     // ...\n     * } else if (cst instanceof Long) {\n     *     // ...\n     * } else if (cst instanceof Double) {\n     *     // ...\n     * } else if (cst instanceof String) {\n     *     // ...\n     * } else if (cst instanceof Type) {\n     *     int sort = ((Type) cst).getSort();\n     *     if (sort == Type.OBJECT) {\n     *         // ...\n     *     } else if (sort == Type.ARRAY) {\n     *         // ...\n     *     } else if (sort == Type.METHOD) {\n     *         // ...\n     *     } else {\n     *         // throw an exception\n     *     }\n     * } else if (cst instanceof Handle) {\n     *     // ...\n     * } else {\n     *     // throw an exception\n     * }\n     *
\n *\n * @param cst\n * the constant to be loaded on the stack. This parameter must be\n * a non null {@link Integer}, a {@link Float}, a {@link Long}, a\n * {@link Double}, a {@link String}, a {@link Type} of OBJECT or\n * ARRAY sort for .class constants, for classes whose\n * version is 49.0, a {@link Type} of METHOD sort or a\n * {@link Handle} for MethodType and MethodHandle constants, for\n * classes whose version is 51.0.\n */\n public void visitLdcInsn(Object cst) {\n if (mv != null) {\n mv.visitLdcInsn(cst);\n }\n }\n\n /**\n * Visits an IINC instruction.\n *\n * @param var\n * index of the local variable to be incremented.\n * @param increment\n * amount to increment the local variable by.\n */\n public void visitIincInsn(int var, int increment) {\n if (mv != null) {\n mv.visitIincInsn(var, increment);\n }\n }\n\n /**\n * Visits a TABLESWITCH instruction.\n *\n * @param min\n * the minimum key value.\n * @param max\n * the maximum key value.\n * @param dflt\n * beginning of the default handler block.\n * @param labels\n * beginnings of the handler blocks. labels[i] is the\n * beginning of the handler block for the min + i key.\n */\n public void visitTableSwitchInsn(int min, int max, Label dflt,\n Label... labels) {\n if (mv != null) {\n mv.visitTableSwitchInsn(min, max, dflt, labels);\n }\n }\n\n /**\n * Visits a LOOKUPSWITCH instruction.\n *\n * @param dflt\n * beginning of the default handler block.\n * @param keys\n * the values of the keys.\n * @param labels\n * beginnings of the handler blocks. labels[i] is the\n * beginning of the handler block for the keys[i] key.\n */\n public void visitLookupSwitchInsn(Label dflt, int[] keys, Label[] labels) {\n if (mv != null) {\n mv.visitLookupSwitchInsn(dflt, keys, labels);\n }\n }\n\n /**\n * Visits a MULTIANEWARRAY instruction.\n *\n * @param desc\n * an array type descriptor (see {@link Type Type}).\n * @param dims\n * number of dimensions of the array to allocate.\n */\n public void visitMultiANewArrayInsn(String desc, int dims) {\n if (mv != null) {\n mv.visitMultiANewArrayInsn(desc, dims);\n }\n }\n\n // -------------------------------------------------------------------------\n // Exceptions table entries, debug information, max stack and max locals\n // -------------------------------------------------------------------------\n\n /**\n * Visits a try catch block.\n *\n * @param start\n * beginning of the exception handler's scope (inclusive).\n * @param end\n * end of the exception handler's scope (exclusive).\n * @param handler\n * beginning of the exception handler's code.\n * @param type\n * internal name of the type of exceptions handled by the\n * handler, or null to catch any exceptions (for\n * \"finally\" blocks).\n * @throws IllegalArgumentException\n * if one of the labels has already been visited by this visitor\n * (by the {@link #visitLabel visitLabel} method).\n */\n public void visitTryCatchBlock(Label start, Label end, Label handler,\n String type) {\n if (mv != null) {\n mv.visitTryCatchBlock(start, end, handler, type);\n }\n }\n\n /**\n * Visits a local variable declaration.\n *\n * @param name\n * the name of a local variable.\n * @param desc\n * the type descriptor of this local variable.\n * @param signature\n * the type signature of this local variable. May be\n * null if the local variable type does not use generic\n * types.\n * @param start\n * the first instruction corresponding to the scope of this local\n * variable (inclusive).\n * @param end\n * the last instruction corresponding to the scope of this local\n * variable (exclusive).\n * @param index\n * the local variable's index.\n * @throws IllegalArgumentException\n * if one of the labels has not already been visited by this\n * visitor (by the {@link #visitLabel visitLabel} method).\n */\n public void visitLocalVariable(String name, String desc, String signature,\n Label start, Label end, int index) {\n if (mv != null) {\n mv.visitLocalVariable(name, desc, signature, start, end, index);\n }\n }\n\n /**\n * Visits a line number declaration.\n *\n * @param line\n * a line number. This number refers to the source file from\n * which the class was compiled.\n * @param start\n * the first instruction corresponding to this line number.\n * @throws IllegalArgumentException\n * if start has not already been visited by this\n * visitor (by the {@link #visitLabel visitLabel} method).\n */\n public void visitLineNumber(int line, Label start) {\n if (mv != null) {\n mv.visitLineNumber(line, start);\n }\n }\n\n /**\n * Visits the maximum stack size and the maximum number of local variables\n * of the method.\n *\n * @param maxStack\n * maximum stack size of the method.\n * @param maxLocals\n * maximum number of local variables for the method.\n */\n public void visitMaxs(int maxStack, int maxLocals) {\n if (mv != null) {\n mv.visitMaxs(maxStack, maxLocals);\n }\n }\n\n /**\n * Visits the end of the method. This method, which is the last one to be\n * called, is used to inform the visitor that all the annotations and\n * attributes of the method have been visited.\n */\n public void visitEnd() {\n if (mv != null) {\n mv.visitEnd();\n }\n }\n}\n" }, { "path": "src/jvm/clojure/asm/MethodWriter.java", "content": "/***\n * ASM: a very small and fast Java bytecode manipulation framework\n * Copyright (c) 2000-2011 INRIA, France Telecom\n * All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions\n * are met:\n * 1. Redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer.\n * 2. Redistributions in binary form must reproduce the above copyright\n * notice, this list of conditions and the following disclaimer in the\n * documentation and/or other materials provided with the distribution.\n * 3. Neither the name of the copyright holders nor the names of its\n * contributors may be used to endorse or promote products derived from\n * this software without specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\n * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\n * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE\n * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR\n * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF\n * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\n * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN\n * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\n * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF\n * THE POSSIBILITY OF SUCH DAMAGE.\n */\npackage clojure.asm;\n\n/**\n * A {@link MethodVisitor} that generates methods in bytecode form. Each visit\n * method of this class appends the bytecode corresponding to the visited\n * instruction to a byte vector, in the order these methods are called.\n *\n * @author Eric Bruneton\n * @author Eugene Kuleshov\n */\nclass MethodWriter extends MethodVisitor {\n\n /**\n * Pseudo access flag used to denote constructors.\n */\n static final int ACC_CONSTRUCTOR = 0x80000;\n\n /**\n * Frame has exactly the same locals as the previous stack map frame and\n * number of stack items is zero.\n */\n static final int SAME_FRAME = 0; // to 63 (0-3f)\n\n /**\n * Frame has exactly the same locals as the previous stack map frame and\n * number of stack items is 1\n */\n static final int SAME_LOCALS_1_STACK_ITEM_FRAME = 64; // to 127 (40-7f)\n\n /**\n * Reserved for future use\n */\n static final int RESERVED = 128;\n\n /**\n * Frame has exactly the same locals as the previous stack map frame and\n * number of stack items is 1. Offset is bigger then 63;\n */\n static final int SAME_LOCALS_1_STACK_ITEM_FRAME_EXTENDED = 247; // f7\n\n /**\n * Frame where current locals are the same as the locals in the previous\n * frame, except that the k last locals are absent. The value of k is given\n * by the formula 251-frame_type.\n */\n static final int CHOP_FRAME = 248; // to 250 (f8-fA)\n\n /**\n * Frame has exactly the same locals as the previous stack map frame and\n * number of stack items is zero. Offset is bigger then 63;\n */\n static final int SAME_FRAME_EXTENDED = 251; // fb\n\n /**\n * Frame where current locals are the same as the locals in the previous\n * frame, except that k additional locals are defined. The value of k is\n * given by the formula frame_type-251.\n */\n static final int APPEND_FRAME = 252; // to 254 // fc-fe\n\n /**\n * Full frame\n */\n static final int FULL_FRAME = 255; // ff\n\n /**\n * Indicates that the stack map frames must be recomputed from scratch. In\n * this case the maximum stack size and number of local variables is also\n * recomputed from scratch.\n *\n * @see #compute\n */\n private static final int FRAMES = 0;\n\n /**\n * Indicates that the maximum stack size and number of local variables must\n * be automatically computed.\n *\n * @see #compute\n */\n private static final int MAXS = 1;\n\n /**\n * Indicates that nothing must be automatically computed.\n *\n * @see #compute\n */\n private static final int NOTHING = 2;\n\n /**\n * The class writer to which this method must be added.\n */\n final ClassWriter cw;\n\n /**\n * Access flags of this method.\n */\n private int access;\n\n /**\n * The index of the constant pool item that contains the name of this\n * method.\n */\n private final int name;\n\n /**\n * The index of the constant pool item that contains the descriptor of this\n * method.\n */\n private final int desc;\n\n /**\n * The descriptor of this method.\n */\n private final String descriptor;\n\n /**\n * The signature of this method.\n */\n String signature;\n\n /**\n * If not zero, indicates that the code of this method must be copied from\n * the ClassReader associated to this writer in cw.cr. More\n * precisely, this field gives the index of the first byte to copied from\n * cw.cr.b.\n */\n int classReaderOffset;\n\n /**\n * If not zero, indicates that the code of this method must be copied from\n * the ClassReader associated to this writer in cw.cr. More\n * precisely, this field gives the number of bytes to copied from\n * cw.cr.b.\n */\n int classReaderLength;\n\n /**\n * Number of exceptions that can be thrown by this method.\n */\n int exceptionCount;\n\n /**\n * The exceptions that can be thrown by this method. More precisely, this\n * array contains the indexes of the constant pool items that contain the\n * internal names of these exception classes.\n */\n int[] exceptions;\n\n /**\n * The annotation default attribute of this method. May be null.\n */\n private ByteVector annd;\n\n /**\n * The runtime visible annotations of this method. May be null.\n */\n private AnnotationWriter anns;\n\n /**\n * The runtime invisible annotations of this method. May be null.\n */\n private AnnotationWriter ianns;\n\n /**\n * The runtime visible parameter annotations of this method. May be\n * null.\n */\n private AnnotationWriter[] panns;\n\n /**\n * The runtime invisible parameter annotations of this method. May be\n * null.\n */\n private AnnotationWriter[] ipanns;\n\n /**\n * The number of synthetic parameters of this method.\n */\n private int synthetics;\n\n /**\n * The non standard attributes of the method.\n */\n private Attribute attrs;\n\n /**\n * The bytecode of this method.\n */\n private ByteVector code = new ByteVector();\n\n /**\n * Maximum stack size of this method.\n */\n private int maxStack;\n\n /**\n * Maximum number of local variables for this method.\n */\n private int maxLocals;\n\n /**\n * Number of local variables in the current stack map frame.\n */\n private int currentLocals;\n\n /**\n * Number of stack map frames in the StackMapTable attribute.\n */\n private int frameCount;\n\n /**\n * The StackMapTable attribute.\n */\n private ByteVector stackMap;\n\n /**\n * The offset of the last frame that was written in the StackMapTable\n * attribute.\n */\n private int previousFrameOffset;\n\n /**\n * The last frame that was written in the StackMapTable attribute.\n *\n * @see #frame\n */\n private int[] previousFrame;\n\n /**\n * The current stack map frame. The first element contains the offset of the\n * instruction to which the frame corresponds, the second element is the\n * number of locals and the third one is the number of stack elements. The\n * local variables start at index 3 and are followed by the operand stack\n * values. In summary frame[0] = offset, frame[1] = nLocal, frame[2] =\n * nStack, frame[3] = nLocal. All types are encoded as integers, with the\n * same format as the one used in {@link Label}, but limited to BASE types.\n */\n private int[] frame;\n\n /**\n * Number of elements in the exception handler list.\n */\n private int handlerCount;\n\n /**\n * The first element in the exception handler list.\n */\n private Handler firstHandler;\n\n /**\n * The last element in the exception handler list.\n */\n private Handler lastHandler;\n\n /**\n * Number of entries in the LocalVariableTable attribute.\n */\n private int localVarCount;\n\n /**\n * The LocalVariableTable attribute.\n */\n private ByteVector localVar;\n\n /**\n * Number of entries in the LocalVariableTypeTable attribute.\n */\n private int localVarTypeCount;\n\n /**\n * The LocalVariableTypeTable attribute.\n */\n private ByteVector localVarType;\n\n /**\n * Number of entries in the LineNumberTable attribute.\n */\n private int lineNumberCount;\n\n /**\n * The LineNumberTable attribute.\n */\n private ByteVector lineNumber;\n\n /**\n * The non standard attributes of the method's code.\n */\n private Attribute cattrs;\n\n /**\n * Indicates if some jump instructions are too small and need to be resized.\n */\n private boolean resize;\n\n /**\n * The number of subroutines in this method.\n */\n private int subroutines;\n\n // ------------------------------------------------------------------------\n\n /*\n * Fields for the control flow graph analysis algorithm (used to compute the\n * maximum stack size). A control flow graph contains one node per \"basic\n * block\", and one edge per \"jump\" from one basic block to another. Each\n * node (i.e., each basic block) is represented by the Label object that\n * corresponds to the first instruction of this basic block. Each node also\n * stores the list of its successors in the graph, as a linked list of Edge\n * objects.\n */\n\n /**\n * Indicates what must be automatically computed.\n *\n * @see #FRAMES\n * @see #MAXS\n * @see #NOTHING\n */\n private final int compute;\n\n /**\n * A list of labels. This list is the list of basic blocks in the method,\n * i.e. a list of Label objects linked to each other by their\n * {@link Label#successor} field, in the order they are visited by\n * {@link MethodVisitor#visitLabel}, and starting with the first basic\n * block.\n */\n private Label labels;\n\n /**\n * The previous basic block.\n */\n private Label previousBlock;\n\n /**\n * The current basic block.\n */\n private Label currentBlock;\n\n /**\n * The (relative) stack size after the last visited instruction. This size\n * is relative to the beginning of the current basic block, i.e., the true\n * stack size after the last visited instruction is equal to the\n * {@link Label#inputStackTop beginStackSize} of the current basic block\n * plus stackSize.\n */\n private int stackSize;\n\n /**\n * The (relative) maximum stack size after the last visited instruction.\n * This size is relative to the beginning of the current basic block, i.e.,\n * the true maximum stack size after the last visited instruction is equal\n * to the {@link Label#inputStackTop beginStackSize} of the current basic\n * block plus stackSize.\n */\n private int maxStackSize;\n\n // ------------------------------------------------------------------------\n // Constructor\n // ------------------------------------------------------------------------\n\n /**\n * Constructs a new {@link MethodWriter}.\n *\n * @param cw\n * the class writer in which the method must be added.\n * @param access\n * the method's access flags (see {@link Opcodes}).\n * @param name\n * the method's name.\n * @param desc\n * the method's descriptor (see {@link Type}).\n * @param signature\n * the method's signature. May be null.\n * @param exceptions\n * the internal names of the method's exceptions. May be\n * null.\n * @param computeMaxs\n * true if the maximum stack size and number of local\n * variables must be automatically computed.\n * @param computeFrames\n * true if the stack map tables must be recomputed from\n * scratch.\n */\n MethodWriter(final ClassWriter cw, final int access, final String name,\n final String desc, final String signature,\n final String[] exceptions, final boolean computeMaxs,\n final boolean computeFrames) {\n super(Opcodes.ASM4);\n if (cw.firstMethod == null) {\n cw.firstMethod = this;\n } else {\n cw.lastMethod.mv = this;\n }\n cw.lastMethod = this;\n this.cw = cw;\n this.access = access;\n if (\"\".equals(name)) {\n this.access |= ACC_CONSTRUCTOR;\n }\n this.name = cw.newUTF8(name);\n this.desc = cw.newUTF8(desc);\n this.descriptor = desc;\n if (ClassReader.SIGNATURES) {\n this.signature = signature;\n }\n if (exceptions != null && exceptions.length > 0) {\n exceptionCount = exceptions.length;\n this.exceptions = new int[exceptionCount];\n for (int i = 0; i < exceptionCount; ++i) {\n this.exceptions[i] = cw.newClass(exceptions[i]);\n }\n }\n this.compute = computeFrames ? FRAMES : (computeMaxs ? MAXS : NOTHING);\n if (computeMaxs || computeFrames) {\n // updates maxLocals\n int size = Type.getArgumentsAndReturnSizes(descriptor) >> 2;\n if ((access & Opcodes.ACC_STATIC) != 0) {\n --size;\n }\n maxLocals = size;\n currentLocals = size;\n // creates and visits the label for the first basic block\n labels = new Label();\n labels.status |= Label.PUSHED;\n visitLabel(labels);\n }\n }\n\n // ------------------------------------------------------------------------\n // Implementation of the MethodVisitor abstract class\n // ------------------------------------------------------------------------\n\n @Override\n public AnnotationVisitor visitAnnotationDefault() {\n if (!ClassReader.ANNOTATIONS) {\n return null;\n }\n annd = new ByteVector();\n return new AnnotationWriter(cw, false, annd, null, 0);\n }\n\n @Override\n public AnnotationVisitor visitAnnotation(final String desc,\n final boolean visible) {\n if (!ClassReader.ANNOTATIONS) {\n return null;\n }\n ByteVector bv = new ByteVector();\n // write type, and reserve space for values count\n bv.putShort(cw.newUTF8(desc)).putShort(0);\n AnnotationWriter aw = new AnnotationWriter(cw, true, bv, bv, 2);\n if (visible) {\n aw.next = anns;\n anns = aw;\n } else {\n aw.next = ianns;\n ianns = aw;\n }\n return aw;\n }\n\n @Override\n public AnnotationVisitor visitParameterAnnotation(final int parameter,\n final String desc, final boolean visible) {\n if (!ClassReader.ANNOTATIONS) {\n return null;\n }\n ByteVector bv = new ByteVector();\n if (\"Ljava/lang/Synthetic;\".equals(desc)) {\n // workaround for a bug in javac with synthetic parameters\n // see ClassReader.readParameterAnnotations\n synthetics = Math.max(synthetics, parameter + 1);\n return new AnnotationWriter(cw, false, bv, null, 0);\n }\n // write type, and reserve space for values count\n bv.putShort(cw.newUTF8(desc)).putShort(0);\n AnnotationWriter aw = new AnnotationWriter(cw, true, bv, bv, 2);\n if (visible) {\n if (panns == null) {\n panns = new AnnotationWriter[Type.getArgumentTypes(descriptor).length];\n }\n aw.next = panns[parameter];\n panns[parameter] = aw;\n } else {\n if (ipanns == null) {\n ipanns = new AnnotationWriter[Type.getArgumentTypes(descriptor).length];\n }\n aw.next = ipanns[parameter];\n ipanns[parameter] = aw;\n }\n return aw;\n }\n\n @Override\n public void visitAttribute(final Attribute attr) {\n if (attr.isCodeAttribute()) {\n attr.next = cattrs;\n cattrs = attr;\n } else {\n attr.next = attrs;\n attrs = attr;\n }\n }\n\n @Override\n public void visitCode() {\n }\n\n @Override\n public void visitFrame(final int type, final int nLocal,\n final Object[] local, final int nStack, final Object[] stack) {\n if (!ClassReader.FRAMES || compute == FRAMES) {\n return;\n }\n\n if (type == Opcodes.F_NEW) {\n if (previousFrame == null) {\n visitImplicitFirstFrame();\n }\n currentLocals = nLocal;\n int frameIndex = startFrame(code.length, nLocal, nStack);\n for (int i = 0; i < nLocal; ++i) {\n if (local[i] instanceof String) {\n frame[frameIndex++] = Frame.OBJECT\n | cw.addType((String) local[i]);\n } else if (local[i] instanceof Integer) {\n frame[frameIndex++] = ((Integer) local[i]).intValue();\n } else {\n frame[frameIndex++] = Frame.UNINITIALIZED\n | cw.addUninitializedType(\"\",\n ((Label) local[i]).position);\n }\n }\n for (int i = 0; i < nStack; ++i) {\n if (stack[i] instanceof String) {\n frame[frameIndex++] = Frame.OBJECT\n | cw.addType((String) stack[i]);\n } else if (stack[i] instanceof Integer) {\n frame[frameIndex++] = ((Integer) stack[i]).intValue();\n } else {\n frame[frameIndex++] = Frame.UNINITIALIZED\n | cw.addUninitializedType(\"\",\n ((Label) stack[i]).position);\n }\n }\n endFrame();\n } else {\n int delta;\n if (stackMap == null) {\n stackMap = new ByteVector();\n delta = code.length;\n } else {\n delta = code.length - previousFrameOffset - 1;\n if (delta < 0) {\n if (type == Opcodes.F_SAME) {\n return;\n } else {\n throw new IllegalStateException();\n }\n }\n }\n\n switch (type) {\n case Opcodes.F_FULL:\n currentLocals = nLocal;\n stackMap.putByte(FULL_FRAME).putShort(delta).putShort(nLocal);\n for (int i = 0; i < nLocal; ++i) {\n writeFrameType(local[i]);\n }\n stackMap.putShort(nStack);\n for (int i = 0; i < nStack; ++i) {\n writeFrameType(stack[i]);\n }\n break;\n case Opcodes.F_APPEND:\n currentLocals += nLocal;\n stackMap.putByte(SAME_FRAME_EXTENDED + nLocal).putShort(delta);\n for (int i = 0; i < nLocal; ++i) {\n writeFrameType(local[i]);\n }\n break;\n case Opcodes.F_CHOP:\n currentLocals -= nLocal;\n stackMap.putByte(SAME_FRAME_EXTENDED - nLocal).putShort(delta);\n break;\n case Opcodes.F_SAME:\n if (delta < 64) {\n stackMap.putByte(delta);\n } else {\n stackMap.putByte(SAME_FRAME_EXTENDED).putShort(delta);\n }\n break;\n case Opcodes.F_SAME1:\n if (delta < 64) {\n stackMap.putByte(SAME_LOCALS_1_STACK_ITEM_FRAME + delta);\n } else {\n stackMap.putByte(SAME_LOCALS_1_STACK_ITEM_FRAME_EXTENDED)\n .putShort(delta);\n }\n writeFrameType(stack[0]);\n break;\n }\n\n previousFrameOffset = code.length;\n ++frameCount;\n }\n\n maxStack = Math.max(maxStack, nStack);\n maxLocals = Math.max(maxLocals, currentLocals);\n }\n\n @Override\n public void visitInsn(final int opcode) {\n // adds the instruction to the bytecode of the method\n code.putByte(opcode);\n // update currentBlock\n // Label currentBlock = this.currentBlock;\n if (currentBlock != null) {\n if (compute == FRAMES) {\n currentBlock.frame.execute(opcode, 0, null, null);\n } else {\n // updates current and max stack sizes\n int size = stackSize + Frame.SIZE[opcode];\n if (size > maxStackSize) {\n maxStackSize = size;\n }\n stackSize = size;\n }\n // if opcode == ATHROW or xRETURN, ends current block (no successor)\n if ((opcode >= Opcodes.IRETURN && opcode <= Opcodes.RETURN)\n || opcode == Opcodes.ATHROW) {\n noSuccessor();\n }\n }\n }\n\n @Override\n public void visitIntInsn(final int opcode, final int operand) {\n // Label currentBlock = this.currentBlock;\n if (currentBlock != null) {\n if (compute == FRAMES) {\n currentBlock.frame.execute(opcode, operand, null, null);\n } else if (opcode != Opcodes.NEWARRAY) {\n // updates current and max stack sizes only for NEWARRAY\n // (stack size variation = 0 for BIPUSH or SIPUSH)\n int size = stackSize + 1;\n if (size > maxStackSize) {\n maxStackSize = size;\n }\n stackSize = size;\n }\n }\n // adds the instruction to the bytecode of the method\n if (opcode == Opcodes.SIPUSH) {\n code.put12(opcode, operand);\n } else { // BIPUSH or NEWARRAY\n code.put11(opcode, operand);\n }\n }\n\n @Override\n public void visitVarInsn(final int opcode, final int var) {\n // Label currentBlock = this.currentBlock;\n if (currentBlock != null) {\n if (compute == FRAMES) {\n currentBlock.frame.execute(opcode, var, null, null);\n } else {\n // updates current and max stack sizes\n if (opcode == Opcodes.RET) {\n // no stack change, but end of current block (no successor)\n currentBlock.status |= Label.RET;\n // save 'stackSize' here for future use\n // (see {@link #findSubroutineSuccessors})\n currentBlock.inputStackTop = stackSize;\n noSuccessor();\n } else { // xLOAD or xSTORE\n int size = stackSize + Frame.SIZE[opcode];\n if (size > maxStackSize) {\n maxStackSize = size;\n }\n stackSize = size;\n }\n }\n }\n if (compute != NOTHING) {\n // updates max locals\n int n;\n if (opcode == Opcodes.LLOAD || opcode == Opcodes.DLOAD\n || opcode == Opcodes.LSTORE || opcode == Opcodes.DSTORE) {\n n = var + 2;\n } else {\n n = var + 1;\n }\n if (n > maxLocals) {\n maxLocals = n;\n }\n }\n // adds the instruction to the bytecode of the method\n if (var < 4 && opcode != Opcodes.RET) {\n int opt;\n if (opcode < Opcodes.ISTORE) {\n /* ILOAD_0 */\n opt = 26 + ((opcode - Opcodes.ILOAD) << 2) + var;\n } else {\n /* ISTORE_0 */\n opt = 59 + ((opcode - Opcodes.ISTORE) << 2) + var;\n }\n code.putByte(opt);\n } else if (var >= 256) {\n code.putByte(196 /* WIDE */).put12(opcode, var);\n } else {\n code.put11(opcode, var);\n }\n if (opcode >= Opcodes.ISTORE && compute == FRAMES && handlerCount > 0) {\n visitLabel(new Label());\n }\n }\n\n @Override\n public void visitTypeInsn(final int opcode, final String type) {\n Item i = cw.newClassItem(type);\n // Label currentBlock = this.currentBlock;\n if (currentBlock != null) {\n if (compute == FRAMES) {\n currentBlock.frame.execute(opcode, code.length, cw, i);\n } else if (opcode == Opcodes.NEW) {\n // updates current and max stack sizes only if opcode == NEW\n // (no stack change for ANEWARRAY, CHECKCAST, INSTANCEOF)\n int size = stackSize + 1;\n if (size > maxStackSize) {\n maxStackSize = size;\n }\n stackSize = size;\n }\n }\n // adds the instruction to the bytecode of the method\n code.put12(opcode, i.index);\n }\n\n @Override\n public void visitFieldInsn(final int opcode, final String owner,\n final String name, final String desc) {\n Item i = cw.newFieldItem(owner, name, desc);\n // Label currentBlock = this.currentBlock;\n if (currentBlock != null) {\n if (compute == FRAMES) {\n currentBlock.frame.execute(opcode, 0, cw, i);\n } else {\n int size;\n // computes the stack size variation\n char c = desc.charAt(0);\n switch (opcode) {\n case Opcodes.GETSTATIC:\n size = stackSize + (c == 'D' || c == 'J' ? 2 : 1);\n break;\n case Opcodes.PUTSTATIC:\n size = stackSize + (c == 'D' || c == 'J' ? -2 : -1);\n break;\n case Opcodes.GETFIELD:\n size = stackSize + (c == 'D' || c == 'J' ? 1 : 0);\n break;\n // case Constants.PUTFIELD:\n default:\n size = stackSize + (c == 'D' || c == 'J' ? -3 : -2);\n break;\n }\n // updates current and max stack sizes\n if (size > maxStackSize) {\n maxStackSize = size;\n }\n stackSize = size;\n }\n }\n // adds the instruction to the bytecode of the method\n code.put12(opcode, i.index);\n }\n\n @Override\n public void visitMethodInsn(final int opcode, final String owner,\n final String name, final String desc) {\n boolean itf = opcode == Opcodes.INVOKEINTERFACE;\n Item i = cw.newMethodItem(owner, name, desc, itf);\n int argSize = i.intVal;\n // Label currentBlock = this.currentBlock;\n if (currentBlock != null) {\n if (compute == FRAMES) {\n currentBlock.frame.execute(opcode, 0, cw, i);\n } else {\n /*\n * computes the stack size variation. In order not to recompute\n * several times this variation for the same Item, we use the\n * intVal field of this item to store this variation, once it\n * has been computed. More precisely this intVal field stores\n * the sizes of the arguments and of the return value\n * corresponding to desc.\n */\n if (argSize == 0) {\n // the above sizes have not been computed yet,\n // so we compute them...\n argSize = Type.getArgumentsAndReturnSizes(desc);\n // ... and we save them in order\n // not to recompute them in the future\n i.intVal = argSize;\n }\n int size;\n if (opcode == Opcodes.INVOKESTATIC) {\n size = stackSize - (argSize >> 2) + (argSize & 0x03) + 1;\n } else {\n size = stackSize - (argSize >> 2) + (argSize & 0x03);\n }\n // updates current and max stack sizes\n if (size > maxStackSize) {\n maxStackSize = size;\n }\n stackSize = size;\n }\n }\n // adds the instruction to the bytecode of the method\n if (itf) {\n if (argSize == 0) {\n argSize = Type.getArgumentsAndReturnSizes(desc);\n i.intVal = argSize;\n }\n code.put12(Opcodes.INVOKEINTERFACE, i.index).put11(argSize >> 2, 0);\n } else {\n code.put12(opcode, i.index);\n }\n }\n\n @Override\n public void visitInvokeDynamicInsn(final String name, final String desc,\n final Handle bsm, final Object... bsmArgs) {\n Item i = cw.newInvokeDynamicItem(name, desc, bsm, bsmArgs);\n int argSize = i.intVal;\n // Label currentBlock = this.currentBlock;\n if (currentBlock != null) {\n if (compute == FRAMES) {\n currentBlock.frame.execute(Opcodes.INVOKEDYNAMIC, 0, cw, i);\n } else {\n /*\n * computes the stack size variation. In order not to recompute\n * several times this variation for the same Item, we use the\n * intVal field of this item to store this variation, once it\n * has been computed. More precisely this intVal field stores\n * the sizes of the arguments and of the return value\n * corresponding to desc.\n */\n if (argSize == 0) {\n // the above sizes have not been computed yet,\n // so we compute them...\n argSize = Type.getArgumentsAndReturnSizes(desc);\n // ... and we save them in order\n // not to recompute them in the future\n i.intVal = argSize;\n }\n int size = stackSize - (argSize >> 2) + (argSize & 0x03) + 1;\n\n // updates current and max stack sizes\n if (size > maxStackSize) {\n maxStackSize = size;\n }\n stackSize = size;\n }\n }\n // adds the instruction to the bytecode of the method\n code.put12(Opcodes.INVOKEDYNAMIC, i.index);\n code.putShort(0);\n }\n\n @Override\n public void visitJumpInsn(final int opcode, final Label label) {\n Label nextInsn = null;\n // Label currentBlock = this.currentBlock;\n if (currentBlock != null) {\n if (compute == FRAMES) {\n currentBlock.frame.execute(opcode, 0, null, null);\n // 'label' is the target of a jump instruction\n label.getFirst().status |= Label.TARGET;\n // adds 'label' as a successor of this basic block\n addSuccessor(Edge.NORMAL, label);\n if (opcode != Opcodes.GOTO) {\n // creates a Label for the next basic block\n nextInsn = new Label();\n }\n } else {\n if (opcode == Opcodes.JSR) {\n if ((label.status & Label.SUBROUTINE) == 0) {\n label.status |= Label.SUBROUTINE;\n ++subroutines;\n }\n currentBlock.status |= Label.JSR;\n addSuccessor(stackSize + 1, label);\n // creates a Label for the next basic block\n nextInsn = new Label();\n /*\n * note that, by construction in this method, a JSR block\n * has at least two successors in the control flow graph:\n * the first one leads the next instruction after the JSR,\n * while the second one leads to the JSR target.\n */\n } else {\n // updates current stack size (max stack size unchanged\n // because stack size variation always negative in this\n // case)\n stackSize += Frame.SIZE[opcode];\n addSuccessor(stackSize, label);\n }\n }\n }\n // adds the instruction to the bytecode of the method\n if ((label.status & Label.RESOLVED) != 0\n && label.position - code.length < Short.MIN_VALUE) {\n /*\n * case of a backward jump with an offset < -32768. In this case we\n * automatically replace GOTO with GOTO_W, JSR with JSR_W and IFxxx\n * with IFNOTxxx GOTO_W , where IFNOTxxx is the\n * \"opposite\" opcode of IFxxx (i.e., IFNE for IFEQ) and where \n * designates the instruction just after the GOTO_W.\n */\n if (opcode == Opcodes.GOTO) {\n code.putByte(200); // GOTO_W\n } else if (opcode == Opcodes.JSR) {\n code.putByte(201); // JSR_W\n } else {\n // if the IF instruction is transformed into IFNOT GOTO_W the\n // next instruction becomes the target of the IFNOT instruction\n if (nextInsn != null) {\n nextInsn.status |= Label.TARGET;\n }\n code.putByte(opcode <= 166 ? ((opcode + 1) ^ 1) - 1\n : opcode ^ 1);\n code.putShort(8); // jump offset\n code.putByte(200); // GOTO_W\n }\n label.put(this, code, code.length - 1, true);\n } else {\n /*\n * case of a backward jump with an offset >= -32768, or of a forward\n * jump with, of course, an unknown offset. In these cases we store\n * the offset in 2 bytes (which will be increased in\n * resizeInstructions, if needed).\n */\n code.putByte(opcode);\n label.put(this, code, code.length - 1, false);\n }\n if (currentBlock != null) {\n if (nextInsn != null) {\n // if the jump instruction is not a GOTO, the next instruction\n // is also a successor of this instruction. Calling visitLabel\n // adds the label of this next instruction as a successor of the\n // current block, and starts a new basic block\n visitLabel(nextInsn);\n }\n if (opcode == Opcodes.GOTO) {\n noSuccessor();\n }\n }\n }\n\n @Override\n public void visitLabel(final Label label) {\n // resolves previous forward references to label, if any\n resize |= label.resolve(this, code.length, code.data);\n // updates currentBlock\n if ((label.status & Label.DEBUG) != 0) {\n return;\n }\n if (compute == FRAMES) {\n if (currentBlock != null) {\n if (label.position == currentBlock.position) {\n // successive labels, do not start a new basic block\n currentBlock.status |= (label.status & Label.TARGET);\n label.frame = currentBlock.frame;\n return;\n }\n // ends current block (with one new successor)\n addSuccessor(Edge.NORMAL, label);\n }\n // begins a new current block\n currentBlock = label;\n if (label.frame == null) {\n label.frame = new Frame();\n label.frame.owner = label;\n }\n // updates the basic block list\n if (previousBlock != null) {\n if (label.position == previousBlock.position) {\n previousBlock.status |= (label.status & Label.TARGET);\n label.frame = previousBlock.frame;\n currentBlock = previousBlock;\n return;\n }\n previousBlock.successor = label;\n }\n previousBlock = label;\n } else if (compute == MAXS) {\n if (currentBlock != null) {\n // ends current block (with one new successor)\n currentBlock.outputStackMax = maxStackSize;\n addSuccessor(stackSize, label);\n }\n // begins a new current block\n currentBlock = label;\n // resets the relative current and max stack sizes\n stackSize = 0;\n maxStackSize = 0;\n // updates the basic block list\n if (previousBlock != null) {\n previousBlock.successor = label;\n }\n previousBlock = label;\n }\n }\n\n @Override\n public void visitLdcInsn(final Object cst) {\n Item i = cw.newConstItem(cst);\n // Label currentBlock = this.currentBlock;\n if (currentBlock != null) {\n if (compute == FRAMES) {\n currentBlock.frame.execute(Opcodes.LDC, 0, cw, i);\n } else {\n int size;\n // computes the stack size variation\n if (i.type == ClassWriter.LONG || i.type == ClassWriter.DOUBLE) {\n size = stackSize + 2;\n } else {\n size = stackSize + 1;\n }\n // updates current and max stack sizes\n if (size > maxStackSize) {\n maxStackSize = size;\n }\n stackSize = size;\n }\n }\n // adds the instruction to the bytecode of the method\n int index = i.index;\n if (i.type == ClassWriter.LONG || i.type == ClassWriter.DOUBLE) {\n code.put12(20 /* LDC2_W */, index);\n } else if (index >= 256) {\n code.put12(19 /* LDC_W */, index);\n } else {\n code.put11(Opcodes.LDC, index);\n }\n }\n\n @Override\n public void visitIincInsn(final int var, final int increment) {\n if (currentBlock != null) {\n if (compute == FRAMES) {\n currentBlock.frame.execute(Opcodes.IINC, var, null, null);\n }\n }\n if (compute != NOTHING) {\n // updates max locals\n int n = var + 1;\n if (n > maxLocals) {\n maxLocals = n;\n }\n }\n // adds the instruction to the bytecode of the method\n if ((var > 255) || (increment > 127) || (increment < -128)) {\n code.putByte(196 /* WIDE */).put12(Opcodes.IINC, var)\n .putShort(increment);\n } else {\n code.putByte(Opcodes.IINC).put11(var, increment);\n }\n }\n\n @Override\n public void visitTableSwitchInsn(final int min, final int max,\n final Label dflt, final Label... labels) {\n // adds the instruction to the bytecode of the method\n int source = code.length;\n code.putByte(Opcodes.TABLESWITCH);\n code.putByteArray(null, 0, (4 - code.length % 4) % 4);\n dflt.put(this, code, source, true);\n code.putInt(min).putInt(max);\n for (int i = 0; i < labels.length; ++i) {\n labels[i].put(this, code, source, true);\n }\n // updates currentBlock\n visitSwitchInsn(dflt, labels);\n }\n\n @Override\n public void visitLookupSwitchInsn(final Label dflt, final int[] keys,\n final Label[] labels) {\n // adds the instruction to the bytecode of the method\n int source = code.length;\n code.putByte(Opcodes.LOOKUPSWITCH);\n code.putByteArray(null, 0, (4 - code.length % 4) % 4);\n dflt.put(this, code, source, true);\n code.putInt(labels.length);\n for (int i = 0; i < labels.length; ++i) {\n code.putInt(keys[i]);\n labels[i].put(this, code, source, true);\n }\n // updates currentBlock\n visitSwitchInsn(dflt, labels);\n }\n\n private void visitSwitchInsn(final Label dflt, final Label[] labels) {\n // Label currentBlock = this.currentBlock;\n if (currentBlock != null) {\n if (compute == FRAMES) {\n currentBlock.frame.execute(Opcodes.LOOKUPSWITCH, 0, null, null);\n // adds current block successors\n addSuccessor(Edge.NORMAL, dflt);\n dflt.getFirst().status |= Label.TARGET;\n for (int i = 0; i < labels.length; ++i) {\n addSuccessor(Edge.NORMAL, labels[i]);\n labels[i].getFirst().status |= Label.TARGET;\n }\n } else {\n // updates current stack size (max stack size unchanged)\n --stackSize;\n // adds current block successors\n addSuccessor(stackSize, dflt);\n for (int i = 0; i < labels.length; ++i) {\n addSuccessor(stackSize, labels[i]);\n }\n }\n // ends current block\n noSuccessor();\n }\n }\n\n @Override\n public void visitMultiANewArrayInsn(final String desc, final int dims) {\n Item i = cw.newClassItem(desc);\n // Label currentBlock = this.currentBlock;\n if (currentBlock != null) {\n if (compute == FRAMES) {\n currentBlock.frame.execute(Opcodes.MULTIANEWARRAY, dims, cw, i);\n } else {\n // updates current stack size (max stack size unchanged because\n // stack size variation always negative or null)\n stackSize += 1 - dims;\n }\n }\n // adds the instruction to the bytecode of the method\n code.put12(Opcodes.MULTIANEWARRAY, i.index).putByte(dims);\n }\n\n @Override\n public void visitTryCatchBlock(final Label start, final Label end,\n final Label handler, final String type) {\n ++handlerCount;\n Handler h = new Handler();\n h.start = start;\n h.end = end;\n h.handler = handler;\n h.desc = type;\n h.type = type != null ? cw.newClass(type) : 0;\n if (lastHandler == null) {\n firstHandler = h;\n } else {\n lastHandler.next = h;\n }\n lastHandler = h;\n }\n\n @Override\n public void visitLocalVariable(final String name, final String desc,\n final String signature, final Label start, final Label end,\n final int index) {\n if (signature != null) {\n if (localVarType == null) {\n localVarType = new ByteVector();\n }\n ++localVarTypeCount;\n localVarType.putShort(start.position)\n .putShort(end.position - start.position)\n .putShort(cw.newUTF8(name)).putShort(cw.newUTF8(signature))\n .putShort(index);\n }\n if (localVar == null) {\n localVar = new ByteVector();\n }\n ++localVarCount;\n localVar.putShort(start.position)\n .putShort(end.position - start.position)\n .putShort(cw.newUTF8(name)).putShort(cw.newUTF8(desc))\n .putShort(index);\n if (compute != NOTHING) {\n // updates max locals\n char c = desc.charAt(0);\n int n = index + (c == 'J' || c == 'D' ? 2 : 1);\n if (n > maxLocals) {\n maxLocals = n;\n }\n }\n }\n\n @Override\n public void visitLineNumber(final int line, final Label start) {\n if (lineNumber == null) {\n lineNumber = new ByteVector();\n }\n ++lineNumberCount;\n lineNumber.putShort(start.position);\n lineNumber.putShort(line);\n }\n\n @Override\n public void visitMaxs(final int maxStack, final int maxLocals) {\n if (ClassReader.FRAMES && compute == FRAMES) {\n // completes the control flow graph with exception handler blocks\n Handler handler = firstHandler;\n while (handler != null) {\n Label l = handler.start.getFirst();\n Label h = handler.handler.getFirst();\n Label e = handler.end.getFirst();\n // computes the kind of the edges to 'h'\n String t = handler.desc == null ? \"java/lang/Throwable\"\n : handler.desc;\n int kind = Frame.OBJECT | cw.addType(t);\n // h is an exception handler\n h.status |= Label.TARGET;\n // adds 'h' as a successor of labels between 'start' and 'end'\n while (l != e) {\n // creates an edge to 'h'\n Edge b = new Edge();\n b.info = kind;\n b.successor = h;\n // adds it to the successors of 'l'\n b.next = l.successors;\n l.successors = b;\n // goes to the next label\n l = l.successor;\n }\n handler = handler.next;\n }\n\n // creates and visits the first (implicit) frame\n Frame f = labels.frame;\n Type[] args = Type.getArgumentTypes(descriptor);\n f.initInputFrame(cw, access, args, this.maxLocals);\n visitFrame(f);\n\n /*\n * fix point algorithm: mark the first basic block as 'changed'\n * (i.e. put it in the 'changed' list) and, while there are changed\n * basic blocks, choose one, mark it as unchanged, and update its\n * successors (which can be changed in the process).\n */\n int max = 0;\n Label changed = labels;\n while (changed != null) {\n // removes a basic block from the list of changed basic blocks\n Label l = changed;\n changed = changed.next;\n l.next = null;\n f = l.frame;\n // a reachable jump target must be stored in the stack map\n if ((l.status & Label.TARGET) != 0) {\n l.status |= Label.STORE;\n }\n // all visited labels are reachable, by definition\n l.status |= Label.REACHABLE;\n // updates the (absolute) maximum stack size\n int blockMax = f.inputStack.length + l.outputStackMax;\n if (blockMax > max) {\n max = blockMax;\n }\n // updates the successors of the current basic block\n Edge e = l.successors;\n while (e != null) {\n Label n = e.successor.getFirst();\n boolean change = f.merge(cw, n.frame, e.info);\n if (change && n.next == null) {\n // if n has changed and is not already in the 'changed'\n // list, adds it to this list\n n.next = changed;\n changed = n;\n }\n e = e.next;\n }\n }\n\n // visits all the frames that must be stored in the stack map\n Label l = labels;\n while (l != null) {\n f = l.frame;\n if ((l.status & Label.STORE) != 0) {\n visitFrame(f);\n }\n if ((l.status & Label.REACHABLE) == 0) {\n // finds start and end of dead basic block\n Label k = l.successor;\n int start = l.position;\n int end = (k == null ? code.length : k.position) - 1;\n // if non empty basic block\n if (end >= start) {\n max = Math.max(max, 1);\n // replaces instructions with NOP ... NOP ATHROW\n for (int i = start; i < end; ++i) {\n code.data[i] = Opcodes.NOP;\n }\n code.data[end] = (byte) Opcodes.ATHROW;\n // emits a frame for this unreachable block\n int frameIndex = startFrame(start, 0, 1);\n frame[frameIndex] = Frame.OBJECT\n | cw.addType(\"java/lang/Throwable\");\n endFrame();\n // removes the start-end range from the exception\n // handlers\n firstHandler = Handler.remove(firstHandler, l, k);\n }\n }\n l = l.successor;\n }\n\n handler = firstHandler;\n handlerCount = 0;\n while (handler != null) {\n handlerCount += 1;\n handler = handler.next;\n }\n\n this.maxStack = max;\n } else if (compute == MAXS) {\n // completes the control flow graph with exception handler blocks\n Handler handler = firstHandler;\n while (handler != null) {\n Label l = handler.start;\n Label h = handler.handler;\n Label e = handler.end;\n // adds 'h' as a successor of labels between 'start' and 'end'\n while (l != e) {\n // creates an edge to 'h'\n Edge b = new Edge();\n b.info = Edge.EXCEPTION;\n b.successor = h;\n // adds it to the successors of 'l'\n if ((l.status & Label.JSR) == 0) {\n b.next = l.successors;\n l.successors = b;\n } else {\n // if l is a JSR block, adds b after the first two edges\n // to preserve the hypothesis about JSR block successors\n // order (see {@link #visitJumpInsn})\n b.next = l.successors.next.next;\n l.successors.next.next = b;\n }\n // goes to the next label\n l = l.successor;\n }\n handler = handler.next;\n }\n\n if (subroutines > 0) {\n // completes the control flow graph with the RET successors\n /*\n * first step: finds the subroutines. This step determines, for\n * each basic block, to which subroutine(s) it belongs.\n */\n // finds the basic blocks that belong to the \"main\" subroutine\n int id = 0;\n labels.visitSubroutine(null, 1, subroutines);\n // finds the basic blocks that belong to the real subroutines\n Label l = labels;\n while (l != null) {\n if ((l.status & Label.JSR) != 0) {\n // the subroutine is defined by l's TARGET, not by l\n Label subroutine = l.successors.next.successor;\n // if this subroutine has not been visited yet...\n if ((subroutine.status & Label.VISITED) == 0) {\n // ...assigns it a new id and finds its basic blocks\n id += 1;\n subroutine.visitSubroutine(null, (id / 32L) << 32\n | (1L << (id % 32)), subroutines);\n }\n }\n l = l.successor;\n }\n // second step: finds the successors of RET blocks\n l = labels;\n while (l != null) {\n if ((l.status & Label.JSR) != 0) {\n Label L = labels;\n while (L != null) {\n L.status &= ~Label.VISITED2;\n L = L.successor;\n }\n // the subroutine is defined by l's TARGET, not by l\n Label subroutine = l.successors.next.successor;\n subroutine.visitSubroutine(l, 0, subroutines);\n }\n l = l.successor;\n }\n }\n\n /*\n * control flow analysis algorithm: while the block stack is not\n * empty, pop a block from this stack, update the max stack size,\n * compute the true (non relative) begin stack size of the\n * successors of this block, and push these successors onto the\n * stack (unless they have already been pushed onto the stack).\n * Note: by hypothesis, the {@link Label#inputStackTop} of the\n * blocks in the block stack are the true (non relative) beginning\n * stack sizes of these blocks.\n */\n int max = 0;\n Label stack = labels;\n while (stack != null) {\n // pops a block from the stack\n Label l = stack;\n stack = stack.next;\n // computes the true (non relative) max stack size of this block\n int start = l.inputStackTop;\n int blockMax = start + l.outputStackMax;\n // updates the global max stack size\n if (blockMax > max) {\n max = blockMax;\n }\n // analyzes the successors of the block\n Edge b = l.successors;\n if ((l.status & Label.JSR) != 0) {\n // ignores the first edge of JSR blocks (virtual successor)\n b = b.next;\n }\n while (b != null) {\n l = b.successor;\n // if this successor has not already been pushed...\n if ((l.status & Label.PUSHED) == 0) {\n // computes its true beginning stack size...\n l.inputStackTop = b.info == Edge.EXCEPTION ? 1 : start\n + b.info;\n // ...and pushes it onto the stack\n l.status |= Label.PUSHED;\n l.next = stack;\n stack = l;\n }\n b = b.next;\n }\n }\n this.maxStack = Math.max(maxStack, max);\n } else {\n this.maxStack = maxStack;\n this.maxLocals = maxLocals;\n }\n }\n\n @Override\n public void visitEnd() {\n }\n\n // ------------------------------------------------------------------------\n // Utility methods: control flow analysis algorithm\n // ------------------------------------------------------------------------\n\n /**\n * Adds a successor to the {@link #currentBlock currentBlock} block.\n *\n * @param info\n * information about the control flow edge to be added.\n * @param successor\n * the successor block to be added to the current block.\n */\n private void addSuccessor(final int info, final Label successor) {\n // creates and initializes an Edge object...\n Edge b = new Edge();\n b.info = info;\n b.successor = successor;\n // ...and adds it to the successor list of the currentBlock block\n b.next = currentBlock.successors;\n currentBlock.successors = b;\n }\n\n /**\n * Ends the current basic block. This method must be used in the case where\n * the current basic block does not have any successor.\n */\n private void noSuccessor() {\n if (compute == FRAMES) {\n Label l = new Label();\n l.frame = new Frame();\n l.frame.owner = l;\n l.resolve(this, code.length, code.data);\n previousBlock.successor = l;\n previousBlock = l;\n } else {\n currentBlock.outputStackMax = maxStackSize;\n }\n currentBlock = null;\n }\n\n // ------------------------------------------------------------------------\n // Utility methods: stack map frames\n // ------------------------------------------------------------------------\n\n /**\n * Visits a frame that has been computed from scratch.\n *\n * @param f\n * the frame that must be visited.\n */\n private void visitFrame(final Frame f) {\n int i, t;\n int nTop = 0;\n int nLocal = 0;\n int nStack = 0;\n int[] locals = f.inputLocals;\n int[] stacks = f.inputStack;\n // computes the number of locals (ignores TOP types that are just after\n // a LONG or a DOUBLE, and all trailing TOP types)\n for (i = 0; i < locals.length; ++i) {\n t = locals[i];\n if (t == Frame.TOP) {\n ++nTop;\n } else {\n nLocal += nTop + 1;\n nTop = 0;\n }\n if (t == Frame.LONG || t == Frame.DOUBLE) {\n ++i;\n }\n }\n // computes the stack size (ignores TOP types that are just after\n // a LONG or a DOUBLE)\n for (i = 0; i < stacks.length; ++i) {\n t = stacks[i];\n ++nStack;\n if (t == Frame.LONG || t == Frame.DOUBLE) {\n ++i;\n }\n }\n // visits the frame and its content\n int frameIndex = startFrame(f.owner.position, nLocal, nStack);\n for (i = 0; nLocal > 0; ++i, --nLocal) {\n t = locals[i];\n frame[frameIndex++] = t;\n if (t == Frame.LONG || t == Frame.DOUBLE) {\n ++i;\n }\n }\n for (i = 0; i < stacks.length; ++i) {\n t = stacks[i];\n frame[frameIndex++] = t;\n if (t == Frame.LONG || t == Frame.DOUBLE) {\n ++i;\n }\n }\n endFrame();\n }\n\n /**\n * Visit the implicit first frame of this method.\n */\n private void visitImplicitFirstFrame() {\n // There can be at most descriptor.length() + 1 locals\n int frameIndex = startFrame(0, descriptor.length() + 1, 0);\n if ((access & Opcodes.ACC_STATIC) == 0) {\n if ((access & ACC_CONSTRUCTOR) == 0) {\n frame[frameIndex++] = Frame.OBJECT | cw.addType(cw.thisName);\n } else {\n frame[frameIndex++] = 6; // Opcodes.UNINITIALIZED_THIS;\n }\n }\n int i = 1;\n loop: while (true) {\n int j = i;\n switch (descriptor.charAt(i++)) {\n case 'Z':\n case 'C':\n case 'B':\n case 'S':\n case 'I':\n frame[frameIndex++] = 1; // Opcodes.INTEGER;\n break;\n case 'F':\n frame[frameIndex++] = 2; // Opcodes.FLOAT;\n break;\n case 'J':\n frame[frameIndex++] = 4; // Opcodes.LONG;\n break;\n case 'D':\n frame[frameIndex++] = 3; // Opcodes.DOUBLE;\n break;\n case '[':\n while (descriptor.charAt(i) == '[') {\n ++i;\n }\n if (descriptor.charAt(i) == 'L') {\n ++i;\n while (descriptor.charAt(i) != ';') {\n ++i;\n }\n }\n frame[frameIndex++] = Frame.OBJECT\n | cw.addType(descriptor.substring(j, ++i));\n break;\n case 'L':\n while (descriptor.charAt(i) != ';') {\n ++i;\n }\n frame[frameIndex++] = Frame.OBJECT\n | cw.addType(descriptor.substring(j + 1, i++));\n break;\n default:\n break loop;\n }\n }\n frame[1] = frameIndex - 3;\n endFrame();\n }\n\n /**\n * Starts the visit of a stack map frame.\n *\n * @param offset\n * the offset of the instruction to which the frame corresponds.\n * @param nLocal\n * the number of local variables in the frame.\n * @param nStack\n * the number of stack elements in the frame.\n * @return the index of the next element to be written in this frame.\n */\n private int startFrame(final int offset, final int nLocal, final int nStack) {\n int n = 3 + nLocal + nStack;\n if (frame == null || frame.length < n) {\n frame = new int[n];\n }\n frame[0] = offset;\n frame[1] = nLocal;\n frame[2] = nStack;\n return 3;\n }\n\n /**\n * Checks if the visit of the current frame {@link #frame} is finished, and\n * if yes, write it in the StackMapTable attribute.\n */\n private void endFrame() {\n if (previousFrame != null) { // do not write the first frame\n if (stackMap == null) {\n stackMap = new ByteVector();\n }\n writeFrame();\n ++frameCount;\n }\n previousFrame = frame;\n frame = null;\n }\n\n /**\n * Compress and writes the current frame {@link #frame} in the StackMapTable\n * attribute.\n */\n private void writeFrame() {\n int clocalsSize = frame[1];\n int cstackSize = frame[2];\n if ((cw.version & 0xFFFF) < Opcodes.V1_6) {\n stackMap.putShort(frame[0]).putShort(clocalsSize);\n writeFrameTypes(3, 3 + clocalsSize);\n stackMap.putShort(cstackSize);\n writeFrameTypes(3 + clocalsSize, 3 + clocalsSize + cstackSize);\n return;\n }\n int localsSize = previousFrame[1];\n int type = FULL_FRAME;\n int k = 0;\n int delta;\n if (frameCount == 0) {\n delta = frame[0];\n } else {\n delta = frame[0] - previousFrame[0] - 1;\n }\n if (cstackSize == 0) {\n k = clocalsSize - localsSize;\n switch (k) {\n case -3:\n case -2:\n case -1:\n type = CHOP_FRAME;\n localsSize = clocalsSize;\n break;\n case 0:\n type = delta < 64 ? SAME_FRAME : SAME_FRAME_EXTENDED;\n break;\n case 1:\n case 2:\n case 3:\n type = APPEND_FRAME;\n break;\n }\n } else if (clocalsSize == localsSize && cstackSize == 1) {\n type = delta < 63 ? SAME_LOCALS_1_STACK_ITEM_FRAME\n : SAME_LOCALS_1_STACK_ITEM_FRAME_EXTENDED;\n }\n if (type != FULL_FRAME) {\n // verify if locals are the same\n int l = 3;\n for (int j = 0; j < localsSize; j++) {\n if (frame[l] != previousFrame[l]) {\n type = FULL_FRAME;\n break;\n }\n l++;\n }\n }\n switch (type) {\n case SAME_FRAME:\n stackMap.putByte(delta);\n break;\n case SAME_LOCALS_1_STACK_ITEM_FRAME:\n stackMap.putByte(SAME_LOCALS_1_STACK_ITEM_FRAME + delta);\n writeFrameTypes(3 + clocalsSize, 4 + clocalsSize);\n break;\n case SAME_LOCALS_1_STACK_ITEM_FRAME_EXTENDED:\n stackMap.putByte(SAME_LOCALS_1_STACK_ITEM_FRAME_EXTENDED).putShort(\n delta);\n writeFrameTypes(3 + clocalsSize, 4 + clocalsSize);\n break;\n case SAME_FRAME_EXTENDED:\n stackMap.putByte(SAME_FRAME_EXTENDED).putShort(delta);\n break;\n case CHOP_FRAME:\n stackMap.putByte(SAME_FRAME_EXTENDED + k).putShort(delta);\n break;\n case APPEND_FRAME:\n stackMap.putByte(SAME_FRAME_EXTENDED + k).putShort(delta);\n writeFrameTypes(3 + localsSize, 3 + clocalsSize);\n break;\n // case FULL_FRAME:\n default:\n stackMap.putByte(FULL_FRAME).putShort(delta).putShort(clocalsSize);\n writeFrameTypes(3, 3 + clocalsSize);\n stackMap.putShort(cstackSize);\n writeFrameTypes(3 + clocalsSize, 3 + clocalsSize + cstackSize);\n }\n }\n\n /**\n * Writes some types of the current frame {@link #frame} into the\n * StackMapTableAttribute. This method converts types from the format used\n * in {@link Label} to the format used in StackMapTable attributes. In\n * particular, it converts type table indexes to constant pool indexes.\n *\n * @param start\n * index of the first type in {@link #frame} to write.\n * @param end\n * index of last type in {@link #frame} to write (exclusive).\n */\n private void writeFrameTypes(final int start, final int end) {\n for (int i = start; i < end; ++i) {\n int t = frame[i];\n int d = t & Frame.DIM;\n if (d == 0) {\n int v = t & Frame.BASE_VALUE;\n switch (t & Frame.BASE_KIND) {\n case Frame.OBJECT:\n stackMap.putByte(7).putShort(\n cw.newClass(cw.typeTable[v].strVal1));\n break;\n case Frame.UNINITIALIZED:\n stackMap.putByte(8).putShort(cw.typeTable[v].intVal);\n break;\n default:\n stackMap.putByte(v);\n }\n } else {\n StringBuffer buf = new StringBuffer();\n d >>= 28;\n while (d-- > 0) {\n buf.append('[');\n }\n if ((t & Frame.BASE_KIND) == Frame.OBJECT) {\n buf.append('L');\n buf.append(cw.typeTable[t & Frame.BASE_VALUE].strVal1);\n buf.append(';');\n } else {\n switch (t & 0xF) {\n case 1:\n buf.append('I');\n break;\n case 2:\n buf.append('F');\n break;\n case 3:\n buf.append('D');\n break;\n case 9:\n buf.append('Z');\n break;\n case 10:\n buf.append('B');\n break;\n case 11:\n buf.append('C');\n break;\n case 12:\n buf.append('S');\n break;\n default:\n buf.append('J');\n }\n }\n stackMap.putByte(7).putShort(cw.newClass(buf.toString()));\n }\n }\n }\n\n private void writeFrameType(final Object type) {\n if (type instanceof String) {\n stackMap.putByte(7).putShort(cw.newClass((String) type));\n } else if (type instanceof Integer) {\n stackMap.putByte(((Integer) type).intValue());\n } else {\n stackMap.putByte(8).putShort(((Label) type).position);\n }\n }\n\n // ------------------------------------------------------------------------\n // Utility methods: dump bytecode array\n // ------------------------------------------------------------------------\n\n /**\n * Returns the size of the bytecode of this method.\n *\n * @return the size of the bytecode of this method.\n */\n final int getSize() {\n if (classReaderOffset != 0) {\n return 6 + classReaderLength;\n }\n if (resize) {\n // replaces the temporary jump opcodes introduced by Label.resolve.\n if (ClassReader.RESIZE) {\n resizeInstructions();\n } else {\n throw new RuntimeException(\"Method code too large!\");\n }\n }\n int size = 8;\n if (code.length > 0) {\n if (code.length > 65536) {\n throw new RuntimeException(\"Method code too large!\");\n }\n cw.newUTF8(\"Code\");\n size += 18 + code.length + 8 * handlerCount;\n if (localVar != null) {\n cw.newUTF8(\"LocalVariableTable\");\n size += 8 + localVar.length;\n }\n if (localVarType != null) {\n cw.newUTF8(\"LocalVariableTypeTable\");\n size += 8 + localVarType.length;\n }\n if (lineNumber != null) {\n cw.newUTF8(\"LineNumberTable\");\n size += 8 + lineNumber.length;\n }\n if (stackMap != null) {\n boolean zip = (cw.version & 0xFFFF) >= Opcodes.V1_6;\n cw.newUTF8(zip ? \"StackMapTable\" : \"StackMap\");\n size += 8 + stackMap.length;\n }\n if (cattrs != null) {\n size += cattrs.getSize(cw, code.data, code.length, maxStack,\n maxLocals);\n }\n }\n if (exceptionCount > 0) {\n cw.newUTF8(\"Exceptions\");\n size += 8 + 2 * exceptionCount;\n }\n if ((access & Opcodes.ACC_SYNTHETIC) != 0) {\n if ((cw.version & 0xFFFF) < Opcodes.V1_5\n || (access & ClassWriter.ACC_SYNTHETIC_ATTRIBUTE) != 0) {\n cw.newUTF8(\"Synthetic\");\n size += 6;\n }\n }\n if ((access & Opcodes.ACC_DEPRECATED) != 0) {\n cw.newUTF8(\"Deprecated\");\n size += 6;\n }\n if (ClassReader.SIGNATURES && signature != null) {\n cw.newUTF8(\"Signature\");\n cw.newUTF8(signature);\n size += 8;\n }\n if (ClassReader.ANNOTATIONS && annd != null) {\n cw.newUTF8(\"AnnotationDefault\");\n size += 6 + annd.length;\n }\n if (ClassReader.ANNOTATIONS && anns != null) {\n cw.newUTF8(\"RuntimeVisibleAnnotations\");\n size += 8 + anns.getSize();\n }\n if (ClassReader.ANNOTATIONS && ianns != null) {\n cw.newUTF8(\"RuntimeInvisibleAnnotations\");\n size += 8 + ianns.getSize();\n }\n if (ClassReader.ANNOTATIONS && panns != null) {\n cw.newUTF8(\"RuntimeVisibleParameterAnnotations\");\n size += 7 + 2 * (panns.length - synthetics);\n for (int i = panns.length - 1; i >= synthetics; --i) {\n size += panns[i] == null ? 0 : panns[i].getSize();\n }\n }\n if (ClassReader.ANNOTATIONS && ipanns != null) {\n cw.newUTF8(\"RuntimeInvisibleParameterAnnotations\");\n size += 7 + 2 * (ipanns.length - synthetics);\n for (int i = ipanns.length - 1; i >= synthetics; --i) {\n size += ipanns[i] == null ? 0 : ipanns[i].getSize();\n }\n }\n if (attrs != null) {\n size += attrs.getSize(cw, null, 0, -1, -1);\n }\n return size;\n }\n\n /**\n * Puts the bytecode of this method in the given byte vector.\n *\n * @param out\n * the byte vector into which the bytecode of this method must be\n * copied.\n */\n final void put(final ByteVector out) {\n final int FACTOR = ClassWriter.TO_ACC_SYNTHETIC;\n int mask = ACC_CONSTRUCTOR | Opcodes.ACC_DEPRECATED\n | ClassWriter.ACC_SYNTHETIC_ATTRIBUTE\n | ((access & ClassWriter.ACC_SYNTHETIC_ATTRIBUTE) / FACTOR);\n out.putShort(access & ~mask).putShort(name).putShort(desc);\n if (classReaderOffset != 0) {\n out.putByteArray(cw.cr.b, classReaderOffset, classReaderLength);\n return;\n }\n int attributeCount = 0;\n if (code.length > 0) {\n ++attributeCount;\n }\n if (exceptionCount > 0) {\n ++attributeCount;\n }\n if ((access & Opcodes.ACC_SYNTHETIC) != 0) {\n if ((cw.version & 0xFFFF) < Opcodes.V1_5\n || (access & ClassWriter.ACC_SYNTHETIC_ATTRIBUTE) != 0) {\n ++attributeCount;\n }\n }\n if ((access & Opcodes.ACC_DEPRECATED) != 0) {\n ++attributeCount;\n }\n if (ClassReader.SIGNATURES && signature != null) {\n ++attributeCount;\n }\n if (ClassReader.ANNOTATIONS && annd != null) {\n ++attributeCount;\n }\n if (ClassReader.ANNOTATIONS && anns != null) {\n ++attributeCount;\n }\n if (ClassReader.ANNOTATIONS && ianns != null) {\n ++attributeCount;\n }\n if (ClassReader.ANNOTATIONS && panns != null) {\n ++attributeCount;\n }\n if (ClassReader.ANNOTATIONS && ipanns != null) {\n ++attributeCount;\n }\n if (attrs != null) {\n attributeCount += attrs.getCount();\n }\n out.putShort(attributeCount);\n if (code.length > 0) {\n int size = 12 + code.length + 8 * handlerCount;\n if (localVar != null) {\n size += 8 + localVar.length;\n }\n if (localVarType != null) {\n size += 8 + localVarType.length;\n }\n if (lineNumber != null) {\n size += 8 + lineNumber.length;\n }\n if (stackMap != null) {\n size += 8 + stackMap.length;\n }\n if (cattrs != null) {\n size += cattrs.getSize(cw, code.data, code.length, maxStack,\n maxLocals);\n }\n out.putShort(cw.newUTF8(\"Code\")).putInt(size);\n out.putShort(maxStack).putShort(maxLocals);\n out.putInt(code.length).putByteArray(code.data, 0, code.length);\n out.putShort(handlerCount);\n if (handlerCount > 0) {\n Handler h = firstHandler;\n while (h != null) {\n out.putShort(h.start.position).putShort(h.end.position)\n .putShort(h.handler.position).putShort(h.type);\n h = h.next;\n }\n }\n attributeCount = 0;\n if (localVar != null) {\n ++attributeCount;\n }\n if (localVarType != null) {\n ++attributeCount;\n }\n if (lineNumber != null) {\n ++attributeCount;\n }\n if (stackMap != null) {\n ++attributeCount;\n }\n if (cattrs != null) {\n attributeCount += cattrs.getCount();\n }\n out.putShort(attributeCount);\n if (localVar != null) {\n out.putShort(cw.newUTF8(\"LocalVariableTable\"));\n out.putInt(localVar.length + 2).putShort(localVarCount);\n out.putByteArray(localVar.data, 0, localVar.length);\n }\n if (localVarType != null) {\n out.putShort(cw.newUTF8(\"LocalVariableTypeTable\"));\n out.putInt(localVarType.length + 2).putShort(localVarTypeCount);\n out.putByteArray(localVarType.data, 0, localVarType.length);\n }\n if (lineNumber != null) {\n out.putShort(cw.newUTF8(\"LineNumberTable\"));\n out.putInt(lineNumber.length + 2).putShort(lineNumberCount);\n out.putByteArray(lineNumber.data, 0, lineNumber.length);\n }\n if (stackMap != null) {\n boolean zip = (cw.version & 0xFFFF) >= Opcodes.V1_6;\n out.putShort(cw.newUTF8(zip ? \"StackMapTable\" : \"StackMap\"));\n out.putInt(stackMap.length + 2).putShort(frameCount);\n out.putByteArray(stackMap.data, 0, stackMap.length);\n }\n if (cattrs != null) {\n cattrs.put(cw, code.data, code.length, maxLocals, maxStack, out);\n }\n }\n if (exceptionCount > 0) {\n out.putShort(cw.newUTF8(\"Exceptions\")).putInt(\n 2 * exceptionCount + 2);\n out.putShort(exceptionCount);\n for (int i = 0; i < exceptionCount; ++i) {\n out.putShort(exceptions[i]);\n }\n }\n if ((access & Opcodes.ACC_SYNTHETIC) != 0) {\n if ((cw.version & 0xFFFF) < Opcodes.V1_5\n || (access & ClassWriter.ACC_SYNTHETIC_ATTRIBUTE) != 0) {\n out.putShort(cw.newUTF8(\"Synthetic\")).putInt(0);\n }\n }\n if ((access & Opcodes.ACC_DEPRECATED) != 0) {\n out.putShort(cw.newUTF8(\"Deprecated\")).putInt(0);\n }\n if (ClassReader.SIGNATURES && signature != null) {\n out.putShort(cw.newUTF8(\"Signature\")).putInt(2)\n .putShort(cw.newUTF8(signature));\n }\n if (ClassReader.ANNOTATIONS && annd != null) {\n out.putShort(cw.newUTF8(\"AnnotationDefault\"));\n out.putInt(annd.length);\n out.putByteArray(annd.data, 0, annd.length);\n }\n if (ClassReader.ANNOTATIONS && anns != null) {\n out.putShort(cw.newUTF8(\"RuntimeVisibleAnnotations\"));\n anns.put(out);\n }\n if (ClassReader.ANNOTATIONS && ianns != null) {\n out.putShort(cw.newUTF8(\"RuntimeInvisibleAnnotations\"));\n ianns.put(out);\n }\n if (ClassReader.ANNOTATIONS && panns != null) {\n out.putShort(cw.newUTF8(\"RuntimeVisibleParameterAnnotations\"));\n AnnotationWriter.put(panns, synthetics, out);\n }\n if (ClassReader.ANNOTATIONS && ipanns != null) {\n out.putShort(cw.newUTF8(\"RuntimeInvisibleParameterAnnotations\"));\n AnnotationWriter.put(ipanns, synthetics, out);\n }\n if (attrs != null) {\n attrs.put(cw, null, 0, -1, -1, out);\n }\n }\n\n // ------------------------------------------------------------------------\n // Utility methods: instruction resizing (used to handle GOTO_W and JSR_W)\n // ------------------------------------------------------------------------\n\n /**\n * Resizes and replaces the temporary instructions inserted by\n * {@link Label#resolve} for wide forward jumps, while keeping jump offsets\n * and instruction addresses consistent. This may require to resize other\n * existing instructions, or even to introduce new instructions: for\n * example, increasing the size of an instruction by 2 at the middle of a\n * method can increases the offset of an IFEQ instruction from 32766 to\n * 32768, in which case IFEQ 32766 must be replaced with IFNEQ 8 GOTO_W\n * 32765. This, in turn, may require to increase the size of another jump\n * instruction, and so on... All these operations are handled automatically\n * by this method.\n *

\n * This method must be called after all the method that is being built\n * has been visited. In particular, the {@link Label Label} objects used\n * to construct the method are no longer valid after this method has been\n * called.\n */\n private void resizeInstructions() {\n byte[] b = code.data; // bytecode of the method\n int u, v, label; // indexes in b\n int i, j; // loop indexes\n /*\n * 1st step: As explained above, resizing an instruction may require to\n * resize another one, which may require to resize yet another one, and\n * so on. The first step of the algorithm consists in finding all the\n * instructions that need to be resized, without modifying the code.\n * This is done by the following \"fix point\" algorithm:\n *\n * Parse the code to find the jump instructions whose offset will need\n * more than 2 bytes to be stored (the future offset is computed from\n * the current offset and from the number of bytes that will be inserted\n * or removed between the source and target instructions). For each such\n * instruction, adds an entry in (a copy of) the indexes and sizes\n * arrays (if this has not already been done in a previous iteration!).\n *\n * If at least one entry has been added during the previous step, go\n * back to the beginning, otherwise stop.\n *\n * In fact the real algorithm is complicated by the fact that the size\n * of TABLESWITCH and LOOKUPSWITCH instructions depends on their\n * position in the bytecode (because of padding). In order to ensure the\n * convergence of the algorithm, the number of bytes to be added or\n * removed from these instructions is over estimated during the previous\n * loop, and computed exactly only after the loop is finished (this\n * requires another pass to parse the bytecode of the method).\n */\n int[] allIndexes = new int[0]; // copy of indexes\n int[] allSizes = new int[0]; // copy of sizes\n boolean[] resize; // instructions to be resized\n int newOffset; // future offset of a jump instruction\n\n resize = new boolean[code.length];\n\n // 3 = loop again, 2 = loop ended, 1 = last pass, 0 = done\n int state = 3;\n do {\n if (state == 3) {\n state = 2;\n }\n u = 0;\n while (u < b.length) {\n int opcode = b[u] & 0xFF; // opcode of current instruction\n int insert = 0; // bytes to be added after this instruction\n\n switch (ClassWriter.TYPE[opcode]) {\n case ClassWriter.NOARG_INSN:\n case ClassWriter.IMPLVAR_INSN:\n u += 1;\n break;\n case ClassWriter.LABEL_INSN:\n if (opcode > 201) {\n // converts temporary opcodes 202 to 217, 218 and\n // 219 to IFEQ ... JSR (inclusive), IFNULL and\n // IFNONNULL\n opcode = opcode < 218 ? opcode - 49 : opcode - 20;\n label = u + readUnsignedShort(b, u + 1);\n } else {\n label = u + readShort(b, u + 1);\n }\n newOffset = getNewOffset(allIndexes, allSizes, u, label);\n if (newOffset < Short.MIN_VALUE\n || newOffset > Short.MAX_VALUE) {\n if (!resize[u]) {\n if (opcode == Opcodes.GOTO || opcode == Opcodes.JSR) {\n // two additional bytes will be required to\n // replace this GOTO or JSR instruction with\n // a GOTO_W or a JSR_W\n insert = 2;\n } else {\n // five additional bytes will be required to\n // replace this IFxxx instruction with\n // IFNOTxxx GOTO_W , where IFNOTxxx\n // is the \"opposite\" opcode of IFxxx (i.e.,\n // IFNE for IFEQ) and where designates\n // the instruction just after the GOTO_W.\n insert = 5;\n }\n resize[u] = true;\n }\n }\n u += 3;\n break;\n case ClassWriter.LABELW_INSN:\n u += 5;\n break;\n case ClassWriter.TABL_INSN:\n if (state == 1) {\n // true number of bytes to be added (or removed)\n // from this instruction = (future number of padding\n // bytes - current number of padding byte) -\n // previously over estimated variation =\n // = ((3 - newOffset%4) - (3 - u%4)) - u%4\n // = (-newOffset%4 + u%4) - u%4\n // = -(newOffset & 3)\n newOffset = getNewOffset(allIndexes, allSizes, 0, u);\n insert = -(newOffset & 3);\n } else if (!resize[u]) {\n // over estimation of the number of bytes to be\n // added to this instruction = 3 - current number\n // of padding bytes = 3 - (3 - u%4) = u%4 = u & 3\n insert = u & 3;\n resize[u] = true;\n }\n // skips instruction\n u = u + 4 - (u & 3);\n u += 4 * (readInt(b, u + 8) - readInt(b, u + 4) + 1) + 12;\n break;\n case ClassWriter.LOOK_INSN:\n if (state == 1) {\n // like TABL_INSN\n newOffset = getNewOffset(allIndexes, allSizes, 0, u);\n insert = -(newOffset & 3);\n } else if (!resize[u]) {\n // like TABL_INSN\n insert = u & 3;\n resize[u] = true;\n }\n // skips instruction\n u = u + 4 - (u & 3);\n u += 8 * readInt(b, u + 4) + 8;\n break;\n case ClassWriter.WIDE_INSN:\n opcode = b[u + 1] & 0xFF;\n if (opcode == Opcodes.IINC) {\n u += 6;\n } else {\n u += 4;\n }\n break;\n case ClassWriter.VAR_INSN:\n case ClassWriter.SBYTE_INSN:\n case ClassWriter.LDC_INSN:\n u += 2;\n break;\n case ClassWriter.SHORT_INSN:\n case ClassWriter.LDCW_INSN:\n case ClassWriter.FIELDORMETH_INSN:\n case ClassWriter.TYPE_INSN:\n case ClassWriter.IINC_INSN:\n u += 3;\n break;\n case ClassWriter.ITFMETH_INSN:\n case ClassWriter.INDYMETH_INSN:\n u += 5;\n break;\n // case ClassWriter.MANA_INSN:\n default:\n u += 4;\n break;\n }\n if (insert != 0) {\n // adds a new (u, insert) entry in the allIndexes and\n // allSizes arrays\n int[] newIndexes = new int[allIndexes.length + 1];\n int[] newSizes = new int[allSizes.length + 1];\n System.arraycopy(allIndexes, 0, newIndexes, 0,\n allIndexes.length);\n System.arraycopy(allSizes, 0, newSizes, 0, allSizes.length);\n newIndexes[allIndexes.length] = u;\n newSizes[allSizes.length] = insert;\n allIndexes = newIndexes;\n allSizes = newSizes;\n if (insert > 0) {\n state = 3;\n }\n }\n }\n if (state < 3) {\n --state;\n }\n } while (state != 0);\n\n // 2nd step:\n // copies the bytecode of the method into a new bytevector, updates the\n // offsets, and inserts (or removes) bytes as requested.\n\n ByteVector newCode = new ByteVector(code.length);\n\n u = 0;\n while (u < code.length) {\n int opcode = b[u] & 0xFF;\n switch (ClassWriter.TYPE[opcode]) {\n case ClassWriter.NOARG_INSN:\n case ClassWriter.IMPLVAR_INSN:\n newCode.putByte(opcode);\n u += 1;\n break;\n case ClassWriter.LABEL_INSN:\n if (opcode > 201) {\n // changes temporary opcodes 202 to 217 (inclusive), 218\n // and 219 to IFEQ ... JSR (inclusive), IFNULL and\n // IFNONNULL\n opcode = opcode < 218 ? opcode - 49 : opcode - 20;\n label = u + readUnsignedShort(b, u + 1);\n } else {\n label = u + readShort(b, u + 1);\n }\n newOffset = getNewOffset(allIndexes, allSizes, u, label);\n if (resize[u]) {\n // replaces GOTO with GOTO_W, JSR with JSR_W and IFxxx\n // with IFNOTxxx GOTO_W , where IFNOTxxx is\n // the \"opposite\" opcode of IFxxx (i.e., IFNE for IFEQ)\n // and where designates the instruction just after\n // the GOTO_W.\n if (opcode == Opcodes.GOTO) {\n newCode.putByte(200); // GOTO_W\n } else if (opcode == Opcodes.JSR) {\n newCode.putByte(201); // JSR_W\n } else {\n newCode.putByte(opcode <= 166 ? ((opcode + 1) ^ 1) - 1\n : opcode ^ 1);\n newCode.putShort(8); // jump offset\n newCode.putByte(200); // GOTO_W\n // newOffset now computed from start of GOTO_W\n newOffset -= 3;\n }\n newCode.putInt(newOffset);\n } else {\n newCode.putByte(opcode);\n newCode.putShort(newOffset);\n }\n u += 3;\n break;\n case ClassWriter.LABELW_INSN:\n label = u + readInt(b, u + 1);\n newOffset = getNewOffset(allIndexes, allSizes, u, label);\n newCode.putByte(opcode);\n newCode.putInt(newOffset);\n u += 5;\n break;\n case ClassWriter.TABL_INSN:\n // skips 0 to 3 padding bytes\n v = u;\n u = u + 4 - (v & 3);\n // reads and copies instruction\n newCode.putByte(Opcodes.TABLESWITCH);\n newCode.putByteArray(null, 0, (4 - newCode.length % 4) % 4);\n label = v + readInt(b, u);\n u += 4;\n newOffset = getNewOffset(allIndexes, allSizes, v, label);\n newCode.putInt(newOffset);\n j = readInt(b, u);\n u += 4;\n newCode.putInt(j);\n j = readInt(b, u) - j + 1;\n u += 4;\n newCode.putInt(readInt(b, u - 4));\n for (; j > 0; --j) {\n label = v + readInt(b, u);\n u += 4;\n newOffset = getNewOffset(allIndexes, allSizes, v, label);\n newCode.putInt(newOffset);\n }\n break;\n case ClassWriter.LOOK_INSN:\n // skips 0 to 3 padding bytes\n v = u;\n u = u + 4 - (v & 3);\n // reads and copies instruction\n newCode.putByte(Opcodes.LOOKUPSWITCH);\n newCode.putByteArray(null, 0, (4 - newCode.length % 4) % 4);\n label = v + readInt(b, u);\n u += 4;\n newOffset = getNewOffset(allIndexes, allSizes, v, label);\n newCode.putInt(newOffset);\n j = readInt(b, u);\n u += 4;\n newCode.putInt(j);\n for (; j > 0; --j) {\n newCode.putInt(readInt(b, u));\n u += 4;\n label = v + readInt(b, u);\n u += 4;\n newOffset = getNewOffset(allIndexes, allSizes, v, label);\n newCode.putInt(newOffset);\n }\n break;\n case ClassWriter.WIDE_INSN:\n opcode = b[u + 1] & 0xFF;\n if (opcode == Opcodes.IINC) {\n newCode.putByteArray(b, u, 6);\n u += 6;\n } else {\n newCode.putByteArray(b, u, 4);\n u += 4;\n }\n break;\n case ClassWriter.VAR_INSN:\n case ClassWriter.SBYTE_INSN:\n case ClassWriter.LDC_INSN:\n newCode.putByteArray(b, u, 2);\n u += 2;\n break;\n case ClassWriter.SHORT_INSN:\n case ClassWriter.LDCW_INSN:\n case ClassWriter.FIELDORMETH_INSN:\n case ClassWriter.TYPE_INSN:\n case ClassWriter.IINC_INSN:\n newCode.putByteArray(b, u, 3);\n u += 3;\n break;\n case ClassWriter.ITFMETH_INSN:\n case ClassWriter.INDYMETH_INSN:\n newCode.putByteArray(b, u, 5);\n u += 5;\n break;\n // case MANA_INSN:\n default:\n newCode.putByteArray(b, u, 4);\n u += 4;\n break;\n }\n }\n\n // recomputes the stack map frames\n if (frameCount > 0) {\n if (compute == FRAMES) {\n frameCount = 0;\n stackMap = null;\n previousFrame = null;\n frame = null;\n Frame f = new Frame();\n f.owner = labels;\n Type[] args = Type.getArgumentTypes(descriptor);\n f.initInputFrame(cw, access, args, maxLocals);\n visitFrame(f);\n Label l = labels;\n while (l != null) {\n /*\n * here we need the original label position. getNewOffset\n * must therefore never have been called for this label.\n */\n u = l.position - 3;\n if ((l.status & Label.STORE) != 0 || (u >= 0 && resize[u])) {\n getNewOffset(allIndexes, allSizes, l);\n // TODO update offsets in UNINITIALIZED values\n visitFrame(l.frame);\n }\n l = l.successor;\n }\n } else {\n /*\n * Resizing an existing stack map frame table is really hard.\n * Not only the table must be parsed to update the offets, but\n * new frames may be needed for jump instructions that were\n * inserted by this method. And updating the offsets or\n * inserting frames can change the format of the following\n * frames, in case of packed frames. In practice the whole table\n * must be recomputed. For this the frames are marked as\n * potentially invalid. This will cause the whole class to be\n * reread and rewritten with the COMPUTE_FRAMES option (see the\n * ClassWriter.toByteArray method). This is not very efficient\n * but is much easier and requires much less code than any other\n * method I can think of.\n */\n cw.invalidFrames = true;\n }\n }\n // updates the exception handler block labels\n Handler h = firstHandler;\n while (h != null) {\n getNewOffset(allIndexes, allSizes, h.start);\n getNewOffset(allIndexes, allSizes, h.end);\n getNewOffset(allIndexes, allSizes, h.handler);\n h = h.next;\n }\n // updates the instructions addresses in the\n // local var and line number tables\n for (i = 0; i < 2; ++i) {\n ByteVector bv = i == 0 ? localVar : localVarType;\n if (bv != null) {\n b = bv.data;\n u = 0;\n while (u < bv.length) {\n label = readUnsignedShort(b, u);\n newOffset = getNewOffset(allIndexes, allSizes, 0, label);\n writeShort(b, u, newOffset);\n label += readUnsignedShort(b, u + 2);\n newOffset = getNewOffset(allIndexes, allSizes, 0, label)\n - newOffset;\n writeShort(b, u + 2, newOffset);\n u += 10;\n }\n }\n }\n if (lineNumber != null) {\n b = lineNumber.data;\n u = 0;\n while (u < lineNumber.length) {\n writeShort(\n b,\n u,\n getNewOffset(allIndexes, allSizes, 0,\n readUnsignedShort(b, u)));\n u += 4;\n }\n }\n // updates the labels of the other attributes\n Attribute attr = cattrs;\n while (attr != null) {\n Label[] labels = attr.getLabels();\n if (labels != null) {\n for (i = labels.length - 1; i >= 0; --i) {\n getNewOffset(allIndexes, allSizes, labels[i]);\n }\n }\n attr = attr.next;\n }\n\n // replaces old bytecodes with new ones\n code = newCode;\n }\n\n /**\n * Reads an unsigned short value in the given byte array.\n *\n * @param b\n * a byte array.\n * @param index\n * the start index of the value to be read.\n * @return the read value.\n */\n static int readUnsignedShort(final byte[] b, final int index) {\n return ((b[index] & 0xFF) << 8) | (b[index + 1] & 0xFF);\n }\n\n /**\n * Reads a signed short value in the given byte array.\n *\n * @param b\n * a byte array.\n * @param index\n * the start index of the value to be read.\n * @return the read value.\n */\n static short readShort(final byte[] b, final int index) {\n return (short) (((b[index] & 0xFF) << 8) | (b[index + 1] & 0xFF));\n }\n\n /**\n * Reads a signed int value in the given byte array.\n *\n * @param b\n * a byte array.\n * @param index\n * the start index of the value to be read.\n * @return the read value.\n */\n static int readInt(final byte[] b, final int index) {\n return ((b[index] & 0xFF) << 24) | ((b[index + 1] & 0xFF) << 16)\n | ((b[index + 2] & 0xFF) << 8) | (b[index + 3] & 0xFF);\n }\n\n /**\n * Writes a short value in the given byte array.\n *\n * @param b\n * a byte array.\n * @param index\n * where the first byte of the short value must be written.\n * @param s\n * the value to be written in the given byte array.\n */\n static void writeShort(final byte[] b, final int index, final int s) {\n b[index] = (byte) (s >>> 8);\n b[index + 1] = (byte) s;\n }\n\n /**\n * Computes the future value of a bytecode offset.\n *

\n * Note: it is possible to have several entries for the same instruction in\n * the indexes and sizes: two entries (index=a,size=b) and\n * (index=a,size=b') are equivalent to a single entry (index=a,size=b+b').\n *\n * @param indexes\n * current positions of the instructions to be resized. Each\n * instruction must be designated by the index of its last\n * byte, plus one (or, in other words, by the index of the\n * first byte of the next instruction).\n * @param sizes\n * the number of bytes to be added to the above\n * instructions. More precisely, for each i < len,\n * sizes[i] bytes will be added at the end of the\n * instruction designated by indexes[i] or, if\n * sizes[i] is negative, the last |\n * sizes[i]| bytes of the instruction will be removed\n * (the instruction size must not become negative or\n * null).\n * @param begin\n * index of the first byte of the source instruction.\n * @param end\n * index of the first byte of the target instruction.\n * @return the future value of the given bytecode offset.\n */\n static int getNewOffset(final int[] indexes, final int[] sizes,\n final int begin, final int end) {\n int offset = end - begin;\n for (int i = 0; i < indexes.length; ++i) {\n if (begin < indexes[i] && indexes[i] <= end) {\n // forward jump\n offset += sizes[i];\n } else if (end < indexes[i] && indexes[i] <= begin) {\n // backward jump\n offset -= sizes[i];\n }\n }\n return offset;\n }\n\n /**\n * Updates the offset of the given label.\n *\n * @param indexes\n * current positions of the instructions to be resized. Each\n * instruction must be designated by the index of its last\n * byte, plus one (or, in other words, by the index of the\n * first byte of the next instruction).\n * @param sizes\n * the number of bytes to be added to the above\n * instructions. More precisely, for each i < len,\n * sizes[i] bytes will be added at the end of the\n * instruction designated by indexes[i] or, if\n * sizes[i] is negative, the last |\n * sizes[i]| bytes of the instruction will be removed\n * (the instruction size must not become negative or\n * null).\n * @param label\n * the label whose offset must be updated.\n */\n static void getNewOffset(final int[] indexes, final int[] sizes,\n final Label label) {\n if ((label.status & Label.RESIZED) == 0) {\n label.position = getNewOffset(indexes, sizes, 0, label.position);\n label.status |= Label.RESIZED;\n }\n }\n}\n" }, { "path": "src/jvm/clojure/asm/Opcodes.java", "content": "/***\n * ASM: a very small and fast Java bytecode manipulation framework\n * Copyright (c) 2000-2011 INRIA, France Telecom\n * All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions\n * are met:\n * 1. Redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer.\n * 2. Redistributions in binary form must reproduce the above copyright\n * notice, this list of conditions and the following disclaimer in the\n * documentation and/or other materials provided with the distribution.\n * 3. Neither the name of the copyright holders nor the names of its\n * contributors may be used to endorse or promote products derived from\n * this software without specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\n * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\n * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE\n * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR\n * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF\n * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\n * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN\n * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\n * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF\n * THE POSSIBILITY OF SUCH DAMAGE.\n */\npackage clojure.asm;\n\n/**\n * Defines the JVM opcodes, access flags and array type codes. This interface\n * does not define all the JVM opcodes because some opcodes are automatically\n * handled. For example, the xLOAD and xSTORE opcodes are automatically replaced\n * by xLOAD_n and xSTORE_n opcodes when possible. The xLOAD_n and xSTORE_n\n * opcodes are therefore not defined in this interface. Likewise for LDC,\n * automatically replaced by LDC_W or LDC2_W when necessary, WIDE, GOTO_W and\n * JSR_W.\n *\n * @author Eric Bruneton\n * @author Eugene Kuleshov\n */\npublic interface Opcodes {\n\n // ASM API versions\n\n int ASM4 = 4 << 16 | 0 << 8 | 0;\n\n // versions\n\n int V1_1 = 3 << 16 | 45;\n int V1_2 = 0 << 16 | 46;\n int V1_3 = 0 << 16 | 47;\n int V1_4 = 0 << 16 | 48;\n int V1_5 = 0 << 16 | 49;\n int V1_6 = 0 << 16 | 50;\n int V1_7 = 0 << 16 | 51;\n\n // access flags\n\n int ACC_PUBLIC = 0x0001; // class, field, method\n int ACC_PRIVATE = 0x0002; // class, field, method\n int ACC_PROTECTED = 0x0004; // class, field, method\n int ACC_STATIC = 0x0008; // field, method\n int ACC_FINAL = 0x0010; // class, field, method\n int ACC_SUPER = 0x0020; // class\n int ACC_SYNCHRONIZED = 0x0020; // method\n int ACC_VOLATILE = 0x0040; // field\n int ACC_BRIDGE = 0x0040; // method\n int ACC_VARARGS = 0x0080; // method\n int ACC_TRANSIENT = 0x0080; // field\n int ACC_NATIVE = 0x0100; // method\n int ACC_INTERFACE = 0x0200; // class\n int ACC_ABSTRACT = 0x0400; // class, method\n int ACC_STRICT = 0x0800; // method\n int ACC_SYNTHETIC = 0x1000; // class, field, method\n int ACC_ANNOTATION = 0x2000; // class\n int ACC_ENUM = 0x4000; // class(?) field inner\n\n // ASM specific pseudo access flags\n\n int ACC_DEPRECATED = 0x20000; // class, field, method\n\n // types for NEWARRAY\n\n int T_BOOLEAN = 4;\n int T_CHAR = 5;\n int T_FLOAT = 6;\n int T_DOUBLE = 7;\n int T_BYTE = 8;\n int T_SHORT = 9;\n int T_INT = 10;\n int T_LONG = 11;\n\n // tags for Handle\n\n int H_GETFIELD = 1;\n int H_GETSTATIC = 2;\n int H_PUTFIELD = 3;\n int H_PUTSTATIC = 4;\n int H_INVOKEVIRTUAL = 5;\n int H_INVOKESTATIC = 6;\n int H_INVOKESPECIAL = 7;\n int H_NEWINVOKESPECIAL = 8;\n int H_INVOKEINTERFACE = 9;\n\n // stack map frame types\n\n /**\n * Represents an expanded frame. See {@link ClassReader#EXPAND_FRAMES}.\n */\n int F_NEW = -1;\n\n /**\n * Represents a compressed frame with complete frame data.\n */\n int F_FULL = 0;\n\n /**\n * Represents a compressed frame where locals are the same as the locals in\n * the previous frame, except that additional 1-3 locals are defined, and\n * with an empty stack.\n */\n int F_APPEND = 1;\n\n /**\n * Represents a compressed frame where locals are the same as the locals in\n * the previous frame, except that the last 1-3 locals are absent and with\n * an empty stack.\n */\n int F_CHOP = 2;\n\n /**\n * Represents a compressed frame with exactly the same locals as the\n * previous frame and with an empty stack.\n */\n int F_SAME = 3;\n\n /**\n * Represents a compressed frame with exactly the same locals as the\n * previous frame and with a single value on the stack.\n */\n int F_SAME1 = 4;\n\n Integer TOP = new Integer(0);\n Integer INTEGER = new Integer(1);\n Integer FLOAT = new Integer(2);\n Integer DOUBLE = new Integer(3);\n Integer LONG = new Integer(4);\n Integer NULL = new Integer(5);\n Integer UNINITIALIZED_THIS = new Integer(6);\n\n // opcodes // visit method (- = idem)\n\n int NOP = 0; // visitInsn\n int ACONST_NULL = 1; // -\n int ICONST_M1 = 2; // -\n int ICONST_0 = 3; // -\n int ICONST_1 = 4; // -\n int ICONST_2 = 5; // -\n int ICONST_3 = 6; // -\n int ICONST_4 = 7; // -\n int ICONST_5 = 8; // -\n int LCONST_0 = 9; // -\n int LCONST_1 = 10; // -\n int FCONST_0 = 11; // -\n int FCONST_1 = 12; // -\n int FCONST_2 = 13; // -\n int DCONST_0 = 14; // -\n int DCONST_1 = 15; // -\n int BIPUSH = 16; // visitIntInsn\n int SIPUSH = 17; // -\n int LDC = 18; // visitLdcInsn\n // int LDC_W = 19; // -\n // int LDC2_W = 20; // -\n int ILOAD = 21; // visitVarInsn\n int LLOAD = 22; // -\n int FLOAD = 23; // -\n int DLOAD = 24; // -\n int ALOAD = 25; // -\n // int ILOAD_0 = 26; // -\n // int ILOAD_1 = 27; // -\n // int ILOAD_2 = 28; // -\n // int ILOAD_3 = 29; // -\n // int LLOAD_0 = 30; // -\n // int LLOAD_1 = 31; // -\n // int LLOAD_2 = 32; // -\n // int LLOAD_3 = 33; // -\n // int FLOAD_0 = 34; // -\n // int FLOAD_1 = 35; // -\n // int FLOAD_2 = 36; // -\n // int FLOAD_3 = 37; // -\n // int DLOAD_0 = 38; // -\n // int DLOAD_1 = 39; // -\n // int DLOAD_2 = 40; // -\n // int DLOAD_3 = 41; // -\n // int ALOAD_0 = 42; // -\n // int ALOAD_1 = 43; // -\n // int ALOAD_2 = 44; // -\n // int ALOAD_3 = 45; // -\n int IALOAD = 46; // visitInsn\n int LALOAD = 47; // -\n int FALOAD = 48; // -\n int DALOAD = 49; // -\n int AALOAD = 50; // -\n int BALOAD = 51; // -\n int CALOAD = 52; // -\n int SALOAD = 53; // -\n int ISTORE = 54; // visitVarInsn\n int LSTORE = 55; // -\n int FSTORE = 56; // -\n int DSTORE = 57; // -\n int ASTORE = 58; // -\n // int ISTORE_0 = 59; // -\n // int ISTORE_1 = 60; // -\n // int ISTORE_2 = 61; // -\n // int ISTORE_3 = 62; // -\n // int LSTORE_0 = 63; // -\n // int LSTORE_1 = 64; // -\n // int LSTORE_2 = 65; // -\n // int LSTORE_3 = 66; // -\n // int FSTORE_0 = 67; // -\n // int FSTORE_1 = 68; // -\n // int FSTORE_2 = 69; // -\n // int FSTORE_3 = 70; // -\n // int DSTORE_0 = 71; // -\n // int DSTORE_1 = 72; // -\n // int DSTORE_2 = 73; // -\n // int DSTORE_3 = 74; // -\n // int ASTORE_0 = 75; // -\n // int ASTORE_1 = 76; // -\n // int ASTORE_2 = 77; // -\n // int ASTORE_3 = 78; // -\n int IASTORE = 79; // visitInsn\n int LASTORE = 80; // -\n int FASTORE = 81; // -\n int DASTORE = 82; // -\n int AASTORE = 83; // -\n int BASTORE = 84; // -\n int CASTORE = 85; // -\n int SASTORE = 86; // -\n int POP = 87; // -\n int POP2 = 88; // -\n int DUP = 89; // -\n int DUP_X1 = 90; // -\n int DUP_X2 = 91; // -\n int DUP2 = 92; // -\n int DUP2_X1 = 93; // -\n int DUP2_X2 = 94; // -\n int SWAP = 95; // -\n int IADD = 96; // -\n int LADD = 97; // -\n int FADD = 98; // -\n int DADD = 99; // -\n int ISUB = 100; // -\n int LSUB = 101; // -\n int FSUB = 102; // -\n int DSUB = 103; // -\n int IMUL = 104; // -\n int LMUL = 105; // -\n int FMUL = 106; // -\n int DMUL = 107; // -\n int IDIV = 108; // -\n int LDIV = 109; // -\n int FDIV = 110; // -\n int DDIV = 111; // -\n int IREM = 112; // -\n int LREM = 113; // -\n int FREM = 114; // -\n int DREM = 115; // -\n int INEG = 116; // -\n int LNEG = 117; // -\n int FNEG = 118; // -\n int DNEG = 119; // -\n int ISHL = 120; // -\n int LSHL = 121; // -\n int ISHR = 122; // -\n int LSHR = 123; // -\n int IUSHR = 124; // -\n int LUSHR = 125; // -\n int IAND = 126; // -\n int LAND = 127; // -\n int IOR = 128; // -\n int LOR = 129; // -\n int IXOR = 130; // -\n int LXOR = 131; // -\n int IINC = 132; // visitIincInsn\n int I2L = 133; // visitInsn\n int I2F = 134; // -\n int I2D = 135; // -\n int L2I = 136; // -\n int L2F = 137; // -\n int L2D = 138; // -\n int F2I = 139; // -\n int F2L = 140; // -\n int F2D = 141; // -\n int D2I = 142; // -\n int D2L = 143; // -\n int D2F = 144; // -\n int I2B = 145; // -\n int I2C = 146; // -\n int I2S = 147; // -\n int LCMP = 148; // -\n int FCMPL = 149; // -\n int FCMPG = 150; // -\n int DCMPL = 151; // -\n int DCMPG = 152; // -\n int IFEQ = 153; // visitJumpInsn\n int IFNE = 154; // -\n int IFLT = 155; // -\n int IFGE = 156; // -\n int IFGT = 157; // -\n int IFLE = 158; // -\n int IF_ICMPEQ = 159; // -\n int IF_ICMPNE = 160; // -\n int IF_ICMPLT = 161; // -\n int IF_ICMPGE = 162; // -\n int IF_ICMPGT = 163; // -\n int IF_ICMPLE = 164; // -\n int IF_ACMPEQ = 165; // -\n int IF_ACMPNE = 166; // -\n int GOTO = 167; // -\n int JSR = 168; // -\n int RET = 169; // visitVarInsn\n int TABLESWITCH = 170; // visiTableSwitchInsn\n int LOOKUPSWITCH = 171; // visitLookupSwitch\n int IRETURN = 172; // visitInsn\n int LRETURN = 173; // -\n int FRETURN = 174; // -\n int DRETURN = 175; // -\n int ARETURN = 176; // -\n int RETURN = 177; // -\n int GETSTATIC = 178; // visitFieldInsn\n int PUTSTATIC = 179; // -\n int GETFIELD = 180; // -\n int PUTFIELD = 181; // -\n int INVOKEVIRTUAL = 182; // visitMethodInsn\n int INVOKESPECIAL = 183; // -\n int INVOKESTATIC = 184; // -\n int INVOKEINTERFACE = 185; // -\n int INVOKEDYNAMIC = 186; // visitInvokeDynamicInsn\n int NEW = 187; // visitTypeInsn\n int NEWARRAY = 188; // visitIntInsn\n int ANEWARRAY = 189; // visitTypeInsn\n int ARRAYLENGTH = 190; // visitInsn\n int ATHROW = 191; // -\n int CHECKCAST = 192; // visitTypeInsn\n int INSTANCEOF = 193; // -\n int MONITORENTER = 194; // visitInsn\n int MONITOREXIT = 195; // -\n // int WIDE = 196; // NOT VISITED\n int MULTIANEWARRAY = 197; // visitMultiANewArrayInsn\n int IFNULL = 198; // visitJumpInsn\n int IFNONNULL = 199; // -\n // int GOTO_W = 200; // -\n // int JSR_W = 201; // -\n}\n" }, { "path": "src/jvm/clojure/asm/Type.java", "content": "/***\n * ASM: a very small and fast Java bytecode manipulation framework\n * Copyright (c) 2000-2011 INRIA, France Telecom\n * All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions\n * are met:\n * 1. Redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer.\n * 2. Redistributions in binary form must reproduce the above copyright\n * notice, this list of conditions and the following disclaimer in the\n * documentation and/or other materials provided with the distribution.\n * 3. Neither the name of the copyright holders nor the names of its\n * contributors may be used to endorse or promote products derived from\n * this software without specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\n * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\n * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE\n * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR\n * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF\n * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\n * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN\n * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\n * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF\n * THE POSSIBILITY OF SUCH DAMAGE.\n */\npackage clojure.asm;\n\nimport java.lang.reflect.Constructor;\nimport java.lang.reflect.Method;\n\n/**\n * A Java field or method type. This class can be used to make it easier to\n * manipulate type and method descriptors.\n *\n * @author Eric Bruneton\n * @author Chris Nokleberg\n */\npublic class Type {\n\n /**\n * The sort of the void type. See {@link #getSort getSort}.\n */\n public static final int VOID = 0;\n\n /**\n * The sort of the boolean type. See {@link #getSort getSort}.\n */\n public static final int BOOLEAN = 1;\n\n /**\n * The sort of the char type. See {@link #getSort getSort}.\n */\n public static final int CHAR = 2;\n\n /**\n * The sort of the byte type. See {@link #getSort getSort}.\n */\n public static final int BYTE = 3;\n\n /**\n * The sort of the short type. See {@link #getSort getSort}.\n */\n public static final int SHORT = 4;\n\n /**\n * The sort of the int type. See {@link #getSort getSort}.\n */\n public static final int INT = 5;\n\n /**\n * The sort of the float type. See {@link #getSort getSort}.\n */\n public static final int FLOAT = 6;\n\n /**\n * The sort of the long type. See {@link #getSort getSort}.\n */\n public static final int LONG = 7;\n\n /**\n * The sort of the double type. See {@link #getSort getSort}.\n */\n public static final int DOUBLE = 8;\n\n /**\n * The sort of array reference types. See {@link #getSort getSort}.\n */\n public static final int ARRAY = 9;\n\n /**\n * The sort of object reference types. See {@link #getSort getSort}.\n */\n public static final int OBJECT = 10;\n\n /**\n * The sort of method types. See {@link #getSort getSort}.\n */\n public static final int METHOD = 11;\n\n /**\n * The void type.\n */\n public static final Type VOID_TYPE = new Type(VOID, null, ('V' << 24)\n | (5 << 16) | (0 << 8) | 0, 1);\n\n /**\n * The boolean type.\n */\n public static final Type BOOLEAN_TYPE = new Type(BOOLEAN, null, ('Z' << 24)\n | (0 << 16) | (5 << 8) | 1, 1);\n\n /**\n * The char type.\n */\n public static final Type CHAR_TYPE = new Type(CHAR, null, ('C' << 24)\n | (0 << 16) | (6 << 8) | 1, 1);\n\n /**\n * The byte type.\n */\n public static final Type BYTE_TYPE = new Type(BYTE, null, ('B' << 24)\n | (0 << 16) | (5 << 8) | 1, 1);\n\n /**\n * The short type.\n */\n public static final Type SHORT_TYPE = new Type(SHORT, null, ('S' << 24)\n | (0 << 16) | (7 << 8) | 1, 1);\n\n /**\n * The int type.\n */\n public static final Type INT_TYPE = new Type(INT, null, ('I' << 24)\n | (0 << 16) | (0 << 8) | 1, 1);\n\n /**\n * The float type.\n */\n public static final Type FLOAT_TYPE = new Type(FLOAT, null, ('F' << 24)\n | (2 << 16) | (2 << 8) | 1, 1);\n\n /**\n * The long type.\n */\n public static final Type LONG_TYPE = new Type(LONG, null, ('J' << 24)\n | (1 << 16) | (1 << 8) | 2, 1);\n\n /**\n * The double type.\n */\n public static final Type DOUBLE_TYPE = new Type(DOUBLE, null, ('D' << 24)\n | (3 << 16) | (3 << 8) | 2, 1);\n\n // ------------------------------------------------------------------------\n // Fields\n // ------------------------------------------------------------------------\n\n /**\n * The sort of this Java type.\n */\n private final int sort;\n\n /**\n * A buffer containing the internal name of this Java type. This field is\n * only used for reference types.\n */\n private final char[] buf;\n\n /**\n * The offset of the internal name of this Java type in {@link #buf buf} or,\n * for primitive types, the size, descriptor and getOpcode offsets for this\n * type (byte 0 contains the size, byte 1 the descriptor, byte 2 the offset\n * for IALOAD or IASTORE, byte 3 the offset for all other instructions).\n */\n private final int off;\n\n /**\n * The length of the internal name of this Java type.\n */\n private final int len;\n\n // ------------------------------------------------------------------------\n // Constructors\n // ------------------------------------------------------------------------\n\n /**\n * Constructs a reference type.\n *\n * @param sort\n * the sort of the reference type to be constructed.\n * @param buf\n * a buffer containing the descriptor of the previous type.\n * @param off\n * the offset of this descriptor in the previous buffer.\n * @param len\n * the length of this descriptor.\n */\n private Type(final int sort, final char[] buf, final int off, final int len) {\n this.sort = sort;\n this.buf = buf;\n this.off = off;\n this.len = len;\n }\n\n /**\n * Returns the Java type corresponding to the given type descriptor.\n *\n * @param typeDescriptor\n * a field or method type descriptor.\n * @return the Java type corresponding to the given type descriptor.\n */\n public static Type getType(final String typeDescriptor) {\n return getType(typeDescriptor.toCharArray(), 0);\n }\n\n /**\n * Returns the Java type corresponding to the given internal name.\n *\n * @param internalName\n * an internal name.\n * @return the Java type corresponding to the given internal name.\n */\n public static Type getObjectType(final String internalName) {\n char[] buf = internalName.toCharArray();\n return new Type(buf[0] == '[' ? ARRAY : OBJECT, buf, 0, buf.length);\n }\n\n /**\n * Returns the Java type corresponding to the given method descriptor.\n * Equivalent to Type.getType(methodDescriptor).\n *\n * @param methodDescriptor\n * a method descriptor.\n * @return the Java type corresponding to the given method descriptor.\n */\n public static Type getMethodType(final String methodDescriptor) {\n return getType(methodDescriptor.toCharArray(), 0);\n }\n\n /**\n * Returns the Java method type corresponding to the given argument and\n * return types.\n *\n * @param returnType\n * the return type of the method.\n * @param argumentTypes\n * the argument types of the method.\n * @return the Java type corresponding to the given argument and return\n * types.\n */\n public static Type getMethodType(final Type returnType,\n final Type... argumentTypes) {\n return getType(getMethodDescriptor(returnType, argumentTypes));\n }\n\n /**\n * Returns the Java type corresponding to the given class.\n *\n * @param c\n * a class.\n * @return the Java type corresponding to the given class.\n */\n public static Type getType(final Class c) {\n if (c.isPrimitive()) {\n if (c == Integer.TYPE) {\n return INT_TYPE;\n } else if (c == Void.TYPE) {\n return VOID_TYPE;\n } else if (c == Boolean.TYPE) {\n return BOOLEAN_TYPE;\n } else if (c == Byte.TYPE) {\n return BYTE_TYPE;\n } else if (c == Character.TYPE) {\n return CHAR_TYPE;\n } else if (c == Short.TYPE) {\n return SHORT_TYPE;\n } else if (c == Double.TYPE) {\n return DOUBLE_TYPE;\n } else if (c == Float.TYPE) {\n return FLOAT_TYPE;\n } else /* if (c == Long.TYPE) */{\n return LONG_TYPE;\n }\n } else {\n return getType(getDescriptor(c));\n }\n }\n\n /**\n * Returns the Java method type corresponding to the given constructor.\n *\n * @param c\n * a {@link Constructor Constructor} object.\n * @return the Java method type corresponding to the given constructor.\n */\n public static Type getType(final Constructor c) {\n return getType(getConstructorDescriptor(c));\n }\n\n /**\n * Returns the Java method type corresponding to the given method.\n *\n * @param m\n * a {@link Method Method} object.\n * @return the Java method type corresponding to the given method.\n */\n public static Type getType(final Method m) {\n return getType(getMethodDescriptor(m));\n }\n\n /**\n * Returns the Java types corresponding to the argument types of the given\n * method descriptor.\n *\n * @param methodDescriptor\n * a method descriptor.\n * @return the Java types corresponding to the argument types of the given\n * method descriptor.\n */\n public static Type[] getArgumentTypes(final String methodDescriptor) {\n char[] buf = methodDescriptor.toCharArray();\n int off = 1;\n int size = 0;\n while (true) {\n char car = buf[off++];\n if (car == ')') {\n break;\n } else if (car == 'L') {\n while (buf[off++] != ';') {\n }\n ++size;\n } else if (car != '[') {\n ++size;\n }\n }\n Type[] args = new Type[size];\n off = 1;\n size = 0;\n while (buf[off] != ')') {\n args[size] = getType(buf, off);\n off += args[size].len + (args[size].sort == OBJECT ? 2 : 0);\n size += 1;\n }\n return args;\n }\n\n /**\n * Returns the Java types corresponding to the argument types of the given\n * method.\n *\n * @param method\n * a method.\n * @return the Java types corresponding to the argument types of the given\n * method.\n */\n public static Type[] getArgumentTypes(final Method method) {\n Class[] classes = method.getParameterTypes();\n Type[] types = new Type[classes.length];\n for (int i = classes.length - 1; i >= 0; --i) {\n types[i] = getType(classes[i]);\n }\n return types;\n }\n\n /**\n * Returns the Java type corresponding to the return type of the given\n * method descriptor.\n *\n * @param methodDescriptor\n * a method descriptor.\n * @return the Java type corresponding to the return type of the given\n * method descriptor.\n */\n public static Type getReturnType(final String methodDescriptor) {\n char[] buf = methodDescriptor.toCharArray();\n return getType(buf, methodDescriptor.indexOf(')') + 1);\n }\n\n /**\n * Returns the Java type corresponding to the return type of the given\n * method.\n *\n * @param method\n * a method.\n * @return the Java type corresponding to the return type of the given\n * method.\n */\n public static Type getReturnType(final Method method) {\n return getType(method.getReturnType());\n }\n\n /**\n * Computes the size of the arguments and of the return value of a method.\n *\n * @param desc\n * the descriptor of a method.\n * @return the size of the arguments of the method (plus one for the\n * implicit this argument), argSize, and the size of its return\n * value, retSize, packed into a single int i =\n * (argSize << 2) | retSize (argSize is therefore equal to\n * i >> 2, and retSize to i & 0x03).\n */\n public static int getArgumentsAndReturnSizes(final String desc) {\n int n = 1;\n int c = 1;\n while (true) {\n char car = desc.charAt(c++);\n if (car == ')') {\n car = desc.charAt(c);\n return n << 2\n | (car == 'V' ? 0 : (car == 'D' || car == 'J' ? 2 : 1));\n } else if (car == 'L') {\n while (desc.charAt(c++) != ';') {\n }\n n += 1;\n } else if (car == '[') {\n while ((car = desc.charAt(c)) == '[') {\n ++c;\n }\n if (car == 'D' || car == 'J') {\n n -= 1;\n }\n } else if (car == 'D' || car == 'J') {\n n += 2;\n } else {\n n += 1;\n }\n }\n }\n\n /**\n * Returns the Java type corresponding to the given type descriptor. For\n * method descriptors, buf is supposed to contain nothing more than the\n * descriptor itself.\n *\n * @param buf\n * a buffer containing a type descriptor.\n * @param off\n * the offset of this descriptor in the previous buffer.\n * @return the Java type corresponding to the given type descriptor.\n */\n private static Type getType(final char[] buf, final int off) {\n int len;\n switch (buf[off]) {\n case 'V':\n return VOID_TYPE;\n case 'Z':\n return BOOLEAN_TYPE;\n case 'C':\n return CHAR_TYPE;\n case 'B':\n return BYTE_TYPE;\n case 'S':\n return SHORT_TYPE;\n case 'I':\n return INT_TYPE;\n case 'F':\n return FLOAT_TYPE;\n case 'J':\n return LONG_TYPE;\n case 'D':\n return DOUBLE_TYPE;\n case '[':\n len = 1;\n while (buf[off + len] == '[') {\n ++len;\n }\n if (buf[off + len] == 'L') {\n ++len;\n while (buf[off + len] != ';') {\n ++len;\n }\n }\n return new Type(ARRAY, buf, off, len + 1);\n case 'L':\n len = 1;\n while (buf[off + len] != ';') {\n ++len;\n }\n return new Type(OBJECT, buf, off + 1, len - 1);\n // case '(':\n default:\n return new Type(METHOD, buf, off, buf.length - off);\n }\n }\n\n // ------------------------------------------------------------------------\n // Accessors\n // ------------------------------------------------------------------------\n\n /**\n * Returns the sort of this Java type.\n *\n * @return {@link #VOID VOID}, {@link #BOOLEAN BOOLEAN}, {@link #CHAR CHAR},\n * {@link #BYTE BYTE}, {@link #SHORT SHORT}, {@link #INT INT},\n * {@link #FLOAT FLOAT}, {@link #LONG LONG}, {@link #DOUBLE DOUBLE},\n * {@link #ARRAY ARRAY}, {@link #OBJECT OBJECT} or {@link #METHOD\n * METHOD}.\n */\n public int getSort() {\n return sort;\n }\n\n /**\n * Returns the number of dimensions of this array type. This method should\n * only be used for an array type.\n *\n * @return the number of dimensions of this array type.\n */\n public int getDimensions() {\n int i = 1;\n while (buf[off + i] == '[') {\n ++i;\n }\n return i;\n }\n\n /**\n * Returns the type of the elements of this array type. This method should\n * only be used for an array type.\n *\n * @return Returns the type of the elements of this array type.\n */\n public Type getElementType() {\n return getType(buf, off + getDimensions());\n }\n\n /**\n * Returns the binary name of the class corresponding to this type. This\n * method must not be used on method types.\n *\n * @return the binary name of the class corresponding to this type.\n */\n public String getClassName() {\n switch (sort) {\n case VOID:\n return \"void\";\n case BOOLEAN:\n return \"boolean\";\n case CHAR:\n return \"char\";\n case BYTE:\n return \"byte\";\n case SHORT:\n return \"short\";\n case INT:\n return \"int\";\n case FLOAT:\n return \"float\";\n case LONG:\n return \"long\";\n case DOUBLE:\n return \"double\";\n case ARRAY:\n StringBuffer b = new StringBuffer(getElementType().getClassName());\n for (int i = getDimensions(); i > 0; --i) {\n b.append(\"[]\");\n }\n return b.toString();\n case OBJECT:\n return new String(buf, off, len).replace('/', '.');\n default:\n return null;\n }\n }\n\n /**\n * Returns the internal name of the class corresponding to this object or\n * array type. The internal name of a class is its fully qualified name (as\n * returned by Class.getName(), where '.' are replaced by '/'. This method\n * should only be used for an object or array type.\n *\n * @return the internal name of the class corresponding to this object type.\n */\n public String getInternalName() {\n return new String(buf, off, len);\n }\n\n /**\n * Returns the argument types of methods of this type. This method should\n * only be used for method types.\n *\n * @return the argument types of methods of this type.\n */\n public Type[] getArgumentTypes() {\n return getArgumentTypes(getDescriptor());\n }\n\n /**\n * Returns the return type of methods of this type. This method should only\n * be used for method types.\n *\n * @return the return type of methods of this type.\n */\n public Type getReturnType() {\n return getReturnType(getDescriptor());\n }\n\n /**\n * Returns the size of the arguments and of the return value of methods of\n * this type. This method should only be used for method types.\n *\n * @return the size of the arguments (plus one for the implicit this\n * argument), argSize, and the size of the return value, retSize,\n * packed into a single int i = (argSize << 2) | retSize\n * (argSize is therefore equal to i >> 2, and retSize to\n * i & 0x03).\n */\n public int getArgumentsAndReturnSizes() {\n return getArgumentsAndReturnSizes(getDescriptor());\n }\n\n // ------------------------------------------------------------------------\n // Conversion to type descriptors\n // ------------------------------------------------------------------------\n\n /**\n * Returns the descriptor corresponding to this Java type.\n *\n * @return the descriptor corresponding to this Java type.\n */\n public String getDescriptor() {\n StringBuffer buf = new StringBuffer();\n getDescriptor(buf);\n return buf.toString();\n }\n\n /**\n * Returns the descriptor corresponding to the given argument and return\n * types.\n *\n * @param returnType\n * the return type of the method.\n * @param argumentTypes\n * the argument types of the method.\n * @return the descriptor corresponding to the given argument and return\n * types.\n */\n public static String getMethodDescriptor(final Type returnType,\n final Type... argumentTypes) {\n StringBuffer buf = new StringBuffer();\n buf.append('(');\n for (int i = 0; i < argumentTypes.length; ++i) {\n argumentTypes[i].getDescriptor(buf);\n }\n buf.append(')');\n returnType.getDescriptor(buf);\n return buf.toString();\n }\n\n /**\n * Appends the descriptor corresponding to this Java type to the given\n * string buffer.\n *\n * @param buf\n * the string buffer to which the descriptor must be appended.\n */\n private void getDescriptor(final StringBuffer buf) {\n if (this.buf == null) {\n // descriptor is in byte 3 of 'off' for primitive types (buf ==\n // null)\n buf.append((char) ((off & 0xFF000000) >>> 24));\n } else if (sort == OBJECT) {\n buf.append('L');\n buf.append(this.buf, off, len);\n buf.append(';');\n } else { // sort == ARRAY || sort == METHOD\n buf.append(this.buf, off, len);\n }\n }\n\n // ------------------------------------------------------------------------\n // Direct conversion from classes to type descriptors,\n // without intermediate Type objects\n // ------------------------------------------------------------------------\n\n /**\n * Returns the internal name of the given class. The internal name of a\n * class is its fully qualified name, as returned by Class.getName(), where\n * '.' are replaced by '/'.\n *\n * @param c\n * an object or array class.\n * @return the internal name of the given class.\n */\n public static String getInternalName(final Class c) {\n return c.getName().replace('.', '/');\n }\n\n /**\n * Returns the descriptor corresponding to the given Java type.\n *\n * @param c\n * an object class, a primitive class or an array class.\n * @return the descriptor corresponding to the given class.\n */\n public static String getDescriptor(final Class c) {\n StringBuffer buf = new StringBuffer();\n getDescriptor(buf, c);\n return buf.toString();\n }\n\n /**\n * Returns the descriptor corresponding to the given constructor.\n *\n * @param c\n * a {@link Constructor Constructor} object.\n * @return the descriptor of the given constructor.\n */\n public static String getConstructorDescriptor(final Constructor c) {\n Class[] parameters = c.getParameterTypes();\n StringBuffer buf = new StringBuffer();\n buf.append('(');\n for (int i = 0; i < parameters.length; ++i) {\n getDescriptor(buf, parameters[i]);\n }\n return buf.append(\")V\").toString();\n }\n\n /**\n * Returns the descriptor corresponding to the given method.\n *\n * @param m\n * a {@link Method Method} object.\n * @return the descriptor of the given method.\n */\n public static String getMethodDescriptor(final Method m) {\n Class[] parameters = m.getParameterTypes();\n StringBuffer buf = new StringBuffer();\n buf.append('(');\n for (int i = 0; i < parameters.length; ++i) {\n getDescriptor(buf, parameters[i]);\n }\n buf.append(')');\n getDescriptor(buf, m.getReturnType());\n return buf.toString();\n }\n\n /**\n * Appends the descriptor of the given class to the given string buffer.\n *\n * @param buf\n * the string buffer to which the descriptor must be appended.\n * @param c\n * the class whose descriptor must be computed.\n */\n private static void getDescriptor(final StringBuffer buf, final Class c) {\n Class d = c;\n while (true) {\n if (d.isPrimitive()) {\n char car;\n if (d == Integer.TYPE) {\n car = 'I';\n } else if (d == Void.TYPE) {\n car = 'V';\n } else if (d == Boolean.TYPE) {\n car = 'Z';\n } else if (d == Byte.TYPE) {\n car = 'B';\n } else if (d == Character.TYPE) {\n car = 'C';\n } else if (d == Short.TYPE) {\n car = 'S';\n } else if (d == Double.TYPE) {\n car = 'D';\n } else if (d == Float.TYPE) {\n car = 'F';\n } else /* if (d == Long.TYPE) */{\n car = 'J';\n }\n buf.append(car);\n return;\n } else if (d.isArray()) {\n buf.append('[');\n d = d.getComponentType();\n } else {\n buf.append('L');\n String name = d.getName();\n int len = name.length();\n for (int i = 0; i < len; ++i) {\n char car = name.charAt(i);\n buf.append(car == '.' ? '/' : car);\n }\n buf.append(';');\n return;\n }\n }\n }\n\n // ------------------------------------------------------------------------\n // Corresponding size and opcodes\n // ------------------------------------------------------------------------\n\n /**\n * Returns the size of values of this type. This method must not be used for\n * method types.\n *\n * @return the size of values of this type, i.e., 2 for long and\n * double, 0 for void and 1 otherwise.\n */\n public int getSize() {\n // the size is in byte 0 of 'off' for primitive types (buf == null)\n return buf == null ? (off & 0xFF) : 1;\n }\n\n /**\n * Returns a JVM instruction opcode adapted to this Java type. This method\n * must not be used for method types.\n *\n * @param opcode\n * a JVM instruction opcode. This opcode must be one of ILOAD,\n * ISTORE, IALOAD, IASTORE, IADD, ISUB, IMUL, IDIV, IREM, INEG,\n * ISHL, ISHR, IUSHR, IAND, IOR, IXOR and IRETURN.\n * @return an opcode that is similar to the given opcode, but adapted to\n * this Java type. For example, if this type is float and\n * opcode is IRETURN, this method returns FRETURN.\n */\n public int getOpcode(final int opcode) {\n if (opcode == Opcodes.IALOAD || opcode == Opcodes.IASTORE) {\n // the offset for IALOAD or IASTORE is in byte 1 of 'off' for\n // primitive types (buf == null)\n return opcode + (buf == null ? (off & 0xFF00) >> 8 : 4);\n } else {\n // the offset for other instructions is in byte 2 of 'off' for\n // primitive types (buf == null)\n return opcode + (buf == null ? (off & 0xFF0000) >> 16 : 4);\n }\n }\n\n // ------------------------------------------------------------------------\n // Equals, hashCode and toString\n // ------------------------------------------------------------------------\n\n /**\n * Tests if the given object is equal to this type.\n *\n * @param o\n * the object to be compared to this type.\n * @return true if the given object is equal to this type.\n */\n @Override\n public boolean equals(final Object o) {\n if (this == o) {\n return true;\n }\n if (!(o instanceof Type)) {\n return false;\n }\n Type t = (Type) o;\n if (sort != t.sort) {\n return false;\n }\n if (sort >= ARRAY) {\n if (len != t.len) {\n return false;\n }\n for (int i = off, j = t.off, end = i + len; i < end; i++, j++) {\n if (buf[i] != t.buf[j]) {\n return false;\n }\n }\n }\n return true;\n }\n\n /**\n * Returns a hash code value for this type.\n *\n * @return a hash code value for this type.\n */\n @Override\n public int hashCode() {\n int hc = 13 * sort;\n if (sort >= ARRAY) {\n for (int i = off, end = i + len; i < end; i++) {\n hc = 17 * (hc + buf[i]);\n }\n }\n return hc;\n }\n\n /**\n * Returns a string representation of this type.\n *\n * @return the descriptor of this type.\n */\n @Override\n public String toString() {\n return getDescriptor();\n }\n}\n" }, { "path": "src/jvm/clojure/asm/commons/AdviceAdapter.java", "content": "/***\n * ASM: a very small and fast Java bytecode manipulation framework\n * Copyright (c) 2000-2011 INRIA, France Telecom\n * All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions\n * are met:\n * 1. Redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer.\n * 2. Redistributions in binary form must reproduce the above copyright\n * notice, this list of conditions and the following disclaimer in the\n * documentation and/or other materials provided with the distribution.\n * 3. Neither the name of the copyright holders nor the names of its\n * contributors may be used to endorse or promote products derived from\n * this software without specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\n * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\n * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE\n * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR\n * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF\n * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\n * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN\n * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\n * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF\n * THE POSSIBILITY OF SUCH DAMAGE.\n */\npackage clojure.asm.commons;\n\nimport java.util.ArrayList;\nimport java.util.HashMap;\nimport java.util.List;\nimport java.util.Map;\n\nimport clojure.asm.Handle;\nimport clojure.asm.Label;\nimport clojure.asm.MethodVisitor;\nimport clojure.asm.Opcodes;\nimport clojure.asm.Type;\n\n/**\n * A {@link clojure.asm.MethodVisitor} to insert before, after and around\n * advices in methods and constructors.\n *

\n * The behavior for constructors is like this:\n *

    \n *\n *
  1. as long as the INVOKESPECIAL for the object initialization has not been\n * reached, every bytecode instruction is dispatched in the ctor code visitor
    2. \n *\n *
  2. when this one is reached, it is only added in the ctor code visitor and a\n * JP invoke is added
    3. \n *\n *
  3. after that, only the other code visitor receives the instructions
    4. \n *\n *
\n *\n * @author Eugene Kuleshov\n * @author Eric Bruneton\n */\npublic abstract class AdviceAdapter extends GeneratorAdapter implements Opcodes {\n\n private static final Object THIS = new Object();\n\n private static final Object OTHER = new Object();\n\n protected int methodAccess;\n\n protected String methodDesc;\n\n private boolean constructor;\n\n private boolean superInitialized;\n\n private List stackFrame;\n\n private Map> branches;\n\n /**\n * Creates a new {@link AdviceAdapter}.\n *\n * @param api\n * the ASM API version implemented by this visitor. Must be one\n * of {@link Opcodes#ASM4}.\n * @param mv\n * the method visitor to which this adapter delegates calls.\n * @param access\n * the method's access flags (see {@link Opcodes}).\n * @param name\n * the method's name.\n * @param desc\n * the method's descriptor (see {@link Type Type}).\n */\n protected AdviceAdapter(final int api, final MethodVisitor mv,\n final int access, final String name, final String desc) {\n super(api, mv, access, name, desc);\n methodAccess = access;\n methodDesc = desc;\n constructor = \"\".equals(name);\n }\n\n @Override\n public void visitCode() {\n mv.visitCode();\n if (constructor) {\n stackFrame = new ArrayList();\n branches = new HashMap>();\n } else {\n superInitialized = true;\n onMethodEnter();\n }\n }\n\n @Override\n public void visitLabel(final Label label) {\n mv.visitLabel(label);\n if (constructor && branches != null) {\n List frame = branches.get(label);\n if (frame != null) {\n stackFrame = frame;\n branches.remove(label);\n }\n }\n }\n\n @Override\n public void visitInsn(final int opcode) {\n if (constructor) {\n int s;\n switch (opcode) {\n case RETURN: // empty stack\n onMethodExit(opcode);\n break;\n case IRETURN: // 1 before n/a after\n case FRETURN: // 1 before n/a after\n case ARETURN: // 1 before n/a after\n case ATHROW: // 1 before n/a after\n popValue();\n onMethodExit(opcode);\n break;\n case LRETURN: // 2 before n/a after\n case DRETURN: // 2 before n/a after\n popValue();\n popValue();\n onMethodExit(opcode);\n break;\n case NOP:\n case LALOAD: // remove 2 add 2\n case DALOAD: // remove 2 add 2\n case LNEG:\n case DNEG:\n case FNEG:\n case INEG:\n case L2D:\n case D2L:\n case F2I:\n case I2B:\n case I2C:\n case I2S:\n case I2F:\n case ARRAYLENGTH:\n break;\n case ACONST_NULL:\n case ICONST_M1:\n case ICONST_0:\n case ICONST_1:\n case ICONST_2:\n case ICONST_3:\n case ICONST_4:\n case ICONST_5:\n case FCONST_0:\n case FCONST_1:\n case FCONST_2:\n case F2L: // 1 before 2 after\n case F2D:\n case I2L:\n case I2D:\n pushValue(OTHER);\n break;\n case LCONST_0:\n case LCONST_1:\n case DCONST_0:\n case DCONST_1:\n pushValue(OTHER);\n pushValue(OTHER);\n break;\n case IALOAD: // remove 2 add 1\n case FALOAD: // remove 2 add 1\n case AALOAD: // remove 2 add 1\n case BALOAD: // remove 2 add 1\n case CALOAD: // remove 2 add 1\n case SALOAD: // remove 2 add 1\n case POP:\n case IADD:\n case FADD:\n case ISUB:\n case LSHL: // 3 before 2 after\n case LSHR: // 3 before 2 after\n case LUSHR: // 3 before 2 after\n case L2I: // 2 before 1 after\n case L2F: // 2 before 1 after\n case D2I: // 2 before 1 after\n case D2F: // 2 before 1 after\n case FSUB:\n case FMUL:\n case FDIV:\n case FREM:\n case FCMPL: // 2 before 1 after\n case FCMPG: // 2 before 1 after\n case IMUL:\n case IDIV:\n case IREM:\n case ISHL:\n case ISHR:\n case IUSHR:\n case IAND:\n case IOR:\n case IXOR:\n case MONITORENTER:\n case MONITOREXIT:\n popValue();\n break;\n case POP2:\n case LSUB:\n case LMUL:\n case LDIV:\n case LREM:\n case LADD:\n case LAND:\n case LOR:\n case LXOR:\n case DADD:\n case DMUL:\n case DSUB:\n case DDIV:\n case DREM:\n popValue();\n popValue();\n break;\n case IASTORE:\n case FASTORE:\n case AASTORE:\n case BASTORE:\n case CASTORE:\n case SASTORE:\n case LCMP: // 4 before 1 after\n case DCMPL:\n case DCMPG:\n popValue();\n popValue();\n popValue();\n break;\n case LASTORE:\n case DASTORE:\n popValue();\n popValue();\n popValue();\n popValue();\n break;\n case DUP:\n pushValue(peekValue());\n break;\n case DUP_X1:\n s = stackFrame.size();\n stackFrame.add(s - 2, stackFrame.get(s - 1));\n break;\n case DUP_X2:\n s = stackFrame.size();\n stackFrame.add(s - 3, stackFrame.get(s - 1));\n break;\n case DUP2:\n s = stackFrame.size();\n stackFrame.add(s - 2, stackFrame.get(s - 1));\n stackFrame.add(s - 2, stackFrame.get(s - 1));\n break;\n case DUP2_X1:\n s = stackFrame.size();\n stackFrame.add(s - 3, stackFrame.get(s - 1));\n stackFrame.add(s - 3, stackFrame.get(s - 1));\n break;\n case DUP2_X2:\n s = stackFrame.size();\n stackFrame.add(s - 4, stackFrame.get(s - 1));\n stackFrame.add(s - 4, stackFrame.get(s - 1));\n break;\n case SWAP:\n s = stackFrame.size();\n stackFrame.add(s - 2, stackFrame.get(s - 1));\n stackFrame.remove(s);\n break;\n }\n } else {\n switch (opcode) {\n case RETURN:\n case IRETURN:\n case FRETURN:\n case ARETURN:\n case LRETURN:\n case DRETURN:\n case ATHROW:\n onMethodExit(opcode);\n break;\n }\n }\n mv.visitInsn(opcode);\n }\n\n @Override\n public void visitVarInsn(final int opcode, final int var) {\n super.visitVarInsn(opcode, var);\n if (constructor) {\n switch (opcode) {\n case ILOAD:\n case FLOAD:\n pushValue(OTHER);\n break;\n case LLOAD:\n case DLOAD:\n pushValue(OTHER);\n pushValue(OTHER);\n break;\n case ALOAD:\n pushValue(var == 0 ? THIS : OTHER);\n break;\n case ASTORE:\n case ISTORE:\n case FSTORE:\n popValue();\n break;\n case LSTORE:\n case DSTORE:\n popValue();\n popValue();\n break;\n }\n }\n }\n\n @Override\n public void visitFieldInsn(final int opcode, final String owner,\n final String name, final String desc) {\n mv.visitFieldInsn(opcode, owner, name, desc);\n if (constructor) {\n char c = desc.charAt(0);\n boolean longOrDouble = c == 'J' || c == 'D';\n switch (opcode) {\n case GETSTATIC:\n pushValue(OTHER);\n if (longOrDouble) {\n pushValue(OTHER);\n }\n break;\n case PUTSTATIC:\n popValue();\n if (longOrDouble) {\n popValue();\n }\n break;\n case PUTFIELD:\n popValue();\n if (longOrDouble) {\n popValue();\n popValue();\n }\n break;\n // case GETFIELD:\n default:\n if (longOrDouble) {\n pushValue(OTHER);\n }\n }\n }\n }\n\n @Override\n public void visitIntInsn(final int opcode, final int operand) {\n mv.visitIntInsn(opcode, operand);\n if (constructor && opcode != NEWARRAY) {\n pushValue(OTHER);\n }\n }\n\n @Override\n public void visitLdcInsn(final Object cst) {\n mv.visitLdcInsn(cst);\n if (constructor) {\n pushValue(OTHER);\n if (cst instanceof Double || cst instanceof Long) {\n pushValue(OTHER);\n }\n }\n }\n\n @Override\n public void visitMultiANewArrayInsn(final String desc, final int dims) {\n mv.visitMultiANewArrayInsn(desc, dims);\n if (constructor) {\n for (int i = 0; i < dims; i++) {\n popValue();\n }\n pushValue(OTHER);\n }\n }\n\n @Override\n public void visitTypeInsn(final int opcode, final String type) {\n mv.visitTypeInsn(opcode, type);\n // ANEWARRAY, CHECKCAST or INSTANCEOF don't change stack\n if (constructor && opcode == NEW) {\n pushValue(OTHER);\n }\n }\n\n @Override\n public void visitMethodInsn(final int opcode, final String owner,\n final String name, final String desc) {\n mv.visitMethodInsn(opcode, owner, name, desc);\n if (constructor) {\n Type[] types = Type.getArgumentTypes(desc);\n for (int i = 0; i < types.length; i++) {\n popValue();\n if (types[i].getSize() == 2) {\n popValue();\n }\n }\n switch (opcode) {\n // case INVOKESTATIC:\n // break;\n case INVOKEINTERFACE:\n case INVOKEVIRTUAL:\n popValue(); // objectref\n break;\n case INVOKESPECIAL:\n Object type = popValue(); // objectref\n if (type == THIS && !superInitialized) {\n onMethodEnter();\n superInitialized = true;\n // once super has been initialized it is no longer\n // necessary to keep track of stack state\n constructor = false;\n }\n break;\n }\n\n Type returnType = Type.getReturnType(desc);\n if (returnType != Type.VOID_TYPE) {\n pushValue(OTHER);\n if (returnType.getSize() == 2) {\n pushValue(OTHER);\n }\n }\n }\n }\n\n @Override\n public void visitInvokeDynamicInsn(String name, String desc, Handle bsm,\n Object... bsmArgs) {\n mv.visitInvokeDynamicInsn(name, desc, bsm, bsmArgs);\n if (constructor) {\n Type[] types = Type.getArgumentTypes(desc);\n for (int i = 0; i < types.length; i++) {\n popValue();\n if (types[i].getSize() == 2) {\n popValue();\n }\n }\n\n Type returnType = Type.getReturnType(desc);\n if (returnType != Type.VOID_TYPE) {\n pushValue(OTHER);\n if (returnType.getSize() == 2) {\n pushValue(OTHER);\n }\n }\n }\n }\n\n @Override\n public void visitJumpInsn(final int opcode, final Label label) {\n mv.visitJumpInsn(opcode, label);\n if (constructor) {\n switch (opcode) {\n case IFEQ:\n case IFNE:\n case IFLT:\n case IFGE:\n case IFGT:\n case IFLE:\n case IFNULL:\n case IFNONNULL:\n popValue();\n break;\n case IF_ICMPEQ:\n case IF_ICMPNE:\n case IF_ICMPLT:\n case IF_ICMPGE:\n case IF_ICMPGT:\n case IF_ICMPLE:\n case IF_ACMPEQ:\n case IF_ACMPNE:\n popValue();\n popValue();\n break;\n case JSR:\n pushValue(OTHER);\n break;\n }\n addBranch(label);\n }\n }\n\n @Override\n public void visitLookupSwitchInsn(final Label dflt, final int[] keys,\n final Label[] labels) {\n mv.visitLookupSwitchInsn(dflt, keys, labels);\n if (constructor) {\n popValue();\n addBranches(dflt, labels);\n }\n }\n\n @Override\n public void visitTableSwitchInsn(final int min, final int max,\n final Label dflt, final Label... labels) {\n mv.visitTableSwitchInsn(min, max, dflt, labels);\n if (constructor) {\n popValue();\n addBranches(dflt, labels);\n }\n }\n\n @Override\n public void visitTryCatchBlock(Label start, Label end, Label handler,\n String type) {\n super.visitTryCatchBlock(start, end, handler, type);\n if (constructor && !branches.containsKey(handler)) {\n List stackFrame = new ArrayList();\n stackFrame.add(OTHER);\n branches.put(handler, stackFrame);\n }\n }\n\n private void addBranches(final Label dflt, final Label[] labels) {\n addBranch(dflt);\n for (int i = 0; i < labels.length; i++) {\n addBranch(labels[i]);\n }\n }\n\n private void addBranch(final Label label) {\n if (branches.containsKey(label)) {\n return;\n }\n branches.put(label, new ArrayList(stackFrame));\n }\n\n private Object popValue() {\n return stackFrame.remove(stackFrame.size() - 1);\n }\n\n private Object peekValue() {\n return stackFrame.get(stackFrame.size() - 1);\n }\n\n private void pushValue(final Object o) {\n stackFrame.add(o);\n }\n\n /**\n * Called at the beginning of the method or after super class class call in\n * the constructor.
\n *
\n *\n * Custom code can use or change all the local variables, but should not\n * change state of the stack.\n */\n protected void onMethodEnter() {\n }\n\n /**\n * Called before explicit exit from the method using either return or throw.\n * Top element on the stack contains the return value or exception instance.\n * For example:\n *\n * 
\n     *   public void onMethodExit(int opcode) {\n     *     if(opcode==RETURN) {\n     *         visitInsn(ACONST_NULL);\n     *     } else if(opcode==ARETURN || opcode==ATHROW) {\n     *         dup();\n     *     } else {\n     *         if(opcode==LRETURN || opcode==DRETURN) {\n     *             dup2();\n     *         } else {\n     *             dup();\n     *         }\n     *         box(Type.getReturnType(this.methodDesc));\n     *     }\n     *     visitIntInsn(SIPUSH, opcode);\n     *     visitMethodInsn(INVOKESTATIC, owner, \"onExit\", \"(Ljava/lang/Object;I)V\");\n     *   }\n     *\n     *   // an actual call back method\n     *   public static void onExit(Object param, int opcode) {\n     *     ...\n     *
\n *\n *
\n *
\n *\n * Custom code can use or change all the local variables, but should not\n * change state of the stack.\n *\n * @param opcode\n * one of the RETURN, IRETURN, FRETURN, ARETURN, LRETURN, DRETURN\n * or ATHROW\n *\n */\n protected void onMethodExit(int opcode) {\n }\n\n // TODO onException, onMethodCall\n}\n" }, { "path": "src/jvm/clojure/asm/commons/AnalyzerAdapter.java", "content": "/***\n * ASM: a very small and fast Java bytecode manipulation framework\n * Copyright (c) 2000-2011 INRIA, France Telecom\n * All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions\n * are met:\n * 1. Redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer.\n * 2. Redistributions in binary form must reproduce the above copyright\n * notice, this list of conditions and the following disclaimer in the\n * documentation and/or other materials provided with the distribution.\n * 3. Neither the name of the copyright holders nor the names of its\n * contributors may be used to endorse or promote products derived from\n * this software without specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\n * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\n * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE\n * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR\n * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF\n * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\n * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN\n * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\n * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF\n * THE POSSIBILITY OF SUCH DAMAGE.\n */\npackage clojure.asm.commons;\n\nimport java.util.ArrayList;\nimport java.util.HashMap;\nimport java.util.List;\nimport java.util.Map;\n\nimport clojure.asm.Handle;\nimport clojure.asm.Label;\nimport clojure.asm.MethodVisitor;\nimport clojure.asm.Opcodes;\nimport clojure.asm.Type;\n\n/**\n * A {@link MethodVisitor} that keeps track of stack map frame changes between\n * {@link #visitFrame(int, int, Object[], int, Object[]) visitFrame} calls. This\n * adapter must be used with the\n * {@link clojure.asm.ClassReader#EXPAND_FRAMES} option. Each\n * visitX instruction delegates to the next visitor in the chain, if any,\n * and then simulates the effect of this instruction on the stack map frame,\n * represented by {@link #locals} and {@link #stack}. The next visitor in the\n * chain can get the state of the stack map frame before each instruction\n * by reading the value of these fields in its visitX methods (this\n * requires a reference to the AnalyzerAdapter that is before it in the chain).\n * If this adapter is used with a class that does not contain stack map table\n * attributes (i.e., pre Java 6 classes) then this adapter may not be able to\n * compute the stack map frame for each instruction. In this case no exception\n * is thrown but the {@link #locals} and {@link #stack} fields will be null for\n * these instructions.\n *\n * @author Eric Bruneton\n */\npublic class AnalyzerAdapter extends MethodVisitor {\n\n /**\n * List of the local variable slots for current execution\n * frame. Primitive types are represented by {@link Opcodes#TOP},\n * {@link Opcodes#INTEGER}, {@link Opcodes#FLOAT}, {@link Opcodes#LONG},\n * {@link Opcodes#DOUBLE},{@link Opcodes#NULL} or\n * {@link Opcodes#UNINITIALIZED_THIS} (long and double are represented by\n * two elements, the second one being TOP). Reference types are represented\n * by String objects (representing internal names), and uninitialized types\n * by Label objects (this label designates the NEW instruction that created\n * this uninitialized value). This field is null for unreachable\n * instructions.\n */\n public List locals;\n\n /**\n * List of the operand stack slots for current execution frame.\n * Primitive types are represented by {@link Opcodes#TOP},\n * {@link Opcodes#INTEGER}, {@link Opcodes#FLOAT}, {@link Opcodes#LONG},\n * {@link Opcodes#DOUBLE},{@link Opcodes#NULL} or\n * {@link Opcodes#UNINITIALIZED_THIS} (long and double are represented by\n * two elements, the second one being TOP). Reference types are represented\n * by String objects (representing internal names), and uninitialized types\n * by Label objects (this label designates the NEW instruction that created\n * this uninitialized value). This field is null for unreachable\n * instructions.\n */\n public List stack;\n\n /**\n * The labels that designate the next instruction to be visited. May be\n * null.\n */\n private List