LLM4Binary/decompile-bench-makefile huggingface dataset:
// File: /workspace/github_cpp_makefile_star2_O1/Proudc[P]CTSS/src/ContinuousQuery/Base.cpp
// Function: filterVertexIsSafeArea(Graph*, ReferencePath*)
void filterVertexIsSafeArea(Graph* myGraph, ReferencePath* temPath)
{
	printf("Start filtering the vertices in the safe area...\n");
	int count = 0;
	for (int i = 0; i < (myGraph->vertexPos); i++)
	{
		if (myGraph->vertexsVector[i].referFlag == true)
		{
			myGraph->vertexsVector[i].locationFlag = true;
			count++;
			continue;
		}
		for (unsigned int j = 0; j < temPath->edges.size(); j++)
		{
			double x = myGraph->vertexsVector[i].longitude;
			double y = myGraph->vertexsVector[i].latitude;
			double x1 = myGraph->vertexsVector[temPath->edges[j].firstVertexID].longitude;
			double y1 = myGraph->vertexsVector[temPath->edges[j].firstVertexID].latitude;
			double x2 = myGraph->vertexsVector[temPath->edges[j].secVertexID].longitude;
			double y2 = myGraph->vertexsVector[temPath->edges[j].secVertexID].latitude;
			double dist = pointToSegDist(x, y, x1, y1, x2, y2);
			if (dist <= (myGraph->delta))
			{
				myGraph->vertexsVector[i].locationFlag = true;
				count++;
				break;
			}
		}
	}
	printf("Finished filtering the vertices in the safe area!!!\n");
}

// Assembly:
pushq %rbp
movq %rsp, %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
pushq %rax
movq %rsi, %rbx
movq %rdi, %r14
leaq 0x6a5f(%rip), %rdi      # 0xc4bd
callq 0x21c0
cmpl $0x0, 0x4(%r14)
jle 0x5b2e
xorl %r15d, %r15d
movq 0x10(%r14), %rax
imulq $0x70, %r15, %r12
cmpb $0x0, 0x10(%rax,%r12)
je 0x5a8d
addq %r12, %rax
addq $0x11, %rax
jmp 0x5b1b
movq 0x20(%rbx), %rax
cmpq %rax, 0x28(%rbx)
je 0x5b1e
movl $0x1, %r13d
xorl %ecx, %ecx
movq 0x10(%r14), %rdx
movsd 0x18(%rdx,%r12), %xmm0
movsd 0x20(%rdx,%r12), %xmm1
shlq $0x5, %rcx
movslq 0x4(%rax,%rcx), %rsi
imulq $0x70, %rsi, %rsi
movsd 0x18(%rdx,%rsi), %xmm2
movsd 0x20(%rdx,%rsi), %xmm3
movslq 0x8(%rax,%rcx), %rax
imulq $0x70, %rax, %rax
movsd 0x18(%rdx,%rax), %xmm4
movsd 0x20(%rdx,%rax), %xmm5
callq 0x5b48
movsd 0x18(%r14), %xmm1
ucomisd %xmm0, %xmm1
jae 0x5b10
movl %r13d, %ecx
movq 0x20(%rbx), %rax
movq 0x28(%rbx), %rdx
subq %rax, %rdx
sarq $0x5, %rdx
incl %r13d
cmpq %rcx, %rdx
ja 0x5aa3
jmp 0x5b1e
movq 0x10(%r14), %rax
addq %r12, %rax
addq $0x11, %rax
movb $0x1, (%rax)
incq %r15
movslq 0x4(%r14), %rax
cmpq %rax, %r15
jl 0x5a71
leaq 0x69b9(%rip), %rdi      # 0xc4ee
addq $0x8, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
jmp 0x21c0
// File: /workspace/github_cpp_makefile_star2_O1/Proudc[P]CTSS/src/ContinuousQuery/Base.cpp
// Function: pointToSegDist(double, double, double, double, double, double)
double pointToSegDist(const double x, const double y, const double x1, const double y1, const double x2, const double y2)
{
	double cross = (x2 - x1) * (x - x1) + (y2 - y1) * (y - y1);
	if (cross <= 0)
	{
		return sqrt((x - x1) * (x - x1) + (y - y1) * (y - y1));
	}
	double d2 = (x2 - x1) * (x2 - x1) + (y2 - y1) * (y2 - y1);
	if (cross >= d2)
	{
		return sqrt((x - x2) * (x - x2) + (y - y2) * (y - y2));
	}
	double r = cross / d2;
	double px = x1 + (x2 - x1) * r;
	double py = y1 + (y2 - y1) * r;
	return sqrt((x - px) * (x - px) + (py - y) * (py - y));
}

// Assembly:
pushq %rbp
movq %rsp, %rbp
movapd %xmm4, %xmm8
subsd %xmm2, %xmm8
movapd %xmm0, %xmm6
subsd %xmm2, %xmm6
movapd %xmm5, %xmm7
subsd %xmm3, %xmm7
movapd %xmm1, %xmm10
subsd %xmm3, %xmm10
movapd %xmm10, %xmm11
mulsd %xmm7, %xmm11
movapd %xmm8, %xmm9
mulsd %xmm6, %xmm9
addsd %xmm11, %xmm9
xorpd %xmm11, %xmm11
ucomisd %xmm9, %xmm11
jae 0x5be4
movapd %xmm7, %xmm10
mulsd %xmm7, %xmm10
movapd %xmm8, %xmm6
mulsd %xmm8, %xmm6
addsd %xmm10, %xmm6
ucomisd %xmm6, %xmm9
jae 0x5bf4
divsd %xmm6, %xmm9
mulsd %xmm9, %xmm8
addsd %xmm2, %xmm8
mulsd %xmm9, %xmm7
addsd %xmm3, %xmm7
subsd %xmm8, %xmm0
subsd %xmm1, %xmm7
mulsd %xmm7, %xmm7
mulsd %xmm0, %xmm0
addsd %xmm7, %xmm0
jmp 0x5c08
mulsd %xmm10, %xmm10
mulsd %xmm6, %xmm6
addsd %xmm10, %xmm6
jmp 0x5c0c
subsd %xmm4, %xmm0
subsd %xmm5, %xmm1
mulsd %xmm1, %xmm1
mulsd %xmm0, %xmm0
addsd %xmm1, %xmm0
movapd %xmm0, %xmm6
xorpd %xmm0, %xmm0
ucomisd %xmm0, %xmm6
jb 0x5c1f
xorps %xmm0, %xmm0
sqrtsd %xmm6, %xmm0
popq %rbp
retq
movapd %xmm6, %xmm0
popq %rbp
jmp 0x2100
// File: /workspace/github_cpp_makefile_star2_O1/Proudc[P]CTSS/src/ContinuousQuery/Base.cpp
// Function: setMinPosAndMaxPos(Graph*, ReferencePath*)
void setMinPosAndMaxPos(Graph* myGraph, ReferencePath* temReferPath)
{
	printf("Start to set the minPos and maxPos of each vertex...\n");
	for (unsigned int i = 0; i < (myGraph->vertexPos); i++)
	{
		myGraph->vertexsVector[i].minPos = 0;
		myGraph->vertexsVector[i].maxPos = 0;
		if (myGraph->vertexsVector[i].locationFlag == true)
		{
			double x1 = myGraph->vertexsVector[i].longitude;
			double y1 = myGraph->vertexsVector[i].latitude;
			for (unsigned int j = 0; j < temReferPath->numOfReferPoint; j++)
			{
				double x2 = temReferPath->pointOfRefer[j].x;
				double y2 = temReferPath->pointOfRefer[j].y;
				double dist = euc(x1, y1, x2, y2);
				if (dist <= (myGraph->delta))
				{
					myGraph->vertexsVector[i].minPos = j;
					break;
				}
			}
			int numOfReferPoint = temReferPath->numOfReferPoint - 1;
			for (int j = numOfReferPoint; j >= 0; j--)
			{
				double x2 = temReferPath->pointOfRefer[j].x;
				double y2 = temReferPath->pointOfRefer[j].y;
				double dist = euc(x1, y1, x2, y2);
				if (dist <= (myGraph->delta))
				{
					myGraph->vertexsVector[i].maxPos = j;
					break;
				}
			}
		}
	}
	printf("The minPos and maxPos of each vertex are set...\n");
}

