node *insertbefore(node *oldnode, node *newnode) {
insertafter(oldnode,newnode);
int temp=newnode->data;
newnode->data=oldnode->data;
oldnode->data=temp;
return oldnode;
}
int main(int argc, char* argv[])
{
struct node *ptr1, *ptr2;
listinitialize();
ptr1 = insertafter(1, head);
ptr2 = insertafter(2, ptr1);
ptr1 = insertafter(3, ptr2);
printkeys(); printf("\n");
exchange(head, ptr2);
printkeys(); printf("\n");
movenexttofront(ptr2);
printkeys(); printf("\n");
deletenext(head);
printkeys();
return 0;
}
/* delete the specific node by passing that address
{
struct Node* temp = node_ptr->next;
node_ptr->data = temp->data;
node_ptr->next = temp->next;
free(temp);
}*/
int main()
{
struct Node* first;
struct Node* second;
struct Node* third;
first = (struct Node*)malloc(sizeof(struct Node*));
second = (struct Node*)malloc(sizeof(struct Node*));
third = (struct Node*)malloc(sizeof(struct Node*));
first -> data = 1;
first -> next = second;
second -> data = 2;
second -> next = third;
third -> data = 3;
third -> next = NULL;
addatbeg(&first,10);
append(&first,100);
insertafter(&first,2,80);
del(&first,3);
printlist(first);
return 0;
}
static void insertrootlist(PQueue *h, PQueueElement *x)
{
if (h->Root == NULL) {
h->Root = x;
x->Left = x;
x->Right = x;
return;
}
insertafter(h->Root, x);
}
void
tilemovemouse(const Arg *arg) {
/* Could EnterNotify events be used instead? */
Client *c, *d;
Monitor *m;
XEvent ev;
int x, y;
Bool after;
if(!(c = selmon->sel))
return;
if((m = recttomon(c->x, c->y, c->w, c->h)) != selmon) {
sendmon(c, m);
selmon = m;
focus(NULL);
}
if(c->isfloating || !selmon->lt[selmon->sellt]->arrange){
movemouse(NULL);
return;
}
if(XGrabPointer(dpy, root, False, MOUSEMASK, GrabModeAsync, GrabModeAsync,
None, cursor[CurMove], CurrentTime) != GrabSuccess)
return;
do {
XMaskEvent(dpy, MOUSEMASK|ExposureMask|SubstructureRedirectMask, &ev);
switch (ev.type) {
case ConfigureRequest:
case Expose:
case MapRequest:
handler[ev.type](&ev);
break;
case MotionNotify:
x = ev.xmotion.x;
y = ev.xmotion.y;
after = False;
for(d = nexttiled(m->clients); d; d = nexttiled(d->next)){
if(d == c)
after = True;
else if(INRECT(x, y, d->x, d->y, d->w+2*borderpx, d->h+2*borderpx)){
detach(c);
after ? insertafter(c, d) : insertbefore(c,d);
arrange(c->mon);
break;
}
}
}
} while(ev.type != ButtonRelease);
XUngrabPointer(dpy, CurrentTime);
}
/*
Control flow struct optimizations.
Transform follow struct to do-while loop
LABEL:
IR-LIST
IF DET
GOTO LABEL
...(DEAD CODE)
ELSE
FALSE-PART
ENDIF
is replace by
DO {
IR-LIST
} WHILE DET
FALSE-PART
*/
bool IR_CFS_OPT::trans_to_do_while_loop(IR ** head, IR * ir)
{
IS_TRUE(head != NULL && *head != NULL, ("invalid parameter"));
if (ir->is_lab()) {
IR * t = ir;
LABEL_INFO * li = LAB_lab(ir);
while (t != NULL) {
if (IR_type(t) == IR_IF) {
if (IF_truebody(t) != NULL &&
IR_type(IF_truebody(t)) == IR_GOTO &&
is_same_label(LAB_lab(ir), GOTO_lab(IF_truebody(t)))) {
//start transform...
IR * dowhile = m_ru->new_ir(IR_DO_WHILE);
LOOP_det(dowhile) = m_ru->dup_irs(LOOP_det(t));
IR * if_stmt = t;
t = IR_next(ir);
while (t != NULL && t != if_stmt) {
IR * c = t;
t = IR_next(t);
remove(head, c);
add_next(&LOOP_body(dowhile), c);
}
IS_TRUE(t == if_stmt, ("???"));
remove(head, if_stmt);
if (IF_falsebody(if_stmt)) {
add_next(&dowhile, IF_falsebody(if_stmt));
IF_falsebody(if_stmt) = NULL;
}
insertafter(&ir, dowhile);
m_ru->free_irs(if_stmt); //free IF
remove(head, ir);
m_ru->free_irs(ir); //free LABEL
return true;
}
}
t = IR_next(t);
}
}
return false;
}
static inline void insertbefore(PQueueElement *a, PQueueElement *b)
{
insertafter(a->Left, b);
}
/* The followed forms
if (cond) {
t=1
a=1
goto L1;
}
f=1
goto L2;
L1:
is replaced by
if (!cond) {
f=1
goto L2;
}
t=1
a=1
L1:
'goto L1' is removed and free, and L1 is removed if it is not a target
of some other instruction. */
bool IR_CFS_OPT::trans_if1(IR ** head, IR * ir)
{
IS_TRUE(head && *head, ("invalid parameter"));
if (ir == NULL || IR_type(ir) != IR_IF) { return false; }
//Check true part.
IR * t = IF_truebody(ir);
while (t != NULL) {
if (!is_non_branch_ir(t)) {
break;
}
t = IR_next(t);
}
if (t != NULL && IR_next(t) == NULL && IR_type(t) == IR_GOTO) {
IR * first_goto = t;
t = IR_next(ir);
while (t != NULL) {
if (!is_non_branch_ir(t)) break;
t = IR_next(t);
}
if (t != NULL && IR_type(t) == IR_GOTO) {
IR * second_goto = t;
if (IR_next(second_goto) != NULL &&
IR_next(second_goto)->is_lab() &&
is_same_label(GOTO_lab(first_goto),
LAB_lab(IR_next(second_goto)))) {
//Here we start to transform...
m_ru->invert_cond(&IF_det(ir));
IR * new_list1 = NULL;
IR * new_list2 = NULL;
t = IF_truebody(ir);
//Split true body of IF.
IR * last = NULL;
while (t != first_goto) {
IR * c = t;
t = IR_next(t);
remove(&IF_truebody(ir), c);
add_next(&new_list1, &last, c);
}
IS_TRUE(t && t == first_goto, ("invalid control flow"));
remove(&IF_truebody(ir), first_goto);
m_ru->free_irs(first_goto);
//Split all irs between IF and L1.
t = IR_next(ir);
while (t != second_goto) {
IR * c = t;
t = IR_next(t);
remove(head, c);
add_next(&new_list2, c);
}
IS_TRUE(t != NULL && t == second_goto, ("???"));
remove(head, second_goto);
add_next(&new_list2, second_goto);
//Swap new_list1 and new_list2
insertbefore(&IF_truebody(ir), IF_truebody(ir), new_list2);
//Update the IR_parent for new_list2.
for (IR * tmp = new_list2; tmp != NULL; tmp = IR_next(tmp)) {
IR_parent(tmp) = ir;
}
IS_TRUE(IF_truebody(ir) == new_list2,
("illegal insertbefore<T>"));
insertafter(&ir, new_list1);
//Update the IR_parent for new_list1.
for (IR * tmp = new_list1; tmp != NULL; tmp = IR_next(tmp)) {
IR_parent(tmp) = IR_parent(ir);
}
return true;
}
}
}
return false;
}
