From: Michael Schroeder <mls@suse.de>
Date: Wed, 11 Jan 2012 13:28:09 +0000 (+0100)
Subject: - add some missing copyright blocks
X-Git-Tag: BASE-SuSE-Code-12_2-Branch~209
X-Git-Url: http://git.ipfire.org/cgi-bin/gitweb.cgi?a=commitdiff_plain;h=0e3b32999ce128834a2ef97cf22a42e3ee2f7cda;p=thirdparty%2Flibsolv.git

- add some missing copyright blocks
---

diff --git a/ext/pool_fileconflicts.c b/ext/pool_fileconflicts.c
index 5c1a4c8d..b835790d 100644
--- a/ext/pool_fileconflicts.c
+++ b/ext/pool_fileconflicts.c
@@ -1,3 +1,10 @@
+/*
+ * Copyright (c) 2009-2012, Novell Inc.
+ *
+ * This program is licensed under the BSD license, read LICENSE.BSD
+ * for further information
+ */
+
 #include <stdio.h>
 #include <sys/stat.h>
 
diff --git a/ext/pool_fileconflicts.h b/ext/pool_fileconflicts.h
index f1c2282c..f8be98d9 100644
--- a/ext/pool_fileconflicts.h
+++ b/ext/pool_fileconflicts.h
@@ -1,3 +1,10 @@
+/*
+ * Copyright (c) 2009-2012, Novell Inc.
+ *
+ * This program is licensed under the BSD license, read LICENSE.BSD
+ * for further information
+ */
+
 #ifndef POOL_FILECONFLICTS_H
 #define POOL_FILECONFLICTS_H
 
diff --git a/ext/solv_xfopen.h b/ext/solv_xfopen.h
index e722bf2b..31e24d3e 100644
--- a/ext/solv_xfopen.h
+++ b/ext/solv_xfopen.h
@@ -1,3 +1,10 @@
+/*
+ * Copyright (c) 2009-2012, Novell Inc.
+ *
+ * This program is licensed under the BSD license, read LICENSE.BSD
+ * for further information
+ */
+
 #ifndef SOLV_XFOPEN_H
 #define SOLV_XFOPEN_H
 
diff --git a/tools/dumpsolv.c b/tools/dumpsolv.c
index 681e98bb..64a9a79b 100644
--- a/tools/dumpsolv.c
+++ b/tools/dumpsolv.c
@@ -341,16 +341,16 @@ int main(int argc, char **argv)
   printf ("\nSearchresults:\n");
   Dataiterator di;
   dataiterator_init(&di, pool, 0, 0, 0, "3", SEARCH_SUB | SEARCH_SUBSTRING | SEARCH_FILES);
-  //int count = 0;
+  /* int count = 0; */
   while (dataiterator_step(&di))
     {
       printf("%d:", di.solvid);
       dump_attr(repo, di.data, di.key, &di.kv);
       /*if (di.solvid == 4 && count++ == 0)
 	dataiterator_jump_to_solvable(&di, pool->solvables + 3);*/
-      //dataiterator_skip_attribute(&di);
-      //dataiterator_skip_solvable(&di);
-      //dataiterator_skip_repo(&di);
+      /* dataiterator_skip_attribute(&di); */
+      /* dataiterator_skip_solvable(&di); */
+      /* dataiterator_skip_repo(&di); */
     }
 #endif
   pool_free(pool);