Adding qemu as a submodule of KVMFORNFV

This Patch includes the changes to add qemu as a submodule to
kvmfornfv repo and make use of the updated latest qemu for the
execution of all testcase
Change-Id: I1280af507a857675c7f81d30c95255635667bdd7
Signed-off-by:RajithaY<rajithax.yerrumsetty@intel.com>

1 files changed, 0 insertions, 56 deletions

diff --git a/qemu/roms/ipxe/src/core/isqrt.c b/qemu/roms/ipxe/src/core/isqrt.c
deleted file mode 100644
index c4d0571e7..000000000
--- a/qemu/roms/ipxe/src/core/isqrt.c
+++ /dev/null
@@ -1,56 +0,0 @@
-/*
- * Copyright (C) 2014 Michael Brown <mbrown@fensystems.co.uk>.
- *
- * This program is free software; you can redistribute it and/or
- * modify it under the terms of the GNU General Public License as
- * published by the Free Software Foundation; either version 2 of the
- * License, or any later version.
- *
- * This program is distributed in the hope that it will be useful, but
- * WITHOUT ANY WARRANTY; without even the implied warranty of
- * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
- * General Public License for more details.
- *
- * You should have received a copy of the GNU General Public License
- * along with this program; if not, write to the Free Software
- * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA
- * 02110-1301, USA.
- *
- * You can also choose to distribute this program under the terms of
- * the Unmodified Binary Distribution Licence (as given in the file
- * COPYING.UBDL), provided that you have satisfied its requirements.
- */
-
-FILE_LICENCE ( GPL2_OR_LATER_OR_UBDL );
-
-/** @file
- *
- * Integer square root
- *
- */
-
-#include <ipxe/isqrt.h>
-
-/**
- * Find integer square root
- *
- * @v value		Value
- * @v isqrt		Integer square root of value
- */
-unsigned long isqrt ( unsigned long value ) {
-	unsigned long result = 0;
-	unsigned long bit = ( 1UL << ( ( 8 * sizeof ( bit ) ) - 2 ) );
-
-	while ( bit > value )
-		bit >>= 2;
-	while ( bit ) {
-		if ( value >= ( result + bit ) ) {
-			value -= ( result + bit );
-			result = ( ( result >> 1 ) + bit );
-		} else {
-			result >>= 1;
-		}
-		bit >>= 2;
-	}
-	return result;
-}