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

123456789

/freebsd-9.3-release/contrib/bmake/lst.lib/
H A DlstAtFront.c50 * 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-9.3-release/usr.bin/look/
H A Dlook.c96 unsigned char *back, *front; local
143 if ((front = mmap(NULL, (size_t)sb.st_size, PROT_READ, MAP_SHARED, fd, (off_t)0)) == MAP_FAILED)
145 back = front + sb.st_size;
146 match *= (look(key, front, back));
185 look(wchar_t *string, unsigned char *front, unsigned char *back) argument
188 front = binary_search(string, front, back);
189 front = linear_search(string, front, back);
191 if (front)
239 binary_search(wchar_t *string, unsigned char *front, unsigned char *back) argument
273 linear_search(wchar_t *string, unsigned char *front, unsigned char *back) argument
293 print_from(wchar_t *string, unsigned char *front, unsigned char *back) argument
[all...]
/freebsd-9.3-release/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-9.3-release/contrib/llvm/include/llvm/MC/
H A DMCFunction.h117 const MCBasicBlock *getEntryBlock() const { return front(); }
118 MCBasicBlock *getEntryBlock() { return front(); }
129 const MCBasicBlock* front() const { return Blocks.front(); } function in class:llvm::MCFunction
130 MCBasicBlock* front() { return Blocks.front(); } function in class:llvm::MCFunction
/freebsd-9.3-release/contrib/llvm/include/llvm/ADT/
H A DMapVector.h67 std::pair<KeyT, ValueT> &front() { return Vector.front(); } function in class:llvm::MapVector
68 const std::pair<KeyT, ValueT> &front() const { return Vector.front(); } function in class:llvm::MapVector
H A DTinyPtrVector.h57 Val = RHS.front();
66 Val.template get<VecTy*>()->push_back(RHS.front());
91 V->push_back(RHS.front());
166 EltTy front() const { function in class:llvm::TinyPtrVector
170 return Val.template get<VecTy*>()->front();
/freebsd-9.3-release/contrib/llvm/include/llvm/IR/
H A DBasicBlock.h205 inline const Instruction &front() const { return InstList.front(); } function in class:llvm::BasicBlock
206 inline Instruction &front() { return InstList.front(); } function in class:llvm::BasicBlock
H A DFunction.h380 const BasicBlock &getEntryBlock() const { return front(); }
381 BasicBlock &getEntryBlock() { return front(); }
402 const BasicBlock &front() const { return BasicBlocks.front(); } function in class:llvm::Function
403 BasicBlock &front() { return BasicBlocks.front(); } function in class:llvm::Function
/freebsd-9.3-release/contrib/llvm/tools/clang/include/clang/AST/
H A DCXXInheritance.h190 CXXBasePath& front() { return Paths.front(); } function in class:clang::CXXBasePaths
191 const CXXBasePath& front() const { return Paths.front(); } function in class:clang::CXXBasePaths
H A DCommentParser.h79 *B = &Toks.front();
/freebsd-9.3-release/contrib/llvm/tools/clang/lib/Serialization/
H A DGeneratePCH.cpp56 Out->write((char *)&Buffer.front(), Buffer.size());
/freebsd-9.3-release/contrib/llvm/include/llvm/CodeGen/
H A DMachineFunction.h326 const MachineBasicBlock &front() const { return BasicBlocks.front(); }
327 MachineBasicBlock &front() { return BasicBlocks.front(); }
474 return &F->front();
486 return &F->front();
511 return &G.Graph->front();
517 return &G.Graph->front();
/freebsd-9.3-release/contrib/libstdc++/include/bits/
H A Dstl_queue.h87 * 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-9.3-release/contrib/nvi/ex/
H A Dex_tag.c1198 char *back, *cname, *dname, *front, *map, *name, *p, *search, *t; local
1229 front = map;
1230 back = front + sb.st_size;
1231 front = binary_search(tname, front, back);
1232 front = linear_search(tname, front, back);
1233 if (front == NULL)
1255 for (p = front; p < back && *p != '\n'; ++p);
1262 p = front;
[all...]
/freebsd-9.3-release/contrib/llvm/lib/Transforms/Utils/
H A DUnifyFunctionExitNodes.cpp64 UnreachableBlock = UnreachableBlocks.front();
83 ReturnBlock = ReturningBlocks.front(); // Already has a single return block
/freebsd-9.3-release/contrib/llvm/lib/TableGen/
H A DError.cpp35 SrcMgr.PrintMessage(Loc.front(), Kind, Msg);
/freebsd-9.3-release/contrib/llvm/lib/Target/NVPTX/
H A DNVPTXFrameLowering.cpp33 MachineBasicBlock &MBB = MF.front();
/freebsd-9.3-release/contrib/llvm/tools/clang/utils/TableGen/
H A DClangCommentHTMLNamedCharacterReferenceEmitter.cpp63 SrcMgr.PrintMessage(Tag.getLoc().front(),
/freebsd-9.3-release/contrib/ntp/include/
H A Dntp_prio_q.h33 node * front; member in struct:Queue
/freebsd-9.3-release/contrib/binutils/bfd/
H A Dtekhex.c459 /* To the front of the file. */
731 char front[6]; local
734 front[0] = '%';
735 TOHEX (front + 1, end - start + 5);
736 front[3] = type;
741 sum += sum_block[(unsigned char) front[1]]; /* Length. */
742 sum += sum_block[(unsigned char) front[2]];
743 sum += sum_block[(unsigned char) front[3]]; /* Type. */
744 TOHEX (front + 4, sum);
745 if (bfd_bwrite (front, (bfd_size_typ
[all...]
/freebsd-9.3-release/contrib/llvm/lib/Target/Hexagon/
H A DHexagonCFGOptimizer.cpp178 IsUnconditionalJump(LayoutSucc->front().getOpcode())) {
180 LayoutSucc->front().getOperand(0).getMBB();
/freebsd-9.3-release/contrib/llvm/lib/Transforms/Scalar/
H A DSimplifyCFGPass.cpp86 if (Ret != &BB.front()) {
127 &RetBlock->front());
/freebsd-9.3-release/contrib/llvm/tools/clang/include/clang/Sema/
H A DTemplateDeduction.h69 PD.first = SuppressedDiagnostics.front().first;
70 PD.second.swap(SuppressedDiagnostics.front().second);
/freebsd-9.3-release/contrib/llvm/include/llvm/CodeGen/PBQP/
H A DHeuristicBase.h153 Graph::NodeId nId = optimalList.front();
/freebsd-9.3-release/sys/netpfil/ipfw/
H A Ddn_sched_qfq.c219 unsigned int front; /* Index of the front slot. */ member in struct:qfq_group
426 unsigned int i = (grp->front + slot) % QFQ_MAX_SLOTS;
439 struct qfq_class **h = &grp->slots[grp->front];
462 grp->front = (grp->front + i) % QFQ_MAX_SLOTS;
466 return grp->slots[grp->front];
484 grp->front = (grp->front - i) % QFQ_MAX_SLOTS;
550 cl = grp->slots[grp->front];
[all...]

Completed in 383 milliseconds

123456789