| /openbsd/src/regress/lib/libc/cephes/ |
| D | ieee.c | 397 for( i=3; i<NI; i++ ) 402 for( i=2; i<NI; i++ ) 466 for( i=0; i<NI; i++ ) 478 for(i=0; i<NI-1; i++) 492 for( i=0; i<NI-1; i++ ) 508 for( i=M+1; i<NI; i++ ) 554 for( i=M; i<NI; i++ ) 582 for( i=M; i<NI; i++ ) 606 x += NI-1; 609 for( i=M; i<NI; i++ ) [all …]
|
| D | etodec.c | 32 unsigned short y[NI]; 74 static unsigned short decbit[NI] = {0,0,0,0,0,0,0200,0}; 78 unsigned short xi[NI]; 97 for( j=M+5; j<NI; j++ ) 148 unsigned short xi[NI];
|
| D | ehead.h | 26 #define NI (NE+3) macro 35 #define NBITS ((NI-4)*16)
|
| /openbsd/src/gnu/llvm/llvm/lib/DebugInfo/DWARF/ |
| D | DWARFVerifier.cpp | 1085 for (const DWARFDebugNames::NameIndex &NI : AccelTable) { in verifyDebugNamesCULists() local 1086 if (NI.getCUCount() == 0) { in verifyDebugNamesCULists() 1088 NI.getUnitOffset()); in verifyDebugNamesCULists() 1092 for (uint32_t CU = 0, End = NI.getCUCount(); CU < End; ++CU) { in verifyDebugNamesCULists() 1093 uint64_t Offset = NI.getCUOffset(CU); in verifyDebugNamesCULists() 1099 NI.getUnitOffset(), Offset); in verifyDebugNamesCULists() 1107 NI.getUnitOffset(), Offset, Iter->second); in verifyDebugNamesCULists() 1110 Iter->second = NI.getUnitOffset(); in verifyDebugNamesCULists() 1123 DWARFVerifier::verifyNameIndexBuckets(const DWARFDebugNames::NameIndex &NI, in verifyNameIndexBuckets() argument 1135 if (NI.getBucketCount() == 0) { in verifyNameIndexBuckets() [all …]
|
| D | DWARFAcceleratorTable.cpp | 793 for (const NameIndex &NI : NameIndices) in dump() local 794 NI.dump(W); in dump() 883 const DWARFDebugNames::NameIndex &NI, StringRef Key) in ValueIterator() argument 884 : CurrentIndex(&NI), IsLocal(true), Key(std::string(Key)) { in ValueIterator() 899 for (const auto &NI : *this) { in getCUNameIndex() 900 for (uint32_t CU = 0; CU < NI.getCUCount(); ++CU) in getCUNameIndex() 901 CUToNameIndex.try_emplace(NI.getCUOffset(CU), &NI); in getCUNameIndex()
|
| /openbsd/src/gnu/llvm/llvm/lib/IR/ |
| D | ReplaceConstant.cpp | 60 Instruction *NI = nullptr; in convertConstantExprsToInstructions() local 66 NI = CE->getAsInstruction(BI); in convertConstantExprsToInstructions() 69 Visited[CE] = NI; in convertConstantExprsToInstructions() 73 Insts->insert(NI); in convertConstantExprsToInstructions() 77 NI = Visited[CE]; in convertConstantExprsToInstructions() 80 assert(NI && "Expected an instruction corresponding to constant " in convertConstantExprsToInstructions() 85 II->replaceUsesOfWith(CE, NI); in convertConstantExprsToInstructions() 86 BI = II = NI; in convertConstantExprsToInstructions()
|
| /openbsd/src/gnu/llvm/llvm/include/llvm/DebugInfo/DWARF/ |
| D | DWARFVerifier.h | 254 unsigned verifyNameIndexBuckets(const DWARFDebugNames::NameIndex &NI, 256 unsigned verifyNameIndexAbbrevs(const DWARFDebugNames::NameIndex &NI); 257 unsigned verifyNameIndexAttribute(const DWARFDebugNames::NameIndex &NI, 260 unsigned verifyNameIndexEntries(const DWARFDebugNames::NameIndex &NI, 263 const DWARFDebugNames::NameIndex &NI);
|
| /openbsd/src/gnu/llvm/llvm/include/llvm/MC/ |
| D | MCInstrInfo.h | 48 void InitMCInstrInfo(const MCInstrDesc *D, const unsigned *NI, const char *ND, in InitMCInstrInfo() argument 52 InstrNameIndices = NI; in InitMCInstrInfo()
|
| /openbsd/src/gnu/llvm/llvm/include/llvm/Analysis/ |
| D | DominanceFrontierImpl.h | 194 for (typename DomTreeNodeT::const_iterator NI = currentNode->begin(), in calculate() local 196 NI != NE; ++NI) { in calculate() 197 DomTreeNodeT *IDominee = *NI; in calculate()
|
| /openbsd/src/gnu/llvm/clang/lib/AST/ |
| D | AttrImpl.cpp | 105 alignments_iterator NI = alignments_begin(); in printPrettyPragma() local 109 if (*NI) { in printPrettyPragma() 111 (*NI)->printPretty(OS, nullptr, Policy); in printPrettyPragma() 114 ++NI; in printPrettyPragma()
|
| /openbsd/src/gnu/llvm/clang/lib/Analysis/ |
| D | ThreadSafetyTIL.cpp | 296 unsigned NI = I - NumUnreachableBlocks; in computeNormalForm() local 297 Blocks[NI] = Blocks[I]; in computeNormalForm() 298 Blocks[NI]->BlockID = NI; in computeNormalForm()
|
| /openbsd/src/gnu/llvm/llvm/lib/CodeGen/SelectionDAG/ |
| D | ScheduleDAGSDNodes.cpp | 315 for (SDNode &NI : DAG->allnodes()) { in ClusterNodes() 316 SDNode *Node = &NI; in ClusterNodes() 333 for (SDNode &NI : DAG->allnodes()) { in BuildSchedUnits() 334 NI.setNodeId(-1); in BuildSchedUnits() 353 SDNode *NI = Worklist.pop_back_val(); in BuildSchedUnits() local 356 for (const SDValue &Op : NI->op_values()) in BuildSchedUnits() 360 if (isPassiveNode(NI)) // Leaf node, e.g. a TargetImmediate. in BuildSchedUnits() 364 if (NI->getNodeId() != -1) continue; in BuildSchedUnits() 366 SUnit *NodeSUnit = newSUnit(NI); in BuildSchedUnits() 373 SDNode *N = NI; in BuildSchedUnits() [all …]
|
| D | SelectionDAGPrinter.cpp | 63 SDNodeIterator NI = SDNodeIterator::begin(TargetNode); in getEdgeTarget() local 64 std::advance(NI, I.getNode()->getOperand(I.getOperand()).getResNo()); in getEdgeTarget() 65 return NI; in getEdgeTarget()
|
| /openbsd/src/gnu/llvm/llvm/lib/CodeGen/ |
| D | ModuloSchedule.cpp | 1602 for (auto I = BB->begin(), NI = NewBB->begin(); !I->isTerminator(); in peelKernel() local 1603 ++I, ++NI) { in peelKernel() 1605 CanonicalMIs[&*NI] = &*I; in peelKernel() 1606 BlockMIs[{NewBB, &*I}] = &*NI; in peelKernel() 1656 MachineInstr *NI = BuildMI(*DestBB, DestBB->getFirstNonPHI(), in moveStageBetweenBlocks() local 1660 BlockMIs[{DestBB, CanonicalMIs[&MI]}] = NI; in moveStageBetweenBlocks() 1661 CanonicalMIs[NI] = CanonicalMIs[&MI]; in moveStageBetweenBlocks() 1881 MachineInstr *NI = BuildMI(NewBB, DebugLoc(), TII->get(TargetOpcode::PHI), R) in CreateLCSSAExitingBlock() local 1884 BlockMIs[{NewBB, &MI}] = NI; in CreateLCSSAExitingBlock() 1885 CanonicalMIs[NI] = &MI; in CreateLCSSAExitingBlock() [all …]
|
| /openbsd/src/gnu/llvm/llvm/lib/Target/WebAssembly/ |
| D | WebAssemblyInstrFormats.td | 33 class NI<dag oops, dag iops, list<dag> pattern, bit stack, 59 def "" : NI<oops_r, iops_r, pattern_r, false, asmstr_r, inst, is64>; 61 def _S : NI<oops_s, iops_s, [], true, asmstr_s, inst, is64>;
|
| D | WebAssemblyInstrMemory.td | 79 (!cast<NI>(Name # "_A32") 0, 85 (!cast<NI>(Name # "_A64") 0, 144 (!cast<NI>(Name # "_A32") 0, 150 (!cast<NI>(Name # "_A64") 0,
|
| D | WebAssemblyInstrTable.td | 56 (!cast<NI>("TABLE_GET_" # rc) tglobaladdr:$table, i32:$idx)>; 61 (!cast<NI>("TABLE_SET_" # rc) tglobaladdr:$table, i32:$idx, vt:$src)>;
|
| D | WebAssemblyInstrAtomics.td | 93 (!cast<NI>(inst#_A32) 0, $offset, $addr, $exp, $timeout)>, 97 (!cast<NI>(inst#_A64) 0, $offset, $addr, $exp, $timeout)>, 202 (!cast<NI>(inst#_A32) 0, $offset, $addr, $val)>, 205 (!cast<NI>(inst#_A64) 0, $offset, $addr, $val)>, 339 (!cast<NI>(inst#_A32) 0, $offset, $addr, $val)>, 342 (!cast<NI>(inst#_A64) 0, $offset, $addr, $val)>, 480 (!cast<NI>(inst#_A32) 0, $offset, $addr, $exp, $new)>, 483 (!cast<NI>(inst#_A64) 0, $offset, $addr, $exp, $new)>,
|
| /openbsd/src/gnu/llvm/clang/utils/TableGen/ |
| D | ClangSyntaxEmitter.cpp | 69 auto NI = ByName.find(Name); in get() local 70 assert(NI != ByName.end() && "no such node"); in get() 71 return *NI->second; in get()
|
| /openbsd/src/gnu/llvm/llvm/lib/DebugInfo/PDB/Native/ |
| D | DbiModuleDescriptorBuilder.cpp | 61 void DbiModuleDescriptorBuilder::setPdbFilePathNI(uint32_t NI) { in setPdbFilePathNI() argument 62 PdbFilePathNI = NI; in setPdbFilePathNI()
|
| /openbsd/src/gnu/llvm/llvm/utils/TableGen/ |
| D | DAGISelMatcherGen.cpp | 212 const SDNodeInfo &NI = CGP.getSDNodeInfo(CGP.getSDNodeNamed("imm")); in EmitLeafMatchCode() local 213 AddMatcher(new CheckOpcodeMatcher(NI)); in EmitLeafMatchCode() 288 const SDNodeInfo &NI = CGP.getSDNodeInfo(CGP.getSDNodeNamed(Name)); in EmitLeafMatchCode() local 289 AddMatcher(new CheckOpcodeMatcher(NI)); in EmitLeafMatchCode() 300 const SDNodeInfo &NI = CGP.getSDNodeInfo(CGP.getSDNodeNamed(Name)); in EmitLeafMatchCode() local 301 AddMatcher(new CheckOpcodeMatcher(NI)); in EmitLeafMatchCode()
|
| /openbsd/src/gnu/llvm/llvm/lib/Transforms/Scalar/ |
| D | Reassociate.cpp | 2200 Instruction *NI = ConvertShiftToMul(I); in OptimizeInst() local 2203 I = NI; in OptimizeInst() 2237 Instruction *NI = convertOrWithNoCommonBitsToAdd(I); in OptimizeInst() local 2240 I = NI; in OptimizeInst() 2247 Instruction *NI = BreakUpSubtract(I, RedoInsts); in OptimizeInst() local 2250 I = NI; in OptimizeInst() 2257 Instruction *NI = LowerNegateToMultiply(I); in OptimizeInst() local 2260 for (User *U : NI->users()) { in OptimizeInst() 2266 I = NI; in OptimizeInst() 2272 Instruction *NI = BreakUpSubtract(I, RedoInsts); in OptimizeInst() local [all …]
|
| /openbsd/src/regress/lib/libcrypto/x509/bettertls/certificates/ |
| D | 1137.key | 5 /C2yu26KkTWiM/VmjPiPyQGjJoDfbAJnwoGqw7sNvotnFJnvqY/KR5eR4rT8+NI+
|
| D | 3131.key | 18 y2DJ3VkyxoiPQycQkdPoweJ6ghlratppXUWT2Yv1AoGAdJEP+y78bBgOSsgYA+NI
|
| D | 762.key | 25 E2r7Y8/I9N2I3GNvmswh4owokd6+yMWjI3Y+5z11hHjURtVT2DazNf79int8A+NI
|