kk Blog —— 通用基础

#include <linux/module.h>
#include <linux/kernel.h>
#include <linux/init.h>
#include <linux/workqueue.h>
#include <linux/timer.h>
#include <linux/in.h>
#include <linux/inet.h>
#include <linux/socket.h>
#include <net/sock.h>

struct socket     *sock;

unsigned char buffer[10]=
{ 1,2,3,4,5,6,7,8,9,0,};

static int ker_send_udp(char* ip_addr, unsigned char * data, size_t len )
{
	int ret;
	u32 remote_ip = in_aton(ip_addr);
  
	struct sockaddr_in sin = {
		.sin_family = AF_INET,
		.sin_port = htons(65530),
		.sin_addr = {.s_addr = remote_ip}
	};
 
	struct kvec iov = {.iov_base = (void *)data, .iov_len = len};
	struct msghdr udpmsg;

	udpmsg.msg_name = (void *)&sin;
	udpmsg.msg_namelen = sizeof(sin);
	udpmsg.msg_control = NULL;
	udpmsg.msg_controllen = 0;
	udpmsg.msg_flags=0;

	ret = kernel_sendmsg(sock, &udpmsg, &iov, 1, len);
	printk("rets = %d\n",ret);
   
	return 0;
}

static int socket_init (void)
{
	int ret;
	ret = sock_create_kern (PF_INET, SOCK_DGRAM,IPPROTO_UDP, &sock);
	printk("retc = %d\n",ret);
   
	ker_send_udp("192.168.1.253", buffer, 10);
	return 0;
}

static void socket_exit (void)
{   
	sock_release (sock);
}

module_init (socket_init);
module_exit (socket_exit);
MODULE_LICENSE ("GPL");

Oops: 0002 [#1]

 * error_code:
 *      bit 0 == 0 means no page found, 1 means protection fault
 *      bit 1 == 0 means read, 1 means write
 *      bit 2 == 0 means kernel, 1 means user-mode
 *      bit 3 == 0 means data, 1 means instruction

  1: 'G' if all modules loaded have a GPL or compatible license, 'P' if any proprietary module has been loaded.  Modules without a MODULE_LICENSE or with a MODULE_LICENSE that is not recognised by insmod as GPL compatible are assumed to be proprietary.
  2: 'F' if any module was force loaded by "insmod -f", ' ' if all modules were loaded normally.
  3: 'S' if the oops occurred on an SMP kernel running on hardware that hasn't been certified as safe to run multiprocessor. Currently this occurs only on various Athlons that are not SMP capable.
  4: 'R' if a module was force unloaded by "rmmod -f", ' ' if all modules were unloaded normally.
  5: 'M' if any processor has reported a Machine Check Exception, ' ' if no Machine Check Exceptions have occurred.
  6: 'B' if a page-release function has found a bad page reference or some unexpected page flags.
  7: 'U' if a user or user application specifically requested that the Tainted flag be set, ' ' otherwise.
  8: 'D' if the kernel has died recently, i.e. there was an OOPS or BUG.
  9: 'A' if the ACPI table has been overridden.
 10: 'W' if a warning has previously been issued by the kernel. (Though some warnings may set more specific taint flags.)
 11: 'C' if a staging driver has been loaded.
 12: 'I' if the kernel is working around a severe bug in the platform firmware (BIOS or similar).

Definition
      
Class:    CirclesSeparation
Method:   minimumWork
Parameters:   double[], double[], double[], double[]
Returns:  double[]
Method signature: double[] minimumWork(double[] x, double[] y, double[] r, double[] m)
(be sure your method is public)

import java.util.*;
import java.io.*;
import java.math.*;
public class CirclesSeparation {
  int N, now;
  double ox[] = new double[1000], oy[] = new double[1000];
  double x[] = new double[1000], y[] = new double[1000];
  double r[] = new double[1000], m[] = new double[1000];
  boolean touch(int i,int j)
  {
      double dis = (x[i]-x[j])*(x[i]-x[j]) + (y[i]-y[j])*(y[i]-y[j]);
      if (dis > (r[i]+r[j]) * (r[i]+r[j])) {
          return false;
      }
      return true;
  }
  void dfsMove(int ok, int j)
  {
      double px = x[j] - x[ok];
      double py = y[j] - y[ok];
      double dis = Math.sqrt((x[j]-x[ok])*(x[j]-x[ok]) + (y[j]-y[ok])*(y[j]-y[ok]));
      double dd = r[ok] + r[j] - dis + 0.001;
      x[j] += dd * px / dis;
      y[j] += dd * py / dis;
      //System.out.println(x[j] + "\t" + y[j]);
      int i;
      for (i=0;i<=now;i++) {
          if (i != j && touch(i, j)) {
              dfsMove(j, i);
          }
      }
  }
  public double[] minimumWork(double[] ix, double[] iy, double[] ir, double[] im) {
      int i,j,k,l;
      N = ix.length;
      for (i=0;i<N;i++) {
          ox[i] = ix[i];
          oy[i] = iy[i];
          x[i] = ix[i];
          y[i] = iy[i];
          r[i] = ir[i];
          m[i] = im[i];
      }
      for (i=1;i<N;i++)
      {
          now = i;
          for (j=0;j<i;j++) {
              if (!touch(i, j)) continue;
              dfsMove(i, j);
          }
      }
      double ret[] = new double[N+N];
      for (i=0;i<N;i++) {
          ret[i+i] = x[i];
          ret[i+i+1] = y[i];
      }
      return ret;
  }
}

N = parseInt(readLine())
for (i=0; i < N; i++)
	x[i] = parseDouble(readLine())
for (i=0; i < N; i++)
	y[i] = parseDouble(readLine())
for (i=0; i < N; i++)
	r[i] = parseDouble(readLine())
for (i=0; i < N; i++)
	m[i] = parseDouble(readLine())
ret = minimumWork(x, y, r, m)
for (i=0; i < 2*N; i++)
	printLine(ret[i])
flush(stdout)

public static void main(String[] args) {
	Scanner cin = new Scanner(System.in);
	double x[], y[], r[], m[], ret[];
	int N, i;
	N = cin.nextInt();
	x = new double[N];
	y = new double[N];
	r = new double[N];
	m = new double[N];
	for (i=0;i<N;i++) x[i] = cin.nextDouble();
	for (i=0;i<N;i++) y[i] = cin.nextDouble();
	for (i=0;i<N;i++) r[i] = cin.nextDouble();
	for (i=0;i<N;i++) m[i] = cin.nextDouble();
	CirclesSeparation rrr = new CirclesSeparation();
	ret = rrr.minimumWork(x, y, r, m);
	for (i=0;i<N+N;i++) {
		System.out.println(ret[i]);
	}
}

$ javac CirclesSeparation.java

java -jar CirclesSeparationVis.jar -exec "<command>"

java 的<command>是 java CirclesSeparation

java -jar CirclesSeparationVis.jar -exec "java CirclesSeparation" 

java CirclesSeparationVis -exec "java CirclesSeparation"