+gras_msg_t gras_msg_recv_any(void)
+{
+ gras_trp_procdata_t trp_proc =
+ (gras_trp_procdata_t) gras_libdata_by_name("gras_trp");
+ gras_msg_t msg;
+ /* Build a dynar of all communications I could get something from */
+ xbt_dynar_t comms = xbt_dynar_new(sizeof(smx_comm_t), NULL);
+ unsigned int cursor = 0;
+ int got = 0;
+ smx_comm_t comm = NULL;
+ gras_socket_t sock = NULL;
+ gras_trp_sg_sock_data_t sock_data;
+ xbt_dynar_foreach(trp_proc->sockets, cursor, sock) {
+ sock_data = (gras_trp_sg_sock_data_t) sock->data;
+
+
+ DEBUG5
+ ("Consider socket %p (data:%p; Here rdv: %p; Remote rdv: %p; Comm %p) to get a message",
+ sock, sock_data,
+ (sock_data->server ==
+ SIMIX_process_self())? sock_data->
+ rdv_server : sock_data->rdv_client,
+ (sock_data->server ==
+ SIMIX_process_self())? sock_data->
+ rdv_client : sock_data->rdv_server, sock_data->comm_recv);
+
+
+ /* The following assert fails in some valid conditions, we need to
+ * change the code downward looking for the socket again.
+ *
+ * For now it relies on the facts (A) that sockets and comms are aligned
+ * (B) every sockets has a posted irecv in comms
+ *
+ * This is not trivial because we need that alignment to hold after the waitany(), so
+ * after other processes get scheduled.
+ *
+ * I cannot think of conditions where they get desynchronized (A violated) as long as
+ * 1) only the listener calls that function
+ * 2) Nobody but the listener removes sockets from that set (in main listener loop)
+ * 3) New sockets are added at the end, and signified ASAP to the listener (by awaking him)
+ * The throw bellow ensures that B is never violated without failing out loudly.
+ *
+ * We cannot search by comparing the comm object pointer that object got
+ * freed by the waiting process (down in smx_network, in
+ * comm_wait_for_completion or comm_cleanup). So, actually, we could
+ * use that pointer since that's a dangling pointer, but no one changes it.
+ * I still feel unconfortable with using dangling pointers, even if that would
+ * let the code work even if A and/or B are violated, provided that
+ * (C) the new irecv is never posted before we return from waitany to that function.
+ *
+ * Another approach, robust to B violation would be to retraverse the socks dynar with
+ * an iterator, incremented only when the socket has a comm. And we've the right socket
+ * when that iterator is equal to "got", the result of waitany. Not needed if B holds.
+ */
+ xbt_assert1(sock_data->comm_recv,
+ "Comm_recv of socket %p is empty; please report that nasty bug",
+ sock);
+ /* End of paranoia */
+
+ VERB3("Copy comm_recv %p rdv:%p (other rdv:%p)",
+ sock_data->comm_recv,
+ (sock_data->server ==
+ SIMIX_process_self())? sock_data->
+ rdv_server : sock_data->rdv_client,
+ (sock_data->server ==
+ SIMIX_process_self())? sock_data->
+ rdv_client : sock_data->rdv_server);
+ xbt_dynar_push(comms, &(sock_data->comm_recv));
+ }
+ VERB1("Wait on %ld 'sockets'", xbt_dynar_length(comms));
+ /* Wait for the end of any of these communications */
+ got = SIMIX_network_waitany(comms);
+
+ /* retrieve the message sent in that communication */
+ xbt_dynar_get_cpy(comms, got, &(comm));
+ msg = SIMIX_communication_get_data(comm);
+ VERB1("Got something. Communication %p's over", comm);
+ SIMIX_communication_destroy(comm);
+
+ /* Reinstall a waiting communication on that rdv */
+ /* Get the sock again
+ * For that, we use the fact that */
+ sock = xbt_dynar_get_as(trp_proc->sockets, got, gras_socket_t);
+/* xbt_dynar_foreach(trp_proc->sockets,cursor,sock) {
+ sock_data = (gras_trp_sg_sock_data_t) sock->data;
+ if (sock_data->comm_recv && sock_data->comm_recv == comm)
+ break;
+ }
+ */
+ sock_data = (gras_trp_sg_sock_data_t) sock->data;
+ sock_data->comm_recv =
+ SIMIX_network_irecv(sock_data->rdv_server != NULL ?
+ //(sock_data->server==SIMIX_process_self())?
+ sock_data->rdv_server
+ : sock_data->rdv_client, NULL, 0);
+
+ return msg;