// Assembly:
pushq %rbp
movq %rsp, %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x18, %rsp
movq %rsi, %rbx
movq %rdi, %r14
leaq 0x68db(%rip), %rdi      # 0xc522
callq 0x21c0
cmpl $0x0, 0x4(%r14)
je 0x5d9b
xorl %r15d, %r15d
xorpd %xmm2, %xmm2
movq 0x10(%r14), %rax
imulq $0x70, %r15, %rcx
movq $0x0, 0x4(%rax,%rcx)
movq %rcx, -0x30(%rbp)
cmpb $0x1, 0x11(%rax,%rcx)
jne 0x5d8b
addq -0x30(%rbp), %rax
movsd 0x18(%rax), %xmm3
movsd 0x20(%rax), %xmm4
cmpl $0x0, 0x8(%rbx)
movsd %xmm3, -0x40(%rbp)
movsd %xmm4, -0x38(%rbp)
je 0x5d13
movl $0x8, %r12d
xorl %r13d, %r13d
movq 0x10(%rbx), %rax
movapd %xmm3, %xmm0
subsd -0x8(%rax,%r12), %xmm0
movapd %xmm4, %xmm1
subsd (%rax,%r12), %xmm1
mulsd %xmm1, %xmm1
mulsd %xmm0, %xmm0
addsd %xmm1, %xmm0
ucomisd %xmm2, %xmm0
jb 0x5cd6
sqrtsd %xmm0, %xmm0
jmp 0x5ce9
callq 0x2100
movsd -0x38(%rbp), %xmm4
movsd -0x40(%rbp), %xmm3
xorpd %xmm2, %xmm2
movsd 0x18(%r14), %xmm1
ucomisd %xmm0, %xmm1
jae 0x5d06
incq %r13
movl 0x8(%rbx), %eax
addq $0x10, %r12
cmpq %rax, %r13
jb 0x5ca5
jmp 0x5d13
movq 0x10(%r14), %rax
movq -0x30(%rbp), %rcx
movl %r13d, 0x4(%rax,%rcx)
movl 0x8(%rbx), %r13d
movq %r13, %r12
shlq $0x4, %r12
addq $-0x8, %r12
testl %r13d, %r13d
jle 0x5d8b
movq 0x10(%rbx), %rax
movapd %xmm3, %xmm0
subsd -0x8(%rax,%r12), %xmm0
movapd %xmm4, %xmm1
subsd (%rax,%r12), %xmm1
mulsd %xmm1, %xmm1
mulsd %xmm0, %xmm0
addsd %xmm1, %xmm0
ucomisd %xmm2, %xmm0
jb 0x5d58
sqrtsd %xmm0, %xmm0
jmp 0x5d6b
callq 0x2100
movsd -0x38(%rbp), %xmm4
movsd -0x40(%rbp), %xmm3
xorpd %xmm2, %xmm2
movsd 0x18(%r14), %xmm1
decl %r13d
addq $-0x10, %r12
ucomisd %xmm0, %xmm1
jb 0x5d22
movq 0x10(%r14), %rax
movq -0x30(%rbp), %rcx
movl %r13d, 0x8(%rax,%rcx)
incq %r15
movl 0x4(%r14), %eax
cmpq %rax, %r15
jb 0x5c5e
leaq 0x67b5(%rip), %rdi      # 0xc557
addq $0x18, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
jmp 0x21c0
// File: /workspace/github_cpp_makefile_star2_O1/Proudc[P]CTSS/src/ContinuousQuery/Base.cpp
// Function: setReferDFDFlag(Graph*, ReferencePath*)
void setReferDFDFlag(Graph* myGraph, ReferencePath* temPath)
{
	Vertex finalVertex = myGraph->vertexsVector[temPath->finalVertex];
	if (finalVertex.locationFlag == false)
	{
		temPath->referDFDFlag = false;
	}
	else
	{
		int flag = 0;
		for (int j = finalVertex.minPos; j <= finalVertex.maxPos; j++)
		{
			double x1 = finalVertex.longitude;
			double y1 = finalVertex.latitude;
			double x2 = temPath->pointOfRefer[j].x;
			double y2 = temPath->pointOfRefer[j].y;
			if (euc(x1, y1, x2, y2) > (myGraph->delta))
			{
				flag = 1;
				break;
			}
		}
		if (flag == 1)
		{
			temPath->referDFDFlag = false;
		}
		else
		{
			temPath->referDFDFlag = true;
		}
	}
}

// Assembly:
pushq %rbp
movq %rsp, %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x78, %rsp
movq %rsi, %rbx
movq %rdi, %r14
movq 0x10(%rdi), %r15
movslq 0x4(%rsi), %rax
imulq $0x70, %rax, %r12
leaq (%r15,%r12), %rsi
addq $0x40, %rsi
movupd -0x40(%rsi), %xmm0
movupd -0x30(%rsi), %xmm1
movupd -0x20(%rsi), %xmm2
movups -0x10(%rsi), %xmm3
leaq -0x60(%rbp), %rdi
movaps %xmm3, -0x10(%rdi)
movapd %xmm2, -0x20(%rdi)
movapd %xmm1, -0x30(%rdi)
movapd %xmm0, -0x40(%rdi)
callq 0x6d40
leaq -0x48(%rbp), %rdi
leaq (%r15,%r12), %rsi
addq $0x58, %rsi
callq 0x6d40
cmpb $0x0, -0x8f(%rbp)
je 0x5ef0
movslq -0x9c(%rbp), %r15
cmpl -0x98(%rbp), %r15d
jg 0x5ef4
leaq -0x1(%r15), %r12
shlq $0x4, %r15
orq $0x8, %r15
xorl %r13d, %r13d
xorpd %xmm2, %xmm2
movl $0x1, %ecx
movsd -0x88(%rbp), %xmm0
movq 0x10(%rbx), %rax
subsd -0x8(%rax,%r15), %xmm0
movsd -0x80(%rbp), %xmm1
subsd (%rax,%r15), %xmm1
mulsd %xmm1, %xmm1
mulsd %xmm0, %xmm0
addsd %xmm1, %xmm0
ucomisd %xmm2, %xmm0
jb 0x5ebd
sqrtsd %xmm0, %xmm0
jmp 0x5ecb
callq 0x2100
movl $0x1, %ecx
xorpd %xmm2, %xmm2
ucomisd 0x18(%r14), %xmm0
cmoval %ecx, %r13d
ja 0x5eea
movslq -0x98(%rbp), %rax
incq %r12
addq $0x10, %r15
cmpq %rax, %r12
jl 0x5e87
cmpl $0x1, %r13d
jne 0x5ef4
xorl %eax, %eax
jmp 0x5ef6
movb $0x1, %al
movb %al, 0xc(%rbx)
movq -0x48(%rbp), %rdi
testq %rdi, %rdi
je 0x5f07
callq 0x2130
movq -0x60(%rbp), %rdi
testq %rdi, %rdi
je 0x5f15
callq 0x2130
addq $0x78, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
movq %rax, %rbx
movq -0x60(%rbp), %rdi
testq %rdi, %rdi
je 0x5f35
callq 0x2130
movq %rbx, %rdi
callq 0x2220
// File: /workspace/github_cpp_makefile_star2_O1/Proudc[P]CTSS/src/ContinuousQuery/Base.cpp
// Function: setDistToRefer(Graph*, ReferencePath*)
void setDistToRefer(Graph* myGraph, ReferencePath* temPath)
{
	printf("Start calculating the shortest distance from each vertex to the reference path...\n");
	for (unsigned int i = 0; i < myGraph->vertexPos; i++)
	{
		double temDist = std::numeric_limits<double>::max();
		if (myGraph->vertexsVector[i].referFlag == true)
		{
			myGraph->vertexsVector[i].distToRefer = 0;
			continue;
		}
		for (unsigned int j = 0; j < temPath->edges.size(); j++)
		{
			double x  = myGraph->vertexsVector[i].longitude;
			double y  = myGraph->vertexsVector[i].latitude;
			double x1 = myGraph->vertexsVector[temPath->edges[j].firstVertexID].longitude;
			double y1 = myGraph->vertexsVector[temPath->edges[j].firstVertexID].latitude;
			double x2 = myGraph->vertexsVector[temPath->edges[j].secVertexID].longitude;
			double y2 = myGraph->vertexsVector[temPath->edges[j].secVertexID].latitude;
			double dist = pointToSegDist(x, y, x1, y1, x2, y2);
			temDist = dist < temDist ? dist : temDist;
		}
		myGraph->vertexsVector[i].distToRefer = temDist;
	}
	printf("The shortest distance from each vertex to the reference path is calculated!!!\n");
}

