Home
last modified time | relevance | path

Searched refs:ilist (Results 1 – 25 of 26) sorted by relevance

12

/external/linux-tools-perf/perf-3.12.0/tools/perf/util/
Dintlist.c29 static void int_node__delete(struct int_node *ilist) in int_node__delete() argument
31 free(ilist); in int_node__delete()
50 int intlist__add(struct intlist *ilist, int i) in intlist__add() argument
52 return rblist__add_node(&ilist->rblist, (void *)((long)i)); in intlist__add()
55 void intlist__remove(struct intlist *ilist, struct int_node *node) in intlist__remove() argument
57 rblist__remove_node(&ilist->rblist, &node->rb_node); in intlist__remove()
60 struct int_node *intlist__find(struct intlist *ilist, int i) in intlist__find() argument
65 if (ilist == NULL) in intlist__find()
69 rb_node = rblist__find(&ilist->rblist, (void *)((long)i)); in intlist__find()
76 static int intlist__parse_list(struct intlist *ilist, const char *s) in intlist__parse_list() argument
[all …]
Dintlist.h19 void intlist__delete(struct intlist *ilist);
21 void intlist__remove(struct intlist *ilist, struct int_node *in);
22 int intlist__add(struct intlist *ilist, int i);
24 struct int_node *intlist__entry(const struct intlist *ilist, unsigned int idx);
25 struct int_node *intlist__find(struct intlist *ilist, int i);
27 static inline bool intlist__has_entry(struct intlist *ilist, int i) in intlist__has_entry() argument
29 return intlist__find(ilist, i) != NULL; in intlist__has_entry()
32 static inline bool intlist__empty(const struct intlist *ilist) in intlist__empty() argument
34 return rblist__empty(&ilist->rblist); in intlist__empty()
37 static inline unsigned int intlist__nr_entries(const struct intlist *ilist) in intlist__nr_entries() argument
[all …]
/external/llvm/unittests/ADT/
DilistTest.cpp29 ilist<Node> List; in TEST()
40 const ilist<Node> &ConstList = List; in TEST()
47 ilist<Node> List; in TEST()
67 ilist<Node> List; in TEST()
74 ilist<Node>::iterator E = List.end(); in TEST()
/external/chromium_org/tools/ipc_fuzzer/mutate/
Dmutate.cc504 #define IPC_MESSAGE_DECL(kind, type, name, in, out, ilist, olist) \ argument
505 IPC_##kind##_##type##_FUZZ(name, in, out, ilist, olist)
507 #define IPC_EMPTY_CONTROL_FUZZ(name, in, out, ilist, olist) \ argument
512 #define IPC_EMPTY_ROUTED_FUZZ(name, in, out, ilist, olist) \ argument
517 #define IPC_ASYNC_CONTROL_FUZZ(name, in, out, ilist, olist) \ argument
520 IPC_TUPLE_IN_##in ilist p; \
526 #define IPC_ASYNC_ROUTED_FUZZ(name, in, out, ilist, olist) \ argument
529 IPC_TUPLE_IN_##in ilist p; \
537 #define IPC_SYNC_CONTROL_FUZZ(name, in, out, ilist, olist) \ argument
540 IPC_TUPLE_IN_##in ilist p; \
[all …]
Dgenerate.cc1193 #define IPC_MESSAGE_DECL(kind, type, name, in, out, ilist, olist) \ argument
1194 IPC_##kind##_##type##_GENERATE(name, in, out, ilist, olist)
1196 #define IPC_EMPTY_CONTROL_GENERATE(name, in, out, ilist, olist) \ argument
1201 #define IPC_EMPTY_ROUTED_GENERATE(name, in, out, ilist, olist) \ argument
1206 #define IPC_ASYNC_CONTROL_GENERATE(name, in, out, ilist, olist) \ argument
1208 IPC_TUPLE_IN_##in ilist p; \
1216 #define IPC_ASYNC_ROUTED_GENERATE(name, in, out, ilist, olist) \ argument
1218 IPC_TUPLE_IN_##in ilist p; \
1228 #define IPC_SYNC_CONTROL_GENERATE(name, in, out, ilist, olist) \ argument
1230 IPC_TUPLE_IN_##in ilist p; \
[all …]
/external/llvm/include/llvm/Analysis/
DIVUsers.h130 ilist<IVStrideUse> IVUses;
160 typedef ilist<IVStrideUse>::iterator iterator;
161 typedef ilist<IVStrideUse>::const_iterator const_iterator;
DAliasSetTracker.h297 ilist<AliasSet> AliasSets;
350 const ilist<AliasSet> &getAliasSets() const { return AliasSets; }
392 typedef ilist<AliasSet>::iterator iterator;
393 typedef ilist<AliasSet>::const_iterator const_iterator;
/external/llvm/include/llvm/ADT/
Dilist.h640 struct ilist : public iplist<NodeTy> {
644 ilist() {}
645 ilist(const ilist &right) {
648 explicit ilist(size_type count) {
651 ilist(size_type count, const NodeTy &val) {
654 template<class InIt> ilist(InIt first, InIt last) {
DSparseBitVector.h284 typedef ilist<SparseBitVectorElement<ElementSize> > ElementList;
/external/chromium_org/tools/ipc_fuzzer/message_lib/
Dmessage_names.cc10 #define IPC_MESSAGE_DECL(kind, type, name, in, out, ilist, olist) \ argument
/external/clang/include/clang/StaticAnalyzer/Core/BugReporter/
DBugReporter.h345 llvm::ilist<BugReport> Reports;
358 typedef llvm::ilist<BugReport>::iterator iterator;
359 typedef llvm::ilist<BugReport>::const_iterator const_iterator;
/external/llvm/test/Transforms/DeadStoreElimination/
D2011-09-06-MemCpy.ll24 …plist.20, %struct.iplist.16, %struct.iplist.12, %struct.vector.2, %struct.ilist, %struct.basic_str…
44 %struct.ilist = type { %struct.iplist.8 }
/external/llvm/include/llvm/IR/
DModule.h126 typedef ilist<NamedMDNode> NamedMDListType;
512 static ilist<NamedMDNode> Module::*getSublistAccess(NamedMDNode*) {
/external/chromium_org/tools/ipc_fuzzer/ipclist/
Dipclist.cc30 #define IPC_MESSAGE_DECL(kind, type, name, in, out, ilist, olist) \ argument
/external/chromium_org/content/renderer/input/
Dinput_event_filter.cc28 #define IPC_MESSAGE_DECL(kind, type, name, in, out, ilist, olist) \ argument
/external/llvm/test/CodeGen/PowerPC/
Dpr15031.ll35 %"class.llvm::MachineBasicBlock" = type { %"class.llvm::ilist_node.0", %"struct.llvm::ilist", %"cla…
38 %"struct.llvm::ilist" = type { %"class.llvm::iplist" }
53 …t.11", %"class.llvm::iplist.20", %"class.llvm::iplist.29", %"struct.llvm::ilist.38", %"class.std::…
68 %"struct.llvm::ilist.38" = type { %"class.llvm::iplist.39" }
88 …%"class.llvm::ArrayRecycler", %"class.llvm::Recycler.180", %"struct.llvm::ilist.181", i32, i32, i8…
249 %"struct.llvm::ilist.181" = type { %"class.llvm::iplist.182" }
/external/llvm/docs/HistoricalNotes/
D2002-06-25-MegaPatchInfo.txt22 Next & Previous fields). The containers are now instances of ilist (intrusive
/external/llvm/lib/Analysis/
DIVUsers.cpp277 for (ilist<IVStrideUse>::const_iterator UI = IVUses.begin(), in print()
/external/llvm/include/llvm/CodeGen/
DSelectionDAG.h182 ilist<SDNode> AllNodes;
311 typedef ilist<SDNode>::const_iterator allnodes_const_iterator;
314 typedef ilist<SDNode>::iterator allnodes_iterator;
317 ilist<SDNode>::size_type allnodes_size() const {
DMachineFunction.h116 typedef ilist<MachineBasicBlock> BasicBlockListType;
DSlotIndexes.h337 typedef ilist<IndexListEntry> IndexList;
DMachineBasicBlock.h63 typedef ilist<MachineInstr> Instructions;
/external/llvm/test/CodeGen/X86/
Dmisched-aa-colored.ll17 …90", %"class.llvm::SDValue.3.603.963.1923.2043.2283.4083", %"struct.llvm::ilist.55.655.1015.1975.2…
61 %"struct.llvm::ilist.55.655.1015.1975.2095.2335.4135" = type { %"class.llvm::iplist.54.654.1014.197…
/external/llvm/docs/
DProgrammersManual.rst798 llvm/ADT/ilist.h
801 ``ilist<T>`` implements an 'intrusive' doubly-linked list. It is intrusive,
805 ``ilist`` has the same drawbacks as ``std::list``, and additionally requires an
809 list, and ``ilist``\ s are guaranteed to support a constant-time splice
813 basic blocks, which is why these are implemented with ``ilist``\ s.
861 ``ilist_traits<T>`` is ``ilist<T>``'s customization mechanism. ``iplist<T>``
862 (and consequently ``ilist<T>``) publicly derive from this traits class.
869 ``iplist<T>`` is ``ilist<T>``'s base and as such supports a slightly narrower
881 by the ``ilist<T>`` (and analogous containers) in the default manner.
891 ``ilist``\ s have another specialty that must be considered. To be a good
[all …]
/external/llvm/test/Transforms/IndVarSimplify/
D2004-04-05-InvokeCastCrash.ll24 …%"struct.llvm::MachineBasicBlock" = type { %"struct.llvm::ilist<llvm::MachineInstr>", %"struct.llv…
54 …%"struct.llvm::ilist<llvm::MachineInstr>" = type { %"struct.llvm::iplist<llvm::MachineInstr,llvm::…

12