| /external/linux-tools-perf/src/tools/perf/util/ |
| intlist.h | 19 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)
29 return intlist__find(ilist, i) != NULL;
32 static inline bool intlist__empty(const struct intlist *ilist)
34 return rblist__empty(&ilist->rblist);
37 static inline unsigned int intlist__nr_entries(const struct intlist *ilist)
[all...] |
| intlist.c | 29 static void int_node__delete(struct int_node *ilist)
31 free(ilist);
50 int intlist__add(struct intlist *ilist, int i)
52 return rblist__add_node(&ilist->rblist, (void *)((long)i));
55 void intlist__remove(struct intlist *ilist, struct int_node *node)
57 rblist__remove_node(&ilist->rblist, &node->rb_node);
60 struct int_node *intlist__find(struct intlist *ilist, int i)
65 if (ilist == NULL)
69 rb_node = rblist__find(&ilist->rblist, (void *)((long)i));
76 static int intlist__parse_list(struct intlist *ilist, const char *s
97 struct intlist *ilist = malloc(sizeof(*ilist)); local
[all...] |
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/site-packages/setoolsgui/networkx/generators/ |
| random_clustered.py | 102 ilist = []
107 ilist.append(n)
111 if len(ilist)%2 != 0 or len(tlist)%3 != 0:
114 random.shuffle(ilist)
116 while ilist:
117 G.add_edge(ilist.pop(),ilist.pop())
|
| /external/llvm/unittests/ADT/ |
| ilistTest.cpp | 10 #include "llvm/ADT/ilist.h"
30 ilist<Node> List;
41 const ilist<Node> &ConstList = List;
48 ilist<Node> List;
68 ilist<Node> List;
75 ilist<Node>::iterator E = List.end();
|
| /frameworks/compile/mclinker/include/mcld/Support/ |
| GCFactoryListTraits.h | 12 #include <llvm/ADT/ilist.h>
|
| /external/llvm/include/llvm/Analysis/ |
| IVUsers.h | 129 ilist<IVStrideUse> IVUses;
159 typedef ilist<IVStrideUse>::iterator iterator;
160 typedef ilist<IVStrideUse>::const_iterator const_iterator;
|
| AliasSetTracker.h | 21 #include "llvm/ADT/ilist.h"
216 // Can only be created by AliasSetTracker. Also, ilist creates one
296 ilist<AliasSet> AliasSets;
349 const ilist<AliasSet> &getAliasSets() const { return AliasSets; }
395 typedef ilist<AliasSet>::iterator iterator;
396 typedef ilist<AliasSet>::const_iterator const_iterator;
|
| /frameworks/compile/mclinker/include/mcld/LD/ |
| SectionData.h | 17 #include <llvm/ADT/ilist.h>
|
| RelocData.h | 19 #include <llvm/ADT/ilist.h>
|
| /frameworks/compile/mclinker/include/mcld/ADT/ |
| ilist_sort.h | 12 #include <llvm/ADT/ilist.h>
|
| /external/llvm/include/llvm/ADT/ |
| ilist.h | 1 //==-- llvm/ADT/ilist.h - Intrusive Linked List Template ---------*- C++ -*-==//
19 // The ilist class itself, should be a plug in replacement for list, assuming
24 // The ilist class is implemented by allocating a 'tail' node when the list is
73 /// strategy. The sentinel is stored in the prev field of ilist's Head.
83 /// provideInitialHead - when constructing an ilist, provide a starting
215 assert(NodePtr && "--'d off the beginning of an ilist!");
451 // an ilist (and potentially deleted) with iterators still pointing at it.
586 struct ilist : public iplist<NodeTy> { struct in namespace:llvm
590 ilist() {} function in struct:llvm::ilist
591 ilist(const ilist &right) function in struct:llvm::ilist
594 explicit ilist(size_type count) { function in struct:llvm::ilist
597 ilist(size_type count, const NodeTy &val) { function in struct:llvm::ilist
600 template<class InIt> ilist(InIt first, InIt last) { function in struct:llvm::ilist
[all...] |
| SparseBitVector.h | 18 #include "llvm/ADT/ilist.h"
264 typedef ilist<SparseBitVectorElement<ElementSize> > ElementList;
|
| /frameworks/compile/mclinker/include/mcld/Target/ |
| TargetLDBackend.h | 17 #include <llvm/ADT/ilist.h>
|
| /external/clang/include/clang/StaticAnalyzer/Core/BugReporter/ |
| BugReporter.h | 28 #include "llvm/ADT/ilist.h"
345 llvm::ilist<BugReport> Reports;
361 typedef llvm::ilist<BugReport>::iterator iterator;
362 typedef llvm::ilist<BugReport>::const_iterator const_iterator;
|
| /external/llvm/include/llvm/IR/ |
| Module.h | 125 typedef ilist<NamedMDNode> NamedMDListType;
536 static ilist<NamedMDNode> Module::*getSublistAccess(NamedMDNode*) {
|
| /external/llvm/include/llvm/CodeGen/ |
| MachineFunction.h | 21 #include "llvm/ADT/ilist.h"
127 typedef ilist<MachineBasicBlock> BasicBlockListType;
|
| SelectionDAG.h | 21 #include "llvm/ADT/ilist.h"
190 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 {
[all...] |
| MachineBasicBlock.h | 63 typedef ilist<MachineInstr> Instructions;
|
| SlotIndexes.h | 26 #include "llvm/ADT/ilist.h"
337 typedef ilist<IndexListEntry> IndexList;
|
| /external/llvm/lib/Analysis/ |
| IVUsers.cpp | 278 for (ilist<IVStrideUse>::const_iterator UI = IVUses.begin(),
|
| /external/selinux/libsemanage/src/ |
| pywrap-test.py | 246 (status, ilist) = semanage.semanage_iface_list(sh)
251 if (len(ilist) == 0):
255 for iface in ilist:
[all...] |
| /system/netd/server/ |
| CommandListener.cpp | 591 InterfaceCollection *ilist = sTetherCtrl->getTetheredInterfaceList(); local
593 for (it = ilist->begin(); it != ilist->end(); ++it) {
[all...] |
| /external/llvm/lib/Transforms/Scalar/ |
| StraightLineStrengthReduce.cpp | 201 ilist<Candidate> Candidates;
|
| /external/selinux/policycoreutils/semanage/ |
| seobject.py | [all...] |
| /external/llvm/lib/Support/ |
| YAMLParser.cpp | 19 #include "llvm/ADT/ilist.h"
178 typedef ilist<Token> TokenQueueT;
[all...] |