// Assembly:
pushq %rbp
movq %rsp, %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
pushq %rax
movq %rsi, %rbx
movq %rdi, %r14
leaq 0x662f(%rip), %rdi      # 0xc587
callq 0x21c0
cmpl $0x0, 0x4(%r14)
je 0x6035
xorl %r15d, %r15d
movq 0x10(%r14), %rax
imulq $0x70, %r15, %r12
cmpb $0x0, 0x10(%rax,%r12)
je 0x5f8b
addq %r12, %rax
movq $0x0, 0x28(%rax)
jmp 0x6025
movq 0x20(%rbx), %rax
movsd 0x61e1(%rip), %xmm0     # 0xc178
cmpq %rax, 0x28(%rbx)
je 0x601a
movl $0x1, %r13d
xorl %ecx, %ecx
movsd 0x61cb(%rip), %xmm1     # 0xc178
movsd %xmm1, -0x30(%rbp)
movq 0x10(%r14), %rdx
movsd 0x18(%rdx,%r12), %xmm0
movsd 0x20(%rdx,%r12), %xmm1
shlq $0x5, %rcx
movslq 0x4(%rax,%rcx), %rsi
imulq $0x70, %rsi, %rsi
movsd 0x18(%rdx,%rsi), %xmm2
movsd 0x20(%rdx,%rsi), %xmm3
movslq 0x8(%rax,%rcx), %rax
imulq $0x70, %rax, %rax
movsd 0x18(%rdx,%rax), %xmm4
movsd 0x20(%rdx,%rax), %xmm5
callq 0x5b48
minsd -0x30(%rbp), %xmm0
movl %r13d, %ecx
movq 0x20(%rbx), %rax
movq 0x28(%rbx), %rdx
subq %rax, %rdx
sarq $0x5, %rdx
incl %r13d
movapd %xmm0, %xmm1
cmpq %rcx, %rdx
ja 0x5fad
movq 0x10(%r14), %rax
movsd %xmm0, 0x28(%rax,%r12)
incq %r15
movl 0x4(%r14), %eax
cmpq %rax, %r15
jb 0x5f6b
leaq 0x659d(%rip), %rdi      # 0xc5d9
addq $0x8, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
jmp 0x21c0
// File: /workspace/github_cpp_makefile_star2_O1/Proudc[P]CTSS/src/ContinuousQuery/Base.cpp
// Function: setTraversalOrderWeights(Graph*, ReferencePath*)
void setTraversalOrderWeights(Graph* myGraph, ReferencePath* temPath)
{
	const double x1 = myGraph->vertexsVector[temPath->finalVertex].longitude;
	const double y1 = myGraph->vertexsVector[temPath->finalVertex].latitude;
	double maxEuc = 0.0;
	for (unsigned int i = 0; i < myGraph->vertexPos; i++)
	{
		if (myGraph->vertexsVector[i].locationFlag == true)
		{
			const double x2 = myGraph->vertexsVector[i].longitude;
			const double y2 = myGraph->vertexsVector[i].latitude;
			double eucLength = euc(x1, y1, x2, y2);
			myGraph->vertexsVector[i].eucLengthToFinalVertex = eucLength;
			maxEuc = (std::max)(maxEuc, eucLength);
		}
	}
	for (unsigned int i = 0; i < myGraph->vertexPos; i++)
	{
		if (myGraph->vertexsVector[i].locationFlag == true)
		{
			double firstHalf = (myGraph->vertexsVector[i].distToRefer);
			double secHalf   = (myGraph->vertexsVector[i].eucLengthToFinalVertex) / (maxEuc / (myGraph->delta));
			double temWeights = (0.5) * firstHalf+ (0.5) * secHalf;
			myGraph->vertexsVector[i].traversalOrderWeights = temWeights;
		}
	}
}

// Assembly:
pushq %rbp
movq %rsp, %rbp
pushq %r15
pushq %r14
pushq %rbx
subq $0x18, %rsp
movq %rdi, %rbx
movl 0x4(%rdi), %ecx
testl %ecx, %ecx
je 0x6115
movq 0x10(%rbx), %rax
movslq 0x4(%rsi), %rcx
imulq $0x70, %rcx, %rcx
movsd 0x18(%rax,%rcx), %xmm2
movsd 0x20(%rax,%rcx), %xmm4
xorpd %xmm5, %xmm5
xorl %r14d, %r14d
xorl %r15d, %r15d
xorpd %xmm3, %xmm3
movsd %xmm2, -0x28(%rbp)
movsd %xmm4, -0x20(%rbp)
movq 0x10(%rbx), %rax
cmpb $0x1, 0x11(%rax,%r14)
jne 0x6104
movapd %xmm2, %xmm0
subsd 0x18(%rax,%r14), %xmm0
movapd %xmm4, %xmm1
subsd 0x20(%rax,%r14), %xmm1
mulsd %xmm1, %xmm1
mulsd %xmm0, %xmm0
addsd %xmm1, %xmm0
ucomisd %xmm5, %xmm0
jb 0x60d4
sqrtsd %xmm0, %xmm0
jmp 0x60f1
movsd %xmm3, -0x30(%rbp)
callq 0x2100
xorpd %xmm5, %xmm5
movsd -0x20(%rbp), %xmm4
movsd -0x28(%rbp), %xmm2
movsd -0x30(%rbp), %xmm3
movq 0x10(%rbx), %rax
movsd %xmm0, 0x30(%rax,%r14)
maxsd %xmm3, %xmm0
movapd %xmm0, %xmm3
incq %r15
movl 0x4(%rbx), %ecx
addq $0x70, %r14
cmpq %rcx, %r15
jb 0x609a
jmp 0x6119
xorpd %xmm3, %xmm3
testl %ecx, %ecx
je 0x616c
movq 0x10(%rbx), %rax
movl %ecx, %ecx
imulq $0x70, %rcx, %rcx
xorl %edx, %edx
movsd 0x604f(%rip), %xmm0     # 0xc180
cmpb $0x1, 0x11(%rax,%rdx)
jne 0x6163
movsd 0x30(%rax,%rdx), %xmm1
movapd %xmm3, %xmm2
divsd 0x18(%rbx), %xmm2
divsd %xmm2, %xmm1
mulsd %xmm0, %xmm1
movsd 0x28(%rax,%rdx), %xmm2
mulsd %xmm0, %xmm2
addsd %xmm1, %xmm2
movsd %xmm2, 0x38(%rax,%rdx)
addq $0x70, %rdx
cmpq %rdx, %rcx
jne 0x6131
addq $0x18, %rsp
popq %rbx
popq %r14
popq %r15
popq %rbp
retq
// File: /workspace/github_cpp_makefile_star2_O1/Proudc[P]CTSS/src/ContinuousQuery/Base.cpp
// Function: setEdgeLength(Graph*, Edge*)
void setEdgeLength(Graph* myGraph, Edge* temEdge)
{
	double px = myGraph->vertexsVector[temEdge->firstVertexID].longitude;
	double py = myGraph->vertexsVector[temEdge->firstVertexID].latitude;
	double qx = myGraph->vertexsVector[temEdge->secVertexID].longitude;
	double qy = myGraph->vertexsVector[temEdge->secVertexID].latitude;
	double x = px - qx;
	double y = py - qy;
	temEdge->length = sqrt(x * x + y * y);
	temEdge->realLength = realDistance(x, y, py);
	// printf("%lf %lf %lf\n", x, y, py);
}

// Assembly:
pushq %rbp
movq %rsp, %rbp
pushq %rbx
subq $0x18, %rsp
movq %rsi, %rbx
movq 0x10(%rdi), %rax
movslq 0x4(%rsi), %rcx
imulq $0x70, %rcx, %rcx
movsd 0x18(%rax,%rcx), %xmm0
movslq 0x8(%rsi), %rdx
imulq $0x70, %rdx, %rdx
subsd 0x18(%rax,%rdx), %xmm0
movsd 0x20(%rax,%rcx), %xmm2
movapd %xmm2, %xmm1
subsd 0x20(%rax,%rdx), %xmm1
movsd %xmm1, -0x20(%rbp)
mulsd %xmm1, %xmm1
movsd %xmm0, -0x10(%rbp)
mulsd %xmm0, %xmm0
addsd %xmm1, %xmm0
xorpd %xmm1, %xmm1
ucomisd %xmm1, %xmm0
jb 0x61d9
sqrtsd %xmm0, %xmm0
jmp 0x61e8
movsd %xmm2, -0x18(%rbp)
callq 0x2100
movsd -0x18(%rbp), %xmm2
movsd %xmm0, 0x10(%rbx)
movsd -0x10(%rbp), %xmm0
mulsd 0x5f76(%rip), %xmm0     # 0xc170
movsd %xmm0, -0x10(%rbp)
movapd %xmm2, %xmm0
callq 0x2240
mulsd -0x10(%rbp), %xmm0
movsd -0x20(%rbp), %xmm1
mulsd 0x5f56(%rip), %xmm1     # 0xc170
mulsd %xmm1, %xmm1
mulsd %xmm0, %xmm0
addsd %xmm1, %xmm0
ucomisd 0x5f5a(%rip), %xmm0     # 0xc188
jb 0x6236
sqrtsd %xmm0, %xmm0
jmp 0x623b
callq 0x2100
movsd %xmm0, 0x18(%rbx)
addq $0x18, %rsp
popq %rbx
popq %rbp
retq
// File: /workspace/github_cpp_makefile_star2_O1/Proudc[P]CTSS/src/ContinuousQuery/Base.cpp
// Function: writeContinuousRecordToFile(Record*, unsigned int, std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char>>, double)
void writeContinuousRecordToFile(Record record[], const unsigned int recordPos, const string filePath, double totalRunTime)
{
	FILE* fp = fopen(filePath.c_str(), "w");
	if (!fp)
	{
		printf("Error writing record infomation!!!\n");
	}
	else
	{
		int i = 0;
		while (i < recordPos)
		{
			fprintf(fp, "%lf\t", record[i].ratioNumEdge);
			fprintf(fp, "%lf\t", totalRunTime);
			fprintf(fp, "%d\t",  i + 1);
			fprintf(fp, "%d\t",  record[i].comPathSize);
			fprintf(fp, "%d\t",  record[i].numOfOutPriQueue);
			fprintf(fp, "%lf\t", record[i].referPathLength);
			fprintf(fp, "%lf\t", record[i].ratioPathLength);
			fprintf(fp, "%lf\t", record[i].currPathLength);
			fprintf(fp, "%lf\n", record[i].comPathLength);
			i++;
		}
	}
	fclose(fp);
}

