Packages April 2012

packages@lists.squeakfoundation.org

1 participants
129 discussions

The Trunk: Kernel-eem.684.mcz
by commits＠source.squeak.org 26 Apr '12

26 Apr '12

Eliot Miranda uploaded a new version of Kernel to project The Trunk: http://source.squeak.org/trunk/Kernel-eem.684.mcz ==================== Summary ==================== Name: Kernel-eem.684 Author: eem Time: 26 April 2012, 11:07:37.737 am UUID: e838a325-27ec-4a62-a907-d4059451a046 Ancestors: Kernel-nice.683 Implement endPC numArgs and numTemps for closures and contexts (both block and method activations). Provide CompiledMethod>abstractBytecodeMessagesDo: et al. Implement BlockClosure>isClean to identify self-contained blocks. =============== Diff against Kernel-nice.683 =============== Item was added: + ----- Method: BlockClosure>>abstractBytecodeMessagesDo: (in category 'scanning') ----- + abstractBytecodeMessagesDo: aBlock + "Evaluate aBlock with the sequence of abstract bytecodes in the receiver." + self method + abstractBytecodeMessagesFrom: startpc + to: self endPC + do: aBlock + + "| msgs | + msgs := OrderedCollection new. + (SortedCollection sortBlock: [:a :b| a compare: b caseSensitive: false]) sortBlock + abstractBytecodeMessagesDo: [:msg| msgs add: msg selector]. + msgs"! Item was added: + ----- Method: BlockClosure>>blockCreationBytecodeMessage (in category 'scanning') ----- + blockCreationBytecodeMessage + "Answer the abstract bytecode message that created the receiver." + | blockCreationBytecodeSize | + ^self method abstractBytecodeMessageAt: startpc - (blockCreationBytecodeSize := 4) + + "(SortedCollection sortBlock: [:a :b| a compare: b caseSensitive: false]) sortBlock blockCreationBytecodeMessage"! Item was added: + ----- Method: BlockClosure>>endPC (in category 'accessing') ----- + endPC + ^self blockCreationBytecodeMessage arguments last + startpc - 1! Item was changed: ----- Method: BlockClosure>>hasMethodReturn (in category 'testing') ----- hasMethodReturn "Answer whether the receiver has a method-return ('^') in its code." + | scanner endpc | + scanner := InstructionStream new method: outerContext method pc: startpc. + endpc := self endPC. + scanner scanFor: [:byte | (byte between: 120 and: 124) or: [scanner pc > endpc]]. + ^scanner pc <= endpc! - | myMethod scanner preceedingBytecodeMessage end | - "Determine end of block from the instruction preceding it. - Find the instruction by using an MNU handler to capture - the instruction message sent by the scanner." - myMethod := outerContext method. - scanner := InstructionStream new method: myMethod pc: myMethod initialPC. - [scanner pc < startpc] whileTrue: - [[scanner interpretNextInstructionFor: nil] - on: MessageNotUnderstood - do: [:ex| preceedingBytecodeMessage := ex message]]. - end := preceedingBytecodeMessage arguments last + startpc - 1. - scanner method: myMethod pc: startpc. - scanner scanFor: [:byte | (byte between: 120 and: 124) or: [scanner pc > end]]. - ^scanner pc <= end! Item was added: + ----- Method: BlockClosure>>isClean (in category 'testing') ----- + isClean + "Answer if the receiver does not close-over any variables other than globals, and does + not ^-return (does not close over the home context). Clean blocks are amenable to + being created at compile-time." + self numCopiedValues > 0 ifTrue: + [^false]. + self abstractBytecodeMessagesDo: + [:msg| + (#( pushReceiver + pushReceiverVariable: popIntoReceiverVariable: storeIntoReceiverVariable: + methodReturnConstant: methodReturnReceiver methodReturnTop) + includes: msg selector) ifTrue: + [^false]]. + ^true + + "clean:" + "[] isClean" + "[:a :b| a < b] isClean" + "unclean" + "[^nil] isClean" + "[self class] isClean" + "| v | v := 0. + [v class] isClean"! Item was added: + ----- Method: BlockClosure>>numTemps (in category 'accessing') ----- + numTemps + "Answer the number of temporaries for the receiver; this includes + the number of arguments and the number of copied values." + | blockCreationBytecodeSize | + ^self numCopiedValues + + self numArgs + + (BlockLocalTempCounter + tempCountForBlockAt: startpc - (blockCreationBytecodeSize := 4) + in: self method)! Item was added: + ----- Method: CompiledMethod>>abstractBytecodeMessageAt: (in category 'scanning') ----- + abstractBytecodeMessageAt: pc + "Answer the abstract bytecode message at pc in the receiver." + ^[(InstructionStream new method: self pc: pc) interpretNextInstructionFor: nil] + on: MessageNotUnderstood + do: [:ex| ex message]! Item was added: + ----- Method: CompiledMethod>>abstractBytecodeMessagesDo: (in category 'scanning') ----- + abstractBytecodeMessagesDo: aBlock + "Evaluate aBlock with the sequence of abstract bytecodes in the receiver" + self abstractBytecodeMessagesFrom: self initialPC + to: self endPC + do: aBlock + + "| msgs | + msgs := OrderedCollection new. + CompiledMethod >> #abstractBytecodeMessagesFrom:to: abstractBytecodeMessagesDo: + [:msg| msgs add: msg selector]. + msgs"! Item was added: + ----- Method: CompiledMethod>>abstractBytecodeMessagesFrom:to:do: (in category 'scanning') ----- + abstractBytecodeMessagesFrom: startpc to: endpc do: aBlock + "Evaluate aBlock with the sequence of abstract bytecodes from startpc through endpc in the receiver" + | scanner | + scanner := InstructionStream new method: self pc: startpc. + [scanner pc <= endpc] whileTrue: + [[scanner interpretNextInstructionFor: nil] + on: MessageNotUnderstood + do: [:ex| aBlock value: ex message]] + + "| m msgs | + msgs := OrderedCollection new. + (m := CompiledMethod >> #abstractBytecodeMessagesFrom:to:) + abstractBytecodeMessagesFrom: m initialPC + to: m endPC + do: [:msg| msgs add: msg selector]. + msgs"! Item was added: + ----- Method: MethodContext>>endPC (in category 'private') ----- + endPC + ^closureOrNil + ifNil: [self method endPC] + ifNotNil: [closureOrNil endPC]! Item was added: + ----- Method: MethodContext>>numArgs (in category 'accessing') ----- + numArgs + "Answer the number of arguments for this activation." + ^closureOrNil + ifNil: [method numArgs] + ifNotNil: [closureOrNil numArgs]! Item was added: + ----- Method: MethodContext>>numTemps (in category 'accessing') ----- + numTemps + "Answer the number of temporaries for this activation; this includes + the number of arguments, and for blocks, the number of copied values." + ^closureOrNil + ifNil: [method numTemps] + ifNotNil: [closureOrNil numTemps]!

