Searched refs:first (Results 251 - 275 of 1330) sorted by relevance

<<11121314151617181920>>

/freebsd-10.0-release/contrib/dtc/
H A Ddtc.h173 struct property *chain_property(struct property *first, struct property *list);
174 struct property *reverse_properties(struct property *first);
178 struct node *chain_node(struct node *first, struct node *list);
211 struct reserve_info *chain_reserve_entry(struct reserve_info *first,
/freebsd-10.0-release/contrib/libstdc++/include/bits/
H A Dstl_tempbuf.h155 _M_buffer = __p.first;
/freebsd-10.0-release/contrib/libstdc++/include/ext/pb_ds/detail/bin_search_tree_/
H A Ddebug_fn_imps.hpp121 if (r_range.first != NULL)
123 PB_DS_V2F(*r_range.first)));
125 return (std::make_pair((l_range.first != NULL)? l_range.first :& p_nd->m_value,(r_range.second != NULL)? r_range.second :& p_nd->m_value));
/freebsd-10.0-release/contrib/llvm/include/llvm/ADT/
H A DSTLExtras.h204 first_type first; member in struct:llvm::tier
207 tier(first_type f, second_type s) : first(f), second(s) { }
209 first = p.first;
/freebsd-10.0-release/contrib/llvm/include/llvm/Analysis/
H A DIntervalIterator.h18 // in depth first order. These intervals are completely filled in except for
104 llvm_unreachable("ProcessInterval should never fail for first interval!");
111 llvm_unreachable("ProcessInterval should never fail for first interval!");
126 inline const Interval *operator*() const { return IntStack.back().first; }
127 inline Interval *operator*() { return IntStack.back().first; }
137 EndIt = succ_end(IntStack.back().first);
145 if (IOwnMem) delete IntStack.back().first;
/freebsd-10.0-release/contrib/llvm/include/llvm/IR/
H A DSymbolTableListTraits.h67 ilist_iterator<ValueSubClass> first,
/freebsd-10.0-release/contrib/llvm/lib/CodeGen/
H A DLiveStackAnalysis.cpp79 int Slot = I->first;
/freebsd-10.0-release/contrib/llvm/lib/Target/R600/
H A DSIInsertWaits.cpp190 Result.first = TRI.getEncodingValue(Reg);
191 Result.second = Result.first + Size / 4;
223 for (unsigned j = Interval.first; j < Interval.second; ++j) {
315 for (unsigned j = Interval.first; j < Interval.second; ++j) {
/freebsd-10.0-release/contrib/llvm/lib/Transforms/IPO/
H A DIPConstantPropagation.cpp115 if (C && ArgumentConstants[i].first == 0) {
116 ArgumentConstants[i].first = C; // First constant seen.
117 } else if (C && ArgumentConstants[i].first == C) {
141 Value *V = ArgumentConstants[i].first;
/freebsd-10.0-release/contrib/llvm/tools/clang/lib/Tooling/
H A DRefactoring.cpp95 const FileEntry *Entry = Sources.getFileEntryForID(DecomposedLocation.first);
103 // to handle ranges for refactoring in general first - there is no obvious
110 if (Start.first != End.first) return -1;
177 Rewrite.getSourceMgr().getFileEntryForID(I->first);
/freebsd-10.0-release/contrib/llvm/tools/lldb/include/lldb/Core/
H A DBroadcaster.h135 return (input.first.GetBroadcasterClass() == m_broadcaster_class);
154 return (input.first.IsContainedIn (m_broadcaster_spec));
175 return (input.first.GetBroadcasterClass() == m_broadcaster_spec.GetBroadcasterClass()
176 && (input.first.GetEventBits() & m_broadcaster_spec.GetEventBits()) != 0
306 /// relinquished by the first listener that gets it. The actual
/freebsd-10.0-release/contrib/llvm/tools/lldb/source/Core/
H A DStreamCallback.cpp44 iter = ret.first;
/freebsd-10.0-release/contrib/llvm/tools/llvm-ranlib/
H A Dllvm-ranlib.cpp42 outs() << " " << format("%9u", offset) << "\t" << I->first <<"\n";
/freebsd-10.0-release/contrib/mdocml/
H A Dlibman.h34 #define MAN_NEWLINE (1 << 6) /* first macro/text in a line */
37 struct man_node *first; /* the first parsed node */ member in struct:man
H A Dtbl_data.c49 cp = dp->layout->first;
93 dp->last = dp->first = dat;
223 * If there's no last parsed span, use the first row. Lastly,
232 rp && rp->first; rp = rp->next) {
233 switch (rp->first->pos) {
/freebsd-10.0-release/contrib/ofed/management/infiniband-diags/include/
H A Dgrouping.h59 ChassisList *first; member in struct:AllChassisList
/freebsd-10.0-release/lib/libc/i386/string/
H A Dswab.S57 testl $7,%ecx # copy first group of 1 to 7 words
/freebsd-10.0-release/sys/cddl/contrib/opensolaris/uts/common/fs/zfs/
H A Ddmu_diff.c91 report_free_dnode_range(struct diffarg *da, uint64_t first, uint64_t last) argument
93 ASSERT(first <= last);
95 first != da->da_ddr.ddr_last + 1) {
99 da->da_ddr.ddr_first = first;
/freebsd-10.0-release/sys/dev/cxgb/ulp/tom/
H A Dcxgb_l2t.h55 * first element in its chain through its first pointer.
64 struct l2t_entry *first; /* start of hash chain */ member in struct:l2t_entry
/freebsd-10.0-release/sys/dev/cxgbe/
H A Dt4_l2t.h58 * first element in its chain through its first pointer.
67 struct l2t_entry *first; /* start of hash chain */ member in struct:l2t_entry
/freebsd-10.0-release/sys/netinet/cc/
H A Dcc.c40 * This software was first released in 2007 by James Healy and Lawrence Stewart
132 int err, first, nalgos; local
135 first = 1;
157 err = sbuf_printf(s, first ? "%s" : ", %s", algo->name);
163 first = 0;
/freebsd-10.0-release/sys/sparc64/pci/
H A Dapb.c135 int i, first; local
137 for (first = 1, i = 0; i < 8; i++) {
139 printf("%s0x%lx-0x%lx", first ? "" : ", ",
141 first = 0;
H A Dofw_pci.h102 uint32_t first; member in struct:ofw_pci_msi_ranges
/freebsd-10.0-release/tools/tools/pirtool/
H A Dpirtool.c184 int i, first; local
190 first = 1;
193 if (!first)
196 first = 0;
/freebsd-10.0-release/usr.bin/netstat/
H A Dipsec.c224 int first; local
228 first = 1;
232 if (first) {
234 first = 0;

Completed in 333 milliseconds

<<11121314151617181920>>