/freebsd-10.0-release/sys/netgraph/netflow/ |
H A D | netflow_v9.h | 58 uint32_t first; /* System uptime at start of a flow (FIRST_SWITCHED) */ member in struct:netflow_v9_record_ipv4_tcp 83 uint32_t first; /* System uptime at start of a flow (FIRST_SWITCHED) */ member in struct:netflow_v9_record_ipv6_tcp
|
/freebsd-10.0-release/contrib/gdb/gdb/ |
H A D | reggroups.c | 73 struct reggroup_el *first; member in struct:reggroups 84 groups->last = &groups->first; 120 static struct reggroups default_groups = { NULL, &default_groups.first }; 134 if (groups->first == NULL) 137 /* Return the first/next reggroup. */ 139 return groups->first->group; 140 for (el = groups->first; el != NULL; el = el->next)
|
/freebsd-10.0-release/contrib/libarchive/libarchive/test/ |
H A D | test_tar_large.c | 66 struct memblock *first; member in struct:memdata 101 /* Yes, we're assuming the very first write is metadata. */ 109 private->first = private->last = block; 130 if (private->first == NULL) { 149 block = private->first; 150 private->first = block->next; 173 if (private->first == NULL) {
|
/freebsd-10.0-release/contrib/llvm/tools/clang/lib/AST/ |
H A D | RawCommentList.cpp | 82 Kind = K.first; 98 BeginLine = SM.getLineNumber(LocInfo.first, LocInfo.second); 108 EndLine = SM.getLineNumber(LocInfo.first, LocInfo.second); 198 if (Loc1Info.first != Loc2Info.first) 202 const char *Buffer = SM.getBufferData(Loc1Info.first, &Invalid).data(); 239 // If this is the first Doxygen comment, save it (because there isn't
|
/freebsd-10.0-release/contrib/gcc/ |
H A D | tree-tailcall.c | 74 There are three cases how the function may exit. The first one is 719 basic_block bb, first; local 739 first = single_succ (ENTRY_BLOCK_PTR); 766 e = redirect_edge_and_branch (single_succ_edge (t->call_block), first); 774 phi = phi_nodes (first); 875 basic_block first = single_succ (ENTRY_BLOCK_PTR); local 905 if (!single_pred_p (first)) 906 first = split_edge (single_succ_edge (ENTRY_BLOCK_PTR)); 919 phi = create_phi_node (name, first); 921 add_phi_arg (phi, new_name, single_pred_edge (first)); [all...] |
H A D | collect2.c | 156 struct id *first; 831 set first, in case a diagnostic is issued. */ 1054 /* After the first file, put in the c++ rt0. */ 1230 dump_list (stderr, "\t", libs.first); 1234 nothing else in the file is referenced, so look at them first. */ 1242 struct id *list = libs.first; 1248 if (exports.first) 1258 write_aix_file (exportf, exports.first); 1429 if (! exports.first) 1441 write_aix_file (exportf, exports.first); 154 struct id *first; member in struct:head [all...] |
H A D | web.c | 90 unionfind_union (struct web_entry *first, struct web_entry *second) argument 92 first = unionfind_root (first); 94 if (first == second) 96 second->pred = first; 199 /* We are seeing this web for the first time, do the assignment. */
|
/freebsd-10.0-release/contrib/libstdc++/include/ext/pb_ds/detail/cc_hash_table_map_/ |
H A D | cc_ht_map_.hpp | 100 #define PB_DS_V2F(X) (X).first 388 && !hash_eq_fn_base::operator()(p_e->m_value.first, r_key)) 410 entry_pointer p_e = m_entries[pos_hash_pair.first]; 413 !hash_eq_fn_base::operator()(p_e->m_value.first, p_e->m_hash, r_key, pos_hash_pair.second)) 468 p_e->m_p_next = m_entries[r_pos_hash_pair.first]; 469 m_entries[r_pos_hash_pair.first] = p_e; 503 entry_pointer p_e = m_entries[pos_hash_pair.first]; 548 r_pos.first = r_pos.first->m_p_next; 549 if (r_pos.first ! [all...] |
/freebsd-10.0-release/contrib/gperf/src/ |
H A D | output.cc | 117 to look at the first and the last element of the list. */ 119 _min_hash_value = _head->first()->_hash_value; 124 _max_hash_value = temp->first()->_hash_value; 568 /* Outputs the comparison expression for the first byte. 579 /* First, we emit a comparison of the first byte of the two strings. 950 KeywordExt *keyword = temp->first(); 1012 KeywordExt *keyword = temp->first(); 1053 KeywordExt *keyword = temp->first(); 1192 KeywordExt *keyword = temp->first(); 1272 int hash_value = temp->first() [all...] |
/freebsd-10.0-release/contrib/dialog/ |
H A D | buttons.c | 123 * the first uppercase character in each label. However, if more than one 124 * button has the same first-uppercase, then we will (attempt to) look for 144 int first = indx[i]; local 145 int check = UCH(label[first]); 148 if ((last - first) != 1) { 149 const char *temp = (label + first); 188 int first = indx[i]; local 193 check = UCH(label[first]); 195 if ((last - first) != 1) { 196 const char *temp = (label + first); [all...] |
/freebsd-10.0-release/contrib/llvm/include/llvm/MC/ |
H A D | MCStreamer.h | 180 return SectionStack.back().first; 212 MCSectionSubPair oldSection = SectionStack.pop_back_val().first; 213 MCSectionSubPair curSection = SectionStack.back().first; 216 ChangeSection(curSection.first, curSection.second); 224 SwitchSection(SectionStack.back().first.first, Subsection); 234 MCSectionSubPair curSection = SectionStack.back().first; 237 SectionStack.back().first = MCSectionSubPair(Section, Subsection); 248 MCSectionSubPair curSection = SectionStack.back().first; 251 SectionStack.back().first [all...] |
/freebsd-10.0-release/contrib/tcsh/ |
H A D | tc.bind.c | 444 printkeys(KEYCMD *map, int first, int last) argument 453 firstbuf[0] = (Char) first; 462 if (map[first] == F_UNASSIGNED) { 463 if (first == last) 470 if (fp->func == map[first]) { 471 if (first == last) 486 xprintf("CcKeyMap[%d] == %d\n", first, CcKeyMap[first]); 488 xprintf("CcAltMap[%d] == %d\n", first, CcAltMap[first]); [all...] |
/freebsd-10.0-release/contrib/dtc/ |
H A D | livetree.c | 54 struct property *chain_property(struct property *first, struct property *list) argument 56 assert(first->next == NULL); 58 first->next = list; 59 return first; 62 struct property *reverse_properties(struct property *first) argument 64 struct property *p = first; 170 struct node *chain_node(struct node *first, struct node *list) argument 172 assert(first->next_sibling == NULL); 174 first->next_sibling = list; 175 return first; 217 chain_reserve_entry(struct reserve_info *first, struct reserve_info *list) argument [all...] |
/freebsd-10.0-release/contrib/llvm/tools/llvm-objdump/ |
H A D | MachODump.cpp | 159 if (pi->second.contains(i->first)) { 167 Out << '"' << i->first << "\" [ label=\"<a>"; 182 Out << i->first << ":o -> " << *si <<":a\n"; 497 memoryObject, mi->first, 514 if (!PrintedBlocks.insert(fi->first).second) 517 // We assume a block has predecessors when it's the first block after 519 bool hasPreds = FunctionMap.find(fi->first) != FunctionMap.end(); 525 if (pi->second.contains(fi->first)) { 537 llvm::next(fi)->first; 538 outs() << "# " << End-fi->first << " byte [all...] |
/freebsd-10.0-release/contrib/apr-util/dbm/ |
H A D | apr_dbm_berkeleydb.c | 308 DBT first = { 0 }; local 313 dberr = (*f->bdb->seq)(f->bdb, &first, &data, R_FIRST); 320 dberr = (*f->curs->c_get)(f->curs, &first, &data, DB_FIRST); 322 memset(&first, 0, sizeof(first)); 330 pkey->dptr = first.data; 331 pkey->dsize = first.size;
|
/freebsd-10.0-release/contrib/atf/atf-c++/detail/ |
H A D | parser.cpp | 60 oss << "LONELY PARSE ERROR: " << first << ": " << second; 71 return atf::text::to_string(first) + ": " + second; 288 line += "; " + (*iter).first + "=\"" + (*iter).second + "\""; 322 bool first = true; local 329 if (first && he.name() != "Content-Type") 332 first = false; 356 if ((*iter).first != "Content-Type")
|
/freebsd-10.0-release/sbin/ipfw/ |
H A D | main.c | 115 char *arg = oldav[1]; /* The string is the first arg. */ 180 int first, i, l=0; local 201 for (first = i = ac = 1, l = 0; i < oldac; i++) { 209 for (l=0; first <= i; first++) { 210 strcat(av_p, oldav[first]); 211 av_p += strlen(oldav[first]); 216 first = i+1; 348 * An undocumented behaviour of ipfw1 was to allow rule numbers first, 350 * In case, swap first an [all...] |
/freebsd-10.0-release/contrib/libreadline/ |
H A D | histexpand.c | 82 /* During tokenization, if this character is seen as the first character 686 /* :s/this/that substitutes `that' for the first 772 /* Find the first occurrence of THIS in TEMP. */ 780 In the first case, we substitute for the first occurrence only. 783 first occurrence of each word. */ 1243 int first, last; local 1248 first = last = 0; 1259 /* Handle special cases first. */ 1286 first [all...] |
/freebsd-10.0-release/contrib/llvm/include/llvm/Support/ |
H A D | IntegersSubset.h | 260 Res.first.Low = Low; 263 Res.first.High = NewHigh; 316 RangeLink.first = &FlatCollection.back(); 339 FlatCollection.push_back(*(i->first)); 340 RangeLink.first = &FlatCollection.back(); 341 if (i->first != i->second) 365 if (RangeLinks[i].first == RangeLinks[i].second) { 366 if (*RangeLinks[i].first == CheckingVal) 368 } else if (*RangeLinks[i].first <= CheckingVal && 378 if (Link.first ! [all...] |
/freebsd-10.0-release/sys/vm/ |
H A D | vm_reserv.c | 114 vm_page_t pages; /* first page of a superpage */ 297 * alignment of the first physical page in the set. If the given value 310 vm_pindex_t first, leftcap, rightcap; local 328 * Assuming that the first page is allocated from a reservation, the 365 * Could at least one reservation fit between the first index to the 366 * left that can be used and the first index to the right that cannot 369 first = pindex - VM_RESERV_INDEX(object, pindex); 375 if (leftcap > first) 386 if (first + maxpages > rightcap) { 396 if (first 488 vm_pindex_t first, leftcap, rightcap; local [all...] |
/freebsd-10.0-release/contrib/llvm/tools/clang/include/clang/Basic/ |
H A D | OnDiskHashTable.h | 211 InfoObj.EmitKey(out, I->key, Len.first); 311 unsigned item_len = L.first + L.second; 321 InfoPtr->ReadKey((const unsigned char* const) Items, L.first); 330 return iterator(X, Items + L.first, L.second, InfoPtr); 370 Ptr += L.first + L.second; 392 const internal_key_type& Key = InfoObj->ReadKey(LocalPtr, L.first); 434 Ptr += L.first + L.second; 456 InfoObj->ReadKey(LocalPtr, L.first); 457 return InfoObj->ReadData(Key, LocalPtr + L.first, L.second);
|
/freebsd-10.0-release/contrib/libstdc++/include/ext/pb_ds/detail/rb_tree_map_/ |
H A D | rb_tree_.hpp | 103 #define PB_DS_V2F(X) (X).first 111 #define PB_DS_EP2VP(X)& ((X)->m_value.first) 182 ins_pair.first.m_p_nd->m_red = true; 184 insert_fixup(ins_pair.first.m_p_nd); 187 return ins_pair.first.m_p_nd->m_value.second;
|
/freebsd-10.0-release/contrib/libstdc++/include/ext/pb_ds/detail/splay_tree_/ |
H A D | splay_tree_.hpp | 127 #define PB_DS_V2F(X) (X).first 135 #define PB_DS_EP2VP(X)& ((X)->m_value.first) 204 ins_pair.first.m_p_nd->m_special = false; 206 splay(ins_pair.first.m_p_nd); 208 return ins_pair.first.m_p_nd->m_value.second;
|
/freebsd-10.0-release/contrib/llvm/lib/Analysis/IPA/ |
H A D | CallGraph.cpp | 264 OS << " CS<" << I->first << "> calls "; 283 if (I->first == CS.getInstruction()) { 311 if (CR.second == Callee && CR.first == 0) { 327 if (I->first == CS.getInstruction()) { 329 I->first = NewCS.getInstruction();
|
/freebsd-10.0-release/contrib/llvm/lib/MC/ |
H A D | MCSectionMachO.cpp | 187 // Find the first comma. 196 Segment = Comma.first; 208 Section = Comma.first; 226 StringRef SectionType = Comma.first; 256 StringRef Attrs = Comma.first; 262 StringRef Attr = Plus.first;
|