// Assembly:
pushq %rbp
movq %rsp, %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x18, %rsp
movsd %xmm0, -0x38(%rbp)
movl %esi, %r15d
movq %rdi, %r14
movq (%rdx), %rdi
leaq 0x5d80(%rip), %rsi      # 0xc1b2
callq 0x2170
movq %rax, %rbx
testq %rax, %rax
je 0x653a
testl %r15d, %r15d
je 0x6546
movl %r15d, %eax
shlq $0x4, %rax
leaq (%rax,%rax,4), %rax
movq %rax, -0x30(%rbp)
movl $0x1, %r15d
xorl %r13d, %r13d
movsd 0x38(%r14,%r13), %xmm0
movq %rbx, %rdi
leaq 0x5d3f(%rip), %r12      # 0xc1b4
movq %r12, %rsi
movb $0x1, %al
callq 0x2190
movq %rbx, %rdi
movq %r12, %rsi
movsd -0x38(%rbp), %xmm0
movb $0x1, %al
callq 0x2190
movq %rbx, %rdi
leaq 0x5d1e(%rip), %r12      # 0xc1b9
movq %r12, %rsi
movl %r15d, %edx
xorl %eax, %eax
callq 0x2190
movl 0x14(%r14,%r13), %edx
movq %rbx, %rdi
movq %r12, %rsi
xorl %eax, %eax
callq 0x2190
movl 0x10(%r14,%r13), %edx
movq %rbx, %rdi
movq %r12, %rsi
xorl %eax, %eax
callq 0x2190
movsd 0x48(%r14,%r13), %xmm0
movq %rbx, %rdi
leaq 0x5cd7(%rip), %r12      # 0xc1b4
movq %r12, %rsi
movb $0x1, %al
callq 0x2190
movsd 0x40(%r14,%r13), %xmm0
movq %rbx, %rdi
movq %r12, %rsi
movb $0x1, %al
callq 0x2190
movsd 0x28(%r14,%r13), %xmm0
movq %rbx, %rdi
movq %r12, %rsi
movb $0x1, %al
callq 0x2190
movsd 0x30(%r14,%r13), %xmm0
movq %rbx, %rdi
leaq 0x5ca1(%rip), %rsi      # 0xc1c1
movb $0x1, %al
callq 0x2190
addq $0x50, %r13
incl %r15d
cmpq %r13, -0x30(%rbp)
jne 0x6464
jmp 0x6546
leaq 0x611e(%rip), %rdi      # 0xc65f
callq 0x21c0
movq %rbx, %rdi
addq $0x18, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
jmp 0x2140
// File: /workspace/github_cpp_makefile_star2_O1/Proudc[P]CTSS/src/ContinuousQuery/Base.cpp
// Function: checkIfAccess(Graph*, TraversingPath*, int)
bool checkIfAccess(Graph* myGraph, TraversingPath* temPath, const int vertexID)
{
	for (unsigned int i = 0; i < temPath->edges.size(); i++)
	{
		int firstVertexID = myGraph->edgesVector[temPath->edges[i]].firstVertexID;
		int secVertexID   = myGraph->edgesVector[temPath->edges[i]].secVertexID;
		if ((firstVertexID == vertexID) || (secVertexID == vertexID))
		{
			return false;
		}
	}
	return true;
}

// Assembly:
movq 0x28(%rsi), %rcx
movq 0x30(%rsi), %rsi
subq %rcx, %rsi
sete %al
je 0x69b4
pushq %rbp
movq %rsp, %rbp
movq 0x8(%rdi), %rdi
movslq (%rcx), %r9
movq %r9, %r8
shlq $0x5, %r8
cmpl %edx, 0x4(%rdi,%r8)
je 0x69b3
sarq $0x2, %rsi
movl $0x1, %r8d
shlq $0x5, %r9
cmpl %edx, 0x8(%rdi,%r9)
je 0x69b3
movl %r8d, %r9d
cmpq %r9, %rsi
setbe %al
jbe 0x69b3
movslq (%rcx,%r9,4), %r9
movq %r9, %r10
shlq $0x5, %r10
incl %r8d
cmpl %edx, 0x4(%rdi,%r10)
jne 0x6988
popq %rbp
andb $0x1, %al
retq
// File: /workspace/github_cpp_makefile_star2_O1/Proudc[P]CTSS/src/ContinuousQuery/Base.cpp
// Function: replacePath(std::vector<Edge, std::allocator<Edge>>&, std::vector<Edge, std::allocator<Edge>>&, int, int)
void replacePath(std::vector<Edge>& lastPath, std::vector<Edge>& localPath, const int startPos, const int stopPos)
{

	std::vector<Edge> temPath;
	for (unsigned int i = 0; i < startPos; i++)
	{
		temPath.push_back(lastPath[i]);
	}
	for (unsigned int i = 0; i < localPath.size(); i++)
	{
		temPath.push_back(localPath[i]);
	}
	for (unsigned int i = stopPos; i < lastPath.size(); i++)
	{
		temPath.push_back(lastPath[i]);
	}
	lastPath.clear();
	for (unsigned int i = 0; i < temPath.size(); i++)
	{
		lastPath.push_back(temPath[i]);
	}
}

// Assembly:
pushq %rbp
movq %rsp, %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x18, %rsp
movl %ecx, %r14d
movq %rsi, %r15
movq %rdi, %rbx
xorps %xmm0, %xmm0
movaps %xmm0, -0x40(%rbp)
movq $0x0, -0x30(%rbp)
testl %edx, %edx
je 0x6a28
movl %edx, %r13d
shlq $0x5, %r13
xorl %r12d, %r12d
movq (%rbx), %rdx
addq %r12, %rdx
movq -0x38(%rbp), %rsi
cmpq -0x30(%rbp), %rsi
je 0x6a16
movups (%rdx), %xmm0
movups 0x10(%rdx), %xmm1
movups %xmm1, 0x10(%rsi)
movups %xmm0, (%rsi)
addq $0x20, %rsi
movq %rsi, -0x38(%rbp)
jmp 0x6a1f
leaq -0x40(%rbp), %rdi
callq 0x4cf6
addq $0x20, %r12
cmpq %r12, %r13
jne 0x69ee
movq (%r15), %rax
cmpq %rax, 0x8(%r15)
je 0x6a87
movl $0x1, %r13d
xorl %edx, %edx
leaq -0x40(%rbp), %r12
shlq $0x5, %rdx
addq %rax, %rdx
movq -0x38(%rbp), %rsi
cmpq -0x30(%rbp), %rsi
je 0x6a66
movups (%rdx), %xmm0
movups 0x10(%rdx), %xmm1
movups %xmm1, 0x10(%rsi)
movups %xmm0, (%rsi)
addq $0x20, %rsi
movq %rsi, -0x38(%rbp)
jmp 0x6a6e
movq %r12, %rdi
callq 0x4cf6
movl %r13d, %edx
movq (%r15), %rax
movq 0x8(%r15), %rcx
subq %rax, %rcx
sarq $0x5, %rcx
incl %r13d
cmpq %rdx, %rcx
ja 0x6a3d
movl %r14d, %edx
movq (%rbx), %rax
movq 0x8(%rbx), %rcx
movq %rcx, %rsi
subq %rax, %rsi
sarq $0x5, %rsi
cmpq %rdx, %rsi
jbe 0x6af4
incl %r14d
leaq -0x40(%rbp), %r15
shlq $0x5, %rdx
addq %rax, %rdx
movq -0x38(%rbp), %rsi
cmpq -0x30(%rbp), %rsi
je 0x6ad0
movups (%rdx), %xmm0
movups 0x10(%rdx), %xmm1
movups %xmm1, 0x10(%rsi)
movups %xmm0, (%rsi)
addq $0x20, %rsi
movq %rsi, -0x38(%rbp)
jmp 0x6ad8
movq %r15, %rdi
callq 0x4cf6
movl %r14d, %edx
movq (%rbx), %rax
movq 0x8(%rbx), %rcx
movq %rcx, %rsi
subq %rax, %rsi
sarq $0x5, %rsi
incl %r14d
cmpq %rdx, %rsi
ja 0x6aa7
cmpq %rax, %rcx
je 0x6afd
movq %rax, 0x8(%rbx)
movq -0x40(%rbp), %rdi
cmpq %rdi, -0x38(%rbp)
je 0x6b57
movl $0x1, %r14d
xorl %edx, %edx
shlq $0x5, %rdx
addq %rdi, %rdx
movq 0x8(%rbx), %rsi
cmpq 0x10(%rbx), %rsi
je 0x6b35
movups (%rdx), %xmm0
movups 0x10(%rdx), %xmm1
movups %xmm1, 0x10(%rsi)
movups %xmm0, (%rsi)
addq $0x20, 0x8(%rbx)
jmp 0x6b3d
movq %rbx, %rdi
callq 0x4cf6
movl %r14d, %edx
movq -0x40(%rbp), %rdi
movq -0x38(%rbp), %rax
subq %rdi, %rax
sarq $0x5, %rax
incl %r14d
cmpq %rdx, %rax
ja 0x6b0f
testq %rdi, %rdi
je 0x6b61
callq 0x2130
addq $0x18, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
jmp 0x6b76
jmp 0x6b76
jmp 0x6b76
movq %rax, %rbx
movq -0x40(%rbp), %rdi
testq %rdi, %rdi
je 0x6b87
callq 0x2130
movq %rbx, %rdi
callq 0x2220
// File: /workspace/github_cpp_makefile_star2_O1/Proudc[P]CTSS/src/ContinuousQuery/Base.cpp
// Function: updateLastPath(std::vector<Edge, std::allocator<Edge>>&, std::vector<Edge, std::allocator<Edge>>&, double*, double*)
void updateLastPath(std::vector<Edge>& lastPath, std::vector<Edge>& temLastPath, double* boundDistance, double* temBoundDistance)
{
	lastPath.clear();
	for (unsigned int j = 0; j < temLastPath.size(); j++)
	{
		lastPath.push_back(temLastPath[j]);
	}
	(*boundDistance) = (*temBoundDistance);
}

