| /netbsd-src/external/gpl3/binutils/dist/gprofng/src/ |
| H A D | vec.h | 75 template <class ITEM> void 76 qsort (ITEM *, size_t, ExtCompareFunc, void *); 78 template <typename ITEM> class Vector 98 void append (const ITEM item); 99 void addAll (Vector<ITEM> *vec); 100 Vector<ITEM> *copy (); // Return a copy of "this". 102 ITEM 108 ITEM 116 long find (const ITEM item); 117 long find_r (const ITEM item); [all …]
|
| H A D | DbeSyncMap.h | 30 template <class ITEM> class DbeSyncMap : public DbeLock 36 ITEM *get (const char *nm, int64_t chksum); 37 ITEM *sync_create_item (const char *nm, int64_t chksum); 38 ITEM *get (const char *nm, const char *path, DbeFile *df); 39 ITEM *sync_create_item (const char *nm, const char *path, DbeFile *df); 42 Vector<ITEM *> * 51 DbeLinkList<ITEM *> **chunk; 52 Vector<ITEM *> *items; 61 template <class ITEM> 62 DbeSyncMap<ITEM>::DbeSyncMap (int _chunkSize) in DbeSyncMap() [all …]
|
| H A D | DbeCacheMap.h | 36 template <typename Key_t, class ITEM> 37 class DbeCacheMap : public Map<Key_t, ITEM *> 54 put (Key_t key, ITEM *val) in put() 61 ITEM * 67 return (ITEM *) NULL; in get() 70 ITEM * 74 ITEM *v = table[ind].value; in remove() 75 table[ind].value = (ITEM *) NULL; in remove() 79 ITEM * 80 get (Key_t /* key */, typename Map<Key_t, ITEM *>::Relation /* rel */) in get() [all …]
|
| H A D | DbeArray.h | 24 template <typename ITEM> class DbeArray 32 data = new ITEM[limit]; in DbeArray() 42 append (const ITEM &item) in append() 45 ITEM *p = get (n); in append() 50 ITEM * 53 return (index < count && index >= 0) ? data + index : (ITEM *) NULL; in get() 86 ITEM *d = new ITEM[limit]; in resize() 88 memcpy (d, data, sizeof (ITEM) * count); in resize() 94 ITEM *data; // Pointer to data vector
|
| H A D | DbeLinkList.h | 24 template <typename ITEM> class DbeLinkList 28 DbeLinkList (ITEM _item) in DbeLinkList() 36 ITEM 42 DbeLinkList<ITEM> * 49 set_next (DbeLinkList<ITEM> *p) in set_next() 57 for (DbeLinkList<ITEM> *p = next; p;) 59 DbeLinkList<ITEM> *p1 = p->get_next (); 69 ITEM item; 70 DbeLinkList<ITEM> *next;
|
| H A D | DbeApplication.h | 35 template <class ITEM> class Vector;
|
| H A D | DbeJarFile.h | 28 template <class ITEM> class Vector;
|
| H A D | DbeThread.h | 26 template <class ITEM> class Vector;
|
| H A D | gp-archive.h | 29 template <class ITEM> class Vector;
|
| /netbsd-src/external/gpl3/binutils.old/dist/gprofng/src/ |
| H A D | vec.h | 75 template <class ITEM> void 76 qsort (ITEM *, size_t, ExtCompareFunc, void *); 78 template <typename ITEM> class Vector 98 void append (const ITEM item); 99 void addAll (Vector<ITEM> *vec); 100 Vector<ITEM> *copy (); // Return a copy of "this". 102 ITEM 108 ITEM 116 long find (const ITEM item); 117 long find_r (const ITEM item); [all …]
|
| H A D | DbeSyncMap.h | 30 template <class ITEM> class DbeSyncMap : public DbeLock 36 ITEM *get (const char *nm, int64_t chksum); 37 ITEM *sync_create_item (const char *nm, int64_t chksum); 38 ITEM *get (const char *nm, const char *path, DbeFile *df); 39 ITEM *sync_create_item (const char *nm, const char *path, DbeFile *df); 42 Vector<ITEM *> * 51 DbeLinkList<ITEM *> **chunk; 52 Vector<ITEM *> *items; 61 template <class ITEM> 62 DbeSyncMap<ITEM>::DbeSyncMap (int _chunkSize) in DbeSyncMap() [all …]
|
| H A D | DbeCacheMap.h | 36 template <typename Key_t, class ITEM> 37 class DbeCacheMap : public Map<Key_t, ITEM *> 54 put (Key_t key, ITEM *val) in put() 61 ITEM * 67 return (ITEM *) NULL; in get() 70 ITEM * 74 ITEM *v = table[ind].value; in remove() 75 table[ind].value = (ITEM *) NULL; in remove() 79 ITEM * 80 get (Key_t /* key */, typename Map<Key_t, ITEM *>::Relation /* rel */) in get() [all …]
|
| H A D | DbeArray.h | 24 template <typename ITEM> class DbeArray 32 data = new ITEM[limit]; in DbeArray() 42 append (const ITEM &item) in append() 45 ITEM *p = get (n); in append() 50 ITEM * 53 return (index < count && index >= 0) ? data + index : (ITEM *) NULL; in get() 86 ITEM *d = new ITEM[limit]; in resize() 88 memcpy (d, data, sizeof (ITEM) * count); in resize() 94 ITEM *data; // Pointer to data vector
|
| H A D | DbeLinkList.h | 24 template <typename ITEM> class DbeLinkList 28 DbeLinkList (ITEM _item) in DbeLinkList() 36 ITEM 42 DbeLinkList<ITEM> * 49 set_next (DbeLinkList<ITEM> *p) in set_next() 57 for (DbeLinkList<ITEM> *p = next; p;) 59 DbeLinkList<ITEM> *p1 = p->get_next (); 69 ITEM item; 70 DbeLinkList<ITEM> *next;
|
| H A D | DbeApplication.h | 35 template <class ITEM> class Vector;
|
| H A D | DbeJarFile.h | 28 template <class ITEM> class Vector;
|
| H A D | DbeThread.h | 26 template <class ITEM> class Vector;
|
| H A D | gp-archive.h | 29 template <class ITEM> class Vector;
|
| /netbsd-src/lib/libmenu/ |
| H A D | menu.h | 78 typedef struct __item ITEM; typedef 95 ITEM *left; 96 ITEM *right; 97 ITEM *up; 98 ITEM *down; 125 ITEM **items; /* items associated with this menu */ 165 MENU *new_menu(ITEM **); 172 int set_menu_items(MENU *, ITEM **); 184 ITEM *current_item(MENU *); 185 int free_item(ITEM *); [all …]
|
| H A D | item.c | 41 ITEM _menui_default_item = { 62 item_visible(ITEM *item) in item_visible() 76 item_name(ITEM *item) in item_name() 88 item_description(ITEM *item) in item_description() 188 set_item_opts(ITEM *item, OPTIONS opts) in set_item_opts() 205 item_opts_on(ITEM *item, OPTIONS opts) in item_opts_on() 221 item_opts_off(ITEM *item, OPTIONS opts) in item_opts_off() 237 item_opts(ITEM *item) in item_opts() 249 set_item_value(ITEM *param_item, int flag) in set_item_value() 251 ITEM *item = (param_item != NULL) ? param_item : &_menui_default_item; in set_item_value() [all …]
|
| H A D | userptr.c | 40 extern ITEM _menui_default_item; 46 set_item_userptr(ITEM *param_item, char *userptr) in set_item_userptr() 48 ITEM *item = (param_item != NULL) ? param_item : &_menui_default_item; in set_item_userptr() 59 item_userptr(ITEM *item) in item_userptr()
|
| H A D | internals.h | 46 int _menui_goto_item(MENU *menu, ITEM *item, int new_top_row);
|
| /netbsd-src/external/gpl3/gcc.old/dist/gcc/ |
| H A D | dump-context.h | 250 #define ASSERT_IS_TEXT(ITEM, EXPECTED_TEXT) \ argument 252 verify_item (SELFTEST_LOCATION, (ITEM), OPTINFO_ITEM_KIND_TEXT, \ 258 #define ASSERT_IS_TREE(ITEM, EXPECTED_LOCATION, EXPECTED_TEXT) \ argument 260 verify_item (SELFTEST_LOCATION, (ITEM), OPTINFO_ITEM_KIND_TREE, \ 266 #define ASSERT_IS_GIMPLE(ITEM, EXPECTED_LOCATION, EXPECTED_TEXT) \ argument 268 verify_item (SELFTEST_LOCATION, (ITEM), OPTINFO_ITEM_KIND_GIMPLE, \ 274 #define ASSERT_IS_SYMTAB_NODE(ITEM, EXPECTED_LOCATION, EXPECTED_TEXT) \ argument 276 verify_item (SELFTEST_LOCATION, (ITEM), OPTINFO_ITEM_KIND_SYMTAB_NODE, \
|
| /netbsd-src/external/gpl3/gcc/dist/gcc/ |
| H A D | dump-context.h | 271 #define ASSERT_IS_TEXT(ITEM, EXPECTED_TEXT) \ argument 273 verify_item (SELFTEST_LOCATION, (ITEM), OPTINFO_ITEM_KIND_TEXT, \ 279 #define ASSERT_IS_TREE(ITEM, EXPECTED_LOCATION, EXPECTED_TEXT) \ argument 281 verify_item (SELFTEST_LOCATION, (ITEM), OPTINFO_ITEM_KIND_TREE, \ 287 #define ASSERT_IS_GIMPLE(ITEM, EXPECTED_LOCATION, EXPECTED_TEXT) \ argument 289 verify_item (SELFTEST_LOCATION, (ITEM), OPTINFO_ITEM_KIND_GIMPLE, \ 295 #define ASSERT_IS_SYMTAB_NODE(ITEM, EXPECTED_LOCATION, EXPECTED_TEXT) \ argument 297 verify_item (SELFTEST_LOCATION, (ITEM), OPTINFO_ITEM_KIND_SYMTAB_NODE, \
|
| /netbsd-src/external/gpl2/texinfo/dist/makeinfo/ |
| H A D | xml.c | 833 xml_insert_element (ITEM, START); 853 case ITEM: 1201 xml_insert_element (ITEM, START); in xml_add_char() 1440 xml_insert_element (ITEM, END); in xml_end_table() 1456 xml_insert_element (ITEM, END); in xml_end_table() 1475 xml_insert_element (ITEM, END); in xml_begin_item() 1477 xml_insert_element (ITEM, START); in xml_begin_item() 1487 xml_insert_element (ITEM, END); in xml_begin_table_item() 1562 xml_insert_element (ITEM, END); in xml_end_enumerate()
|