Searched refs:first (Results 226 - 250 of 1330) sorted by relevance

1234567891011>>

/freebsd-10.0-release/contrib/llvm/include/llvm/ADT/
H A DValueMap.h54 // All methods will be called with a first argument of type ExtraData. The
55 // default implementations in this class take a templated first argument so
135 Map.insert(std::make_pair(Wrap(KV.first), KV.second));
136 return std::make_pair(iterator(map_result.first), map_result.second);
292 const KeyT first; member in struct:llvm::ValueMapIterator::ValueTypeProxy
296 return std::make_pair(first, second);
301 ValueTypeProxy Result = {I->first.Unwrap(), I->second};
342 const KeyT first; member in struct:llvm::ValueMapConstIterator::ValueTypeProxy
346 return std::make_pair(first, second);
351 ValueTypeProxy Result = {I->first
[all...]
/freebsd-10.0-release/contrib/llvm/lib/Analysis/
H A DProfileDataLoader.cpp31 if (E.first)
32 O << E.first->getName();
H A DProfileInfo.cpp292 P[newedge.first] = 0;
293 P[newedge.second] = newedge.first;
302 double oldc = getExecutionCount(e.first);
304 if (Parent != oldedge.first) {
305 setExecutionCount(e.first, w+oldc);
308 } while (BB != newedge.first);
329 e = (I++)->first;
331 if (e.first == RmBB) {
340 if (e.first == DestBB) {
343 newedge = getEdge(e.first, DestB
[all...]
/freebsd-10.0-release/contrib/llvm/lib/CodeGen/
H A DMachineRegisterInfo.cpp43 VRegInfo[Reg].first = RC;
103 VRegInfo[Reg].first = RegClass;
170 // Head points to the first list element.
294 // Since we are in SSA form, we can use the first definition.
330 if (I->first == Reg || I->second == Reg)
340 return I->first;
348 if (I->first == PReg)
366 // records for unused arguments in the first place, but it's
374 .addReg(LiveIns[i].first);
377 EntryMBB->addLiveIn(LiveIns[i].first);
[all...]
/freebsd-10.0-release/contrib/llvm/lib/DebugInfo/
H A DDWARFDebugAbbrev.cpp86 OS << format("Abbrev table for offset: 0x%8.8" PRIx64 "\n", pos->first);
96 PrevAbbrOffsetPos->first == cu_abbr_offset) {
/freebsd-10.0-release/contrib/llvm/lib/MC/
H A DMCNullStreamer.cpp39 assert(getCurrentSection().first &&"Cannot emit before setting section!");
40 Symbol->setSection(*getCurrentSection().first);
/freebsd-10.0-release/contrib/llvm/lib/Support/Unix/
H A DHost.inc48 std::string Arch = ArchSplit.first;
/freebsd-10.0-release/contrib/llvm/lib/Transforms/Instrumentation/
H A DBlackList.cpp53 StringRef Prefix = SplitLine.first;
57 report_fatal_error("malformed blacklist line: " + SplitLine.first);
/freebsd-10.0-release/contrib/llvm/tools/clang/lib/Lex/
H A DPreprocessingRecord.cpp54 return std::make_pair(iterator(this, CachedRangeQuery.Result.first),
63 return std::make_pair(iterator(this, Res.first), iterator(this, Res.second));
138 return std::make_pair(Local.first, Local.second);
144 if (Loaded.first == Loaded.second)
145 return std::make_pair(Local.first, Local.second);
150 if (Local.first == Local.second)
151 return std::make_pair(int(Loaded.first)-TotalLoaded,
155 return std::make_pair(int(Loaded.first)-TotalLoaded, Local.second);
216 // whether we get the first macro expansion or its containing macro.
/freebsd-10.0-release/contrib/llvm/tools/lldb/source/Core/
H A DBroadcaster.cpp67 pos->first->BroadcasterWillDestruct (this);
128 if (pos->first == listener)
191 if (pos->first == listener)
270 if (unique && pos->first->PeekAtNextEventForBroadcasterWithType (this, event_type))
272 pos->first->AddEvent (event_sp);
381 available_bits &= ~((*iter).first.GetEventBits());
418 uint32_t iter_event_bits = (*iter).first.GetEventBits();
483 (*iter).second->StartListeningForEvents (&broadcaster, (*iter).first.GetEventBits());
/freebsd-10.0-release/contrib/llvm/tools/lldb/source/Plugins/SymbolFile/DWARF/
H A DDWARFDebugAbbrev.cpp177 s->Printf("Abbrev table for offset: 0x%8.8x\n", pos->first);
191 if (m_prev_abbr_offset_pos != end && m_prev_abbr_offset_pos->first == cu_abbr_offset)
/freebsd-10.0-release/contrib/llvm/tools/lli/
H A DRecordingMemoryManager.cpp22 sys::Memory::releaseMappedMemory(I->first);
26 sys::Memory::releaseMappedMemory(I->first);
/freebsd-10.0-release/contrib/wpa/src/radius/
H A Dradius_client.c19 * RADIUS_CLIENT_FIRST_WAIT - RADIUS client timeout for first retry in seconds
103 * first_try - Time of the first transmission attempt
378 os_time_t first; local
388 first = 0;
414 if (first == 0 || entry->next_try < first)
415 first = entry->next_try;
422 if (first < now.sec)
423 first = now.sec;
424 eloop_register_timeout(first
486 os_time_t first; local
[all...]
/freebsd-10.0-release/crypto/heimdal/lib/wind/
H A Dpunycode.c55 adapt(unsigned delta, unsigned numpoints, int first) argument
59 if (first)
/freebsd-10.0-release/sys/kern/
H A Dsubr_unit.c34 * Allocation policy is always lowest free number first.
205 y = uh->first;
316 uh->first = 0;
405 * If the first element is not a bitmap, make it one.
532 /* Merge into ->first if possible */
535 uh->first += upp->len;
570 x = uh->low + uh->first;
575 * If we have an ideal split, just adjust the first+last
578 uh->first++;
585 * We can always allocate from the first lis
[all...]
/freebsd-10.0-release/sys/netgraph/netflow/
H A Dnetflow.h71 uint32_t flow_seq; /* Sequence number of the first record */
96 uint32_t first; /* System uptime at start of a flow */ member in struct:netflow_v1_record
118 uint32_t first; /* System uptime at start of a flow */ member in struct:netflow_v5_record
169 #define NETFLOW_V9_FIELD_FIRST_SWITCHED 22 /* sysUptime in msec at which the first packet of this Flow was switched. 4 */
/freebsd-10.0-release/usr.sbin/mptutil/
H A Dmpt_evt.c82 event_compare(const void *first, const void *second) argument
87 one = first;
/freebsd-10.0-release/contrib/llvm/include/llvm/CodeGen/
H A DSlotIndexes.h182 /// Compare two SlotIndex objects. Return true if the first index
187 /// Compare two SlotIndex objects. Return true if the first index
193 /// Compare two SlotIndex objects. Return true if the first index
199 /// Compare two SlotIndex objects. Return true if the first index
261 /// index is a STORE, the first slot for the next instruction.
311 return V < IM.first;
315 return IM.first < V;
320 return LHS.first < RHS.first;
345 /// Idx2MBBMap - Sorted list of pairs of index of first instructio
[all...]
/freebsd-10.0-release/contrib/llvm/lib/Target/X86/
H A DX86TargetTransformInfo.cpp206 return LT.first * AVX2CostTable[Idx].Cost;
234 return LT.first * SSE2UniformConstCostTable[Idx].Cost;
267 return LT.first * SSE2CostTable[Idx].Cost;
292 return LT.first * AVX1CostTable[Idx].Cost;
305 return LT.first * CustomLowered[Idx].Cost;
330 return Cost * LT.first;
368 return LTSrc.first * SSE2ConvTbl[Idx].Cost;
472 return LT.first * AVX2CostTbl[Idx].Cost;
478 return LT.first * AVX1CostTbl[Idx].Cost;
484 return LT.first * SSE42CostTb
[all...]
/freebsd-10.0-release/contrib/llvm/tools/clang/lib/Frontend/
H A DTextDiagnostic.cpp77 /// \brief returns a printable representation of first item from input range
169 SourceLine.replace(i, 1, res.first.c_str());
175 /// characters will appear at (numbering the first column as 0).
178 /// character) then the array will map that byte to the first column the
182 /// If a byte is the first in a sequence of bytes that together map to a single
212 columns += llvm::sys::locale::columnWidth(res.first);
245 columns += llvm::sys::locale::columnWidth(res.first);
276 /// \brief Map a byte to the first column which contains it.
378 // If it's not at a character's first column then advance it past the current
513 /// \returns The index of the first no
[all...]
/freebsd-10.0-release/contrib/llvm/tools/clang/lib/AST/
H A DDeclPrinter.cpp1080 bool first = true; local
1084 Out << (first ? ' ' : ',') << "readonly";
1085 first = false;
1089 Out << (first ? ' ' : ',') << "getter = "
1091 first = false;
1094 Out << (first ? ' ' : ',') << "setter = "
1096 first = false;
1100 Out << (first ? ' ' : ',') << "assign";
1101 first = false;
1106 Out << (first
[all...]
/freebsd-10.0-release/contrib/tcpdump/
H A Dprint-snmp.c684 int o = 0, first = -1, i = asnlen; local
696 first = 1;
709 * first subitem encodes two items with 1st*OIDMUX+2nd
712 if (first < 0) {
716 first = 0;
719 OBJ_PRINT(s, first);
722 OBJ_PRINT(o, first);
723 if (--first < 0)
724 first = 0;
741 char *cpf, *cpl, last[6], first[3 local
781 register int printable = 1, first = 1; local
904 int o = 0, first = -1, i = asnlen; local
[all...]
/freebsd-10.0-release/sbin/geom/class/part/
H A Dgeom_part.c427 off_t first, last, a_first; local
505 first = (off_t)strtoimax(find_geomcfg(gp, "first"), NULL, 0);
508 a_first = ALIGNUP(first + offset, alignment);
512 while ((pp = find_provider(gp, first)) != NULL) {
516 if (first < a_lba && a_first < a_lba) {
517 /* Free space [first, lba> */
540 first = (off_t)strtoimax(s, NULL, 0) + 1;
541 if (first > a_first)
542 a_first = ALIGNUP(first
585 off_t first, last, sector, end; local
[all...]
/freebsd-10.0-release/bin/ln/
H A Dln.c59 static int hflag; /* Check new name for symlink first. */
227 int ch, exists, first; local
291 * If the file exists, first check it is not the same directory entry.
319 first = ch = getchar();
322 if (first != 'y' && first != 'Y') {
/freebsd-10.0-release/bin/sh/
H A Dcd.c183 int first; local
199 first = 1;
203 if (! first)
205 first = 0;

Completed in 478 milliseconds

1234567891011>>