Searched refs:first (Results 101 - 125 of 1330) sorted by relevance

1234567891011>>

/freebsd-10.0-release/usr.sbin/makefs/
H A Dwalk.c75 fsnode *first, *cur, *prev, *last; local
95 first = cur = join;
100 first = prev = NULL;
165 cur->next = first;
166 first = cur;
169 cur->first = first;
174 if (!first)
175 first = cur;
176 cur->first
[all...]
/freebsd-10.0-release/contrib/llvm/lib/CodeGen/
H A DLiveRangeCalc.cpp40 assert(MRI && Indexes && "call reset() first");
64 assert(MRI && Indexes && "call reset() first");
211 if (VNInfo *VNI = LiveOut[Pred].first) {
315 if (IDomValue.first && !IDomValue.second)
317 DomTree->getNode(Indexes->getMBBFromIndex(IDomValue.first->def));
322 if (!Value.first || Value.first == IDomValue.first)
328 DomTree->getNode(Indexes->getMBBFromIndex(Value.first->def));
363 } else if (IDomValue.first) {
[all...]
/freebsd-10.0-release/contrib/llvm/tools/clang/lib/CodeGen/
H A DCGExprComplex.cpp327 Builder.CreateStore(Val.first, RealPtr, lvalue.isVolatileQualified());
375 Val.first = CGF.EmitScalarConversion(Val.first, SrcType, DestType);
474 if (Op.first->getType()->isFloatingPointTy()) {
475 ResR = Builder.CreateFNeg(Op.first, "neg.r");
478 ResR = Builder.CreateNeg(Op.first, "neg.r");
495 return ComplexPairTy(Op.first, ResI);
501 if (Op.LHS.first->getType()->isFloatingPointTy()) {
502 ResR = Builder.CreateFAdd(Op.LHS.first, Op.RHS.first, "ad
[all...]
/freebsd-10.0-release/contrib/llvm/include/llvm/ADT/
H A Dilist.h118 ilist_iterator<NodeTy> /*first*/,
308 /// of the first node in the list always points to the last node in the list,
318 // back to the first node in the list (to preserve assertions about going off
482 // [first, last) into position.
484 void transfer(iterator position, iplist &L2, iterator first, iterator last) { argument
485 assert(first != last && "Should be checked by callers");
488 assert(position != first &&
492 // Note: we have to be careful about the case when we move the first node
499 // Remove [first, last) from its old position.
500 NodeTy *First = &*first, *Pre
542 erase(iterator first, iterator last) argument
563 insert(iterator where, InIt first, InIt last) argument
572 splice(iterator where, iplist &L2, iterator first) argument
577 splice(iterator where, iplist &L2, iterator first, iterator last) argument
652 ilist(InIt first, InIt last) argument
[all...]
H A DMapVector.h80 unsigned &I = Result.first->second;
94 std::pair<KeyT, unsigned> Pair = std::make_pair(KV.first, 0);
96 unsigned &I = Result.first->second;
98 Vector.push_back(std::make_pair(KV.first, KV.second));
124 typename MapType::iterator Pos = Map.find(Vector.back().first);
/freebsd-10.0-release/contrib/dialog/samples/
H A Dtextbox11 the file first if it contains 'tab' characters.
H A Dtextbox211 the file first if it contains 'tab' characters.
/freebsd-10.0-release/contrib/libstdc++/include/ext/pb_ds/detail/cc_hash_table_map_/
H A Derase_store_hash_fn_imps.hpp54 entry_pointer p_e = m_entries[r_pos_hash_pair.first];
69 erase_entry_pointer(m_entries[r_pos_hash_pair.first]);
/freebsd-10.0-release/contrib/libstdc++/include/ext/pb_ds/detail/splay_tree_/
H A Dinsert_fn_imps.hpp54 ins_pair.first.m_p_nd->m_special = false;
56 splay(ins_pair.first.m_p_nd);
/freebsd-10.0-release/contrib/llvm/lib/Support/
H A DStringExtras.cpp19 /// StrInStrNoCase - Portable version of strcasestr. Locates the first
55 while (!S.first.empty()) {
56 OutFragments.push_back(S.first);
H A DIntervalMap.cpp21 path.front() = Entry(Root, Size, Offsets.first);
135 if (PosPair.first == Nodes && Sum > Position)
142 assert(PosPair.first < Nodes && "Bad algebra");
143 assert(NewSize[PosPair.first] && "Too few elements to need Grow");
144 --NewSize[PosPair.first];
H A DTargetRegistry.cpp140 return ((const pair_ty*)LHS)->first.compare(((const pair_ty*)RHS)->first);
150 Width = std::max(Width, Targets.back().first.size());
157 OS << " " << Targets[i].first;
158 OS.indent(Width - Targets[i].first.size()) << " - "
/freebsd-10.0-release/contrib/llvm/tools/clang/include/clang/Frontend/
H A DCommandLineSourceLoc.h37 ColSplit.first.rsplit(':');
42 PSL.FileName = LineSplit.first;
/freebsd-10.0-release/contrib/llvm/tools/clang/include/clang/Sema/
H A DTemplateDeduction.h68 PD.first = SuppressedDiagnostics.front().first;
87 // Only collect the first diagnostic.
125 /// TDK_Incomplete: this is the first template parameter whose
132 /// \brief The first template argument to which the template
138 /// TDK_Inconsistent: this argument is the first value deduced
/freebsd-10.0-release/contrib/llvm/tools/llvm-diff/
H A DDiffLog.cpp48 return (Diff[I].first ? (Diff[I].second ? DC_match : DC_left)
51 Instruction *DiffLogBuilder::getLeft(unsigned I) const { return Diff[I].first; }
/freebsd-10.0-release/contrib/mdocml/
H A Deqn_html.c71 if (bp->first)
72 eqn_box(p, bp->first);
H A Deqn_term.c64 if (bp->first)
65 eqn_box(p, bp->first);
/freebsd-10.0-release/contrib/ncurses/ncurses/trace/
H A Dvisbuf.c252 int first; local
264 first = 0;
265 while (first < len) {
266 attr_t attr = AttrOf(buf[first]);
270 for (j = first + 1; j < len; ++j) {
271 if (!SameAttrOf(buf[j], buf[first])) {
279 for (j = first; j <= last; ++j) {
320 first = last + 1;
/freebsd-10.0-release/contrib/top/
H A Dcommands.c209 register int first = Yes; local
243 first = Yes;
245 if ((stringlen = str_addarg(string, stringlen, errp->arg, first)) ==0)
249 first = No;
286 * str_addarg(str, len, arg, first) - add the string argument "arg" to
287 * the string "str". This is the first in the group when "first"
291 str_addarg(str, len, arg, first)
296 int first;
302 if (!first)
[all...]
/freebsd-10.0-release/sys/sys/
H A Dtimeet.h48 sbintime_t first, sbintime_t period);
96 int et_start(struct eventtimer *et, sbintime_t first, sbintime_t period);
/freebsd-10.0-release/usr.bin/protect/
H A Dprotect.c53 static bool first = true; local
57 if (!first) {
/freebsd-10.0-release/contrib/llvm/tools/clang/lib/Edit/
H A DEditedSource.cpp34 if (FA->first != Offs)
40 DefArgLoc = SourceMgr.getImmediateExpansionRange(OrigLoc).first;
42 ExpLoc = SourceMgr.getImmediateExpansionRange(DefArgLoc).first;
63 DefArgLoc = SourceMgr.getImmediateExpansionRange(OrigLoc).first;
65 ExpLoc = SourceMgr.getImmediateExpansionRange(DefArgLoc).first;
101 FileOffset B = I->first;
116 for (; I != FileEdits.end() && EndOffs > I->first; ++I) {
118 FileOffset B = I->first;
155 FileOffset B = I->first;
173 FileOffset B = I->first;
[all...]
/freebsd-10.0-release/contrib/llvm/tools/lli/
H A Dlli.cpp213 // Lay out our sections in order, with all the code sections first, then
222 DEBUG(dbgs() << "code region: size " << I->first.size()
229 Offsets.push_back(std::pair<const void*,uint64_t>(I->first.base(), CurOffset));
230 Sizes.push_back(I->first.size());
231 CurOffset += I->first.size();
239 DEBUG(dbgs() << "data region: size " << I->first.size()
246 Offsets.push_back(std::pair<const void*,uint64_t>(I->first.base(), CurOffset));
247 Sizes.push_back(I->first.size());
248 CurOffset += I->first.size();
259 EE->mapSectionAddress(const_cast<void*>(Offsets[i].first), Add
[all...]
/freebsd-10.0-release/sys/cddl/dev/dtrace/
H A Ddtrace_debug.c10 * the first lines of this file unmodified other than the possible
41 char *first; member in struct:dtrace_debug_data
75 if (d->first == NULL) {
76 d->first = d->bufr;
102 if (d->first < d->next) {
105 count = (uintptr_t) d->next - (uintptr_t) d->first;
107 for (p = d->first; p < d->next; p++)
109 } else if (d->next > d->first) {
112 count = (uintptr_t) d->last - (uintptr_t) d->first;
114 for (p = d->first;
[all...]
/freebsd-10.0-release/usr.sbin/IPXrouted/
H A Dtrace.c184 register int first; local
196 for (first = 1, p = flagbits; p->t_bits > 0; p++) {
200 if (first) {
202 first = 0;
207 for (first = 1, p = statebits; p->t_bits > 0; p++) {
211 if (first) {
213 first = 0;
244 register int first; local
257 for (first = 1, p = flagbits; p->t_bits > 0; p++) {
263 if (first) {
[all...]

Completed in 372 milliseconds

1234567891011>>