Searched refs:OSet (Results 1 - 21 of 21) sorted by relevance

/external/valgrind/main/include/
H A Dpub_tool_oset.h3 /*--- 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; typedef in typeref:struct:_OSet
87 // * Create: allocates and initialises the OSet. Arguments:
89 // OSet and all its nodes.
102 extern OSet* VG
[all...]
/external/valgrind/main/drd/
H A Ddrd_clientobj.h97 OSet* oset; // Per-thread order annotation information.
128 OSet* oset[2]; // Per-thread barrier information for the latest
140 OSet* thread_info;
H A Ddrd_barrier.c45 // this member variable is the key of an OSet.
142 * all the nodes in the OSet p->oset.
150 OSet* oset;
335 OSet* oset;
412 OSet* oset;
H A Ddrd_clientobj.c42 static OSet* s_clientobj_set;
H A Dpub_drd_bitmap.h73 OSet* oset;
H A Ddrd_rwlock.c145 DRD_(lookup_or_insert_node)(OSet* oset, const UWord tid)
H A Ddrd_bitmap.c916 /* It's not possible to have two independent iterators over the same OSet, */
977 OSet* const tmp = bm1->oset;
989 * It's not possible to have two independent iterators over the same OSet,
1080 * It's not possible to have two independent iterators over the same OSet,
/external/valgrind/main/memcheck/tests/
H A Dunit_oset.c83 // Create a static OSet of Ints. This one uses fast (built-in)
85 OSet* oset = VG_(OSetGen_Create)(0,
89 // Try some operations on an empty OSet to ensure they don't screw up.
141 // Check that we can iterate over the OSet elements in sorted order, and
185 // Try some more operations on the empty OSet to ensure they don't screw up.
206 // Destroy the OSet
217 // Create a static OSet of Ints. This one uses fast (built-in)
219 OSet* oset = VG_(OSetWord_Create)(allocate_node, "oset_test.2", free_node);
221 // Try some operations on an empty OSet to ensure they don't screw up.
270 // Check that we can iterate over the OSet element
[all...]
/external/valgrind/main/coregrind/m_debuginfo/
H A Dstorage.c689 void show_scope ( OSet* /* of DiAddrRange */ scope, HChar* who )
710 /*MOD*/OSet* /* of DiAddrRange */ scope,
732 /* It must be present, since the presented OSet must cover
869 OSet* /* of DiAddrRange */ scope;
964 sizeof(OSet*) );
996 scope = *(OSet**)VG_(indexXA)( di->varinfo, level );
1025 OSet* scope = *(OSet**)VG_(indexXA)(di->varinfo, i);
H A Ddebuginfo.c261 OSet* scope = *(OSet**)VG_(indexXA)(di->varinfo, i);
3035 OSet* this_scope
3036 = *(OSet**)VG_(indexXA)( di->varinfo, i );
3128 OSet* global_scope;
3144 global_scope = *(OSet**)VG_(indexXA)( di->varinfo, 0 );
3504 OSet* this_scope
3505 = *(OSet**)VG_(indexXA)( di->varinfo, i );
3595 OSet* /* of DiAddrInfo */ scope
3596 = *(OSet**)VG
[all...]
H A Dreadelf.c721 OSet *oset;
2579 OSet* /* of DiAddrRange */ scope
2580 = *(OSet**)VG_(indexXA)(di->varinfo, j);
/external/llvm/utils/TableGen/
H A DRegisterInfoEmitter.cpp593 CodeGenRegister::Set OSet; local
594 Reg->computeOverlaps(OSet, RegBank);
595 OSet.erase(Reg);
596 diffEncode(OverlapList, Reg->EnumValue, OSet.begin(), OSet.end());
H A DCodeGenRegisters.cpp501 CodeGenRegister::addSubRegsPreOrder(SetVector<const CodeGenRegister*> &OSet, argument
506 if (OSet.insert(SR))
507 SR->addSubRegsPreOrder(OSet, RegBank);
512 OSet.insert(I->second);
H A DCodeGenRegisters.h128 // Add sub-registers to OSet following a pre-order defined by the .td file.
129 void addSubRegsPreOrder(SetVector<const CodeGenRegister*> &OSet,
/external/valgrind/main/exp-bbv/
H A Dbbv_main.c72 static OSet* instr_info_table; /* table that holds the basic block info */
/external/valgrind/main/coregrind/
H A Dm_redir.c291 static OSet* activeSet = NULL;
783 we need to get the old one out of the OSet and install
854 OSet* tmpSet;
H A Dm_oset.c90 // 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");
/external/valgrind/main/cachegrind/
H A Dcg_main.c132 static OSet* CC_table;
157 static OSet* instrInfoTable;
167 static OSet* stringTable;
/external/valgrind/main/memcheck/
H A Dmc_leakcheck.c440 static OSet* lr_table;
884 // change the elements used as the OSet key.
H A Dmc_main.c377 LAYOUT: the first word has to be the key for OSet fast lookups.
399 static OSet* auxmap_L2 = NULL;
859 static OSet* secVBitTable;
901 static OSet* createSecVBitTable(void)
911 OSet* secVBitTable2;
1791 secondary cache (ocacheL2), which is an OSet (AVL tree) of cache
2127 static OSet* ocacheL2 = NULL;
/external/valgrind/main/coregrind/m_syswrap/
H A Dsyswrap-darwin.c3781 static OSet* aiocbp_table = NULL;

Completed in 3572 milliseconds