Home
last modified time | relevance | path

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

12345678910>>...32

/freebsd-13.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-13.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-13.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-13.1/contrib/llvm-project/clang/lib/Basic/Targets/
H A DAMDGPU.h168 if (S.front() == '{') { in validateAsmConstraint()
174 if (S.front() != 'v' && S.front() != 's' && S.front() != 'a') { in validateAsmConstraint()
198 if (!S.empty() && S.front() == '[') { in validateAsmConstraint()
205 if (!S.empty() && S.front() == ':') { in validateAsmConstraint()
214 if (S.empty() || S.front() != ']') in validateAsmConstraint()
218 if (S.empty() || S.front() != '}') in validateAsmConstraint()
416 assert(F.front() == '+' || F.front() == '-'); in handleTargetFeatures()
419 bool IsOn = F.front() == '+'; in handleTargetFeatures()
/freebsd-13.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-13.1/contrib/nvi/ex/
H A Dex_tag.c1050 front = map; in ctag_sfile()
1052 front = binary_search(tname, front, back); in ctag_sfile()
1053 front = linear_search(tname, front, back, tl); in ctag_sfile()
1083 p = front; in ctag_sfile()
1084 front = t; in ctag_sfile()
1241 p = front + (back - front) / 2; in binary_search()
1246 front = p; in binary_search()
1249 p = front + (back - front) / 2; in binary_search()
1252 return (front); in binary_search()
1271 end = tl && back-front > tl ? front+tl : back; in linear_search()
[all …]
/freebsd-13.1/contrib/llvm-project/llvm/include/llvm/ADT/
H A DDirectedGraph.h107 const EdgeType &front() const { return *Edges.front(); } in front() function
108 EdgeType &front() { return *Edges.front(); } in front() function
198 const NodeType &front() const { return *Nodes.front(); } in front() function
199 NodeType &front() { return *Nodes.front(); } in front() function
H A DBreadthFirstIterator.h81 Optional<QueueElement> Head = VisitQueue.front(); in toNext()
99 Head = VisitQueue.front(); in toNext()
126 const NodeRef &operator*() const { return VisitQueue.front()->first; }
/freebsd-13.1/contrib/llvm-project/llvm/include/llvm/Support/
H A DYAMLTraits.h555 StringRef Tail = (S.front() == '-' || S.front() == '+') ? S.drop_front() : S;
600 if (S.front() == '.') {
603 } else if (S.front() == 'e' || S.front() == 'E') {
615 if (S.front() == 'e' || S.front() == 'E') {
627 if (S.front() == '+' || S.front() == '-') {
657 if (isSpace(static_cast<unsigned char>(S.front())) ||
/freebsd-13.1/contrib/llvm-project/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()
93 assert(F.front() == '+' || F.front() == '-'); in flag()
/freebsd-13.1/cddl/usr.sbin/zfsd/
H A Dcallout.cc138 if (s_activeCallouts.front() == this) { in Reset()
173 Callout *cur(s_activeCallouts.front()); in ExpireCallouts()
178 && timerisset(&s_activeCallouts.front()->m_interval) == 0); in ExpireCallouts()
181 Callout *next(s_activeCallouts.front()); in ExpireCallouts()
/freebsd-13.1/contrib/llvm-project/llvm/include/llvm/Analysis/
H A DLoopNestAnalysis.h71 Loop &getOutermostLoop() const { return *Loops.front(); } in getOutermostLoop()
125 Loops.back()->getLoopDepth() - Loops.front()->getLoopDepth() + 1; in getNestDepth()
145 return Loops.front()->getHeader()->getParent(); in getParent()
148 StringRef getName() const { return Loops.front()->getName(); } in getName()
/freebsd-13.1/contrib/llvm-project/clang/lib/Driver/
H A DMultilib.cpp46 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()
/freebsd-13.1/contrib/llvm-project/llvm/lib/Target/X86/
H A DX86IndirectThunks.cpp83 MachineBasicBlock *Entry = &MF.front(); in populateThunk()
95 BuildMI(&MF.front(), DebugLoc(), TII->get(X86::LFENCE)); in populateThunk()
96 BuildMI(&MF.front(), DebugLoc(), TII->get(X86::JMP64r)).addReg(X86::R11); in populateThunk()
97 MF.front().addLiveIn(X86::R11); in populateThunk()
203 MachineBasicBlock *Entry = &MF.front(); in populateThunk()
/freebsd-13.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-13.1/contrib/llvm-project/clang/include/clang/AST/
H A DCXXInheritance.h187 CXXBasePath& front() { return Paths.front(); } in front() function
188 const CXXBasePath& front() const { return Paths.front(); } in front() function
/freebsd-13.1/contrib/llvm-project/llvm/lib/CodeGen/
H A DMachineOutliner.cpp461 Candidate &C = CandidatesForRepeatedSeq.front(); in emitNotOutliningCheaperRemark()
465 C.front()->getDebugLoc(), C.getMBB()); in emitNotOutliningCheaperRemark()
478 CandidatesForRepeatedSeq[i].front()->getDebugLoc()); in emitNotOutliningCheaperRemark()
503 OF.Candidates[i].front()->getDebugLoc()); in emitOutlinedFunctionRemark()
624 Candidate &FirstCand = OF.Candidates.front(); in createOutlinedFunction()
648 MachineFunction *OriginalMF = FirstCand.front()->getMF(); in createOutlinedFunction()
651 for (auto I = FirstCand.front(), E = std::next(FirstCand.back()); I != E; in createOutlinedFunction()
681 MachineBasicBlock &OutlineBB = *Cand.front()->getParent(); in createOutlinedFunction()
685 reverse(make_range(Cand.front(), OutlineBB.end()))) in createOutlinedFunction()
774 MachineBasicBlock::iterator StartIt = C.front(); in outline()
[all …]
/freebsd-13.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()
566 cl = grp->slots[grp->front]; in qfq_dequeue()
722 i = (grp->front + offset) % QFQ_MAX_SLOTS;
777 } else if (!grp->slots[grp->front]) {
/freebsd-13.1/contrib/unbound/services/
H A Dlisten_dnsport.c1310 front->cps = item; in listen_cp_insert()
1356 if(!front) in listen_create()
1358 front->cps = NULL; in listen_create()
1363 if(!front->udp_buff) { in listen_create()
1364 free(front); in listen_create()
1450 if(!front->cps) { in listen_create()
1452 listen_delete(front); in listen_create()
1456 return front; in listen_create()
1474 if(!front) in listen_delete()
1479 front->udp_buff != front->dnscrypt_udp_buff) { in listen_delete()
[all …]
/freebsd-13.1/sys/contrib/device-tree/src/arm/
H A Daspeed-bmc-inspur-fp5280g2.dts162 front-memory {
163 label = "front-memory";
167 front-syshot {
168 label = "front-syshot";
172 front-syshealth {
173 label = "front-syshealth";
177 front-fan {
178 label = "front-fan";
182 front-psu {
183 label = "front-psu";
/freebsd-13.1/contrib/llvm-project/clang/lib/AST/
H A DComparisonCategories.cpp83 if (Lookup.empty() || !isa<VarDecl>(Lookup.front())) in lookupValueInfo()
85 Objects.emplace_back(ValueKind, cast<VarDecl>(Lookup.front())); in lookupValueInfo()
95 StdNS = dyn_cast<NamespaceDecl>(Lookup.front()); in lookupStdNamespace()
106 if (CXXRecordDecl *RD = dyn_cast<CXXRecordDecl>(Lookup.front())) in lookupCXXRecordDecl()
/freebsd-13.1/contrib/llvm-project/llvm/lib/CodeGen/AsmPrinter/
H A DDebugLocStream.h129 assert(&Lists.front() <= &L && &L <= &Lists.back() && in getIndex()
131 return &L - &Lists.front(); in getIndex()
134 assert(&Entries.front() <= &E && &E <= &Entries.back() && in getIndex()
136 return &E - &Entries.front(); in getIndex()
/freebsd-13.1/contrib/llvm-project/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-13.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-13.1/contrib/opencsd/decoder/include/opencsd/etmv4/
H A Dtrc_etmv4_stack_elem.h311 TrcStackElem *front();
367 m_popped_elem.push_back(m_P0_stack.front()); in pop_front()
387 TrcStackElem* pElem = m_P0_stack.front(); in delete_front()
401 inline TrcStackElem *EtmV4P0Stack::front() in front() function
403 return m_P0_stack.front(); in front()

12345678910>>...32