HomeSort by relevance Sort by last modified time
    Searched refs:Count (Results 1 - 25 of 2509) sorted by null

1 2 3 4 5 6 7 8 91011>>

  /device/linaro/bootloader/edk2/MdePkg/Library/BaseLib/
ARShiftU64.c 21 This function shifts the 64-bit value Operand to the right by Count bits. The
22 high Count bits are set to bit 63 of Operand. The shifted value is returned.
24 If Count is greater than 63, then ASSERT().
27 @param Count The number of bits to shift right.
29 @return Operand >> Count
36 IN UINTN Count
39 ASSERT (Count < 64);
40 return InternalMathARShiftU64 (Operand, Count);
LRotU64.c 21 This function rotates the 64-bit value Operand to the left by Count bits. The
22 low Count bits are fill with the high Count bits of Operand. The rotated
25 If Count is greater than 63, then ASSERT().
28 @param Count The number of bits to rotate left.
30 @return Operand << Count
37 IN UINTN Count
40 ASSERT (Count < 64);
41 return InternalMathLRotU64 (Operand, Count);
LShiftU64.c 21 This function shifts the 64-bit value Operand to the left by Count bits. The
22 low Count bits are set to zero. The shifted value is returned.
24 If Count is greater than 63, then ASSERT().
27 @param Count The number of bits to shift left.
29 @return Operand << Count.
36 IN UINTN Count
39 ASSERT (Count < 64);
40 return InternalMathLShiftU64 (Operand, Count);
RRotU64.c 21 This function rotates the 64-bit value Operand to the right by Count bits.
22 The high Count bits are fill with the low Count bits of Operand. The rotated
25 If Count is greater than 63, then ASSERT().
28 @param Count The number of bits to rotate right.
30 @return Operand >> Count.
37 IN UINTN Count
40 ASSERT (Count < 64);
41 return InternalMathRRotU64 (Operand, Count);
RShiftU64.c 21 This function shifts the 64-bit value Operand to the right by Count bits. The
22 high Count bits are set to zero. The shifted value is returned.
24 If Count is greater than 63, then ASSERT().
27 @param Count The number of bits to shift right.
29 @return Operand >> Count.
36 IN UINTN Count
39 ASSERT (Count < 64);
40 return InternalMathRShiftU64 (Operand, Count);
LRotU32.c 21 This function rotates the 32-bit value Operand to the left by Count bits. The
22 low Count bits are fill with the high Count bits of Operand. The rotated
25 If Count is greater than 31, then ASSERT().
28 @param Count The number of bits to rotate left.
30 @return Operand << Count
37 IN UINTN Count
40 ASSERT (Count < 32);
41 return (Operand << Count) | (Operand >> (32 - Count));
    [all...]
RRotU32.c 21 This function rotates the 32-bit value Operand to the right by Count bits.
22 The high Count bits are fill with the low Count bits of Operand. The rotated
25 If Count is greater than 31, then ASSERT().
28 @param Count The number of bits to rotate right.
30 @return Operand >> Count.
37 IN UINTN Count
40 ASSERT (Count < 32);
41 return (Operand >> Count) | (Operand << (32 - Count));
    [all...]
  /device/linaro/bootloader/edk2/EdkCompatibilityPkg/Foundation/Library/EdkIIGlueLib/Library/BaseLib/
LRotU32.c 29 This function rotates the 32-bit value Operand to the left by Count bits. The
30 low Count bits are fill with the high Count bits of Operand. The rotated
33 If Count is greater than 31, then ASSERT().
36 @param Count The number of bits to rotate left.
38 @return Operand <<< Count
45 IN UINTN Count
48 ASSERT (Count < sizeof (Operand) * 8);
49 return (Operand << Count) | (Operand >> (32 - Count));
    [all...]
RRotU32.c 29 This function rotates the 32-bit value Operand to the right by Count bits.
30 The high Count bits are fill with the low Count bits of Operand. The rotated
33 If Count is greater than 31, then ASSERT().
36 @param Count The number of bits to rotate right.
38 @return Operand >>> Count
45 IN UINTN Count
48 ASSERT (Count < sizeof (Operand) * 8);
49 return (Operand >> Count) | (Operand << (32 - Count));
    [all...]