1 0

The Trunk: Kernel-eem.684.mcz
by commits＠source.squeak.org 26 Apr '12

26 Apr '12

1 0

The Trunk: Kernel-nice.683.mcz
by commits＠source.squeak.org 26 Apr '12

26 Apr '12

Nicolas Cellier uploaded a new version of Kernel to project The Trunk: http://source.squeak.org/trunk/Kernel-nice.683.mcz ==================== Summary ==================== Name: Kernel-nice.683 Author: nice Time: 26 April 2012, 7:06:10.666 pm UUID: a7c12ee7-fee9-ae44-b849-f314f0859c25 Ancestors: Kernel-eem.682, Kernel-nice.652 Merge with nice.652 (Float unambiguous printing). =============== Diff against Kernel-eem.682 =============== Item was changed: ----- Method: Float>>absPrintExactlyOn:base: (in category 'printing') ----- absPrintExactlyOn: aStream base: base "Print my value on a stream in the given base. Assumes that my value is strictly positive; negative numbers, zero, and NaNs have already been handled elsewhere. Based upon the algorithm outlined in: Robert G. Burger and R. Kent Dybvig Printing Floating Point Numbers Quickly and Accurately ACM SIGPLAN 1996 Conference on Programming Language Design and Implementation June 1996. This version guarantees that the printed representation exactly represents my value by using exact integer arithmetic." | significand exp baseExpEstimate r s mPlus mMinus scale roundingIncludesLimits d tc1 tc2 fixedFormat decPointCount slowbit shead | self isInfinite ifTrue: [aStream nextPutAll: 'Infinity'. ^ self]. significand := self significandAsInteger. roundingIncludesLimits := significand even. exp := (self exponent - 52) max: MinValLogBase2. baseExpEstimate := (self exponent * base asFloat reciprocalLogBase2 - 1.0e-10) ceiling. exp >= 0 ifTrue: [significand ~= 16r10000000000000 ifTrue: [r := significand bitShift: 1 + exp. s := 2. mPlus := mMinus := 1 bitShift: exp] ifFalse: [r := significand bitShift: 2 + exp. s := 4. mPlus := 2 * (mMinus := 1 bitShift: exp)]] ifFalse: [(exp = MinValLogBase2 or: [significand ~= 16r10000000000000]) ifTrue: [r := significand bitShift: 1. s := 1 bitShift: 1 - exp. mPlus := mMinus := 1] ifFalse: [r := significand bitShift: 2. s := 1 bitShift: 2 - exp. mPlus := 2. mMinus := 1]]. baseExpEstimate >= 0 ifTrue: [s := s * (base raisedToInteger: baseExpEstimate)] ifFalse: [scale := base raisedToInteger: baseExpEstimate negated. r := r * scale. mPlus := mPlus * scale. mMinus := mMinus * scale]. + ((r + mPlus >= s) and: [roundingIncludesLimits or: [r + mPlus > s]]) - ((r + mPlus < s) not and: [roundingIncludesLimits or: [r + mPlus > s]]) ifTrue: [baseExpEstimate := baseExpEstimate + 1] ifFalse: [r := r * base. mPlus := mPlus * base. mMinus := mMinus * base]. (fixedFormat := baseExpEstimate between: -3 and: 6) ifTrue: [decPointCount := baseExpEstimate. baseExpEstimate <= 0 ifTrue: [aStream nextPutAll: ('0.000000' truncateTo: 2 - baseExpEstimate)]] ifFalse: [decPointCount := 1]. slowbit := 1 - s lowBit . shead := s bitShift: slowbit. [d := (r bitShift: slowbit) // shead. r := r - (d * s). + (tc1 := (r <= mMinus) and: [roundingIncludesLimits or: [r < mMinus]]) | + (tc2 := (r + mPlus >= s) and: [roundingIncludesLimits or: [r + mPlus > s]])] whileFalse: - (tc1 := (r > mMinus) not and: [roundingIncludesLimits or: [r < mMinus]]) | - (tc2 := (r + mPlus < s) not and: [roundingIncludesLimits or: [r + mPlus > s]])] whileFalse: [aStream nextPut: (Character digitValue: d). r := r * base. mPlus := mPlus * base. mMinus := mMinus * base. + (decPointCount := decPointCount - 1) = 0 ifTrue: [aStream nextPut: $.]]. - decPointCount := decPointCount - 1. - decPointCount = 0 ifTrue: [aStream nextPut: $.]]. tc2 ifTrue: [(tc1 not or: [r * 2 >= s]) ifTrue: [d := d + 1]]. aStream nextPut: (Character digitValue: d). decPointCount > 0 ifTrue: + [decPointCount - 1 to: 1 by: -1 do: [:i | aStream nextPut: $0]. + aStream nextPutAll: '.0']. + fixedFormat + ifFalse: + [aStream nextPut: $e. + aStream nextPutAll: (baseExpEstimate - 1) printString]! - [decPointCount - 1 to: 1 by: -1 do: [:i | aStream nextPut: $0]. - aStream nextPutAll: '.0']. - fixedFormat ifFalse: - [aStream nextPut: $e. - aStream nextPutAll: (baseExpEstimate - 1) printString]! Item was changed: ----- Method: Float>>printOn:base: (in category 'printing') ----- printOn: aStream base: base + "Print the receiver with the minimal number of digits that describes it unambiguously. + This way, every two different Float will have a different printed representation. + More over, every Float can be reconstructed from its printed representation with #readFrom:." - "Handle sign, zero, and NaNs; all other values passed to absPrintOn:base:" self isNaN ifTrue: [aStream nextPutAll: 'NaN'. ^ self]. "check for NaN before sign" self > 0.0 + ifTrue: [self absPrintExactlyOn: aStream base: base] - ifTrue: [self absPrintOn: aStream base: base] ifFalse: [self sign = -1 ifTrue: [aStream nextPutAll: '-']. self = 0.0 + ifTrue: [aStream nextPutAll: '0.0'] + ifFalse: [self negated absPrintExactlyOn: aStream base: base]]! - ifTrue: [aStream nextPutAll: '0.0'. ^ self] - ifFalse: [self negated absPrintOn: aStream base: base]]!

