HomeSort by relevance Sort by last modified time
    Searched refs:Index (Results 701 - 725 of 4075) sorted by null

<<21222324252627282930>>

  /device/linaro/bootloader/edk2/AppPkg/Applications/Sockets/DataSink/
DataSink.c 113 INTN Index;
140 Index = MaxPort++;
141 PollFd[ Index ].fd = ListenSocket;
142 PollFd[ Index ].events = POLLRDNORM | POLLHUP;
143 PollFd[ Index ].revents = 0;
144 ZeroMem ( &Port[ Index ], sizeof ( Port[ Index ]));
273 nfds_t Index;
311 Index = 0;
318 pPortIpAddress4 = (struct sockaddr_in *)&Port[ Index ].IpAddress;
    [all...]
  /device/linaro/bootloader/edk2/MdeModulePkg/Library/BootMaintenanceManagerLib/
Variable.c 37 UINTN Index;
42 for (Index = 0; Index < BootOptionMenu.MenuNumber; Index++) {
43 NewMenuEntry = BOpt_GetMenuEntry (&BootOptionMenu, (Index - Index2));
107 UINTN Index;
145 for (Index = 0; Index < BootOrderListSize; Index++) {
146 NewMenuEntry = BOpt_GetMenuEntry (&BootOptionMenu, Index);
    [all...]
  /device/linaro/bootloader/edk2/MdeModulePkg/Universal/PlatformDriOverrideDxe/
PlatDriOverrideDxe.c 334 UINTN Index;
435 for (Index = 0; Index < DevicePathHandleCount; Index++) {
446 mDevicePathHandleBuffer[Index],
460 mDevicePathHandleBuffer[Index],
471 mDevicePathHandleBuffer[Index],
482 mControllerDevicePathProtocol[Index] = ControllerDevicePath;
503 NewStringToken = HiiSetString (Private->RegisteredHandle, mControllerToken[Index], NewString, NULL);
509 mControllerToken[Index] = NewStringToken;
    [all...]
  /device/linaro/bootloader/edk2/OptionRomPkg/UndiRuntimeDxe/
Decode.c 293 UINT16 Index;
303 for (Index = 0; Index < MAX_PCI_CONFIG_LEN; Index++) {
304 DbPtr->pci.Config.Dword[Index] = AdapterInfo->Config[Index];
557 UINT16 Index;
719 for (Index = 0; Index < copy_len; Index++) {
    [all...]
  /device/linaro/bootloader/edk2/MdeModulePkg/Universal/DriverHealthManagerDxe/
DriverHealthManagerDxe.c 556 UINT8 Index;
599 for (Index = 0; Index < NumberOfClassGuid; Index++) {
600 if (CompareGuid (&gEfiHiiDriverHealthFormsetGuid, &ClassGuid[Index])) {
699 UINTN Index;
738 for (Index = 0; Index < mDriverHealthManagerHealthInfoCount; Index++) {
739 if (ConfigureOnly && mDriverHealthManagerHealthInfo[Index].HealthStatus != EfiDriverHealthStatusConfigurationRequired) {
    [all...]
  /external/eigen/Eigen/src/Core/
Redux.h 160 index = Start * redux_traits<Func, Derived>::PacketSize, enumerator in enum:Eigen::internal::redux_vec_unroller::__anon18020
161 outer = index / int(Derived::InnerSizeAtCompileTime),
162 inner = index % int(Derived::InnerSizeAtCompileTime),
195 for(Index i = 1; i < mat.innerSize(); ++i)
197 for(Index i = 1; i < mat.outerSize(); ++i)
198 for(Index j = 0; j < mat.innerSize(); ++j)
217 const Index size = mat.size();
219 const Index packetSize = redux_traits<Func, Derived>::PacketSize;
225 const Index alignedStart = internal::first_default_aligned(mat.nestedExpression());
226 const Index alignedSize2 = ((size-alignedStart)/(2*packetSize))*(2*packetSize)
    [all...]
Reverse.h 92 EIGEN_DEVICE_FUNC inline Index rows() const { return m_matrix.rows(); }
93 EIGEN_DEVICE_FUNC inline Index cols() const { return m_matrix.cols(); }
95 EIGEN_DEVICE_FUNC inline Index innerStride() const
143 Index half = cols()/2;
147 Index half2 = rows()/2;
153 Index half = rows()/2;
157 Index half2 = cols()/2;
174 Index half = xpr.rows()/2;
185 Index half = xpr.cols()/2;
  /device/linaro/bootloader/edk2/MdeModulePkg/Universal/PCD/Dxe/
Service.c 63 // as the array index.
167 // as the array index.
177 // Get the PCD name index.
235 UINTN Index;
254 for (Index = 0; Index < Database->ExTokenCount; Index++) {
255 if (ExMapTable[Index].ExGuidIndex == GuidTableIdx) {
267 PcdInfo->PcdName = GetPcdName (TRUE, IsPeiDb, ExMapTable[Index].TokenNumber);
269 } else if (ExMapTable[Index].ExTokenNumber == TokenNumber) {
    [all...]
  /device/linaro/bootloader/edk2/Vlv2TbltDevicePkg/Library/PlatformBdsLib/
BdsPlatform.c 286 UINTN Index;
416 for (Index = 0; Index < GopHandleCount; Index++) {
418 GopHandleBuffer[Index],
472 UINTN Index;
524 for (Index = 0; Index < HandleCount; Index++) {
526 HandleBuffer[Index],
    [all...]
  /external/eigen/unsupported/Eigen/CXX11/src/Tensor/
TensorBase.h 32 typedef typename DerivedTraits::Index Index;
479 typedef Eigen::IndexPair<Index> DimensionPair;
505 cumsum(const Index& axis, bool exclusive = false) const {
512 cumprod(const Index& axis, bool exclusive = false) const {
519 scan(const Index& axis, const Reducer& reducer, bool exclusive = false) const {
530 const TensorReductionOp<internal::SumReducer<CoeffReturnType>, const DimensionList<Index, NumDimensions>, const Derived>
532 DimensionList<Index, NumDimensions> in_dims;
533 return TensorReductionOp<internal::SumReducer<CoeffReturnType>, const DimensionList<Index, NumDimensions>, const Derived>(derived(), in_dims, internal::SumReducer<CoeffReturnType>());
542 const TensorReductionOp<internal::MeanReducer<CoeffReturnType>, const DimensionList<Index, NumDimensions>, const Derived
    [all...]
  /device/linaro/bootloader/edk2/NetworkPkg/UefiPxeBcDxe/
PxeBcDhcp6.c 75 @return Index The count of the built-in options.
86 UINT32 Index;
89 Index = 0;
95 OptList[Index]->OpCode = HTONS (PXEBC_DHCP6_OPT_ORO);
96 OptList[Index]->OpLen = HTONS (4);
97 OptEnt.Oro = (PXEBC_DHCP6_OPTION_ORO *) OptList[Index]->Data;
100 Index++;
101 OptList[Index] = GET_NEXT_DHCP6_OPTION (OptList[Index - 1]);
106 OptList[Index]->OpCode = HTONS (PXEBC_DHCP6_OPT_UNDI);
    [all...]
  /device/linaro/bootloader/edk2/MdeModulePkg/Universal/Network/SnpDxe/
Statistics.c 80 UINTN Index;
191 for (Index = 0, Mask = 1; Index < 64; Index++, Mask = LShiftU64 (Mask, 1), Stp++) {
196 if ((Index + 1) * sizeof (UINT64) > *StatisticsSize) {
201 *Stp = Db->Data[Index];
202 Size = Index + 1;
210 while (++Index < 64) {
212 Size = Index;
  /device/linaro/bootloader/edk2/OptionRomPkg/CirrusLogic5430Dxe/
CirrusLogic5430I2c.c 150 UINTN Index;
154 for (Index = 0; Index < 8; Index --) {
155 I2cPinWrite (PciIo, I2CDAT_OUT, (UINT8) (Data >> (7 - Index)));
175 UINTN Index;
181 for (Index = 0; Index < 8; Index --) {
  /device/linaro/bootloader/edk2/OvmfPkg/AcpiPlatformDxe/
Xen.c 142 UINTN Index;
184 for (Index = 0; Index < NumberOfTableEntries; Index++) {
190 Index * sizeof (UINT64));
234 for (Index = 0; Index < NumberOfTableEntries; Index++) {
240 Index * sizeof (UINT32));
  /device/linaro/bootloader/edk2/ShellPkg/Library/UefiShellDebug1CommandsLib/SmbiosView/
SmbiosView.c 256 UINTN Index;
314 for (Index = 0; Index < SMBiosTable->NumberOfSmbiosStructures; Index++) {
346 ShellPrintHiiEx(-1,-1,NULL,STRING_TOKEN (STR_SMBIOSVIEW_SMBIOSVIEW_INDEX_LENGTH), gShellDebug1HiiHandle, Index, Length);
430 UINTN Index;
487 for (Index = 0; Index < mNumberOfSmbios64BitStructures; Index++) {
519 ShellPrintHiiEx(-1,-1,NULL,STRING_TOKEN (STR_SMBIOSVIEW_SMBIOSVIEW_INDEX_LENGTH), gShellDebug1HiiHandle, Index, Length);
    [all...]
  /external/eigen/Eigen/src/Eigenvalues/
HessenbergDecomposition.h 74 typedef Eigen::Index Index; ///< \deprecated since Eigen 3.3
100 explicit HessenbergDecomposition(Index size = Size==Dynamic ? 2 : Size)
297 Index n = matA.rows();
299 for (Index i = 0; i<n-1; ++i)
302 Index remainingSize = n-i-1;
358 Index n = result.rows();
363 Index rows() const { return m_hess.packedMatrix().rows(); }
364 Index cols() const { return m_hess.packedMatrix().cols(); }
  /external/llvm/lib/IR/
Attributes.cpp 648 uint64_t AttributeSetImpl::Raw(unsigned Index) const {
650 if (getSlotIndex(I) != Index) continue;
734 unsigned Index = I->first;
736 while (I != E && I->first == Index) {
741 AttrPairVec.push_back(std::make_pair(Index,
758 AttributeSet AttributeSet::get(LLVMContext &C, unsigned Index,
794 Attrs.push_back(std::make_pair(Index, Attr));
800 std::make_pair(Index, Attribute::get(C, TDA.first, TDA.second)));
805 AttributeSet AttributeSet::get(LLVMContext &C, unsigned Index,
809 Attrs.push_back(std::make_pair(Index, Attribute::get(C, K)))
    [all...]
  /prebuilts/clang/host/darwin-x86/clang-3957855/prebuilt_include/llvm/include/llvm/ADT/
PriorityWorklist.h 50 /// index into the vector.
100 auto &Index = InsertResult.first->second;
101 assert(V[Index] == X && "Value not actually at index in map!");
102 if (Index != (ptrdiff_t)(V.size() - 1)) {
104 V[Index] = T();
105 Index = (ptrdiff_t)V.size();
123 // Now walk backwards fixing up the index map and deleting any duplicates.
129 // If the existing index is before this insert's start, nuke that one and
131 ptrdiff_t &Index = InsertResult.first->second
    [all...]
  /prebuilts/clang/host/darwin-x86/clang-3960126/prebuilt_include/llvm/include/llvm/ADT/
PriorityWorklist.h 50 /// index into the vector.
100 auto &Index = InsertResult.first->second;
101 assert(V[Index] == X && "Value not actually at index in map!");
102 if (Index != (ptrdiff_t)(V.size() - 1)) {
104 V[Index] = T();
105 Index = (ptrdiff_t)V.size();
123 // Now walk backwards fixing up the index map and deleting any duplicates.
129 // If the existing index is before this insert's start, nuke that one and
131 ptrdiff_t &Index = InsertResult.first->second
    [all...]
  /prebuilts/clang/host/darwin-x86/clang-3977809/prebuilt_include/llvm/include/llvm/ADT/
PriorityWorklist.h 50 /// index into the vector.
100 auto &Index = InsertResult.first->second;
101 assert(V[Index] == X && "Value not actually at index in map!");
102 if (Index != (ptrdiff_t)(V.size() - 1)) {
104 V[Index] = T();
105 Index = (ptrdiff_t)V.size();
123 // Now walk backwards fixing up the index map and deleting any duplicates.
129 // If the existing index is before this insert's start, nuke that one and
131 ptrdiff_t &Index = InsertResult.first->second
    [all...]
  /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/llvm/include/llvm/ADT/
PriorityWorklist.h 50 /// index into the vector.
100 auto &Index = InsertResult.first->second;
101 assert(V[Index] == X && "Value not actually at index in map!");
102 if (Index != (ptrdiff_t)(V.size() - 1)) {
104 V[Index] = T();
105 Index = (ptrdiff_t)V.size();
123 // Now walk backwards fixing up the index map and deleting any duplicates.
129 // If the existing index is before this insert's start, nuke that one and
131 ptrdiff_t &Index = InsertResult.first->second
    [all...]
  /prebuilts/clang/host/linux-x86/clang-3957855/prebuilt_include/llvm/include/llvm/ADT/
PriorityWorklist.h 50 /// index into the vector.
100 auto &Index = InsertResult.first->second;
101 assert(V[Index] == X && "Value not actually at index in map!");
102 if (Index != (ptrdiff_t)(V.size() - 1)) {
104 V[Index] = T();
105 Index = (ptrdiff_t)V.size();
123 // Now walk backwards fixing up the index map and deleting any duplicates.
129 // If the existing index is before this insert's start, nuke that one and
131 ptrdiff_t &Index = InsertResult.first->second
    [all...]
  /prebuilts/clang/host/linux-x86/clang-3960126/prebuilt_include/llvm/include/llvm/ADT/
PriorityWorklist.h 50 /// index into the vector.
100 auto &Index = InsertResult.first->second;
101 assert(V[Index] == X && "Value not actually at index in map!");
102 if (Index != (ptrdiff_t)(V.size() - 1)) {
104 V[Index] = T();
105 Index = (ptrdiff_t)V.size();
123 // Now walk backwards fixing up the index map and deleting any duplicates.
129 // If the existing index is before this insert's start, nuke that one and
131 ptrdiff_t &Index = InsertResult.first->second
    [all...]
  /prebuilts/clang/host/linux-x86/clang-3977809/prebuilt_include/llvm/include/llvm/ADT/
PriorityWorklist.h 50 /// index into the vector.
100 auto &Index = InsertResult.first->second;
101 assert(V[Index] == X && "Value not actually at index in map!");
102 if (Index != (ptrdiff_t)(V.size() - 1)) {
104 V[Index] = T();
105 Index = (ptrdiff_t)V.size();
123 // Now walk backwards fixing up the index map and deleting any duplicates.
129 // If the existing index is before this insert's start, nuke that one and
131 ptrdiff_t &Index = InsertResult.first->second
    [all...]
  /prebuilts/clang/host/linux-x86/clang-4053586/prebuilt_include/llvm/include/llvm/ADT/
PriorityWorklist.h 50 /// index into the vector.
100 auto &Index = InsertResult.first->second;
101 assert(V[Index] == X && "Value not actually at index in map!");
102 if (Index != (ptrdiff_t)(V.size() - 1)) {
104 V[Index] = T();
105 Index = (ptrdiff_t)V.size();
123 // Now walk backwards fixing up the index map and deleting any duplicates.
129 // If the existing index is before this insert's start, nuke that one and
131 ptrdiff_t &Index = InsertResult.first->second
    [all...]

Completed in 2221 milliseconds

<<21222324252627282930>>