| /src/external/gpl3/binutils/dist/gprofng/src/ |
| CacheMap.h | 30 * - (Value_t)0 is invalid value;
41 template <typename Key_t, typename Value_t>
42 class CacheMap : public Map<Key_t, Value_t>
48 void put (Key_t key, Value_t val);
49 Value_t get (Key_t key);
50 Value_t get (Key_t key, typename Map<Key_t, Value_t>::Relation rel);
51 Value_t
59 Value_t val;
79 template <typename Key_t, typename Value_t>
[all...] |
| IndexMap2D.h | 34 template <typename Key1_t, typename Key2_t, typename Value_t>
35 class IndexMap2D : public Map2D<Key1_t, Key2_t, Value_t>
42 void put (Key1_t key1, Key2_t key2, Value_t val);
43 Value_t get (Key1_t key1, Key2_t key2);
44 Value_t get (Key1_t key1, Key2_t key2,
45 typename Map2D<Key1_t, Key2_t, Value_t>::Relation rel);
46 Value_t remove (Key1_t key1, Key2_t key2);
50 Vector<Vector<Value_t>*> *map1;
53 template <typename Key1_t, typename Key2_t, typename Value_t>
54 IndexMap2D<Key1_t, Key2_t, Value_t>::IndexMap2D (
[all...] |
| DefaultMap2D.h | 36 template <typename Key1_t, typename Key2_t, typename Value_t>
37 class DefaultMap2D : public Map2D<Key1_t, Key2_t, Value_t>
41 DefaultMap2D (typename Map2D<Key1_t, Key2_t, Value_t>::MapType _type);
43 void put (Key1_t key1, Key2_t key2, Value_t val);
44 Value_t get (Key1_t key1, Key2_t key2);
45 Value_t get (Key1_t key1, Key2_t key2,
46 typename Map2D<Key1_t, Key2_t, Value_t>::Relation rel);
47 Value_t remove (Key1_t, Key2_t);
50 typename Map2D<Key1_t, Key2_t, Value_t>::MapType type;
51 Map<Key1_t, Map<Key2_t, Value_t>*> *map1
[all...] |
| Map2D.h | 24 template <typename Key1_t, typename Key2_t, typename Value_t>
46 virtual void put (Key1_t key1, Key2_t key2, Value_t val) = 0;
47 virtual Value_t get (Key1_t key1, Key2_t key2) = 0;
48 virtual Value_t get (Key1_t key1, Key2_t key2, Relation rel) = 0;
49 virtual Value_t remove (Key1_t key1, Key2_t key2) = 0;
|
| DefaultMap.h | 28 template <typename Key_t, typename Value_t>
29 class DefaultMap : public Map<Key_t, Value_t>
36 void put (Key_t key, Value_t val);
37 Value_t get (Key_t key);
38 Value_t get (Key_t key, typename Map<Key_t, Value_t>::Relation rel);
39 Value_t remove (Key_t);
41 Vector<Value_t> *values ();
48 Value_t val;
62 template <typename Key_t, typename Value_t>
[all...] |
| IntervalMap.h | 35 template <typename Key_t, typename Value_t>
36 class IntervalMap : public Map<Key_t, Value_t>
42 void put (Key_t key, Value_t val);
43 Value_t get (Key_t key);
44 Value_t get (Key_t key, typename Map<Key_t, Value_t>::Relation rel);
45 Value_t remove (Key_t key);
52 Value_t val;
63 template <typename Key_t, typename Value_t>
64 const int IntervalMap<Key_t, Value_t>::CHUNK_SIZE = 16384
[all...] |
| StringMap.h | 33 template <typename Value_t>
34 class StringMap : public Map<const char*, Value_t>
41 void put (const char *key, Value_t val);
42 Value_t get (const char *key);
43 Value_t get (const char *key, typename Map<const char*, Value_t>::Relation rel);
44 Value_t remove (const char*);
46 Vector<Value_t> *values ();
59 Value_t val;
70 template <typename Value_t>
[all...] |
| Map.h | 26 template <typename Key_t, typename Value_t>
41 virtual void put (Key_t key, Value_t val) = 0;
42 virtual Value_t get (Key_t key) = 0;
43 virtual Value_t get (Key_t key, Relation rel) = 0;
44 virtual Value_t remove (Key_t key) = 0;
52 virtual Vector<Value_t> *
|
| HashMap.h | 133 template <typename Key_t, typename Value_t>
146 Value_t put (Key_t key, Value_t val);
147 Value_t get (Key_t key);
148 Value_t get (Key_t key, Value_t val); // Create a new map if key is not here
150 Value_t remove (Key_t);
151 Vector<Value_t> *values (Key_t key); // Return a list of values for 'key'
156 Value_t p = get (key);
160 Vector<Value_t> *
[all...] |
| /src/external/gpl3/binutils.old/dist/gprofng/src/ |
| CacheMap.h | 30 * - (Value_t)0 is invalid value;
41 template <typename Key_t, typename Value_t>
42 class CacheMap : public Map<Key_t, Value_t>
48 void put (Key_t key, Value_t val);
49 Value_t get (Key_t key);
50 Value_t get (Key_t key, typename Map<Key_t, Value_t>::Relation rel);
51 Value_t
59 Value_t val;
79 template <typename Key_t, typename Value_t>
[all...] |
| IndexMap2D.h | 34 template <typename Key1_t, typename Key2_t, typename Value_t>
35 class IndexMap2D : public Map2D<Key1_t, Key2_t, Value_t>
42 void put (Key1_t key1, Key2_t key2, Value_t val);
43 Value_t get (Key1_t key1, Key2_t key2);
44 Value_t get (Key1_t key1, Key2_t key2,
45 typename Map2D<Key1_t, Key2_t, Value_t>::Relation rel);
46 Value_t remove (Key1_t key1, Key2_t key2);
50 Vector<Vector<Value_t>*> *map1;
53 template <typename Key1_t, typename Key2_t, typename Value_t>
54 IndexMap2D<Key1_t, Key2_t, Value_t>::IndexMap2D (
[all...] |
| DefaultMap2D.h | 36 template <typename Key1_t, typename Key2_t, typename Value_t>
37 class DefaultMap2D : public Map2D<Key1_t, Key2_t, Value_t>
41 DefaultMap2D (typename Map2D<Key1_t, Key2_t, Value_t>::MapType _type);
43 void put (Key1_t key1, Key2_t key2, Value_t val);
44 Value_t get (Key1_t key1, Key2_t key2);
45 Value_t get (Key1_t key1, Key2_t key2,
46 typename Map2D<Key1_t, Key2_t, Value_t>::Relation rel);
47 Value_t remove (Key1_t, Key2_t);
50 typename Map2D<Key1_t, Key2_t, Value_t>::MapType type;
51 Map<Key1_t, Map<Key2_t, Value_t>*> *map1
[all...] |
| Map2D.h | 24 template <typename Key1_t, typename Key2_t, typename Value_t>
46 virtual void put (Key1_t key1, Key2_t key2, Value_t val) = 0;
47 virtual Value_t get (Key1_t key1, Key2_t key2) = 0;
48 virtual Value_t get (Key1_t key1, Key2_t key2, Relation rel) = 0;
49 virtual Value_t remove (Key1_t key1, Key2_t key2) = 0;
|
| DefaultMap.h | 28 template <typename Key_t, typename Value_t>
29 class DefaultMap : public Map<Key_t, Value_t>
36 void put (Key_t key, Value_t val);
37 Value_t get (Key_t key);
38 Value_t get (Key_t key, typename Map<Key_t, Value_t>::Relation rel);
39 Value_t remove (Key_t);
41 Vector<Value_t> *values ();
48 Value_t val;
62 template <typename Key_t, typename Value_t>
[all...] |
| IntervalMap.h | 35 template <typename Key_t, typename Value_t>
36 class IntervalMap : public Map<Key_t, Value_t>
42 void put (Key_t key, Value_t val);
43 Value_t get (Key_t key);
44 Value_t get (Key_t key, typename Map<Key_t, Value_t>::Relation rel);
45 Value_t remove (Key_t key);
52 Value_t val;
63 template <typename Key_t, typename Value_t>
64 const int IntervalMap<Key_t, Value_t>::CHUNK_SIZE = 16384
[all...] |
| StringMap.h | 33 template <typename Value_t>
34 class StringMap : public Map<const char*, Value_t>
41 void put (const char *key, Value_t val);
42 Value_t get (const char *key);
43 Value_t get (const char *key, typename Map<const char*, Value_t>::Relation rel);
44 Value_t remove (const char*);
46 Vector<Value_t> *values ();
59 Value_t val;
70 template <typename Value_t>
[all...] |
| Map.h | 26 template <typename Key_t, typename Value_t>
41 virtual void put (Key_t key, Value_t val) = 0;
42 virtual Value_t get (Key_t key) = 0;
43 virtual Value_t get (Key_t key, Relation rel) = 0;
44 virtual Value_t remove (Key_t key) = 0;
52 virtual Vector<Value_t> *
|
| HashMap.h | 133 template <typename Key_t, typename Value_t>
146 Value_t put (Key_t key, Value_t val);
147 Value_t get (Key_t key);
148 Value_t get (Key_t key, Value_t val); // Create a new map if key is not here
150 Value_t remove (Key_t);
151 Vector<Value_t> *values (Key_t key); // Return a list of values for 'key'
156 Value_t p = get (key);
160 Vector<Value_t> *
[all...] |
| /src/external/bsd/byacc/dist/ |
| lr0.c | 11 static Value_t get_state(int symbol);
24 Value_t nstates;
36 static Value_t *shift_symbol;
38 static Value_t *rules;
40 static Value_t *redset;
41 static Value_t *shiftset;
43 static Value_t **kernel_base;
44 static Value_t **kernel_end;
45 static Value_t *kernel_items;
50 Value_t *itemp
[all...] |
| lalr.c | 12 Value_t value;
16 static Value_t map_goto(int state, int symbol);
17 static Value_t **transpose(Value_t **R, int n);
22 static void digraph(Value_t **relation);
34 Value_t *lookaheads;
35 Value_t *LAruleno;
37 Value_t *accessing_symbol;
41 Value_t *goto_base;
42 Value_t *goto_map
[all...] |
| mkpar.c | 41 Value_t *SRconflicts;
42 Value_t *RRconflicts;
43 Value_t *defred;
44 Value_t *rules_used;
45 Value_t nunused;
46 Value_t final_state;
48 static Value_t SRcount;
49 static Value_t RRcount;
83 const Value_t *to_state2;
89 Value_t i
[all...] |
| closure.c | 10 Value_t *itemset;
11 Value_t *itemsetend;
38 const Value_t *sp = derives[i];
64 const Value_t *rp;
112 closure(Value_t *nucleus, int n)
116 Value_t *csp;
121 const Value_t *csend;
123 Value_t itemno;
190 Value_t *isp;
|
| output.c | 21 static Value_t **froms;
22 static Value_t **tos;
24 static Value_t *conflicts = NULL;
25 static Value_t nconflicts = 0;
27 static Value_t *tally;
28 static Value_t *width;
29 static Value_t *state_count;
30 static Value_t *order;
31 static Value_t *base;
32 static Value_t *pos
[all...] |
| graph.c | 58 Value_t *isp;
59 Value_t *sp;
66 const Value_t *sp1;
|
| verbose.c | 21 static Value_t *null_rules;
31 null_rules = TMALLOC(Value_t, nrules);
74 Value_t *p;
187 Value_t *sp = ritem + statep->items[i];
188 const Value_t *sp1 = sp;
213 Value_t i, j, k, nnulls;
237 for (k = (Value_t)(nnulls - 1); k > j; --k)
355 const Value_t *to_state2;
|
