| /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 | 96 OSet* oset; // Per-thread order annotation information. member in struct:hb_info
127 OSet* oset[2]; // Per-thread barrier information for the latest member in struct:barrier_info
139 OSet* thread_info;
|
| drd_barrier.c | 44 // this member variable is the key of an OSet.
134 p->oset[i] = VG_(OSetGen_Create)(0, 0, VG_(malloc), "drd.barrier.bi.1",
141 * all the nodes in the OSet p->oset.
149 OSet* oset; local
166 oset = p->oset[1 - (p->pre_iteration & 1)];
167 VG_(OSetGen_ResetIter)(oset);
168 for ( ; (q = VG_(OSetGen_Next)(oset)) != 0; )
334 OSet* oset; local
411 OSet* oset; local
[all...] |
| drd_clientobj.c | 41 static OSet* s_clientobj_set;
221 * The above call removes an element from the oset and hence
|
| pub_drd_bitmap.h | 72 OSet* oset; member in struct:bitmap
|
| drd_rwlock.c | 144 DRD_(lookup_or_insert_node)(OSet* oset, const UWord tid)
148 q = VG_(OSetGen_Lookup)(oset, &tid);
151 q = VG_(OSetGen_AllocNode)(oset, sizeof(*q));
157 VG_(OSetGen_Insert)(oset, q);
|
| drd_bitmap.c | 48 static OSet* s_bm2_set_template;
109 bm->oset = VG_(OSetGen_EmptyClone)(s_bm2_set_template);
117 VG_(OSetGen_Destroy)(bm->oset);
351 VG_(OSetGen_ResetIter)(bm->oset);
352 for ( ; (bm2 = VG_(OSetGen_Next)(bm->oset)) != NULL; ) {
953 /* It's not possible to have two independent iterators over the same OSet, */
957 VG_(OSetGen_ResetIter)(lhs->oset);
958 VG_(OSetGen_ResetIter)(rhs->oset);
960 for ( ; (bm2l = VG_(OSetGen_Next)(lhs->oset)) != 0; )
967 bm2l = VG_(OSetGen_Next)(lhs->oset);
[all...] |
| /external/valgrind/main/memcheck/tests/ |
| unit_oset.c | 85 void example1singleset(OSet* oset, char *descr)
92 // Try some operations on an empty OSet to ensure they don't screw up.
93 vg_assert( ! VG_(OSetGen_Contains)(oset, &v) );
94 vg_assert( ! VG_(OSetGen_Lookup)(oset, &v) );
95 vg_assert( ! VG_(OSetGen_Remove)(oset, &v) );
96 vg_assert( ! VG_(OSetGen_Next)(oset) );
97 vg_assert( 0 == VG_(OSetGen_Size)(oset) );
102 vs[i] = VG_(OSetGen_AllocNode)(oset, sizeof(Word));
116 VG_(OSetGen_Insert)(oset, vs[i])
213 OSet *oset, *oset_empty_clone; local
263 OSet* oset = VG_(OSetWord_Create)(allocate_node, "oset_test.2", free_node); local
419 OSet* oset = VG_(OSetGen_Create)(offsetof(Block, first), local
[all...] |
| /external/valgrind/main/coregrind/m_debuginfo/ |
| storage.c | 703 void show_scope ( OSet* /* of DiAddrRange */ scope, HChar* who )
724 /*MOD*/OSet* /* of DiAddrRange */ scope,
746 /* It must be present, since the presented OSet must cover
883 OSet* /* of DiAddrRange */ scope;
974 sizeof(OSet*) );
[all...] |
| debuginfo.c | 266 OSet* scope = *(OSet**)VG_(indexXA)(di->varinfo, i);
[all...] |
| readelf.c | 735 OSet *oset; local
751 oset = VG_(OSetGen_Create)( offsetof(TempSym,key),
755 vg_assert(oset);
779 prev = VG_(OSetGen_Lookup)( oset, &key );
839 elem = VG_(OSetGen_AllocNode)(oset, sizeof(TempSym));
847 VG_(OSetGen_Insert)(oset, elem);
849 VG_(printf)(" to-oset [%4ld]: "
863 /* All the syms that matter are in the oset. Now pull them out,
864 build a "standard" symbol table, and nuke the oset. *
[all...] |
| /external/llvm/utils/TableGen/ |
| RegisterInfoEmitter.cpp | 753 CodeGenRegister::Set OSet;
754 Reg->computeOverlaps(OSet, RegBank);
755 OSet.erase(Reg);
756 diffEncode(OverlapList, Reg->EnumValue, OSet.begin(), OSet.end());
[all...] |
| CodeGenRegisters.h | 129 // Add sub-registers to OSet following a pre-order defined by the .td file.
130 void addSubRegsPreOrder(SetVector<const CodeGenRegister*> &OSet,
|
| CodeGenRegisters.cpp | 509 CodeGenRegister::addSubRegsPreOrder(SetVector<const CodeGenRegister*> &OSet,
514 if (OSet.insert(SR))
515 SR->addSubRegsPreOrder(OSet, RegBank);
520 OSet.insert(I->second);
[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 | 294 static OSet* activeSet = NULL;
[all...] |
| m_oset.c | 91 // Internal names for the OSet types.
92 typedef OSet AvlTree;
109 // An OSet (AVL tree). If cmp is NULL, the key must be a UWord, and must
534 vg_assert2(0, "OSet{Word,Gen}_Insert: duplicate element added");
861 // set up 'oset' for iteration so that the first key subsequently
865 void VG_(OSetGen_ResetIterAt)(AvlTree* oset, const void* k)
872 vg_assert(oset);
873 stackClear(oset);
875 if (!oset->root)
880 t = oset->root
[all...] |
| /external/valgrind/main/cachegrind/ |
| cg_main.c | 138 static OSet* CC_table;
163 static OSet* instrInfoTable;
173 static OSet* stringTable;
[all...] |
| /external/valgrind/main/memcheck/ |
| mc_main.c | 369 LAYOUT: the first word has to be the key for OSet fast lookups.
391 static OSet* auxmap_L2 = NULL;
866 static OSet* secVBitTable;
[all...] |
| mc_leakcheck.c | 458 static OSet* lr_table;
[all...] |
| /external/valgrind/main/coregrind/m_syswrap/ |
| syswrap-darwin.c | [all...] |
