dat                63 ompi/mca/coll/libnbc/libdict/dict.h 	int			 (*_probe)		__P((void *obj, void *key, void **dat));
dat                98 ompi/mca/coll/libnbc/libdict/dict.h 	int			 (*_setdata)	__P((void *itor, void *dat, int del));
dat               117 ompi/mca/coll/libnbc/libdict/dict.h #define dict_itor_set_data(i,dat,d)	(i)->_setdata((i)->_itor, (dat), (d))
dat                23 ompi/mca/coll/libnbc/libdict/hb_tree.c 	void		*dat;
dat                48 ompi/mca/coll/libnbc/libdict/hb_tree.c static hb_node *node_new __P((void *key, void *dat));
dat               131 ompi/mca/coll/libnbc/libdict/hb_tree.c 				tree->dat_del(node->dat);
dat               166 ompi/mca/coll/libnbc/libdict/hb_tree.c 			return node->dat;
dat               173 ompi/mca/coll/libnbc/libdict/hb_tree.c hb_tree_insert(hb_tree *tree, void *key, void *dat, int overwrite)
dat               193 ompi/mca/coll/libnbc/libdict/hb_tree.c 				tree->dat_del(node->dat);
dat               195 ompi/mca/coll/libnbc/libdict/hb_tree.c 			node->dat = dat;
dat               202 ompi/mca/coll/libnbc/libdict/hb_tree.c 	if ((node = node_new(key, dat)) == NULL)
dat               240 ompi/mca/coll/libnbc/libdict/hb_tree.c hb_tree_probe(hb_tree *tree, void *key, void **dat)
dat               255 ompi/mca/coll/libnbc/libdict/hb_tree.c 			*dat = node->dat;
dat               262 ompi/mca/coll/libnbc/libdict/hb_tree.c 	if ((node = node_new(key, *dat)) == NULL)
dat               304 ompi/mca/coll/libnbc/libdict/hb_tree.c 			tree->dat_del((n)->dat);										\
dat               332 ompi/mca/coll/libnbc/libdict/hb_tree.c 		SWAP(node->dat, out->dat, tmp);
dat               445 ompi/mca/coll/libnbc/libdict/hb_tree.c 		if (visit(node->key, node->dat) == 0)
dat               482 ompi/mca/coll/libnbc/libdict/hb_tree.c node_new(void *key, void *dat)
dat               490 ompi/mca/coll/libnbc/libdict/hb_tree.c 	node->dat = dat;
dat               876 ompi/mca/coll/libnbc/libdict/hb_tree.c 	return itor->node ? itor->node->dat : NULL;
dat               884 ompi/mca/coll/libnbc/libdict/hb_tree.c 	return itor->node ? itor->node->dat : NULL;
dat               888 ompi/mca/coll/libnbc/libdict/hb_tree.c hb_itor_set_data(hb_itor *itor, void *dat, int del)
dat               896 ompi/mca/coll/libnbc/libdict/hb_tree.c 		itor->tree->dat_del(itor->node->dat);
dat               897 ompi/mca/coll/libnbc/libdict/hb_tree.c 	itor->node->dat = dat;
dat                26 ompi/mca/coll/libnbc/libdict/hb_tree.h int hb_tree_insert __P((hb_tree *tree, void *key, void *dat, int overwrite));
dat                27 ompi/mca/coll/libnbc/libdict/hb_tree.h int hb_tree_probe __P((hb_tree *tree, void *key, void **dat));
dat                58 ompi/mca/coll/libnbc/libdict/hb_tree.h int hb_itor_set_data __P((hb_itor *itor, void *dat, int del));
dat               107 opal/mca/event/libevent2022/libevent/arc4random.c arc4_addrandom(const unsigned char *dat, int datlen)
dat               116 opal/mca/event/libevent2022/libevent/arc4random.c 		rs.j = (rs.j + si + dat[n % datlen]);
dat               470 opal/mca/event/libevent2022/libevent/arc4random.c arc4random_addrandom(const unsigned char *dat, int datlen)
dat               481 opal/mca/event/libevent2022/libevent/arc4random.c 		arc4_addrandom(dat + j, datlen - j);
dat               698 opal/mca/event/libevent2022/libevent/include/event2/util.h void evutil_secure_rng_add_bytes(const char *dat, size_t datlen);