// Assembly:
pushq %rbp
movq %rsp, %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
pushq %rax
movq %rcx, %r14
movq %rdx, %rbx
movq %rsi, %r15
movq %rdi, %r12
movq (%rdi), %rax
cmpq %rax, 0x8(%rdi)
je 0x6bb7
movq %rax, 0x8(%r12)
movq (%r15), %rax
cmpq %rax, 0x8(%r15)
je 0x6c12
movl $0x1, %r13d
xorl %edx, %edx
shlq $0x5, %rdx
addq %rax, %rdx
movq 0x8(%r12), %rsi
cmpq 0x10(%r12), %rsi
je 0x6bf1
movups (%rdx), %xmm0
movups 0x10(%rdx), %xmm1
movups %xmm1, 0x10(%rsi)
movups %xmm0, (%rsi)
addq $0x20, 0x8(%r12)
jmp 0x6bf9
movq %r12, %rdi
callq 0x4cf6
movl %r13d, %edx
movq (%r15), %rax
movq 0x8(%r15), %rcx
subq %rax, %rcx
sarq $0x5, %rcx
incl %r13d
cmpq %rdx, %rcx
ja 0x6bc8
movsd (%r14), %xmm0
movsd %xmm0, (%rbx)
addq $0x8, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
// File: /workspace/github_cpp_makefile_star2_O1/Proudc[P]CTSS/src/ContinuousQuery/Construct.cpp
// Function: readVertexs(Graph*, std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char>>)
void readVertexs(Graph* myGraph, const std::string nodeFilePath)
{
	printf("Reading vertex information from file...\n");
	int   count = 0;
	char  line[100];
	FILE* fp;
	char* p;
	fp = fopen(nodeFilePath.c_str(), "r");
	if (!fp)
	{
		printf("Error when reading vertex file...\n");
	}
	else
	{
		myGraph->vertexPos = 0;
		while (fgets(line, 100, fp) != NULL)
		{
			p = strtok(line, " |\t");
			int ID = atoi(p);
			p = strtok(NULL, " |\t");
			double latitude = atof(p);
			p = strtok(NULL, " |\t");
			double longitude = atof(p);
			myGraph->vertexsVector[myGraph->vertexPos].vertexID  = ID;
			myGraph->vertexsVector[myGraph->vertexPos].longitude = longitude;
			myGraph->vertexsVector[myGraph->vertexPos].latitude  = latitude;
			myGraph->vertexPos += 1;
			count++;
		}
	}
	fclose(fp);
	printf("Finish reading vertex information from file---A total of %d vertex are read!!!\n", count);
}

// Assembly:
pushq %rbp
movq %rsp, %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x78, %rsp
movq %rsi, %rbx
movq %rdi, %r14
leaq 0x5789(%rip), %rdi      # 0xc84b
callq 0x21c0
movq (%rbx), %rdi
leaq 0x56d8(%rip), %rsi      # 0xc7a9
callq 0x2170
movq %rax, %r13
testq %rax, %rax
je 0x719c
movl $0x0, 0x4(%r14)
leaq -0xa0(%rbp), %rdi
movl $0x64, %esi
movq %r13, %rdx
callq 0x21f0
testq %rax, %rax
je 0x71a8
xorl %r15d, %r15d
leaq -0xa0(%rbp), %rdi
leaq 0x5693(%rip), %r12      # 0xc7ab
movq %r12, %rsi
callq 0x21e0
movq %rax, %rdi
callq 0x21d0
movl %eax, %ebx
xorl %edi, %edi
movq %r12, %rsi
callq 0x21e0
movq %rax, %rdi
callq 0x2180
movsd %xmm0, -0x30(%rbp)
xorl %edi, %edi
movq %r12, %rsi
callq 0x21e0
movq %rax, %rdi
callq 0x2180
movq 0x10(%r14), %rax
movslq 0x4(%r14), %rcx
imulq $0x70, %rcx, %rdx
movl %ebx, (%rax,%rdx)
movsd %xmm0, 0x18(%rax,%rdx)
movsd -0x30(%rbp), %xmm0
movsd %xmm0, 0x20(%rax,%rdx)
leal 0x1(%rcx), %eax
movl %eax, 0x4(%r14)
incl %r15d
leaq -0xa0(%rbp), %rdi
movl $0x64, %esi
movq %r13, %rdx
callq 0x21f0
testq %rax, %rax
jne 0x710a
jmp 0x71ab
leaq 0x56d0(%rip), %rdi      # 0xc873
callq 0x21c0
xorl %r15d, %r15d
movq %r13, %rdi
callq 0x2140
leaq 0x55f5(%rip), %rdi      # 0xc7af
movl %r15d, %esi
xorl %eax, %eax
callq 0x2040
addq $0x78, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
// File: /workspace/github_cpp_makefile_star2_O1/Proudc[P]CTSS/src/ContinuousQuery/Construct.cpp
// Function: readReferencePath(Graph*, ReferencePath*, std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char>>)
void readReferencePath(Graph* myGraph, ReferencePath* referencePath, const std::string referFilePath)
{
	printf("Reading reference path information from file...\n");
	int   count = 0;
	char  line[200];
	FILE* fp;
	char* p;
	fp = fopen(referFilePath.c_str(), "r");
	if (!fp)
	{
		printf("Error when reading reference path file...\n");
	}
	else
	{
		while (fgets(line, 200, fp) != NULL)
		{
			p = strtok(line, " |\t");
			int pos = atoi(p);
			referencePath->edges.push_back(myGraph->edgesVector[pos]);
			myGraph->vertexsVector[myGraph->edgesVector[pos].firstVertexID].referFlag = true;
			myGraph->vertexsVector[myGraph->edgesVector[pos].secVertexID].referFlag   = true;
			count++;
		}
	}
	fclose(fp);
	printf("Finish reading reference path information from file!!!\n");
}

// Assembly:
pushq %rbp
movq %rsp, %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0xd8, %rsp
movq %rdx, %r15
movq %rsi, %rbx
movq %rdi, %r14
leaq 0x54da(%rip), %rdi      # 0xc8db
callq 0x21c0
movq (%r15), %rdi
leaq 0x5399(%rip), %rsi      # 0xc7a9
callq 0x2170
movq %rax, %r12
testq %rax, %rax
je 0x74df
leaq -0x100(%rbp), %rdi
movl $0xc8, %esi
movq %r12, %rdx
callq 0x21f0
testq %rax, %rax
je 0x74eb
leaq 0x20(%rbx), %rax
movq %rax, -0x30(%rbp)
leaq -0x100(%rbp), %rdi
movq %rdi, %r13
leaq 0x5354(%rip), %rsi      # 0xc7ab
callq 0x21e0
movq %rax, %rdi
callq 0x21d0
movslq %eax, %r15
shlq $0x5, %r15
movq 0x8(%r14), %rdx
addq %r15, %rdx
movq 0x28(%rbx), %rsi
cmpq 0x30(%rbx), %rsi
je 0x7491
movups (%rdx), %xmm0
movups 0x10(%rdx), %xmm1
movups %xmm1, 0x10(%rsi)
movups %xmm0, (%rsi)
addq $0x20, 0x28(%rbx)
jmp 0x749a
movq -0x30(%rbp), %rdi
callq 0x4cf6
movq 0x8(%r14), %rax
movq 0x10(%r14), %rcx
movslq 0x4(%rax,%r15), %rdx
imulq $0x70, %rdx, %rdx
movb $0x1, %sil
movb %sil, 0x10(%rcx,%rdx)
movslq 0x8(%rax,%r15), %rax
imulq $0x70, %rax, %rax
movb %sil, 0x10(%rcx,%rax)
movq %r13, %rdi
movl $0xc8, %esi
movq %r12, %rdx
callq 0x21f0
movq %r13, %rdi
testq %rax, %rax
jne 0x744d
jmp 0x74eb
leaq 0x5425(%rip), %rdi      # 0xc90b
callq 0x21c0
movq %r12, %rdi
callq 0x2140
leaq 0x543b(%rip), %rdi      # 0xc935
callq 0x21c0
addq $0xd8, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
// File: /workspace/github_cpp_makefile_star2_O1/Proudc[P]CTSS/src/ContinuousQuery/Construct.cpp
// Function: readCompletePath(Graph*, CompletePath*, std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char>>)
void readCompletePath(Graph* myGraph, CompletePath* completePath, const std::string comFilePath)
{
	int   count = 0;
	char  line[200];
	FILE* fp;
	char* p;
	fp = fopen(comFilePath.c_str(), "r");
	if (!fp)
	{
		printf("Error when reading complete path file...\n");
	}
	else
	{
		while (fgets(line, 200, fp) != NULL)
		{
			p = strtok(line, " |\t");
			int pos = atoi(p);
			completePath->edges.push_back(myGraph->edgesVector[pos]);
			count++;
		}
	}
	fclose(fp);
}

