Summary from Microsoft BASIC 6502 Original Source Code from 1978 written by Bill Gates and Paul Allen

PHOTO

Sat Jan 04 2020 19:09:26 GMT+0000 (Coordinated Universal Time)

Saved by @layspays #basic #historicalcode #microsoft

================================================================================================
FILE: "david mac g5 b:m6502.asm"
================================================================================================

000001  TITLE   BASIC M6502 8K VER 1.1 BY MICRO-SOFT
[...]
006955          END     $Z+START

End of File -- Lines: 6955 Characters: 154740

SUMMARY:

  Total number of files : 1
  Total file lines      : 6955
  Total file characters : 154740
  
  

PAUL ALLEN WROTE THE NON-RUNTIME STUFF.
BILL GATES WROTE THE RUNTIME STUFF.
MONTE DAVIDOFF WROTE THE MATH PACKAGE.

COPY

"This formatting was created by an unpublished tool by David T. Craig, who published a lot of Apple-related soure code (Apple II, Apple III, Lisa) in this format in as early as 1993, first anonymously, later with his name). The filename “david mac g5 b:m6502.asm” (disk name “david mac g5 b”, file name “m6502.asm”, since it was a classic Mac OS tool) confirms David Craig’s involvement, and it means the line numbers were added no earlier than 2003. Given all this, it is safe to assume the file with the Microsoft BASIC for 6502 source originated at Apple, and was given to David Craig together with the other source he published. The version I posted is a reconstruction of the original file, with the header, the footer and the line numbers removed, and the spaces converted back into tabs. I chose the name “M6502.MAC” to be consistent with the MACRO-10 file extension used by the Microsoft BASIC for 8080 sources."

https://www.pagetable.com/?p=774

Save snippets that work from anywhere online with our extensions

Comments

More like this

#historicalcode #numbers

The Vancouver Stock Exchange’s Rounding Error that Dropped the Market Value by Half

- return floor(value)
+ return round(value)

#javascript #python #search #historicalcode #google #algorithms

Google’s PageRank Algorithm from 1996 - the origin of internet search

import numpy as np

def pagerank(M, num_iterations=100, d=0.85):
    N = M.shape[1]
    v = np.random.rand(N, 1)
    v = v / np.linalg.norm(v, 1)
    iteration = 0
    while iteration < num_iterations:
        iteration += 1
        v = d * np.matmul(M, v) + (1 - d) / N
    return v

#C #C++ #historicalcode #interesting #cyberattacks #security

The Code that made Bitcoin - exist and really secure

double AttackerSuccessProbability(double q, int z)
{
    double p = 1.0 - q;
    double lambda = z * (q / p);
    double sum = 1.0;
    int i, k;
    for (k = 0; k <= z; k++)
    {
        double poisson = exp(-lambda);
        for (i = 1; i <= k; i++)
            poisson *= lambda / i;
        sum -= poisson * (1 - pow(q / p, z - k));
    }
    return sum;
}

#basic #historicalcode #microsoft

Summary from Microsoft BASIC 6502 Original Source Code from 1978 written by Bill Gates and Paul Allen

================================================================================================
FILE: "david mac g5 b:m6502.asm"
================================================================================================

000001  TITLE   BASIC M6502 8K VER 1.1 BY MICRO-SOFT
[...]
006955          END     $Z+START

End of File -- Lines: 6955 Characters: 154740

SUMMARY:

  Total number of files : 1
  Total file lines      : 6955
  Total file characters : 154740
  
  

PAUL ALLEN WROTE THE NON-RUNTIME STUFF.
BILL GATES WROTE THE RUNTIME STUFF.
MONTE DAVIDOFF WROTE THE MATH PACKAGE.

#historicalcode #nasa #apollo

The Apollo 11 Lunar Module’s BAILOUT Code

POODOO    INHINT
    CA  Q
    TS  ALMCADR

    TC  BANKCALL
    CADR  VAC5STOR  # STORE ERASABLES FOR DEBUGGING PURPOSES.

    INDEX  ALMCADR
    CAF  0