ARShiftU64.c 29 This function shifts the 64-bit value Operand to the right by Count bits. The
30 high Count bits are set to bit 63 of Operand. The shifted value is returned.
32 If Count is greater than 63, then ASSERT().
35 @param Count The number of bits to shift right.
37 @return Operand arithmetically shifted right by Count
44 IN UINTN Count
47 ASSERT (Count < sizeof (Operand) * 8);
48 return InternalMathARShiftU64 (Operand, Count);
LRotU64.c 29 This function rotates the 64-bit value Operand to the left by Count bits. The
30 low Count bits are fill with the high Count bits of Operand. The rotated
33 If Count is greater than 63, then ASSERT().
36 @param Count The number of bits to rotate left.
38 @return Operand <<< Count
45 IN UINTN Count
48 ASSERT (Count < sizeof (Operand) * 8);
49 return InternalMathLRotU64 (Operand, Count);
LShiftU64.c 29 This function shifts the 64-bit value Operand to the left by Count bits. The
30 low Count bits are set to zero. The shifted value is returned.
32 If Count is greater than 63, then ASSERT().
35 @param Count The number of bits to shift left.
37 @return Operand << Count
44 IN UINTN Count
47 ASSERT (Count < sizeof (Operand) * 8);
48 return InternalMathLShiftU64 (Operand, Count);
RRotU64.c 29 This function rotates the 64-bit value Operand to the right by Count bits.
30 The high Count bits are fill with the low Count bits of Operand. The rotated
33 If Count is greater than 63, then ASSERT().
36 @param Count The number of bits to rotate right.
38 @return Operand >>> Count
45 IN UINTN Count
48 ASSERT (Count < sizeof (Operand) * 8);
49 return InternalMathRRotU64 (Operand, Count);
RShiftU64.c 29 This function shifts the 64-bit value Operand to the right by Count bits. The
30 high Count bits are set to zero. The shifted value is returned.
32 If Count is greater than 63, then ASSERT().
35 @param Count The number of bits to shift right.
37 @return Operand >> Count
44 IN UINTN Count
47 ASSERT (Count < sizeof (Operand) * 8);
48 return InternalMathRShiftU64 (Operand, Count);
CheckSum.c 46 UINTN Count;
51 for (Sum = 0, Count = 0; Count < Length; Count++) {
52 Sum = (UINT8) (Sum + *(Buffer + Count));
122 UINTN Count;
130 for (Sum = 0, Count = 0; Count < Length; Count++) {
131 Sum = (UINT16) (Sum + *(Buffer + Count));
    [all...]
  /external/guava/guava-tests/test/com/google/common/collect/
CountTest.java 22 * Tests for {@code Count}.
29 assertEquals(20, new Count(20).get());
33 Count holder = new Count(20);
39 Count holder = new Count(20);
44 Count holder = new Count(10);
50 Count holder = new Count(10)
    [all...]
  /external/compiler-rt/lib/esan/
esan_circular_buffer.h 42 Count = 0;
49 CHECK_LT(Idx, Count);
54 CHECK_LT(Idx, Count);
60 uptr ArrayIdx = (StartIdx + Count) % Capacity;
62 if (Count < Capacity)
63 ++Count;
68 CHECK_GT(Count, 0);
69 uptr ArrayIdx = (StartIdx + Count - 1) % Capacity;
73 CHECK_GT(Count, 0);
74 --Count;
    [all...]
  /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/clang/include/clang/Basic/
AddressSpaces.h 45 // This denotes the count of language-specific address spaces and also
48 Count
53 typedef unsigned Map[Count];
  /prebuilts/clang/host/linux-x86/clang-4053586/prebuilt_include/clang/include/clang/Basic/
AddressSpaces.h 45 // This denotes the count of language-specific address spaces and also
48 Count
53 typedef unsigned Map[Count];
  /device/linaro/bootloader/edk2/MdeModulePkg/Library/BootMaintenanceManagerUiLib/
BmLib.c 61 UINTN Count;
64 Count = 0;
66 Count += 1;
69 return Count;
  /device/linaro/bootloader/edk2/EdkCompatibilityPkg/Foundation/Library/CompilerStub/
memcpy.c 34 IN UINTN Count
40 for (Ptr = Dest, Source = Src; Count > 0; Count--, Source++, Ptr++) {
memset.c 34 IN UINTN Count
39 for (Ptr = Dest; Count > 0; Count--, Ptr++) {
  /external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime.Collections/
StackList.cs 63 object poppedItem = this[this.Count - 1];
64 RemoveAt(this.Count - 1);
74 return this[this.Count - 1];
  /external/llvm/unittests/MC/
TargetRegistry.cpp 25 int Count = 0;
40 ++Count;
43 ASSERT_NE(Count, 0);
  /prebuilts/clang/host/darwin-x86/clang-4579689/include/llvm/Support/
LEB128.h 26 unsigned Count = 0;
33 Count++;
34 if (More || Count < PadTo)
40 if (Count < PadTo) {
42 for (; Count < PadTo - 1; ++Count)
52 unsigned Count = 0;
60 Count++;
61 if (More || Count < PadTo)
67 if (Count < PadTo)
    [all...]

Completed in 587 milliseconds

1 2 3 4 5 6 7 8 91011>>