Nim - This repository contains the Nim compiler, Nim's stdlib, tools, and documentation. (mirror)

	Commit message (Expand)	Author	Age	Files	Lines
*	specialize genericReset (#14398)	Andreas Rumpf	2020-05-19	1	-1/+1
*	fixes #13881	Andreas Rumpf	2020-05-12	1	-3/+4
*	Error -> Defect for defects (#13908)	Jacek Sieka	2020-04-28	1	-1/+1
*	forward type alignment information to seqs (#12430)	Arne Döring	2020-04-19	1	-7/+8
*	catchable defects (#13626)	Andreas Rumpf	2020-03-12	1	-2/+4
*	first implementation of the new --seqsv2 switch	Araq	2019-10-20	1	-2/+2
*	gc:destructors progress	Araq	2019-09-01	1	-1/+1
*	styleCheck: make the compiler and large parts of the stdlib compatible with -...	Araq	2019-07-10	1	-4/+4
*	gc: removed dead code	Andreas Rumpf	2019-03-14	1	-3/+0
*	code cleanup: there is no tyOptRef	Andreas Rumpf	2019-02-22	1	-4/+4
*	system refactorings (#10559)	Andreas Rumpf	2019-02-06	1	-1/+2
*	fixes #10271 [backport]	Araq	2019-01-13	1	-1/+2
*	Remove dead code (#9777)	Jacek Sieka	2018-11-26	1	-22/+2
*	more progress on destructor based strings	Andreas Rumpf	2018-07-13	1	-47/+49
*	M&S GC: collect earlier under memory pressure	Andreas Rumpf	2018-01-30	1	-6/+7
*	M&S GC: minor code cleanup	Andreas Rumpf	2018-01-21	1	-6/+0
*	Mark&Sweep GC: introduce nimTracing define for debugging	Andreas Rumpf	2018-01-19	1	-1/+38
*	GC: enable precise global/thread local storage tracing	Araq	2018-01-15	1	-10/+5
*	GC improvements; distinguish between thread local and globals in the marking ...	Araq	2018-01-14	1	-17/+6
*	Fixed mutex usage in SharedList and SharedTable. Closes #6988 (#6990)	Yuriy Glukhov	2017-12-31	1	-1/+1
*	more replacements for the deprecated '<'	Andreas Rumpf	2017-10-29	1	-2/+2
*	GCs: use add instead of &	Andreas Rumpf	2017-09-29	1	-3/+3
*	first steps of making 'opt' a first class type for Nim	Andreas Rumpf	2017-09-25	1	-4/+4
*	added system.deallocHeap feature for Nim's native GCs	Andreas Rumpf	2017-07-22	1	-12/+0
*	make the GCs more robust	Andreas Rumpf	2017-07-20	1	-7/+7
*	added logic to the M&S GC to detect logical leaks	Araq	2017-06-16	1	-0/+55
*	Cleanup of gc code	Rokas Kupstys	2017-02-20	1	-14/+16
*	system.nim: don't use deprecated symbols/constructs	Araq	2017-02-08	1	-1/+1
*	M&S GC gets the heap dump feature	Andreas Rumpf	2017-01-15	1	-14/+17
*	Add `import sharedlist` when `hasThreadSupport`	James Boyden	2016-04-05	1	-0/+3
*	GCs support ForeignCells	Andreas Rumpf	2016-03-05	1	-0/+7
*	fixes #3245	Araq	2015-08-25	1	-1/+2
*	Coroutine support for i386/amd64 platforms unix/windows OSes markAndSweep/ref...	rku	2015-07-31	1	-153/+23
*	Fixes compilation with --gc:markandsweep.	Dominik Picheta	2015-06-04	1	-1/+1
*	lib/system/g-w - Dropped 'T' from types	pdw	2015-06-04	1	-47/+48
*	Fix GC scanning of registers on x86_64 architectures.	Reimer Behrends	2015-05-07	1	-0/+9
*	Fix proc call in gc_ms	def	2015-03-26	1	-1/+1
*	fixed the tester; more tests green	Araq	2015-03-10	1	-18/+22
*	Fix typos	Federico Ceratto	2015-02-15	1	-1/+1
*	fixes #2070	Araq	2015-02-10	1	-4/+6
*	Happy new year!	Guillaume Gelin	2015-01-06	1	-1/+1
*	added 'setupGcForForeignThread' for better C interop	Araq	2014-12-11	1	-0/+14
*	introduced 'benign' pragma	Araq	2014-10-25	1	-8/+8
*	make tests green	Araq	2014-08-31	1	-26/+26
*	the big renamefest: first steps	Araq	2014-08-22	1	-2/+2
*	implemented builtin noncopying slice	Araq	2014-05-02	1	-0/+1
*	bugfix: MS-GC GC_unref	Araq	2014-04-30	1	-1/+2
*	bugfix: MS GC acknowledges GC_ref/unref properly	Araq	2014-04-30	1	-6/+45
*	marked markAndSweep GC thread safe	Araq	2014-04-20	1	-8/+8
*	mark and sweep GC compiles with --cs:partial	Araq	2014-02-02	1	-14/+14

import ast, idents, lineinfos, modulegraphs, magicsys when defined(nimPreviewSlimSystem): import std/assertions proc genEnumToStrProc*(t: PType; info: TLineInfo; g: ModuleGraph; idgen: IdGenerator): PSym = result = newSym(skProc, getIdent(g.cache, "$"), nextSymId idgen, t.owner, info) let dest = newSym(skParam, getIdent(g.cache, "e"), nextSymId idgen, result, info) dest.typ = t let res = newSym(skResult, getIdent(g.cache, "result"), nextSymId idgen, result, info) res.typ = getSysType(g, info, tyString) result.typ = newType(tyProc, nextTypeId idgen, t.owner) result.typ.n = newNodeI(nkFormalParams, info) rawAddSon(result.typ, res.typ) result.typ.n.add newNodeI(nkEffectList, info) result.typ.addParam dest var body = newNodeI(nkStmtList, info) var caseStmt = newNodeI(nkCaseStmt, info) caseStmt.add(newSymNode dest) # copy the branches over, but replace the fields with the for loop body: for i in 0..<t.n.len: assert(t.n[i].kind == nkSym) var field = t.n[i].sym let val = if field.ast == nil: field.name.s else: field.ast.strVal caseStmt.add newTree(nkOfBranch, newSymNode(field), newTree(nkStmtList, newTree(nkFastAsgn, newSymNode(res), newStrNode(val, info)))) #newIntTypeNode(nkIntLit, field.position, t) body.add(caseStmt) var n = newNodeI(nkProcDef, info, bodyPos+2) for i in 0..<n.len: n[i] = newNodeI(nkEmpty, info) n[namePos] = newSymNode(result) n[paramsPos] = result.typ.n n[bodyPos] = body n[resultPos] = newSymNode(res) result.ast = n incl result.flags, sfFromGeneric incl result.flags, sfNeverRaises proc searchObjCaseImpl(obj: PNode; field: PSym): PNode = case obj.kind of nkSym: result = nil of nkElse, nkOfBranch: result = searchObjCaseImpl(obj.lastSon, field) else: if obj.kind == nkRecCase and obj[0].kind == nkSym and obj[0].sym == field: result = obj else: for x in obj: result = searchObjCaseImpl(x, field) if result != nil: break proc searchObjCase(t: PType; field: PSym): PNode = result = searchObjCaseImpl(t.n, field) if result == nil and t.len > 0: result = searchObjCase(t[0].skipTypes({tyAlias, tyGenericInst, tyRef, tyPtr}), field) doAssert result != nil proc genCaseObjDiscMapping*(t: PType; field: PSym; info: TLineInfo; g: ModuleGraph; idgen: IdGenerator): PSym = result = newSym(skProc, getIdent(g.cache, "objDiscMapping"), nextSymId idgen, t.owner, info) let dest = newSym(skParam, getIdent(g.cache, "e"), nextSymId idgen, result, info) dest.typ = field.typ let res = newSym(skResult, getIdent(g.cache, "result"), nextSymId idgen, result, info) res.typ = getSysType(g, info, tyUInt8) result.typ = newType(tyProc, nextTypeId idgen, t.owner) result.typ.n = newNodeI(nkFormalParams, info) rawAddSon(result.typ, res.typ) result.typ.n.add newNodeI(nkEffectList, info) result.typ.addParam dest var body = newNodeI(nkStmtList, info) var caseStmt = newNodeI(nkCaseStmt, info) caseStmt.add(newSymNode dest) let subObj = searchObjCase(t, field) for i in 1..<subObj.len: let ofBranch = subObj[i] var newBranch = newNodeI(ofBranch.kind, ofBranch.info) for j in 0..<ofBranch.len-1: newBranch.add ofBranch[j] newBranch.add newTree(nkStmtList, newTree(nkFastAsgn, newSymNode(res), newIntNode(nkInt8Lit, i))) caseStmt.add newBranch body.add(caseStmt) var n = newNodeI(nkProcDef, info, bodyPos+2) for i in 0..<n.len: n[i] = newNodeI(nkEmpty, info) n[namePos] = newSymNode(result) n[paramsPos] = result.typ.n n[bodyPos] = body n[resultPos] = newSymNode(res) result.ast = n incl result.flags, sfFromGeneric incl result.flags, sfNeverRaises