Searched refs:first (Results 201 - 225 of 1603) sorted by relevance

1234567891011>>

/freebsd-11.0-release/contrib/llvm/tools/clang/lib/Serialization/
H A DMultiOnDiskHashTable.h71 /// it is the first table.
98 // If we already have a merged table, it's the first one.
145 const internal_key_type &Key = InfoObj.ReadKey(LocalPtr, L.first);
147 InfoObj.ReadDataInto(Key, LocalPtr + L.first, L.second,
205 Table NewTable = new OnDiskTable(File, NumBucketsAndEntries.first,
265 const internal_key_type &Key = InfoObj.ReadKey(LocalPtr, L.first);
266 InfoObj.ReadDataInto(Key, LocalPtr + L.first, L.second, ResultBuilder);
310 if (!Gen.contains(KV.first, Info))
311 Gen.insert(KV.first, Info.ImportData(KV.second), Info);
321 // Replace the first fou
[all...]
/freebsd-11.0-release/contrib/gcc/
H A Dcollect2.c156 struct id *first;
831 set first, in case a diagnostic is issued. */
1054 /* After the first file, put in the c++ rt0. */
1230 dump_list (stderr, "\t", libs.first);
1234 nothing else in the file is referenced, so look at them first. */
1242 struct id *list = libs.first;
1248 if (exports.first)
1258 write_aix_file (exportf, exports.first);
1429 if (! exports.first)
1441 write_aix_file (exportf, exports.first);
154 struct id *first; member in struct:head
[all...]
H A Dweb.c90 unionfind_union (struct web_entry *first, struct web_entry *second) argument
92 first = unionfind_root (first);
94 if (first == second)
96 second->pred = first;
199 /* We are seeing this web for the first time, do the assignment. */
/freebsd-11.0-release/contrib/apr-util/dbm/
H A Dapr_dbm_berkeleydb.c308 DBT first = { 0 }; local
313 dberr = (*f->bdb->seq)(f->bdb, &first, &data, R_FIRST);
320 dberr = (*f->curs->c_get)(f->curs, &first, &data, DB_FIRST);
322 memset(&first, 0, sizeof(first));
330 pkey->dptr = first.data;
331 pkey->dsize = first.size;
/freebsd-11.0-release/sys/arm/arm/
H A Dmpcore_timer.c167 * @first: the number of seconds and fractional sections to trigger in
171 * NULL and first will point to the time to trigger. If in periodic mode
172 * period will contain the time period and first may optionally contain
173 * the time for the first period.
179 arm_tmr_start(struct eventtimer *et, sbintime_t first, sbintime_t period) argument
197 if (first != 0)
198 count = (uint32_t)((et->et_frequency * first) >> 32);
503 uint32_t first, last; local
531 first = tmr_gbl_read_4(sc, GBL_TIMER_COUNT_LOW);
535 counts -= (int32_t)(last - first);
[all...]
/freebsd-11.0-release/contrib/llvm/include/llvm/ADT/
H A Dilist.h165 ilist_iterator<NodeTy> /*first*/,
357 /// of the first node in the list always points to the last node in the list,
367 // back to the first node in the list (to preserve assertions about going off
539 // [first, last) into position.
541 void transfer(iterator position, iplist &L2, iterator first, iterator last) { argument
542 assert(first != last && "Should be checked by callers");
545 assert(position != first &&
549 // Note: we have to be careful about the case when we move the first node
556 // Remove [first, last) from its old position.
557 NodeTy *First = &*first, *Pre
599 erase(iterator first, iterator last) argument
620 insert(iterator where, InIt first, InIt last) argument
629 splice(iterator where, iplist &L2, iterator first) argument
634 splice(iterator where, iplist &L2, iterator first, iterator last) argument
732 ilist(InIt first, InIt last) argument
[all...]
/freebsd-11.0-release/contrib/libreadline/
H A Dhistexpand.c82 /* During tokenization, if this character is seen as the first character
686 /* :s/this/that substitutes `that' for the first
772 /* Find the first occurrence of THIS in TEMP. */
780 In the first case, we substitute for the first occurrence only.
783 first occurrence of each word. */
1243 int first, last; local
1248 first = last = 0;
1259 /* Handle special cases first. */
1286 first
[all...]
/freebsd-11.0-release/contrib/llvm/include/llvm/MC/
H A DMCStreamer.h280 return SectionStack.back().first;
283 MCSection *getCurrentSectionOnly() const { return getCurrentSection().first; }
319 MCSectionSubPair OldSection = I->first;
321 MCSectionSubPair NewSection = I->first;
324 ChangeSection(NewSection.first, NewSection.second);
333 SwitchSection(SectionStack.back().first.first, Subsection);
350 MCSectionSubPair curSection = SectionStack.back().first;
353 SectionStack.back().first = MCSectionSubPair(Section, Subsection);
/freebsd-11.0-release/contrib/llvm/lib/Analysis/
H A DCallGraphSCCPass.cpp209 if (!I->first ||
213 CallSites.count(I->first) ||
219 !CallSite(I->first) ||
220 (CallSite(I->first).getCalledFunction() &&
221 CallSite(I->first).getCalledFunction()->isIntrinsic() &&
223 CallSite(I->first).getCalledFunction()->getIntrinsicID()))) {
247 assert(!CallSites.count(I->first) &&
250 CallSite CS(I->first);
255 CallSites.insert(std::make_pair(I->first, I->second));
H A DCallGraph.cpp190 OS << " CS<" << I->first << "> calls ";
208 if (I->first == CS.getInstruction()) {
236 if (CR.second == Callee && CR.first == nullptr) {
252 if (I->first == CS.getInstruction()) {
254 I->first = NewCS.getInstruction();
/freebsd-11.0-release/contrib/llvm/tools/lldb/source/Target/
H A DSectionLoadList.cpp242 if (load_addr != pos->first && pos != m_addr_to_sect.begin())
244 const addr_t pos_load_addr = pos->first;
261 if (load_addr >= rpos->first)
263 addr_t offset = load_addr - rpos->first;
285 pos->first, static_cast<void*>(pos->second.get()));
/freebsd-11.0-release/contrib/tcpdump/
H A Dprint-bootp.c356 ND_TCHECK2(bp->bp_sname[0], 1); /* check first char only */
366 ND_TCHECK2(bp->bp_file[0], 1); /* check first char only */
399 * The first character specifies the format to print:
598 int first, idx; local
676 first = 1;
682 if (!first)
685 first = 0;
700 first = 1;
720 if (!first)
732 first
[all...]
/freebsd-11.0-release/contrib/llvm/include/llvm/ProfileData/
H A DSampleProf.h51 // Prefer first error encountered as later errors may be secondary effects of
174 MergeResult(Result, addCalledTarget(I.first(), I.second, Weight));
282 const LineLocation &Loc = I.first;
287 const CallsiteLocation &Loc = I.first;
348 return A->first < B->first;
/freebsd-11.0-release/contrib/llvm/lib/CodeGen/AsmPrinter/
H A DDbgValueHistoryCalculator.cpp32 // indirecltly), this register is always a first operand.
43 Ranges.back().first->isIdenticalTo(&MI)) {
45 << "\t" << Ranges.back().first << "\t" << MI << "\n");
58 assert(Ranges.back().first->getParent() == MI.getParent());
69 return isDescribedByReg(*Ranges.back().first);
145 // \brief Returns the first instruction in @MBB which corresponds to
227 if (ChangingRegs.test(CurElem->first))
/freebsd-11.0-release/contrib/libstdc++/include/ext/pb_ds/detail/rb_tree_map_/
H A Drb_tree_.hpp103 #define PB_DS_V2F(X) (X).first
111 #define PB_DS_EP2VP(X)& ((X)->m_value.first)
182 ins_pair.first.m_p_nd->m_red = true;
184 insert_fixup(ins_pair.first.m_p_nd);
187 return ins_pair.first.m_p_nd->m_value.second;
/freebsd-11.0-release/contrib/libstdc++/include/ext/pb_ds/detail/splay_tree_/
H A Dsplay_tree_.hpp127 #define PB_DS_V2F(X) (X).first
135 #define PB_DS_EP2VP(X)& ((X)->m_value.first)
204 ins_pair.first.m_p_nd->m_special = false;
206 splay(ins_pair.first.m_p_nd);
208 return ins_pair.first.m_p_nd->m_value.second;
/freebsd-11.0-release/contrib/llvm/lib/Target/Hexagon/
H A DRDFCopy.cpp50 if (!RRs.count(R.first))
59 if (!RRs.count(R.first))
61 auto F = DefM.find(R.first);
104 dbgs() << Print<RegisterRef>(R.first, DFG) << " -> {";
106 dbgs() << ' ' << Print<NodeId>(M.first, DFG) << ':'
/freebsd-11.0-release/contrib/compiler-rt/lib/sanitizer_common/
H A Dsanitizer_symbolizer_libbacktrace.cc89 SymbolizedStack *first; member in struct:__sanitizer::__anon912::SymbolizeCodeCallbackArg
98 info->FillModuleInfo(first->info.module, first->info.module_offset);
102 CHECK_EQ(addr, first->info.address);
160 data.first = stack;
/freebsd-11.0-release/usr.sbin/pkg/
H A Ddns_utils.c82 compute_weight(struct dns_srvinfo **d, int first, int last) argument
95 chosen = malloc(sizeof(int) * (last - first + 1));
117 struct dns_srvinfo **res, *first; local
218 first = res[0];
221 return (first);
/freebsd-11.0-release/contrib/llvm/tools/clang/lib/AST/
H A DDeclPrinter.cpp1230 bool first = true; local
1234 Out << (first ? ' ' : ',') << "readonly";
1235 first = false;
1239 Out << (first ? ' ' : ',') << "getter = ";
1241 first = false;
1244 Out << (first ? ' ' : ',') << "setter = ";
1246 first = false;
1250 Out << (first ? ' ' : ',') << "assign";
1251 first = false;
1256 Out << (first
[all...]
/freebsd-11.0-release/crypto/openssl/util/
H A Dsu-filter.pl182 my $first = 1;
212 if($first) {
213 $first = 0;
/freebsd-11.0-release/contrib/llvm/tools/clang/lib/Edit/
H A DEditedSource.cpp30 SourceLocation DefArgLoc = SourceMgr.getImmediateExpansionRange(Loc).first;
31 ExpansionLoc = SourceMgr.getImmediateExpansionRange(DefArgLoc).first;
64 if (FA->first != Offs)
84 // A commit modified the macro argument 'a' due to the first '(x)'
141 FileOffset B = I->first;
156 for (; I != FileEdits.end() && EndOffs > I->first; ++I) {
158 FileOffset B = I->first;
195 FileOffset B = I->first;
213 FileOffset B = I->first;
238 FileOffset B = I->first;
[all...]
/freebsd-11.0-release/contrib/llvm/tools/clang/lib/Frontend/
H A DDiagnosticRenderer.cpp48 Loc = SM.getImmediateExpansionRange(Loc).first;
58 Loc = SM.getSpellingLoc(SM.getImmediateExpansionRange(Loc).first);
64 StringRef ExpansionBuffer = SM.getBufferData(ExpansionInfo.first);
250 emitImportStackRecursively(Imported.first, Imported.second, SM);
254 // Emit the other include frames first.
271 emitImportStackRecursively(NextImportLoc.first, NextImportLoc.second, SM);
285 // Emit the other import frames first.
288 emitImportStackRecursively(NextImportLoc.first, NextImportLoc.second, SM);
304 Stack[I].first,
330 MacroArgLocation = IsBegin ? SM->getImmediateExpansionRange(Loc).first
[all...]
/freebsd-11.0-release/contrib/llvm/include/llvm/Support/
H A DOnDiskHashTable.h175 InfoObj.EmitKey(Out, I->Key, Len.first);
181 InfoObj.EmitKey(Out, I->Key, Len.first);
185 assert(offset_type(DataStart - KeyStart) == Len.first &&
362 offset_type ItemLen = L.first + L.second;
372 InfoPtr->ReadKey((const unsigned char *const)Items, L.first);
381 return iterator(X, Items + L.first, L.second, InfoPtr);
405 return new OnDiskChainedHashTable<Info>(NumBucketsAndEntries.first,
461 Ptr += L.first + L.second;
513 return InfoObj->ReadKey(LocalPtr, L.first);
559 const internal_key_type &Key = InfoObj->ReadKey(LocalPtr, L.first);
[all...]
/freebsd-11.0-release/contrib/llvm/lib/LibDriver/
H A DLibDriver.cpp71 // Add current directory as first item of the search path.
147 if (Result.first.empty())
148 Result.first = ArgsArr[0];
149 llvm::errs() << Result.first << ": " << Result.second.message() << "\n";

Completed in 333 milliseconds

1234567891011>>