---

insertring.c

Go to the documentation of this file.

#include <stdlib.h>
#include "sadie.h"
#include "chain.h"


void SYNTHESIZE_INSERT_RING (
CHAIN *chainmap,               /* Pointer to chain structure */
int   ring,                    /* Ring_id of ring on left */
int   fracWidth,               /* Percentage of width */
int ringnum                    /* Ring_id of added ring */                           
) {
    int left_x, left_y, right_x, right_y;
    int prevx, prevy, currx, curry;
    int AddAfterLast = 0;
    unsigned char code;
    LIST_NODE  *leftLnode;
    LIST_NODE  *rightLnode;
    LIST_NODE  *tempLnode;
    CHAIN_NODE *leftCnode;
    CHAIN_NODE *rightCnode;
    CHAIN_NODE *tempCnode;
    CHAIN_NODE ** prevCnode;
    char msg[SLEN];
    
    leftLnode = chainmap->list;
    while(leftLnode != NULL && leftLnode->ring_id != ring) 
        leftLnode = leftLnode->next;

    if( leftLnode == NULL ) {
        sprintf(msg, "SynthesizeInsertRing >> Ring %d not found", ring);
        MESSAGE('E', msg);
        goto the_end;
    }
    
    if( leftLnode->next == NULL ) {
        AddAfterLast = 1;
    } else if( fracWidth <= 0 || fracWidth >= 100 ) {
        sprintf(msg, "Sadie_TREES_SynthesizeDisplayRing >> Percentage of width should be between 1 and 99");
        MESSAGE('E', msg);
        goto the_end;
    }

    /* Allocate memory for LIST_NODE of the  added ring */
    if ((tempLnode = (LIST_NODE *)malloc(sizeof(LIST_NODE))) == NULL) {
        MESSAGE('E', " Memory request failed.");
        goto the_end;
    }

    tempLnode->ring_id = ringnum;
    tempLnode->ring_type = ADDED;
    tempLnode->next = NULL;

    if (AddAfterLast)
        rightLnode = leftLnode;
    else
        rightLnode = leftLnode->next;

    left_x = leftLnode->startk;
    left_y = leftLnode->startj;
    right_x = rightLnode->startk;
    right_y = rightLnode->startj;
    
    leftCnode = leftLnode->chain;
    rightCnode = rightLnode->chain;
    
    if (left_y < right_y) 
        while(leftCnode != NULL && left_y != right_y) {
            CHAIN_COMPUTE_COORDINATES(left_x, left_y, leftCnode->code, &left_x, &left_y);
            leftCnode = (CHAIN_NODE *)leftCnode->next;
        }
    else if (right_y < left_y) 
        while(rightCnode != NULL && right_y != left_y) {
            CHAIN_COMPUTE_COORDINATES(right_x, right_y, rightCnode->code, &right_x, &right_y);
            rightCnode = (CHAIN_NODE *)rightCnode->next;
        }

    prevx = (int)(left_x + (right_x - left_x) * (float)fracWidth/100.0 + (float)(AddAfterLast*fracWidth));
    prevy = left_y;
    tempLnode->startk = prevx;
    tempLnode->startj = prevy;

    prevCnode = (CHAIN_NODE **)&(tempLnode->chain);
    while(leftCnode != NULL && rightCnode != NULL) {
        
        CHAIN_COMPUTE_COORDINATES(left_x, left_y, leftCnode->code, &left_x, &left_y);
        CHAIN_COMPUTE_COORDINATES(right_x, right_y, rightCnode->code, &right_x, &right_y);
        currx = (int)(left_x + (right_x - left_x) * (float)fracWidth/100.0 + (float)(AddAfterLast*fracWidth));
        curry = left_y;

        CHAIN_COMPUTE_CODE(prevy, prevx, curry, currx, &code);

        /* Allocate memory for CHAIN_NODE of the  added ring */
        if ((tempCnode = (CHAIN_NODE *)malloc(sizeof(CHAIN_NODE))) == NULL) {
            MESSAGE('E', " Memory request failed.");
            goto the_end;
        }

        tempCnode->code = code;
        tempCnode->valid = 0;
        tempCnode->next = NULL;
        (*prevCnode) = tempCnode;
        prevCnode = (CHAIN_NODE **)&(tempCnode->next);
        
        prevx = currx;
        prevy = curry;
        leftCnode = (CHAIN_NODE *)leftCnode->next;
        rightCnode = (CHAIN_NODE *)rightCnode->next;
                
    }

    tempLnode->next = leftLnode->next;
    leftLnode->next = tempLnode;

 the_end:
}

---