/freebsd-12-stable/contrib/bmake/lst.lib/ |
H A D | lstAtFront.c | 50 * Add a node at the front of the list 58 * Place a piece of data at the front of a list 64 * A new ListNode is created and stuck at the front of the list. 72 LstNode front; local 74 front = Lst_First(l); 75 return Lst_InsertBefore(l, front, d);
|
/freebsd-12-stable/usr.bin/look/ |
H A D | look.c | 108 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-12-stable/contrib/ntp/ntpd/ |
H A D | ntp_prio_q.c | 41 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-12-stable/contrib/openresolv/ |
H A D | dnsmasq.in | 97 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-stable/contrib/llvm-project/clang/lib/Driver/ |
H A D | Tool.cpp | 31 ConstructJob(C, JA, Outputs.front(), Inputs, TCArgs, LinkingOutput);
|
H A D | Multilib.cpp | 46 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-12-stable/cddl/usr.sbin/zfsd/ |
H A D | callout.cc | 137 if (s_activeCallouts.front() == this) { 172 Callout *cur(s_activeCallouts.front()); 177 && timerisset(&s_activeCallouts.front()->m_interval) == 0); 180 Callout *next(s_activeCallouts.front());
|
/freebsd-12-stable/contrib/llvm-project/llvm/lib/Target/NVPTX/ |
H A D | NVPTXFrameLowering.cpp | 35 assert(&MF.front() == &MBB && "Shrink-wrapping not yet supported"); 36 MachineInstr *MI = &MBB.front();
|
/freebsd-12-stable/contrib/llvm-project/clang/include/clang/Driver/ |
H A D | Multilib.h | 47 (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-12-stable/contrib/llvm-project/clang/lib/Basic/Targets/ |
H A D | AMDGPU.h | 132 if (S.front() == '{') { 138 if (S.front() != 'v' && S.front() != 's') { 162 if (!S.empty() && S.front() == '[') { 169 if (!S.empty() && S.front() == ':') { 178 if (S.empty() || S.front() != ']') 182 if (S.empty() || S.front() != '}')
|
/freebsd-12-stable/contrib/llvm-project/llvm/include/llvm/CodeGen/ |
H A D | MachineOutliner.h | 106 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-12-stable/sys/contrib/ck/src/ |
H A D | ck_barrier_combining.c | 41 struct ck_barrier_combining_group *front = NULL; local 44 front = queue->head; 48 return front;
|
/freebsd-12-stable/contrib/llvm-project/lldb/source/Interpreter/ |
H A D | OptionValueString.cpp | 52 switch (value.front()) { 55 if (value.size() <= 1 || value.back() != value.front()) {
|
/freebsd-12-stable/contrib/llvm-project/llvm/lib/DebugInfo/CodeView/ |
H A D | TypeRecordHelpers.cpp | 51 return Refs.front();
|
/freebsd-12-stable/contrib/llvm-project/clang/include/clang/AST/ |
H A D | CXXInheritance.h | 196 CXXBasePath& front() { return Paths.front(); } function in class:clang::CXXBasePaths 197 const CXXBasePath& front() const { return Paths.front(); } function in class:clang::CXXBasePaths
|
/freebsd-12-stable/contrib/nvi/ex/ |
H A D | ex_tag.c | 1036 char *back, *front, *map, *p, *search, *t; local 1056 front = map; 1057 back = front + sb.st_size; 1058 front = binary_search(tname, front, back); 1059 front = linear_search(tname, front, back, tl); 1060 if (front == NULL) 1082 for (p = front; p < back && *p != '\n'; ++p); 1089 p = front; 1244 binary_search(char *string, char *front, char *back) argument 1274 linear_search(char *string, char *front, char *back, long tl) argument [all...] |
/freebsd-12-stable/contrib/llvm-project/llvm/include/llvm/ADT/ |
H A D | DirectedGraph.h | 101 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 D | BreadthFirstIterator.h | 78 Optional<QueueElement> Head = VisitQueue.front(); 96 Head = VisitQueue.front(); 125 const NodeRef &operator*() const { return VisitQueue.front()->first; }
|
/freebsd-12-stable/contrib/llvm-project/llvm/lib/Transforms/Utils/ |
H A D | UnifyFunctionExitNodes.cpp | 67 UnreachableBlock = UnreachableBlocks.front(); 84 ReturnBlock = ReturningBlocks.front(); // Already has a single return block
|
/freebsd-12-stable/sys/contrib/zstd/contrib/pzstd/test/ |
H A D | RoundTrip.h | 61 std::string source = options.inputFiles.front(); 78 options.inputFiles.front() = compressedFile;
|
/freebsd-12-stable/contrib/llvm-project/lldb/source/Plugins/Process/Utility/ |
H A D | UnwindMacOSXFrameBackchain.cpp | 116 lldb::addr_t first_frame_pc = m_cursors.front().pc; 144 cursor.fp = m_cursors.front().fp; 150 m_cursors.front().fp = first_frame_sp; 207 lldb::addr_t first_frame_pc = m_cursors.front().pc; 234 cursor.fp = m_cursors.front().fp; 240 m_cursors.front().fp = first_frame_sp;
|
/freebsd-12-stable/contrib/libstdc++/include/bits/ |
H A D | stl_queue.h | 87 * that supports @c front, @c back, @c push_back, and @c pop_front, 154 front() function in class:queue 157 return c.front(); 165 front() const function in class:queue 168 return c.front(); 298 * any type that supports @c front(), @c push_back, @c pop_back, 401 return c.front();
|
/freebsd-12-stable/contrib/llvm-project/clang/lib/StaticAnalyzer/Checkers/ |
H A D | CloneChecker.cpp | 103 S.front(), ACtx.getSourceManager(), 118 *BT_Exact, "Duplicate code detected", makeLocation(Group.front(), Mgr)); 119 R->addRange(Group.front().getSourceRange());
|
/freebsd-12-stable/contrib/llvm-project/clang/include/clang/Sema/ |
H A D | TemplateDeduction.h | 104 PD.first = SuppressedDiagnostics.front().first; 105 PD.second.swap(SuppressedDiagnostics.front().second); 118 return SuppressedDiagnostics.front();
|
/freebsd-12-stable/contrib/llvm-project/llvm/lib/Transforms/Vectorize/ |
H A D | VPlanPredicator.cpp | 80 // 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();
|