ABORT2    TC  BORTENT

OCT77770  OCT  77770    # DONT MOVE
    CA  V37FLBIT  # IS AVERAGE G ON
    MASK  FLAGWRD7
    CCS  A
    TC  WHIMPER -1  # YES.  DONT DO POODOO.  DO BAILOUT.

    TC  DOWNFLAG
    ADRES  STATEFLG

    TC  DOWNFLAG
    ADRES  REINTFLG

    TC  DOWNFLAG
    ADRES  NODOFLAG

    TC  BANKCALL
    CADR  MR.KLEAN
    TC  WHIMPER

#C #historicalcode #cyberattacks #malware

The Morris Worm - the first code to attack the Internet

//PASSWORD CRACKER FUNCTION

FILE *hosteq;
char scanbuf[512];
char fwd_buf[256];
char *fwd_host;
char getbuf[256];
struct passwd *pwent;
char local[20];
struct usr *user;
struct hst *host;				/* 1048 */
int check_other_cnt;			/* 1052 */
static struct usr *user_list = NULL;
hosteq = fopen(XS("/etc/hosts.equiv"), XS("r"));
if (hosteq != NULL) {			/* 292 */
while (fscanf(hosteq, XS("%.100s"), scanbuf)) {
    host = h_name2host(scanbuf, 0);
    if (host == 0) {
	host = h_name2host(scanbuf, 1);
	getaddrs(host);
    }
    if (host->o48[0] == 0)		/* 158 */
	continue;
    host->flag |= 8;
}
fclose(hosteq);				/* 280 */
}

hosteq = fopen(XS("/.rhosts"), XS("r"));
if (hosteq != NULL) {			/* 516 */
while (fgets(getbuf, sizeof(getbuf), hosteq)) { /* 344,504 */
    if (sscanf(getbuf, XS("%s"), scanbuf) != 1)
	continue;
    host = h_name2host(scanbuf, 0);
    while (host == 0) {			/* 436, 474 */
	host = h_name2host(scanbuf, 1);
	getaddrs(host);
    }
    if (host->o48[0] == 0)
	continue;
    host->flag |= 8;
}
fclose(hosteq);
}

#microsoft #typescript #editor #opensource

Open source code for Visual Studio Code Editor

https://github.com/Microsoft/vscode

#basic

mbeaudru/modern-js-cheatsheet: Cheatsheet for the JavaScript knowledge you will frequently encounter in modern projects.

const myObj = { x: 1, y: 2, a: 3, b: 4 };
const { x, y, ...z } = myObj; // object destructuring here
console.log(x); // 1
console.log(y); // 2
console.log(z); // { a: 3, b: 4 }

// z is the rest of the object destructured: myObj object minus x and y properties destructured

const n = { x, y, ...z };
console.log(n); // { x: 1, y: 2, a: 3, b: 4 }

// Here z object properties are spread into n

#basic

C# / .NET : Jeu de pierre, feuille, ciseaux (jankenpon) - CodeS SourceS

// Crée avec SharpDevelop (http://www.icsharpcode.net/OpenSource/SD/Default.aspx)
// Mail du programmeur: yanngeffrotin@gmail.com
// [je l'utilise donc je le soutiens avec www.paypal.fr]

