Deleted Added
full compact
primes.c (23726) primes.c (28979)
1/*
2 * Copyright (c) 1989, 1993
3 * The Regents of the University of California. All rights reserved.
4 *
5 * This code is derived from software contributed to Berkeley by
6 * Landon Curt Noll.
7 *
8 * Redistribution and use in source and binary forms, with or without

--- 101 unchanged lines hidden (view full) ---

110 int argc;
111 char *argv[];
112{
113 ubig start; /* where to start generating */
114 ubig stop; /* don't generate at or above this value */
115 int ch;
116 char *p;
117
1/*
2 * Copyright (c) 1989, 1993
3 * The Regents of the University of California. All rights reserved.
4 *
5 * This code is derived from software contributed to Berkeley by
6 * Landon Curt Noll.
7 *
8 * Redistribution and use in source and binary forms, with or without

--- 101 unchanged lines hidden (view full) ---

110 int argc;
111 char *argv[];
112{
113 ubig start; /* where to start generating */
114 ubig stop; /* don't generate at or above this value */
115 int ch;
116 char *p;
117
118 /* revoke */
119 setegid(getgid());
120 setgid(getgid());
121
118 while ((ch = getopt(argc, argv, "")) != EOF)
119 switch (ch) {
120 case '?':
121 default:
122 usage();
123 }
124 argc -= optind;
125 argv += optind;

--- 208 unchanged lines hidden ---
122 while ((ch = getopt(argc, argv, "")) != EOF)
123 switch (ch) {
124 case '?':
125 default:
126 usage();
127 }
128 argc -= optind;
129 argv += optind;

--- 208 unchanged lines hidden ---