// Assembly:
pushq %rbp
movq %rsp, %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0xd8, %rsp
movq %rsi, %r14
movq %rdi, %r15
movq (%rdx), %rdi
leaq 0x5274(%rip), %rsi      # 0xc7a9
callq 0x2170
movq %rax, %rbx
testq %rax, %rax
je 0x75d2
leaq -0x100(%rbp), %rdi
movl $0xc8, %esi
movq %rbx, %rdx
callq 0x21f0
testq %rax, %rax
je 0x75de
leaq 0x10(%r14), %rax
movq %rax, -0x30(%rbp)
leaq 0x523d(%rip), %r13      # 0xc7ab
leaq -0x100(%rbp), %r12
movq %r12, %rdi
movq %r13, %rsi
callq 0x21e0
movq %rax, %rdi
callq 0x21d0
movslq %eax, %rdx
shlq $0x5, %rdx
addq 0x8(%r15), %rdx
movq 0x18(%r14), %rsi
cmpq 0x20(%r14), %rsi
je 0x75b2
movups (%rdx), %xmm0
movups 0x10(%rdx), %xmm1
movups %xmm1, 0x10(%rsi)
movups %xmm0, (%rsi)
addq $0x20, 0x18(%r14)
jmp 0x75bb
movq -0x30(%rbp), %rdi
callq 0x4cf6
movq %r12, %rdi
movl $0xc8, %esi
movq %rbx, %rdx
callq 0x21f0
testq %rax, %rax
jne 0x7575
jmp 0x75de
leaq 0x5393(%rip), %rdi      # 0xc96c
callq 0x21c0
movq %rbx, %rdi
callq 0x2140
addq $0xd8, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
// File: /workspace/github_cpp_makefile_star2_O1/Proudc[P]CTSS/src/ContinuousQuery/Discrete.cpp
// Function: discreteReferPath(Graph*, ReferencePath*)
void discreteReferPath(Graph* myGraph, ReferencePath* temPath)
{
	// printf("Start discretizing the reference path...\n");
	temPath->numOfReferPoint = 0;
	std::vector<Point> pointList;
	pointList = creatTrajPoint(myGraph, temPath->edges, temPath->initialVertex);
	for (unsigned int i = 0; i < pointList.size(); i++)
	{
		temPath->pointOfRefer[i].x = pointList[i].x;
		temPath->pointOfRefer[i].y = pointList[i].y;
		temPath->numOfReferPoint += 1;
	}
	// printf("Discretization of the reference path completed!!!\n");
}

// Assembly:
pushq %rbp
movq %rsp, %rbp
pushq %r14
pushq %rbx
subq $0x20, %rsp
movq %rsi, %rbx
movq %rdi, %rsi
movl $0x0, 0x8(%rbx)
leaq 0x20(%rbx), %rdx
movl (%rbx), %ecx
leaq -0x30(%rbp), %r14
movq %r14, %rdi
callq 0x7681
movq (%r14), %rdi
movq 0x8(%r14), %rax
subq %rdi, %rax
je 0x766e
sarq $0x4, %rax
movq 0x10(%rbx), %rdx
movl 0x8(%rbx), %ecx
movl $0x8, %esi
movl $0x1, %r8d
movsd -0x8(%rdi,%rsi), %xmm0
movsd %xmm0, -0x8(%rdx,%rsi)
movsd (%rdi,%rsi), %xmm0
movsd %xmm0, (%rdx,%rsi)
incl %ecx
movl %r8d, %r9d
addq $0x10, %rsi
incl %r8d
cmpq %r9, %rax
ja 0x7644
movl %ecx, 0x8(%rbx)
testq %rdi, %rdi
je 0x7678
callq 0x2130
addq $0x20, %rsp
popq %rbx
popq %r14
popq %rbp
retq
// File: /workspace/github_cpp_makefile_star2_O1/Proudc[P]CTSS/src/ContinuousQuery/Frechet.cpp
// Function: DFD(Graph*, std::vector<Edge, std::allocator<Edge>>, ReferencePath*)
double DFD(Graph* myGraph, std::vector<Edge> finalPath, ReferencePath* referencePath)
{
	std::vector<Point> temPointList;
	temPointList = creatTrajPoint(myGraph, finalPath, referencePath->initialVertex);
	Point p[temPointList.size()];
	for (unsigned int i = 0; i < temPointList.size(); i++)
	{
		p[i].x = temPointList[i].x;
		p[i].y = temPointList[i].y;
	}
	double temDist = dfdDist(temPointList.size(), referencePath->numOfReferPoint, p, referencePath->pointOfRefer);
	return temDist;
}

// Assembly:
pushq %rbp
movq %rsp, %rbp
pushq %r15
pushq %r14
pushq %rbx
subq $0x28, %rsp
movq %rdx, %r14
movq %rsi, %rdx
movq %rdi, %rsi
movl (%r14), %ecx
leaq -0x40(%rbp), %rdi
callq 0x7681
movq %rsp, %r15
movq -0x40(%rbp), %rbx
movq -0x38(%rbp), %rax
movq %rax, %rdi
subq %rbx, %rdi
movq %rsp, %rdx
subq %rdi, %rdx
sarq $0x4, %rdi
movq %rdx, %rsp
cmpq %rbx, %rax
je 0x8092
movl $0x8, %eax
movl $0x1, %ecx
movsd -0x8(%rbx,%rax), %xmm0
movsd %xmm0, -0x8(%rdx,%rax)
movsd (%rbx,%rax), %xmm0
movsd %xmm0, (%rdx,%rax)
movl %ecx, %esi
addq $0x10, %rax
incl %ecx
cmpq %rsi, %rdi
ja 0x806f
movl 0x8(%r14), %esi
movq 0x10(%r14), %rcx
callq 0x7a5c
movq %r15, %rsp
testq %rbx, %rbx
je 0x80b9
movq %rbx, %rdi
movsd %xmm0, -0x20(%rbp)
callq 0x2130
movsd -0x20(%rbp), %xmm0
leaq -0x18(%rbp), %rsp
popq %rbx
popq %r14
popq %r15
popq %rbp
retq
movq %rax, %r14
jmp 0x80ce
movq %rax, %r14
xorl %ebx, %ebx
testq %rbx, %rbx
je 0x80db
movq %rbx, %rdi
callq 0x2130
movq %r14, %rdi
callq 0x2220
// File: /workspace/github_cpp_makefile_star2_O1/Proudc[P]CTSS/src/ContinuousQuery/Frechet.cpp
// Function: dfdBetweenTwoLocalPaths(Graph*, std::vector<Edge, std::allocator<Edge>>&, std::vector<Edge, std::allocator<Edge>>&, int)
double dfdBetweenTwoLocalPaths(Graph* myGraph, std::vector<Edge>& firstPath, std::vector<Edge>& secPath, int initialVertex)
{
	std::vector<Point> firstPointList;
	std::vector<Point> secPointList;
	firstPointList = creatTrajPoint(myGraph, firstPath, initialVertex);
	secPointList   = creatTrajPoint(myGraph, secPath, initialVertex);
	Point p[firstPointList.size()];
	Point q[secPointList.size()];
	for (unsigned int i = 0; i < firstPointList.size(); i++)
	{
		p[i].x = firstPointList[i].x;
		p[i].y = firstPointList[i].y;
	}
	for (unsigned int i = 0; i < secPointList.size(); i++)
	{
		q[i].x = secPointList[i].x;
		q[i].y = secPointList[i].y;
	}
	return dfdDist(firstPointList.size(), secPointList.size(), p, q);
}