1 0

The Trunk: Kernel-nice.683.mcz
by commits＠source.squeak.org 26 Apr '12

26 Apr '12

1 0

The Trunk: Kernel-nice.683.mcz
by commits＠source.squeak.org 26 Apr '12

26 Apr '12

1 0

The Trunk: Kernel-nice.652.mcz
by commits＠source.squeak.org 26 Apr '12

26 Apr '12

Nicolas Cellier uploaded a new version of Kernel to project The Trunk: http://source.squeak.org/trunk/Kernel-nice.652.mcz ==================== Summary ==================== Name: Kernel-nice.652 Author: nice Time: 5 November 2011, 12:54:57.688 am UUID: 6588c880-ca5d-4c3d-a39b-b75588ce0263 Ancestors: Kernel-laza.649 PURPOSE: Any Float now prints with the minimal number of digits that describes it unambiguously. This way, every two different Float will have a different printed representation. More over, every Float can be reconstructed from its printed representation with #readFrom:. self assert: ([:f | f isNaN or: [(Float readFrom: f printString) = f]] value: Float someInstance). Note that Float nan, Float infinity and Float infinity negated still print as 'NaN' 'Infinity' and '-Infinity' which are compatible with #readFrom:. RATIONALE: the old behaviour was obscuring our data like for example: 0.1 successor printString = 0.1 printString. 1.0e-100 printString = '9.99999999999999e-101'. The old behaviour was returning many digits without any guaranty of exactness which is useless. The old behaviour was faster (x4) but this is less relevant than exactness. Similar or better speed should be obtained by controlling number of printed digits if we can afford inexactness. IMPLEMENTATION: The essential change was to use #absPrintExactlyOn:base: in #printOn:base: Side note: this is really a bad name, because it prints the shortest base-representation, not the exact one. Anyway, we can only print the exact one in even bases. For example, the exact representation of 0.1 in base 10 is: 0.1 asFraction asScaledDecimal = 0.1000000000000000055511151231257827021181583404541015625s55. The second change was to marginally fast-up #absPrintExactlyOn:base: main loop by avoiding a #not send and piping decimal point test. Avoiding the #not makes the intention a tiny bit clearer. Also of few formatting has been performed in the last lines. REJECTED CHANGES: It is possible to move self > 0.0 before self isNaN to statistically reduce the number of tests performed. This works because Float nan > 0.0 = false. But this speed-up is quite marginal. Similarly (self = Infinity) could replace (self isInfinite) and save another send and also another test (because NegativeInfinity can't happen at this stage). This would be at the price of a class var reference leak. It could be more interesting to move this #isInfinite test in #printOn:base: in order to gather print rules for exceptional values. I didn't to avoid duplicating the test in the two branches > 0.0 and < 0.0. A far more efficient speed-up would be to optimize LargeInteger arithmetic. I think there is room, the VM is still using byte operations (thus at most 16 bits). =============== Diff against Kernel-laza.649 =============== Item was changed: ----- Method: Float>>absPrintExactlyOn:base: (in category 'printing') ----- absPrintExactlyOn: aStream base: base "Print my value on a stream in the given base. Assumes that my value is strictly positive; negative numbers, zero, and NaNs have already been handled elsewhere. Based upon the algorithm outlined in: Robert G. Burger and R. Kent Dybvig Printing Floating Point Numbers Quickly and Accurately ACM SIGPLAN 1996 Conference on Programming Language Design and Implementation June 1996. This version guarantees that the printed representation exactly represents my value by using exact integer arithmetic." | significand exp baseExpEstimate r s mPlus mMinus scale roundingIncludesLimits d tc1 tc2 fixedFormat decPointCount slowbit shead | self isInfinite ifTrue: [aStream nextPutAll: 'Infinity'. ^ self]. significand := self significandAsInteger. roundingIncludesLimits := significand even. exp := (self exponent - 52) max: MinValLogBase2. baseExpEstimate := (self exponent * base asFloat reciprocalLogBase2 - 1.0e-10) ceiling. exp >= 0 ifTrue: [significand ~= 16r10000000000000 ifTrue: [r := significand bitShift: 1 + exp. s := 2. mPlus := mMinus := 1 bitShift: exp] ifFalse: [r := significand bitShift: 2 + exp. s := 4. mPlus := 2 * (mMinus := 1 bitShift: exp)]] ifFalse: [(exp = MinValLogBase2 or: [significand ~= 16r10000000000000]) ifTrue: [r := significand bitShift: 1. s := 1 bitShift: 1 - exp. mPlus := mMinus := 1] ifFalse: [r := significand bitShift: 2. s := 1 bitShift: 2 - exp. mPlus := 2. mMinus := 1]]. baseExpEstimate >= 0 ifTrue: [s := s * (base raisedToInteger: baseExpEstimate)] ifFalse: [scale := base raisedToInteger: baseExpEstimate negated. r := r * scale. mPlus := mPlus * scale. mMinus := mMinus * scale]. + ((r + mPlus >= s) and: [roundingIncludesLimits or: [r + mPlus > s]]) - ((r + mPlus < s) not and: [roundingIncludesLimits or: [r + mPlus > s]]) ifTrue: [baseExpEstimate := baseExpEstimate + 1] ifFalse: [r := r * base. mPlus := mPlus * base. mMinus := mMinus * base]. (fixedFormat := baseExpEstimate between: -3 and: 6) ifTrue: [decPointCount := baseExpEstimate. baseExpEstimate <= 0 ifTrue: [aStream nextPutAll: ('0.000000' truncateTo: 2 - baseExpEstimate)]] ifFalse: [decPointCount := 1]. slowbit := 1 - s lowBit . shead := s bitShift: slowbit. [d := (r bitShift: slowbit) // shead. r := r - (d * s). + (tc1 := (r <= mMinus) and: [roundingIncludesLimits or: [r < mMinus]]) | + (tc2 := (r + mPlus >= s) and: [roundingIncludesLimits or: [r + mPlus > s]])] whileFalse: - (tc1 := (r > mMinus) not and: [roundingIncludesLimits or: [r < mMinus]]) | - (tc2 := (r + mPlus < s) not and: [roundingIncludesLimits or: [r + mPlus > s]])] whileFalse: [aStream nextPut: (Character digitValue: d). r := r * base. mPlus := mPlus * base. mMinus := mMinus * base. + (decPointCount := decPointCount - 1) = 0 ifTrue: [aStream nextPut: $.]]. - decPointCount := decPointCount - 1. - decPointCount = 0 ifTrue: [aStream nextPut: $.]]. tc2 ifTrue: [(tc1 not or: [r * 2 >= s]) ifTrue: [d := d + 1]]. aStream nextPut: (Character digitValue: d). decPointCount > 0 ifTrue: + [decPointCount - 1 to: 1 by: -1 do: [:i | aStream nextPut: $0]. + aStream nextPutAll: '.0']. + fixedFormat + ifFalse: + [aStream nextPut: $e. + aStream nextPutAll: (baseExpEstimate - 1) printString]! - [decPointCount - 1 to: 1 by: -1 do: [:i | aStream nextPut: $0]. - aStream nextPutAll: '.0']. - fixedFormat ifFalse: - [aStream nextPut: $e. - aStream nextPutAll: (baseExpEstimate - 1) printString]! Item was changed: ----- Method: Float>>printOn:base: (in category 'printing') ----- printOn: aStream base: base + "Print the receiver with the minimal number of digits that describes it unambiguously. + This way, every two different Float will have a different printed representation. + More over, every Float can be reconstructed from its printed representation with #readFrom:." - "Handle sign, zero, and NaNs; all other values passed to absPrintOn:base:" self isNaN ifTrue: [aStream nextPutAll: 'NaN'. ^ self]. "check for NaN before sign" self > 0.0 + ifTrue: [self absPrintExactlyOn: aStream base: base] - ifTrue: [self absPrintOn: aStream base: base] ifFalse: [self sign = -1 ifTrue: [aStream nextPutAll: '-']. self = 0.0 + ifTrue: [aStream nextPutAll: '0.0'] + ifFalse: [self negated absPrintExactlyOn: aStream base: base]]! - ifTrue: [aStream nextPutAll: '0.0'. ^ self] - ifFalse: [self negated absPrintOn: aStream base: base]]!

