公开(公告)号：US09535969B1

公开(公告)日：2017-01-03

申请号：US14457803

申请日：2014-08-12

Applicant: GOOGLE INC.

Inventor： Michael James Boyer Epstein ,  Abhishek Sheopory

IPC: G06F17/30

CPC classification number: G06F17/30575

Abstract: A system and method for conflict-free two-way synchronization between a primary repository and a secondary repository, which may be a mirror of the primary repository, are disclosed. An example method includes receiving a child revision associated with a parent revision in a secondary repository. The parent revision may be pointed to by a second user-visible reference in the secondary repository. The hidden reference to the child revision may be stored in a temporary storage area in the secondary repository that is hidden from view of user operations. A first user-visible reference in the primary repository that corresponds to the second user-visible reference in the secondary repository may be identified. This first-user-visible reference may point to a revision in the primary repository. Then, the revision to which the first user-visible reference in the primary repository points may be compared with the revision to which the second user-visible reference in the secondary repository points. If the revision to which the second user-visible reference points in the secondary repository is a copy of the revision to which the first user-visible reference points in the primary repository, the child revision may be pushed from the secondary repository to the primary repository so that the primary repository includes a copy of the child revision from the secondary repository. The first user-visible reference in the primary repository may be updated to point to the copy of the child revision in the primary repository.

Abstract translation: 公开了主存储库和次存储库之间的无冲突双向同步的系统和方法，其可以是主存储库的镜像。 示例性方法包括接收与辅助存储库中的父版本相关联的子修订。 辅助存储库中的第二个用户可见参考可能指向父版本。 对子修订版的隐藏引用可能存储在辅助存储库中的临时存储区域中，这些存储区域隐藏于用户操作的视图中。 可以识别主存储库中对应于辅助存储库中的第二用户可见引用的第一个用户可见引用。 此第一个用户可见的引用可能指向主存储库中的修订版本。 然后，可以将主存储库中的第一个用户可见引用的修订版本与辅助存储库中的第二个用户可见引用的指针进行比较。 如果辅助存储库中的第二个用户可见参考点的修订版本是主存储库中第一个用户可见引用指向的修订版本的副本，则子修订版可能会从辅助存储库推送到主存储库 以便主存储库包括辅助存储库中的子版本的副本。 可以将主存储库中的第一个用户可见引用更新为指向主存储库中子修订版本的副本。

公开(公告)号：US09218169B2

公开(公告)日：2015-12-22

申请号：US14084399

申请日：2013-11-19

Applicant: GOOGLE INC.

Inventor： Ramakrishna Rajanna ,  Deepank Gupta ,  Arul Siva Murugan Velayutham ,  Abhishek Sheopory ,  Ankit Agarwal

IPC: G06F9/44 ,  G06F9/45

CPC classification number: G06F11/3688 ,  G06F8/43 ,  G06F8/70 ,  G06F8/74 ,  G06F8/75 ,  G06F11/3676

Abstract: Techniques and systems for creating a function call graph for a codebase are disclosed. Graph creation includes identifying functions in the codebase by a function signature and representing a function as a first node in the call graph. For that function, identifying call-to functions, call-from functions, and inheritance parents and children, and a base class from the function signature of that function; adding child nodes to the first node based on the identified call-to and call-from functions; for an interface call to a base class method in the function, adding child nodes to the first node based on implementations of an override of the base class method; for an added child node, removing that child node from the first node if a source file that includes an implementation of an override and a source code file that includes the function don't share at least one common binary file.

Abstract translation: 公开了用于为代码库创建函数调用图的技术和系统。 图形创建包括通过函数签名识别代码库中的函数，并将该函数表示为调用图中的第一个节点。 对于该功能，从该函数的函数签名中识别调用函数，调用函数和继承父子和子代，以及基类; 基于所识别的呼叫和来电功能将子节点添加到第一节点; 对于函数中的基类方法的接口调用，基于基类方法的覆盖的实现将子节点添加到第一节点; 对于添加的子节点，如果包含覆盖的实现的源文件和包含该功能的源代码文件的源文件不共享至少一个通用二进制文件，则从第一个节点中删除该子节点。

公开(公告)号：US10042746B2

公开(公告)日：2018-08-07

申请号：US14963841

申请日：2015-12-09

Applicant: GOOGLE INC.

Inventor： Ramakrishna Rajanna ,  Deepank Gupta ,  Arul Siva Murugan Velayutham ,  Abhishek Sheopory ,  Ankit Agarwal

IPC: G06F9/44 ,  G06F11/36 ,  G06F8/41 ,  G06F8/70 ,  G06F8/74 ,  G06F8/75

CPC classification number: G06F11/3688 ,  G06F8/43 ,  G06F8/70 ,  G06F8/74 ,  G06F8/75 ,  G06F11/3676

Abstract: Techniques and systems for creating a function call graph for a codebase are disclosed. Graph creation includes identifying functions in the codebase by a function signature and representing a function as a first node in the call graph. For that function, identifying call-to functions, call-from functions, and inheritance parents and children, and a base class from the function signature of that function; adding child nodes to the first node based on the identified call-to and call-from functions; for an interface call to a base class method in the function, adding child nodes to the first node based on implementations of an override of the base class method; for an added child node, removing that child node from the first node if a source file that includes an implementation of an override and a source code file that includes the function don't share at least one common binary file.