// Assembly:
pushq %rbp
movq %rsp, %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x28, %rsp
movl %ecx, %r14d
movq %rdx, %r15
movq %rsi, %rdx
movq %rdi, %r12
leaq -0x50(%rbp), %rdi
movq %r12, %rsi
callq 0x7681
leaq -0x50(%rbp), %rdi
movq (%rdi), %rbx
movq 0x8(%rdi), %r13
movq %r12, %rsi
movq %r15, %rdx
movl %r14d, %ecx
callq 0x7681
movq %rsp, %r15
movq -0x50(%rbp), %r14
movq -0x48(%rbp), %rax
movq %r13, %rdi
subq %rbx, %rdi
movq %rsp, %rdx
subq %rdi, %rdx
sarq $0x4, %rdi
movq %rdx, %rsp
movq %rax, %rsi
subq %r14, %rsi
movq %rsp, %rcx
subq %rsi, %rcx
movq %rcx, %rsp
cmpq %rbx, %r13
je 0x818c
movl $0x8, %r8d
movl $0x1, %r9d
movsd -0x8(%rbx,%r8), %xmm0
movsd %xmm0, -0x8(%rdx,%r8)
movsd (%rbx,%r8), %xmm0
movsd %xmm0, (%rdx,%r8)
movl %r9d, %r10d
addq $0x10, %r8
incl %r9d
cmpq %r10, %rdi
ja 0x8163
sarq $0x4, %rsi
cmpq %r14, %rax
je 0x81c7
movl $0x8, %eax
movl $0x1, %r8d
movsd -0x8(%r14,%rax), %xmm0
movsd %xmm0, -0x8(%rcx,%rax)
movsd (%r14,%rax), %xmm0
movsd %xmm0, (%rcx,%rax)
movl %r8d, %r9d
addq $0x10, %rax
incl %r8d
cmpq %r9, %rsi
ja 0x81a0
callq 0x7a5c
movsd %xmm0, -0x30(%rbp)
movq %r15, %rsp
testq %r14, %r14
je 0x81e1
movq %r14, %rdi
callq 0x2130
testq %rbx, %rbx
je 0x81ee
movq %rbx, %rdi
callq 0x2130
movsd -0x30(%rbp), %xmm0
leaq -0x28(%rbp), %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
movq %rax, %r15
jmp 0x8214
movq %rax, %r15
jmp 0x8211
movq %rax, %r15
xorl %ebx, %ebx
xorl %r14d, %r14d
testq %r14, %r14
je 0x8221
movq %r14, %rdi
callq 0x2130
testq %rbx, %rbx
je 0x822e
movq %rbx, %rdi
callq 0x2130
movq %r15, %rdi
callq 0x2220
// File: /workspace/github_cpp_makefile_star2_O1/jorbs[P]stellar-keypair-tool/keypair.cpp
// Function: encode[abi:cxx11](VersionByte const&, std::vector<unsigned char, std::allocator<unsigned char>>&)
std::string encode(const VersionByte &versionByte, std::vector<uint8_t> &data) {
  std::vector<uint8_t> bytes;

  bytes.push_back(versionByte);
  bytes.insert(bytes.end(), data.begin(), data.end());

  uint16_t crc = crc16((char *) bytes.data(), bytes.size());

  bytes.emplace_back(static_cast<uint8_t>(crc & 0xFF));
  bytes.emplace_back(static_cast<uint8_t>((crc >> 8) & 0xFF));

  return bn::encode_b32(bytes);
}

// Assembly:
pushq %r15
pushq %r14
pushq %rbx
subq $0x30, %rsp
movq %rdx, %r14
movq %rdi, %r15
xorps %xmm0, %xmm0
leaq 0x10(%rsp), %rdi
movaps %xmm0, (%rdi)
movq $0x0, 0x10(%rdi)
movb (%rsi), %al
leaq 0xf(%rsp), %rsi
movb %al, (%rsi)
callq 0x2e02
leaq 0x10(%rsp), %rdi
movq 0x8(%rdi), %rsi
movq (%r14), %rdx
movq 0x8(%r14), %rcx
callq 0x3090
movq 0x10(%rsp), %rdi
movl 0x18(%rsp), %esi
subl %edi, %esi
callq 0x3650
movl %eax, %ebx
leaq 0xf(%rsp), %rsi
movb %bl, (%rsi)
leaq 0x10(%rsp), %rdi
callq 0x2e02
movb %bh, 0xf(%rsp)
leaq 0x10(%rsp), %rdi
leaq 0xf(%rsp), %rsi
callq 0x2e02
leaq 0x10(%r15), %rbx
movq %rbx, (%r15)
movq $0x0, 0x8(%r15)
movq 0x18(%rsp), %rax
subq 0x10(%rsp), %rax
addq $0x2, %rax
movabsq $-0x5555555555555555, %rcx # imm = 0xAAAAAAAAAAAAAAAB
mulq %rcx
movb $0x0, 0x10(%r15)
andq $-0x2, %rdx
leaq 0x1(,%rdx,2), %rsi
movq %r15, %rdi
callq 0x2220
movq 0x10(%rsp), %rdi
movq 0x18(%rsp), %rsi
movq %r15, %rdx
callq 0x3394
movq 0x10(%rsp), %rdi
testq %rdi, %rdi
je 0x262b
movq 0x20(%rsp), %rsi
subq %rdi, %rsi
callq 0x2180
movq %r15, %rax
addq $0x30, %rsp
popq %rbx
popq %r14
popq %r15
retq
jmp 0x2640
jmp 0x2640
jmp 0x2640
jmp 0x2640
movq %rax, %r14
movq 0x10(%rsp), %rdi
testq %rdi, %rdi
je 0x265a
movq 0x20(%rsp), %rsi
subq %rdi, %rsi
callq 0x2180
movq %r14, %rdi
callq 0x2290
movq %rax, %r14
movq (%r15), %rdi
cmpq %rbx, %rdi
je 0x2643
movq (%rbx), %rsi
incq %rsi
callq 0x2180
jmp 0x2643
// File: /workspace/github_cpp_makefile_star2_O1/jorbs[P]stellar-keypair-tool/lib/crc16.cpp
// Function: crc16(char const*, int)
uint16_t crc16(const char *buf, int len) {
    int counter;
    uint16_t crc = 0;
    for (counter = 0; counter < len; counter++)
            crc = ((crc<<8) & uint16_t(0xFFFF)) ^
        crc16tab[((crc>>8) ^ *buf++) & uint16_t(0x00FF)];
    return crc;
}

// Assembly:
testl %esi, %esi
jle 0x3688
movl %esi, %ecx
xorl %edx, %edx
leaq 0xcd1(%rip), %rsi       # 0x4330
xorl %r8d, %r8d
movl %r8d, %eax
shll $0x8, %eax
movzwl %r8w, %r8d
shrl $0x8, %r8d
movzbl (%rdi,%rdx), %r9d
xorl %r8d, %r9d
xorw (%rsi,%r9,2), %ax
incq %rdx
movl %eax, %r8d
cmpl %edx, %ecx
jne 0x3662
retq
xorl %eax, %eax
retq
// File: /workspace/github_cpp_makefile_star2_O1/searsm8[P]FM_Partitioning/fmpart.cpp
// Function: initialPartition()
void initialPartition()
{
	srand(time(0)); //use current time for random seed				
	int index;
	
	//randomly move cells into other partition until approximately half area in each
	while((float)partition_area[1] / (float)(partition_area[0] + partition_area[1]) < .5 )
	{
		//select a random cell to move to partition 1
		index = rand() % cells.size();
		if(cells[index]->partition == 0)
		{	
			cells[index]->partition = 1;
			cells[index]->best_partition = 1;
			partition_area[0] -= cells[index]->area;
			partition_area[1] += cells[index]->area;		
		}
	}
	
	printf("\nInitial Partition:\n");		
	printPartitionAreas();		
}

// Assembly:
pushq %rbp
movq %rsp, %rbp
pushq %rbx
pushq %rax
xorl %edi, %edi
callq 0x2130
movl %eax, %edi
callq 0x2150
movl 0x5263(%rip), %eax      # 0x8250
cvtsi2ss %eax, %xmm0
addl 0x5255(%rip), %eax      # 0x824c
cvtsi2ss %eax, %xmm1
divss %xmm1, %xmm0
movss 0x2019(%rip), %xmm1     # 0x5020
ucomiss %xmm0, %xmm1
jbe 0x3088
movabsq $0x100000001, %rbx      # imm = 0x100000001
callq 0x2060
cltq
movq 0x51e4(%rip), %rcx      # 0x8208
movq 0x51d5(%rip), %rsi      # 0x8200
subq %rsi, %rcx
sarq $0x3, %rcx
xorl %edx, %edx
divq %rcx
movslq %edx, %rax
movq (%rsi,%rax,8), %rax
cmpl $0x0, 0x84(%rax)
jne 0x305d
movq %rbx, 0x84(%rax)
movl 0x78(%rax), %eax
subl %eax, 0x51f5(%rip)      # 0x824c
addl %eax, 0x51f3(%rip)      # 0x8250
movl 0x51ed(%rip), %eax      # 0x8250
xorps %xmm0, %xmm0
cvtsi2ss %eax, %xmm0
addl 0x51dc(%rip), %eax      # 0x824c
xorps %xmm1, %xmm1
cvtsi2ss %eax, %xmm1
divss %xmm1, %xmm0
movss 0x1f9d(%rip), %xmm1     # 0x5020
ucomiss %xmm0, %xmm1
ja 0x3016
leaq 0x2358(%rip), %rdi      # 0x53e7
callq 0x21f0
addq $0x8, %rsp
popq %rbx
popq %rbp
jmp 0x309f
// File: /workspace/github_cpp_makefile_star2_O1/searsm8[P]FM_Partitioning/fmpart.cpp
// Function: findCutsize()
void findCutsize()
{
	cut_size = 0;	
	
	//loop through each net. If there is at least one cell in each partition, add 1 to cutsize	
	for(int i = 0; i < nets.size(); i++)
	{		
		nets[i]->partition_count[0] = 0;
		nets[i]->partition_count[1] = 0;
		
		for(int j = 0; j < nets[i]->cell_list.size(); j++)
		{
			//count how many cells in each partition on this net
			nets[i]->partition_count[nets[i]->cell_list[j]->partition]++;			
		}
		
		if(nets[i]->partition_count[0] > 0 && nets[i]->partition_count[1] > 0)
			cut_size++;
	}				
	printf("Cutsize: %d\n", cut_size);
}

