Microsoft Technology Licensing, LLC

Peter F Sollich

Patrick Henri Dussud

Anders Hejlsberg

Scott Michael Wiltamuth

Scott D Mosier

Michael M Magruder

Maoni Zhang Stephens

Frank V Peschel-Gallee

Jan Kotas

Madhusudhan Talluri

Rudi Martin

Bradley Moore Abrams

Andrew J Pardoe

Simon Jeremy Hall

Raja Krishnaswamy

David Charles Wrighton

Ori Gershony

Peter H Golde

Fadi M Hanna

Surupa Biswas

Claudio Caldato

An arena-based memory management system is disclosed. In response to a call to reclaim memory storing a plurality of objects allocated in an arena, a garbage collection of the arena is triggered based on heap-related parameter. A live object of the plurality of objects is preserved with the garbage collection.

Arena-based memory management

An instance of universally shared generic code is generated. A runtime parameter enables the size of a stack frame on which local data can be stored to be determined. Dynamically sized locals can be stored on a stack enabling precise garbage collection reporting. One frame of the stack is allocated for each code segment to simplify GC reporting. A reporting region in the frame memory region comprises a count of locals and a location at which the local is found in the stack.

Dynamically sized locals with precise garbage collection reporting

The efficient use of type descriptors with frozen objects. A frozen object might actually include several type descriptors, a primary type descriptor that is canonical according to a set of canonicalization rules, and an auxiliary type descriptor that is not identical to the primary type descriptor. The auxiliary type descriptor may be used to access the canonical type descriptor. When performing an operation, if the auxiliary type descriptor can be used to perform the operation, then that auxiliary type descriptor may be used. If the canonical type descriptor is to be used to perform the operation, the auxiliary type descriptor is used to gain access to the canonical primary type descriptor. The primary type descriptor is then used to perform the operation.

Type descriptor management for frozen objects

Mechanisms that allow frameworks significant flexibility in varying the library of common base classes in a manner that better suits the domain of applications served by the framework. Instead of providing the base class library, the runtime provides a data contract for the data structure of each base class. The frameworks can then define each base class in a custom way so long as the data contract is honored. Thus, for example, the framework may provide custom framework-specific methods and/or properties as is appropriate for the framework. Another framework might define the base classes in a different way.

Flexible base class library

A system and methods are provided for implementing an explicit interface member in connection with a computer programming language. Thus, a mechanism is provided that prevents conflicts between independently developed interfaces, enables privately implemented interface members and enables specific versions of generic interfaces that are free from conflict.

System and methods for implementing an explicit interface member in a computer programming language

Various technologies and techniques are disclosed that provides targeted patching for native generation images. Changed binaries are updated with information that indicates whether or not they contain safe changes. A servicing process can then be provided for a client machine. For any compatible binaries with changes that have been identified as safe, a native generation update is performed that includes recompilation of the compatible binaries with the safe changes, and an updating of binding information for any dependent binaries. For any non-compatible binaries with changes that have been identified as unsafe, a native generation update is performed that includes recompilation of any non-compatible binaries and any dependent binaries.

Targeted patching for native generation images

A system and methods for versioning software components in connection with a computer programming language are provided. In exemplary aspects, the versioning system makes use of intelligent defaults, provides a vehicle for unambiguous specification of developer intent and implements conflict resolution rules in connection with the versioning of software components. In another aspect, the versioning system bounds names at run-time, but does not bound offsets at compile-time.

System and methods for providing versioning of software components in a computer programming language

Various technologies and techniques are disclosed for providing optimized garbage collection. A garbage collector is provided for managing a garbage collection process. An optimized garbage collection feature is provided that allows the garbage collection process to be suggested. When the optimized garbage collection feature is invoked at a particular moment, the system determines if collection is appropriate at the particular moment. If collection is determined to be appropriate at the particular moment, then the system performs the garbage collection process. If collection is determined to not be appropriate at the particular moment, then the system delays garbage collection until an appropriate time. A low latency mode can be used to automatically ensure that the garbage collection process starts sooner than it would in a normal mode. The latency mode in use can be changed at different points in time during the garbage collection process.

Optimized garbage collection techniques

A system and method is provided for facilitating and implementing an efficient mechanism for doing an interface dispatch. The system and method retrieves source code and performs a pre-execution or preparation stage prior to execution of the source code. During the pre-execution stage memory is allocated for class types, class method tables are formed and interface virtual tables are formed. A block of memory is also allocated for an interface map in the form of a vector having a plurality of slots. The system and method packs the interface map with references to the interface virtual table locations utilizing a comb-vector technique.

Interface invoke mechanism

One or more electronically-accessible media including exemplary electronically-executable instructions that, when executed, direct an electronic apparatus to perform actions including: ascertaining, from multiple processors, a processor on which a requesting thread is executing; each processor of the multiple processors associated with each respective heap of multiple respective heaps; and selecting, for a memory allocation to the requesting thread, a respective heap that is associated with the processor on which the requesting thread is executing responsive to the action of ascertaining. An exemplary apparatus includes: at least one memory having multiple memory portions; multiple processors coupled to the at least one memory, each respective processor of the multiple processors executing a respective thread of multiple threads; and a memory allocator adapted to allocate memory resources from a memory portion of the multiple memory portions to each respective thread responsive to the respective processor on which each respective thread is executing.

Heap allocation

A system and method is provided for facilitating and implementing an efficient mechanism for performing an interface dispatch. The system and method retrieves source code and performs a pre-execution or preparation stage prior to execution of the source code. During the pre-execution stage memory is allocated for class types, class method tables are formed and interface virtual tables are formed. A block of memory is also allocated for an interface map in the form of a vector having a plurality of slots. The system and method packs the interface map with references to the interface virtual table locations utilizing a comb-vector technique.

Growing community of inventors

Munich, Germany

Peter F Sollich