Searched refs:first (Results 176 - 200 of 1372) sorted by relevance

1234567891011>>

/freebsd-10.1-release/contrib/libarchive/libarchive/test/
H A Dtest_tar_large.c66 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.1-release/contrib/ntp/include/
H A Dntp_config.h53 int first; member in struct:int_range_tag
271 void * concat_gen_fifos(void *first, void *second);
274 #define CONCAT_G_FIFOS(first, second) \
275 ((first) = concat_gen_fifos((first), (second)))
289 attr_val *create_attr_rangeval(int attr, int first, int last);
/freebsd-10.1-release/contrib/gcc/
H A Dtree-tailcall.c74 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 Dcollect2.c156 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 Dweb.c90 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.1-release/contrib/libstdc++/include/ext/pb_ds/detail/cc_hash_table_map_/
H A Dcc_ht_map_.hpp100 #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.1-release/contrib/gperf/src/
H A Doutput.cc117 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();
1190 KeywordExt *keyword = temp->first();
1270 int hash_value = temp->first()
[all...]
/freebsd-10.1-release/contrib/dialog/
H A Dbuttons.c123 * 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.1-release/contrib/llvm/include/llvm/MC/
H A DMCStreamer.h226 return SectionStack.back().first;
264 MCSectionSubPair oldSection = SectionStack.pop_back_val().first;
265 MCSectionSubPair curSection = SectionStack.back().first;
268 ChangeSection(curSection.first, curSection.second);
276 SwitchSection(SectionStack.back().first.first, Subsection);
286 MCSectionSubPair curSection = SectionStack.back().first;
289 SectionStack.back().first = MCSectionSubPair(Section, Subsection);
300 MCSectionSubPair curSection = SectionStack.back().first;
303 SectionStack.back().first
[all...]
/freebsd-10.1-release/contrib/tcsh/
H A Dtc.bind.c444 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.1-release/contrib/llvm/lib/CodeGen/SelectionDAG/
H A DLegalizeTypes.cpp373 // Otherwise, this node is new: this is the first operand of it that
483 // This is the first operand to change - add all operands so far.
539 /// Expunge when a new node is first seen, since it may no longer be marked
558 assert(I->first.getNode() != N);
564 assert(I->first.getNode() != N);
570 assert(I->first.getNode() != N);
576 assert(I->first.getNode() != N);
582 assert(I->first.getNode() != N);
583 RemapValue(I->second.first);
589 assert(I->first
[all...]
/freebsd-10.1-release/contrib/dtc/
H A Dlivetree.c77 struct property *chain_property(struct property *first, struct property *list) argument
79 assert(first->next == NULL);
81 first->next = list;
82 return first;
85 struct property *reverse_properties(struct property *first) argument
87 struct property *p = first;
219 struct node *chain_node(struct node *first, struct node *list) argument
221 assert(first->next_sibling == NULL);
223 first->next_sibling = list;
224 return first;
311 chain_reserve_entry(struct reserve_info *first, struct reserve_info *list) argument
[all...]
/freebsd-10.1-release/contrib/apr-util/dbm/
H A Dapr_dbm_berkeleydb.c308 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.1-release/contrib/llvm/tools/clang/lib/ARCMigrate/
H A DFileRemapper.cpp107 remap(pairs[i].first, pairs[i].second);
136 const FileEntry *origFE = I->first;
176 const FileEntry *origFE = I->first;
203 PPOpts.addRemappedFile(I->first->getName(), FE->getName());
206 PPOpts.addRemappedFile(I->first->getName(), mem);
217 PPOpts.addRemappedFile(I->first->getName(), FE->getName());
220 PPOpts.addRemappedFile(I->first->getName(), mem);
/freebsd-10.1-release/sbin/ipfw/
H A Dmain.c115 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.1-release/contrib/libreadline/
H A Dhistexpand.c82 /* 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.1-release/sys/vm/
H A Dvm_reserv.c114 vm_page_t pages; /* first page of a superpage */
305 * alignment of the first physical page in the set. If the given value
318 vm_pindex_t first, leftcap, rightcap; local
336 * Assuming that the first page is allocated from a reservation, the
373 * Could at least one reservation fit between the first index to the
374 * left that can be used ("leftcap") and the first index to the right
377 first = pindex - VM_RESERV_INDEX(object, pindex);
383 if (leftcap > first)
394 if (first + maxpages > rightcap) {
411 if (first
510 vm_pindex_t first, leftcap, rightcap; local
[all...]
/freebsd-10.1-release/contrib/llvm/tools/clang/include/clang/Basic/
H A DOnDiskHashTable.h211 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.1-release/sys/arm/ti/am335x/
H A Dam335x_dmtimer.c368 * first timer that has an external caputure pin configured as input.
446 am335x_dmtimer_start(struct eventtimer *et, sbintime_t first, sbintime_t period) argument
477 if (first != 0)
478 initial_count = ((uint32_t)et->et_frequency * first) >> 32;
669 uint32_t first, last; local
684 first = am335x_dmtimer_tc_read_4(sc, DMT_TCRR);
688 if (last > first) {
689 counts -= (int32_t)(last - first);
691 counts -= (int32_t)((0xFFFFFFFF - first) + last);
693 first
[all...]
/freebsd-10.1-release/contrib/libstdc++/include/ext/pb_ds/detail/rb_tree_map_/
H A Drb_tree_.hpp103 #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.1-release/contrib/libstdc++/include/ext/pb_ds/detail/splay_tree_/
H A Dsplay_tree_.hpp127 #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.1-release/contrib/llvm/lib/Analysis/IPA/
H A DCallGraph.cpp190 OS << " CS<" << I->first << "> calls ";
209 if (I->first == CS.getInstruction()) {
237 if (CR.second == Callee && CR.first == 0) {
253 if (I->first == CS.getInstruction()) {
255 I->first = NewCS.getInstruction();
/freebsd-10.1-release/contrib/llvm/lib/MC/
H A DMCSectionMachO.cpp187 // 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;
/freebsd-10.1-release/contrib/llvm/tools/lldb/source/Target/
H A DSectionLoadList.cpp248 if (load_addr != pos->first && pos != m_addr_to_sect.begin())
250 const addr_t pos_load_addr = pos->first;
267 if (load_addr >= rpos->first)
269 addr_t offset = load_addr - rpos->first;
290 s.Printf("addr = 0x%16.16" PRIx64 ", section = %p: ", pos->first, pos->second.get());
/freebsd-10.1-release/usr.sbin/pkg/
H A Ddns_utils.c82 compute_weight(struct dns_srvinfo **d, int first, int last) argument
87 chosen = malloc(sizeof(int) * (last - first + 1));
116 struct dns_srvinfo **res, *first; local
217 first = res[0];
220 return (first);

Completed in 193 milliseconds

1234567891011>>