// Assembly:
movl $0x0, 0x512c(%rip)      # 0x8248
movq 0x513d(%rip), %rax      # 0x8260
movq 0x512e(%rip), %rcx      # 0x8258
subq %rcx, %rax
je 0x319f
pushq %rbp
movq %rsp, %rbp
sarq $0x3, %rax
cmpq $0x1, %rax
adcq $0x0, %rax
xorl %edx, %edx
movq (%rcx,%rdx,8), %rsi
movq $0x0, 0x6c(%rsi)
movq 0x78(%rsi), %rdi
movq 0x80(%rsi), %r8
subq %rdi, %r8
je 0x3184
sarq $0x3, %r8
cmpq $0x1, %r8
adcq $0x0, %r8
xorl %r9d, %r9d
movq (%rdi,%r9,8), %r10
movslq 0x84(%r10), %r10
incl 0x6c(%rsi,%r10,4)
incq %r9
cmpq %r9, %r8
jne 0x316c
cmpl $0x0, 0x6c(%rsi)
jle 0x3196
cmpl $0x0, 0x70(%rsi)
jle 0x3196
incl 0x50b2(%rip)            # 0x8248
incq %rdx
cmpq %rax, %rdx
jne 0x3141
popq %rbp
movl 0x50a3(%rip), %esi      # 0x8248
leaq 0x1f8e(%rip), %rdi      # 0x513a
xorl %eax, %eax
jmp 0x2040
// File: /workspace/github_cpp_makefile_star2_O1/searsm8[P]FM_Partitioning/fmpart.cpp
// Function: printCutsize()
int printCutsize()  //finds and returns the cutsize from scratch
{
	int my_cut_size = 0;
	int my_partition_count[2];	
	
	//loop through each net. If there is at least one cell in each partition, add 1 to cutsize	
	for(int i = 0; i < nets.size(); i++)
	{		
		my_partition_count[0] = 0;
		my_partition_count[1] = 0;
		
		for(int j = 0; j < nets[i]->cell_list.size(); j++)
		{
			//count how many cells in each partition on this net
			my_partition_count[nets[i]->cell_list[j]->partition]++;			
		}

		if(my_partition_count[0] && my_partition_count[1])
			my_cut_size++;
	}		
		
	return my_cut_size;
}

// Assembly:
movq 0x50a6(%rip), %rcx      # 0x8260
movq 0x5097(%rip), %rdx      # 0x8258
subq %rdx, %rcx
je 0x3240
pushq %rbp
movq %rsp, %rbp
sarq $0x3, %rcx
cmpq $0x1, %rcx
adcq $0x0, %rcx
xorl %esi, %esi
xorl %eax, %eax
movq $0x0, -0x8(%rbp)
movq (%rdx,%rsi,8), %r8
movq 0x78(%r8), %rdi
movq 0x80(%r8), %r8
subq %rdi, %r8
je 0x321d
sarq $0x3, %r8
cmpq $0x1, %r8
adcq $0x0, %r8
xorl %r9d, %r9d
movq (%rdi,%r9,8), %r10
movslq 0x84(%r10), %r10
incl -0x8(%rbp,%r10,4)
incq %r9
cmpq %r9, %r8
jne 0x3205
cmpl $0x0, -0x8(%rbp)
setne %dil
cmpl $0x0, -0x4(%rbp)
setne %r8b
andb %dil, %r8b
movzbl %r8b, %edi
addl %edi, %eax
incq %rsi
cmpq %rcx, %rsi
jne 0x31da
popq %rbp
retq
xorl %eax, %eax
retq
// File: /workspace/github_cpp_makefile_star2_O1/searsm8[P]FM_Partitioning/fmpart.cpp
// Function: computeGains()
void computeGains()
{
	gain_bucket[0].clear();
	gain_bucket[1].clear();
	
	//look through all cells, compute gain for each cell 
	for(int i = 0; i < cells.size(); i++)
	{	
		cells[i]->gain = 0;
		
			
		//for each net the cell is in, check if there is any gain for that net
		for (int j = 0; j < cells[i]->net_list.size(); j++)
		{	
			NET* current_net = cells[i]->net_list[j];				
						
			//if there is exactly one cell in the "From" partition, increase gain
			if(current_net->partition_count[cells[i]->partition] == 1)
			{	
				cells[i]->gain++;
				current_net->critical = true;
			}
			
			//if there is exactly zero cells in the "To" partition, decrease gain
			if(current_net->partition_count[!cells[i]->partition] == 0)
			{	
				cells[i]->gain--;
				current_net->critical = true;
			}			
		}
		
		//add this cell to a gain bucket, and initialize gain_itr				
		cells[i]->gain_itr = gain_bucket[cells[i]->partition].insert(pair <int, CELL*> (cells[i]->gain,  cells[i]));	
	} 			
}

// Assembly:
pushq %rbp
movq %rsp, %rbp
pushq %r15
pushq %r14
pushq %rbx
subq $0x18, %rsp
leaq 0x4f49(%rip), %rbx      # 0x81a0
movq %rbx, %rdi
callq 0x4cb6
leaq 0x4f6a(%rip), %rdi      # 0x81d0
callq 0x4cb6
movq 0x4f8e(%rip), %rax      # 0x8200
cmpq %rax, 0x4f8f(%rip)      # 0x8208
je 0x3357
xorl %r15d, %r15d
leaq -0x28(%rbp), %r14
movq (%rax,%r15,8), %rcx
movl $0x0, 0x80(%rcx)
movq 0x98(%rcx), %rdx
movq 0xa0(%rcx), %rsi
subq %rdx, %rsi
je 0x32f9
sarq $0x3, %rsi
movslq 0x84(%rcx), %rdi
xorl %r8d, %r8d
testq %rdi, %rdi
sete %r8b
cmpq $0x1, %rsi
adcq $0x0, %rsi
xorl %r9d, %r9d
movq (%rdx,%r9,8), %r10
cmpl $0x1, 0x6c(%r10,%rdi,4)
jne 0x32de
incl 0x80(%rcx)
movb $0x1, 0x69(%r10)
cmpl $0x0, 0x6c(%r10,%r8,4)
jne 0x32f1
decl 0x80(%rcx)
movb $0x1, 0x69(%r10)
incq %r9
cmpq %r9, %rsi
jne 0x32c7
movslq 0x84(%rcx), %rcx
leaq (%rcx,%rcx,2), %rdi
shlq $0x4, %rdi
addq %rbx, %rdi
movq (%rax,%r15,8), %rax
movl 0x80(%rax), %ecx
movl %ecx, -0x28(%rbp)
movq %rax, -0x20(%rbp)
movq %r14, %rsi
callq 0x422a
movq 0x4ed5(%rip), %rcx      # 0x8200
movq (%rcx,%r15,8), %rcx
movq %rax, 0x90(%rcx)
incq %r15
movq 0x4ec8(%rip), %rcx      # 0x8208
movq 0x4eb9(%rip), %rax      # 0x8200
subq %rax, %rcx
sarq $0x3, %rcx
cmpq %r15, %rcx
ja 0x3286
addq $0x18, %rsp
popq %rbx
popq %r14
popq %r15
popq %rbp
retq
// File: /workspace/github_cpp_makefile_star2_O1/searsm8[P]FM_Partitioning/fmpart.cpp
// Function: saveBestSolution()
void saveBestSolution()
{	
	//keep track of the best solution found
	min_cut_size = cut_size;
			
	for(int i = 0; i < cells.size(); i++)
		cells[i]->best_partition = cells[i]->partition;
				
	//printf("SAVED new best solution: (cutsize = %d)\n", cut_size);	
}

// Assembly:
movl 0x4ee0(%rip), %eax      # 0x8248
movl %eax, 0x4f02(%rip)      # 0x8270
movq 0x4e93(%rip), %rax      # 0x8208
movq 0x4e84(%rip), %rcx      # 0x8200
subq %rcx, %rax
je 0x33ac
pushq %rbp
movq %rsp, %rbp
sarq $0x3, %rax
cmpq $0x1, %rax
adcq $0x0, %rax
xorl %edx, %edx
movq (%rcx,%rdx,8), %rsi
movl 0x84(%rsi), %edi
movl %edi, 0x88(%rsi)
incq %rdx
cmpq %rdx, %rax
jne 0x3393
popq %rbp
retq