Abstract: Described herein are systems, methods, and software to manage new and updated containerized network functions (CNFs). In one implementation, a management service identifies a CNF in a first repository. Once identified, the management service identifies one or more configuration parameters associated with the CNF and updates one or more files for the CN with the one or more configuration parameters. The management service then stores at least the one or more files for the CNF in a second repository. In some implementations, the management service will monitor the first repository for modifications associated with the CNF and will update the files in the second repository based on the modifications.

Abstract: System and computer-implemented method for migrating partial tree structures of virtual disks for virtual computing instances between sites in a computer system uses a compressed trie, which is created from target tree structures of virtual disks at a plurality of target sites in the computer system. For a virtual computing instance selected, the compressed trie is used to find candidate target sites based on a disk chain string of the virtual computing instance. For each candidate target site, a cost value for migrating the virtual computing instance along with a partial source tree structure of virtual disks corresponding to the virtual computing instance from the source site to the candidate target site is calculated to select a target site with a lowest cost value as a migration option to reduce storage resource usage in the computer system.

Abstract: System and computer-implemented method for migrating a tree structure with multiple virtual disks and multiple virtual computing instances from a source computing environment to a destination computing environment involves handling leaf and shared virtual disks of the tree structure differently on a level-by-level basis to produce a replicated tree structure in the destination computing environment. For a leaf virtual disk, the leaf virtual disk and a virtual computing instance attached to the leaf virtual disk are replicated in the destination computing environment. For a shared virtual disk, creating a dummy virtual computing instance is created in the source computing environment and the shared virtual disk and the dummy virtual computing instance are replicated in the destination computing environment. Any dummy virtual computing instances replicated in the destination computing environment for the migration can then be removed.

Abstract: System and computer-implemented method for migrating a tree structure with multiple virtual disks and multiple virtual computing instances from a source computing environment to a destination computing environment involves handling leaf and shared virtual disks of the tree structure differently on a level-by-level basis to produce a replicated tree structure in the destination computing environment. For a leaf virtual disk, the leaf virtual disk and a virtual computing instance attached to the leaf virtual disk are replicated in the destination computing environment. For a shared virtual disk, creating a dummy virtual computing instance is created in the source computing environment and the shared virtual disk and the dummy virtual computing instance are replicated in the destination computing environment. Any dummy virtual computing instances replicated in the destination computing environment for the migration can then be removed.

Abstract: Disclosed are various embodiments for costing Raw-Device Mapping (RDM) disks. A pseudo-datastore is created. The pseudo-datastore represents the RDM disk. The RDM disk includes a mapping file that exposes direct access to a disk identified by a logical unit number (LUN). A unit rate is assigned to the pseudo-datastore, the unit rate representing a cost per unit of storage provided by the RDM disk. Usage of the RDM disk is monitored. A cost is calculated for the usage of the RDM disk for a period of time based on the unit rate assigned to the pseudo-datastore.

Abstract: Disclosed are various embodiments for costing Raw-Device Mapping (RDM) disks. A pseudo-datastore is created. The pseudo-datastore represents the RDM disk. The RDM disk includes a mapping file that exposes direct access to a disk identified by a logical unit number (LUN). A unit rate is assigned to the pseudo-datastore, the unit rate representing a cost per unit of storage provided by the RDM disk. Usage of the RDM disk is monitored. A cost is calculated for the usage of the RDM disk for a period of time based on the unit rate assigned to the pseudo-datastore.

Abstract: Systems and methods for managing review of source code are described. The method may comprise receiving a version of source code that includes a specific change at a specific location in the version of source code that has been affected by one or more programming actions compared to a prior version of source code; and identifying a plurality of prior review requests associated with the specific change. The method may comprise assigning corresponding review points to the plurality of prior review requests; and based on the corresponding review points, selecting a code reviewer from a plurality of code reviewers who each have created or processed a subset of the plurality of prior review requests. The method may further comprise generating a review request for the specific change in the version of source code for processing by the selected code reviewer.

Abstract: Techniques are described for providing recommendations to enhance the logging code in a computer program. In particular, the methods described herein can identify source code locations which lack log printing statements or contain noisy log printing statements. The methods analyze static call graph of the source code, the corresponding commit and bug history, and propose recommendations to enhance logging. The logging behavior in methods whose log printing statements have been significantly modified can be considered to be ideal. The analysis discovers such methods and quantifies their logging behavior. It then compares this logging behavior with the logging behavior of highly critical and/or less critical methods to generate logging enhancement recommendations.

Abstract: Techniques are described for measuring or quantifying the logging behavior in the source code of a computer program. In particular, the techniques select a method identified as exhibiting the ideal logging behavior in a computer program and then compute the overall logging quality score for the entire computer program based on the deviation in logging behaviors between the selected method and all other methods in the source code of the project. This overall logging quality score can be compared to various benchmarks of existing projects with high logging quality. If the software logging quality is found to be low, various steps can be taken by the developers to improve the logging before the software release.

Abstract: Systems and methods for performing query-by-example are described. A query module executing on the system may maintain a source code repository containing a plurality of source code files. Each of the plurality of source code files is associated with a corresponding source syntax structure generated based on said each of the plurality of source code files. The query module may receive a query snippet, and generate a query syntax structure based on the query snippet. The query module may then identify a first source code file from the plurality of source code files for being relevant to the query snippet. The being relevant to the query snippet is determined by a first relevance score which is calculated based on the query syntax structure and the first source code file's corresponding source syntax structure.

