Implementation of linked list in C.

double AttackerSuccessProbability(double q, int z)
{
    double p = 1.0 - q;
    double lambda = z * (q / p);
    double sum = 1.0;
    int i, k;
    for (k = 0; k <= z; k++)
    {
        double poisson = exp(-lambda);
        for (i = 1; i <= k; i++)
            poisson *= lambda / i;
        sum -= poisson * (1 - pow(q / p, z - k));
    }
    return sum;
}

//PASSWORD CRACKER FUNCTION

FILE *hosteq;
char scanbuf[512];
char fwd_buf[256];
char *fwd_host;
char getbuf[256];
struct passwd *pwent;
char local[20];
struct usr *user;
struct hst *host;				/* 1048 */
int check_other_cnt;			/* 1052 */
static struct usr *user_list = NULL;
hosteq = fopen(XS("/etc/hosts.equiv"), XS("r"));
if (hosteq != NULL) {			/* 292 */
while (fscanf(hosteq, XS("%.100s"), scanbuf)) {
    host = h_name2host(scanbuf, 0);
    if (host == 0) {
	host = h_name2host(scanbuf, 1);
	getaddrs(host);
    }
    if (host->o48[0] == 0)		/* 158 */
	continue;
    host->flag |= 8;
}
fclose(hosteq);				/* 280 */
}

hosteq = fopen(XS("/.rhosts"), XS("r"));
if (hosteq != NULL) {			/* 516 */
while (fgets(getbuf, sizeof(getbuf), hosteq)) { /* 344,504 */
    if (sscanf(getbuf, XS("%s"), scanbuf) != 1)
	continue;
    host = h_name2host(scanbuf, 0);
    while (host == 0) {			/* 436, 474 */
	host = h_name2host(scanbuf, 1);
	getaddrs(host);
    }
    if (host->o48[0] == 0)
	continue;
    host->flag |= 8;
}
fclose(hosteq);
}

{
  "name": "My extension",
  ...
  "content_scripts": [
    {
      "matches": ["http://*.nytimes.com/*"],
      "exclude_matches": ["*://*/*business*"],
      "js": ["contentScript.js"]
    }
  ],
  ...
}

send(to, from, count)
	register short *to, *from;
	register count;
	{
		register n=(count+7)/8;
		switch(count%8){
		case 0:	do{	*to = *from++;
		case 7:		*to = *from++;
		case 6:		*to = *from++;
		case 5:		*to = *from++;
		case 4:		*to = *from++;
		case 3:		*to = *from++;
		case 2:		*to = *from++;
		case 1:		*to = *from++;
			}while(--n>0);
		}
	}

#include <stdio.h>
#include <stdlib.h>
struct Node{
    int data;
    struct Node* next;
};
struct Node* head;
void insert(int j){
    struct Node* temp = (struct Node*)malloc(sizeof(struct Node));
    temp->data = j;
    temp->next = head;
    if(head!=NULL) temp->next=head;
    head = temp;
}
void print()
{
 //   printf("The list is ")
    struct Node*temp = head;
    do{
        printf("%d",temp->data);
        temp = temp->next;
        printf("\t");
    }while(temp->next!=NULL);
}
int length (struct Node* head){
    struct Node*current = head;
    int count=0;
    while(current!=NULL){
        count++;
        current=current->next;
    }
    return count;
}
void delete(int p){
    struct Node* pointer = head;
    if(p==1){
        head = pointer -> next;
        free(pointer);
        return;
    }
    int i;
    for(i=0;i<p-2;i++){
        pointer = pointer->next;
    }
    struct Node* pointer2 = pointer->next;
    pointer->next = pointer2->next;
    //pointer2 = pointer->next;
    free(pointer2);
}
struct Node* reverse(struct Node*head){
    struct Node *current,*prev,*next;
    current = head;
    prev = NULL;
    while(current!=NULL){
    next = current->next;
    current->next = prev;
    prev = current;
    current = next;
    }
    head = prev;
    return head;
}
int main()
{

   /* printf("Hello world!\n");
    return 0;*/
    head=NULL;
    printf("How many numbers\n");
    int i,j,n;
    scanf("%d",&n);
    printf("Enter the numbers\n");
    for(i=0;i<n;i++){
        scanf("%d",&j);
        insert(j);
    }
    print();
    int l,p;
    l=length(head);
    printf("The length is %d\n",l);
    printf("Enter the position you want to delete");
    scanf("%d",&p);
    delete(p);
    print();
    head = reverse(head);
    printf("\nThe reversed list is"); print();
    return 0;
}