mirror of
				https://github.com/acidanthera/audk.git
				synced 2025-10-31 03:03:46 +01:00 
			
		
		
		
	Trailing spaces create issue/warning when generating/applying patches. Contributed-under: TianoCore Contribution Agreement 1.0 Signed-off-by: Ronald Cron <ronald.cron@arm.com> Reviewed-By: Olivier Martin <olivier.martin@arm.com> git-svn-id: https://svn.code.sf.net/p/edk2/code/trunk/edk2@15833 6f19259b-4bc3-4df7-8a09-765794883524
		
			
				
	
	
		
			99 lines
		
	
	
		
			3.3 KiB
		
	
	
	
		
			C
		
	
	
	
	
	
			
		
		
	
	
			99 lines
		
	
	
		
			3.3 KiB
		
	
	
	
		
			C
		
	
	
	
	
	
| /** @file
 | |
| 
 | |
|   Copyright (c) 2008 - 2009, Apple Inc. All rights reserved.<BR>
 | |
| 
 | |
|   This program and the accompanying materials
 | |
|   are licensed and made available under the terms and conditions of the BSD License
 | |
|   which accompanies this distribution.  The full text of the license may be found at
 | |
|   http://opensource.org/licenses/bsd-license.php
 | |
| 
 | |
|   THE PROGRAM IS DISTRIBUTED UNDER THE BSD LICENSE ON AN "AS IS" BASIS,
 | |
|   WITHOUT WARRANTIES OR REPRESENTATIONS OF ANY KIND, EITHER EXPRESS OR IMPLIED.
 | |
| 
 | |
| **/
 | |
| /**
 | |
|   University of Illinois/NCSA
 | |
|   Open Source License
 | |
| 
 | |
|   Copyright (c) 2003-2008 University of Illinois at Urbana-Champaign.
 | |
|   All rights reserved.
 | |
| 
 | |
|   Developed by:
 | |
| 
 | |
|       LLVM Team
 | |
| 
 | |
|       University of Illinois at Urbana-Champaign
 | |
| 
 | |
|       http://llvm.org
 | |
| 
 | |
|   Permission is hereby granted, free of charge, to any person obtaining a copy of
 | |
|   this software and associated documentation files (the "Software"), to deal with
 | |
|   the Software without restriction, including without limitation the rights to
 | |
|   use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies
 | |
|   of the Software, and to permit persons to whom the Software is furnished to do
 | |
|   so, subject to the following conditions:
 | |
| 
 | |
|       * Redistributions of source code must retain the above copyright notice,
 | |
|         this list of conditions and the following disclaimers.
 | |
| 
 | |
|       * Redistributions in binary form must reproduce the above copyright notice,
 | |
|         this list of conditions and the following disclaimers in the
 | |
|         documentation and/or other materials provided with the distribution.
 | |
| 
 | |
|       * Neither the names of the LLVM Team, University of Illinois at
 | |
|         Urbana-Champaign, nor the names of its contributors may be used to
 | |
|         endorse or promote products derived from this Software without specific
 | |
|         prior written permission.
 | |
| 
 | |
|   THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
 | |
|   IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS
 | |
|   FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.  IN NO EVENT SHALL THE
 | |
|   CONTRIBUTORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
 | |
|   LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
 | |
|   OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS WITH THE
 | |
|   SOFTWARE.
 | |
| **/
 | |
| 
 | |
| #include <Base.h>
 | |
| #include "Llvm_int_lib.h"
 | |
| 
 | |
| 
 | |
| // Returns: a * b
 | |
| 
 | |
| static
 | |
| INT64
 | |
| __muldsi3(UINT32 a, UINT32 b)
 | |
| {
 | |
|     dwords r;
 | |
|     const int bits_in_word_2 = (int)(sizeof(INT32) * CHAR_BIT) / 2;
 | |
|     const UINT32 lower_mask = (UINT32)~0 >> bits_in_word_2;
 | |
|     r.low = (a & lower_mask) * (b & lower_mask);
 | |
|     UINT32 t = r.low >> bits_in_word_2;
 | |
|     r.low &= lower_mask;
 | |
|     t += (a >> bits_in_word_2) * (b & lower_mask);
 | |
|     r.low += (t & lower_mask) << bits_in_word_2;
 | |
|     r.high = t >> bits_in_word_2;
 | |
|     t = r.low >> bits_in_word_2;
 | |
|     r.low &= lower_mask;
 | |
|     t += (b >> bits_in_word_2) * (a & lower_mask);
 | |
|     r.low += (t & lower_mask) << bits_in_word_2;
 | |
|     r.high += t >> bits_in_word_2;
 | |
|     r.high += (a >> bits_in_word_2) * (b >> bits_in_word_2);
 | |
|     return r.all;
 | |
| }
 | |
| 
 | |
| // Returns: a * b
 | |
| 
 | |
| INT64
 | |
| __muldi3(INT64 a, INT64 b)
 | |
| {
 | |
|     dwords x;
 | |
|     x.all = a;
 | |
|     dwords y;
 | |
|     y.all = b;
 | |
|     dwords r;
 | |
|     r.all = __muldsi3(x.low, y.low);
 | |
|     r.high += x.high * y.low + x.low * y.high;
 | |
|     return r.all;
 | |
| }
 |