summaryrefslogtreecommitdiff
path: root/eppic_scripts
diff options
context:
space:
mode:
authorAruna Balakrishnaiah <aruna@linux.vnet.ibm.com>2014-02-27 15:32:17 +0900
committerAtsushi Kumagai <kumagai-atsushi@mxc.nes.nec.co.jp>2014-03-10 13:10:18 +0900
commitd3ad960d2becd0c6a8414a06f3f1dd91d6a77c5a (patch)
treec8cb8f5cfda2108dde109414dacec5ea09b289aa /eppic_scripts
parent38be4d8989841e86c5b56c9bd324201a19d10821 (diff)
[PATCH 06/11] eppic: Scrub data of udp socket buffers.
Find all udp sockets (struct sock *sk) udp sockets: Iterate from 0 to udp_table->mask and get udp_hslot from hash table: for (i = 0; i < udp->table->mask; i++) { struct udp_hslot *hslot = udp_table->hash[i]; ... } For each hslot iterate over hslot->head null list to get sockets: struct sock *sk; sk_nulls_for_each(sk, node, &hslot->head) { ... } For each socket iterate over the socket buffers in sk_receive_queue and sk_write_queue: struct sock { ... struct sk_buff_head sk_receive_queue; ... struct sk_buff_head sk_write_queue; ... }; struct sk_buff_head { struct sk_buff *next; struct sk_buff *prev; }; For each struct sk_buff in the two lists clear the memory referenced by skb->data / skb->data_len: struct sk_buff { ... unsigned int data_len; ... unsigned char *data; ... }; Signed-off-by: Aruna Balakrishnaiah <aruna@linux.vnet.ibm.com>
Diffstat (limited to 'eppic_scripts')
-rw-r--r--eppic_scripts/udp_sk_buf.c79
1 files changed, 79 insertions, 0 deletions
diff --git a/eppic_scripts/udp_sk_buf.c b/eppic_scripts/udp_sk_buf.c
new file mode 100644
index 0000000..7e64300
--- /dev/null
+++ b/eppic_scripts/udp_sk_buf.c
@@ -0,0 +1,79 @@
+string
+udp_opt()
+{
+ return "l";
+}
+
+string
+udp_usage()
+{
+ return "\n";
+}
+
+static void
+udp_showusage()
+{
+ printf("usage : udp %s", udp_usage());
+}
+
+string
+udp_help()
+{
+ return "Help";
+}
+
+int
+udp()
+{
+ int i;
+ int size;
+ struct udp_table *table;
+ struct sock_common *off = 0;
+
+ table = &udp_table;
+
+ for (i = 0; i < table->mask; i++) {
+ struct hlist_nulls_node *pos;
+
+ pos = table->hash[i].head.first;
+
+ while (!((unsigned long)pos & 1)) {
+ struct sock *sk;
+ struct sk_buff *next;
+ struct sk_buff_head *head;
+ struct hlist_nulls_node *node;
+
+ sk = (struct sock *)((unsigned long)pos - ((unsigned long)&(off->skc_dontcopy_begin)));
+
+ head = (struct sk_buff_head *)&(sk->sk_receive_queue);
+ next = (struct sk_buff *)sk->sk_receive_queue.next;
+
+ while (next != head)
+ {
+ struct sk_buff *buff = (struct sk_buff *)next;
+
+ memset((char *)buff->data, 'L', buff->data_len);
+ memset((char *)&(buff->data_len), 'L', 0x4);
+
+ next = buff->next;
+ }
+
+ head = (struct sk_buff_head *)&(sk->sk_write_queue);
+ next = (struct sk_buff *)sk->sk_write_queue.next;
+
+ while (next != head)
+ {
+ struct sk_buff *buff = (struct sk_buff *)next;
+
+ memset((char *)buff->data, 'L', buff->data_len);
+ memset((char *)&(buff->data_len), 'L', 0x4);
+
+ next = buff->next;
+ }
+
+ node = (struct hlist_nulls_node *)((unsigned long)sk + (unsigned long)&(off->skc_dontcopy_begin));
+ pos = node->next;
+ }
+ }
+ return 1;
+}