/freebsd-10.0-release/contrib/dtc/ |
H A D | dtc.h | 173 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 D | stl_tempbuf.h | 155 _M_buffer = __p.first;
|
/freebsd-10.0-release/contrib/libstdc++/include/ext/pb_ds/detail/bin_search_tree_/ |
H A D | debug_fn_imps.hpp | 121 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 D | STLExtras.h | 204 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 D | IntervalIterator.h | 18 // 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 D | SymbolTableListTraits.h | 67 ilist_iterator<ValueSubClass> first,
|
/freebsd-10.0-release/contrib/llvm/lib/CodeGen/ |
H A D | LiveStackAnalysis.cpp | 79 int Slot = I->first;
|
/freebsd-10.0-release/contrib/llvm/lib/Target/R600/ |
H A D | SIInsertWaits.cpp | 190 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 D | IPConstantPropagation.cpp | 115 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 D | Refactoring.cpp | 95 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 D | Broadcaster.h | 135 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 D | StreamCallback.cpp | 44 iter = ret.first;
|
/freebsd-10.0-release/contrib/llvm/tools/llvm-ranlib/ |
H A D | llvm-ranlib.cpp | 42 outs() << " " << format("%9u", offset) << "\t" << I->first <<"\n";
|
/freebsd-10.0-release/contrib/mdocml/ |
H A D | libman.h | 34 #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 D | tbl_data.c | 49 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 D | grouping.h | 59 ChassisList *first; member in struct:AllChassisList
|
/freebsd-10.0-release/lib/libc/i386/string/ |
H A D | swab.S | 57 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 D | dmu_diff.c | 91 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 D | cxgb_l2t.h | 55 * 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 D | t4_l2t.h | 58 * 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 D | cc.c | 40 * 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 D | apb.c | 135 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 D | ofw_pci.h | 102 uint32_t first; member in struct:ofw_pci_msi_ranges
|
/freebsd-10.0-release/tools/tools/pirtool/ |
H A D | pirtool.c | 184 int i, first; local 190 first = 1; 193 if (!first) 196 first = 0;
|
/freebsd-10.0-release/usr.bin/netstat/ |
H A D | ipsec.c | 224 int first; local 228 first = 1; 232 if (first) { 234 first = 0;
|