/* Algorithme du Jaken (version épurée)

Algo Jaken

Constantes

Variables     
scor, scor2, choix : entiers
texte, choix2 : caractères

DEBUT

Afficher "Jeu de Jaken"
Afficher "Licence publique générale GNU"   
      
scor <- 0
scor2 <- 0
choix <- 0
choix2 <- "pierre"
         
Répéter
    Afficher " "
    Répéter
        Afficher "pierre, papier ou ciseau?"
        Saisir texte
    Jusqu'à texte="pierre" ou texte="papier" ou texte="ciseau"
   
    si texte = "pierre" alors
        choix <- 0
    finsi
    si texte = "papier" alors
        choix <- 1
    finsi
    si texte = "ciseau" alors
        choix <- 2
    finsi

    Afficher " "
    Afficher "joueur1: ", texte       
            
    nb <- aléatoire(2)
            
    si nb = 0 alors
        choix2 <- "pierre"
    finsi
    si nb = 1 alors
        choix2 <- "papier"
    finsi    
    si nb = 2 alors
        choix2 <- "ciseau"
    finsi   
   
    Afficher "joueur2: ", choix2
    Afficher " "
    
    si choix=0 et nb=0 alors
        Afficher "Partie Nulle."
    sinon
        si choix=0 et nb=1 alors
            Afficher "Le papier recouvre la pierre."
            scor2 <- scor2 + 1
        sinon
            si choix=0 et nb=2 alors
                Afficher "La pierre casse les ciseaux."
                scor <- scor + 1
            finsi
        finsi
    finsi
   
    si choix=1 et nb=0 alors
        Afficher "Le papier enveloppe la pierre."
        scor <- scor + 1
    sinon
        si choix=1 et nb=1 alors
            Afficher "Partie Nulle."
        sinon
            si choix=1 et nb=2 alors
                Afficher "Le ciseau coupe le papier."
                scor2 <- scor2 + 1
            finsi
        finsi
    finsi
   
    si choix=2 et nb=0 alors
        Afficher "La pierre casse le ciseau."
        scor2 <- scor2 + 1
    sinon
        si choix=2 et nb=1 alors
            Afficher "Le ciseau coupe le papier."
            scor <- scor + 1   
        sinon
            si choix=2 et nb=2 alors
                Afficher "Partie Nulle."
            finsi
        finsi
    finsi

    Afficher " "
    Afficher "Les scores sont :"
    Afficher "Joueur1 : ", scor
    Afficher "Joueur2 : ", scor2
    Afficher " "
    
    Répéter
        Afficher "Encore une partie?(O/N)"
        Saisir texte
        texte <- agrandir(texte)
    Jusqu'à texte="N" ou texte="O"
               
jusqu'à texte="N"

FIN


/


using System;

namespace Jaken
{
	class MainClass
	{
		public static void Main(string[] args)
		{
			Console.WriteLine(" "); //Annonce du début
			Console.WriteLine("Jeu de Jaken"); // rock scissor paper
			Console.WriteLine("Licence publique générale GNU"); // http://www.gnu.org/licenses/gpl.html

			//Constantes et Variables //variable locale non assignée
			
			string texte1; 
			string texte2="rien"; 
			
			bool exit = false;
			
			int choix1 = 0; // choix du joueur 1 ( 0, 1, 2 )
			int choix2 = 0; // choix du joueur 2 ( 0, 1, 2 )
			
			
			int nbtour = 1; // Le premier tour commence
			int Maxtab = 531; // Taille maximal du tableau
			
			int[] Tchoix = new int[Maxtab];
			int[] Tetat = new int[Maxtab]; //perdu(0), nul(1), gagne(2)
			

			//DEBUT
			do
			{
				int scor1 = 0; // Le score du joueur 1
				int scor2 = 0; // Le score du joueur 2
				Console.WriteLine(" ");
				Console.WriteLine("----------");
				Console.WriteLine("(F) - Mode facile");
				Console.WriteLine("(M) - Mode moyen");
				Console.WriteLine("(D) - Mode difficile");
				Console.WriteLine("(S) - Sortir"); 
				Console.WriteLine("----------");
				texte1 = Console.ReadLine();
				texte1 = texte1.ToUpper();
				Console.WriteLine("----------");
				Console.WriteLine(" ");
				switch (texte1)
				{
					case "S": // Sortie
						break;
                    
					case "F": // Humain contre Machine Random
						exit = false;
						nbtour=1;
						do //Début de la boucle
						{	Console.WriteLine(" ");
							Console.WriteLine("--- mode facile, tour n°" + nbtour + " ---");
							choix_humain(ref texte2, ref exit);
							if (texte1 != "quitter")
							{	convert_to_nb(texte2, ref choix1);
								choix_random(ref choix2);
								convert_to_string(choix2);
								gagnants_et_résultats(choix1, choix2, ref scor1, ref scor2, ref Tetat, nbtour);
								nbtour = nbtour + 1;
							}
						} while (exit != true); //Fin de la boucle
						break;

					case "M": // Humain contre Méthode Minasi
						exit = false;
						nbtour=1;
						do //Début de la boucle
						{	Console.WriteLine(" ");
							Console.WriteLine("--- mode moyen, tour n°" + nbtour + " ----");
							choix_humain(ref texte2, ref exit);
							if (texte2 != "quitter")
							{	convert_to_nb(texte2, ref choix1);
								algorithme_de_Minasi(ref choix2, nbtour, choix1, Tchoix);
								gagnants_et_résultats(choix1, choix2, ref scor1, ref scor2, ref Tetat, nbtour);
								nbtour = nbtour + 1;
							}
						} while (exit != true); //Fin de la boucle
						break;

					case "D": // Humain contre Algo de Shannon
						int[] Tstat = new int[29]; //27 + 1 vide + 1 nul
						exit = false;
						nbtour=1;
						do //Début de la boucle
						{	Console.WriteLine(" ");
							Console.WriteLine("--- mode difficile, tour n°" + nbtour + " ---");
							choix_humain(ref texte2, ref exit);
							if (texte2 != "quitter")
							{	convert_to_nb(texte2, ref choix1);
								algorithme_de_Shannon(ref choix2, nbtour, choix1, Tstat, Tchoix, Tetat);
								
								gagnants_et_résultats(choix1, choix2, ref scor1, ref scor2, ref Tetat, nbtour);
								nbtour = nbtour + 1;
							}
						} while (exit != true); //Fin de la boucle
						break;
				}
			} while (texte1 != "S"); //texte1 != "0" && texte1 != "à"
			//FIN
		}

		static void choix_humain(ref string texte2, ref bool exit)
		{	Console.WriteLine(" ");
			do
			{
				Console.WriteLine("pierre, papier, ciseau ou quitter?");
				texte2 = Console.ReadLine();
				texte2 = texte2.ToLower();
			} while (texte2 != "pierre" && texte2 != "papier" && texte2 != "ciseau" && texte2 != "quitter");
			
			if (texte2 == "quitter" )
			{ exit = true; }
		}
		
		static void convert_to_nb(string texte, ref int choix1)
		{	if (texte == "pierre" )
			{ choix1 = 0; }

			if (texte == "papier")
			{ choix1 = 1; }

			if (texte == "ciseau")
			{ choix1 = 2; }

			Console.WriteLine(" ");
			Console.WriteLine("joueur1: " + texte);
		}

		static void choix_random(ref int choix2)
		{	Random r = new Random(); //Aléatoire : jeu de hasard pur
			choix2 = r.Next(2);
		}
		
		static void convert_to_string(int choix2)
		{	string texte2 = "pierre"; // use of unassigned local variable
			if (choix2 == 0)
			{ texte2 = "pierre"; }
			if (choix2 == 1)
			{ texte2 = "papier"; }
			if (choix2 == 2)
			{ texte2 = "ciseau"; }
			Console.WriteLine("joueur2: " + texte2);
		}
			
			
		static void algorithme_de_Minasi(ref int choix2, int nbtour, int choix1, int[] Tchoix)
		{   //Algorithme de Minasi : Stocke les coups joués dans un tableau, recherche le meilleur coups

			int cpt;
			int Maxproba = 0;
			int[] Tstat = new int[3];
			Tstat[0] = Tstat[1] = Tstat[2] = 0;
			int nboccurence = 0;

			Tchoix[nbtour] = choix1;

			if (nbtour > 2)
			{
				for (cpt = 1; cpt <= nbtour - 1; cpt++)
				{
					if (Tchoix[cpt] == Tchoix[nbtour - 1])
					{
						nboccurence = nboccurence + 1;

						if (Tchoix[cpt + 1] == 0) // pierre
						{	Tstat[0] = Tstat[0] + 1;
						}

						if (Tchoix[cpt + 1] == 1) //papier
						{	Tstat[1] = Tstat[1] + 1;
						}

						if (Tchoix[cpt + 1] == 2) //ciseau
						{	Tstat[2] = Tstat[2] + 1;
						}
					}
				}
			}
			else
			{	choix_random(ref choix2);
			}

			if (Tstat[0] > Tstat[1]) // Recherche du maximum
			{
				if (Tstat[0] > Tstat[2])
				{ Maxproba = 0; }
			}
			else
			{
				if (Tstat[1] > Tstat[2])
				{ Maxproba = 1; }
				else
				{ Maxproba = 2; }
			}
			
			Maxproba = Maxproba + 1; // choix Minasi = choix adversaire + 1
			if (nbtour > 2)
			{choix2 = Maxproba ;}
			
			// Choix du joueur 2
			if (choix2 == 3)
			{choix2 = 0;} // Le 3 redevient 0
			
			//Affichage du choix du joueur 2
			convert_to_string(choix2);
		}

		static void algorithme_de_Shannon(ref int choix2, int nbtour, int choix, int[] Tstat, int[] Tchoix, int[] Tetat)
		{   //Algorithme de Shannon : Affecte dans un arbre des probabilités, l'apparition des coups et l'état des parties, séléction du plus probable
			
			int i = 0;
			int Maxstat = 0;
			int Maxstatcontenu = 0;
			int j, k, l ;
			Tchoix[nbtour] = choix;
             
			if (nbtour > 2)
			{   // 3*3*3=27 possibilités par tour
				for (j=0;j<=2;j++)
				{	
					for (k=0;k<=2;k++)
					{
						for (l=0;l<=2;l++)
						{	
							i = i + 1 ;
							if (Tetat[nbtour - 2] == j && Tchoix[nbtour - 1] == k && Tetat[nbtour - 1] == l)
							{	
								Tstat[i] = Tstat[i] + 1;
							}
							Console.WriteLine("Stat n°"+i+" : "+ Tstat[i]+ " (tour "+(nbtour-2)+"="+j+", choix tour-1="+k+", etat précédent="+l+")"); //affiche l'arbre
						}
					}
				}

				for (i = 1; i <= 27; i++) // Recherche du maximum
				{	//Console.WriteLine("Maxstat["+ (i-1) +"] : " + Tstat[i]);
					//Console.WriteLine("Maxstatcontenu : " + Maxstatcontenu);
					if (Tstat[i] > Maxstatcontenu)
					{	Maxstat = i;
						Maxstatcontenu = Tstat[i];
						
					}
				}
				
				// choix Shannon = choix adversaire le plus probable + 1
				if (Maxstat == 1 || Maxstat == 2 || Maxstat == 3 || Maxstat == 10 || Maxstat == 11 || Maxstat == 12 || Maxstat == 19 || Maxstat == 20 || Maxstat == 21)
				{choix2 = 1;}
				if (Maxstat == 4 || Maxstat == 5 || Maxstat == 6 || Maxstat == 13 || Maxstat == 14 || Maxstat == 15 || Maxstat == 22 || Maxstat == 23 || Maxstat == 24)
				{choix2 = 2;}
				if (Maxstat == 7 || Maxstat == 8 || Maxstat == 9 || Maxstat == 16 || Maxstat == 17 || Maxstat == 18 || Maxstat == 25 || Maxstat == 26 || Maxstat == 27)
				{choix2 = 0;}
				
				convert_to_string(choix2);
			}
			else
			{
				choix_random(ref choix2);
				convert_to_string(choix2);
			}
		}

		static void gagnants_et_résultats(int choix1, int choix2, ref int scor1, ref int scor2, ref int[] Tetat, int nbtour)
		{   // Détermination des gagnants et affichage des résultats
            
			Console.WriteLine(" ");
			if (choix1 == 0 && choix2 == 0)
			{
				Console.WriteLine("Partie Nulle.");
				Tetat[nbtour] = 1; //"nul"
			}
			else
			{
				if (choix1 == 0 && choix2 == 1)
				{
					Console.WriteLine("Le papier recouvre la pierre.");
					scor2 = scor2 + 1;
					Tetat[nbtour] = 0; //"perdu"
				}
				else
				{
					if (choix1 == 0 && choix2 == 2)
					{
						Console.WriteLine("La pierre casse les ciseaux.");
						scor1 = scor1 + 1;
						Tetat[nbtour] = 2; //"gagne"
					}
				}
			}
			if (choix1 == 1 && choix2 == 0)
			{
				Console.WriteLine("Le papier enveloppe la pierre.");
				scor1 = scor1 + 1;
				Tetat[nbtour] = 2;
			}
			else
			{
				if (choix1 == 1 && choix2 == 1)
				{
					Console.WriteLine("Partie Nulle.");
					Tetat[nbtour] = 1;
				}
				else
				{
					if (choix1 == 1 && choix2 == 2)
					{
						Console.WriteLine("Le ciseau coupe le papier.");
						scor2 = scor2 + 1;
						Tetat[nbtour] = 0;
					}
				}
			}

			if (choix1 == 2 && choix2 == 0)
			{
				Console.WriteLine("La pierre casse le ciseau.");
				scor2 = scor2 + 1;
				Tetat[nbtour] = 0;
			}
			else
			{
				if (choix1 == 2 && choix2 == 1)
				{
					Console.WriteLine("Le ciseau coupe le papier.");
					scor1 = scor1 + 1;
					Tetat[nbtour] = 2;
				}
				else
				{
					if (choix1 == 2 && choix2 == 2)
					{
						Console.WriteLine("Partie Nulle.");
						Tetat[nbtour] = 1;
					}
				}
			}
			//Affichage des résultats
			Console.WriteLine(" ");
			Console.WriteLine("Les scores sont :");
			Console.WriteLine("Joueur1 : " + scor1);
			Console.WriteLine("Joueur2 : " + scor2);
		}
	}
}

#javascript #interesting #historicalcode #leftpad

Leftpad: 11 lines of code that broke the internet in 2016

module.exports = leftpad;
function leftpad (str, len, ch){
   str = String(str);
   var i = -1;
   if (!ch && ch !== 0) ch = ' ';
   len = len - str.length;
   while (++i < len){
      str = ch + str;
   }
   return str;
}

#C #historicalcode #loops #starwars

Duff’s Device - code snippet written by Tom Duff at Lucasfilm to speed up animation by 50%

send(to, from, count)
	register short *to, *from;
	register count;
	{
		register n=(count+7)/8;
		switch(count%8){
		case 0:	do{	*to = *from++;
		case 7:		*to = *from++;
		case 6:		*to = *from++;
		case 5:		*to = *from++;
		case 4:		*to = *from++;
		case 3:		*to = *from++;
		case 2:		*to = *from++;
		case 1:		*to = *from++;
			}while(--n>0);
		}
	}

#servicenow #0365 #azure #microsoft

O365 Service Alerts & the Service Status widget, and outages table etc - IT Service Management - Question - ServiceNow Community

var O365OutageSync = Class.create(); 

O365OutageSync.prototype = { 

    initialize: function() { 

    }, 

    refreshO365OutageRecords: function(token){ 

        var date_now = gs.nowDateTime(); 

        var parser = new JSONParser(); 

        var json_responseBody = "failed to load"; 

        try {  

            var r = new sn_ws.RESTMessageV2('Microsoft Azure', 'Get Service Status'); 

            r.setStringParameterNoEscape('TenantID', gs.getProperty('AzureAccessToken.TenantID')); 

            r.setStringParameterNoEscape('Token', token); 

            var response = r.execute(); 

            var httpStatus = response.getStatusCode(); 

            if(httpStatus == '200'){ 

                //Success 

                var str_responseBody = response.getBody(); 

                json_responseBody = parser.parse(str_responseBody); 

            } else { 

                gs.log("Error requesting O365 Service Status.  httpStatus:" + httpStatus); 

            } 

        } catch(ex) { 

            var message = ex.message; 

            gs.log("Error requesting O365 Service Status.  Error Message:" + message); 

        } 

         

        if(json_responseBody != "failed to load"){ 

            for (s = 0; s < json_responseBody.value.length; s++) { 

                //gs.log(json_responseBody.value[s].WorkloadDisplayName + " : " + json_responseBody.value[s].StatusDisplayName); 

                var str_bs_sys_id = ""; 

                 

                //***Create Business Service Record if it does not already exist*** 

                var gr_bs = new GlideRecord('cmdb_ci_service'); 

                gr_bs.addQuery('name', 'O365 - ' + json_responseBody.value[s].WorkloadDisplayName); 

                gr_bs.query(); 

                if(gr_bs.next()){ 

                    str_bs_sys_id = gr_bs.sys_id + ""; 

                } else if (json_responseBody.value[s].IncidentIds.length > 0){ 

                    //Doesnt exist, create it 

                    var gr_new_bs = new GlideRecord('cmdb_ci_service'); 

                    gr_new_bs.initialize(); 

                    gr_new_bs.setValue('name', 'O365 - ' + json_responseBody.value[s].WorkloadDisplayName); 

                    gr_new_bs.setValue('used_for', 'Production'); 

                    str_bs_sys_id = gr_new_bs.insert(); 

                } 

                 

                 

                //***Create Outages for open incidents*** 

                var arr_openOutages = []; 

                for (i = 0; i < json_responseBody.value[s].IncidentIds.length; i++) { 

                    arr_openOutages.push(json_responseBody.value[s].IncidentIds[i]); 

                    var gr_existing_outage = new GlideRecord('cmdb_ci_outage'); 

                    gr_existing_outage.addQuery('u_number',json_responseBody.value[s].IncidentIds[i]); 

                    gr_existing_outage.query(); 

                    if(gr_existing_outage.next()){ 

                        //Set Outage Status for existing Outage Record 

                        switch(json_responseBody.value[s].Status){ 

                            case 'ServiceDegradation': 

                                gr_existing_outage.setValue('type', 'degradation'); 

                                break; 

                            case 'ServiceInterruption': 

                                gr_existing_outage.setValue('type', 'outage'); 

                                break; 

                        } 

                        gr_existing_outage.update(); 

                         

                         

                    } else { 

                        var gr_new_outage = new GlideRecord('cmdb_ci_outage'); 

                        gr_new_outage.initialize(); 

                        gr_new_outage.setValue('u_number', json_responseBody.value[s].IncidentIds[i]); 

                        gr_new_outage.setValue('cmdb_ci', str_bs_sys_id); 

                        gr_new_outage.begin = date_now; 

                         

                        //Set Outage Status for existing Outage Record 

                        switch(json_responseBody.value[s].Status){ 

                            case 'Investigating': 

                                gr_new_outage.setValue('type', 'degradation'); 

                                break; 

                            case 'ServiceDegradation': 

                                gr_new_outage.setValue('type', 'degradation'); 

                                break; 

                            case 'ServiceInterruption': 

                                gr_new_outage.setValue('type', 'outage'); 

                                break; 

                            case 'RestoringService': 

                                gr_new_outage.setValue('type', 'degradation'); 

                                break; 

                            case 'ExtendedRecovery': 

                                gr_new_outage.setValue('type', 'degradation'); 

                                break; 

                            case 'VerifyingService': 

                                gr_new_outage.setValue('type', 'degradation'); 

                                break; 

                        } 

                        gr_new_outage.insert(); 

                    } 

                } 

                     

                     

                //***End Outages for resolved incidents*** 

                //gs.log("Closing incidents for :" + json_responseBody.value[s].WorkloadDisplayName +", cisysid:" + str_bs_sys_id +  "Status:" + json_responseBody.value[s].Status + ", open outages:" + arr_openOutages.join(',')); 

                if(str_bs_sys_id.length > 0){ 

                    var arr_closedcodes = ['ServiceRestored', 'PostIncidentReportPublished', 'ServiceOperational', 'FalsePositive']; 

                    var arrUtil = new ArrayUtil(); 

                    var gr_active_outage = new GlideRecord('cmdb_ci_outage'); 

                    gr_active_outage.addQuery('cmdb_ci', str_bs_sys_id); 

                    gr_active_outage.addNullQuery('end'); 

                    gr_active_outage.query(); 

                    while(gr_active_outage.next()){ 

                        if((arrUtil.indexOf(arr_closedcodes, json_responseBody.value[s].Status) >= 0)||(arrUtil.indexOf(arr_openOutages, gr_active_outage.u_number) < 0)){ 

                            //Service is fully operational. 

                            //Close out all active outages 

                            gr_active_outage.end = date_now; 

                            gr_active_outage.update(); 

                        } else { 

                            

                        } 

                    } 

                } 

            } 

        }         

    }, 

    refreshO365OutageMessages: function(token){ 

        //***Pull Down Outage Messages*** 

        var parser = new JSONParser(); 

        var json_responseBody = "failed to load"; 

        try {  

            var r = new sn_ws.RESTMessageV2('Microsoft Azure', 'Get All Messages'); 

            r.setStringParameterNoEscape('TenantID', gs.getProperty('AzureAccessToken.TenantID')); 

            r.setStringParameterNoEscape('Token', token); 

            var response = r.execute(); 

            var httpStatus = response.getStatusCode(); 

            if(httpStatus == '200'){ 

                //Success 

                var str_responseBody = response.getBody(); 

                json_responseBody = parser.parse(str_responseBody); 

            } else { 

                gs.log("Error requesting O365 Service Messages.  httpStatus:" + httpStatus); 

            } 

        } catch(ex) { 

            var message = ex.message; 

            gs.log("Error requesting O365 Service Messages.  Error Message:" + message); 

        } 

        if(json_responseBody != "failed to load"){ 

            for (i = 0; i < json_responseBody.value.length; i++) { 

                if(json_responseBody.value[i].Messages.length > 0){ 

                    this.updateOutage(json_responseBody.value[i].Id, json_responseBody.value[i].Messages[json_responseBody.value[i].Messages.length-1].MessageText + "<BR><BR><u>Last Updated: " + json_responseBody.value[i].Messages[json_responseBody.value[i].Messages.length-1].PublishedTime + "</u>"); 

                } else { 

                    this.updateOutage(json_responseBody.value[i].Id, json_responseBody.value[i].ImpactDescription); 

                } 

            } 

        } 

    }, 

    updateOutage: function(str_number, str_details){ 

        var gr_outage = new GlideRecord('cmdb_ci_outage'); 

        gr_outage.addQuery('u_number', str_number); 

        gr_outage.query(); 

        if(gr_outage.next()){ 

            gr_outage.setValue('details', str_details); 

            gr_outage.update(); 

        } 

    }, 

    getAzureAPIAccessToken: function(){ 

        var token = ""; 

        try {  

            var r = new sn_ws.RESTMessageV2('Microsoft Azure', 'Get Access Token'); 

            r.setStringParameterNoEscape('ClientSecret', gs.getProperty('AzureAccessToken.ClientSecret')); 

            r.setStringParameterNoEscape('ClientID', gs.getProperty('AzureAccessToken.ClientID')); 

            r.setStringParameterNoEscape('TenantID', gs.getProperty('AzureAccessToken.TenantID')); 

            var response = r.execute(); 

            var httpStatus = response.getStatusCode(); 

            if(httpStatus == '200'){ 

                //Success 

                var str_responseBody = response.getBody(); 

                var parser = new JSONParser(); 

                var json_responseBody = parser.parse(str_responseBody); 

                token = json_responseBody.access_token; 

            } else { 

                gs.log("Error requesting Azure API Token.  httpStatus:" + httpStatus); 

            } 

        } catch(ex) { 

            var message = ex.message; 

            gs.log("Error requesting Azure API Token.  Error Message:" + message); 

        } 

             

        return token; 

    },     

    type: ‘O365OutageSync’ 

};

Summary from Microsoft BASIC 6502 Original Source Code from 1978 written by Bill Gates and Paul Allen

Save snippets that work from anywhere online with our extensions

Comments

More like this

Browse more snippets >>

Embed code snippet