/freebsd-11.0-release/contrib/llvm/tools/clang/include/clang/AST/ |
H A D | DeclLookups.h | 40 DeclarationName getLookupName() const { return It->first; } 52 It->first == DeclarationName::getUsingDirectiveName());
|
/freebsd-11.0-release/contrib/mdocml/ |
H A D | demandoc.c | 125 pmdoc(man->first->child, &line, &col, list); 128 pman(man->first->child, &line, &col, list);
|
/freebsd-11.0-release/contrib/gcc/ |
H A D | bitmap.h | 73 bitmap_element *first; /* First element in linked list. */ local 97 /* True if the complement of the second intersects the first (their 102 #define bitmap_empty_p(MAP) (!(MAP)->first) 108 versions that modify the first source operand. The other variants 154 head->first = head->current = NULL; 200 /* Initialize a single bitmap iterator. START_BIT is the first bit to 207 bi->elt1 = map->first; 234 first bit, otherwise our incrementing to the next word boundary 249 bi->elt1 = map1->first; 250 bi->elt2 = map2->first; [all...] |
/freebsd-11.0-release/contrib/libarchive/libarchive/test/ |
H A D | test_write_format_zip_large.c | 55 struct fileblock *first; member in struct:fileblocks 100 /* Yes, we're assuming the very first write is metadata. */ 108 private->first = private->last = block; 182 private->current = private->first; 213 private->current = private->first; 262 while (fileblocks->first != NULL) { 263 struct fileblock *b = fileblocks->first; 264 fileblocks->first = fileblocks->first->next;
|
/freebsd-11.0-release/contrib/apr-util/include/ |
H A D | apr_xml.h | 65 /** The first piece of text in the list */ 66 apr_text *first; member in struct:apr_text_header 99 ** their first three characters are reserved by the XML Namespaces 123 ** For the first case, this means the original prefix/name will be 179 /** first child element */ 181 /** first attribute */ 197 (e)->first_cdata.first == NULL)
|
/freebsd-11.0-release/sys/netgraph/netflow/ |
H A D | netflow.h | 71 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-11.0-release/sys/kern/ |
H A D | subr_unit.c | 34 * Allocation policy is always lowest free number first. 194 /* Is the unrb empty in at least the first len bits? */ 230 y = uh->first; 336 uh->first = 0; 425 * If the first element is not a bitmap, make it one. 541 /* Merge into ->first if possible */ 544 uh->first += upp->len; 579 x = uh->low + uh->first; 584 * If we have an ideal split, just adjust the first+last 587 uh->first [all...] |
/freebsd-11.0-release/usr.sbin/mptutil/ |
H A D | mpt_evt.c | 82 event_compare(const void *first, const void *second) argument 87 one = first;
|
/freebsd-11.0-release/contrib/llvm/tools/clang/lib/Frontend/ |
H A D | TextDiagnostic.cpp | 79 /// \brief returns a printable representation of first item from input range 171 SourceLine.replace(i, 1, res.first.c_str()); 177 /// characters will appear at (numbering the first column as 0). 180 /// character) then the array will map that byte to the first column the 184 /// If a byte is the first in a sequence of bytes that together map to a single 214 columns += llvm::sys::locale::columnWidth(res.first); 247 columns += llvm::sys::locale::columnWidth(res.first); 278 /// \brief Map a byte to the first column which contains it. 377 // If it's not at a character's first column then advance it past the current 512 /// \returns The index of the first no [all...] |
/freebsd-11.0-release/contrib/llvm/include/llvm/CodeGen/ |
H A D | BasicTTIImpl.h | 71 // index 0 of first vector, index 1 of second vector,index 2 of first 306 return LT.first * OpCost; 312 return LT.first * 2 * OpCost; 346 if (SrcLT.first == DstLT.first && 363 if (SrcLT.first == DstLT.first && 387 if (SrcLT.first == DstLT.first [all...] |
/freebsd-11.0-release/contrib/llvm/lib/Target/WebAssembly/ |
H A D | Relooper.cpp | 223 ToInvestigate.push_back(iter.first); 261 Block *Post = iter.first; 271 Block *Post = iter.first; 290 iter.first->BranchesIn.insert(Curr); 312 if (!LimitTo || contains(*LimitTo, iter.first)) 313 Entries.insert(iter.first); 382 Block *Possible = iter.first; 439 Block *Target = iter.first; 478 Block *New = iter.first; 540 Block *CurrEntry = iter.first; [all...] |
/freebsd-11.0-release/contrib/ntp/sntp/libevent/ |
H A D | buffer.c | 286 * Internal; requires lock. The caller must fix up buf->last and buf->first 293 /* Find the first victim chain. It might be *last_with_datap */ 314 EVUTIL_ASSERT(buf->last_with_datap == &buf->first); 315 EVUTIL_ASSERT(buf->first == NULL); 316 buf->first = buf->last = chain; 371 buffer->last_with_datap = &buffer->first; 572 for (chain = buffer->first; chain != NULL; chain = next) { 626 chain = buf->first; 737 * be the first one with space in it. */ 747 /* Advance 'firstchain' to the first chai 809 PRESERVE_PINNED(struct evbuffer *src, struct evbuffer_chain **first, struct evbuffer_chain **last) argument 2705 char first; local [all...] |
/freebsd-11.0-release/sbin/geom/class/part/ |
H A D | geom_part.c | 436 off_t first, last, a_first; local 471 "No partitioning scheme found on geom %s. Create one first using 'gpart create'.", 525 s = find_geomcfg(gp, "first"); 529 first = (off_t)strtoimax(s, NULL, 0); 536 a_first = ALIGNUP(first + offset, alignment); 540 while ((pp = find_provider(gp, first)) != NULL) { 544 if (first < a_lba && a_first < a_lba) { 545 /* Free space [first, lba> */ 568 first = (off_t)strtoimax(s, NULL, 0) + 1; 569 if (first 613 off_t first, last, sector, end; local [all...] |
/freebsd-11.0-release/contrib/llvm/tools/lldb/source/Core/ |
H A D | StreamCallback.cpp | 44 iter = ret.first;
|
/freebsd-11.0-release/contrib/llvm/tools/lldb/source/Target/ |
H A D | UnixSignals.cpp | 199 return pos->first; 214 return (*m_signals.begin ()).first; 230 return pos->first; 359 return it->first;
|
/freebsd-11.0-release/contrib/subversion/subversion/libsvn_client/ |
H A D | copy.c | 117 svn_client__copy_pair_t *first; 126 first = APR_ARRAY_IDX(copy_pairs, 0, svn_client__copy_pair_t *); 130 first_dst = first->dst_abspath_or_url; 141 first_src = first->src_abspath_or_url; 1454 /* Open an RA session to the first copy pair's destination. We'll 2024 /* ### But why start by getting the _parent_ of the first one? */ 2807 /* Are either of our paths URLs? Just check the first src_path. If 115 svn_client__copy_pair_t *first; local
|
/freebsd-11.0-release/contrib/ofed/management/infiniband-diags/include/ |
H A D | grouping.h | 59 ChassisList *first; member in struct:AllChassisList
|
/freebsd-11.0-release/lib/libc/i386/string/ |
H A D | swab.S | 57 testl $7,%ecx # copy first group of 1 to 7 words
|
/freebsd-11.0-release/contrib/llvm/include/llvm/Support/ |
H A D | FormattedStream.h | 110 unsigned getColumn() { return Position.first; }
|
/freebsd-11.0-release/contrib/llvm/include/llvm/TableGen/ |
H A D | StringToOffsetTable.h | 34 // Add the string to the aggregate if this is the first time found. 40 return IterBool.first->second;
|
/freebsd-11.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 305 /// relinquished by the first listener that gets it. The actual
|
/freebsd-11.0-release/contrib/libstdc++/include/bits/ |
H A D | stl_tempbuf.h | 155 _M_buffer = __p.first;
|
/freebsd-11.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-11.0-release/contrib/llvm/include/llvm/ADT/ |
H A D | iterator_range.h | 59 return iterator_range<T>(std::move(p.first), std::move(p.second));
|
/freebsd-11.0-release/contrib/llvm/include/llvm/Analysis/ |
H A D | DominanceFrontierImpl.h | 98 tmpFrontiers.insert(std::make_pair(I->first, I->second)); 103 BlockT *Node = I->first; 125 if (I->first) 126 I->first->printAsOperand(OS, false);
|