1 0

The Trunk: Kernel-nice.652.mcz
by commits＠source.squeak.org 26 Apr '12

26 Apr '12

1 0

The Trunk: Kernel-nice.652.mcz
by commits＠source.squeak.org 26 Apr '12

26 Apr '12

1 0

The Trunk: Monticello-eem.505.mcz
by commits＠source.squeak.org 26 Apr '12

26 Apr '12

Eliot Miranda uploaded a new version of Monticello to project The Trunk: http://source.squeak.org/trunk/Monticello-eem.505.mcz ==================== Summary ==================== Name: Monticello-eem.505 Author: eem Time: 26 April 2012, 9:41:06.528 am UUID: 343bf518-4d54-4622-a5ff-4a6c299ddfd2 Ancestors: Monticello-bf.504 Simple history search for the working copy browser. Open a Workspace containing all the history (version summaries) for the current package. =============== Diff against Monticello-bf.504 =============== Item was added: + ----- Method: MCWorkingCopyBrowser>>searchHistory (in category 'actions') ----- + searchHistory + workingCopy ifNotNil: + [(UIManager default + edit: (String streamContents: + [:s| + "Ignore the initial MCWorkingAncestry instance." + workingCopy ancestry topologicalAncestors allButFirst + do: [:versionInfo| + s nextPutAll: versionInfo summary] + separatedBy: [s cr; cr"; next: 32 put: $-; cr; cr"]]) + label: 'Version History: ', workingCopy packageName) + extent: (0.6@1) * Display height * 0.9]! Item was changed: ----- Method: MCWorkingCopyBrowser>>workingCopyListMenu: (in category 'morphic ui') ----- workingCopyListMenu: aMenu workingCopy ifNil: [^ aMenu]. self fillMenu: aMenu fromSpecs: #(('add required package' #addRequiredPackage) ('clear required packages' #clearRequiredPackages) ('add repository...' #addPackageRepository) ('browse package' #browseWorkingCopy) ('view changes' #viewChanges) ('view history' #viewHistory) + ('search history' #searchHistory) ('recompile package' #recompilePackage) ('revert package...' #revertPackage) ('unload package' #unloadPackage) ('delete working copy' #deleteWorkingCopy) ('rename package...' #renamePackage)). (Smalltalk includesKey: #SARMCPackageDumper) ifTrue: [ aMenu add: 'make SAR' target: self selector: #fileOutAsSAR ]. self insertExternalMenuEntries: aMenu. ^aMenu!

1 0

The Trunk: Monticello-eem.505.mcz
by commits＠source.squeak.org 26 Apr '12

26 Apr '12

1 0

2024

2023

2022

2021

2020

2019

2018

2017

2016

2015

2014

2013

2012

2011

2010

2009

2008

2007

2006

2005

Packages April 2012