SYMBOL INDEX (221 symbols across 2 files)

FILE: core.c
  function prefs (line 23) | void prefs(char *tag, Value *v) {
  function incTypeMalloc (line 36) | void incTypeMalloc(TYPE_SIZE type, int delta) {
  function incTypeFree (line 51) | void incTypeFree(TYPE_SIZE type, int delta) {
  function mask (line 87) | int mask(int64_t hash, int shift) {
  function bitpos (line 91) | int bitpos(int64_t hash, int shift) {
  function Value (line 95) | Value *my_malloc(int64_t sz) {
  function cleanupMemory (line 116) | void cleanupMemory (Value *the_final_answer, Value *maybeNothing, List *...
  type FreeValList (line 125) | typedef struct {Value *head; uintptr_t aba;} FreeValList;
  function Value (line 127) | Value *removeFreeValue(FreeValList *freeList) {
  function decRefs (line 176) | int decRefs(Value *v, int deltaRefs) {
  function moveToCentral (line 219) | void moveToCentral(FreeValList *freeList, FreeValList *centralList) {
  function decValuePtrRef (line 253) | void decValuePtrRef(Value **ptr) {
  function Integer (line 265) | Integer *malloc_integer() {
  function freeInteger (line 295) | void freeInteger(Value *v) {
  function String (line 303) | String *malloc_string(int len) {
  function freeString (line 328) | void freeString(Value *v) {
  function SubString (line 344) | SubString *malloc_substring() {
  function freeSubString (line 360) | void freeSubString(Value *v) {
  function FnArity (line 372) | FnArity *malloc_fnArity() {
  function freeFnArity (line 389) | void freeFnArity(Value *v) {
  function Function (line 416) | Function *malloc_function(int arityCount) {
  function freeFunction (line 437) | void freeFunction(Value *v) {
  function List (line 457) | List *malloc_list() {
  function freeList (line 492) | void freeList(Value *v) {
  function Maybe (line 525) | Maybe *malloc_maybe() {
  function freeMaybe (line 556) | void freeMaybe(Value *v) {
  function VectorNode (line 567) | VectorNode *malloc_vectorNode() {
  function freeVectorNode (line 597) | void freeVectorNode(Value *v) {
  function Vector (line 609) | Vector *malloc_vector() {
  function freeVector (line 643) | void freeVector(Value *v) {
  function ReifiedVal (line 697) | ReifiedVal *malloc_reified(int64_t implCount) {
  function BitmapIndexedNode (line 775) | BitmapIndexedNode *malloc_bmiNode(int itemCount) {
  function freeBitmapNode (line 819) | void freeBitmapNode(Value *v) {
  function HashCollisionNode (line 839) | HashCollisionNode *malloc_hashCollisionNode(int itemCount) {
  function freeHashCollisionNode (line 856) | void freeHashCollisionNode(Value *v) {
  function ArrayNode (line 872) | ArrayNode *malloc_arrayNode() {
  function freeArrayNode (line 903) | void freeArrayNode(Value *v) {
  function Promise (line 916) | Promise *malloc_promise() {
  function freePromise (line 950) | void freePromise(Value *v) {
  function Future (line 966) | Future *malloc_future(int line) {
  function freeFuture (line 1001) | void freeFuture(Value *v) {
  function emptyAgent (line 1015) | void emptyAgent(Agent *agent) {
  function freeAgent (line 1049) | void freeAgent(Value *v) {
  function freeOpaquePtr (line 1069) | void freeOpaquePtr(Value *v) {
  function dec_and_free (line 1103) | void dec_and_free(Value *v, int deltaRefs) {
  function Value (line 1138) | Value *incRef(Value *v, int deltaRefs) {
  function Value (line 1181) | Value *simpleIncRef(Value *v, int n) {
  function moveFreeToCentral (line 1187) | void moveFreeToCentral() {
  function freeGlobal (line 1211) | void freeGlobal(Value *x) {
  function emptyFreeList (line 1222) | void emptyFreeList(FreeValList *freeLinkedList) {
  function freeAll (line 1238) | void freeAll() {
  function nakedSha1 (line 1295) | int64_t nakedSha1(Value *v1) {
  function List (line 1347) | List *reverseList(List *input) {
  function scheduleFuture (line 1361) | void scheduleFuture(Future *fut) {
  function waitForWorkers (line 1387) | void waitForWorkers() {
  function Value (line 1423) | Value *shutDown_impl(FnArity *arity) {
  function stopWorkers (line 1436) | void stopWorkers() {
  function Value (line 1441) | Value *readFuturesQueue() {
  function Value (line 1533) | Value *deliverFuture(Value *fut, Value *val) {
  function startWorkers (line 1609) | void startWorkers() {
  function replaceWorker (line 1619) | void replaceWorker() {
  function FnArity (line 1652) | FnArity *findFnArity(Value *fnVal, int64_t argCount) {
  function isNothing (line 1670) | int8_t isNothing(Value *v, char *fileName, int lineNumber) {
  function Value (line 1674) | Value *maybe(FnArity *arity, Value *arg0, Value *arg1) {
  function Value (line 1680) | Value *prSTAR(Value *str) {
  function Value (line 1691) | Value *defaultPrErrSTAR(Value *str) {
  function Value (line 1702) | Value *add_ints(Value *arg0, Value *arg1) {
  function Value (line 1709) | Value *integerValue(int64_t n) {
  function Value (line 1715) | Value *integer_str(Value *arg0) {
  function Value (line 1723) | Value *integer_EQ(Value *arg0, Value *arg1) {
  function Value (line 1738) | Value *isInstance(Value *arg0, Value *arg1) {
  function List (line 1758) | List *listCons(Value *x, List *l) {
  function Vector (line 1766) | Vector *newVector(Value *array[], int indexToSkip) {
  function VectorNode (line 1777) | VectorNode *newVectorNode(Value *array[], int indexToSkip) {
  function Value (line 1788) | Value **arrayFor(Vector *v, unsigned index) {
  function VectorNode (line 1806) | VectorNode *newPath(int level, VectorNode *node) {
  function VectorNode (line 1816) | VectorNode *pushTail(unsigned count, int level, VectorNode *parent, Vect...
  function Vector (line 1839) | Vector *vectConj(Vector *vect, Value *val) {
  function Vector (line 1891) | Vector *mutateVectConj(Vector *vect, Value *val) {
  function VectorNode (line 1936) | VectorNode *copyVectStore(int level, VectorNode *node, unsigned index, V...
  function Value (line 1951) | Value *vectStore(Vector *vect, unsigned index, Value *val) {
  function Value (line 1988) | Value *fastVectStore(Vector *vect, unsigned index, Value *val) {
  function Value (line 2012) | Value *updateField(Value *rval, Value *field, int64_t idx) {
  function Value (line 2044) | Value *vectGet(Vector *vect, unsigned index) {
  function Value (line 2051) | Value *vectSeq(Vector *vect, int index) {
  function Value (line 2064) | Value *vectorReverse(Value *arg0) {
  function destructValue (line 2077) | void destructValue(char *fileName, char *lineNum, Value *val, int numArg...
  function Value (line 2113) | Value *strEQ(Value *arg0, Value *arg1) {
  function Value (line 2157) | Value *strLT(Value *arg0, Value *arg1) {
  function Value (line 2218) | Value *strCount(Value *arg0) {
  function Value (line 2228) | Value *strList(Value *arg0) {
  function Value (line 2257) | Value *integer_LT(Value *arg0, Value *arg1) {
  function Value (line 2268) | Value *checkInstance(TYPE_SIZE typeNum, Value *arg1) {
  function Value (line 2283) | Value *listMap(Value *arg0, Value *f) {
  function Value (line 2362) | Value *listConcat(Value *arg0) {
  function Value (line 2424) | Value *car(Value *arg0) {
  function Value (line 2436) | Value *cdr(Value *arg0) {
  function Value (line 2450) | Value *integerLT(Value *arg0, Value *arg1) {
  type SHA1_HASH (line 2467) | typedef struct
  type CHAR64LONG16 (line 2472) | typedef union
  function TransformFunction (line 2488) | static void TransformFunction(uint32_t state[5], const uint8_t buffer[64...
  function Sha1Initialise (line 2536) | void Sha1Initialise (Sha1Context* Context) {
  function Sha1Update (line 2547) | void Sha1Update (Sha1Context* Context, void* Buffer, int64_t BufferSize) {
  function Sha1Finalise (line 2577) | void Sha1Finalise (Sha1Context* Context, SHA1_HASH* Digest) {
  function free_sha1 (line 2599) | void free_sha1(void *ptr) {
  function Value (line 2607) | Value *malloc_sha1() {
  function Value (line 2617) | Value *finalize_sha1(Value *ctxt) {
  function integerSha1 (line 2624) | int64_t integerSha1(Value *arg0) {
  function Value (line 2637) | Value *bitAnd(Value *arg0, Value *arg1) {
  function Value (line 2645) | Value *bitOr(Value *arg0, Value *arg1) {
  function Value (line 2653) | Value *bitXor(Value *arg0, Value *arg1) {
  function Value (line 2661) | Value *bitShiftLeft(Value *arg0, Value *arg1) {
  function Value (line 2669) | Value *bitShiftRight(Value *arg0, Value *arg1) {
  function Value (line 2677) | Value *bitNot(Value *arg0) {
  function Value (line 2684) | Value *addIntegers(Value *arg0, Value *arg1) {
  function Value (line 2691) | Value *listEQ(Value *arg0, Value *arg1) {
  function equal (line 2717) | int8_t equal(Value *v1, Value *v2) {
  function Value (line 2735) | Value *stringValue(char *s) {
  function Value (line 2743) | Value *maybeExtract(Value *arg0) {
  function Value (line 2755) | Value *fnApply(Value *arg0, Value *arg1) {
  function Value (line 2920) | Value *maybeEQ(Value *arg0, Value *arg1) {
  function Value (line 2949) | Value *maybeMap(Value *arg0, Value *arg1) {
  function strSha1Update (line 2982) | void strSha1Update(Sha1Context *ctxt, Value *arg0) {
  function strSha1 (line 3000) | int64_t strSha1(Value *arg0) {
  function Value (line 3036) | Value *escapeChars(Value *arg0) {
  function Value (line 3109) | Value *opaqueValue(void *ptr, Destructor *destruct) {
  function Value (line 3118) | Value *subs2(Value *arg0, Value *arg1) {
  function Value (line 3157) | Value *subs3(Value *arg0, Value *arg1, Value *arg2) {
  function Value (line 3205) | Value *strSeq(Value *arg0) {
  function Value (line 3234) | Value *dynamicCall2Arg(Value *f, Value *arg0, Value *arg1) {
  function Value (line 3258) | Value *strReduce(Value *s0, Value *x1, Value *f2) {
  function Value (line 3283) | Value *strVec(Value *arg0) {
  function Value (line 3312) | Value *vectorGet(Value *arg0, Value *arg1) {
  function Value (line 3329) | Value *symbol(Value *arg0) {
  function Value (line 3353) | Value *symEQ(Value *arg0, Value *arg1) {
  function Value (line 3373) | Value *symLT(Value *arg0, Value *arg1) {
  function Value (line 3399) | Value *listFilter(Value *arg0, Value *arg1) {
  function BitmapIndexedNode (line 3461) | BitmapIndexedNode *clone_BitmapIndexedNode(BitmapIndexedNode *node, int ...
  function Value (line 3485) | Value *createNode(int shift,
  function Value (line 3512) | Value *bmiHashSeq(Value *arg0, Value *arg1) {
  function Value (line 3530) | Value *bmiHashVec(Value *arg0, Value *arg1) {
  function Value (line 3549) | Value *bmiCount(Value *arg0) {
  function Value (line 3567) | Value *bmiCopyAssoc(Value *arg0, Value *arg1, Value *arg2, int64_t hash,...
  function Value (line 3684) | Value *bmiMutateAssoc(Value *arg0, Value *arg1, Value *arg2, int64_t has...
  function Value (line 3801) | Value *bmiGet(Value *arg0, Value *arg1, Value *arg2, int64_t hash,  int ...
  function Value (line 3838) | Value *bmiDissoc(Value *arg0, Value* arg1, int64_t hash, int shift) {
  function Value (line 3908) | Value *arrayNodeCopyAssoc(Value *arg0, Value *arg1, Value *arg2, int64_t...
  function Value (line 3947) | Value *arrayNodeMutateAssoc(Value *arg0, Value *arg1, Value *arg2, int64...
  function Value (line 3968) | Value *collisionAssoc(Value *arg0, Value *arg1, Value *arg2, int64_t has...
  function Value (line 4011) | Value *arrayNodeGet(Value *arg0, Value *arg1, Value *arg2, int64_t hash,...
  function Value (line 4029) | Value *arrayNodeCount(Value *arg0) {
  function Value (line 4042) | Value *collisionCount(Value *arg0) {
  function Value (line 4048) | Value *collisionSeq(Value *arg0, Value *arg1) {
  function Value (line 4063) | Value *collisionVec(Value *arg0, Value *arg1) {
  function Value (line 4081) | Value *collisionDissoc(Value *arg0, Value *arg1, int64_t hash, int shift) {
  function Value (line 4121) | Value *collisionGet(Value *arg0, Value *arg1, Value *arg2, int64_t hash,...
  function Value (line 4146) | Value *arrayNodeSeq(Value *arg0, Value *arg1) {
  function Value (line 4159) | Value *arrayNodeVec(Value *arg0, Value *arg1) {
  function Value (line 4172) | Value *arrayNodeDissoc(Value *arg0, Value *arg1, int64_t hash, int shift) {
  function Value (line 4199) | Value *get(FnArity *arity, Value *node, Value *k, Value *v, int64_t hash...
  function Value (line 4213) | Value *baseDissoc(Value *node, Value *k, int64_t hash, int shift) {
  function Value (line 4227) | Value *hashVec(Value *node, Value *vec) {
  function Value (line 4241) | Value *copyAssoc(Value *node, Value *k, Value *v, int64_t hash, int shif...
  function Value (line 4255) | Value *mutateAssoc(Value *node, Value *k, Value *v, int64_t hash, int sh...
  function Value (line 4270) | Value *hashMapGet(Value *arg0, Value *arg1) {
  function Value (line 4281) | Value *hashMapAssoc(Value *arg0, Value *arg1, Value *arg2) {
  function Value (line 4286) | Value *dynamicCall1Arg(Value *f, Value *arg) {
  function Value (line 4309) | Value *addPromiseAction(Promise *p, Value *action) {
  function Value (line 4343) | Value *deliverPromise(Value *arg0, Value *arg1) {
  function Value (line 4372) | Value *extractPromise(Value *arg0) {
  function Value (line 4399) | Value *promiseDelivered(Value *arg0) {
  function Value (line 4412) | Value *extractFuture(Value *arg0) {
  function Value (line 4438) | Value *makeFuture(Value *arg0) {
  function Value (line 4448) | Value *addFutureAction(Future *p, Value *action) {
  function Value (line 4487) | Value *makeAgent(Value *arg0) {
  function Value (line 4503) | Value *extractAgent(Value *arg0) {
  function List (line 4512) | List *readAgentQueue(Agent *agent) {
  function Value (line 4558) | Value *updateAgent_impl(FnArity *arity) {
  function scheduleAgent (line 4575) | void scheduleAgent(Agent *agent, List *action) {
  function freeExtractCache (line 4611) | void freeExtractCache(void *cachePtr) {
  function freeIntGenerator (line 4624) | void freeIntGenerator(void *ptr) {
  function String (line 4635) | String *nullTerm(Value *s) {
  function show (line 4645) | void show(Value *v) {
  function countSeq (line 4667) | int64_t countSeq(Value *seq) {
  function Value (line 4674) | Value *reifiedTypeArgs(Value *x) {
  function Vector (line 4691) | Vector *listVec(Value *list) {
  function Value (line 4701) | Value *newTypeValue(int typeNum, Vector *fields) {

FILE: core.h
  type Sha1Context (line 29) | typedef struct
  type Value (line 38) | typedef struct Value {TYPE_SIZE type; REFS_SIZE refs; struct Value* next...
  type Integer (line 39) | typedef struct {TYPE_SIZE type; REFS_SIZE refs; int64_t numVal;} Integer;
  type HashedValue (line 40) | typedef struct HashedValue {TYPE_SIZE type; REFS_SIZE refs; int64_t hash...
  type String (line 41) | typedef struct {TYPE_SIZE type; REFS_SIZE refs; int64_t hashVal; int64_t...
  type SubString (line 42) | typedef struct {TYPE_SIZE type; REFS_SIZE refs; int64_t hashVal; int64_t...
  type List (line 43) | typedef struct List {TYPE_SIZE type; REFS_SIZE refs; int64_t hashVal;
  type VectorNode (line 45) | typedef struct {TYPE_SIZE type; REFS_SIZE refs; Value *array[VECTOR_ARRA...
  type Vector (line 46) | typedef struct {TYPE_SIZE type; REFS_SIZE refs; int64_t hashVal; int32_t...
  type FnArity (line 48) | typedef struct {TYPE_SIZE type; REFS_SIZE refs; int count; Vector *closu...
  type Function (line 50) | typedef struct {TYPE_SIZE type; REFS_SIZE refs; char *name; int64_t arit...
  type Maybe (line 51) | typedef struct {TYPE_SIZE type; REFS_SIZE refs; int64_t hashVal; Value* ...
  type BitmapIndexedNode (line 52) | typedef struct {TYPE_SIZE type; REFS_SIZE refs; int64_t hashVal; int32_t...
  type ArrayNode (line 53) | typedef struct {TYPE_SIZE type; REFS_SIZE refs; int64_t hashVal; Value *...
  type HashCollisionNode (line 54) | typedef struct {TYPE_SIZE type; REFS_SIZE refs; int64_t hashVal; int16_t...
  type Promise (line 55) | typedef struct {TYPE_SIZE type; REFS_SIZE refs; Value *result; List *act...
  type Future (line 57) | typedef struct {TYPE_SIZE type; REFS_SIZE refs; Value *action; Value* er...
  type Agent (line 59) | typedef struct {TYPE_SIZE type; REFS_SIZE refs; Value *val; List* input;...
  type ReifiedVal (line 61) | typedef struct {TYPE_SIZE type; REFS_SIZE refs; int64_t hashVal; int64_t...
  type Opaque (line 62) | typedef struct {TYPE_SIZE type; REFS_SIZE refs; void *ptr; Destructor *d...
  type ProtoImpl (line 67) | typedef struct {TYPE_SIZE type; Value *implFn;} ProtoImpl;
  type ProtoImpls (line 68) | typedef struct {int64_t implCount; ProtoImpl impls[];} ProtoImpls;
  type Value (line 70) | typedef Value *(FnType0)(FnArity *);
  type Value (line 71) | typedef Value *(FnType1)(FnArity *, Value *);
  type Value (line 72) | typedef Value *(FnType2)(FnArity *, Value *, Value *);
  type Value (line 73) | typedef Value *(FnType3)(FnArity *, Value *, Value *, Value *);
  type Value (line 74) | typedef Value *(FnType4)(FnArity *, Value *, Value *, Value *, Value *);
  type Value (line 75) | typedef Value *(FnType5)(FnArity *, Value *, Value *, Value *, Value *, ...
  type Value (line 76) | typedef Value *(FnType6)(FnArity *, Value *, Value *, Value *, Value *, ...
  type Value (line 77) | typedef Value *(FnType7)(FnArity *, Value *, Value *, Value *, Value *, ...
  type Value (line 78) | typedef Value *(FnType8)(FnArity *, Value *, Value *, Value *, Value *, ...
  type Value (line 79) | typedef Value *(FnType9)(FnArity *, Value *, Value *, Value *, Value *, ...
  type extractCache (line 81) | typedef struct {
  type intGenerator (line 85) | typedef struct {