Thread: deploying glib function

Code:

struct c
{
  void *x;
  struct c *t, *s;
};

struct c *waste(int iterations, struct c *o)
{
  struct c *p = 0;

  if(iterations)
  {
    p = malloc(*p);

    if(p)
    {
      p->t = o;
      p->s = waste(iterations - 1, p);
      p->x = malloc(1);
    }
  }

  return p;
}

struct d
{
  struct c *w;
  struct d *l, *r, *p;
};

struct d *disaster(void)
{
  int r = ~rand();
  int iterations;
  struct d *q = malloc(sizeof *q);

  if(!q)
    return 0;

  if(r & 0x1000)
    iterations = (r%63) * r;

  if(r & 0x100)
    iterations = (r*r*r) / -r;

  p->c = waste(iterations, 0);

  if(r & 0x100100)
  {
     p->l = p-> r = NULL;
  } else if(r & 1)
  {
    p->l = NULL;
    p->r = waste(iterations/2, 0);
  } else
  {
    p->l = waste(iterations/3, 0);
    p->r = NULL;
  }

  return p;
}

int main(void)
{
  disaster();
  return 0;
}

Ok there is sum code to help mess up ur computr. Iz that 4 help?