| /external/valgrind/main/include/ |
| pub_tool_oset.h | 3 /*--- OSet: a fast data structure with no dups. pub_tool_oset.h ---*/
37 // duplicate to an OSet.
50 // (eg. in an OSet of integers, each integer serves both as an element and
58 // element. This fast comparison is suitable for an OSet containing
61 // Each OSet interface also has an iterator, which makes it simple to
65 // Note that once you insert an element into an OSet, if you modify any part
73 typedef struct _OSet OSet;
87 // * Create: allocates and initialises the OSet. Arguments:
89 // OSet and all its nodes.
102 extern OSet* VG_(OSetWord_Create) ( OSetAlloc_t alloc, HChar* cc,
[all...] |
| /external/valgrind/main/drd/ |
| drd_clientobj.h | 97 OSet* oset; // Per-thread order annotation information. member in struct:hb_info
128 OSet* oset; // Per-thread barrier information. member in struct:barrier_info
139 OSet* thread_info;
|
| drd_clientobj.c | 41 static OSet* s_clientobj_set;
224 * The above call removes an element from the oset and hence
|
| pub_drd_bitmap.h | 73 OSet* oset; member in struct:bitmap
|
| drd_rwlock.c | 145 DRD_(lookup_or_insert_node)(OSet* oset, const UWord tid)
149 q = VG_(OSetGen_Lookup)(oset, &tid);
152 q = VG_(OSetGen_AllocNode)(oset, sizeof(*q));
158 VG_(OSetGen_Insert)(oset, q);
|
| drd_bitmap.c | 94 bm->oset = VG_(OSetGen_Create)(0, 0, DRD_(bm2_alloc_node),
103 VG_(OSetGen_Destroy)(bm->oset);
916 /* It's not possible to have two independent iterators over the same OSet, */
920 VG_(OSetGen_ResetIter)(lhs->oset);
921 VG_(OSetGen_ResetIter)(rhs->oset);
923 for ( ; (bm2l = VG_(OSetGen_Next)(lhs->oset)) != 0; )
930 bm2l = VG_(OSetGen_Next)(lhs->oset);
938 bm2r = VG_(OSetGen_Next)(rhs->oset);
961 bm2r = VG_(OSetGen_Next)(rhs->oset);
977 OSet* const tmp = bm1->oset
[all...] |
| /external/valgrind/main/memcheck/tests/ |
| unit_oset.c | 83 // Create a static OSet of Ints. This one uses fast (built-in)
85 OSet* oset = VG_(OSetGen_Create)(0, local
89 // Try some operations on an empty OSet to ensure they don't screw up.
90 vg_assert( ! VG_(OSetGen_Contains)(oset, &v) );
91 vg_assert( ! VG_(OSetGen_Lookup)(oset, &v) );
92 vg_assert( ! VG_(OSetGen_Remove)(oset, &v) );
93 vg_assert( ! VG_(OSetGen_Next)(oset) );
94 vg_assert( 0 == VG_(OSetGen_Size)(oset) );
99 vs[i] = VG_(OSetGen_AllocNode)(oset, sizeof(Word))
219 OSet* oset = VG_(OSetWord_Create)(allocate_node, "oset_test.2", free_node); local
375 OSet* oset = VG_(OSetGen_Create)(offsetof(Block, first), local
[all...] |
| /external/llvm/utils/TableGen/ |
| CodeGenRegisters.h | 56 // Add sub-registers to OSet following a pre-order defined by the .td file.
57 void addSubRegsPreOrder(SetVector<CodeGenRegister*> &OSet) const;
|
| CodeGenRegisters.cpp | 145 CodeGenRegister::addSubRegsPreOrder(SetVector<CodeGenRegister*> &OSet) const {
150 if (OSet.insert(SR))
151 SR->addSubRegsPreOrder(OSet);
|
| /external/valgrind/main/coregrind/m_debuginfo/ |
| storage.c | 669 void show_scope ( OSet* /* of DiAddrRange */ scope, HChar* who )
690 /*MOD*/OSet* /* of DiAddrRange */ scope,
712 /* It must be present, since the presented OSet must cover
849 OSet* /* of DiAddrRange */ scope;
944 sizeof(OSet*) );
976 scope = *(OSet**)VG_(indexXA)( di->varinfo, level );
[all...] |
| debuginfo.c | 258 OSet* scope = *(OSet**)VG_(indexXA)(di->varinfo, i);
[all...] |
| readelf.c | 696 OSet *oset; local
712 oset = VG_(OSetGen_Create)( offsetof(TempSym,key),
716 vg_assert(oset);
740 prev = VG_(OSetGen_Lookup)( oset, &key );
800 elem = VG_(OSetGen_AllocNode)(oset, sizeof(TempSym));
808 VG_(OSetGen_Insert)(oset, elem);
810 VG_(printf)(" to-oset [%4ld]: "
824 /* All the syms that matter are in the oset. Now pull them out,
825 build a "standard" symbol table, and nuke the oset. *
[all...] |
| /external/valgrind/main/exp-bbv/ |
| bbv_main.c | 72 static OSet* instr_info_table; /* table that holds the basic block info */
|
| /external/valgrind/main/coregrind/ |
| m_redir.c | 279 static OSet* activeSet = NULL;
714 OSet* tmpSet;
[all...] |
| m_oset.c | 90 // Internal names for the OSet types.
91 typedef OSet AvlTree;
108 // An OSet (AVL tree). If cmp is NULL, the key must be a UWord, and must
457 vg_assert2(0, "OSet{Word,Gen}_Insert: duplicate element added");
784 // set up 'oset' for iteration so that the first key subsequently
788 void VG_(OSetGen_ResetIterAt)(AvlTree* oset, const void* k)
795 vg_assert(oset);
796 stackClear(oset);
798 if (!oset->root)
803 t = oset->root
[all...] |
| /external/valgrind/main/cachegrind/ |
| cg_main.c | 132 static OSet* CC_table;
157 static OSet* instrInfoTable;
167 static OSet* stringTable;
[all...] |
| /external/valgrind/main/memcheck/ |
| mc_leakcheck.c | 777 OSet* lr_table;
802 // change the elements used as the OSet key.
[all...] |
| mc_main.c | 367 LAYOUT: the first word has to be the key for OSet fast lookups.
389 static OSet* auxmap_L2 = NULL;
849 static OSet* secVBitTable;
891 static OSet* createSecVBitTable(void)
901 OSet* secVBitTable2;
[all...] |
| /external/valgrind/main/exp-ptrcheck/ |
| h_main.c | 587 CHANGE THIS LAYOUT: the first word has to be the key for OSet fast
597 /* Primary map is an OSet of PriMapEnt (primap_L2), "fronted" by a
613 static OSet* primap_L2 = NULL;
[all...] |
| /external/valgrind/main/coregrind/m_syswrap/ |
| syswrap-darwin.c | [all...] |
