HomeSort by relevance Sort by last modified time
    Searched refs:OSet (Results 1 - 21 of 21) sorted by null

  /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[2]; // Per-thread barrier information for the latest member in struct:barrier_info
140 OSet* thread_info;
drd_barrier.c 45 // this member variable is the key of an OSet.
135 p->oset[i] = VG_(OSetGen_Create)(0, 0, VG_(malloc), "drd.barrier.bi.1",
142 * all the nodes in the OSet p->oset.
150 OSet* oset; local
167 oset = p->oset[1 - (p->pre_iteration & 1)];
168 VG_(OSetGen_ResetIter)(oset);
169 for ( ; (q = VG_(OSetGen_Next)(oset)) != 0; )
335 OSet* oset; local
412 OSet* oset; local
    [all...]
drd_clientobj.c 42 static OSet* s_clientobj_set;
222 * 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/valgrind/main/coregrind/m_debuginfo/
storage.c 689 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*) );
    [all...]
debuginfo.c 261 OSet* scope = *(OSet**)VG_(indexXA)(di->varinfo, i);
    [all...]
readelf.c 721 OSet *oset; local
737 oset = VG_(OSetGen_Create)( offsetof(TempSym,key),
741 vg_assert(oset);
765 prev = VG_(OSetGen_Lookup)( oset, &key );
825 elem = VG_(OSetGen_AllocNode)(oset, sizeof(TempSym));
833 VG_(OSetGen_Insert)(oset, elem);
835 VG_(printf)(" to-oset [%4ld]: "
849 /* All the syms that matter are in the oset. Now pull them out,
850 build a "standard" symbol table, and nuke the oset. *
    [all...]
  /external/llvm/utils/TableGen/
RegisterInfoEmitter.cpp 593 CodeGenRegister::Set OSet;
594 Reg->computeOverlaps(OSet, RegBank);
595 OSet.erase(Reg);
596 diffEncode(OverlapList, Reg->EnumValue, OSet.begin(), OSet.end());
    [all...]
CodeGenRegisters.cpp 501 CodeGenRegister::addSubRegsPreOrder(SetVector<const CodeGenRegister*> &OSet,
506 if (OSet.insert(SR))
507 SR->addSubRegsPreOrder(OSet, RegBank);
512 OSet.insert(I->second);
    [all...]
CodeGenRegisters.h 128 // 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/
bbv_main.c 72 static OSet* instr_info_table; /* table that holds the basic block info */
  /external/valgrind/main/coregrind/
m_redir.c 291 static OSet* activeSet = NULL;
783 we need to get the old one out of the OSet and install
    [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 440 static OSet* lr_table;
884 // change the elements used as the OSet key
    [all...]
mc_main.c 377 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)
    [all...]
  /external/valgrind/main/coregrind/m_syswrap/
syswrap-darwin.c     [all...]

Completed in 1133 milliseconds