Abstract: Techniques are described for identifying the ideal or preferred logging behavior to be followed in a software development project. A numerical weight is computed for each method in the source code that can be used to rank the logging behavior of that method. The numerical weight is computed in such a way that the methods whose log printing statements have been modified more frequently receive higher numerical weights. The assumption is that since most logging enhancements are done as after thoughts during code reviews or while fixing bugs, the ideal logging behavior will be exhibited by those methods whose logging behavior was modified the most frequently. Once the methods have been ranked according to the numerical weight, the highest ranking methods can be used to provide insight to developers about the ideal logging behavior for the project.

Abstract: Systems and methods for managing review of source code are described. The method may comprise receiving a version of source code that includes a specific change at a specific location in the version of source code that has been affected by one or more programming actions compared to a prior version of source code; and identifying a plurality of prior review requests associated with the specific change. The method may comprise assigning corresponding review points to the plurality of prior review requests; and based on the corresponding review points, selecting a code reviewer from a plurality of code reviewers who each have created or processed a subset of the plurality of prior review requests. The method may further comprise generating a review request for the specific change in the version of source code for processing by the selected code reviewer.

Abstract: A virtual computer system, including a plurality of virtual machines (VMs) running on one or more host computers, is configured to manage virtual disks in a manner to facilitate making copies of one or more virtual machines (VMs) by means of a method known as linked cloning. Techniques are disclosed for scanning a storage system to determine the set of VMs, identifying virtual disks associated with each VM, examining parent/child relationships among the virtual disks, and displaying the virtual disk hierarchy. Redundant virtual disks may be identified as the set of virtual disks that have exactly one child disk and that are not associated with a snapshot. Provisions for generating a relocate list to support migration of a linked clone may also be utilized.

Abstract: Techniques are described for measuring or quantifying the logging behavior in the source code of a computer program. In particular, the techniques select a method identified as exhibiting the ideal logging behavior in a computer program and then compute the overall logging quality score for the entire computer program based on the deviation in logging behaviors between the selected method and all other methods in the source code of the project. This overall logging quality score can be compared to various benchmarks of existing projects with high logging quality. If the software logging quality is found to be low, various steps can be taken by the developers to improve the logging before the software release.

Abstract: Techniques are described for identifying the ideal or preferred logging behavior to be followed in a software development project. A numerical weight is computed for each method in the source code that can be used to rank the logging behavior of that method. The numerical weight is computed in such a way that the methods whose log printing statements have been modified more frequently receive higher numerical weights. The assumption is that since most logging enhancements are done as after thoughts during code reviews or while fixing bugs, the ideal logging behavior will be exhibited by those methods whose logging behavior was modified the most frequently. Once the methods have been ranked according to the numerical weight, the highest ranking methods can be used to provide insight to developers about the ideal logging behavior for the project.

Abstract: Techniques are described for providing recommendations to enhance the logging code in a computer program. In particular, the methods described herein can identify source code locations which lack log printing statements or contain noisy log printing statements. The methods analyze static call graph of the source code, the corresponding commit and bug history, and propose recommendations to enhance logging. The logging behavior in methods whose log printing statements have been significantly modified can be considered to be ideal. The analysis discovers such methods and quantifies their logging behavior. It then compares this logging behavior with the logging behavior of highly critical and/or less critical methods to generate logging enhancement recommendations.

Abstract: Systems and methods for performing automatic code review are described. The system receives a version of source code and processes it for potential coding issues based on a code review configuration. Upon detecting a coding issue, the system generates an automatic code review that contains a location identifying the coding issue in the version of source code and an associated review comment selected from the code review configuration. The method includes receiving a version of source code and generating a review request for a specific change in the version of source code. The method then assigns a code reviewer for handling the review request by selecting a reviewer from a subset code reviewers based on the number of times each code reviewer has been assigned to prior review requests associated with the specific change.

Abstract: A method is provided to automatically correct an original source code. An abstract syntax tree (AST) is created from the original source code where the AST includes AST nodes. AST node filter queries are evaluated on the AST to filter out AST nodes with defect patterns. Automatic fixes are applied to the filtered AST nodes to transform the AST. A modified source code is created by deserializing the transformed AST.

Abstract: A method is provided to automatically correct an original source code. An abstract syntax tree (AST) is created from the original source code where the AST includes AST nodes. AST node filter queries are evaluated on the AST to filter out AST nodes with defect patterns. Automatic fixes are applied to the filtered AST nodes to transform the AST. A modified source code is created by deserializing the transformed AST.

Abstract: Systems and methods for performing query-by-example are described. A query module executing on the system may maintain a source code repository containing a plurality of source code files. Each of the plurality of source code files is associated with a corresponding source syntax structure generated based on said each of the plurality of source code files. The query module may receive a query snippet, and generate a query syntax structure based on the query snippet. The query module may then identify a first source code file from the plurality of source code files for being relevant to the query snippet. The being relevant to the query snippet is determined by a first relevance score which is calculated based on the query syntax structure and the first source code file's corresponding source syntax structure.