| /src/external/bsd/elftosb/dist/common/ |
| RijndaelCBCMAC.h | 50 m_key = other.m_key;
56 AESKey<128> m_key; //!< 128-bit key to use for the CBC-MAC. member in class:RijndaelCBCMAC
|
| AESKey.h | 63 memset(m_key, 0, sizeof(m_key));
69 memcpy(m_key, &key, sizeof(m_key));
75 memcpy(m_key, key, sizeof(m_key));
87 memcpy(m_key, other.m_key, sizeof(m_key));
95 memset(m_key, 0, sizeof(m_key))
138 key_t m_key; \/\/!< The key value. member in class:AESKey
[all...] |
| /src/sys/arch/atari/stand/xxboot/ahdi-xxboot/ |
| xxboot.ahdi.S | 115 lea %pc@(m_key),%a6
191 m_key: .asciz "\007\r\npress any key... @\r\n" label
|
| /src/sys/arch/atari/stand/xxboot/fdboot/ |
| fdboot.S | 111 lea %pc@(m_key),%a3
216 m_key: .asciz "\007\r\npress any key... @\r\n" label
|
| /src/external/gpl3/gdb/dist/gdb/ |
| registry.h | 100 : m_key (registry<T>::new_key (cleanup))
111 return (DATA *) reg_obj->get (m_key);
120 reg_obj->set (m_key, (typename std::remove_const<DATA> *) data);
163 const unsigned m_key; member in class:registry::key
|
| /src/external/gpl3/gdb.old/dist/gdb/ |
| registry.h | 100 : m_key (registry<T>::new_key (cleanup))
111 return (DATA *) reg_obj->get (m_key);
120 reg_obj->set (m_key, (typename std::remove_const<DATA> *) data);
163 const unsigned m_key; member in class:registry::key
|
| /src/external/bsd/atf/dist/atf-c/detail/ |
| map.c | 45 char *m_key; member in struct:map_entry
58 me->m_key = strdup(key);
59 if (me->m_key == NULL) {
84 return me->m_key;
128 return me->m_key;
215 free(me->m_key);
273 if (strcmp(me->m_key, key) == 0) {
293 if (strcmp(me->m_key, key) == 0) {
375 INV(strcmp(me->m_key, key) == 0);
|
| /src/external/gpl3/gcc/dist/gcc/ |
| fibonacci_heap.h | 65 m_left (this), m_right (this), m_key (key), m_data (data),
73 if (m_key < other->m_key)
75 if (m_key > other->m_key)
95 return m_key;
123 K m_key; member in class:fibonacci_node
201 return m_min->m_key;
207 K okey = node->m_key;
216 gcc_assert (key <= node->m_key);
[all...] |
| hash-map.h | 44 Key m_key; member in struct:hash_entry
52 return Traits::hash (e.m_key);
57 return Traits::equal_keys (a.m_key, b);
75 gt_ggc_mx (e.m_key);
87 gt_pch_nx (e.m_key);
93 pch_nx_helper (e.m_key, op, c);
99 return ggc_marked_p (e.m_key);
175 e->m_key = k;
206 e->m_key = k;
233 if (!f ((*iter).m_key, (*iter).m_value, a)
[all...] |
| dominance.cc | 78 /* For a node x m_key[x] is roughly the node nearest to the root from which
81 TBB *m_key; member in class:__anon13579::dom_info
83 the tree x is in with the smallest m_key[y]. */
169 m_key = new TBB[num];
173 m_path_min[i] = m_key[i] = i;
283 delete[] m_key;
476 if (m_key[m_path_min[parent]] < m_key[m_path_min[v]])
504 if (m_key[m_path_min[rep]] >= m_key[m_path_min[v]]
[all...] |
| gcc.cc | 83 char *m_key;
138 kv.m_key = xstrndup (string, equals - string);
139 const char *cur_value = ::getenv (kv.m_key);
164 printf ("restoring saved key: %s value: %s\n", item->m_key, item->m_value);
166 ::setenv (item->m_key, item->m_value, 1);
168 ::unsetenv (item->m_key);
169 free (item->m_key);
82 char *m_key; member in struct:env_manager::kv
|
| /src/external/gpl3/gcc.old/dist/gcc/ |
| fibonacci_heap.h | 65 m_left (this), m_right (this), m_key (key), m_data (data),
73 if (m_key < other->m_key)
75 if (m_key > other->m_key)
95 return m_key;
123 K m_key; member in class:fibonacci_node
201 return m_min->m_key;
207 K okey = node->m_key;
216 gcc_assert (key <= node->m_key);
[all...] |
| hash-map.h | 44 Key m_key; member in struct:hash_entry
52 return Traits::hash (e.m_key);
57 return Traits::equal_keys (a.m_key, b);
75 gt_ggc_mx (e.m_key);
87 gt_pch_nx (e.m_key);
93 pch_nx_helper (e.m_key, op, c);
99 return ggc_marked_p (e.m_key);
175 e->m_key = k;
204 e->m_key = k;
229 if (!f ((*iter).m_key, (*iter).m_value, a)
[all...] |
| dominance.cc | 78 /* For a node x m_key[x] is roughly the node nearest to the root from which
81 TBB *m_key; member in class:__anon16015::dom_info
83 the tree x is in with the smallest m_key[y]. */
169 m_key = new TBB[num];
173 m_path_min[i] = m_key[i] = i;
283 delete[] m_key;
476 if (m_key[m_path_min[parent]] < m_key[m_path_min[v]])
504 if (m_key[m_path_min[rep]] >= m_key[m_path_min[v]]
[all...] |
| gcc.cc | 78 char *m_key;
133 kv.m_key = xstrndup (string, equals - string);
134 const char *cur_value = ::getenv (kv.m_key);
159 printf ("restoring saved key: %s value: %s\n", item->m_key, item->m_value);
161 ::setenv (item->m_key, item->m_value, 1);
163 ::unsetenv (item->m_key);
164 free (item->m_key);
77 char *m_key; member in struct:env_manager::kv
|
| /src/external/gpl3/gcc/dist/gcc/analyzer/ |
| exploded-graph.h | 560 entry.m_key = reinterpret_cast<key_type> (1);
565 entry.m_key = NULL;
570 return entry.m_key == reinterpret_cast<key_type> (1);
575 return entry.m_key == NULL;
585 : m_key (key), m_excess_enodes (0)
588 const program_point m_key; member in struct:ana::per_program_point_data
630 entry.m_key = reinterpret_cast<key_type> (1);
635 entry.m_key = NULL;
640 return entry.m_key == reinterpret_cast<key_type> (1);
645 return entry.m_key == NULL
658 const call_string &m_key; member in struct:ana::per_call_string_data
[all...] |
| /src/external/gpl3/gcc.old/dist/gcc/analyzer/ |
| exploded-graph.h | 504 entry.m_key = reinterpret_cast<key_type> (1);
509 entry.m_key = NULL;
514 return entry.m_key == reinterpret_cast<key_type> (1);
519 return entry.m_key == NULL;
529 : m_key (key), m_excess_enodes (0)
532 const program_point m_key; member in struct:ana::per_program_point_data
574 entry.m_key = reinterpret_cast<key_type> (1);
579 entry.m_key = NULL;
584 return entry.m_key == reinterpret_cast<key_type> (1);
589 return entry.m_key == NULL
602 const call_string m_key; member in struct:ana::per_call_string_data
[all...] |
