Home
last modified time | relevance | path

Searched refs:front (Results 1 – 25 of 743) sorted by relevance

12345678910>>...30

/freebsd-12.1/usr.bin/look/
H A Dlook.c203 front = binary_search(string, front, back); in look()
204 front = linear_search(string, front, back); in look()
206 if (front) in look()
258 p = front + (back - front) / 2; in binary_search()
267 front = p; in binary_search()
270 p = front + (back - front) / 2; in binary_search()
273 return (front); in binary_search()
290 while (front < back) { in linear_search()
293 return (front); in linear_search()
310 for (; front < back && compare(string, front, back) == EQUAL; ++front) { in print_from()
[all …]
/freebsd-12.1/contrib/ntp/ntpd/
H A Dntp_prio_q.c41 my_queue->front = NULL; in debug_create_priority_queue()
59 while (my_queue->front != NULL) { in destroy_queue()
60 temp = my_queue->front; in destroy_queue()
61 my_queue->front = my_queue->front->node_next; in destroy_queue()
129 return (!my_queue || !my_queue->front); in empty()
138 if (NULL == q || NULL == q->front) in queue_head()
141 return q->front + 1; in queue_head()
156 node *j = my_queue->front; in enqueue()
166 my_queue->front = new_node; in enqueue()
184 node *my_node = my_queue->front; in dequeue()
[all …]
/freebsd-12.1/contrib/openresolv/
H A Ddnsmasq.in97 SIFS=${IFS-y} OIFS=$IFS bytes= front= back=
117 front="$front byte:$byte1 byte:$byte2"
122 front="$front byte:0 byte:0"
124 front="${front}$back"
130 dbusdest="${dbusdest}$front string:$dn"
/freebsd-12.1/contrib/gcc/doc/
H A Dlanguages.texi8 The interface to front ends for languages in GCC, and in particular
12 procedural languages, and front ends for many such languages have been
15 Writing a compiler as a front end for GCC, rather than compiling
20 @item GCC front ends benefit from the support for many different
22 @item GCC front ends benefit from all the optimizations in GCC@. Some
31 Because of the advantages of writing a compiler as a GCC front end,
32 GCC front ends have also been created for languages very different
36 example, as part of a research project) as GCC front ends.
/freebsd-12.1/contrib/binutils/bfd/doc/
H A Dbfd.texinfo88 * BFD front end:: BFD front end
94 @node Overview, BFD front end, Top, Top
198 @node BFD front end, BFD back ends, Overview, Top
221 @node Memory Usage, Initialization, BFD front end, BFD front end
247 @node Sections, Symbols, Initialization, BFD front end
250 @node Symbols, Archives, Sections, BFD front end
253 @node Archives, Formats, Symbols, BFD front end
256 @node Formats, Relocations, Archives, BFD front end
259 @node Relocations, Core Files, Formats, BFD front end
262 @node Core Files, Targets, Relocations, BFD front end
[all …]
/freebsd-12.1/contrib/file/magic/Magdir/
H A Ddolby29 >6 byte&0xe0 = 0x00 1+1 front,
31 >6 byte&0xe0 = 0x20 1 front/0 rear,
33 >6 byte&0xe0 = 0x40 2 front/0 rear,
40 >6 byte&0xe0 = 0x60 3 front/0 rear,
42 >6 byte&0xe0 = 0x80 2 front/1 rear,
44 >6 byte&0xe0 = 0xa0 3 front/1 rear,
46 >6 byte&0xe0 = 0xc0 2 front/2 rear,
48 >6 byte&0xe0 = 0xe0 3 front/2 rear,
/freebsd-12.1/contrib/nvi/ex/
H A Dex_tag.c1056 front = map; in ctag_sfile()
1058 front = binary_search(tname, front, back); in ctag_sfile()
1059 front = linear_search(tname, front, back, tl); in ctag_sfile()
1089 p = front; in ctag_sfile()
1090 front = t; in ctag_sfile()
1248 p = front + (back - front) / 2; in binary_search()
1253 front = p; in binary_search()
1256 p = front + (back - front) / 2; in binary_search()
1259 return (front); in binary_search()
1278 end = tl && back-front > tl ? front+tl : back; in linear_search()
[all …]
/freebsd-12.1/contrib/unbound/services/
H A Dlisten_dnsport.c1262 front->cps = item; in listen_cp_insert()
1274 if(!front) in listen_create()
1276 front->cps = NULL; in listen_create()
1281 if(!front->udp_buff) { in listen_create()
1282 free(front); in listen_create()
1343 if(!front->cps) { in listen_create()
1345 listen_delete(front); in listen_create()
1349 return front; in listen_create()
1367 if(!front) in listen_delete()
1372 front->udp_buff != front->dnscrypt_udp_buff) { in listen_delete()
[all …]
/freebsd-12.1/contrib/bmake/lst.lib/
H A DlstAtFront.c72 LstNode front; in Lst_AtFront() local
74 front = Lst_First(l); in Lst_AtFront()
75 return (Lst_InsertBefore(l, front, d)); in Lst_AtFront()
/freebsd-12.1/contrib/llvm/tools/clang/lib/Basic/Targets/
H A DAMDGPU.h134 if (S.front() == '{') { in validateAsmConstraint()
140 if (S.front() != 'v' && S.front() != 's') { in validateAsmConstraint()
164 if (!S.empty() && S.front() == '[') { in validateAsmConstraint()
171 if (!S.empty() && S.front() == ':') { in validateAsmConstraint()
180 if (S.empty() || S.front() != ']') in validateAsmConstraint()
184 if (S.empty() || S.front() != '}') in validateAsmConstraint()
/freebsd-12.1/contrib/llvm/tools/clang/include/clang/Driver/
H A DMultilib.h47 (StringRef(GCCSuffix).front() == '/' && GCCSuffix.size() > 1)); in gccSuffix()
58 (StringRef(OSSuffix).front() == '/' && OSSuffix.size() > 1)); in osSuffix()
69 (StringRef(IncludeSuffix).front() == '/' && IncludeSuffix.size() > 1)); in includeSuffix()
89 assert(F.front() == '+' || F.front() == '-'); in flag()
/freebsd-12.1/contrib/llvm/tools/lldb/source/Plugins/Process/Utility/
H A DUnwindMacOSXFrameBackchain.cpp115 lldb::addr_t first_frame_pc = m_cursors.front().pc; in GetStackFrameData_i386()
143 cursor.fp = m_cursors.front().fp; in GetStackFrameData_i386()
149 m_cursors.front().fp = first_frame_sp; in GetStackFrameData_i386()
206 lldb::addr_t first_frame_pc = m_cursors.front().pc; in GetStackFrameData_x86_64()
233 cursor.fp = m_cursors.front().fp; in GetStackFrameData_x86_64()
239 m_cursors.front().fp = first_frame_sp; in GetStackFrameData_x86_64()
/freebsd-12.1/cddl/usr.sbin/zfsd/
H A Dcallout.cc137 if (s_activeCallouts.front() == this) { in Reset()
172 Callout *cur(s_activeCallouts.front()); in ExpireCallouts()
177 && timerisset(&s_activeCallouts.front()->m_interval) == 0); in ExpireCallouts()
180 Callout *next(s_activeCallouts.front()); in ExpireCallouts()
/freebsd-12.1/contrib/llvm/tools/clang/lib/Driver/
H A DMultilib.cpp47 if (seg.front() != '/') { in normalizePathSegment()
85 assert(GCCSuffix.empty() || (StringRef(GCCSuffix).front() == '/')); in print()
93 if (Flag.front() == '+') in print()
104 assert(StringRef(Flag).front() == '+' || StringRef(Flag).front() == '-'); in isValid()
146 if (Flag.front() == '+') in Maybe()
239 char Indicator = Flag.front(); in isFlagEnabled()
H A DAction.cpp189 if (llvm::all_of(OKinds, [&](OffloadKind K) { return K == OKinds.front(); })) in OffloadAction()
190 OffloadingDeviceKind = OKinds.front(); in OffloadAction()
194 OffloadingArch = BArchs.front(); in OffloadAction()
225 auto *A = getInputs().front(); in doOnHostDependence()
269 return HostTC ? getInputs().front() : nullptr; in getHostDependence()
285 return HostTC ? getInputs()[1] : getInputs().front(); in getSingleDeviceDependence()
/freebsd-12.1/contrib/libstdc++/include/bits/
H A Dstl_queue.h154 front() in _GLIBCXX_BEGIN_NAMESPACE()
157 return c.front(); in _GLIBCXX_BEGIN_NAMESPACE()
165 front() const in _GLIBCXX_BEGIN_NAMESPACE()
168 return c.front(); in _GLIBCXX_BEGIN_NAMESPACE()
401 return c.front(); in top()
/freebsd-12.1/contrib/wpa/src/p2p/
H A Dp2p_build.c527 size_t front = remaining; in p2p_buf_add_service_info() local
535 if (front) in p2p_buf_add_service_info()
536 wpabuf_put_data(buf, holder, front); in p2p_buf_add_service_info()
541 wpabuf_put_data(buf, &holder[front], back); in p2p_buf_add_service_info()
554 size_t front = remaining; in p2p_buf_add_service_info() local
555 size_t back = svc_len - front; in p2p_buf_add_service_info()
557 if (front) in p2p_buf_add_service_info()
558 wpabuf_put_data(buf, svc_name, front); in p2p_buf_add_service_info()
565 wpabuf_put_data(buf, &svc_name[front], 255 - 4); in p2p_buf_add_service_info()
567 front += 255 - 4; in p2p_buf_add_service_info()
[all …]
/freebsd-12.1/contrib/llvm/tools/clang/include/clang/AST/
H A DCXXInheritance.h197 CXXBasePath& front() { return Paths.front(); } in front() function
198 const CXXBasePath& front() const { return Paths.front(); } in front() function
/freebsd-12.1/sys/netpfil/ipfw/
H A Ddn_sched_qfq.c230 unsigned int front; /* Index of the front slot. */ member
441 unsigned int i = (grp->front + slot) % QFQ_MAX_SLOTS; in qfq_slot_insert()
454 struct qfq_class **h = &grp->slots[grp->front]; in qfq_front_slot_remove()
477 grp->front = (grp->front + i) % QFQ_MAX_SLOTS; in qfq_slot_scan()
481 return grp->slots[grp->front]; in qfq_slot_scan()
500 grp->front = (grp->front - i) % QFQ_MAX_SLOTS; in qfq_slot_rotate()
567 cl = grp->slots[grp->front]; in qfq_dequeue()
724 i = (grp->front + offset) % QFQ_MAX_SLOTS;
779 } else if (!grp->slots[grp->front]) {
/freebsd-12.1/contrib/binutils/bfd/
H A Dtekhex.c731 char front[6]; in out() local
734 front[0] = '%'; in out()
735 TOHEX (front + 1, end - start + 5); in out()
736 front[3] = type; in out()
741 sum += sum_block[(unsigned char) front[1]]; /* Length. */ in out()
742 sum += sum_block[(unsigned char) front[2]]; in out()
743 sum += sum_block[(unsigned char) front[3]]; /* Type. */ in out()
744 TOHEX (front + 4, sum); in out()
745 if (bfd_bwrite (front, (bfd_size_type) 6, abfd) != 6) in out()
/freebsd-12.1/contrib/llvm/lib/CodeGen/AsmPrinter/
H A DDebugLocStream.h127 assert(&Lists.front() <= &L && &L <= &Lists.back() && in getIndex()
129 return &L - &Lists.front(); in getIndex()
132 assert(&Entries.front() <= &E && &E <= &Entries.back() && in getIndex()
134 return &E - &Entries.front(); in getIndex()
/freebsd-12.1/contrib/llvm/tools/clang/lib/AST/
H A DComparisonCategories.cpp63 if (Lookup.size() != 1 || !isa<VarDecl>(Lookup.front())) in lookupValueInfo()
65 Objects.emplace_back(ValueKind, cast<VarDecl>(Lookup.front())); in lookupValueInfo()
75 StdNS = dyn_cast<NamespaceDecl>(Lookup.front()); in lookupStdNamespace()
86 if (CXXRecordDecl *RD = dyn_cast<CXXRecordDecl>(Lookup.front())) in lookupCXXRecordDecl()
/freebsd-12.1/contrib/llvm/include/llvm/CodeGen/
H A DMachineOutliner.h107 MachineBasicBlock::iterator &front() { return FirstInst; } in front() function
151 std::for_each(MBB->rbegin(), (MachineBasicBlock::reverse_iterator)front(), in initLRU()
157 std::for_each(front(), std::next(back()), in initLRU()
/freebsd-12.1/sys/contrib/ck/src/
H A Dck_barrier_combining.c41 struct ck_barrier_combining_group *front = NULL; in ck_barrier_combining_queue_dequeue() local
44 front = queue->head; in ck_barrier_combining_queue_dequeue()
48 return front; in ck_barrier_combining_queue_dequeue()
/freebsd-12.1/contrib/llvm/lib/CodeGen/
H A DSjLjEHPrepare.cpp173 BasicBlock *EntryBB = &F.front(); in setupFunctionContext()
181 nullptr, Align, "fn_context", &EntryBB->front()); in setupFunctionContext()
232 assert(AfterAllocaInsPt != F.front().end()); in lowerIncomingArguments()
345 LPI->moveBefore(&UnwindBlock->front()); in lowerAcrossUnwindEdges()
384 BasicBlock *EntryBB = &F.front(); in setupEntryBlockAndCallSites()
432 if (&BB == &F.front()) in setupEntryBlockAndCallSites()
447 if (&BB == &F.front()) in setupEntryBlockAndCallSites()

12345678910>>...30