Searched refs:front (Results 1 - 25 of 630) sorted by relevance

1234567891011>>

/freebsd-13-stable/usr.bin/look/
H A Dlook.c108 unsigned char *back, *front; local
158 if ((front = mmap(NULL, (size_t)sb.st_size, PROT_READ, MAP_SHARED, fd, (off_t)0)) == MAP_FAILED)
160 back = front + sb.st_size;
161 match *= (look(key, front, back));
200 look(wchar_t *string, unsigned char *front, unsigned char *back) argument
203 front = binary_search(string, front, back);
204 front = linear_search(string, front, back);
206 if (front)
254 binary_search(wchar_t *string, unsigned char *front, unsigned char *back) argument
288 linear_search(wchar_t *string, unsigned char *front, unsigned char *back) argument
308 print_from(wchar_t *string, unsigned char *front, unsigned char *back) argument
[all...]
/freebsd-13-stable/contrib/ntp/ntpd/
H A Dntp_prio_q.c41 my_queue->front = NULL;
59 while (my_queue->front != NULL) {
60 temp = my_queue->front;
61 my_queue->front = my_queue->front->node_next;
129 return (!my_queue || !my_queue->front);
138 if (NULL == q || NULL == q->front)
141 return q->front + 1;
156 node *j = my_queue->front;
165 new_node->node_next = my_queue->front;
[all...]
/freebsd-13-stable/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-stable/contrib/llvm-project/clang/lib/Driver/
H A DTool.cpp26 ConstructJob(C, JA, Outputs.front(), Inputs, TCArgs, LinkingOutput);
H A DMultilib.cpp46 if (seg.front() != '/') {
85 assert(GCCSuffix.empty() || (StringRef(GCCSuffix).front() == '/'));
93 if (Flag.front() == '+')
104 assert(StringRef(Flag).front() == '+' || StringRef(Flag).front() == '-');
146 if (Flag.front() == '+')
239 char Indicator = Flag.front();
/freebsd-13-stable/cddl/usr.sbin/zfsd/
H A Dcallout.cc138 if (s_activeCallouts.front() == this) {
173 Callout *cur(s_activeCallouts.front());
178 && timerisset(&s_activeCallouts.front()->m_interval) == 0);
181 Callout *next(s_activeCallouts.front());
/freebsd-13-stable/contrib/llvm-project/clang/include/clang/Driver/
H A DMultilib.h47 (StringRef(GCCSuffix).front() == '/' && GCCSuffix.size() > 1));
58 (StringRef(OSSuffix).front() == '/' && OSSuffix.size() > 1));
69 (StringRef(IncludeSuffix).front() == '/' && IncludeSuffix.size() > 1));
93 assert(F.front() == '+' || F.front() == '-');
/freebsd-13-stable/contrib/llvm-project/llvm/include/llvm/CodeGen/
H A DMachineOutliner.h106 MachineBasicBlock::iterator &front() { return FirstInst; } function in struct:llvm::outliner::Candidate
150 std::for_each(MBB->rbegin(), (MachineBasicBlock::reverse_iterator)front(),
156 std::for_each(front(), std::next(back()),
/freebsd-13-stable/sys/contrib/ck/src/
H A Dck_barrier_combining.c41 struct ck_barrier_combining_group *front = NULL; local
44 front = queue->head;
48 return front;
/freebsd-13-stable/contrib/llvm-project/lld/MachO/
H A DMergedOutputSection.h28 const InputSection *firstSection() const { return inputs.front(); }
H A DOutputSegment.h33 const OutputSection *firstSection() const { return sections.front(); }
/freebsd-13-stable/contrib/llvm-project/lldb/source/Interpreter/
H A DOptionValueString.cpp51 switch (value.front()) {
54 if (value.size() <= 1 || value.back() != value.front()) {
/freebsd-13-stable/contrib/llvm-project/clang/include/clang/AST/
H A DCXXInheritance.h196 CXXBasePath& front() { return Paths.front(); } function in class:clang::CXXBasePaths
197 const CXXBasePath& front() const { return Paths.front(); } function in class:clang::CXXBasePaths
/freebsd-13-stable/contrib/llvm-project/llvm/lib/DebugInfo/CodeView/
H A DTypeRecordHelpers.cpp51 return Refs.front();
/freebsd-13-stable/contrib/nvi/ex/
H A Dex_tag.c1030 char *back, *front, *map, *p, *search, *t; local
1050 front = map;
1051 back = front + sb.st_size;
1052 front = binary_search(tname, front, back);
1053 front = linear_search(tname, front, back, tl);
1054 if (front == NULL)
1076 for (p = front; p < back && *p != '\n'; ++p);
1083 p = front;
1237 binary_search(char *string, char *front, char *back) argument
1267 linear_search(char *string, char *front, char *back, long tl) argument
[all...]
/freebsd-13-stable/contrib/llvm-project/llvm/include/llvm/ADT/
H A DDirectedGraph.h101 const EdgeType &front() const { return *Edges.front(); } function in class:llvm::DGNode
102 EdgeType &front() { return *Edges.front(); } function in class:llvm::DGNode
192 const NodeType &front() const { return *Nodes.front(); } function in class:DirectedGraph
193 NodeType &front() { return *Nodes.front(); } function in class:DirectedGraph
H A DBreadthFirstIterator.h78 Optional<QueueElement> Head = VisitQueue.front();
96 Head = VisitQueue.front();
125 const NodeRef &operator*() const { return VisitQueue.front()->first; }
/freebsd-13-stable/contrib/llvm-project/llvm/include/llvm/Analysis/
H A DLoopNestAnalysis.h63 Loop &getOutermostLoop() const { return *Loops.front(); }
117 Loops.back()->getLoopDepth() - Loops.front()->getLoopDepth() + 1;
/freebsd-13-stable/contrib/llvm-project/clang/lib/Basic/Targets/
H A DAMDGPU.h158 if (S.front() == '{') {
164 if (S.front() != 'v' && S.front() != 's' && S.front() != 'a') {
188 if (!S.empty() && S.front() == '[') {
195 if (!S.empty() && S.front() == ':') {
204 if (S.empty() || S.front() != ']')
208 if (S.empty() || S.front() != '}')
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Transforms/Utils/
H A DUnifyFunctionExitNodes.cpp67 UnreachableBlock = UnreachableBlocks.front();
84 ReturnBlock = ReturningBlocks.front(); // Already has a single return block
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Target/NVPTX/
H A DNVPTXFrameLowering.cpp35 assert(&MF.front() == &MBB && "Shrink-wrapping not yet supported");
36 MachineInstr *MI = &MBB.front();
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Target/X86/
H A DX86IndirectThunks.cpp83 MachineBasicBlock *Entry = &MF.front();
95 BuildMI(&MF.front(), DebugLoc(), TII->get(X86::LFENCE));
96 BuildMI(&MF.front(), DebugLoc(), TII->get(X86::JMP64r)).addReg(X86::R11);
97 MF.front().addLiveIn(X86::R11);
204 MachineBasicBlock *Entry = &MF.front();
/freebsd-13-stable/contrib/llvm-project/clang/lib/StaticAnalyzer/Checkers/
H A DCloneChecker.cpp103 S.front(), ACtx.getSourceManager(),
118 *BT_Exact, "Duplicate code detected", makeLocation(Group.front(), Mgr));
119 R->addRange(Group.front().getSourceRange());
/freebsd-13-stable/contrib/llvm-project/clang/include/clang/Sema/
H A DTemplateDeduction.h104 PD.first = SuppressedDiagnostics.front().first;
105 PD.second.swap(SuppressedDiagnostics.front().second);
118 return SuppressedDiagnostics.front();
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Transforms/Vectorize/
H A DVPlanPredicator.cpp80 // We pop a pair of values from the front (e.g. P1 and P2), generate an OR
92 // Pop a pair of values from the front.
93 VPValue *LHS = Worklist.front();
95 VPValue *RHS = Worklist.front();
108 VPValue *Root = Worklist.front();

Completed in 289 milliseconds

1234567891011>>