US 9,851,959 B2Granted

Semantically sensitive code region fingerprint calculation for programming languages

AssigneeQualcomm Innovation Center, Inc.

InventorTobias Edler Von Koch

Life of this patent

Estimating the term…

Loading patent…

Abstract

Herein disclosed is an optimization for a compiler, the optimization configured to assign numeric values, or semantic fingerprints, to portions of code, and to combine these fingerprints to arrive at fingerprints for larger and larger portions of code. The fingerprints can be provided to various consumers such as code redundancy optimization modules and copyright violation and malware/virus identification modules. The fingerprints can also be used to cluster similar code, and then code within each cluster can be merged. Merger can include creating a single merged portion of code including the same portions of code from the original portions of code plus control flow and new arguments to account for differences between the original portions of code. The original portions of code can be replaced with wrappers that use new arguments to call to the merged portion of code.

Claims18

Dependent claims

A non-transitory, tangible computer readable storage medium, encoded with processor readable instructions to perform a method for reducing duplicated code during compiling of source code, the method comprising:

receiving a plurality of fingerprints each associated with one of a plurality of segments of an intermediate representation of the source code;
grouping the plurality of segments of the intermediate representation into clusters based on a similarity of the fingerprints such that each cluster comprises segments of the intermediate representation that are substantially the same;
for each cluster, recording a new merged function to a memory, the merged function including code that is the same among all segments of the intermediate representation for a given cluster;
inserting control flow and new arguments into the new merged function to handle differences between the segments of the intermediate representation in the given cluster;
and
replacing the segments of the intermediate representation for the given cluster with wrappers that call the new merged function using the new arguments.

3 more elements

A system comprising:

a processing portion with one or more processing components therein;
a memory coupled to the processing portion and configured to store source code and a corresponding executable code;
a compiler stored on the memory and executable on the processing portion to:
receive a plurality of fingerprints each associated with one of a plurality of segments of an intermediate representation of the source code;
group the plurality of segments of the intermediate representation into clusters based on a similarity of the fingerprints such that each cluster comprises segments of the intermediate representation that are substantially the same;
for each cluster, record a new merged function to the memory, the merged function including code that is the same among all segments of the intermediate representation for a given cluster;
insert control flow and new arguments into the new merged function to handle differences between the segments of the intermediate representation in the given cluster;
and
replace the segments of the intermediate representation for the given cluster with wrappers that call the new merged function using the new arguments.

6 more elements

A method comprising:

receiving a plurality of fingerprints each associated with one of a plurality of segments of an intermediate representation of the source code;
grouping the plurality of segments of the intermediate representation into clusters based on a similarity of the fingerprints such that each cluster comprises segments of the intermediate representation that are substantially the same;
for each cluster, recording a new merged function to a memory, the merged function including code that is the same among all segments of the intermediate representation for a given cluster;
inserting control flow and new arguments into the new merged function to handle differences between the segments of the intermediate representation in the given cluster;
and
replacing the segments of the intermediate representation for the given cluster with wrappers that call the new merged function using the new arguments.

3 more elements

Dependencies are inferred from the claim text.