├── TCL Scripts for Physical Design ├── not1x1.v ├── and2x1.v ├── or2x1.v ├── ReadMe.txt ├── mycode.v ├── Netlist.v ├── List of Gates or Cells from Netlist.tcl ├── List of IO Pins from Netlist.tcl ├── List of all Nets from Netlist.tcl ├── sample_SDC.sdc ├── Tcl_Proc_findDutyCycle_Freq_PeriodfromSDC.tcl └── Tcl_proc_checksubmodulefiiles_hierarchycheck.tcl ├── factorial non-recursive.tcl ├── TCL Scripting for finding length of List without llength.tcl ├── Count no of words in string.tcl ├── 2 TCL script to find the length of the list without using llength.tcl ├── 1 TCL script to display the characters one by one in the input string.tcl ├── Namespace_factorial.tcl ├── TCL script to display the value of variable "var".tcl ├── TCL script to print items in list in reverse order without lreverse.tcl ├── TCL Script to convert an input string to acronym.tcl ├── TCL Script to perform run length Encoding.tcl ├── TCL script to find length of list without using command llength.tcl ├── 2 TCL script to display the inverted copy of array.tcl ├── display all the files with extension of a particular type only in groups.tcl ├── TCL script to find length of string without using command string length.tcl ├── TCL Procedure to write 1 to 100 & A to Z in document.tcl ├── 3 TCL script to sort the elements (index & value) in the array.tcl ├── Script to check whether the dictionary has repeated values.tcl ├── 3 TCL script to convert the all upper to lower case and lower to upper case in string.tcl ├── 3 TCL script to generate numbers from 0 to 100 and break the loop when it reaches the last odd number.tcl ├── 1 SCRIPT FOR DISPLAY ODD NUMBER USING NESTED DECISION STATEMENTS.tcl ├── 1.1 SCRIPT FOR DISPLAY ODD NUMBER USING NESTED DECISION STATEMENTS.tcl ├── script to display the list of empty folders and files.tcl ├── 2 TCL script to create a nested loop to display multiples of 5 and 10.tcl ├── TCL script to remove all white spaces in string.tcl ├── TCL script to change the first character of each word to upper case in a string.tcl ├── TCL script to count the total number of words in the strings.tcl ├── Script to sort and display the list of files (file names) based on Size.tcl ├── TCL script to check whether the input string is palindrome or not.tcl ├── Script for display only the random generated numbers comes within the specified range.tcl ├── CreateListfromStandardinput.tcl ├── README.md ├── script to search for the value with a particular character.tcl ├── 3 TCL script to pick two elements simultaneously in list and display the largest.tcl ├── TCL script to swap two numbers in string.tcl ├── 2 TCL script to display the positions of the vowels in string.tcl ├── TCL script to compare two files.tcl ├── Removing Vowels from the String.tcl ├── TCL script to find two list are equal or sublist or superlists.tcl ├── TCL script to find the difference between the two lists.tcl ├── TCL script to find the difference between the two strings.tcl ├── TCL script to convert Binary to Hexadecimal.tcl ├── TCL Script to display the Month (December) of Calender.tcl └── LICENSE /TCL Scripts for Physical Design/not1x1.v: -------------------------------------------------------------------------------- 1 | module not1x1 (out,in) 2 | input in; 3 | output out; 4 | 5 | assign out = ~in; 6 | 7 | endmodule 8 | -------------------------------------------------------------------------------- /TCL Scripts for Physical Design/and2x1.v: -------------------------------------------------------------------------------- 1 | module and2x1 (out,in1,in2); 2 | input in1,in2; 3 | output out; 4 | 5 | assign out = in1 & in2 ; 6 | 7 | endmodule 8 | -------------------------------------------------------------------------------- /TCL Scripts for Physical Design/or2x1.v: -------------------------------------------------------------------------------- 1 | module or2x1 (out,in1,in2); 2 | input in1,in2; 3 | output out; 4 | 5 | assign out = in1 | in2 ; 6 | 7 | endmodule 8 | -------------------------------------------------------------------------------- /TCL Scripts for Physical Design/ReadMe.txt: -------------------------------------------------------------------------------- 1 | This repository provides several TCL Scripts used in VLSI Physical Design to extract the information or solve issues/violations. 2 | -------------------------------------------------------------------------------- /factorial non-recursive.tcl: -------------------------------------------------------------------------------- 1 | Written by: Udaya Shankar S 2 | Dated: 15.11.2022 3 | Version: 1.0 4 | 5 | proc factorial {a} { 6 | set s 1 7 | for {set i $a } {$i > 0} {incr i -1} { 8 | set s [expr $s*$i] 9 | } 10 | return $s 11 | } 12 | 13 | puts [factorial 10] ; # factorial of 10 14 | -------------------------------------------------------------------------------- /TCL Scripting for finding length of List without llength.tcl: -------------------------------------------------------------------------------- 1 | #Written by: Udaya Shankar S 2 | #Dated:8.11.2022 3 | #TCL Scripting for finding length of List without "llength" 4 | #Verion 1.0 5 | 6 | set l {a b c d e x y z} 7 | set c 0 8 | foreach i $l { 9 | incr c 10 | } 11 | puts "Length of List:$c" 12 | -------------------------------------------------------------------------------- /Count no of words in string.tcl: -------------------------------------------------------------------------------- 1 | #Written by: Udaya Shankar S 2 | #dated: 25.3.2022 3 | #Version: 1.0 4 | 5 | 6 | #Write a TCL script to find the number of words in the input string; 7 | set in "Tcl is a cross platform language with full unicode support." 8 | set b [split $in " "] 9 | puts $b 10 | puts [llength $b] -------------------------------------------------------------------------------- /2 TCL script to find the length of the list without using llength.tcl: -------------------------------------------------------------------------------- 1 | #Written by: Udaya Shankar S 2 | #Dated: 8.11.2022 3 | #TCL script to find the length of the list without using "llength" 4 | #Version:1.0 5 | 6 | set in {a z d e f x y} 7 | puts "Length of the List : [expr 1+[lsearch $in [lrange $in end end]]]" 8 | 9 | 10 | -------------------------------------------------------------------------------- /1 TCL script to display the characters one by one in the input string.tcl: -------------------------------------------------------------------------------- 1 | #Written by: Udaya Shankar S 2 | #Dated: 8.11.2022 3 | #TCL script to display the characters one by one in the input string [Eg.: "SCRIPTING"]. 4 | #Version:1.0 5 | 6 | set a "TCL SCRIPTING" 7 | for {set i 0} {$i < [string length $a]} {incr i} { 8 | puts [string index $a $i] 9 | } -------------------------------------------------------------------------------- /Namespace_factorial.tcl: -------------------------------------------------------------------------------- 1 | Written by: Udaya Shankar S 2 | Dated: 15.11.2022 3 | Version: 1.0 4 | 5 | namespace eval fact { 6 | variable out 7 | } 8 | proc fact::factorial {a} { 9 | set f 1 10 | for {set i $a } { $i > 0 } { incr i -1 } { 11 | set f [expr $f*$i] 12 | 13 | } 14 | set ::fact::out $f 15 | } 16 | 17 | puts [fact::factorial 10] ; #factorial of 10 18 | 19 | -------------------------------------------------------------------------------- /TCL script to display the value of variable "var".tcl: -------------------------------------------------------------------------------- 1 | #Written by : Udaya Shankar S 2 | #dated: 11.11.2022 3 | #TCL script to display the value of variable "var", since value "a" is defined in variable "var" and value of "11" is defined in variable a (no additional variables have to used). 4 | #Version 1.0 5 | 6 | set a 11 7 | set var a 8 | eval puts $$var 9 | puts [set $var] 10 | puts [set [set var]] 11 | -------------------------------------------------------------------------------- /TCL Scripts for Physical Design/mycode.v: -------------------------------------------------------------------------------- 1 | module 4x1_mux (out, in0, in1, in2, in3, s0, s1); 2 | input in0, in1, in2, in3, s0, s1; 3 | output out; 4 | wire inv0, inv1, a0, a1, a2, a3; 5 | not not_0 (inv0, s0); 6 | not not_1 (inv1, s1); 7 | and and_0 (a0, in0, inv0, inv1); 8 | and and_1 (a1, in1, inv0, s1); 9 | and and_2 (a2, in2, s0, inv1); 10 | and and_3 (a3, in3, s0, s1); 11 | or or_0 (out, a0, a1, a2, a3); 12 | endmodule -------------------------------------------------------------------------------- /TCL script to print items in list in reverse order without lreverse.tcl: -------------------------------------------------------------------------------- 1 | #Written by: Udaya Shankar S 2 | #Dated: 8.11.2022 3 | #TCL script to print the items in the list in the reverse order without using "lreverse" 4 | #Version:1.0 5 | 6 | set in {a z d e f} 7 | set l [llength $in] 8 | set fl [list] 9 | for {set i [expr $l-1]} {$i >= 0 } {incr i -1} { 10 | set m [lindex $in $i] 11 | set fl [append fl $m " "] 12 | } 13 | puts $fl -------------------------------------------------------------------------------- /TCL Script to convert an input string to acronym.tcl: -------------------------------------------------------------------------------- 1 | #Written by : Udaya Shankar S 2 | #dated: 9.11.2022 3 | #TCL Script to convert an input string to acronym. 4 | #Version 1.0 5 | 6 | set in "Tool Command Language" 7 | set a [split $in] 8 | puts $a 9 | set vars [list] 10 | for {set i 0} { $i < [llength $a] } { incr i } { 11 | puts [set x [lindex $a $i]] 12 | puts [set y [string index $x 0]] 13 | set vars [append var $y ""] 14 | } 15 | puts $vars 16 | -------------------------------------------------------------------------------- /TCL Scripts for Physical Design/Netlist.v: -------------------------------------------------------------------------------- 1 | module 4x1_mux (out, in0, in1, in2, in3, s0, s1); 2 | output out; 3 | input in0, in1, in2, in3, s0, s1; 4 | wire inv0, inv1; 5 | wire a0, a1, a2, a3; 6 | not1x1 not_0 (inv0, s0); 7 | not1x1 not_1 (inv1, s1); 8 | and2x1 and_0 (a0, in0, inv0, inv1); 9 | and2x1 and_1 (a1, in1, inv0, s1); 10 | and2x1 and_2 (a2, in2, s0, inv1); 11 | and2x1 and_3 (a3, in3, s0, s1); 12 | or2x1 or_0 (out, a0, a1, a2, a3); 13 | endmodule 14 | -------------------------------------------------------------------------------- /TCL Script to perform run length Encoding.tcl: -------------------------------------------------------------------------------- 1 | #Written by : Udaya Shankar S 2 | #dated: 11.11.2022 3 | #TCL Script to perform run length Encoding 4 | #Version 1.0 5 | 6 | set in "assignment" 7 | puts [set a [split $in {}]] 8 | 9 | set b [ list a b c d e f g h i j k l m n o p q r s t u v w x y z] 10 | set f [list] 11 | foreach n $b { 12 | set x [llength [lsearch -all $a $n]] 13 | if {$x > 0} { 14 | set f [append f "$x$n" ""] 15 | } else { 16 | continue 17 | } 18 | } 19 | puts $f 20 | -------------------------------------------------------------------------------- /TCL script to find length of list without using command llength.tcl: -------------------------------------------------------------------------------- 1 | #Written by: Udaya Shankar S 2 | #dated: 25.4.2022 3 | #Version: 1.0 4 | 5 | 6 | #Write a TCL script to find the length of the string without using built-in command "llength" 7 | set lin { 5 6 4 8 9 a} ; # input list 'lin' 8 | puts [set z [lrange $lin end end]] ; # assign z with elements at end / last element 9 | puts "The length of the list is: [expr [lsearch $lin "$z" ] + 1]" ; # To display the length of the list the position of last element is incremented to one. 10 | -------------------------------------------------------------------------------- /2 TCL script to display the inverted copy of array.tcl: -------------------------------------------------------------------------------- 1 | #written by: Udaya Shankar S 2 | #Dated: 7.11.2022 3 | # Write a TCL script to display the inverted copy of array. 4 | #Version 1.0 5 | 6 | array set lan { 7 | 21 TCL 8 | 15 PERL 9 | 10 JAVA 10 | 30 C++ 11 | 20 TK 12 | } 13 | set m [array names lan] 14 | puts $m 15 | puts [set len [llength $m]] 16 | set l [list] 17 | for {set i $len } {$i > 0} {incr i -1} { 18 | set k [array get lan [lindex $m $i-1]] 19 | set l [append l $k " "] 20 | } 21 | puts $l 22 | -------------------------------------------------------------------------------- /display all the files with extension of a particular type only in groups.tcl: -------------------------------------------------------------------------------- 1 | #written by: Udaya Shakar S 2 | #Dated: 28.11.2022 3 | #TCL script to display all the files with extension of a particular type only in groups(*.txt or *.tcl or *.doc or *.csv) in a folder 4 | #Version 1.0 5 | 6 | 7 | set f [glob *] 8 | puts $f 9 | set f1 {} 10 | foreach in $f { 11 | set f1 [lappend f1 "[ file extension $in ]" ] 12 | } 13 | puts [set ext [lsort -unique $f1]] 14 | puts [set len [llength $ext]] 15 | 16 | foreach i $ext { 17 | puts "$i files: [glob "*$i"]" 18 | } 19 | 20 | -------------------------------------------------------------------------------- /TCL script to find length of string without using command string length.tcl: -------------------------------------------------------------------------------- 1 | #Written by: Udaya Shankar S 2 | #dated: 25.3.2022 3 | #Version: 1.0 4 | 5 | 6 | 7 | # Write a TCL script to find the length of the string without using built-in command "string length" 8 | set str "TCL SCRIPTING" ; # input string 9 | puts [set k [string range $str end end]] ; # set variable k with last element/character of the string 10 | puts "The length of the string is: [expr [string last "$k" $str] + 1]" ; # To fine the length of the string the position of the last charcter is incremented with 1 11 | -------------------------------------------------------------------------------- /TCL Procedure to write 1 to 100 & A to Z in document.tcl: -------------------------------------------------------------------------------- 1 | # Written by: udaya Shankar S 2 | # Date: 20.11.2022 3 | # TCL Procedure to write 1 to 100 & A to Z in document 4 | # Version: 1.0 5 | 6 | proc writeAZ {} { 7 | set fout [open "output1.txt" w+] 8 | set in 0 9 | while { $in <= 100} { 10 | puts $fout "$in" 11 | incr in 12 | } 13 | set in1 A 14 | puts $fout "$in1" 15 | while { [string compare "$in1" "Z"] != 0 } { 16 | scan "$in1" %c m 17 | set g [ format %c [incr m]] 18 | set in1 "$g" 19 | puts $fout "$g" 20 | } 21 | close $fout 22 | } 23 | 24 | writeAZ 25 | 26 | 27 | -------------------------------------------------------------------------------- /3 TCL script to sort the elements (index & value) in the array.tcl: -------------------------------------------------------------------------------- 1 | #written by: Udaya Shankar S 2 | #Dated: 7.11.2022 3 | #TCL script to sort the elements (index & value) in the array 4 | #Version 1.0 5 | 6 | array set lan { 7 | 21 TCL 8 | 15 PERL 9 | 10 JAVA 10 | 30 C++ 11 | 20 TK 12 | } 13 | set m [array names lan] 14 | puts $m 15 | puts [set z [lsort -integer $m]] 16 | puts [set len [llength $m]] 17 | set l [list] 18 | for {set i 0 } {$i < $len} {incr i } { 19 | set k [array get lan [lindex $z $i]] 20 | set l [append l $k " "] 21 | } 22 | puts $l -------------------------------------------------------------------------------- /Script to check whether the dictionary has repeated values.tcl: -------------------------------------------------------------------------------- 1 | #Written by : Udaya Shankar S 2 | #dated: 13.11.2022 3 | #TCL Script to check whether the dictionary has repeated values 4 | #Version 1.0 5 | 6 | set colours [dict create 1 "black" 4 "white" 2 "brown" 0 "green" 5 blue 6 "white"] 7 | #puts [set s [dict size $colours ] ] 8 | puts [set v [dict values $colours]] 9 | puts [set k [dict keys $colours]] 10 | 11 | foreach {m} $v { 12 | if { [llength [lsearch -all $v $m]] > 1 } { 13 | puts "$m is repeated" 14 | #break 15 | } else { 16 | puts "$m is not repeated" 17 | } 18 | } 19 | -------------------------------------------------------------------------------- /3 TCL script to convert the all upper to lower case and lower to upper case in string.tcl: -------------------------------------------------------------------------------- 1 | #Written by: Udaya Shankar S 2 | #Dated: 8.11.2022 3 | #TCL script to convert the all upper to lower case and lower to upper case in string 4 | #Version:1.0 5 | 6 | set in "Tcl Scripting" 7 | set l [list] 8 | for {set i 0} {$i < [string length $in]} { incr i} { 9 | set x [string index $in $i] 10 | if {[string match {[a-z]} $x]} { 11 | set m [string toupper $x] 12 | set l [append l $m ""] 13 | } else { 14 | set n [string tolower $x] 15 | set l [append l $n ""] 16 | } 17 | } 18 | puts $l -------------------------------------------------------------------------------- /3 TCL script to generate numbers from 0 to 100 and break the loop when it reaches the last odd number.tcl: -------------------------------------------------------------------------------- 1 | #Written By: Udaya Shankar S 2 | #Dated: 4.11.2022 3 | # TCL script to generate numbers from 0 to 100 and break the loop when it reaches the last odd number 4 | # Version 1.0 5 | 6 | set l [list] 7 | for {set a 0} {$a <= 100} {incr a} { 8 | if {[expr $a%2 != 0]} { 9 | set lf1 [lappend l $a] 10 | } 11 | } 12 | puts $lf1 13 | set f [lindex $lf1 end] 14 | ##puts $f 15 | for {set b 0} { $b <= $f } { incr b } { 16 | puts $b 17 | if { $a == $f } { 18 | break; 19 | } 20 | } 21 | -------------------------------------------------------------------------------- /1 SCRIPT FOR DISPLAY ODD NUMBER USING NESTED DECISION STATEMENTS.tcl: -------------------------------------------------------------------------------- 1 | #Written By: Udaya Shankar S 2 | #Dated: 4.11.2022 3 | # Version 1.0 4 | 5 | # SCRIPT FOR DISPLAY ODD NUMBER USING NESTED DECISION STATEMENTS - FOR LOOP 6 | for {set a 0} {$a < 100} {incr a} { 7 | for {set b $a} {$b <= $a} {incr b} { 8 | if { [expr $a%2 !=0]} { 9 | puts $a 10 | } 11 | } 12 | } 13 | 14 | # SCRIPT FOR DISPLAY EVEN NUMBER USING NESTED DECISION STATEMENTS - FOR LOOP 15 | for {set a 0} {$a < 100} {incr a} { 16 | for {set b $a} {$b <= $a} {incr b} { 17 | if { [expr $a%2 ==0]} { 18 | puts $a 19 | } 20 | } 21 | } -------------------------------------------------------------------------------- /1.1 SCRIPT FOR DISPLAY ODD NUMBER USING NESTED DECISION STATEMENTS.tcl: -------------------------------------------------------------------------------- 1 | #Written By: Udaya Shankar S 2 | #Dated: 4.11.2022 3 | # Version 1.0 4 | 5 | # SCRIPT FOR DISPLAY EVEN NUMBER USING NESTED DECISION STATEMENTS - WHILE 6 | set i 0 7 | while { $i <= 100} { 8 | #incr i 9 | while { [expr $i%2] == 0} { 10 | puts $i 11 | incr i 12 | } 13 | incr i 14 | } 15 | 16 | # SCRIPT FOR DISPLAY ODD NUMBER USING NESTED DECISION STATEMENTS - WHILE 17 | set i 0 18 | while { $i <= 100} { 19 | #incr i 20 | while { [expr $i%2] != 0} { 21 | puts $i 22 | incr i 23 | } 24 | incr i 25 | } -------------------------------------------------------------------------------- /script to display the list of empty folders and files.tcl: -------------------------------------------------------------------------------- 1 | #Written by: Udaya Shankar S 2 | #Dated: 3.10.2022 3 | # TCL script to display the list of empty folders(directories) and files. 4 | #Version 1.0 5 | 6 | set f [glob *] 7 | puts $f 8 | set l_dir {} 9 | set l_files {} 10 | foreach in $f { 11 | if {[ file isdirectory $in] == 1 } { 12 | if {[file size $in] == 0 } { 13 | set l_dir [lappend l_dir $in] 14 | } else { 15 | continue 16 | } 17 | } else { 18 | if {[file size $in] == 0 } { 19 | set l_files [lappend l_files $in] 20 | } else { 21 | continue 22 | } 23 | } 24 | } 25 | puts "Empty Directories: $l_dir" 26 | puts "Empty files: $l_files" 27 | -------------------------------------------------------------------------------- /2 TCL script to create a nested loop to display multiples of 5 and 10.tcl: -------------------------------------------------------------------------------- 1 | #Written By: Udaya Shankar S 2 | #Dated: 4.11.2022 3 | # TCL script to create a nested loop to display multiples of 5 and 10 4 | # Version 1.0 5 | 6 | for { set a 0 } { $a <= 50 } { incr a } { 7 | for { set b $a } {$b <= $a} {incr b} { 8 | if {[expr $a%5 == 0 ] && [expr $a%10 == 0 ] } { 9 | puts "$b is divisible by 5 & 10" 10 | } elseif {[expr $a%5 == 0 ] } { 11 | puts "$b is divisible by 5 " 12 | } elseif { [expr $a%10 == 0 ] } { 13 | puts "$b is divisible by 10" 14 | } else { 15 | puts "$b is not divisible by 5 & 10" 16 | } 17 | } 18 | } -------------------------------------------------------------------------------- /TCL script to remove all white spaces in string.tcl: -------------------------------------------------------------------------------- 1 | #Written by : Udaya Shankar S 2 | #dated: 11.11.2022 3 | #TCL script to remove all white spaces in string. 4 | #Version 1.0 5 | 6 | 7 | #Method1 8 | set str "Tcl is a cross platform language with full unicode support." 9 | set replaced_string [regsub -all " " $str ""] 10 | puts $replaced_string 11 | 12 | #Method2 13 | set new_string [string map {" " ""} $str] 14 | puts $new_string 15 | 16 | #Method 3 17 | #set str "Tcl Scripting Language" 18 | set l1 [split $str " "] 19 | set l [llength $str] 20 | set y [list] 21 | for { set i 0 } { $i < $l } { incr i } { 22 | set x [lindex $l1 $i] 23 | set y [append y $x ""] 24 | } 25 | puts $y 26 | -------------------------------------------------------------------------------- /TCL script to change the first character of each word to upper case in a string.tcl: -------------------------------------------------------------------------------- 1 | #Written by : Udaya Shankar S 2 | #dated: 8.11.2022 3 | #TCL script to change the first character of each word to upper case in a string. 4 | #Version 1.0 5 | 6 | 7 | set in "Tcl is a cross platform language with full unicode support." 8 | set l [list] 9 | puts $in 10 | for {set i 0} {$i < [string length $in]} { incr i} { 11 | set x [string index $in $i] 12 | set y [string index $in $i+1] 13 | set m [expr $i+1] 14 | set k [expr $i+2] 15 | if {[string match " " $x]} { 16 | set in "[ string replace $in $i $m [string toupper [string range $in $i $m]]]" 17 | } else { 18 | continue 19 | } 20 | } 21 | puts $in 22 | -------------------------------------------------------------------------------- /TCL script to count the total number of words in the strings.tcl: -------------------------------------------------------------------------------- 1 | #Written by : Udaya Shankar S 2 | #dated: 8.11.2022 3 | # TCL script to count the total number of words in the strings. 4 | #Version 1.0 5 | 6 | ##Method1 7 | set in "Tcl Runs on Windows, Mac OS X, Linux, and virtually every variant of unix. Event driven programming. Tcl is a cross platform language with full unicode support." 8 | puts [set l [string length $in]] 9 | set cnt 0 10 | for {set i 0} {$i < $l} {incr i} { 11 | if { [string equal -nocase [string index $in $i] " "] == 1 } { 12 | incr cnt 13 | } else { 14 | continue 15 | } 16 | } 17 | puts "No of words: [expr $cnt+1]" 18 | 19 | ##Method2 20 | puts "No of words: [llength $in]" 21 | -------------------------------------------------------------------------------- /Script to sort and display the list of files (file names) based on Size.tcl: -------------------------------------------------------------------------------- 1 | #Written by: Udaya Shankar S 2 | #Dated: 3.10.2022 3 | # TCL Script to sort and display the list of files (file names) based on Size 4 | #Version 1.0 5 | 6 | 7 | set in [glob *] 8 | set l [list] 9 | foreach a $in { 10 | set l [append l "$a [file size $a]" " "] 11 | } 12 | puts $l 13 | puts [set len [llength $l]] 14 | foreach {i v} $l { 15 | # puts "$i $v" 16 | set array1($v) $i 17 | } 18 | puts [array get array1] 19 | 20 | ##Sort based on Size 21 | puts [set val [array names array1 ]] 22 | puts [set sv [lsort -integer $val]] 23 | set l_value {} ; # sorted list based on size/value 24 | foreach in $sv { 25 | set l_value [append l_value [array get array1 $in ] " "] 26 | } 27 | puts $l_value 28 | -------------------------------------------------------------------------------- /TCL script to check whether the input string is palindrome or not.tcl: -------------------------------------------------------------------------------- 1 | #Written by : Udaya Shankar S 2 | #dated: 9.11.2022 3 | #TCL script to check whether the input string is palindrome or not. 4 | #Version 1.0 5 | 6 | #Palindrome Words: redivider, deified, civic, radar, level, rotor, kayak, reviver, racecar, madam, and refer 7 | 8 | set in "reviver" 9 | set inr [string reverse $in] 10 | set l [string length $in] 11 | for {set i 0} { $i < $l } {incr i} { 12 | set a [string index $in $i] 13 | set b [string index $inr $i] 14 | if { [string equal -nocase $a $b ]} { 15 | if { $i == [expr $l-1] } { 16 | puts "$in is palindrome" 17 | break 18 | } else { 19 | continue 20 | } 21 | } else { 22 | puts "$in is not palindrome" 23 | break 24 | } 25 | } 26 | -------------------------------------------------------------------------------- /Script for display only the random generated numbers comes within the specified range.tcl: -------------------------------------------------------------------------------- 1 | #Written by: Udaya Shankar S 2 | #Dated: 3.10.2022 3 | # Tcl procedure to display only the random generated numbers comes within the specified range 4 | #Version 1.0 5 | 6 | # Method 1 7 | proc random {} { 8 | set a [expr rand()*10] 9 | if { 0 <= $a && $a <= 8} { 10 | puts $a 11 | } 12 | 13 | } 14 | random 15 | 16 | # Method 2 17 | 18 | proc min_max {min max} { 19 | #set a [expr { rand() }] 20 | set a [ expr {(rand())*25 }] 21 | puts "Min: $min Max: $max" 22 | set a [expr int ($a)] 23 | if { [expr $min <= $a] && [expr $a <= $max ] } { 24 | puts "[expr int ($a)] is within $min & $max" 25 | } else { 26 | puts "$a is not within $min & $max" 27 | } 28 | } 29 | min_max 10 100 30 | -------------------------------------------------------------------------------- /TCL Scripts for Physical Design/List of Gates or Cells from Netlist.tcl: -------------------------------------------------------------------------------- 1 | #Written by: Udaya Shankar S 2 | #Dated: 18.11.2022 3 | #TCL Script to Fine the total number and list of Gates/standard cells in Verilog Netlist 4 | #Version:1.0 5 | 6 | proc NoofGates {in} { 7 | set inf [open $in r] 8 | set g {} 9 | set linenumber 0 10 | while {[gets $inf line] >= 0} { 11 | if {[regexp -all "and+" $line m] | [regexp -all "or+" $line m] | [regexp -all "nor+" $line m] |[regexp -all "not+" $line m] } { 12 | set k [lindex $line 1] 13 | puts $k 14 | set g [append g "$k" " "] 15 | } elseif {[regexp -all "endmodule*" $line n]} { 16 | break 17 | } else {} 18 | #incr linenumber 19 | } 20 | puts "List of Gates: $g" 21 | puts "Total No. of Gates: [llength $g]" 22 | close $inf 23 | } 24 | 25 | NoofGates "mycode.v" 26 | -------------------------------------------------------------------------------- /TCL Scripts for Physical Design/List of IO Pins from Netlist.tcl: -------------------------------------------------------------------------------- 1 | #Written by: Udaya Shankar S 2 | #Dated: 18.11.2022 3 | #TCL Script to Fine the total number and list of Input and Output Pins in Verilog Netlist 4 | #Version:1.0 5 | 6 | 7 | proc NoofIOs {in} { 8 | set inf [open $in r] 9 | set io {} 10 | while {[gets $inf line] >= 0} { 11 | if {[regexp -all "input*" $line m]} { 12 | set x [regexp -all {[^input]+\w+[^:;]+} $line match2 ]; 13 | #puts $match2 14 | set io [append io "$match2" ","] 15 | } elseif {[regexp -all "output*" $line n]} { 16 | set y [regexp -all {[^output]+\w+[^:;]+} $line match3 ]; 17 | #puts $match3; 18 | set io [append io "$match3" " "] 19 | } else {} 20 | } 21 | puts "List of Nets: $io" 22 | puts "Total No. of I/Os: [llength $io]" 23 | close $inf 24 | } 25 | NoofIOs "mycode.v" 26 | -------------------------------------------------------------------------------- /CreateListfromStandardinput.tcl: -------------------------------------------------------------------------------- 1 | # written by: Udaya Shankar S 2 | # Date: 1.12.2022 3 | # TCL procedure to create a list by read an element at a time from the user (during execution of the script) and also simultaneously display the number of elements in the list without using # llength command. 4 | # version 1.0 5 | 6 | 7 | proc list_create {} { 8 | set out_list {} 9 | puts "Enter Element to be Added to List" 10 | set i 0 11 | while {1} { 12 | set in [gets stdin] 13 | set out_list [lappend out_list $in] 14 | incr i 15 | if {[regexp -all -- {\s+} $in ] == 1} { 16 | break ; # if Space character came it breaks 17 | } 18 | } 19 | puts "Final List:[lrange $out_list 0 end-1]" 20 | puts "No of Elements in List: [expr $i-1]" 21 | } 22 | 23 | list_create 24 | 25 | # if { [regexp -all { ^[A-Za-z]+$ } $in ] == 1} { 26 | -------------------------------------------------------------------------------- /README.md: -------------------------------------------------------------------------------- 1 | # TCL-Scripting 2 | Examples of the TCL Scripts for different purposes are provided here for your reference. 3 | A lot of example scripts to learn and understand TCL scripting/Programing on various following topics are included. 4 | 1. Strings 5 | 2. Lists 6 | 3. Array 7 | 4. Procedures 8 | 5. Loop Statements 9 | 6. Decision statements 10 | 7. Dictionary 11 | 8. File Handling 12 | 9. Regular Expressions & Regular Substitutions. 13 | 10. Namespaces 14 | 11. File Manipulations 15 | 12. Error Handling 16 | 17 | 18 | A folder containing TCL Scripts for VLSI Physical Design is also included in this repository. 19 | 20 | If you find the information is useful , please cite as 21 | 22 | https://github.com/UdayaShankarS/TCL-Scripting 23 | 24 | If there is any errors in the code, please mail to rajkrish18392@gmail.com 25 | -------------------------------------------------------------------------------- /script to search for the value with a particular character.tcl: -------------------------------------------------------------------------------- 1 | #Written by : Udaya Shankar S 2 | #dated: 13.11.2022 3 | #TCL script to search for the value with a particular [E.g., "e" ] character present inside the dictionary 4 | #Version 1.0 5 | 6 | # Method1; the values with Character "a" are searched 7 | set colours [dict create 1 "black" 4 "white" 2 "brown" 0 "green" 5 orange] 8 | puts [set v [dict get $colours ]] 9 | foreach {x} $v { 10 | #puts $x 11 | if {[regexp "a" $x match]} { 12 | puts [dict filter $colours value $x] 13 | } else { 14 | continue 15 | } 16 | } 17 | 18 | # Method 2 ; the values with Character "a" are searched 19 | #set colours [dict create 1 "black" 4 "white" 2 "brown" 0 "green" 5 orange] 20 | dict for {k v} $colours { 21 | if {[string match "*a*" $v] } { 22 | puts "$k $v" 23 | } else { 24 | continue 25 | } 26 | } 27 | -------------------------------------------------------------------------------- /3 TCL script to pick two elements simultaneously in list and display the largest.tcl: -------------------------------------------------------------------------------- 1 | #Written by: Udaya Shankar S 2 | #Dated: 8.11.2022 3 | #TCL script to pick two elements (integers) simultaneously in list and display the largest among them, iterate throughout all the elements in the list 4 | #Version:1.0 5 | 6 | set in {a z d e f x y} 7 | #set in {20 12 5 71 35} 8 | set l [llength $in] 9 | #puts [scan format %c x] 10 | for {set i 0} {$i <= $l} { incr i} { 11 | if { [scan format %c x] == 1 } { 12 | if {[lindex $in $i] > [lindex $in $i+1]} { 13 | puts [lindex $in $i] 14 | } else { 15 | puts [lindex $in $i+1] 16 | } 17 | } else { 18 | if {[lindex $in $i] > [lindex $in $i+1]} { 19 | puts [lindex $in $i] 20 | } else { 21 | puts [lindex $in $i+1] 22 | } 23 | } 24 | } 25 | 26 | 27 | -------------------------------------------------------------------------------- /TCL script to swap two numbers in string.tcl: -------------------------------------------------------------------------------- 1 | # written by: Udaya Shankar S 2 | # Date: 1.12.2022 3 | # TCL script to swap 3 and 4 in the following string "19230401" (using regular expressions) 4 | # version 1.0 5 | 6 | #Method1 7 | set str "19230401" 8 | puts "Input String: $str" 9 | regsub -all {[3*]+[4*]} $str {4+3} newstr 10 | puts $newstr 11 | 12 | #Method 2 13 | set str "19230401" 14 | puts "Input String: $str" 15 | set str1 [split $str ""] 16 | #puts $str1 17 | set newstr {} 18 | foreach x $str1 { 19 | if {$x == 3} { 20 | regsub -all "3" $x "4" y 21 | set newstr [append newstr $y ""] 22 | } elseif {$x == 4} { 23 | regsub -all "4" $x "3" y 24 | set newstr [append newstr $y ""] 25 | } else { 26 | set newstr [append newstr $x ""] 27 | } 28 | } 29 | puts "Output String: $newstr" 30 | ##Using stringMap 31 | puts [string map {3 4 4 3} $str] 32 | 33 | #Method 3 -- string Map 34 | puts [string map {3 4 4 3} $str] 35 | 36 | -------------------------------------------------------------------------------- /2 TCL script to display the positions of the vowels in string.tcl: -------------------------------------------------------------------------------- 1 | #Written by: Udaya Shankar S 2 | #Dated: 8.11.2022 3 | #TCL script to display the positions of the vowels present in the input string 4 | #Version:1.0 5 | 6 | 7 | set in "MANPOWER" 8 | for {set i 0} {$i < [string length $in]} { incr i} { 9 | if { [string equal -nocase [string index $in $i] "a"] == 1 } { 10 | puts "$i : [string index $in $i]" 11 | } elseif { [string equal -nocase [string index $in $i] "e"] == 1 } { 12 | puts "$i: [string index $in $i]" 13 | } elseif { [string equal -nocase [string index $in $i] "i"] == 1 } { 14 | puts "$i :[string index $in $i]" 15 | } elseif { [string equal -nocase [string index $in $i] "o"] == 1 } { 16 | puts "$i:[string index $in $i]" 17 | } elseif { [string equal -nocase [string index $in $i] "u"] == 1 } { 18 | puts "$i:[string index $in $i]" 19 | } else { 20 | continue 21 | } 22 | } -------------------------------------------------------------------------------- /TCL Scripts for Physical Design/List of all Nets from Netlist.tcl: -------------------------------------------------------------------------------- 1 | #Written by: Udaya Shankar S 2 | #Dated: 18.11.2022 3 | #TCL Script to Fine the total number and list of wires/nets in Verilog Netlist 4 | #Version:1.0 5 | 6 | proc NoofNes {in} { 7 | set inf [open $in r] 8 | set io {} 9 | while {[gets $inf line] >= 0} { 10 | if {[regexp -all "input*" $line m]} { 11 | set x [regexp -all {[^input]+\w+[^:;]+} $line match2 ]; 12 | #puts $match2 13 | set io [append io "$match2" ","] 14 | } elseif {[regexp -all "output*" $line n]} { 15 | set y [regexp -all {[^output]+\w+[^:;]+} $line match3 ]; 16 | #puts $match3; 17 | set io [append io "$match3" ","] 18 | } elseif {[regexp -all "wire*" $line o]} { 19 | set z [regexp -all {[^wire]+\w+[^:;]+} $line match1 ] 20 | #puts $match1; 21 | set io [append io "$match1" ","] 22 | } else {} 23 | } 24 | puts "List of Nets: $io" 25 | puts "Total No. of Nets: [llength $io]" 26 | close $inf 27 | } 28 | 29 | NoofNes "mycode.v" 30 | -------------------------------------------------------------------------------- /TCL script to compare two files.tcl: -------------------------------------------------------------------------------- 1 | # written by: Udaya Shankar S 2 | # Date: 1.12.2022 3 | # TCL procedure to determine whether two files are same or different (contents inside the file) and also display the data where they differs. 4 | # version 1.0 5 | 6 | proc comparison {file1 file2} { 7 | set f [open $file1 r] 8 | set f1 [open $file2 r] 9 | #set linenumber 1 10 | while {![eof $f1] } { 11 | gets $f line 12 | gets $f1 line1 13 | #puts "$line:$line1" 14 | if {[string equal -nocase $line $line1] == 1 } { 15 | if {[eof $f1]} { 16 | break 17 | } else { 18 | continue 19 | } 20 | } else { 21 | puts "File1: $line\nFile2: $line1" 22 | puts "-------------" 23 | } 24 | } 25 | } 26 | 27 | ##Same Files Comparison 28 | #If both files are same, output shows nothing 29 | comparison myfile.txt myfile1_same.txt 30 | puts "#############################" 31 | ##Different File Comparison 32 | #If both files are differnt output display the lines that are different in two files 33 | comparison myfile.txt myfile1_diff.txt 34 | -------------------------------------------------------------------------------- /TCL Scripts for Physical Design/sample_SDC.sdc: -------------------------------------------------------------------------------- 1 | set sdc_version 1.4 2 | 3 | set_units -time ns 4 | 5 | # Set the current design 6 | current_design dtmf_core 7 | 8 | # set_case_analysis 0 [get_ports test_mode] 9 | # set_case_analysis 0 [get_ports scan_en] 10 | 11 | create_clock -name "clk" -add -period 16.0 -waveform {0.0 8.0} [get_ports clk] 12 | 13 | #set_false_path -from [list [get_ports reset] [get_ports test_mode] ] 14 | #set_false_path -hold -through [get_pins PM_INST/clk_enable] 15 | 16 | set_input_delay 0.3 -clock [get_clocks clk] [all_inputs] 17 | 18 | set_output_delay 0.3 -clock [get_clocks clk] [all_outputs] 19 | 20 | set_max_fanout 15.000 [current_design] 21 | 22 | set_max_transition 1.2 [current_design] 23 | 24 | --------- -------- 25 | | | | | | 26 | | | | | | 27 | | | | | | 28 | -------- -------- -------- 29 | 0.0 8.0 16.0 30 | Rise Fall period 31 | 32 | # Duty Cycle = (PW/T)*100 % 33 | # = (8.0/16.0)*100 % 34 | # = 0.50 *100 % 35 | # = 50% 36 | -------------------------------------------------------------------------------- /TCL Scripts for Physical Design/Tcl_Proc_findDutyCycle_Freq_PeriodfromSDC.tcl: -------------------------------------------------------------------------------- 1 | # Written by: Udaya Shankar S 2 | # Dated: 18.11.2022 3 | # TCL procedure to find the duty cycle, frequency and time period from the SDC constrants file 4 | # Version:1.0 5 | 6 | proc DCFTP {in} { 7 | set inf [open "$in" r] 8 | while {[gets $inf line] >= 0} { 9 | if {[regexp -all "period*" $line m] | [regexp -all "waveform*" $line n]} { 10 | set x [regexp -all {[^period*]+\w+\w+[*.0]+\w} $line match2 ]; 11 | puts "Time Period: $match2 ns" 12 | puts "Frequency : [expr 1/$match2] GHz" 13 | #set y [regexp -all {\d[^0.]+[*.0]\d} $line match3 ]; 14 | set y [regexp -all {\d[^waveform]+[*.0]\d} $line match3 ]; 15 | puts "$match3" ; 16 | set e [expr [lindex $match3 0]+[lindex $match3 1]] 17 | set D [expr $e/$match2 ] 18 | puts "Duty Cycle: [expr $D*100]%" 19 | break 20 | } else {} 21 | } 22 | close $inf 23 | } 24 | 25 | DCFTP "sample_SDC.sdc" 26 | 27 | # sample Output 28 | # Time Period: 16.0 ns 29 | # Frequency : 0.0625 GHz 30 | # 0.0 8.0 31 | # Duty Cycle: 50.0% 32 | -------------------------------------------------------------------------------- /TCL Scripts for Physical Design/Tcl_proc_checksubmodulefiiles_hierarchycheck.tcl: -------------------------------------------------------------------------------- 1 | # Written by: Udaya Shankar S 2 | # Dated: 18.11.2022 3 | # TCL procedure to check for the submodules (files) for the main modules are present are not (hierarchy check). 4 | # Version:1.0 5 | 6 | proc hierarchy_check {in} { 7 | set inf [open $in r] 8 | set g {} 9 | set linenumber 0 10 | while {[gets $inf line] >= 0} { 11 | if {[regexp -all "and+" $line m] | [regexp -all "or+" $line m] | [regexp -all "nor+" $line m] |[regexp -all "not+" $line m] } { 12 | set k [lindex $line 0] 13 | puts $k 14 | set g [append g "$k" " "] 15 | } elseif {[regexp -all "endmodule*" $line n]} { 16 | break 17 | } else {} 18 | #incr linenumber 19 | } 20 | puts "List of Instances/Standardcells: $g" 21 | puts "Total No. of Instances/Standardcells: [llength $g]" 22 | close $inf 23 | # Hierarchical checking for existence of submodules 24 | set mod [glob *.v] 25 | puts $mod 26 | foreach y $g { 27 | set x "$y.v" 28 | if { [llength [lsearch -all $mod $x]] >= 1 } { 29 | puts "$y submodule exists" 30 | } else { 31 | puts "$y submodule not available" 32 | } 33 | } 34 | } 35 | 36 | hierarchy_check "Netlist.v" 37 | -------------------------------------------------------------------------------- /Removing Vowels from the String.tcl: -------------------------------------------------------------------------------- 1 | Written by: Udaya Shankar S 2 | dated: 25.9.2022 3 | Version: 1.0 4 | 5 | # Write a TCL script to remove the vowels in the inut string 6 | # Find also positions of vowels in the input string 7 | 8 | ##Method 1: 9 | 10 | set v {e a i o u} 11 | set str "encyclopedia" ; #input string is "encyclopedia" 12 | set l [llength $v] ; # find the length of the list 13 | set m $str 14 | for {set j 0} { $j < $l } { incr j} { 15 | puts [set r1 [string first [lindex $v $j] $str]] ; # search for the vowel letter Eg. "a" from 0th index postion 16 | puts [set r2 [string last [lindex $v $j] $str] ] ; ; # search for the vowel letter Eg. "a" from last index postion 17 | set m [string replace $m $r1 $r1 " "] ; # replace the vowel letters with " " in variable m 18 | set m [string replace $m $r2 $r2 " "] ; # replace the vowel letters with " " in variable m 19 | } 20 | # puts $m 21 | # puts [concat $m "" ""] 22 | # puts [string trim $m] 23 | puts [string map {" " ""} $m]; ; # replaces white spaces with blankspaces 24 | 25 | 26 | ##Method 2: 27 | 28 | puts [string map {a "" e "" i "" o "" u ""} "encylcopedia"] ; # replaces directly vowels with blankspaces to remove the vowel characters in string 29 | -------------------------------------------------------------------------------- /TCL script to find two list are equal or sublist or superlists.tcl: -------------------------------------------------------------------------------- 1 | #Written by : Udaya Shankar S 2 | #dated: 11.11.2022 3 | #TCL script to find two list are equal or sublist or superlists. 4 | #Version 1.0 5 | 6 | #set A [list] ; set B [list] 7 | #set A [list 1 2 3] ; set B [list] 8 | #set A [list] ; set B [list 1 2 3] 9 | #set A [list 1 2 3] ; set B [list 1 2 3 4 5] 10 | #set A [list 3 4 5] ; set B [list 1 2 3 4 5] 11 | #set A [list 3 5 4] ; set B [list 1 2 3 4 5] 12 | #set A [list 1 3 2 4 ] ; set B [list 2 3 4] 13 | #set A [list 1 2 3 4 5] ; set B [list 2 3 4] 14 | #set A [list 1 2 4] ; set B [list 1 2 3 4 5] 15 | set A [list 1 2 3] ; set B [list 1 3 2] 16 | puts "x:[set x [regsub -all " " $A ""]]" ; 17 | puts "y:[set y [regsub -all " " $B ""]]" 18 | puts [set la [llength $A] ] 19 | puts [set lb [llength $B] ] 20 | 21 | if { $la < $lb } { 22 | if {[string match "*$x*" $y ] == 1} { 23 | puts "A is a sublist of B or B is the Superlist of A" 24 | } else { 25 | puts "A and B are not equal " 26 | } 27 | } elseif { $la > $lb } { 28 | if {[string match "*$y*" $x] == 1} { 29 | puts "B is a sublist of A or A is the superlist of B" 30 | } else { 31 | puts "A and B are not equal " 32 | } 33 | } elseif { $la == $lb} { 34 | if {[string compare $x $y] == 1} { 35 | puts "A and B are equal" 36 | } else { 37 | puts "A and B are not equal " 38 | } 39 | } 40 | -------------------------------------------------------------------------------- /TCL script to find the difference between the two lists.tcl: -------------------------------------------------------------------------------- 1 | #Written by : Udaya Shankar S 2 | #dated: 9.11.2022 3 | #TCL script to find the difference between the two lists 4 | #Version 1.0 5 | 6 | set a { 10 12 14 16 18 20 21} 7 | set b { 10 12 15 16 18 20 25 27 28} 8 | if {[llength $a] == [llength $b]} { 9 | for {set i 0 } {$i < [llength $a] } {incr i} { 10 | for {set j 0} {$j < [llength $b] } {incr j} { 11 | if {[lindex $a $i] == [lindex $b $i]} { 12 | puts "Lists a & b are equal at $i" 13 | break 14 | } else { 15 | puts "Lists a & b are notequal at $i" 16 | break 17 | } 18 | } 19 | } 20 | } elseif {[llength $a] > [llength $b]} { 21 | for {set i 0 } {$i < [llength $a] } {incr i} { 22 | for {set j 0} {$j < [llength $a] } {incr j} { 23 | if {[lindex $a $i] == [lindex $b $i]} { 24 | puts "Lists a & b are equal at $i" 25 | break 26 | } else { 27 | puts "Lists a & b are notequal at $i" 28 | break 29 | } 30 | } 31 | } 32 | } elseif {[llength $a] < [llength $b]} { 33 | for {set i 0 } {$i < [llength $b] } {incr i} { 34 | for {set j 0} {$j < [llength $b] } {incr j} { 35 | if {[lindex $a $i] == [lindex $b $i]} { 36 | puts "Lists a & b are equal at $i" 37 | break 38 | } else { 39 | puts "Lists a & b are notequal at $i" 40 | break 41 | } 42 | } 43 | } 44 | } else { 45 | puts "Lists a and b are different" 46 | } 47 | -------------------------------------------------------------------------------- /TCL script to find the difference between the two strings.tcl: -------------------------------------------------------------------------------- 1 | #Written by : Udaya Shankar S 2 | #dated: 9.11.2022 3 | #TCL script to find the difference between the two strings (str1 & str2) 4 | #Version 1.0 5 | 6 | set str1 "Tcl is a cross platform language with full unicode support." 7 | set str2 "Tcl is an direct platform language with full support." 8 | set a [split $str1] 9 | set b [split $str2] 10 | if {[llength $a] == [llength $b]} { 11 | for {set i 0 } {$i < [llength $a] } {incr i} { 12 | for {set j 0} {$j < [llength $b] } {incr j} { 13 | if {[lindex $a $i] == [lindex $b $i]} { 14 | puts "Strings a & b are equal at $i" 15 | break 16 | } else { 17 | puts "Strings a & b are notequal at $i" 18 | break 19 | } 20 | } 21 | } 22 | } elseif {[llength $a] > [llength $b]} { 23 | for {set i 0 } {$i < [llength $a] } {incr i} { 24 | for {set j 0} {$j < [llength $a] } {incr j} { 25 | if {[lindex $a $i] == [lindex $b $i]} { 26 | puts "Strings a & b are equal at $i" 27 | break 28 | } else { 29 | puts "Strings a & b are notequal at $i" 30 | break 31 | } 32 | } 33 | } 34 | } elseif {[llength $a] < [llength $b]} { 35 | for {set i 0 } {$i < [llength $b] } {incr i} { 36 | for {set j 0} {$j < [llength $b] } {incr j} { 37 | if {[lindex $a $i] == [lindex $b $i]} { 38 | puts "Strings a & b are equal at $i" 39 | break 40 | } else { 41 | puts "Strings a & b are notequal at $i" 42 | break 43 | } 44 | } 45 | } 46 | } else { 47 | puts "Strings a and b are different" 48 | } 49 | -------------------------------------------------------------------------------- /TCL script to convert Binary to Hexadecimal.tcl: -------------------------------------------------------------------------------- 1 | #Written by : Udaya Shankar S 2 | #dated: 11.11.2022 3 | #TCL script to convert Binary to Hexadecimal 4 | #Version 1.0 5 | 6 | set a "11110101100101111" 7 | set l [string length $a] 8 | set b [split $a ""] 9 | if {[expr $l%4] == 0} { 10 | set a $a 11 | } elseif {[expr $l%4] == 1} { 12 | set c [concat "000" "$b" "\b"] 13 | set a [regsub -all " " $c ""] 14 | #puts $c;puts $a ; 15 | } elseif {[expr $l%4] == 2} { 16 | set c [concat "00" "$b" "\b"] 17 | set a [regsub -all " " $c ""] 18 | #puts $c;puts $a ; 19 | } elseif {[expr $l%4] == 3} { 20 | set c [concat "0" "$b" "\b"] 21 | set a [regsub -all " " $c ""] 22 | #puts $c;puts $a ; 23 | } else { 24 | continue 25 | } 26 | set in [string range $a 0 end] 27 | set inl [string length $in] 28 | set h [list] 29 | for { set i 0 } { $i < $inl } {incr i 4} { 30 | set x [string range $in $i [expr $i+3 ] ] 31 | if {[string equal $x "0000"]} { 32 | set t "0" 33 | } elseif {[string equal $x "0001"]} { 34 | set t "1" 35 | } elseif {[string equal $x "0010" ] } { 36 | set t "2" 37 | } elseif {[string equal $x "0011" ]} { 38 | set t "3" 39 | } elseif {[string equal $x "0100" ]} { 40 | set t "4" 41 | } elseif {[string equal $x "0101" ] } { 42 | set t "5" 43 | } elseif {[string equal $x "0110" ] } { 44 | set t "6" 45 | } elseif {[string equal $x "0111" ] } { 46 | set t "7" 47 | } elseif {[string equal $x "1000" ] } { 48 | set t "8" 49 | } elseif {[string equal $x "1001" ] } { 50 | set t "9" 51 | } elseif { [string equal $x "1010" ]} { 52 | set t "A" 53 | } elseif {[string equal $x "1011" ] } { 54 | set t "B" 55 | } elseif { [string equal $x "1100" ] } { 56 | set t "C" 57 | } elseif {[string equal $x "1101" ]} { 58 | set t "D" 59 | } elseif {[string equal $x "1110" ] } { 60 | set t "E" 61 | } elseif {[string equal $x "1111" ] } { 62 | set t "F" 63 | } else { 64 | continue 65 | } 66 | set h [append h "$t" ""] 67 | } 68 | puts " Hexedecimal Equivalent of $a: [regsub -all " " $h ""]" 69 | -------------------------------------------------------------------------------- /TCL Script to display the Month (December) of Calender.tcl: -------------------------------------------------------------------------------- 1 | #Written by: Udaya Shankar S 2 | #Date:30.11.2022 3 | # TCL Script to display the Month (December) of Calender [simple way] 4 | #Version:1.0 5 | 6 | set systemTime [clock seconds] 7 | 8 | #puts [clock format $systemTime -format {Today is: %A, the %d of %B, %Y}] 9 | #puts [clock format $systemTime -format {Today is: %A, the %d of %B, %Y}] 10 | puts "\t\t December 2022 Time:[clock format $systemTime -format %H:%M:%S]" 11 | puts "sun\tMon\tTue\tWed\tThurs\tFri\tSat" 12 | set t [clock scan {12/19/2022}] 13 | set u1 [clock scan {-18 days} -base $t] 14 | set u2 [clock scan {-17 days} -base $t] 15 | set u3 [clock scan {-16 days} -base $t] 16 | set u4 [clock scan {-15 days} -base $t] 17 | set u5 [clock scan {-14 days} -base $t] 18 | set u6 [clock scan {-13 days} -base $t] 19 | set u7 [clock scan {-12 days} -base $t] 20 | set u8 [clock scan {-11 days} -base $t] 21 | set u9 [clock scan {-10 days} -base $t] 22 | set u10 [clock scan {-9 days} -base $t] 23 | set u11 [clock scan {-8 days} -base $t] 24 | set u12 [clock scan {-7 days} -base $t] 25 | set u13 [clock scan {-6 days} -base $t] 26 | set u14 [clock scan {-5 days} -base $t] 27 | set u15 [clock scan {-4 days} -base $t] 28 | set u16 [clock scan {-3 days} -base $t] 29 | set u17 [clock scan {-2 days} -base $t] 30 | set u18 [clock scan {-1 days} -base $t] 31 | set u19 [clock scan {0 days} -base $t] 32 | set u20 [clock scan {+1 days} -base $t] 33 | set u21 [clock scan {+2 days} -base $t] 34 | set u22 [clock scan {+3 days} -base $t] 35 | set u23 [clock scan {+4 days} -base $t] 36 | set u24 [clock scan {+5 days} -base $t] 37 | set u25 [clock scan {+6 days} -base $t] 38 | set u26 [clock scan {+7 days} -base $t] 39 | set u27 [clock scan {+8 days} -base $t] 40 | set u28 [clock scan {+9 days} -base $t] 41 | set u29 [clock scan {+10 days} -base $t] 42 | set u30 [clock scan {+11 days} -base $t] 43 | set u31 [clock scan {+12 days} -base $t] 44 | 45 | 46 | 47 | puts -nonewline "\t \t \t \t [clock format $u1 -format "%d"] \t [clock format $u2 -format "%d"] \t [clock format $u3 -format "%d"] \n [clock format $u4 -format "%d"] \t [clock format $u5 -format "%d"] \t [clock format $u6 -format "%d"] \t [clock format $u7 -format "%d"] \t [clock format $u8 -format "%d"] \t [clock format $u9 -format "%d"] \t [clock format $u10 -format "%d"] \n [clock format $u11 -format "%d"] \t [clock format $u12 -format "%d"] \t [clock format $u13 -format "%d"] \t [clock format $u14 -format "%d"] \t [clock format $u15 -format "%d"] \t [clock format $u16 -format "%d"] \t [clock format $u17 -format "%d"] \n [clock format $u18 -format "%d"] \t [clock format $u19 -format "%d"] \t [clock format $u20 -format "%d"] \t [clock format $u21 -format "%d"] \t [clock format $u22 -format "%d"] \t [clock format $u23 -format "%d"] \t [clock format $u24 -format "%d"] \n [clock format $u25 -format "%d"] \t [clock format $u26 -format "%d"] \t [clock format $u27 -format "%d"] \t [clock format $u28 -format "%d"] \t [clock format $u29 -format "%d"] \t [clock format $u30 -format "%d"] \t [clock format $u31 -format "%d"]\n" 48 | 49 | # SampleOutput 50 | # December 2022 Time:11:24:02 51 | #sun Mon Tue Wed Thurs Fri Sat 52 | # 01 02 03 53 | # 04 05 06 07 08 09 10 54 | # 11 12 13 14 15 16 17 55 | # 18 19 20 21 22 23 24 56 | # 25 26 27 28 29 30 31 57 | 58 | -------------------------------------------------------------------------------- /LICENSE: -------------------------------------------------------------------------------- 1 | GNU GENERAL PUBLIC LICENSE 2 | Version 3, 29 June 2007 3 | 4 | Copyright (C) 2007 Free Software Foundation, Inc. 5 | Everyone is permitted to copy and distribute verbatim copies 6 | of this license document, but changing it is not allowed. 7 | 8 | Preamble 9 | 10 | The GNU General Public License is a free, copyleft license for 11 | software and other kinds of works. 12 | 13 | The licenses for most software and other practical works are designed 14 | to take away your freedom to share and change the works. By contrast, 15 | the GNU General Public License is intended to guarantee your freedom to 16 | share and change all versions of a program--to make sure it remains free 17 | software for all its users. We, the Free Software Foundation, use the 18 | GNU General Public License for most of our software; it applies also to 19 | any other work released this way by its authors. You can apply it to 20 | your programs, too. 21 | 22 | When we speak of free software, we are referring to freedom, not 23 | price. Our General Public Licenses are designed to make sure that you 24 | have the freedom to distribute copies of free software (and charge for 25 | them if you wish), that you receive source code or can get it if you 26 | want it, that you can change the software or use pieces of it in new 27 | free programs, and that you know you can do these things. 28 | 29 | To protect your rights, we need to prevent others from denying you 30 | these rights or asking you to surrender the rights. Therefore, you have 31 | certain responsibilities if you distribute copies of the software, or if 32 | you modify it: responsibilities to respect the freedom of others. 33 | 34 | For example, if you distribute copies of such a program, whether 35 | gratis or for a fee, you must pass on to the recipients the same 36 | freedoms that you received. You must make sure that they, too, receive 37 | or can get the source code. And you must show them these terms so they 38 | know their rights. 39 | 40 | Developers that use the GNU GPL protect your rights with two steps: 41 | (1) assert copyright on the software, and (2) offer you this License 42 | giving you legal permission to copy, distribute and/or modify it. 43 | 44 | For the developers' and authors' protection, the GPL clearly explains 45 | that there is no warranty for this free software. For both users' and 46 | authors' sake, the GPL requires that modified versions be marked as 47 | changed, so that their problems will not be attributed erroneously to 48 | authors of previous versions. 49 | 50 | Some devices are designed to deny users access to install or run 51 | modified versions of the software inside them, although the manufacturer 52 | can do so. This is fundamentally incompatible with the aim of 53 | protecting users' freedom to change the software. The systematic 54 | pattern of such abuse occurs in the area of products for individuals to 55 | use, which is precisely where it is most unacceptable. Therefore, we 56 | have designed this version of the GPL to prohibit the practice for those 57 | products. If such problems arise substantially in other domains, we 58 | stand ready to extend this provision to those domains in future versions 59 | of the GPL, as needed to protect the freedom of users. 60 | 61 | Finally, every program is threatened constantly by software patents. 62 | States should not allow patents to restrict development and use of 63 | software on general-purpose computers, but in those that do, we wish to 64 | avoid the special danger that patents applied to a free program could 65 | make it effectively proprietary. To prevent this, the GPL assures that 66 | patents cannot be used to render the program non-free. 67 | 68 | The precise terms and conditions for copying, distribution and 69 | modification follow. 70 | 71 | TERMS AND CONDITIONS 72 | 73 | 0. Definitions. 74 | 75 | "This License" refers to version 3 of the GNU General Public License. 76 | 77 | "Copyright" also means copyright-like laws that apply to other kinds of 78 | works, such as semiconductor masks. 79 | 80 | "The Program" refers to any copyrightable work licensed under this 81 | License. Each licensee is addressed as "you". "Licensees" and 82 | "recipients" may be individuals or organizations. 83 | 84 | To "modify" a work means to copy from or adapt all or part of the work 85 | in a fashion requiring copyright permission, other than the making of an 86 | exact copy. The resulting work is called a "modified version" of the 87 | earlier work or a work "based on" the earlier work. 88 | 89 | A "covered work" means either the unmodified Program or a work based 90 | on the Program. 91 | 92 | To "propagate" a work means to do anything with it that, without 93 | permission, would make you directly or secondarily liable for 94 | infringement under applicable copyright law, except executing it on a 95 | computer or modifying a private copy. Propagation includes copying, 96 | distribution (with or without modification), making available to the 97 | public, and in some countries other activities as well. 98 | 99 | To "convey" a work means any kind of propagation that enables other 100 | parties to make or receive copies. Mere interaction with a user through 101 | a computer network, with no transfer of a copy, is not conveying. 102 | 103 | An interactive user interface displays "Appropriate Legal Notices" 104 | to the extent that it includes a convenient and prominently visible 105 | feature that (1) displays an appropriate copyright notice, and (2) 106 | tells the user that there is no warranty for the work (except to the 107 | extent that warranties are provided), that licensees may convey the 108 | work under this License, and how to view a copy of this License. If 109 | the interface presents a list of user commands or options, such as a 110 | menu, a prominent item in the list meets this criterion. 111 | 112 | 1. Source Code. 113 | 114 | The "source code" for a work means the preferred form of the work 115 | for making modifications to it. "Object code" means any non-source 116 | form of a work. 117 | 118 | A "Standard Interface" means an interface that either is an official 119 | standard defined by a recognized standards body, or, in the case of 120 | interfaces specified for a particular programming language, one that 121 | is widely used among developers working in that language. 122 | 123 | The "System Libraries" of an executable work include anything, other 124 | than the work as a whole, that (a) is included in the normal form of 125 | packaging a Major Component, but which is not part of that Major 126 | Component, and (b) serves only to enable use of the work with that 127 | Major Component, or to implement a Standard Interface for which an 128 | implementation is available to the public in source code form. A 129 | "Major Component", in this context, means a major essential component 130 | (kernel, window system, and so on) of the specific operating system 131 | (if any) on which the executable work runs, or a compiler used to 132 | produce the work, or an object code interpreter used to run it. 133 | 134 | The "Corresponding Source" for a work in object code form means all 135 | the source code needed to generate, install, and (for an executable 136 | work) run the object code and to modify the work, including scripts to 137 | control those activities. However, it does not include the work's 138 | System Libraries, or general-purpose tools or generally available free 139 | programs which are used unmodified in performing those activities but 140 | which are not part of the work. For example, Corresponding Source 141 | includes interface definition files associated with source files for 142 | the work, and the source code for shared libraries and dynamically 143 | linked subprograms that the work is specifically designed to require, 144 | such as by intimate data communication or control flow between those 145 | subprograms and other parts of the work. 146 | 147 | The Corresponding Source need not include anything that users 148 | can regenerate automatically from other parts of the Corresponding 149 | Source. 150 | 151 | The Corresponding Source for a work in source code form is that 152 | same work. 153 | 154 | 2. Basic Permissions. 155 | 156 | All rights granted under this License are granted for the term of 157 | copyright on the Program, and are irrevocable provided the stated 158 | conditions are met. This License explicitly affirms your unlimited 159 | permission to run the unmodified Program. The output from running a 160 | covered work is covered by this License only if the output, given its 161 | content, constitutes a covered work. This License acknowledges your 162 | rights of fair use or other equivalent, as provided by copyright law. 163 | 164 | You may make, run and propagate covered works that you do not 165 | convey, without conditions so long as your license otherwise remains 166 | in force. You may convey covered works to others for the sole purpose 167 | of having them make modifications exclusively for you, or provide you 168 | with facilities for running those works, provided that you comply with 169 | the terms of this License in conveying all material for which you do 170 | not control copyright. Those thus making or running the covered works 171 | for you must do so exclusively on your behalf, under your direction 172 | and control, on terms that prohibit them from making any copies of 173 | your copyrighted material outside their relationship with you. 174 | 175 | Conveying under any other circumstances is permitted solely under 176 | the conditions stated below. Sublicensing is not allowed; section 10 177 | makes it unnecessary. 178 | 179 | 3. Protecting Users' Legal Rights From Anti-Circumvention Law. 180 | 181 | No covered work shall be deemed part of an effective technological 182 | measure under any applicable law fulfilling obligations under article 183 | 11 of the WIPO copyright treaty adopted on 20 December 1996, or 184 | similar laws prohibiting or restricting circumvention of such 185 | measures. 186 | 187 | When you convey a covered work, you waive any legal power to forbid 188 | circumvention of technological measures to the extent such circumvention 189 | is effected by exercising rights under this License with respect to 190 | the covered work, and you disclaim any intention to limit operation or 191 | modification of the work as a means of enforcing, against the work's 192 | users, your or third parties' legal rights to forbid circumvention of 193 | technological measures. 194 | 195 | 4. Conveying Verbatim Copies. 196 | 197 | You may convey verbatim copies of the Program's source code as you 198 | receive it, in any medium, provided that you conspicuously and 199 | appropriately publish on each copy an appropriate copyright notice; 200 | keep intact all notices stating that this License and any 201 | non-permissive terms added in accord with section 7 apply to the code; 202 | keep intact all notices of the absence of any warranty; and give all 203 | recipients a copy of this License along with the Program. 204 | 205 | You may charge any price or no price for each copy that you convey, 206 | and you may offer support or warranty protection for a fee. 207 | 208 | 5. Conveying Modified Source Versions. 209 | 210 | You may convey a work based on the Program, or the modifications to 211 | produce it from the Program, in the form of source code under the 212 | terms of section 4, provided that you also meet all of these conditions: 213 | 214 | a) The work must carry prominent notices stating that you modified 215 | it, and giving a relevant date. 216 | 217 | b) The work must carry prominent notices stating that it is 218 | released under this License and any conditions added under section 219 | 7. This requirement modifies the requirement in section 4 to 220 | "keep intact all notices". 221 | 222 | c) You must license the entire work, as a whole, under this 223 | License to anyone who comes into possession of a copy. This 224 | License will therefore apply, along with any applicable section 7 225 | additional terms, to the whole of the work, and all its parts, 226 | regardless of how they are packaged. This License gives no 227 | permission to license the work in any other way, but it does not 228 | invalidate such permission if you have separately received it. 229 | 230 | d) If the work has interactive user interfaces, each must display 231 | Appropriate Legal Notices; however, if the Program has interactive 232 | interfaces that do not display Appropriate Legal Notices, your 233 | work need not make them do so. 234 | 235 | A compilation of a covered work with other separate and independent 236 | works, which are not by their nature extensions of the covered work, 237 | and which are not combined with it such as to form a larger program, 238 | in or on a volume of a storage or distribution medium, is called an 239 | "aggregate" if the compilation and its resulting copyright are not 240 | used to limit the access or legal rights of the compilation's users 241 | beyond what the individual works permit. Inclusion of a covered work 242 | in an aggregate does not cause this License to apply to the other 243 | parts of the aggregate. 244 | 245 | 6. Conveying Non-Source Forms. 246 | 247 | You may convey a covered work in object code form under the terms 248 | of sections 4 and 5, provided that you also convey the 249 | machine-readable Corresponding Source under the terms of this License, 250 | in one of these ways: 251 | 252 | a) Convey the object code in, or embodied in, a physical product 253 | (including a physical distribution medium), accompanied by the 254 | Corresponding Source fixed on a durable physical medium 255 | customarily used for software interchange. 256 | 257 | b) Convey the object code in, or embodied in, a physical product 258 | (including a physical distribution medium), accompanied by a 259 | written offer, valid for at least three years and valid for as 260 | long as you offer spare parts or customer support for that product 261 | model, to give anyone who possesses the object code either (1) a 262 | copy of the Corresponding Source for all the software in the 263 | product that is covered by this License, on a durable physical 264 | medium customarily used for software interchange, for a price no 265 | more than your reasonable cost of physically performing this 266 | conveying of source, or (2) access to copy the 267 | Corresponding Source from a network server at no charge. 268 | 269 | c) Convey individual copies of the object code with a copy of the 270 | written offer to provide the Corresponding Source. This 271 | alternative is allowed only occasionally and noncommercially, and 272 | only if you received the object code with such an offer, in accord 273 | with subsection 6b. 274 | 275 | d) Convey the object code by offering access from a designated 276 | place (gratis or for a charge), and offer equivalent access to the 277 | Corresponding Source in the same way through the same place at no 278 | further charge. You need not require recipients to copy the 279 | Corresponding Source along with the object code. If the place to 280 | copy the object code is a network server, the Corresponding Source 281 | may be on a different server (operated by you or a third party) 282 | that supports equivalent copying facilities, provided you maintain 283 | clear directions next to the object code saying where to find the 284 | Corresponding Source. Regardless of what server hosts the 285 | Corresponding Source, you remain obligated to ensure that it is 286 | available for as long as needed to satisfy these requirements. 287 | 288 | e) Convey the object code using peer-to-peer transmission, provided 289 | you inform other peers where the object code and Corresponding 290 | Source of the work are being offered to the general public at no 291 | charge under subsection 6d. 292 | 293 | A separable portion of the object code, whose source code is excluded 294 | from the Corresponding Source as a System Library, need not be 295 | included in conveying the object code work. 296 | 297 | A "User Product" is either (1) a "consumer product", which means any 298 | tangible personal property which is normally used for personal, family, 299 | or household purposes, or (2) anything designed or sold for incorporation 300 | into a dwelling. In determining whether a product is a consumer product, 301 | doubtful cases shall be resolved in favor of coverage. For a particular 302 | product received by a particular user, "normally used" refers to a 303 | typical or common use of that class of product, regardless of the status 304 | of the particular user or of the way in which the particular user 305 | actually uses, or expects or is expected to use, the product. A product 306 | is a consumer product regardless of whether the product has substantial 307 | commercial, industrial or non-consumer uses, unless such uses represent 308 | the only significant mode of use of the product. 309 | 310 | "Installation Information" for a User Product means any methods, 311 | procedures, authorization keys, or other information required to install 312 | and execute modified versions of a covered work in that User Product from 313 | a modified version of its Corresponding Source. The information must 314 | suffice to ensure that the continued functioning of the modified object 315 | code is in no case prevented or interfered with solely because 316 | modification has been made. 317 | 318 | If you convey an object code work under this section in, or with, or 319 | specifically for use in, a User Product, and the conveying occurs as 320 | part of a transaction in which the right of possession and use of the 321 | User Product is transferred to the recipient in perpetuity or for a 322 | fixed term (regardless of how the transaction is characterized), the 323 | Corresponding Source conveyed under this section must be accompanied 324 | by the Installation Information. But this requirement does not apply 325 | if neither you nor any third party retains the ability to install 326 | modified object code on the User Product (for example, the work has 327 | been installed in ROM). 328 | 329 | The requirement to provide Installation Information does not include a 330 | requirement to continue to provide support service, warranty, or updates 331 | for a work that has been modified or installed by the recipient, or for 332 | the User Product in which it has been modified or installed. Access to a 333 | network may be denied when the modification itself materially and 334 | adversely affects the operation of the network or violates the rules and 335 | protocols for communication across the network. 336 | 337 | Corresponding Source conveyed, and Installation Information provided, 338 | in accord with this section must be in a format that is publicly 339 | documented (and with an implementation available to the public in 340 | source code form), and must require no special password or key for 341 | unpacking, reading or copying. 342 | 343 | 7. Additional Terms. 344 | 345 | "Additional permissions" are terms that supplement the terms of this 346 | License by making exceptions from one or more of its conditions. 347 | Additional permissions that are applicable to the entire Program shall 348 | be treated as though they were included in this License, to the extent 349 | that they are valid under applicable law. If additional permissions 350 | apply only to part of the Program, that part may be used separately 351 | under those permissions, but the entire Program remains governed by 352 | this License without regard to the additional permissions. 353 | 354 | When you convey a copy of a covered work, you may at your option 355 | remove any additional permissions from that copy, or from any part of 356 | it. (Additional permissions may be written to require their own 357 | removal in certain cases when you modify the work.) You may place 358 | additional permissions on material, added by you to a covered work, 359 | for which you have or can give appropriate copyright permission. 360 | 361 | Notwithstanding any other provision of this License, for material you 362 | add to a covered work, you may (if authorized by the copyright holders of 363 | that material) supplement the terms of this License with terms: 364 | 365 | a) Disclaiming warranty or limiting liability differently from the 366 | terms of sections 15 and 16 of this License; or 367 | 368 | b) Requiring preservation of specified reasonable legal notices or 369 | author attributions in that material or in the Appropriate Legal 370 | Notices displayed by works containing it; or 371 | 372 | c) Prohibiting misrepresentation of the origin of that material, or 373 | requiring that modified versions of such material be marked in 374 | reasonable ways as different from the original version; or 375 | 376 | d) Limiting the use for publicity purposes of names of licensors or 377 | authors of the material; or 378 | 379 | e) Declining to grant rights under trademark law for use of some 380 | trade names, trademarks, or service marks; or 381 | 382 | f) Requiring indemnification of licensors and authors of that 383 | material by anyone who conveys the material (or modified versions of 384 | it) with contractual assumptions of liability to the recipient, for 385 | any liability that these contractual assumptions directly impose on 386 | those licensors and authors. 387 | 388 | All other non-permissive additional terms are considered "further 389 | restrictions" within the meaning of section 10. If the Program as you 390 | received it, or any part of it, contains a notice stating that it is 391 | governed by this License along with a term that is a further 392 | restriction, you may remove that term. If a license document contains 393 | a further restriction but permits relicensing or conveying under this 394 | License, you may add to a covered work material governed by the terms 395 | of that license document, provided that the further restriction does 396 | not survive such relicensing or conveying. 397 | 398 | If you add terms to a covered work in accord with this section, you 399 | must place, in the relevant source files, a statement of the 400 | additional terms that apply to those files, or a notice indicating 401 | where to find the applicable terms. 402 | 403 | Additional terms, permissive or non-permissive, may be stated in the 404 | form of a separately written license, or stated as exceptions; 405 | the above requirements apply either way. 406 | 407 | 8. Termination. 408 | 409 | You may not propagate or modify a covered work except as expressly 410 | provided under this License. Any attempt otherwise to propagate or 411 | modify it is void, and will automatically terminate your rights under 412 | this License (including any patent licenses granted under the third 413 | paragraph of section 11). 414 | 415 | However, if you cease all violation of this License, then your 416 | license from a particular copyright holder is reinstated (a) 417 | provisionally, unless and until the copyright holder explicitly and 418 | finally terminates your license, and (b) permanently, if the copyright 419 | holder fails to notify you of the violation by some reasonable means 420 | prior to 60 days after the cessation. 421 | 422 | Moreover, your license from a particular copyright holder is 423 | reinstated permanently if the copyright holder notifies you of the 424 | violation by some reasonable means, this is the first time you have 425 | received notice of violation of this License (for any work) from that 426 | copyright holder, and you cure the violation prior to 30 days after 427 | your receipt of the notice. 428 | 429 | Termination of your rights under this section does not terminate the 430 | licenses of parties who have received copies or rights from you under 431 | this License. If your rights have been terminated and not permanently 432 | reinstated, you do not qualify to receive new licenses for the same 433 | material under section 10. 434 | 435 | 9. Acceptance Not Required for Having Copies. 436 | 437 | You are not required to accept this License in order to receive or 438 | run a copy of the Program. Ancillary propagation of a covered work 439 | occurring solely as a consequence of using peer-to-peer transmission 440 | to receive a copy likewise does not require acceptance. However, 441 | nothing other than this License grants you permission to propagate or 442 | modify any covered work. These actions infringe copyright if you do 443 | not accept this License. Therefore, by modifying or propagating a 444 | covered work, you indicate your acceptance of this License to do so. 445 | 446 | 10. Automatic Licensing of Downstream Recipients. 447 | 448 | Each time you convey a covered work, the recipient automatically 449 | receives a license from the original licensors, to run, modify and 450 | propagate that work, subject to this License. You are not responsible 451 | for enforcing compliance by third parties with this License. 452 | 453 | An "entity transaction" is a transaction transferring control of an 454 | organization, or substantially all assets of one, or subdividing an 455 | organization, or merging organizations. If propagation of a covered 456 | work results from an entity transaction, each party to that 457 | transaction who receives a copy of the work also receives whatever 458 | licenses to the work the party's predecessor in interest had or could 459 | give under the previous paragraph, plus a right to possession of the 460 | Corresponding Source of the work from the predecessor in interest, if 461 | the predecessor has it or can get it with reasonable efforts. 462 | 463 | You may not impose any further restrictions on the exercise of the 464 | rights granted or affirmed under this License. For example, you may 465 | not impose a license fee, royalty, or other charge for exercise of 466 | rights granted under this License, and you may not initiate litigation 467 | (including a cross-claim or counterclaim in a lawsuit) alleging that 468 | any patent claim is infringed by making, using, selling, offering for 469 | sale, or importing the Program or any portion of it. 470 | 471 | 11. Patents. 472 | 473 | A "contributor" is a copyright holder who authorizes use under this 474 | License of the Program or a work on which the Program is based. The 475 | work thus licensed is called the contributor's "contributor version". 476 | 477 | A contributor's "essential patent claims" are all patent claims 478 | owned or controlled by the contributor, whether already acquired or 479 | hereafter acquired, that would be infringed by some manner, permitted 480 | by this License, of making, using, or selling its contributor version, 481 | but do not include claims that would be infringed only as a 482 | consequence of further modification of the contributor version. For 483 | purposes of this definition, "control" includes the right to grant 484 | patent sublicenses in a manner consistent with the requirements of 485 | this License. 486 | 487 | Each contributor grants you a non-exclusive, worldwide, royalty-free 488 | patent license under the contributor's essential patent claims, to 489 | make, use, sell, offer for sale, import and otherwise run, modify and 490 | propagate the contents of its contributor version. 491 | 492 | In the following three paragraphs, a "patent license" is any express 493 | agreement or commitment, however denominated, not to enforce a patent 494 | (such as an express permission to practice a patent or covenant not to 495 | sue for patent infringement). To "grant" such a patent license to a 496 | party means to make such an agreement or commitment not to enforce a 497 | patent against the party. 498 | 499 | If you convey a covered work, knowingly relying on a patent license, 500 | and the Corresponding Source of the work is not available for anyone 501 | to copy, free of charge and under the terms of this License, through a 502 | publicly available network server or other readily accessible means, 503 | then you must either (1) cause the Corresponding Source to be so 504 | available, or (2) arrange to deprive yourself of the benefit of the 505 | patent license for this particular work, or (3) arrange, in a manner 506 | consistent with the requirements of this License, to extend the patent 507 | license to downstream recipients. "Knowingly relying" means you have 508 | actual knowledge that, but for the patent license, your conveying the 509 | covered work in a country, or your recipient's use of the covered work 510 | in a country, would infringe one or more identifiable patents in that 511 | country that you have reason to believe are valid. 512 | 513 | If, pursuant to or in connection with a single transaction or 514 | arrangement, you convey, or propagate by procuring conveyance of, a 515 | covered work, and grant a patent license to some of the parties 516 | receiving the covered work authorizing them to use, propagate, modify 517 | or convey a specific copy of the covered work, then the patent license 518 | you grant is automatically extended to all recipients of the covered 519 | work and works based on it. 520 | 521 | A patent license is "discriminatory" if it does not include within 522 | the scope of its coverage, prohibits the exercise of, or is 523 | conditioned on the non-exercise of one or more of the rights that are 524 | specifically granted under this License. You may not convey a covered 525 | work if you are a party to an arrangement with a third party that is 526 | in the business of distributing software, under which you make payment 527 | to the third party based on the extent of your activity of conveying 528 | the work, and under which the third party grants, to any of the 529 | parties who would receive the covered work from you, a discriminatory 530 | patent license (a) in connection with copies of the covered work 531 | conveyed by you (or copies made from those copies), or (b) primarily 532 | for and in connection with specific products or compilations that 533 | contain the covered work, unless you entered into that arrangement, 534 | or that patent license was granted, prior to 28 March 2007. 535 | 536 | Nothing in this License shall be construed as excluding or limiting 537 | any implied license or other defenses to infringement that may 538 | otherwise be available to you under applicable patent law. 539 | 540 | 12. No Surrender of Others' Freedom. 541 | 542 | If conditions are imposed on you (whether by court order, agreement or 543 | otherwise) that contradict the conditions of this License, they do not 544 | excuse you from the conditions of this License. If you cannot convey a 545 | covered work so as to satisfy simultaneously your obligations under this 546 | License and any other pertinent obligations, then as a consequence you may 547 | not convey it at all. For example, if you agree to terms that obligate you 548 | to collect a royalty for further conveying from those to whom you convey 549 | the Program, the only way you could satisfy both those terms and this 550 | License would be to refrain entirely from conveying the Program. 551 | 552 | 13. Use with the GNU Affero General Public License. 553 | 554 | Notwithstanding any other provision of this License, you have 555 | permission to link or combine any covered work with a work licensed 556 | under version 3 of the GNU Affero General Public License into a single 557 | combined work, and to convey the resulting work. The terms of this 558 | License will continue to apply to the part which is the covered work, 559 | but the special requirements of the GNU Affero General Public License, 560 | section 13, concerning interaction through a network will apply to the 561 | combination as such. 562 | 563 | 14. Revised Versions of this License. 564 | 565 | The Free Software Foundation may publish revised and/or new versions of 566 | the GNU General Public License from time to time. Such new versions will 567 | be similar in spirit to the present version, but may differ in detail to 568 | address new problems or concerns. 569 | 570 | Each version is given a distinguishing version number. If the 571 | Program specifies that a certain numbered version of the GNU General 572 | Public License "or any later version" applies to it, you have the 573 | option of following the terms and conditions either of that numbered 574 | version or of any later version published by the Free Software 575 | Foundation. If the Program does not specify a version number of the 576 | GNU General Public License, you may choose any version ever published 577 | by the Free Software Foundation. 578 | 579 | If the Program specifies that a proxy can decide which future 580 | versions of the GNU General Public License can be used, that proxy's 581 | public statement of acceptance of a version permanently authorizes you 582 | to choose that version for the Program. 583 | 584 | Later license versions may give you additional or different 585 | permissions. However, no additional obligations are imposed on any 586 | author or copyright holder as a result of your choosing to follow a 587 | later version. 588 | 589 | 15. Disclaimer of Warranty. 590 | 591 | THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY 592 | APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT 593 | HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY 594 | OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, 595 | THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR 596 | PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM 597 | IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF 598 | ALL NECESSARY SERVICING, REPAIR OR CORRECTION. 599 | 600 | 16. Limitation of Liability. 601 | 602 | IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING 603 | WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS 604 | THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY 605 | GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE 606 | USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF 607 | DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD 608 | PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS), 609 | EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF 610 | SUCH DAMAGES. 611 | 612 | 17. Interpretation of Sections 15 and 16. 613 | 614 | If the disclaimer of warranty and limitation of liability provided 615 | above cannot be given local legal effect according to their terms, 616 | reviewing courts shall apply local law that most closely approximates 617 | an absolute waiver of all civil liability in connection with the 618 | Program, unless a warranty or assumption of liability accompanies a 619 | copy of the Program in return for a fee. 620 | 621 | END OF TERMS AND CONDITIONS 622 | 623 | How to Apply These Terms to Your New Programs 624 | 625 | If you develop a new program, and you want it to be of the greatest 626 | possible use to the public, the best way to achieve this is to make it 627 | free software which everyone can redistribute and change under these terms. 628 | 629 | To do so, attach the following notices to the program. It is safest 630 | to attach them to the start of each source file to most effectively 631 | state the exclusion of warranty; and each file should have at least 632 | the "copyright" line and a pointer to where the full notice is found. 633 | 634 | 635 | Copyright (C) 636 | 637 | This program is free software: you can redistribute it and/or modify 638 | it under the terms of the GNU General Public License as published by 639 | the Free Software Foundation, either version 3 of the License, or 640 | (at your option) any later version. 641 | 642 | This program is distributed in the hope that it will be useful, 643 | but WITHOUT ANY WARRANTY; without even the implied warranty of 644 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 645 | GNU General Public License for more details. 646 | 647 | You should have received a copy of the GNU General Public License 648 | along with this program. If not, see . 649 | 650 | Also add information on how to contact you by electronic and paper mail. 651 | 652 | If the program does terminal interaction, make it output a short 653 | notice like this when it starts in an interactive mode: 654 | 655 | Copyright (C) 656 | This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'. 657 | This is free software, and you are welcome to redistribute it 658 | under certain conditions; type `show c' for details. 659 | 660 | The hypothetical commands `show w' and `show c' should show the appropriate 661 | parts of the General Public License. Of course, your program's commands 662 | might be different; for a GUI interface, you would use an "about box". 663 | 664 | You should also get your employer (if you work as a programmer) or school, 665 | if any, to sign a "copyright disclaimer" for the program, if necessary. 666 | For more information on this, and how to apply and follow the GNU GPL, see 667 | . 668 | 669 | The GNU General Public License does not permit incorporating your program 670 | into proprietary programs. If your program is a subroutine library, you 671 | may consider it more useful to permit linking proprietary applications with 672 | the library. If this is what you want to do, use the GNU Lesser General 673 | Public License instead of this License. But first, please read 674 | . 675 | --------------------------------------------------------------------------------