Return to rosapresult.c CVS log

Up to [CSRG BSD Unix] / 43BSDReno / contrib / isode-beta / rosap

BSD 4.3reno

/* rosapresult.c - ROPM: result */

#ifndef	lint
static char *rcsid = "$Header: /var/lib/cvsd/repos/CSRG/43BSDReno/contrib/isode-beta/rosap/rosapresult.c,v 1.1.1.1 2018/04/24 16:12:56 root Exp $";
#endif

/* 
 * $Header: /var/lib/cvsd/repos/CSRG/43BSDReno/contrib/isode-beta/rosap/rosapresult.c,v 1.1.1.1 2018/04/24 16:12:56 root Exp $
 *
 * Based on an TCP-based implementation by George Michaelson of University
 * College London.
 *
 *
 * $Log: rosapresult.c,v $
 * Revision 1.1.1.1  2018/04/24 16:12:56  root
 * BSD 4.3reno
 *
 * Revision 7.1  90/07/01  21:06:04  mrose
 * pepsy
 * 
 * Revision 6.0  89/03/18  23:42:28  mrose
 * Release 5.0
 * 
 */

/*
 *				  NOTICE
 *
 *    Acquisition, use, and distribution of this module and related
 *    materials are subject to the restrictions of a license agreement.
 *    Consult the Preface in the User's Manual for the full terms of
 *    this agreement.
 *
 */


/* LINTLIBRARY */

#include <stdio.h>
#include <signal.h>
#include "ROS-types.h"
#include "ropkt.h"

/*    RO-RESULT.REQUEST */

int	RoResultRequest (sd, invokeID, op, result, priority, roi)
int	sd;
int	invokeID,
	op,
	priority;
PE	result;
struct RoSAPindication *roi;
{
    SBV	    smask;
    int     status;
    register struct assocblk   *acb;

    missingP (roi);

    smask = sigioblock ();

    rosapPsig (acb, sd);

    status = RoResultRequestAux (acb, invokeID, op, result, priority, roi);

    (void) sigiomask (smask);

    return status;
}

/*  */

static int  RoResultRequestAux (acb, invokeID, op, result, priority, roi)
register struct assocblk   *acb;
int	invokeID,
	op,
	priority;
PE	result;
struct RoSAPindication *roi;
{
    register PE pe,
		p,
		q;

    if ((acb -> acb_flags & ACB_INIT) && (acb -> acb_flags & ACB_ROS))
	return rosaplose (roi, ROS_OPERATION, NULLCP, "not responder");
    if (!(acb -> acb_flags & ACB_ACS)) {
	missingP (result);
    }

    if (acb -> acb_ready
	    && !(acb -> acb_flags & ACB_TURN)
	    && (*acb -> acb_ready) (acb, priority, roi) == NOTOK)
	return NOTOK;

#ifdef notyet
    if (!(acb -> acb_flags & ACB_ACS)) { /* want OPDU */
	struct type_ROS_OPDU opdu;
	struct type_ROS_ReturnResult rrs;
	struct type_ROS_InvokeIDType idtyp;

	opdu.offset = type_ROS_OPDU_2; 
	opdu.un.choice_ROS_9 = &rrs;
	rrs.invokeID = &idtyp;
	rrs.result = result;
	idtyp.parm = invokeID;

        if (encode_ROS_OPDU(&pe, 1, 0, NULL, &opdu) == NOTOK) {
	    abort();
	    goto fail;
	}
    } else {
	struct type_ROS_ROSEapdus apdu;
	struct type_ROS_RORSapdu ras;
	struct type_ROS_InvokeIDType idtyp;
	struct element_ROS_1 el1;
	struct type_ROS_Operation ops;

	apdu.offset = type_ROS_ROSEapdus_rors__apdu;
	apdu.un.rors__apdu = &ras;
	idtyp.parm = invokeID;
	ras.invokeID = &idtyp;
	if (result) {
	    ras.element_ROS_0 = &el1;
	    el1.operation__value = &ops;
	    ops.parm = op;
	    el1.result = result;
	} else
	    ras.element_ROS_0 = (struct element_ROS_1 *)0;

	if (encode_ROS_ROSEapdus(&pe, 1, 0, NULL, &apdu) == NOTOK) {
	fail:
	    if (pe) {
		(void) pe_extract (pe, result);
		pe_free (pe);
	    }
	    freeacblk (acb);
	    return rosaplose (roi, ROS_CONGEST, NULLCP, "out of memory");
	}
    }

#endif

/* begin Result APDU */
    if ((pe = pe_alloc (PE_CLASS_CONT, PE_FORM_CONS, APDU_RESULT)) == NULLPE
	    || ((acb -> acb_flags & ACB_ACS)
		    ? (p = pe, 0)
		    : set_add (pe, p = pe_alloc (PE_CLASS_UNIV, PE_FORM_CONS,
			PE_CONS_SEQ)) == NOTOK)
	    || seq_add (p, int2prim (invokeID), -1) == NOTOK
	    || ((acb -> acb_flags & ACB_ACS)
		    ? (result
		           && (seq_add (p, q = pe_alloc (PE_CLASS_UNIV,
							 PE_FORM_CONS,
							 PE_CONS_SEQ),
					-1) == NOTOK
			           || seq_add (q, int2prim (op), -1) == NOTOK
			           || seq_add (q, result, -1) == NOTOK))
		    : seq_add (p, result, -1) == NOTOK)) {
	if (pe) {
	    (void) pe_extract (pe, result);
	    pe_free (pe);
	}
	freeacblk (acb);
	return rosaplose (roi, ROS_CONGEST, NULLCP, "out of memory");
    }
/* end Result APDU */

    return (*acb -> acb_putosdu) (acb, pe, result, priority, roi);
}

This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.