| /NextBSD/usr.bin/look/ |
| HD | look.c | 106 unsigned char *back, *front; in main() local
156 if ((front = mmap(NULL, (size_t)sb.st_size, PROT_READ, MAP_SHARED, fd, (off_t)0)) == MAP_FAILED) in main()
158 back = front + sb.st_size; in main()
159 match *= (look(key, front, back)); in main()
198 look(wchar_t *string, unsigned char *front, unsigned char *back) in look() argument
201 front = binary_search(string, front, back); in look()
202 front = linear_search(string, front, back); in look()
204 if (front) in look()
205 print_from(string, front, back); in look()
206 return (front ? 0 : 1); in look()
[all …]
|
| /NextBSD/contrib/ntp/ntpd/ |
| HD | ntp_prio_q.c | 41 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()
165 new_node->node_next = my_queue->front; in enqueue()
166 my_queue->front = new_node; in enqueue()
[all …]
|
| /NextBSD/contrib/compiler-rt/lib/sanitizer_common/tests/ |
| HD | sanitizer_list_test.cc | 37 CHECK_EQ(l->front(), i1); in CheckList()
41 CHECK_EQ(l->front(), i2); in CheckList()
45 CHECK_EQ(l->front(), i3); in CheckList()
49 CHECK_EQ(l->front(), i4); in CheckList()
53 CHECK_EQ(l->front(), i5); in CheckList()
57 CHECK_EQ(l->front(), i6); in CheckList()
81 CHECK_EQ(l.front(), x); in TEST()
89 CHECK_EQ(l.front(), x); in TEST()
98 CHECK_EQ(l.front(), z); in TEST()
104 CHECK_EQ(l.front(), y); in TEST()
[all …]
|
| /NextBSD/contrib/openresolv/ |
| HD | dnsmasq.in | 98 SIFS=${IFS-y} OIFS=$IFS bytes= front= back=
118 front="$front byte:$byte1 byte:$byte2"
123 front="$front byte:0 byte:0"
125 front="${front}$back"
131 dbusdest="${dbusdest}$front string:$dn"
|
| /NextBSD/contrib/gcc/doc/ |
| HD | languages.texi | 8 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.
|
| HD | sourcebuild.texi | 42 front end.
47 language front ends, and testsuites. @xref{gcc Directory, , The
85 The @code{zlib} compression library, used by the Java front end and as
112 * Front End:: Anatomy of a language front end.
212 front-end-specific configuration. @xref{Front End Config, , The Front
321 The manuals for GCC as a whole, and the C and C++ front ends, are in
322 files @file{doc/*.texi}. Other front ends have their own manuals in
434 Details of a few changes to the GCC front-end interface. FIXME: the
436 the front-end interface in this manual.
453 A front end for a language in GCC has the following parts:
[all …]
|
| /NextBSD/contrib/binutils/bfd/doc/ |
| HD | bfd.texinfo | 88 * BFD front end:: BFD front end
94 @node Overview, BFD front end, Top, Top
103 BFD is split into two parts: the front end, and the back ends (one for
106 @item The front end of BFD provides the interface to the user. It manages
107 memory and various canonical data structures. The front end also
110 end provides a set of calls which the BFD front end can use to maintain
198 @node BFD front end, BFD back ends, Overview, Top
221 @node Memory Usage, Initialization, BFD front end, BFD front end
244 @node Initialization, Sections, Memory Usage, BFD front end
247 @node Sections, Symbols, Initialization, BFD front end
[all …]
|
| /NextBSD/contrib/unbound/services/ |
| HD | listen_dnsport.c | 939 listen_cp_insert(struct comm_point* c, struct listen_dnsport* front) in listen_cp_insert() argument
946 item->next = front->cps; in listen_cp_insert()
947 front->cps = item; in listen_cp_insert()
956 struct listen_dnsport* front = (struct listen_dnsport*) in listen_create() local
958 if(!front) in listen_create()
960 front->cps = NULL; in listen_create()
961 front->udp_buff = sldns_buffer_new(bufsize); in listen_create()
962 if(!front->udp_buff) { in listen_create()
963 free(front); in listen_create()
972 front->udp_buff, cb, cb_arg); in listen_create()
[all …]
|
| /NextBSD/contrib/file/magic/Magdir/ |
| HD | dolby | 29 >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,
|
| /NextBSD/contrib/nvi/ex/ |
| HD | ex_tag.c | 1036 char *back, *front, *map, *p, *search, *t; in ctag_sfile() local
1056 front = map; in ctag_sfile()
1057 back = front + sb.st_size; in ctag_sfile()
1058 front = binary_search(tname, front, back); in ctag_sfile()
1059 front = linear_search(tname, front, back, tl); in ctag_sfile()
1060 if (front == NULL) in ctag_sfile()
1082 for (p = front; p < back && *p != '\n'; ++p); in ctag_sfile()
1089 p = front; in ctag_sfile()
1090 front = t; in ctag_sfile()
1244 binary_search(char *string, char *front, char *back) in binary_search() argument
[all …]
|
| /NextBSD/contrib/bmake/lst.lib/ |
| HD | lstAtFront.c | 72 LstNode front; in Lst_AtFront() local
74 front = Lst_First(l); in Lst_AtFront()
75 return (Lst_InsertBefore(l, front, d)); in Lst_AtFront()
|
| /NextBSD/contrib/llvm/tools/clang/include/clang/Driver/ |
| HD | Multilib.h | 44 (StringRef(GCCSuffix).front() == '/' && GCCSuffix.size() > 1)); in gccSuffix()
54 (StringRef(OSSuffix).front() == '/' && OSSuffix.size() > 1)); in osSuffix()
64 (StringRef(IncludeSuffix).front() == '/' && IncludeSuffix.size() > 1)); in includeSuffix()
76 assert(F.front() == '+' || F.front() == '-'); in flag()
|
| /NextBSD/contrib/llvm/include/llvm/CodeGen/ |
| HD | MachineFunction.h | 348 const MachineBasicBlock &front() const { return BasicBlocks.front(); }
349 MachineBasicBlock &front() { return BasicBlocks.front(); }
505 return &F->front();
517 return &F->front();
542 return &G.Graph->front();
548 return &G.Graph->front();
|
| /NextBSD/contrib/llvm/tools/clang/lib/Driver/ |
| HD | Multilib.cpp | 52 if (seg.front() != '/') { in normalizePathSegment()
86 assert(GCCSuffix.empty() || (StringRef(GCCSuffix).front() == '/')); in print()
94 if (Flag.front() == '+') in print()
105 assert(StringRef(Flag).front() == '+' || StringRef(Flag).front() == '-'); in isValid()
147 if (Flag.front() == '+') in Maybe()
240 char Indicator = Flag.front(); in isFlagEnabled()
|
| /NextBSD/contrib/llvm/tools/lldb/source/Plugins/Process/Utility/ |
| HD | UnwindMacOSXFrameBackchain.cpp | 132 lldb::addr_t first_frame_pc = m_cursors.front().pc; in GetStackFrameData_i386()
162 cursor.fp = m_cursors.front().fp; in GetStackFrameData_i386()
168 m_cursors.front().fp = first_frame_sp; in GetStackFrameData_i386()
231 lldb::addr_t first_frame_pc = m_cursors.front().pc; in GetStackFrameData_x86_64()
261 cursor.fp = m_cursors.front().fp; in GetStackFrameData_x86_64()
267 m_cursors.front().fp = first_frame_sp; in GetStackFrameData_x86_64()
|
| /NextBSD/contrib/libstdc++/include/bits/ |
| D | stl_queue.h | 154 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()
|
| /NextBSD/contrib/wpa/src/p2p/ |
| HD | p2p_build.c | 527 size_t front = remaining; in p2p_buf_add_service_info() local
528 size_t back = sizeof(u32) + sizeof(u16) + sizeof(u8) - front; in p2p_buf_add_service_info()
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()
[all …]
|
| /NextBSD/contrib/llvm/tools/clang/include/clang/AST/ |
| HD | CXXInheritance.h | 190 CXXBasePath& front() { return Paths.front(); } in front() function
191 const CXXBasePath& front() const { return Paths.front(); } in front() function
|
| /NextBSD/sys/netpfil/ipfw/ |
| HD | dn_sched_qfq.c | 217 unsigned int front; /* Index of the front slot. */ member
428 unsigned int i = (grp->front + slot) % QFQ_MAX_SLOTS; in qfq_slot_insert()
441 struct qfq_class **h = &grp->slots[grp->front]; in qfq_front_slot_remove()
464 grp->front = (grp->front + i) % QFQ_MAX_SLOTS; in qfq_slot_scan()
468 return grp->slots[grp->front]; in qfq_slot_scan()
486 grp->front = (grp->front - i) % QFQ_MAX_SLOTS; in qfq_slot_rotate()
552 cl = grp->slots[grp->front]; in qfq_dequeue()
709 i = (grp->front + offset) % QFQ_MAX_SLOTS;
764 } else if (!grp->slots[grp->front]) {
|
| /NextBSD/contrib/binutils/bfd/ |
| HD | tekhex.c | 731 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()
|
| /NextBSD/contrib/llvm/lib/CodeGen/AsmPrinter/ |
| HD | DebugLocStream.h | 127 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()
|
| /NextBSD/contrib/llvm/include/llvm/IR/ |
| HD | BasicBlock.h | 243 inline const Instruction &front() const { return InstList.front(); }
244 inline Instruction &front() { return InstList.front(); }
|
| HD | Function.h | 442 const BasicBlock &getEntryBlock() const { return front(); }
443 BasicBlock &getEntryBlock() { return front(); }
464 const BasicBlock &front() const { return BasicBlocks.front(); }
465 BasicBlock &front() { return BasicBlocks.front(); }
|
| /NextBSD/contrib/llvm/include/llvm/ADT/ |
| HD | TinyPtrVector.h | 58 Val = RHS.front();
67 Val.template get<VecTy*>()->push_back(RHS.front());
91 V->push_back(RHS.front());
182 EltTy front() const { in front() function
186 return Val.template get<VecTy*>()->front(); in front()
|
| /NextBSD/share/termcap/ |
| HD | README | 15 common to most common, since the move commands will move them to the front
16 in that order, the effect will be to put the most common at the front of
18 although they don't have to go to the front, they are probably quite
19 common and really should go near the front.
|