text
stringlengths 1
22.8M
|
|---|
```javascript
import PropTypes from 'prop-types';
import { c } from 'ttag';
import FormModal from './FormModal';
/**
* @deprecated Please use ModalTwo instead
*/
const PreviewPDFModal = ({ url, title = c('Title').t`Preview`, filename, ...rest }) => {
return (
<FormModal title={title} close={c('Action').t`Close`} hasSubmit={false} {...rest}>
<object data={url} className="w-full" type="application/pdf" height={500} title={filename}>
<embed src={url} type="application/pdf" />
</object>
</FormModal>
);
};
PreviewPDFModal.propTypes = {
onClose: PropTypes.func,
url: PropTypes.string,
title: PropTypes.string,
filename: PropTypes.string,
};
export default PreviewPDFModal;
```
|
```yaml
base_url: /test
ice_servers:
- urls:
- 'stun:stun.l.google.com:19302'
auth_type: secret
auth_secret:
username: test_user
secret: test_secret
tls:
cert: test.pem
key: test.key
store:
type: redis
redis:
host: localhost
port: 6379
prefix: peercalls
network:
type: 'sfu'
sfu:
udp:
port_min: 9000
port_max: 9010
```
|
Georgi-Rene Maksimovski (born 22 July 1966) is the former and initial First Gentleman of Estonia, married to Estonian President Kersti Kaljulaid since 2011.
Born into a Seto family, he is the son of Nektari and Valve Maksimovski. He also has one sibling. From 1984–1991, he studied at Tallinn University of Technology. Beginning in 1993, Maksimovski worked at the State Infocommunication Foundation where he was employed for 16 years until 2009.
In 2004, Maksimovski began to date Kaljulaid and the couple had their first son in 2005, having their second just four years later. They were officially married in 2011. Outside the Presidential Palace, Maksimovski owns an apartment in Lasnamäe. Little is known about his daily life, which leads some in the Estonian media to speculate that he is part of the domestic intelligence service.
Honours
Foreign honours
: Grand Decoration of Honour in Gold with Sash of the Decoration of Honour for Services to the Republic of Austria (26 May 2021)
: Grand Cross of the Order of the White Rose of Finland (7 March 2017)
: Knight Grand Cross of the Order of Merit of the Italian Republic (5 June 2018)
: Commander Grand Cross of the Order of the Three Stars (10 April 2019)
: Grand Cross of the Order of the Crown (12 June 2018)
: Grand Cross of the Order of Merit (16 April 2019)
References
1966 births
Living people
Seto people
Spouses of presidents of Estonia
Tallinn University of Technology alumni
|
This is a timeline of significant events in comics in the 1900s.
1900
January 7: Carl E. Schultze's Foxy Grandpa makes its debut. It will run until 1939.
March 11: Frederick Burr Opper's Happy Hooligan makes its debut in the Hearst newspaper Sunday pages.
May 27: Frank Crane's Willie Westinghouse Edison Smith, the Boy Inventor makes its debut.
November 4: Gus Dirks' Latest News from Bugville makes its debut. It will run until 9 March 1902.
December: Richard F. Outcault's Poor Li'l Mose is the first comic strip to star a black character. The series will run until August 1902.
Johannes Franciscus Nuijens (Korporaal Achilles), a Dutch Catholic teacher, publishes the political comic book Aanleiding tot den Engelsch-Transvaalschen Oorlog (Reason for the English-Transvaal War).
Arpad Schmidhammer draws the text comic Totentanz der Politik, a satire on war politics, with the Grim Reaper as its star.
1901
February 11: The regular weather cartoon feature Weatherbird makes its debut in the St. Louis Post-Dispatch. The first artist to draw it is Harry B. Martin.
May 25: The final issue of the British comics magazine Funny Wonder is published.
September 22: Frederick Burr Opper's Alphonse and Gaston makes its debut. It will run until 1937.
October 2: Gene Carr's Lady Bountiful makes its debut. It is the first balloon comic starring a female protagonist.
October 5: The first issue of the Dutch illustrated satirical weekly De Ware Jacob is published. It will run until April 1916.
November 11: William Wallace Denslow's Billy Bounce makes its debut and will run until 1906.
December 1: Frank Crane's Muggsy makes its debut.
Norman E. Jennett's The Monkey Shines of Marseleen is first published.
James Francis Sullivan's long-running comic strip The British Working Man is discontinued.
1902
March 9: The final episode of Gus Dirks' Latest News from Bugville is published. The artist will commit suicide three months later.
April 6: Ed Carey's Simple Simon makes its debut. It will run until 10 January 1909.
April 27: Ed Payne's Professor O. Howe Wise and Professor I.B. Schmart debuts, which will continue until 1911.
May 4: Richard F. Outcault's Buster Brown makes its debut.
June 2: In Cleveland, Ohio the Newspaper Enterprise Association is founded, which will become the oldest and longest-running comic strip syndicate in the world.
August: The final episode of Richard F. Outcault's Poor Li'l Mose is published.
September: Wilhelm Heinrich Detlev Körner's Hugo Hercules makes its debut. It will run until January 1903, but goes down in history as the first prototypical superhero comic.
December 20: Raoul Barré publishes Pour un Dîner de Noël, the first Quebecois comic strip.
Oskar Andersson's Mannen Som Gör Vad Som Faller Honom In (The Man Who Does Whatever Comes To His Mind) makes its debut. It will run until 1906.
F. M. Howarth's Lulu and Leander makes its debut. It will run until 1908.
Julius Stafford Baker's Casey Court makes its debut in Illustrated Chips. It will run continued by other artists until 1953.
Kitazawa Rakuten creates Tagosaku to Mokubē no Tōkyō-Kenbutsu (田吾作と杢兵衛の東京見物,, "Tagosaku and Mokube's Sightseeing in Tokyo") and Haikara Kidorō no Sippai (灰殻木戸郎の失敗,, "The Failures of Kidoro Haikara" for the magazine Jiji Manga.
Oliver E. Veal creates Aunt Tozer.
1903
January
January: The final episode of Wilhelm Heinrich Detlev Körner's Hugo Hercules is published.
February
February 1: Ed Carey's Professor Hypnotiser makes its debut and will run until 23 July 1905.
March
March 22: Grace Drayton's comic strip character Toodles (later known as Dolly Dimples) makes her debut. She will appear in various incarnations until 1933.
April
April 5: Joseph A. Lemon's Willy Cute makes its debut. It will run until 1906.
May
May 3: Red Shellcope's Jimmie the Messenger Boy makes its debut.
October
October 4: Gustave Verbeek's The Upside Downs of Little Lady Lovekins and Old Man Muffaroo makes its debut. It will run until 15 January 1905.
November
November 1: Jimmy Swinnerton's Mr. Jack receives its own Sunday page, after making his debut as a character in 1898.
December
December 6: J.B. Lowitz' Swifty and his Wonderful Dream makes its debut.
December: Clare Briggs's A. Piker Clerk makes his debut. The series wil run until June 1904.
Paul Bransom's The Latest News From Bugville makes its debut. It will run until 1912.
F. M. Howarth's Mr. E.Z. Mark makes its debut. It will run until 1908.
James Montgomery Flagg creates Nervy Nat, which will run until 1907.
C. M. Payne's Coon Hollow Folks debuts and will run until 1908.
Specific date unknown
Karóly Mühlbeck starts his long-running series Mühlbeck headlines. in the weekly Új Idők.
1904
January
January 2: George Herriman's Major Ozone's Fresh Air Crusade makes its debut, syndicated by World Color Printing Co.
January 3: The first issue of the Spanish illustrated children's magazine En Patufet is published. It will run until December 1938. Between 6 December 1968 and 29 June 1973 it will be revived.
January 11: George Frink's Circus Solly makes its debut. It will run until 4 December 1911.
January 30: Albéric Bourgeois's Les Aventures de Timothée makes its debut. The first serialized Canadian comic strip in the French language.
February
February 14: Little Jimmy by Jimmy Swinnerton's Little Jimmy makes his debut in the New York Journal.
March
March 5: Joseph Charlebois adapts Hector Berthelot's literary character Père Ladébauche into a comic strip for La Presse.
April
April 16: Julius Stafford Baker creates the comic strip Mrs. Hippo's Kindergarten for The Daily Mirror, which features Tiger Tim who will become a popular spin-off comic in The Monthly Playbox from November 1904 on.
April 20: George McManus's The Newlyweds makes its debut. It will run under various titles until 1956.
April 22: Gus Mager starts his ... the Monk comics series, which will run until 1913.
April 23: René-Charles Béliveau's La Famille Citrouillard makes its debut in La Patrie. The comic will continue until February 1905, after which he leaves it to T. Bisson.
June
June: The final episode of Clare Briggs's A. Piker Clerk is published.
July
July 24: Winsor McCay's Little Sammy Sneeze makes its debut in the New York Herald.
July 24: Frederick Burr Opper's And Her Name Was Maud makes its debut. It will run until 14 October 1932.
August
August 28: Walt McDougall's Queer Visitors from the Marvelous Land of Oz makes its debut, with L. Frank Baum as scriptwriter. It will run until 26 February 1905.
September
September 10: Winsor McCay's Dreams of the Rarebit Fiend makes its debut under the pseudonym Silas, in Evening Telegram.
October
October 9: C. M. Payne's Bear Creek Folks debuts, which will run until 1912.
December
December 17: Kin Hubbard's Abe Martin of Brown County makes its debut. It will run until 1930.
December 31: The final issue of the French satirical comics and cartoons magazine La Caricature is published.
The Dutch illustrator Jan Feith draws a silhouette comic telling the history of the Netherlands, for the satirical weekly De Ware Jacob.
1905
January
January 8: Winsor McCay's The Story of Hungry Henrietta makes its debut.
January 15: The final episode of Gustave Verbeek's The Upside Downs of Little Lady Lovekins and Old Man Muffaroo is published.
February
February 2: The first issue of the French girls' comics magazine La Semaine de Suzette is published. It will run until 25 August 1960. In its first issue Joseph Pinchon's text comic Bécassine makes its debut.
February 26: The final episode of L. Frank Baum and Walt McDougall's Queer Visitors from the Marvelous Land of Oz is published.
May
May 28: Gustave Verbeek's The Terror of the Tiny Tads makes its debut. It will run until 28 October 1914.
June
June 26: Winsor McCay's A Pilgrim’s Progress makes its debut.
July
July 22: A.D. Condo's The Outbursts of Everett True makes its debut. It will run until 1927.
July 23: The final episode of Ed Carey's Professor Hypnotiser is published.
August
August 13: The first episode of Gene Carr's The Bad Dream That Made Bill A Better Boy is published. But he passes it on to William Steinigans, who will continue the series until 1911.
October
October 11: The first issue of the Brazilian comics magazine O Tico-Tico is published. It will run until 1977.
October 15: Winsor McCay's Little Nemo in Slumberland makes its debut in the New York Herald. It will run until 26 December 1926
November
November 26: C. M. Payne launches Scary William, a comic strip continued by many different artists until 2 June 1918.
Specific date unknown
The first issue of the Chinese manhua magazine Journal of Current Pictorial is published and will run until 1913.
1906
January 14: After Richard F. Outcault has been bought away to another newspaper his comics series Buster Brown is continued in the old publication by Worden Wood.
April 19: The first episode of Lyonel Feininger's Wee Willie Winkie's World is published. It will run until 17 February 1907.
April 29: The first episode of Lyonel Feininger's The Kin-der-Kids is published. It will run until 18 November.
June 17: The final episode of Joseph A. Lemon's Willy Cute is published.
August 26: Frank Crane's Val the Ventriloquist makes its debut.
September 14: The first issue of the French satirical illustrated magazine La Calotte is published.
October 21: C.W. Kahles's Hairbreadth Harry makes its debut. It will run until 1940.
The Bulgarian cartoonist Slavov creates a comic strip named Gordelivata Maca (The Proud Pussycat), based on the eponymous poem.
1907
January 5: The first issue of the Dutch satirical magazine De Notenkraker is published.
February 17: The final episode of Lyonel Feininger's Wee Willie Winkie's World is published.
May 13: Richard Thain's comic series Lord Longbow appears in print for the first time. It will run until 1915.
September 29: Rube Goldberg's Mike and Ike (They Look Alike) makes its debut.
October: A.D. Condo's Mr. Skygack, from Mars makes its debut. It will run until 1917.
November 15: Bud Fisher's Mutt and Jeff makes its debut. It will run until 26 June 1983.
November 26: Nell Brinkley makes her debut as a cartoonist. She will become well known for her Brinkley Girl illustrations.
Leon Searl's Mrs. Timekiller makes its debut. It will run until 1915.
Joseph Jacinto Mora creates Animaldom.
Kate J. Fricero draws Les Distractions de Mll Nini in La Semaine de Suzette.
1908
May 3 to August 9: Harry Grant Dart's newspaper comic strip The Explorigator is first published.
June 4: Louis Forton's Les Pieds Nickelés makes its debut.
August 12: The first episode of William Steinigans's Pups is published. It will run until 1911.
August 23: Grif's It's Only Ethelinda makes its debut.
August 30: The final episode of Frank Crane's Val the Ventriloquist is published.
December 27: The first issue of the Italian comics magazine Corriere dei Piccoli is published. In its first issue Attilio Mussino's Bilbolbul makes its debut. The series will run until 1933. The magazine itself will run until 15 August 1995.
Harold R. Heaton joins the Inter-Ocean newspaper as an editorial cartoonist.
Fontaine Fox's Toonerville Folks is published.
Bertie Brown publishes Homeless Hector in Illustrated Chips, where it will run until the magazine's final issue in 1953.
Henri Avelot creates Philibert.
In France, the comic strip Sam et Sap by Émile Tap, is the first known French comic to use speech balloons.
1909
January 10: The final episode of Ed Carey's Simple Simon is published.
February: Walt Kuhn's comic Whisk makes its debut and will run until October 1910.
October 21: André Vallet and Jo Valle's L'Espiègle Lili makes its debut. It will run until 1998.
November 1: John Hager's The Umbrella Man makes its debut in the Seattle Daily Times, appearing on the front page as a supplement for the weather. Not titled as the Umbrella Man, but called that May 3, 1913, under a section called "Features of Today's Paper".
November 27: C. M. Payne's Mr. Hush (later retitled Honeybunch's Hubby) debuts. It will continue until 1911 but be briefly revived between 1931 and 1934.
December 23: The first episode of George Herriman's Gooseberry Sprig is published. Although it barely lasts a few weeks, it does introduce the characters Gooseberry Sprig, Joe Stork and the setting Coconino County, which will later reappear in his more famous comic Krazy Kat.
December: Rose O'Neill's Kewpies comic strip is first published in Ladies' Home Journal. The characters will become very popular as toy articles in the following decades.
Daan Hoeksema publishes De Neef van Prikkebeen, a follow-up to Rodolphe Töpffer's De Neef van Prikkebeen.
Births
1900
1901
December
December 5: Walt Disney, American animator, film producer, voice actor and businessman (Mr. George's Wife, Walt Disney's Comics & Stories), (d. 1966).
1902
1903
1904
October
October 21: Edmond Hamilton, American science fiction and comic writer (Space Ranger, DC Comics), (d. 1977).
1905
February
February 8: Cyril Gwyn Price, Welsh comics artist (PC Penny, Martha, Tricky Dicky), (d. 1970).
December
December 18: Ferd Johnson, American comics artist (Texas Slim, Lovey-Dovey, continued Moon Mullins), (d. 1996).
1906
August
August 21: Friz Freleng, American animator and cartoonist (Looney Tunes, Tweety and Sylvester, Yosemite Sam, The Pink Panther), (d. 1995).
1907
March
March 31: Ye Qianyu, Chinese comics artist (Mr. Wang), (d. 1995).
1908
1909
June
June 18: Dave Gerard, American comics artist (Citizen Smith, Will-Yum), (d. 2003).
October
October 13: Herbert Block, American political cartoonist, (d. 2001).
October 26: Dante Quinterno, Argentine cartoonist and comics artist, (Patoruzú, Isidoro Cañones), (d. 2003).
Deaths
1901
May 27: Fritz von Dardel, Swiss comics artist (Ett Frieri, Herrar Black & Smith på väg till Skandinavien, Familjen Tutings Lustresa till Bomarsund), dies at age 84.
June 15: José Luis Pellicer, Spanish painter, illustrator and comics artist, dies at age 59.
1902
June 10: Gus Dirks, American comics artist (Latest News From Bugville, assistant on The Katzenjammer Kids), commits suicide at age 23.
August 7: Eugène Cottin, French painter, illustrator, engraver and comics artist, passes away at age 60.
December 7: Thomas Nast, American cartoonist, caricaturist, illustrator and comics artist, dies at age 62 of yellow fever.
1904
March 8: Celso Hermínio, Portuguese caricaturist, illustrator and comics artist, dies at age 33 from pneumonia.
December 1: A.L. Jansson, American comics artist (made text comics based on characters from playing cards), dies at age 48.
1905
January 23: Rafael Bordalo Pinheiro, Portuguese illustrator, caricaturist and comics artist (Zé Povinho), dies at age 58.
September 28: Thomas Frank Beard, American illustrator and comics artist, dies at age 63.
1906
April 19: Jan Linse, Dutch painter, caricaturist and comics artist (made comics for the satirical magazines Humoristisch Album and Abraham's Prikkie's Op- en Aanmerkingen), dies at age 62.
June 26: Victor Géruzez, aka Crafty, French illustrator and comics artist, dies at age 66.
November 28: Oskar Andersson, aka O.A., Swedish comics artist (Mannen Som Gör Vad Som Faller Honom In (The Man Who Does Whatever Comes To His Mind), Urhunden), commits suicide at the age of 29.
1907
August 25: Josef Benedikt Engl, German caricaturist, lithographer and illustrator (made occasional text comics), dies at age 40.
1908
January 9: Wilhelm Busch, German illustrator, poet, painter, graphic artist and comics artist (Max und Moritz), dies at age 75.
January 19: Georgi Danchov, Bulgarian illustrator, caricaturist, painter and comics artist (The Six Feelings), passes away at age 61.
September 4: Théophile Hyacinthe Busnel, French illustrator and comics artist (Farces du Petit Cousin Charlot, continued Les Aventures de Timothée), dies from TBC at age 25 or 26.
September 17: Henri Julien, Canadian painter, caricaturist, illustrator and comics artist, passes away at age 56.
September 22: F. M. Howarth, American comics artist (The Love of Lulu and Leander, Mr. E.Z. Mark, Ole Opey Dildock), dies at age 43 of pneumonia.
1909
February 25: Caran d'Ache, French caricaturist, cartoonist and comics artist, dies at age 50.
May 11: Ferdinand von Řezníček, Austrian painter, illustrator and caricaturist (made some pantomime comics), dies at age 40.
September 20: Achille Lemot, aka Uzès and Lilio, French illustrator (made occasional text comics), dies at age 62.
References
1900s decade overviews
|
```xml
<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE language SYSTEM "language.dtd">
<language
name="NSIS" version="4" kateversion="5.0" section="Scripts" casesensitive="0" extensions="*.nsi" mimetype="text/x-nsis"
author="Kevin Funk (kfunk@kde.org)" license="LGPLv2+"
>
<highlighting>
<list name="keywords">
<item>packhdr</item>
<item>finalize</item>
<item>system</item>
<item>execute</item>
<item>makensis</item>
<item>AddIncludeDir</item>
<item>include</item>
<item>cd</item>
<item>if</item>
<item>ifdef</item>
<item>ifndef</item>
<item>endif</item>
<item>define</item>
<item>undef</item>
<item>else</item>
<item>echo</item>
<item>warning</item>
<item>error</item>
<item>verbose</item>
<item>macro</item>
<item>macroend</item>
<item>macroundef</item>
<item>insertmacro</item>
<item>ifmacrodef</item>
<item>ifmacrondef</item>
<item>tempfile</item>
<item>delfile</item>
<item>appendfile</item>
<item>getdllversion</item>
<item>searchparse</item>
<item>searchreplace</item>
<item>AddPluginDir</item>
</list>
<list name="options">
<item>nonfatal</item>
<item>MB_ICONQUESTION</item>
<item>MB_YESNO</item>
<item>MB_DEFBUTTON2</item>
<item>MB_ICONINFORMATION</item>
<item>MB_OK</item>
</list>
<list name="macros">
<!-- NSIS Modern User Interface (path_to_url -->
<item>MUI_SYSVERSION</item>
<item>MUI_ICON</item>
<item>MUI_UNICON</item>
<item>MUI_HEADERIMAGE</item>
<item>MUI_HEADERIMAGE_BITMAP</item>
<item>MUI_HEADERIMAGE_BITMAP_NOSTRETCH</item>
<item>MUI_HEADERIMAGE_BITMAP_RTL</item>
<item>MUI_HEADERIMAGE_BITMAP_RTL_NOSTRETCH</item>
<item>MUI_HEADERIMAGE_UNBITMAP</item>
<item>MUI_HEADERIMAGE_UNBITMAP_NOSTRETCH</item>
<item>MUI_HEADERIMAGE_UNBITMAP_RTL</item>
<item>MUI_HEADERIMAGE_UNBITMAP_RTL_NOSTRETCH</item>
<item>MUI_HEADERIMAGE_RIGHT</item>
<item>MUI_BGCOLOR</item>
<item>MUI_UI</item>
<item>MUI_UI_HEADERIMAGE</item>
<item>MUI_UI_HEADERIMAGE_RIGHT</item>
<item>MUI_UI_COMPONENTSPAGE_SMALLDESC</item>
<item>MUI_UI_COMPONENTSPAGE_NODESC</item>
<item>MUI_WELCOMEFINISHPAGE_BITMAP</item>
<item>MUI_WELCOMEFINISHPAGE_BITMAP_NOSTRETCH</item>
<item>MUI_WELCOMEFINISHPAGE_INI</item>
<item>MUI_UNWELCOMEFINISHPAGE_BITMAP</item>
<item>MUI_UNWELCOMEFINISHPAGE_BITMAP_NOSTRETCH</item>
<item>MUI_UNWELCOMEFINISHPAGE_INI</item>
<item>MUI_LICENSEPAGE_BGCOLOR</item>
<item>MUI_COMPONENTSPAGE_CHECKBITMAP</item>
<item>MUI_COMPONENTSPAGE_SMALLDESC</item>
<item>MUI_COMPONENTSPAGE_NODESC</item>
<item>MUI_INSTFILESPAGE_COLORS</item>
<item>MUI_INSTFILESPAGE_PROGRESSBAR</item>
<item>MUI_FINISHPAGE_NOAUTOCLOSE</item>
<item>MUI_UNFINISHPAGE_NOAUTOCLOSE</item>
<item>MUI_ABORTWARNING</item>
<item>MUI_ABORTWARNING_TEXT</item>
<item>MUI_UNABORTWARNING</item>
<item>MUI_UNABORTWARNING_TEXT</item>
<item>MUI_PAGE_WELCOME</item>
<item>MUI_PAGE_LICENSE</item>
<item>MUI_PAGE_COMPONENTS</item>
<item>MUI_PAGE_DIRECTORY</item>
<item>MUI_PAGE_STARTMENU</item>
<item>MUI_PAGE_INSTFILES</item>
<item>MUI_PAGE_FINISH</item>
<item>MUI_UNPAGE_WELCOME</item>
<item>MUI_UNPAGE_CONFIRM</item>
<item>MUI_UNPAGE_LICENSE</item>
<item>MUI_UNPAGE_COMPONENTS</item>
<item>MUI_UNPAGE_DIRECTORY</item>
<item>MUI_UNPAGE_INSTFILES</item>
<item>MUI_UNPAGE_FINISH</item>
<item>MUI_PAGE_HEADER_TEXT</item>
<item>MUI_PAGE_HEADER_SUBTEXT</item>
<item>MUI_WELCOMEPAGE_TITLE</item>
<item>MUI_WELCOMEPAGE_TITLE_3LINES</item>
<item>MUI_WELCOMEPAGE_TEXT</item>
<item>MUI_LICENSEPAGE_TEXT_TOP</item>
<item>MUI_LICENSEPAGE_TEXT_BOTTOM</item>
<item>MUI_LICENSEPAGE_BUTTON</item>
<item>MUI_LICENSEPAGE_CHECKBOX</item>
<item>MUI_LICENSEPAGE_CHECKBOX_TEXT</item>
<item>MUI_LICENSEPAGE_RADIOBUTTONS</item>
<item>MUI_LICENSEPAGE_RADIOBUTTONS_TEXT_ACCEPT</item>
<item>MUI_LICENSEPAGE_RADIOBUTTONS_TEXT_DECLINE</item>
<item>MUI_COMPONENTSPAGE_TEXT_TOP</item>
<item>MUI_COMPONENTSPAGE_TEXT_COMPLIST</item>
<item>MUI_COMPONENTSPAGE_TEXT_INSTTYPE</item>
<item>MUI_COMPONENTSPAGE_TEXT_DESCRIPTION_TITLE</item>
<item>MUI_COMPONENTSPAGE_TEXT_DESCRIPTION_INFO</item>
<item>MUI_DIRECTORYPAGE_TEXT_TOP</item>
<item>MUI_DIRECTORYPAGE_TEXT_DESTINATION</item>
<item>MUI_DIRECTORYPAGE_VARIABLE</item>
<item>MUI_DIRECTORYPAGE_VERIFYONLEAVE</item>
<item>MUI_STARTMENU_WRITE_BEGIN</item>
<item>MUI_STARTMENU_WRITE_END</item>
<item>MUI_STARTMENUPAGE_TEXT_TOP</item>
<item>MUI_STARTMENUPAGE_TEXT_CHECKBOX</item>
<item>MUI_STARTMENUPAGE_DEFAULTFOLDER</item>
<item>MUI_STARTMENUPAGE_NODISABLE</item>
<item>MUI_STARTMENUPAGE_REGISTRY_ROOT</item>
<item>MUI_STARTMENUPAGE_REGISTRY_KEY</item>
<item>MUI_STARTMENUPAGE_REGISTRY_VALUENAME</item>
<item>MUI_INSTFILESPAGE_FINISHHEADER_TEXT</item>
<item>MUI_INSTFILESPAGE_FINISHHEADER_SUBTEXT</item>
<item>MUI_INSTFILESPAGE_ABORTHEADER_TEXT</item>
<item>MUI_INSTFILESPAGE_ABORTHEADER_SUBTEXT</item>
<item>MUI_FINISHPAGE_TITLE</item>
<item>MUI_FINISHPAGE_TITLE_3LINES</item>
<item>MUI_FINISHPAGE_TEXT</item>
<item>MUI_FINISHPAGE_TEXT_LARGE</item>
<item>MUI_FINISHPAGE_BUTTON</item>
<item>MUI_FINISHPAGE_TEXT_REBOOT</item>
<item>MUI_FINISHPAGE_TEXT_REBOOTNOW</item>
<item>MUI_FINISHPAGE_TEXT_REBOOTLATER</item>
<item>MUI_FINISHPAGE_RUN</item>
<item>MUI_FINISHPAGE_RUN_TEXT</item>
<item>MUI_FINISHPAGE_RUN_PARAMETERS</item>
<item>MUI_FINISHPAGE_RUN_NOTCHECKED</item>
<item>MUI_FINISHPAGE_RUN_FUNCTION</item>
<item>MUI_FINISHPAGE_SHOWREADME</item>
<item>MUI_FINISHPAGE_SHOWREADME_TEXT</item>
<item>MUI_FINISHPAGE_SHOWREADME_NOTCHECKED</item>
<item>MUI_FINISHPAGE_SHOWREADME_FUNCTION</item>
<item>MUI_FINISHPAGE_LINK</item>
<item>MUI_FINISHPAGE_LINK_LOCATION</item>
<item>MUI_FINISHPAGE_LINK_COLOR</item>
<item>MUI_FINISHPAGE_NOREBOOTSUPPORT</item>
<item>MUI_UNCONFIRMPAGE_TEXT_TOP</item>
<item>MUI_UNCONFIRMPAGE_TEXT_LOCATION</item>
<item>MUI_LANGUAGE</item>
<item>MUI_LANGDLL_DISPLAY</item>
<item>MUI_LANGDLL_REGISTRY_ROOT</item>
<item>MUI_LANGDLL_REGISTRY_KEY</item>
<item>MUI_LANGDLL_REGISTRY_VALUENAME</item>
<item>MUI_LANGDLL_WINDOWTITLE</item>
<item>MUI_LANGDLL_INFO</item>
<item>MUI_LANGDLL_ALWAYSSHOW</item>
<item>MUI_RESERVEFILE_INSTALLOPTIONS</item>
<item>MUI_RESERVEFILE_LANGDLL</item>
<item>MUI_FUNCTION_DESCRIPTION_BEGIN</item>
<item>MUI_DESCRIPTION_TEXT</item>
<item>MUI_FUNCTION_DESCRIPTION_END</item>
<item>MUI_INSTALLOPTIONS_EXTRACT</item>
<item>MUI_INSTALLOPTIONS_EXTRACT_AS</item>
<item>MUI_HEADER_TEXT</item>
<item>MUI_INSTALLOPTIONS_DISPLAY</item>
<item>MUI_INSTALLOPTIONS_INITDIALOG</item>
<item>MUI_INSTALLOPTIONS_SHOW</item>
<item>MUI_INSTALLOPTIONS_DISPLAY_RETURN</item>
<item>MUI_INSTALLOPTIONS_SHOW_RETURN</item>
<item>MUI_INSTALLOPTIONS_READ</item>
<item>MUI_INSTALLOPTIONS_WRITE</item>
<item>MUI_CUSTOMFUNCTION_GUIINIT</item>
<item>MUI_CUSTOMFUNCTION_UNGUIINIT</item>
<item>MUI_CUSTOMFUNCTION_ABORT</item>
<item>MUI_CUSTOMFUNCTION_UNABORT</item>
<item>MUI_PAGE_CUSTOMFUNCTION_PRE</item>
<item>MUI_PAGE_CUSTOMFUNCTION_SHOW</item>
<item>MUI_PAGE_CUSTOMFUNCTION_LEAVE</item>
<item>MUI_WELCOMEFINISHPAGE_CUSTOMFUNCTION_INIT</item>
<!-- LogicLib (path_to_url -->
<item>IfCmd</item>
<item>If</item>
<item>Unless</item>
<item>IfNot</item>
<item>AndIf</item>
<item>AndUnless</item>
<item>AndIfNot</item>
<item>OrIf</item>
<item>OrUnless</item>
<item>OrIfNot</item>
<item>Else</item>
<item>ElseIf</item>
<item>ElseUnless</item>
<item>ElseIfNot</item>
<item>EndIf</item>
<item>EndUnless</item>
<item>IfThen</item>
<item>IfNotThen</item>
<item>ForEach</item>
<item>For</item>
<item>ExitFor</item>
<item>Next</item>
<item>While</item>
<item>ExitWhile</item>
<item>EndWhile</item>
<item>Do</item>
<item>DoWhile</item>
<item>DoUntil</item>
<item>ExitDo</item>
<item>Loop</item>
<item>LoopWhile</item>
<item>LoopUntil</item>
<item>Continue</item>
<item>Break</item>
<item>Select</item>
<item>CaseElse</item>
<item>Case_Else</item>
<item>Default</item>
<item>Case</item>
<item>Case2</item>
<item>Case3</item>
<item>Case4</item>
<item>Case5</item>
<item>EndSelect</item>
<item>Switch</item>
<item>EndSwitch</item>
</list>
<list name="basefunc">
<item>Abort</item>
<item>AddBrandingImage</item>
<item>AddSize</item>
<item>AutoCloseWindow</item>
<item>BGFont</item>
<item>BGGradient</item>
<item>BrandingText</item>
<item>BringToFront</item>
<item>Call</item>
<item>CallInstDLL</item>
<item>Caption</item>
<item>ChangeUI</item>
<item>ClearErrors</item>
<item>ComponentText</item>
<item>GetDLLVersion</item>
<item>GetDLLVersionLocal</item>
<item>GetFileTime</item>
<item>GetFileTimeLocal</item>
<item>CopyFiles</item>
<item>CRCCheck</item>
<item>CreateDirectory</item>
<item>CreateFont</item>
<item>CreateShortcut</item>
<item>SetDatablockOptimize</item>
<item>DeleteINISec</item>
<item>DeleteINIStr</item>
<item>DeleteRegKey</item>
<item>DeleteRegValue</item>
<item>Delete</item>
<item>DetailPrint</item>
<item>DirText</item>
<item>DirShow</item>
<item>DirVar</item>
<item>DirVerify</item>
<item>GetInstDirError</item>
<item>AllowRootDirInstall</item>
<item>CheckBitmap</item>
<item>EnableWindow</item>
<item>EnumRegKey</item>
<item>EnumRegValue</item>
<item>Exch</item>
<item>Exec</item>
<item>ExecWait</item>
<item>ExecShell</item>
<item>ExpandEnvStrings</item>
<item>FindWindow</item>
<item>FindClose</item>
<item>FindFirst</item>
<item>FindNext</item>
<item>File</item>
<item>FileBufSize</item>
<item>FlushINI</item>
<item>ReserveFile</item>
<item>FileClose</item>
<item>FileErrorText</item>
<item>FileOpen</item>
<item>FileRead</item>
<item>FileWrite</item>
<item>FileReadByte</item>
<item>FileWriteByte</item>
<item>FileReadUTF16LE</item>
<item>FileWriteUTF16LE</item>
<item>FileReadWord</item>
<item>FileWriteWord</item>
<item>FileSeek</item>
<item>Function</item>
<item>FunctionEnd</item>
<item>GetDlgItem</item>
<item>GetFullPathName</item>
<item>GetTempFileName</item>
<item>HideWindow</item>
<item>Icon</item>
<item>IfAbort</item>
<item>IfErrors</item>
<item>IfFileExists</item>
<item>IfRebootFlag</item>
<item>IfSilent</item>
<item>InstallDirRegKey</item>
<item>InstallColors</item>
<item>InstallDir</item>
<item>InstProgressFlags</item>
<item>InstType</item>
<item>IntOp</item>
<item>IntCmp</item>
<item>IntCmpU</item>
<item>IntFmt</item>
<item>IsWindow</item>
<item>Goto</item>
<item>LangString</item>
<item>LangStringUP</item>
<item>LoadLanguageFile</item>
<item>LogSet</item>
<item>LogText</item>
<item>MessageBox</item>
<item>Nop</item>
<item>Name</item>
<item>OutFile</item>
<item>Page</item>
<item>PageCallbacks</item>
<item>PageEx</item>
<item>PageExEnd</item>
<item>Pop</item>
<item>Push</item>
<item>Quit</item>
<item>ReadINIStr</item>
<item>ReadRegDWORD</item>
<item>ReadRegStr</item>
<item>ReadEnvStr</item>
<item>Reboot</item>
<item>RegDLL</item>
<item>Rename</item>
<item>Return</item>
<item>RMDir</item>
<item>Section</item>
<item>SectionEnd</item>
<item>SectionIn</item>
<item>SubSection</item>
<item>SectionGroup</item>
<item>SubSectionEnd</item>
<item>SectionGroupEnd</item>
<item>SearchPath</item>
<item>SectionSetFlags</item>
<item>SectionGetFlags</item>
<item>SectionSetInstTypes</item>
<item>SectionGetInstTypes</item>
<item>SectionGetText</item>
<item>SectionSetText</item>
<item>SectionGetSize</item>
<item>SectionSetSize</item>
<item>GetCurInstType</item>
<item>SetCurInstType</item>
<item>InstTypeSetText</item>
<item>InstTypeGetText</item>
<item>SendMessage</item>
<item>SetAutoClose</item>
<item>SetCtlColors</item>
<item>SetBrandingImage</item>
<item>SetCompress</item>
<item>SetCompressor</item>
<item>SetCompressorDictSize</item>
<item>SetCompressionLevel</item>
<item>SetDateSave</item>
<item>SetDetailsView</item>
<item>SetDetailsPrint</item>
<item>SetErrors</item>
<item>SetErrorLevel</item>
<item>GetErrorLevel</item>
<item>SetFileAttributes</item>
<item>SetFont</item>
<item>SetOutPath</item>
<item>SetOverwrite</item>
<item>SetPluginUnload</item>
<item>SetRebootFlag</item>
<item>SetRegView</item>
<item>SetShellVarContext</item>
<item>SetSilent</item>
<item>ShowInstDetails</item>
<item>ShowUninstDetails</item>
<item>ShowWindow</item>
<item>SilentInstall</item>
<item>SilentUnInstall</item>
<item>Sleep</item>
<item>StrCmp</item>
<item>StrCmpS</item>
<item>StrCpy</item>
<item>UnsafeStrCpy</item>
<item>StrLen</item>
<item>SubCaption</item>
<item>Unicode</item>
<item>UninstallExeName</item>
<item>UninstallCaption</item>
<item>UninstallIcon</item>
<item>UninstPage</item>
<item>UninstallText</item>
<item>UninstallSubCaption</item>
<item>UnRegDLL</item>
<item>WindowIcon</item>
<item>WriteINIStr</item>
<item>WriteRegBin</item>
<item>WriteRegDWORD</item>
<item>WriteRegStr</item>
<item>WriteRegExpandStr</item>
<item>WriteUninstaller</item>
<item>PEDllCharacteristics</item>
<item>PESubsysVer</item>
<item>XPStyle</item>
<item>RequestExecutionLevel</item>
<item>ManifestDPIAware</item>
<item>ManifestSupportedOS</item>
<item>MiscButtonText</item>
<item>DetailsButtonText</item>
<item>UninstallButtonText</item>
<item>InstallButtonText</item>
<item>SpaceTexts</item>
<item>CompletedText</item>
<item>GetFunctionAddress</item>
<item>GetLabelAddress</item>
<item>GetCurrentAddress</item>
<item>InitPluginsDir</item>
<item>AllowSkipFiles</item>
<item>Var</item>
<item>VIAddVersionKey</item>
<item>VIProductVersion</item>
<item>VIFileVersion</item>
<item>LockWindow</item>
</list>
<contexts>
<context attribute="Normal Text" lineEndContext="#stay" name="Normal">
<keyword attribute="Option" context="#stay" String="options"/>
<keyword attribute="Macro" context="#stay" String="macros"/>
<keyword attribute="Keyword" context="#stay" String="keywords"/>
<keyword attribute="BaseFunc" context="#stay" String="basefunc"/>
<HlCChar attribute="Char" context="#stay"/>
<DetectChar attribute="Comment" context="Comment" char=";"/>
<DetectChar attribute="String" context="String" char="""/>
<AnyChar attribute="Symbol" context="#stay" String="!%&()+,-<=>?[]^{|}~"/>
<!--<RegExpr attribute="Number" context="#stay" String="\d*\.?\d*e?\d+"/>-->
</context>
<context attribute="Comment" lineEndContext="#pop" name="Comment">
<RegExpr attribute="Alert" context="#stay" String="(FIXME|TODO)"/>
</context>
<context attribute="String" lineEndContext="#pop" name="String">
<DetectChar attribute="String" context="#pop" char="""/>
</context>
</contexts>
<itemDatas>
<itemData name="Normal Text" defStyleNum="dsNormal"/>
<itemData name="Option" defStyleNum="dsNormal" color="#9500FF" selColor="#FFFFFF" bold="1" italic="0"/>
<itemData name="Macro" defStyleNum="dsNormal" color="#9500FF" selColor="#FFFFFF" bold="1" italic="0"/>
<itemData name="Keyword" defStyleNum="dsKeyword"/>
<itemData name="Comment" defStyleNum="dsComment"/>
<itemData name="String" defStyleNum="dsString"/>
<itemData name="Char" defStyleNum="dsChar"/>
<!-- <itemData name="Number" defStyleNum="dsBaseN"/> -->
<itemData name="Symbol" defStyleNum="dsNormal"/>
<itemData name="BaseFunc" defStyleNum="dsNormal" color="#0095FF" selColor="#FFFFFF" bold="1" italic="0"/>
<itemData name="Alert" defStyleNum="dsAlert"/>
</itemDatas>
</highlighting>
<general>
<comments>
<comment name="singleLine" start=";"/>
</comments>
<keywords casesensitive="1" weakDeliminator="." additionalDeliminator="""/>
</general>
</language>
<!-- kate: space-indent on; indent-width 2; replace-tabs on; -->
```
|
Hong Yong Sohn is an American engineer, currently a Distinguished Professor in Metallurgical Engineering at the University of Utah.
Sohn received his B.S. degree from Seoul National University, South Korea, and his Ph.D. degree in chemical engineering in 1970 from the University of California at Berkeley. After working as a research engineer at Du Pont’s Engineering Technology Laboratory, he joined the Department of Metallurgical Engineering at the University of Utah in 1974.
Professor Sohn's work has been recognized through various awards, which include:
The 2014 Educator Award from The Minerals, Metals & Materials Society (TMS)
The 2012 Distinguished Scholarly and Creative Research Award from the University of Utah
The 2012 Billiton Gold Medal from the Institute of Materials, Minerals and Mining, U.K.
The TMS 2009 Fellow Award, "in recognition of outstanding contribution to the practice of metallurgical/materials science and technology" from TMS
The 2001 James Douglas Gold Medal Award ("for leadership and outstanding contributions in research and education of non-ferrous extractive metallurgy and for work related to the modeling of gas-solid reactors and the development of novel solvent extraction systems") from the American Institute of Mining, Metallurgical, and Petroleum Engineers (AIME)
The 1998 Fellow Award from the Korean Academy of Science and Technology
The 1993 TMS Champion H. Mathewson Gold Medal Award “for the most notable contribution to Metallurgical Science in the 3–year period”
The 1990 TMS Extractive Metallurgy Lecturer Award “in recognition as an outstanding scientific leader in the field of nonferrous extraction and processing metallurgy”
The TMS Extraction and Processing Science Award (1990, 1994, 1999 and 2007)
Fulbright Distinguished Lecturer (1983)
The Camille and Henry Dreyfus Foundation Teacher-Scholar Award (1977).
In 2006, TMS honored Dr. Sohn by holding the Sohn International Symposium on Advanced Processing of Metals and Materials.
Dr. Sohn has authored or co-authored 4 monographs, 25 book chapters, some 500 papers, co-edited 17 books, holds 5 patents, and has delivered some 240 invited lectures. He has served as a Director of TMS-AIME (The Minerals, Metals and Materials Society), organized many international symposia, and delivered numerous plenary and keynote lectures. He was a U.S. DOE Fossil Energy Lecturer from 1978–81, and is an advisor to LS-Nikko Co., South Korea, and to the Korean Institute of Geoscience and Mineral Resources (KIGAM). He serves on several editorial/advisory boards of international journals.
References
Year of birth missing (living people)
Living people
University of Utah faculty
University of California, Berkeley alumni
21st-century American engineers
Fellows of the Minerals, Metals & Materials Society
|
The INVEST mnemonic for Agile software development projects was created by Bill Wake as a reminder of the characteristics of a good quality Product Backlog Item (commonly written in user story format, but not required to be) or PBI for short.
Such PBIs may be used in a Scrum backlog, Kanban board or XP project.
Independent
One of the characteristics of Agile Methodologies such as Scrum, Kanban or XP is the ability to move PBIs around, taking into account, amongst other criteria, their relative priority. When PBIs are tightly dependent, it might be possible to combine them into a single PBI.
Negotiable
According to Agile methodology, while the PBI lies in the product backlog it can be rewritten or even discarded, depending on business, market, technical or any other type of requirement by team members.
Most notably though, Negotiability relates to the degree to which the Developer has freedom to negotiate the detail of the solution with the Business once in development. A story should not form a rigid contract detailing the design, but should instead talk of business outcomes the user will be able to conduct once implemented. The amount of 'wiggle room' the analyst leaves the Developer in this regard is a measure of its Negotiability. A highly negotiable story therefore typically aims to keep away from detailed UI design, certainly insofar as the Value Statement and Acceptance Criteria are concerned. Stories are not detailed specifications and nor should they aim to be.
Valuable
The aim of Agile Methodology being to continuously deliver valuable software, the PBI should bring value to the stakeholder.
Sometimes a story might not result in a complete shippable feature in its own right, and it may simply be a measurable step towards that goal. Nevertheless, the story must at least be demonstrable to the stakeholder and show that progress (i.e. something of value) has been delivered. For example, it would be acceptable for a coded/text response back from a central service to be simply shown in the user's UI (as text) to demonstrate that data had been sent to - and accepted by that service - and have a better representation of that response to be covered in another story. In this sense, the story was demonstrable and achieved something of business value, albeit perhaps not the final iteration of the design.
Estimable
Originally, Bill Wake reasoned that if a PBI size cannot be estimated, it will never be planned or tasked, and thus, it will never become part of an iteration. By this reasoning, PBI items should be capable of being estimated at some point. Note that this does not mean a PBI should in fact be estimated during the initial creation of the PBI, but only that it describes something which could be estimated.
Subsequently, to the introduction of INVEST, the "No Estimates" movement has gained traction in moving product owners away from the belief that a PBI must have been estimated in order to be planned or tasked. Many software practitioners will take on work without estimating the effort involved, as long as the item is narrowed sufficiently in scope. Bill Wake has expressed that were he to re-pick INVEST today, he would remove "Estimability" and utilize the "E" to instead emphasize an aspect of the "V for Valuable" criteria.
"Estimable" as 'the capability to be estimated' is an American English definition. To avoid confusion with the British English meaning of 'worthy of esteem', some versions of the model use the reference "Estimate-able" which also is not a defined dictionary entry. Allen Holub has suggested that the British English meaning should be embraced, seeing the process of estimation as being harmful to the software development process.
Small
Try to keep your PBI sizes to typically a few person-days and at most a few person-weeks (a good rule of thumb is that any single Product Backlog Item does not take more than 50% of an iteration; for example a single item won't take more than 5 days for a 2-week / 10 day sprint). Anything beyond that range should be considered too large to be estimated with a good level of certainty - these large PBIs may be called "Epics", where an Epic will take more than one iteration to deliver and, necessarily, will need to be broken down into smaller PBIs that can fit comfortably within Iterations. There's no problem in starting with epic PBIs, as long as they are broken down when the time to place them in an iteration backlog comes closer. This implements Lean software development's Just In Time analysis concept.
Testable
A PBI should only be considered DONE, among other things, if it was tested successfully. If one cannot test a PBI due to lack of information or access (see "Estimable" above), the PBI should not be considered a good candidate to be part of an iteration Backlog. This is especially true for teams employing TDD - Test Driven Development.
See also
Requirements engineering
Agile software development
Scope (project management)
Quality management
External links
Jeff Sutherland's Blog
https://agileforall.com/new-to-agile-invest-in-good-user-stories/
https://www.agilealliance.org/glossary/invest
References
Software development process
Acronyms
Mnemonics
|
Pieni-Kiimanen is a medium-sized lake in Kainuu region in northern Finland. It is located in Sotkamo and it belongs to the Oulujoki main catchment area. Pieni-Kiimanen is separated from another lake Iso-Kiimanen with strait Pajusalmi.
See also
List of lakes in Finland
References
Lakes of Sotkamo
|
Zhay Clark (July 16, 1895 – April 25, 1980) was an American harpist.
Early life
Zhay Clark was born in St. Louis, Missouri, the daughter of Charles Napier Clark and Emma Piercey Clark. She studied music in Denver and St. Paul.
Career
Clark was harpist with the Denver Philharmonic Society as a young woman. In 1915, she performed at the Panama-Pacific International Exposition in San Francisco, demonstrating harps for the Rudolph Wurlitzer Company. In 1917 and 1918, she toured North America with Swiss cellist Elsa Ruegger. During the 1919-1920 season, she was harpist with the Seattle Symphony Orchestra. She transcribed and arranged Charles Wakefield Cadman's "From the Land of the Sky Blue Water" for solo harp. By 1928, she was billed as "America's foremost harpist." In 1931, she served on the faculty of the Mount St. Mary's College summer school, teaching harp.
Later in her career, Clark worked in the film industry, and performed on radio. In 1929 she worked with actress Corinne Griffith on her harp performance in The Divine Lady, an early experimental sound film. In the 1940s, she played with Frank Sinatra's orchestra. She played harp on Bernard Herrmann's scores for On Dangerous Ground (1951) and Beneath the 12-Mile Reef (1953), and on the Dimitri Tiomkin scores of the films The Thing From Another World (1951) and Take the High Ground! (1953).
Personal life
Zhay Clark married a fellow musician, woodwind player Weyert A. Moor, in 1935; the couple lived in Glendale, California. Moor died in 1959. Clark died in Los Angeles in 1980, aged 84 years.
References
1895 births
1980 deaths
American harpists
Women harpists
Musicians from St. Louis
|
```smalltalk
using System;
using System.Buffers;
using System.IO;
using System.Linq;
using System.Threading.Tasks;
using Microsoft.AspNetCore.Internal;
using Xunit;
namespace Microsoft.AspNetCore.SignalR.Common.Tests.Internal.Protocol
{
public class MemoryBufferWriterTests
{
private static int MinimumSegmentSize;
static MemoryBufferWriterTests()
{
var buffer = ArrayPool<byte>.Shared.Rent(1);
// Compute the minimum segment size of the array pool
MinimumSegmentSize = buffer.Length;
ArrayPool<byte>.Shared.Return(buffer);
}
[Fact]
public void WritingNotingGivesEmptyData()
{
using (var bufferWriter = new MemoryBufferWriter())
{
Assert.Equal(0, bufferWriter.Length);
var data = bufferWriter.ToArray();
Assert.Empty(data);
}
}
[Fact]
public void WritingNotingGivesEmptyData_CopyTo()
{
using (var bufferWriter = new MemoryBufferWriter())
{
Assert.Equal(0, bufferWriter.Length);
var data = new byte[bufferWriter.Length];
bufferWriter.CopyTo(data);
Assert.Empty(data);
}
}
[Fact]
public void WriteByteWorksAsFirstCall()
{
using (var bufferWriter = new MemoryBufferWriter())
{
bufferWriter.WriteByte(234);
var data = bufferWriter.ToArray();
Assert.Equal(1, bufferWriter.Length);
Assert.Single(data);
Assert.Equal(234, data[0]);
}
}
[Fact]
public void WriteByteWorksAsFirstCall_CopyTo()
{
using (var bufferWriter = new MemoryBufferWriter())
{
bufferWriter.WriteByte(234);
Assert.Equal(1, bufferWriter.Length);
var data = new byte[bufferWriter.Length];
bufferWriter.CopyTo(data);
Assert.Equal(234, data[0]);
}
}
[Fact]
public void WriteByteWorksIfFirstByteInNewSegment()
{
var inputSize = MinimumSegmentSize;
var input = Enumerable.Range(0, inputSize).Select(i => (byte)i).ToArray();
using (var bufferWriter = new MemoryBufferWriter(MinimumSegmentSize))
{
bufferWriter.Write(input, 0, input.Length);
Assert.Equal(16, bufferWriter.Length);
bufferWriter.WriteByte(16);
Assert.Equal(17, bufferWriter.Length);
var data = bufferWriter.ToArray();
Assert.Equal(input, data.Take(16));
Assert.Equal(16, data[16]);
}
}
[Fact]
public void WriteByteWorksIfFirstByteInNewSegment_CopyTo()
{
var inputSize = MinimumSegmentSize;
var input = Enumerable.Range(0, inputSize).Select(i => (byte)i).ToArray();
using (var bufferWriter = new MemoryBufferWriter(MinimumSegmentSize))
{
bufferWriter.Write(input, 0, input.Length);
Assert.Equal(16, bufferWriter.Length);
bufferWriter.WriteByte(16);
Assert.Equal(17, bufferWriter.Length);
var data = new byte[bufferWriter.Length];
bufferWriter.CopyTo(data);
Assert.Equal(input, data.Take(16));
Assert.Equal(16, data[16]);
}
}
[Fact]
public void WriteByteWorksIfSegmentHasSpace()
{
var input = new byte[] { 11, 12, 13 };
using (var bufferWriter = new MemoryBufferWriter())
{
bufferWriter.Write(input, 0, input.Length);
bufferWriter.WriteByte(14);
Assert.Equal(4, bufferWriter.Length);
var data = bufferWriter.ToArray();
Assert.Equal(4, data.Length);
Assert.Equal(11, data[0]);
Assert.Equal(12, data[1]);
Assert.Equal(13, data[2]);
Assert.Equal(14, data[3]);
}
}
[Fact]
public void WriteByteWorksIfSegmentHasSpace_CopyTo()
{
var input = new byte[] { 11, 12, 13 };
using (var bufferWriter = new MemoryBufferWriter())
{
bufferWriter.Write(input, 0, input.Length);
bufferWriter.WriteByte(14);
Assert.Equal(4, bufferWriter.Length);
var data = new byte[bufferWriter.Length];
bufferWriter.CopyTo(data);
Assert.Equal(11, data[0]);
Assert.Equal(12, data[1]);
Assert.Equal(13, data[2]);
Assert.Equal(14, data[3]);
}
}
[Fact]
public void ToArrayWithExactlyFullSegmentsWorks()
{
var inputSize = MinimumSegmentSize * 2;
var input = Enumerable.Range(0, inputSize).Select(i => (byte)i).ToArray();
using (var bufferWriter = new MemoryBufferWriter(MinimumSegmentSize))
{
bufferWriter.Write(input, 0, input.Length);
Assert.Equal(input.Length, bufferWriter.Length);
var data = bufferWriter.ToArray();
Assert.Equal(input, data);
}
}
[Fact]
public void ToArrayWithExactlyFullSegmentsWorks_CopyTo()
{
var inputSize = MinimumSegmentSize * 2;
var input = Enumerable.Range(0, inputSize).Select(i => (byte)i).ToArray();
using (var bufferWriter = new MemoryBufferWriter(MinimumSegmentSize))
{
bufferWriter.Write(input, 0, input.Length);
Assert.Equal(input.Length, bufferWriter.Length);
var data = new byte[bufferWriter.Length];
bufferWriter.CopyTo(data);
Assert.Equal(input, data);
}
}
[Fact]
public void ToArrayWithSomeFullSegmentsWorks()
{
var inputSize = (MinimumSegmentSize * 2) + 1;
var input = Enumerable.Range(0, inputSize).Select(i => (byte)i).ToArray();
using (var bufferWriter = new MemoryBufferWriter(MinimumSegmentSize))
{
bufferWriter.Write(input, 0, input.Length);
Assert.Equal(input.Length, bufferWriter.Length);
var data = bufferWriter.ToArray();
Assert.Equal(input, data);
}
}
[Fact]
public void ToArrayWithSomeFullSegmentsWorks_CopyTo()
{
var inputSize = (MinimumSegmentSize * 2) + 1;
var input = Enumerable.Range(0, inputSize).Select(i => (byte)i).ToArray();
using (var bufferWriter = new MemoryBufferWriter(MinimumSegmentSize))
{
bufferWriter.Write(input, 0, input.Length);
Assert.Equal(input.Length, bufferWriter.Length);
var data = new byte[bufferWriter.Length];
bufferWriter.CopyTo(data);
Assert.Equal(input, data);
}
}
[Fact]
public async Task CopyToAsyncWithExactlyFullSegmentsWorks()
{
var inputSize = MinimumSegmentSize * 2;
var input = Enumerable.Range(0, inputSize).Select(i => (byte)i).ToArray();
using (var bufferWriter = new MemoryBufferWriter(MinimumSegmentSize))
{
bufferWriter.Write(input, 0, input.Length);
Assert.Equal(input.Length, bufferWriter.Length);
var ms = new MemoryStream();
await bufferWriter.CopyToAsync(ms);
var data = ms.ToArray();
Assert.Equal(input, data);
}
}
[Fact]
public async Task CopyToAsyncWithSomeFullSegmentsWorks()
{
// 2 segments + 1 extra byte
var inputSize = (MinimumSegmentSize * 2) + 1;
var input = Enumerable.Range(0, inputSize).Select(i => (byte)i).ToArray();
using (var bufferWriter = new MemoryBufferWriter(MinimumSegmentSize))
{
bufferWriter.Write(input, 0, input.Length);
Assert.Equal(input.Length, bufferWriter.Length);
var ms = new MemoryStream();
await bufferWriter.CopyToAsync(ms);
var data = ms.ToArray();
Assert.Equal(input, data);
}
}
[Fact]
public void CopyToWithExactlyFullSegmentsWorks()
{
var inputSize = MinimumSegmentSize * 2;
var input = Enumerable.Range(0, inputSize).Select(i => (byte)i).ToArray();
using (var bufferWriter = new MemoryBufferWriter(MinimumSegmentSize))
{
bufferWriter.Write(input, 0, input.Length);
Assert.Equal(input.Length, bufferWriter.Length);
using (var destination = new MemoryBufferWriter())
{
bufferWriter.CopyTo(destination);
var data = destination.ToArray();
Assert.Equal(input, data);
}
}
}
[Fact]
public void CopyToWithExactlyFullSegmentsWorks_CopyTo()
{
var inputSize = MinimumSegmentSize * 2;
var input = Enumerable.Range(0, inputSize).Select(i => (byte)i).ToArray();
using (var bufferWriter = new MemoryBufferWriter(MinimumSegmentSize))
{
bufferWriter.Write(input, 0, input.Length);
Assert.Equal(input.Length, bufferWriter.Length);
using (var destination = new MemoryBufferWriter())
{
bufferWriter.CopyTo(destination);
var data = new byte[bufferWriter.Length];
bufferWriter.CopyTo(data);
Assert.Equal(input, data);
Array.Clear(data, 0, data.Length);
destination.CopyTo(data);
Assert.Equal(input, data);
}
}
}
[Fact]
public void CopyToWithSomeFullSegmentsWorks()
{
var inputSize = (MinimumSegmentSize * 2) + 1;
var input = Enumerable.Range(0, inputSize).Select(i => (byte)i).ToArray();
using (var bufferWriter = new MemoryBufferWriter(MinimumSegmentSize))
{
bufferWriter.Write(input, 0, input.Length);
Assert.Equal(input.Length, bufferWriter.Length);
using (var destination = new MemoryBufferWriter())
{
bufferWriter.CopyTo(destination);
var data = destination.ToArray();
Assert.Equal(input, data);
}
}
}
[Fact]
public void CopyToWithSomeFullSegmentsWorks_CopyTo()
{
var inputSize = (MinimumSegmentSize * 2) + 1;
var input = Enumerable.Range(0, inputSize).Select(i => (byte)i).ToArray();
using (var bufferWriter = new MemoryBufferWriter(MinimumSegmentSize))
{
bufferWriter.Write(input, 0, input.Length);
Assert.Equal(input.Length, bufferWriter.Length);
using (var destination = new MemoryBufferWriter())
{
bufferWriter.CopyTo(destination);
var data = new byte[bufferWriter.Length];
bufferWriter.CopyTo(data);
Assert.Equal(input, data);
Array.Clear(data, 0, data.Length);
destination.CopyTo(data);
Assert.Equal(input, data);
}
}
}
#if NETCOREAPP3_0
[Fact]
public void WriteSpanWorksAtNonZeroOffset()
{
using (var bufferWriter = new MemoryBufferWriter())
{
bufferWriter.WriteByte(1);
bufferWriter.Write(new byte[] { 2, 3, 4 }.AsSpan());
Assert.Equal(4, bufferWriter.Length);
var data = bufferWriter.ToArray();
Assert.Equal(4, data.Length);
Assert.Equal(1, data[0]);
Assert.Equal(2, data[1]);
Assert.Equal(3, data[2]);
Assert.Equal(4, data[3]);
}
}
[Fact]
public void WriteSpanWorksAtNonZeroOffset_CopyTo()
{
using (var bufferWriter = new MemoryBufferWriter())
{
bufferWriter.WriteByte(1);
bufferWriter.Write(new byte[] { 2, 3, 4 }.AsSpan());
Assert.Equal(4, bufferWriter.Length);
var data = new byte[bufferWriter.Length];
bufferWriter.CopyTo(data);
Assert.Equal(1, data[0]);
Assert.Equal(2, data[1]);
Assert.Equal(3, data[2]);
Assert.Equal(4, data[3]);
}
}
#endif
[Fact]
public void your_sha256_hasht()
{
// Have the buffer writer rent only the minimum size segments from the pool.
using (var bufferWriter = new MemoryBufferWriter(MinimumSegmentSize))
{
var data = new byte[MinimumSegmentSize];
new Random().NextBytes(data);
// Write half the minimum segment size
bufferWriter.Write(data.AsSpan(0, MinimumSegmentSize / 2));
// Request a new buffer of MinimumSegmentSize
var buffer = bufferWriter.GetMemory(MinimumSegmentSize);
Assert.Equal(MinimumSegmentSize, buffer.Length);
// Write to the buffer
bufferWriter.Write(data);
// Verify the data was all written correctly
var expectedOutput = new byte[MinimumSegmentSize + (MinimumSegmentSize / 2)];
data.AsSpan(0, MinimumSegmentSize / 2).CopyTo(expectedOutput.AsSpan(0, MinimumSegmentSize / 2));
data.CopyTo(expectedOutput, MinimumSegmentSize / 2);
Assert.Equal(expectedOutput, bufferWriter.ToArray());
}
}
[Fact]
public void ResetResetsTheMemoryBufferWriter()
{
var bufferWriter = new MemoryBufferWriter();
bufferWriter.WriteByte(1);
Assert.Equal(1, bufferWriter.Length);
bufferWriter.Reset();
Assert.Equal(0, bufferWriter.Length);
}
[Fact]
public void DisposeResetsTheMemoryBufferWriter()
{
var bufferWriter = new MemoryBufferWriter();
bufferWriter.WriteByte(1);
Assert.Equal(1, bufferWriter.Length);
bufferWriter.Dispose();
Assert.Equal(0, bufferWriter.Length);
}
}
}
```
|
```php
<?php
/*
*
*
* path_to_url
*
* Unless required by applicable law or agreed to in writing, software
* WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the
*/
namespace Google\Service\ContainerAnalysis;
class DeploymentNote extends \Google\Collection
{
protected $collection_key = 'resourceUri';
/**
* @var string[]
*/
public $resourceUri;
/**
* @param string[]
*/
public function setResourceUri($resourceUri)
{
$this->resourceUri = $resourceUri;
}
/**
* @return string[]
*/
public function getResourceUri()
{
return $this->resourceUri;
}
}
// Adding a class alias for backwards compatibility with the previous class name.
class_alias(DeploymentNote::class, 'Google_Service_ContainerAnalysis_DeploymentNote');
```
|
Yashwantrao Chavan became the chief minister of the Bombay State on 1 November 1956. The first Chavan ministry served until 1957 Bombay Legislative Assembly election, and was succeeded by Chavan's second ministry.
Ministry
The ministry consisted of 15 cabinet ministers.
References
Indian National Congress
C
C
Cabinets established in 1956
Cabinets disestablished in 1957
Bombay State
|
```javascript
Infinity
Functions return `undefined` by default
Context in JavaScript
Scope and strict mode
Prevent background image flicker in **IE**
```
|
```swift
/*:
> # IMPORTANT: To use `RxSwiftExtPlayground.playground`, please:
1. Make sure you have [Carthage](path_to_url installed
1. Fetch Carthage dependencies from shell: `carthage bootstrap --platform ios`
1. Build scheme `RxSwiftExtPlayground` scheme for a simulator target
1. Choose `View > Show Debug Area`
*/
//: [Previous](@previous)
import RxSwift
import RxSwiftExt
/*:
## Observable.once
The `Observable.once` function creates a sequence that delivers an element *once* to the first subscriber then completes. The same sequence will complete immediately without delivering any element to all further subscribers.
It lets you guarantee a single-time delivery of a value. Most of the time you will want to use the `Observable.just` operator (creates a sequence which delivers a single element to any observer then complete). In some cases, `Observable.once` can be useful.
*/
let justOnce = Observable.once("Hello, world")
// let's subscribe a first time
justOnce.subscribe { event in
switch event {
case .next(let value):
print("First subscriber received value \"\(value)\"")
case .completed:
print("First subscriber completed")
default:
break
}
}
// let's subscribe a second time to the SAME sequence
justOnce.subscribe { event in
switch event {
case .next(let value):
// this will never be reached
print("Second subscriber received value \"\(value)\"")
case .completed:
print("Second subscriber completed")
default:
break
}
}
//: [Next](@next)
```
|
```objective-c
/*
*
*/
#ifndef _LATENCY_MEASURE_TIMING_SC_H
#define _LATENCY_MEASURE_TIMING_SC_H
#include <zephyr/kernel.h>
#include <zephyr/timing/timing.h>
#include <stdint.h>
__syscall timing_t timing_timestamp_get(void);
void timestamp_overhead_init(uint32_t num_iterations);
uint64_t timestamp_overhead_adjustment(uint32_t options1, uint32_t options2);
#include <zephyr/syscalls/timing_sc.h>
#endif
```
|
Virginia's 97th House of Delegates district elects one of the 100 members of the Virginia House of Delegates, the lower house of the state's bicameral legislature. The district is made up of New Kent County and parts of Hanover County and King William County on the Middle Peninsula of Virginia.
The 97th district has been represented by Republican Scott Wyatt since 2020.
List of delegates
References
External links
Virginia House of Delegates districts
New Kent County, Virginia
Hanover County, Virginia
King William County, Virginia
|
```c++
// Use, modification and distribution are subject to the
// LICENSE_1_0.txt or copy at path_to_url
// See path_to_url for more information.
// MACRO: BOOST_NO_CXX11_TRAILING_RESULT_TYPES
// TITLE: C++11 trailing function result types syntax.
// DESCRIPTION: The compiler does not support the new C++11 function result types specification syntax.
namespace boost_no_cxx11_trailing_result_types {
template< typename T >
auto foo(T const& t) -> T
{
return t;
}
int test()
{
return foo(0);
}
}
```
|
```vue
<template lang='pug'>
v-dialog(v-model='value', persistent, max-width='350', :overlay-color='color', overlay-opacity='.7')
v-card.loader-dialog.radius-7(:color='color', dark)
v-card-text.text-center.py-4
atom-spinner.is-inline(
v-if='mode === `loading`'
:animation-duration='1000'
:size='60'
color='#FFF'
)
img(v-else-if='mode === `icon`', :src='`/_assets/svg/icon-` + icon + `.svg`', :alt='icon')
.subtitle-1.white--text {{ title }}
.caption {{ subtitle }}
</template>
<script>
import { AtomSpinner } from 'epic-spinners'
export default {
components: {
AtomSpinner
},
props: {
value: {
type: Boolean,
default: false
},
color: {
type: String,
default: 'blue darken-3'
},
title: {
type: String,
default: 'Working...'
},
subtitle: {
type: String,
default: 'Please wait'
},
mode: {
type: String,
default: 'loading'
},
icon: {
type: String,
default: 'checkmark'
}
}
}
</script>
<style lang='scss'>
.loader-dialog {
transition: all .4s ease;
.atom-spinner.is-inline {
display: inline-block;
}
.caption {
color: rgba(255,255,255,.7);
}
img {
width: 80px;
}
}
</style>
```
|
Garidech (; ) is a commune in the Haute-Garonne department in southwestern France.
Population
The inhabitants of the commune are called Garidéchois.
Transport
Gare de Gragnague
Monuments
See also
Communes of the Haute-Garonne department
References
Communes of Haute-Garonne
|
```python
'''
TRIBONACCI WORDS
It is a series of words where each word is formed by concatenation
of last three words.
where :
T(1) = 1
T(2) = 12
T(3) = 1213
T(n) = T(n-1) + T(n-2) + T(n-3)
'''
def tribonacci(n):
if n == 1:
return "1"
if n == 2:
return "12"
if n == 3:
return "1213"
return tribonacci(n - 1) + tribonacci(n - 2) + tribonacci(n - 3)
n = int(input("Enter N: "))
print("The tribonacci word at position", n, "is:", tribonacci(n))
'''
INPUT : n = 5
OUTPUT: The tribonacci word at position 5 is: 1213121121312
'''
```
|
```prolog
#! /usr/bin/env perl
#
# in the file LICENSE in the source distribution or at
# path_to_url
#
# ====================================================================
# Written by Andy Polyakov <appro@openssl.org> for the OpenSSL
# project. The module is, however, dual licensed under OpenSSL and
# CRYPTOGAMS licenses depending on where you obtain it. For further
# details see path_to_url~appro/cryptogams/.
# ====================================================================
#
# This module implements Poly1305 hash for x86.
#
# April 2015
#
# Numbers are cycles per processed byte with poly1305_blocks alone,
# measured with rdtsc at fixed clock frequency.
#
# IALU/gcc-3.4(*) SSE2(**) AVX2
# Pentium 15.7/+80% -
# PIII 6.21/+90% -
# P4 19.8/+40% 3.24
# Core 2 4.85/+90% 1.80
# Westmere 4.58/+100% 1.43
# Sandy Bridge 3.90/+100% 1.36
# Haswell 3.88/+70% 1.18 0.72
# Silvermont 11.0/+40% 4.80
# Goldmont 4.10/+200% 2.10
# VIA Nano 6.71/+90% 2.47
# Sledgehammer 3.51/+180% 4.27
# Bulldozer 4.53/+140% 1.31
#
# (*) gcc 4.8 for some reason generated worse code;
# (**) besides SSE2 there are floating-point and AVX options; FP
# is deemed unnecessary, because pre-SSE2 processor are too
# old to care about, while it's not the fastest option on
# SSE2-capable ones; AVX is omitted, because it doesn't give
# a lot of improvement, 5-10% depending on processor;
$0 =~ m/(.*[\/\\])[^\/\\]+$/; $dir=$1;
push(@INC,"${dir}","${dir}../../perlasm");
require "x86asm.pl";
$output=pop;
open STDOUT,">$output";
&asm_init($ARGV[0],"poly1305-x86.pl",$ARGV[$#ARGV] eq "386");
$sse2=$avx=0;
for (@ARGV) { $sse2=1 if (/-DOPENSSL_IA32_SSE2/); }
if ($sse2) {
&static_label("const_sse2");
&static_label("enter_blocks");
&static_label("enter_emit");
&external_label("OPENSSL_ia32cap_P");
if (`$ENV{CC} -Wa,-v -c -o /dev/null -x assembler /dev/null 2>&1`
=~ /GNU assembler version ([2-9]\.[0-9]+)/) {
$avx = ($1>=2.19) + ($1>=2.22);
}
if (!$avx && $ARGV[0] eq "win32n" &&
`nasm -v 2>&1` =~ /NASM version ([2-9]\.[0-9]+)/) {
$avx = ($1>=2.09) + ($1>=2.10);
}
if (!$avx && `$ENV{CC} -v 2>&1` =~ /((?:^clang|LLVM) version|based on LLVM) ([3-9]\.[0-9]+)/) {
$avx = ($2>=3.0) + ($2>3.0);
}
}
########################################################################
# Layout of opaque area is following.
#
# unsigned __int32 h[5]; # current hash value base 2^32
# unsigned __int32 pad; # is_base2_26 in vector context
# unsigned __int32 r[4]; # key value base 2^32
&align(64);
&function_begin("poly1305_init");
&mov ("edi",&wparam(0)); # context
&mov ("esi",&wparam(1)); # key
&mov ("ebp",&wparam(2)); # function table
&xor ("eax","eax");
&mov (&DWP(4*0,"edi"),"eax"); # zero hash value
&mov (&DWP(4*1,"edi"),"eax");
&mov (&DWP(4*2,"edi"),"eax");
&mov (&DWP(4*3,"edi"),"eax");
&mov (&DWP(4*4,"edi"),"eax");
&mov (&DWP(4*5,"edi"),"eax"); # is_base2_26
&cmp ("esi",0);
&je (&label("nokey"));
if ($sse2) {
&call (&label("pic_point"));
&set_label("pic_point");
&blindpop("ebx");
&lea ("eax",&DWP("poly1305_blocks-".&label("pic_point"),"ebx"));
&lea ("edx",&DWP("poly1305_emit-".&label("pic_point"),"ebx"));
&picmeup("edi","OPENSSL_ia32cap_P","ebx",&label("pic_point"));
&mov ("ecx",&DWP(0,"edi"));
&and ("ecx",1<<26|1<<24);
&cmp ("ecx",1<<26|1<<24); # SSE2 and XMM?
&jne (&label("no_sse2"));
&lea ("eax",&DWP("_poly1305_blocks_sse2-".&label("pic_point"),"ebx"));
&lea ("edx",&DWP("_poly1305_emit_sse2-".&label("pic_point"),"ebx"));
if ($avx>1) {
&mov ("ecx",&DWP(8,"edi"));
&test ("ecx",1<<5); # AVX2?
&jz (&label("no_sse2"));
&lea ("eax",&DWP("_poly1305_blocks_avx2-".&label("pic_point"),"ebx"));
}
&set_label("no_sse2");
&mov ("edi",&wparam(0)); # reload context
&mov (&DWP(0,"ebp"),"eax"); # fill function table
&mov (&DWP(4,"ebp"),"edx");
}
&mov ("eax",&DWP(4*0,"esi")); # load input key
&mov ("ebx",&DWP(4*1,"esi"));
&mov ("ecx",&DWP(4*2,"esi"));
&mov ("edx",&DWP(4*3,"esi"));
&and ("eax",0x0fffffff);
&and ("ebx",0x0ffffffc);
&and ("ecx",0x0ffffffc);
&and ("edx",0x0ffffffc);
&mov (&DWP(4*6,"edi"),"eax");
&mov (&DWP(4*7,"edi"),"ebx");
&mov (&DWP(4*8,"edi"),"ecx");
&mov (&DWP(4*9,"edi"),"edx");
&mov ("eax",$sse2);
&set_label("nokey");
&function_end("poly1305_init");
($h0,$h1,$h2,$h3,$h4,
$d0,$d1,$d2,$d3,
$r0,$r1,$r2,$r3,
$s1,$s2,$s3)=map(4*$_,(0..15));
&function_begin("poly1305_blocks");
&mov ("edi",&wparam(0)); # ctx
&mov ("esi",&wparam(1)); # inp
&mov ("ecx",&wparam(2)); # len
&set_label("enter_blocks");
&and ("ecx",-15);
&jz (&label("nodata"));
&stack_push(16);
&mov ("eax",&DWP(4*6,"edi")); # r0
&mov ("ebx",&DWP(4*7,"edi")); # r1
&lea ("ebp",&DWP(0,"esi","ecx")); # end of input
&mov ("ecx",&DWP(4*8,"edi")); # r2
&mov ("edx",&DWP(4*9,"edi")); # r3
&mov (&wparam(2),"ebp");
&mov ("ebp","esi");
&mov (&DWP($r0,"esp"),"eax"); # r0
&mov ("eax","ebx");
&shr ("eax",2);
&mov (&DWP($r1,"esp"),"ebx"); # r1
&add ("eax","ebx"); # s1
&mov ("ebx","ecx");
&shr ("ebx",2);
&mov (&DWP($r2,"esp"),"ecx"); # r2
&add ("ebx","ecx"); # s2
&mov ("ecx","edx");
&shr ("ecx",2);
&mov (&DWP($r3,"esp"),"edx"); # r3
&add ("ecx","edx"); # s3
&mov (&DWP($s1,"esp"),"eax"); # s1
&mov (&DWP($s2,"esp"),"ebx"); # s2
&mov (&DWP($s3,"esp"),"ecx"); # s3
&mov ("eax",&DWP(4*0,"edi")); # load hash value
&mov ("ebx",&DWP(4*1,"edi"));
&mov ("ecx",&DWP(4*2,"edi"));
&mov ("esi",&DWP(4*3,"edi"));
&mov ("edi",&DWP(4*4,"edi"));
&jmp (&label("loop"));
&set_label("loop",32);
&add ("eax",&DWP(4*0,"ebp")); # accumulate input
&adc ("ebx",&DWP(4*1,"ebp"));
&adc ("ecx",&DWP(4*2,"ebp"));
&adc ("esi",&DWP(4*3,"ebp"));
&lea ("ebp",&DWP(4*4,"ebp"));
&adc ("edi",&wparam(3)); # padbit
&mov (&DWP($h0,"esp"),"eax"); # put aside hash[+inp]
&mov (&DWP($h3,"esp"),"esi");
&mul (&DWP($r0,"esp")); # h0*r0
&mov (&DWP($h4,"esp"),"edi");
&mov ("edi","eax");
&mov ("eax","ebx"); # h1
&mov ("esi","edx");
&mul (&DWP($s3,"esp")); # h1*s3
&add ("edi","eax");
&mov ("eax","ecx"); # h2
&adc ("esi","edx");
&mul (&DWP($s2,"esp")); # h2*s2
&add ("edi","eax");
&mov ("eax",&DWP($h3,"esp"));
&adc ("esi","edx");
&mul (&DWP($s1,"esp")); # h3*s1
&add ("edi","eax");
&mov ("eax",&DWP($h0,"esp"));
&adc ("esi","edx");
&mul (&DWP($r1,"esp")); # h0*r1
&mov (&DWP($d0,"esp"),"edi");
&xor ("edi","edi");
&add ("esi","eax");
&mov ("eax","ebx"); # h1
&adc ("edi","edx");
&mul (&DWP($r0,"esp")); # h1*r0
&add ("esi","eax");
&mov ("eax","ecx"); # h2
&adc ("edi","edx");
&mul (&DWP($s3,"esp")); # h2*s3
&add ("esi","eax");
&mov ("eax",&DWP($h3,"esp"));
&adc ("edi","edx");
&mul (&DWP($s2,"esp")); # h3*s2
&add ("esi","eax");
&mov ("eax",&DWP($h4,"esp"));
&adc ("edi","edx");
&imul ("eax",&DWP($s1,"esp")); # h4*s1
&add ("esi","eax");
&mov ("eax",&DWP($h0,"esp"));
&adc ("edi",0);
&mul (&DWP($r2,"esp")); # h0*r2
&mov (&DWP($d1,"esp"),"esi");
&xor ("esi","esi");
&add ("edi","eax");
&mov ("eax","ebx"); # h1
&adc ("esi","edx");
&mul (&DWP($r1,"esp")); # h1*r1
&add ("edi","eax");
&mov ("eax","ecx"); # h2
&adc ("esi","edx");
&mul (&DWP($r0,"esp")); # h2*r0
&add ("edi","eax");
&mov ("eax",&DWP($h3,"esp"));
&adc ("esi","edx");
&mul (&DWP($s3,"esp")); # h3*s3
&add ("edi","eax");
&mov ("eax",&DWP($h4,"esp"));
&adc ("esi","edx");
&imul ("eax",&DWP($s2,"esp")); # h4*s2
&add ("edi","eax");
&mov ("eax",&DWP($h0,"esp"));
&adc ("esi",0);
&mul (&DWP($r3,"esp")); # h0*r3
&mov (&DWP($d2,"esp"),"edi");
&xor ("edi","edi");
&add ("esi","eax");
&mov ("eax","ebx"); # h1
&adc ("edi","edx");
&mul (&DWP($r2,"esp")); # h1*r2
&add ("esi","eax");
&mov ("eax","ecx"); # h2
&adc ("edi","edx");
&mul (&DWP($r1,"esp")); # h2*r1
&add ("esi","eax");
&mov ("eax",&DWP($h3,"esp"));
&adc ("edi","edx");
&mul (&DWP($r0,"esp")); # h3*r0
&add ("esi","eax");
&mov ("ecx",&DWP($h4,"esp"));
&adc ("edi","edx");
&mov ("edx","ecx");
&imul ("ecx",&DWP($s3,"esp")); # h4*s3
&add ("esi","ecx");
&mov ("eax",&DWP($d0,"esp"));
&adc ("edi",0);
&imul ("edx",&DWP($r0,"esp")); # h4*r0
&add ("edx","edi");
&mov ("ebx",&DWP($d1,"esp"));
&mov ("ecx",&DWP($d2,"esp"));
&mov ("edi","edx"); # last reduction step
&shr ("edx",2);
&and ("edi",3);
&lea ("edx",&DWP(0,"edx","edx",4)); # *5
&add ("eax","edx");
&adc ("ebx",0);
&adc ("ecx",0);
&adc ("esi",0);
&adc ("edi",0);
&cmp ("ebp",&wparam(2)); # done yet?
&jne (&label("loop"));
&mov ("edx",&wparam(0)); # ctx
&stack_pop(16);
&mov (&DWP(4*0,"edx"),"eax"); # store hash value
&mov (&DWP(4*1,"edx"),"ebx");
&mov (&DWP(4*2,"edx"),"ecx");
&mov (&DWP(4*3,"edx"),"esi");
&mov (&DWP(4*4,"edx"),"edi");
&set_label("nodata");
&function_end("poly1305_blocks");
&function_begin("poly1305_emit");
&mov ("ebp",&wparam(0)); # context
&set_label("enter_emit");
&mov ("edi",&wparam(1)); # output
&mov ("eax",&DWP(4*0,"ebp")); # load hash value
&mov ("ebx",&DWP(4*1,"ebp"));
&mov ("ecx",&DWP(4*2,"ebp"));
&mov ("edx",&DWP(4*3,"ebp"));
&mov ("esi",&DWP(4*4,"ebp"));
&add ("eax",5); # compare to modulus
&adc ("ebx",0);
&adc ("ecx",0);
&adc ("edx",0);
&adc ("esi",0);
&shr ("esi",2); # did it carry/borrow?
&neg ("esi"); # do we choose hash-modulus?
&and ("eax","esi");
&and ("ebx","esi");
&and ("ecx","esi");
&and ("edx","esi");
&mov (&DWP(4*0,"edi"),"eax");
&mov (&DWP(4*1,"edi"),"ebx");
&mov (&DWP(4*2,"edi"),"ecx");
&mov (&DWP(4*3,"edi"),"edx");
¬ ("esi"); # or original hash value?
&mov ("eax",&DWP(4*0,"ebp"));
&mov ("ebx",&DWP(4*1,"ebp"));
&mov ("ecx",&DWP(4*2,"ebp"));
&mov ("edx",&DWP(4*3,"ebp"));
&mov ("ebp",&wparam(2));
&and ("eax","esi");
&and ("ebx","esi");
&and ("ecx","esi");
&and ("edx","esi");
&or ("eax",&DWP(4*0,"edi"));
&or ("ebx",&DWP(4*1,"edi"));
&or ("ecx",&DWP(4*2,"edi"));
&or ("edx",&DWP(4*3,"edi"));
&add ("eax",&DWP(4*0,"ebp")); # accumulate key
&adc ("ebx",&DWP(4*1,"ebp"));
&adc ("ecx",&DWP(4*2,"ebp"));
&adc ("edx",&DWP(4*3,"ebp"));
&mov (&DWP(4*0,"edi"),"eax");
&mov (&DWP(4*1,"edi"),"ebx");
&mov (&DWP(4*2,"edi"),"ecx");
&mov (&DWP(4*3,"edi"),"edx");
&function_end("poly1305_emit");
if ($sse2) {
########################################################################
# Layout of opaque area is following.
#
# unsigned __int32 h[5]; # current hash value base 2^26
# unsigned __int32 is_base2_26;
# unsigned __int32 r[4]; # key value base 2^32
# unsigned __int32 pad[2];
# struct { unsigned __int32 r^4, r^3, r^2, r^1; } r[9];
#
# where r^n are base 2^26 digits of degrees of multiplier key. There are
# 5 digits, but last four are interleaved with multiples of 5, totalling
# in 9 elements: r0, r1, 5*r1, r2, 5*r2, r3, 5*r3, r4, 5*r4.
my ($D0,$D1,$D2,$D3,$D4,$T0,$T1,$T2)=map("xmm$_",(0..7));
my $MASK=$T2; # borrow and keep in mind
&align (32);
&function_begin_B("_poly1305_init_sse2");
&movdqu ($D4,&QWP(4*6,"edi")); # key base 2^32
&lea ("edi",&DWP(16*3,"edi")); # size optimization
&mov ("ebp","esp");
&sub ("esp",16*(9+5));
&and ("esp",-16);
#&pand ($D4,&QWP(96,"ebx")); # magic mask
&movq ($MASK,&QWP(64,"ebx"));
&movdqa ($D0,$D4);
&movdqa ($D1,$D4);
&movdqa ($D2,$D4);
&pand ($D0,$MASK); # -> base 2^26
&psrlq ($D1,26);
&psrldq ($D2,6);
&pand ($D1,$MASK);
&movdqa ($D3,$D2);
&psrlq ($D2,4)
&psrlq ($D3,30);
&pand ($D2,$MASK);
&pand ($D3,$MASK);
&psrldq ($D4,13);
&lea ("edx",&DWP(16*9,"esp")); # size optimization
&mov ("ecx",2);
&set_label("square");
&movdqa (&QWP(16*0,"esp"),$D0);
&movdqa (&QWP(16*1,"esp"),$D1);
&movdqa (&QWP(16*2,"esp"),$D2);
&movdqa (&QWP(16*3,"esp"),$D3);
&movdqa (&QWP(16*4,"esp"),$D4);
&movdqa ($T1,$D1);
&movdqa ($T0,$D2);
&pslld ($T1,2);
&pslld ($T0,2);
&paddd ($T1,$D1); # *5
&paddd ($T0,$D2); # *5
&movdqa (&QWP(16*5,"esp"),$T1);
&movdqa (&QWP(16*6,"esp"),$T0);
&movdqa ($T1,$D3);
&movdqa ($T0,$D4);
&pslld ($T1,2);
&pslld ($T0,2);
&paddd ($T1,$D3); # *5
&paddd ($T0,$D4); # *5
&movdqa (&QWP(16*7,"esp"),$T1);
&movdqa (&QWP(16*8,"esp"),$T0);
&pshufd ($T1,$D0,0b01000100);
&movdqa ($T0,$D1);
&pshufd ($D1,$D1,0b01000100);
&pshufd ($D2,$D2,0b01000100);
&pshufd ($D3,$D3,0b01000100);
&pshufd ($D4,$D4,0b01000100);
&movdqa (&QWP(16*0,"edx"),$T1);
&movdqa (&QWP(16*1,"edx"),$D1);
&movdqa (&QWP(16*2,"edx"),$D2);
&movdqa (&QWP(16*3,"edx"),$D3);
&movdqa (&QWP(16*4,"edx"),$D4);
################################################################
# d4 = h4*r0 + h3*r1 + h2*r2 + h1*r3 + h0*r4
# d3 = h3*r0 + h2*r1 + h1*r2 + h0*r3 + h4*5*r4
# d2 = h2*r0 + h1*r1 + h0*r2 + h4*5*r3 + h3*5*r4
# d1 = h1*r0 + h0*r1 + h4*5*r2 + h3*5*r3 + h2*5*r4
# d0 = h0*r0 + h4*5*r1 + h3*5*r2 + h2*5*r3 + h1*5*r4
&pmuludq ($D4,$D0); # h4*r0
&pmuludq ($D3,$D0); # h3*r0
&pmuludq ($D2,$D0); # h2*r0
&pmuludq ($D1,$D0); # h1*r0
&pmuludq ($D0,$T1); # h0*r0
sub pmuladd {
my $load = shift;
my $base = shift; $base = "esp" if (!defined($base));
################################################################
# As for choice to "rotate" $T0-$T2 in order to move paddq
# past next multiplication. While it makes code harder to read
# and doesn't have significant effect on most processors, it
# makes a lot of difference on Atom, up to 30% improvement.
&movdqa ($T1,$T0);
&pmuludq ($T0,&QWP(16*3,$base)); # r1*h3
&movdqa ($T2,$T1);
&pmuludq ($T1,&QWP(16*2,$base)); # r1*h2
&paddq ($D4,$T0);
&movdqa ($T0,$T2);
&pmuludq ($T2,&QWP(16*1,$base)); # r1*h1
&paddq ($D3,$T1);
&$load ($T1,5); # s1
&pmuludq ($T0,&QWP(16*0,$base)); # r1*h0
&paddq ($D2,$T2);
&pmuludq ($T1,&QWP(16*4,$base)); # s1*h4
&$load ($T2,2); # r2^n
&paddq ($D1,$T0);
&movdqa ($T0,$T2);
&pmuludq ($T2,&QWP(16*2,$base)); # r2*h2
&paddq ($D0,$T1);
&movdqa ($T1,$T0);
&pmuludq ($T0,&QWP(16*1,$base)); # r2*h1
&paddq ($D4,$T2);
&$load ($T2,6); # s2^n
&pmuludq ($T1,&QWP(16*0,$base)); # r2*h0
&paddq ($D3,$T0);
&movdqa ($T0,$T2);
&pmuludq ($T2,&QWP(16*4,$base)); # s2*h4
&paddq ($D2,$T1);
&pmuludq ($T0,&QWP(16*3,$base)); # s2*h3
&$load ($T1,3); # r3^n
&paddq ($D1,$T2);
&movdqa ($T2,$T1);
&pmuludq ($T1,&QWP(16*1,$base)); # r3*h1
&paddq ($D0,$T0);
&$load ($T0,7); # s3^n
&pmuludq ($T2,&QWP(16*0,$base)); # r3*h0
&paddq ($D4,$T1);
&movdqa ($T1,$T0);
&pmuludq ($T0,&QWP(16*4,$base)); # s3*h4
&paddq ($D3,$T2);
&movdqa ($T2,$T1);
&pmuludq ($T1,&QWP(16*3,$base)); # s3*h3
&paddq ($D2,$T0);
&pmuludq ($T2,&QWP(16*2,$base)); # s3*h2
&$load ($T0,4); # r4^n
&paddq ($D1,$T1);
&$load ($T1,8); # s4^n
&pmuludq ($T0,&QWP(16*0,$base)); # r4*h0
&paddq ($D0,$T2);
&movdqa ($T2,$T1);
&pmuludq ($T1,&QWP(16*4,$base)); # s4*h4
&paddq ($D4,$T0);
&movdqa ($T0,$T2);
&pmuludq ($T2,&QWP(16*1,$base)); # s4*h1
&paddq ($D3,$T1);
&movdqa ($T1,$T0);
&pmuludq ($T0,&QWP(16*2,$base)); # s4*h2
&paddq ($D0,$T2);
&pmuludq ($T1,&QWP(16*3,$base)); # s4*h3
&movdqa ($MASK,&QWP(64,"ebx"));
&paddq ($D1,$T0);
&paddq ($D2,$T1);
}
&pmuladd (sub { my ($reg,$i)=@_;
&movdqa ($reg,&QWP(16*$i,"esp"));
},"edx");
sub lazy_reduction {
my $extra = shift;
################################################################
# lazy reduction as discussed in "NEON crypto" by D.J. Bernstein
# and P. Schwabe
#
# [(*) see discussion in poly1305-armv4 module]
&movdqa ($T0,$D3);
&pand ($D3,$MASK);
&psrlq ($T0,26);
&$extra () if (defined($extra));
&paddq ($T0,$D4); # h3 -> h4
&movdqa ($T1,$D0);
&pand ($D0,$MASK);
&psrlq ($T1,26);
&movdqa ($D4,$T0);
&paddq ($T1,$D1); # h0 -> h1
&psrlq ($T0,26);
&pand ($D4,$MASK);
&movdqa ($D1,$T1);
&psrlq ($T1,26);
&paddd ($D0,$T0); # favour paddd when
# possible, because
# paddq is "broken"
# on Atom
&psllq ($T0,2);
&paddq ($T1,$D2); # h1 -> h2
&paddq ($T0,$D0); # h4 -> h0 (*)
&pand ($D1,$MASK);
&movdqa ($D2,$T1);
&psrlq ($T1,26);
&pand ($D2,$MASK);
&paddd ($T1,$D3); # h2 -> h3
&movdqa ($D0,$T0);
&psrlq ($T0,26);
&movdqa ($D3,$T1);
&psrlq ($T1,26);
&pand ($D0,$MASK);
&paddd ($D1,$T0); # h0 -> h1
&pand ($D3,$MASK);
&paddd ($D4,$T1); # h3 -> h4
}
&lazy_reduction ();
&dec ("ecx");
&jz (&label("square_break"));
&punpcklqdq ($D0,&QWP(16*0,"esp")); # 0:r^1:0:r^2
&punpcklqdq ($D1,&QWP(16*1,"esp"));
&punpcklqdq ($D2,&QWP(16*2,"esp"));
&punpcklqdq ($D3,&QWP(16*3,"esp"));
&punpcklqdq ($D4,&QWP(16*4,"esp"));
&jmp (&label("square"));
&set_label("square_break");
&psllq ($D0,32); # -> r^3:0:r^4:0
&psllq ($D1,32);
&psllq ($D2,32);
&psllq ($D3,32);
&psllq ($D4,32);
&por ($D0,&QWP(16*0,"esp")); # r^3:r^1:r^4:r^2
&por ($D1,&QWP(16*1,"esp"));
&por ($D2,&QWP(16*2,"esp"));
&por ($D3,&QWP(16*3,"esp"));
&por ($D4,&QWP(16*4,"esp"));
&pshufd ($D0,$D0,0b10001101); # -> r^1:r^2:r^3:r^4
&pshufd ($D1,$D1,0b10001101);
&pshufd ($D2,$D2,0b10001101);
&pshufd ($D3,$D3,0b10001101);
&pshufd ($D4,$D4,0b10001101);
&movdqu (&QWP(16*0,"edi"),$D0); # save the table
&movdqu (&QWP(16*1,"edi"),$D1);
&movdqu (&QWP(16*2,"edi"),$D2);
&movdqu (&QWP(16*3,"edi"),$D3);
&movdqu (&QWP(16*4,"edi"),$D4);
&movdqa ($T1,$D1);
&movdqa ($T0,$D2);
&pslld ($T1,2);
&pslld ($T0,2);
&paddd ($T1,$D1); # *5
&paddd ($T0,$D2); # *5
&movdqu (&QWP(16*5,"edi"),$T1);
&movdqu (&QWP(16*6,"edi"),$T0);
&movdqa ($T1,$D3);
&movdqa ($T0,$D4);
&pslld ($T1,2);
&pslld ($T0,2);
&paddd ($T1,$D3); # *5
&paddd ($T0,$D4); # *5
&movdqu (&QWP(16*7,"edi"),$T1);
&movdqu (&QWP(16*8,"edi"),$T0);
&mov ("esp","ebp");
&lea ("edi",&DWP(-16*3,"edi")); # size de-optimization
&ret ();
&function_end_B("_poly1305_init_sse2");
&align (32);
&function_begin("_poly1305_blocks_sse2");
&mov ("edi",&wparam(0)); # ctx
&mov ("esi",&wparam(1)); # inp
&mov ("ecx",&wparam(2)); # len
&mov ("eax",&DWP(4*5,"edi")); # is_base2_26
&and ("ecx",-16);
&jz (&label("nodata"));
&cmp ("ecx",64);
&jae (&label("enter_sse2"));
&test ("eax","eax"); # is_base2_26?
&jz (&label("enter_blocks"));
&set_label("enter_sse2",16);
&call (&label("pic_point"));
&set_label("pic_point");
&blindpop("ebx");
&lea ("ebx",&DWP(&label("const_sse2")."-".&label("pic_point"),"ebx"));
&test ("eax","eax"); # is_base2_26?
&jnz (&label("base2_26"));
&call ("_poly1305_init_sse2");
################################################# base 2^32 -> base 2^26
&mov ("eax",&DWP(0,"edi"));
&mov ("ecx",&DWP(3,"edi"));
&mov ("edx",&DWP(6,"edi"));
&mov ("esi",&DWP(9,"edi"));
&mov ("ebp",&DWP(13,"edi"));
&mov (&DWP(4*5,"edi"),1); # is_base2_26
&shr ("ecx",2);
&and ("eax",0x3ffffff);
&shr ("edx",4);
&and ("ecx",0x3ffffff);
&shr ("esi",6);
&and ("edx",0x3ffffff);
&movd ($D0,"eax");
&movd ($D1,"ecx");
&movd ($D2,"edx");
&movd ($D3,"esi");
&movd ($D4,"ebp");
&mov ("esi",&wparam(1)); # [reload] inp
&mov ("ecx",&wparam(2)); # [reload] len
&jmp (&label("base2_32"));
&set_label("base2_26",16);
&movd ($D0,&DWP(4*0,"edi")); # load hash value
&movd ($D1,&DWP(4*1,"edi"));
&movd ($D2,&DWP(4*2,"edi"));
&movd ($D3,&DWP(4*3,"edi"));
&movd ($D4,&DWP(4*4,"edi"));
&movdqa ($MASK,&QWP(64,"ebx"));
&set_label("base2_32");
&mov ("eax",&wparam(3)); # padbit
&mov ("ebp","esp");
&sub ("esp",16*(5+5+5+9+9));
&and ("esp",-16);
&lea ("edi",&DWP(16*3,"edi")); # size optimization
&shl ("eax",24); # padbit
&test ("ecx",31);
&jz (&label("even"));
################################################################
# process single block, with SSE2, because it's still faster
# even though half of result is discarded
&movdqu ($T1,&QWP(0,"esi")); # input
&lea ("esi",&DWP(16,"esi"));
&movdqa ($T0,$T1); # -> base 2^26 ...
&pand ($T1,$MASK);
&paddd ($D0,$T1); # ... and accumuate
&movdqa ($T1,$T0);
&psrlq ($T0,26);
&psrldq ($T1,6);
&pand ($T0,$MASK);
&paddd ($D1,$T0);
&movdqa ($T0,$T1);
&psrlq ($T1,4);
&pand ($T1,$MASK);
&paddd ($D2,$T1);
&movdqa ($T1,$T0);
&psrlq ($T0,30);
&pand ($T0,$MASK);
&psrldq ($T1,7);
&paddd ($D3,$T0);
&movd ($T0,"eax"); # padbit
&paddd ($D4,$T1);
&movd ($T1,&DWP(16*0+12,"edi")); # r0
&paddd ($D4,$T0);
&movdqa (&QWP(16*0,"esp"),$D0);
&movdqa (&QWP(16*1,"esp"),$D1);
&movdqa (&QWP(16*2,"esp"),$D2);
&movdqa (&QWP(16*3,"esp"),$D3);
&movdqa (&QWP(16*4,"esp"),$D4);
################################################################
# d4 = h4*r0 + h3*r1 + h2*r2 + h1*r3 + h0*r4
# d3 = h3*r0 + h2*r1 + h1*r2 + h0*r3 + h4*5*r4
# d2 = h2*r0 + h1*r1 + h0*r2 + h4*5*r3 + h3*5*r4
# d1 = h1*r0 + h0*r1 + h4*5*r2 + h3*5*r3 + h2*5*r4
# d0 = h0*r0 + h4*5*r1 + h3*5*r2 + h2*5*r3 + h1*5*r4
&pmuludq ($D0,$T1); # h4*r0
&pmuludq ($D1,$T1); # h3*r0
&pmuludq ($D2,$T1); # h2*r0
&movd ($T0,&DWP(16*1+12,"edi")); # r1
&pmuludq ($D3,$T1); # h1*r0
&pmuludq ($D4,$T1); # h0*r0
&pmuladd (sub { my ($reg,$i)=@_;
&movd ($reg,&DWP(16*$i+12,"edi"));
});
&lazy_reduction ();
&sub ("ecx",16);
&jz (&label("done"));
&set_label("even");
&lea ("edx",&DWP(16*(5+5+5+9),"esp"));# size optimization
&lea ("eax",&DWP(-16*2,"esi"));
&sub ("ecx",64);
################################################################
# expand and copy pre-calculated table to stack
&movdqu ($T0,&QWP(16*0,"edi")); # r^1:r^2:r^3:r^4
&pshufd ($T1,$T0,0b01000100); # duplicate r^3:r^4
&cmovb ("esi","eax");
&pshufd ($T0,$T0,0b11101110); # duplicate r^1:r^2
&movdqa (&QWP(16*0,"edx"),$T1);
&lea ("eax",&DWP(16*10,"esp"));
&movdqu ($T1,&QWP(16*1,"edi"));
&movdqa (&QWP(16*(0-9),"edx"),$T0);
&pshufd ($T0,$T1,0b01000100);
&pshufd ($T1,$T1,0b11101110);
&movdqa (&QWP(16*1,"edx"),$T0);
&movdqu ($T0,&QWP(16*2,"edi"));
&movdqa (&QWP(16*(1-9),"edx"),$T1);
&pshufd ($T1,$T0,0b01000100);
&pshufd ($T0,$T0,0b11101110);
&movdqa (&QWP(16*2,"edx"),$T1);
&movdqu ($T1,&QWP(16*3,"edi"));
&movdqa (&QWP(16*(2-9),"edx"),$T0);
&pshufd ($T0,$T1,0b01000100);
&pshufd ($T1,$T1,0b11101110);
&movdqa (&QWP(16*3,"edx"),$T0);
&movdqu ($T0,&QWP(16*4,"edi"));
&movdqa (&QWP(16*(3-9),"edx"),$T1);
&pshufd ($T1,$T0,0b01000100);
&pshufd ($T0,$T0,0b11101110);
&movdqa (&QWP(16*4,"edx"),$T1);
&movdqu ($T1,&QWP(16*5,"edi"));
&movdqa (&QWP(16*(4-9),"edx"),$T0);
&pshufd ($T0,$T1,0b01000100);
&pshufd ($T1,$T1,0b11101110);
&movdqa (&QWP(16*5,"edx"),$T0);
&movdqu ($T0,&QWP(16*6,"edi"));
&movdqa (&QWP(16*(5-9),"edx"),$T1);
&pshufd ($T1,$T0,0b01000100);
&pshufd ($T0,$T0,0b11101110);
&movdqa (&QWP(16*6,"edx"),$T1);
&movdqu ($T1,&QWP(16*7,"edi"));
&movdqa (&QWP(16*(6-9),"edx"),$T0);
&pshufd ($T0,$T1,0b01000100);
&pshufd ($T1,$T1,0b11101110);
&movdqa (&QWP(16*7,"edx"),$T0);
&movdqu ($T0,&QWP(16*8,"edi"));
&movdqa (&QWP(16*(7-9),"edx"),$T1);
&pshufd ($T1,$T0,0b01000100);
&pshufd ($T0,$T0,0b11101110);
&movdqa (&QWP(16*8,"edx"),$T1);
&movdqa (&QWP(16*(8-9),"edx"),$T0);
sub load_input {
my ($inpbase,$offbase)=@_;
&movdqu ($T0,&QWP($inpbase+0,"esi")); # load input
&movdqu ($T1,&QWP($inpbase+16,"esi"));
&lea ("esi",&DWP(16*2,"esi"));
&movdqa (&QWP($offbase+16*2,"esp"),$D2);
&movdqa (&QWP($offbase+16*3,"esp"),$D3);
&movdqa (&QWP($offbase+16*4,"esp"),$D4);
&movdqa ($D2,$T0); # splat input
&movdqa ($D3,$T1);
&psrldq ($D2,6);
&psrldq ($D3,6);
&movdqa ($D4,$T0);
&punpcklqdq ($D2,$D3); # 2:3
&punpckhqdq ($D4,$T1); # 4
&punpcklqdq ($T0,$T1); # 0:1
&movdqa ($D3,$D2);
&psrlq ($D2,4);
&psrlq ($D3,30);
&movdqa ($T1,$T0);
&psrlq ($D4,40); # 4
&psrlq ($T1,26);
&pand ($T0,$MASK); # 0
&pand ($T1,$MASK); # 1
&pand ($D2,$MASK); # 2
&pand ($D3,$MASK); # 3
&por ($D4,&QWP(0,"ebx")); # padbit, yes, always
&movdqa (&QWP($offbase+16*0,"esp"),$D0) if ($offbase);
&movdqa (&QWP($offbase+16*1,"esp"),$D1) if ($offbase);
}
&load_input (16*2,16*5);
&jbe (&label("skip_loop"));
&jmp (&label("loop"));
&set_label("loop",32);
################################################################
# ((inp[0]*r^4+inp[2]*r^2+inp[4])*r^4+inp[6]*r^2
# ((inp[1]*r^4+inp[3]*r^2+inp[5])*r^3+inp[7]*r
# \___________________/
# ((inp[0]*r^4+inp[2]*r^2+inp[4])*r^4+inp[6]*r^2+inp[8])*r^2
# ((inp[1]*r^4+inp[3]*r^2+inp[5])*r^4+inp[7]*r^2+inp[9])*r
# \___________________/ \____________________/
################################################################
&movdqa ($T2,&QWP(16*(0-9),"edx")); # r0^2
&movdqa (&QWP(16*1,"eax"),$T1);
&movdqa (&QWP(16*2,"eax"),$D2);
&movdqa (&QWP(16*3,"eax"),$D3);
&movdqa (&QWP(16*4,"eax"),$D4);
################################################################
# d4 = h4*r0 + h0*r4 + h1*r3 + h2*r2 + h3*r1
# d3 = h3*r0 + h0*r3 + h1*r2 + h2*r1 + h4*5*r4
# d2 = h2*r0 + h0*r2 + h1*r1 + h3*5*r4 + h4*5*r3
# d1 = h1*r0 + h0*r1 + h2*5*r4 + h3*5*r3 + h4*5*r2
# d0 = h0*r0 + h1*5*r4 + h2*5*r3 + h3*5*r2 + h4*5*r1
&movdqa ($D1,$T0);
&pmuludq ($T0,$T2); # h0*r0
&movdqa ($D0,$T1);
&pmuludq ($T1,$T2); # h1*r0
&pmuludq ($D2,$T2); # h2*r0
&pmuludq ($D3,$T2); # h3*r0
&pmuludq ($D4,$T2); # h4*r0
sub pmuladd_alt {
my $addr = shift;
&pmuludq ($D0,&$addr(8)); # h1*s4
&movdqa ($T2,$D1);
&pmuludq ($D1,&$addr(1)); # h0*r1
&paddq ($D0,$T0);
&movdqa ($T0,$T2);
&pmuludq ($T2,&$addr(2)); # h0*r2
&paddq ($D1,$T1);
&movdqa ($T1,$T0);
&pmuludq ($T0,&$addr(3)); # h0*r3
&paddq ($D2,$T2);
&movdqa ($T2,&QWP(16*1,"eax")); # pull h1
&pmuludq ($T1,&$addr(4)); # h0*r4
&paddq ($D3,$T0);
&movdqa ($T0,$T2);
&pmuludq ($T2,&$addr(1)); # h1*r1
&paddq ($D4,$T1);
&movdqa ($T1,$T0);
&pmuludq ($T0,&$addr(2)); # h1*r2
&paddq ($D2,$T2);
&movdqa ($T2,&QWP(16*2,"eax")); # pull h2
&pmuludq ($T1,&$addr(3)); # h1*r3
&paddq ($D3,$T0);
&movdqa ($T0,$T2);
&pmuludq ($T2,&$addr(7)); # h2*s3
&paddq ($D4,$T1);
&movdqa ($T1,$T0);
&pmuludq ($T0,&$addr(8)); # h2*s4
&paddq ($D0,$T2);
&movdqa ($T2,$T1);
&pmuludq ($T1,&$addr(1)); # h2*r1
&paddq ($D1,$T0);
&movdqa ($T0,&QWP(16*3,"eax")); # pull h3
&pmuludq ($T2,&$addr(2)); # h2*r2
&paddq ($D3,$T1);
&movdqa ($T1,$T0);
&pmuludq ($T0,&$addr(6)); # h3*s2
&paddq ($D4,$T2);
&movdqa ($T2,$T1);
&pmuludq ($T1,&$addr(7)); # h3*s3
&paddq ($D0,$T0);
&movdqa ($T0,$T2);
&pmuludq ($T2,&$addr(8)); # h3*s4
&paddq ($D1,$T1);
&movdqa ($T1,&QWP(16*4,"eax")); # pull h4
&pmuludq ($T0,&$addr(1)); # h3*r1
&paddq ($D2,$T2);
&movdqa ($T2,$T1);
&pmuludq ($T1,&$addr(8)); # h4*s4
&paddq ($D4,$T0);
&movdqa ($T0,$T2);
&pmuludq ($T2,&$addr(5)); # h4*s1
&paddq ($D3,$T1);
&movdqa ($T1,$T0);
&pmuludq ($T0,&$addr(6)); # h4*s2
&paddq ($D0,$T2);
&movdqa ($MASK,&QWP(64,"ebx"));
&pmuludq ($T1,&$addr(7)); # h4*s3
&paddq ($D1,$T0);
&paddq ($D2,$T1);
}
&pmuladd_alt (sub { my $i=shift; &QWP(16*($i-9),"edx"); });
&load_input (-16*2,0);
&lea ("eax",&DWP(-16*2,"esi"));
&sub ("ecx",64);
&paddd ($T0,&QWP(16*(5+0),"esp")); # add hash value
&paddd ($T1,&QWP(16*(5+1),"esp"));
&paddd ($D2,&QWP(16*(5+2),"esp"));
&paddd ($D3,&QWP(16*(5+3),"esp"));
&paddd ($D4,&QWP(16*(5+4),"esp"));
&cmovb ("esi","eax");
&lea ("eax",&DWP(16*10,"esp"));
&movdqa ($T2,&QWP(16*0,"edx")); # r0^4
&movdqa (&QWP(16*1,"esp"),$D1);
&movdqa (&QWP(16*1,"eax"),$T1);
&movdqa (&QWP(16*2,"eax"),$D2);
&movdqa (&QWP(16*3,"eax"),$D3);
&movdqa (&QWP(16*4,"eax"),$D4);
################################################################
# d4 += h4*r0 + h0*r4 + h1*r3 + h2*r2 + h3*r1
# d3 += h3*r0 + h0*r3 + h1*r2 + h2*r1 + h4*5*r4
# d2 += h2*r0 + h0*r2 + h1*r1 + h3*5*r4 + h4*5*r3
# d1 += h1*r0 + h0*r1 + h2*5*r4 + h3*5*r3 + h4*5*r2
# d0 += h0*r0 + h1*5*r4 + h2*5*r3 + h3*5*r2 + h4*5*r1
&movdqa ($D1,$T0);
&pmuludq ($T0,$T2); # h0*r0
&paddq ($T0,$D0);
&movdqa ($D0,$T1);
&pmuludq ($T1,$T2); # h1*r0
&pmuludq ($D2,$T2); # h2*r0
&pmuludq ($D3,$T2); # h3*r0
&pmuludq ($D4,$T2); # h4*r0
&paddq ($T1,&QWP(16*1,"esp"));
&paddq ($D2,&QWP(16*2,"esp"));
&paddq ($D3,&QWP(16*3,"esp"));
&paddq ($D4,&QWP(16*4,"esp"));
&pmuladd_alt (sub { my $i=shift; &QWP(16*$i,"edx"); });
&lazy_reduction ();
&load_input (16*2,16*5);
&ja (&label("loop"));
&set_label("skip_loop");
################################################################
# multiply (inp[0:1]+hash) or inp[2:3] by r^2:r^1
&pshufd ($T2,&QWP(16*(0-9),"edx"),0x10);# r0^n
&add ("ecx",32);
&jnz (&label("long_tail"));
&paddd ($T0,$D0); # add hash value
&paddd ($T1,$D1);
&paddd ($D2,&QWP(16*7,"esp"));
&paddd ($D3,&QWP(16*8,"esp"));
&paddd ($D4,&QWP(16*9,"esp"));
&set_label("long_tail");
&movdqa (&QWP(16*0,"eax"),$T0);
&movdqa (&QWP(16*1,"eax"),$T1);
&movdqa (&QWP(16*2,"eax"),$D2);
&movdqa (&QWP(16*3,"eax"),$D3);
&movdqa (&QWP(16*4,"eax"),$D4);
################################################################
# d4 = h4*r0 + h3*r1 + h2*r2 + h1*r3 + h0*r4
# d3 = h3*r0 + h2*r1 + h1*r2 + h0*r3 + h4*5*r4
# d2 = h2*r0 + h1*r1 + h0*r2 + h4*5*r3 + h3*5*r4
# d1 = h1*r0 + h0*r1 + h4*5*r2 + h3*5*r3 + h2*5*r4
# d0 = h0*r0 + h4*5*r1 + h3*5*r2 + h2*5*r3 + h1*5*r4
&pmuludq ($T0,$T2); # h0*r0
&pmuludq ($T1,$T2); # h1*r0
&pmuludq ($D2,$T2); # h2*r0
&movdqa ($D0,$T0);
&pshufd ($T0,&QWP(16*(1-9),"edx"),0x10);# r1^n
&pmuludq ($D3,$T2); # h3*r0
&movdqa ($D1,$T1);
&pmuludq ($D4,$T2); # h4*r0
&pmuladd (sub { my ($reg,$i)=@_;
&pshufd ($reg,&QWP(16*($i-9),"edx"),0x10);
},"eax");
&jz (&label("short_tail"));
&load_input (-16*2,0);
&pshufd ($T2,&QWP(16*0,"edx"),0x10); # r0^n
&paddd ($T0,&QWP(16*5,"esp")); # add hash value
&paddd ($T1,&QWP(16*6,"esp"));
&paddd ($D2,&QWP(16*7,"esp"));
&paddd ($D3,&QWP(16*8,"esp"));
&paddd ($D4,&QWP(16*9,"esp"));
################################################################
# multiply inp[0:1] by r^4:r^3 and accumulate
&movdqa (&QWP(16*0,"esp"),$T0);
&pmuludq ($T0,$T2); # h0*r0
&movdqa (&QWP(16*1,"esp"),$T1);
&pmuludq ($T1,$T2); # h1*r0
&paddq ($D0,$T0);
&movdqa ($T0,$D2);
&pmuludq ($D2,$T2); # h2*r0
&paddq ($D1,$T1);
&movdqa ($T1,$D3);
&pmuludq ($D3,$T2); # h3*r0
&paddq ($D2,&QWP(16*2,"esp"));
&movdqa (&QWP(16*2,"esp"),$T0);
&pshufd ($T0,&QWP(16*1,"edx"),0x10); # r1^n
&paddq ($D3,&QWP(16*3,"esp"));
&movdqa (&QWP(16*3,"esp"),$T1);
&movdqa ($T1,$D4);
&pmuludq ($D4,$T2); # h4*r0
&paddq ($D4,&QWP(16*4,"esp"));
&movdqa (&QWP(16*4,"esp"),$T1);
&pmuladd (sub { my ($reg,$i)=@_;
&pshufd ($reg,&QWP(16*$i,"edx"),0x10);
});
&set_label("short_tail");
################################################################
# horizontal addition
&pshufd ($T1,$D4,0b01001110);
&pshufd ($T0,$D3,0b01001110);
&paddq ($D4,$T1);
&paddq ($D3,$T0);
&pshufd ($T1,$D0,0b01001110);
&pshufd ($T0,$D1,0b01001110);
&paddq ($D0,$T1);
&paddq ($D1,$T0);
&pshufd ($T1,$D2,0b01001110);
#&paddq ($D2,$T1);
&lazy_reduction (sub { &paddq ($D2,$T1) });
&set_label("done");
&movd (&DWP(-16*3+4*0,"edi"),$D0); # store hash value
&movd (&DWP(-16*3+4*1,"edi"),$D1);
&movd (&DWP(-16*3+4*2,"edi"),$D2);
&movd (&DWP(-16*3+4*3,"edi"),$D3);
&movd (&DWP(-16*3+4*4,"edi"),$D4);
&mov ("esp","ebp");
&set_label("nodata");
&function_end("_poly1305_blocks_sse2");
&align (32);
&function_begin("_poly1305_emit_sse2");
&mov ("ebp",&wparam(0)); # context
&cmp (&DWP(4*5,"ebp"),0); # is_base2_26?
&je (&label("enter_emit"));
&mov ("eax",&DWP(4*0,"ebp")); # load hash value
&mov ("edi",&DWP(4*1,"ebp"));
&mov ("ecx",&DWP(4*2,"ebp"));
&mov ("edx",&DWP(4*3,"ebp"));
&mov ("esi",&DWP(4*4,"ebp"));
&mov ("ebx","edi"); # base 2^26 -> base 2^32
&shl ("edi",26);
&shr ("ebx",6);
&add ("eax","edi");
&mov ("edi","ecx");
&adc ("ebx",0);
&shl ("edi",20);
&shr ("ecx",12);
&add ("ebx","edi");
&mov ("edi","edx");
&adc ("ecx",0);
&shl ("edi",14);
&shr ("edx",18);
&add ("ecx","edi");
&mov ("edi","esi");
&adc ("edx",0);
&shl ("edi",8);
&shr ("esi",24);
&add ("edx","edi");
&adc ("esi",0); # can be partially reduced
&mov ("edi","esi"); # final reduction
&and ("esi",3);
&shr ("edi",2);
&lea ("ebp",&DWP(0,"edi","edi",4)); # *5
&mov ("edi",&wparam(1)); # output
&add ("eax","ebp");
&mov ("ebp",&wparam(2)); # key
&adc ("ebx",0);
&adc ("ecx",0);
&adc ("edx",0);
&adc ("esi",0);
&movd ($D0,"eax"); # offload original hash value
&add ("eax",5); # compare to modulus
&movd ($D1,"ebx");
&adc ("ebx",0);
&movd ($D2,"ecx");
&adc ("ecx",0);
&movd ($D3,"edx");
&adc ("edx",0);
&adc ("esi",0);
&shr ("esi",2); # did it carry/borrow?
&neg ("esi"); # do we choose (hash-modulus) ...
&and ("eax","esi");
&and ("ebx","esi");
&and ("ecx","esi");
&and ("edx","esi");
&mov (&DWP(4*0,"edi"),"eax");
&movd ("eax",$D0);
&mov (&DWP(4*1,"edi"),"ebx");
&movd ("ebx",$D1);
&mov (&DWP(4*2,"edi"),"ecx");
&movd ("ecx",$D2);
&mov (&DWP(4*3,"edi"),"edx");
&movd ("edx",$D3);
¬ ("esi"); # ... or original hash value?
&and ("eax","esi");
&and ("ebx","esi");
&or ("eax",&DWP(4*0,"edi"));
&and ("ecx","esi");
&or ("ebx",&DWP(4*1,"edi"));
&and ("edx","esi");
&or ("ecx",&DWP(4*2,"edi"));
&or ("edx",&DWP(4*3,"edi"));
&add ("eax",&DWP(4*0,"ebp")); # accumulate key
&adc ("ebx",&DWP(4*1,"ebp"));
&mov (&DWP(4*0,"edi"),"eax");
&adc ("ecx",&DWP(4*2,"ebp"));
&mov (&DWP(4*1,"edi"),"ebx");
&adc ("edx",&DWP(4*3,"ebp"));
&mov (&DWP(4*2,"edi"),"ecx");
&mov (&DWP(4*3,"edi"),"edx");
&function_end("_poly1305_emit_sse2");
if ($avx>1) {
########################################################################
# Note that poly1305_init_avx2 operates on %xmm, I could have used
# poly1305_init_sse2...
&align (32);
&function_begin_B("_poly1305_init_avx2");
&vmovdqu ($D4,&QWP(4*6,"edi")); # key base 2^32
&lea ("edi",&DWP(16*3,"edi")); # size optimization
&mov ("ebp","esp");
&sub ("esp",16*(9+5));
&and ("esp",-16);
#&vpand ($D4,$D4,&QWP(96,"ebx")); # magic mask
&vmovdqa ($MASK,&QWP(64,"ebx"));
&vpand ($D0,$D4,$MASK); # -> base 2^26
&vpsrlq ($D1,$D4,26);
&vpsrldq ($D3,$D4,6);
&vpand ($D1,$D1,$MASK);
&vpsrlq ($D2,$D3,4)
&vpsrlq ($D3,$D3,30);
&vpand ($D2,$D2,$MASK);
&vpand ($D3,$D3,$MASK);
&vpsrldq ($D4,$D4,13);
&lea ("edx",&DWP(16*9,"esp")); # size optimization
&mov ("ecx",2);
&set_label("square");
&vmovdqa (&QWP(16*0,"esp"),$D0);
&vmovdqa (&QWP(16*1,"esp"),$D1);
&vmovdqa (&QWP(16*2,"esp"),$D2);
&vmovdqa (&QWP(16*3,"esp"),$D3);
&vmovdqa (&QWP(16*4,"esp"),$D4);
&vpslld ($T1,$D1,2);
&vpslld ($T0,$D2,2);
&vpaddd ($T1,$T1,$D1); # *5
&vpaddd ($T0,$T0,$D2); # *5
&vmovdqa (&QWP(16*5,"esp"),$T1);
&vmovdqa (&QWP(16*6,"esp"),$T0);
&vpslld ($T1,$D3,2);
&vpslld ($T0,$D4,2);
&vpaddd ($T1,$T1,$D3); # *5
&vpaddd ($T0,$T0,$D4); # *5
&vmovdqa (&QWP(16*7,"esp"),$T1);
&vmovdqa (&QWP(16*8,"esp"),$T0);
&vpshufd ($T0,$D0,0b01000100);
&vmovdqa ($T1,$D1);
&vpshufd ($D1,$D1,0b01000100);
&vpshufd ($D2,$D2,0b01000100);
&vpshufd ($D3,$D3,0b01000100);
&vpshufd ($D4,$D4,0b01000100);
&vmovdqa (&QWP(16*0,"edx"),$T0);
&vmovdqa (&QWP(16*1,"edx"),$D1);
&vmovdqa (&QWP(16*2,"edx"),$D2);
&vmovdqa (&QWP(16*3,"edx"),$D3);
&vmovdqa (&QWP(16*4,"edx"),$D4);
################################################################
# d4 = h4*r0 + h3*r1 + h2*r2 + h1*r3 + h0*r4
# d3 = h3*r0 + h2*r1 + h1*r2 + h0*r3 + h4*5*r4
# d2 = h2*r0 + h1*r1 + h0*r2 + h4*5*r3 + h3*5*r4
# d1 = h1*r0 + h0*r1 + h4*5*r2 + h3*5*r3 + h2*5*r4
# d0 = h0*r0 + h4*5*r1 + h3*5*r2 + h2*5*r3 + h1*5*r4
&vpmuludq ($D4,$D4,$D0); # h4*r0
&vpmuludq ($D3,$D3,$D0); # h3*r0
&vpmuludq ($D2,$D2,$D0); # h2*r0
&vpmuludq ($D1,$D1,$D0); # h1*r0
&vpmuludq ($D0,$T0,$D0); # h0*r0
&vpmuludq ($T0,$T1,&QWP(16*3,"edx")); # r1*h3
&vpaddq ($D4,$D4,$T0);
&vpmuludq ($T2,$T1,&QWP(16*2,"edx")); # r1*h2
&vpaddq ($D3,$D3,$T2);
&vpmuludq ($T0,$T1,&QWP(16*1,"edx")); # r1*h1
&vpaddq ($D2,$D2,$T0);
&vmovdqa ($T2,&QWP(16*5,"esp")); # s1
&vpmuludq ($T1,$T1,&QWP(16*0,"edx")); # r1*h0
&vpaddq ($D1,$D1,$T1);
&vmovdqa ($T0,&QWP(16*2,"esp")); # r2
&vpmuludq ($T2,$T2,&QWP(16*4,"edx")); # s1*h4
&vpaddq ($D0,$D0,$T2);
&vpmuludq ($T1,$T0,&QWP(16*2,"edx")); # r2*h2
&vpaddq ($D4,$D4,$T1);
&vpmuludq ($T2,$T0,&QWP(16*1,"edx")); # r2*h1
&vpaddq ($D3,$D3,$T2);
&vmovdqa ($T1,&QWP(16*6,"esp")); # s2
&vpmuludq ($T0,$T0,&QWP(16*0,"edx")); # r2*h0
&vpaddq ($D2,$D2,$T0);
&vpmuludq ($T2,$T1,&QWP(16*4,"edx")); # s2*h4
&vpaddq ($D1,$D1,$T2);
&vmovdqa ($T0,&QWP(16*3,"esp")); # r3
&vpmuludq ($T1,$T1,&QWP(16*3,"edx")); # s2*h3
&vpaddq ($D0,$D0,$T1);
&vpmuludq ($T2,$T0,&QWP(16*1,"edx")); # r3*h1
&vpaddq ($D4,$D4,$T2);
&vmovdqa ($T1,&QWP(16*7,"esp")); # s3
&vpmuludq ($T0,$T0,&QWP(16*0,"edx")); # r3*h0
&vpaddq ($D3,$D3,$T0);
&vpmuludq ($T2,$T1,&QWP(16*4,"edx")); # s3*h4
&vpaddq ($D2,$D2,$T2);
&vpmuludq ($T0,$T1,&QWP(16*3,"edx")); # s3*h3
&vpaddq ($D1,$D1,$T0);
&vmovdqa ($T2,&QWP(16*4,"esp")); # r4
&vpmuludq ($T1,$T1,&QWP(16*2,"edx")); # s3*h2
&vpaddq ($D0,$D0,$T1);
&vmovdqa ($T0,&QWP(16*8,"esp")); # s4
&vpmuludq ($T2,$T2,&QWP(16*0,"edx")); # r4*h0
&vpaddq ($D4,$D4,$T2);
&vpmuludq ($T1,$T0,&QWP(16*4,"edx")); # s4*h4
&vpaddq ($D3,$D3,$T1);
&vpmuludq ($T2,$T0,&QWP(16*1,"edx")); # s4*h1
&vpaddq ($D0,$D0,$T2);
&vpmuludq ($T1,$T0,&QWP(16*2,"edx")); # s4*h2
&vpaddq ($D1,$D1,$T1);
&vmovdqa ($MASK,&QWP(64,"ebx"));
&vpmuludq ($T0,$T0,&QWP(16*3,"edx")); # s4*h3
&vpaddq ($D2,$D2,$T0);
################################################################
# lazy reduction
&vpsrlq ($T0,$D3,26);
&vpand ($D3,$D3,$MASK);
&vpsrlq ($T1,$D0,26);
&vpand ($D0,$D0,$MASK);
&vpaddq ($D4,$D4,$T0); # h3 -> h4
&vpaddq ($D1,$D1,$T1); # h0 -> h1
&vpsrlq ($T0,$D4,26);
&vpand ($D4,$D4,$MASK);
&vpsrlq ($T1,$D1,26);
&vpand ($D1,$D1,$MASK);
&vpaddq ($D2,$D2,$T1); # h1 -> h2
&vpaddd ($D0,$D0,$T0);
&vpsllq ($T0,$T0,2);
&vpsrlq ($T1,$D2,26);
&vpand ($D2,$D2,$MASK);
&vpaddd ($D0,$D0,$T0); # h4 -> h0
&vpaddd ($D3,$D3,$T1); # h2 -> h3
&vpsrlq ($T1,$D3,26);
&vpsrlq ($T0,$D0,26);
&vpand ($D0,$D0,$MASK);
&vpand ($D3,$D3,$MASK);
&vpaddd ($D1,$D1,$T0); # h0 -> h1
&vpaddd ($D4,$D4,$T1); # h3 -> h4
&dec ("ecx");
&jz (&label("square_break"));
&vpunpcklqdq ($D0,$D0,&QWP(16*0,"esp")); # 0:r^1:0:r^2
&vpunpcklqdq ($D1,$D1,&QWP(16*1,"esp"));
&vpunpcklqdq ($D2,$D2,&QWP(16*2,"esp"));
&vpunpcklqdq ($D3,$D3,&QWP(16*3,"esp"));
&vpunpcklqdq ($D4,$D4,&QWP(16*4,"esp"));
&jmp (&label("square"));
&set_label("square_break");
&vpsllq ($D0,$D0,32); # -> r^3:0:r^4:0
&vpsllq ($D1,$D1,32);
&vpsllq ($D2,$D2,32);
&vpsllq ($D3,$D3,32);
&vpsllq ($D4,$D4,32);
&vpor ($D0,$D0,&QWP(16*0,"esp")); # r^3:r^1:r^4:r^2
&vpor ($D1,$D1,&QWP(16*1,"esp"));
&vpor ($D2,$D2,&QWP(16*2,"esp"));
&vpor ($D3,$D3,&QWP(16*3,"esp"));
&vpor ($D4,$D4,&QWP(16*4,"esp"));
&vpshufd ($D0,$D0,0b10001101); # -> r^1:r^2:r^3:r^4
&vpshufd ($D1,$D1,0b10001101);
&vpshufd ($D2,$D2,0b10001101);
&vpshufd ($D3,$D3,0b10001101);
&vpshufd ($D4,$D4,0b10001101);
&vmovdqu (&QWP(16*0,"edi"),$D0); # save the table
&vmovdqu (&QWP(16*1,"edi"),$D1);
&vmovdqu (&QWP(16*2,"edi"),$D2);
&vmovdqu (&QWP(16*3,"edi"),$D3);
&vmovdqu (&QWP(16*4,"edi"),$D4);
&vpslld ($T1,$D1,2);
&vpslld ($T0,$D2,2);
&vpaddd ($T1,$T1,$D1); # *5
&vpaddd ($T0,$T0,$D2); # *5
&vmovdqu (&QWP(16*5,"edi"),$T1);
&vmovdqu (&QWP(16*6,"edi"),$T0);
&vpslld ($T1,$D3,2);
&vpslld ($T0,$D4,2);
&vpaddd ($T1,$T1,$D3); # *5
&vpaddd ($T0,$T0,$D4); # *5
&vmovdqu (&QWP(16*7,"edi"),$T1);
&vmovdqu (&QWP(16*8,"edi"),$T0);
&mov ("esp","ebp");
&lea ("edi",&DWP(-16*3,"edi")); # size de-optimization
&ret ();
&function_end_B("_poly1305_init_avx2");
########################################################################
# now it's time to switch to %ymm
my ($D0,$D1,$D2,$D3,$D4,$T0,$T1,$T2)=map("ymm$_",(0..7));
my $MASK=$T2;
sub X { my $reg=shift; $reg=~s/^ymm/xmm/; $reg; }
&align (32);
&function_begin("_poly1305_blocks_avx2");
&mov ("edi",&wparam(0)); # ctx
&mov ("esi",&wparam(1)); # inp
&mov ("ecx",&wparam(2)); # len
&mov ("eax",&DWP(4*5,"edi")); # is_base2_26
&and ("ecx",-16);
&jz (&label("nodata"));
&cmp ("ecx",64);
&jae (&label("enter_avx2"));
&test ("eax","eax"); # is_base2_26?
&jz (&label("enter_blocks"));
&set_label("enter_avx2");
&vzeroupper ();
&call (&label("pic_point"));
&set_label("pic_point");
&blindpop("ebx");
&lea ("ebx",&DWP(&label("const_sse2")."-".&label("pic_point"),"ebx"));
&test ("eax","eax"); # is_base2_26?
&jnz (&label("base2_26"));
&call ("_poly1305_init_avx2");
################################################# base 2^32 -> base 2^26
&mov ("eax",&DWP(0,"edi"));
&mov ("ecx",&DWP(3,"edi"));
&mov ("edx",&DWP(6,"edi"));
&mov ("esi",&DWP(9,"edi"));
&mov ("ebp",&DWP(13,"edi"));
&shr ("ecx",2);
&and ("eax",0x3ffffff);
&shr ("edx",4);
&and ("ecx",0x3ffffff);
&shr ("esi",6);
&and ("edx",0x3ffffff);
&mov (&DWP(4*0,"edi"),"eax");
&mov (&DWP(4*1,"edi"),"ecx");
&mov (&DWP(4*2,"edi"),"edx");
&mov (&DWP(4*3,"edi"),"esi");
&mov (&DWP(4*4,"edi"),"ebp");
&mov (&DWP(4*5,"edi"),1); # is_base2_26
&mov ("esi",&wparam(1)); # [reload] inp
&mov ("ecx",&wparam(2)); # [reload] len
&set_label("base2_26");
&mov ("eax",&wparam(3)); # padbit
&mov ("ebp","esp");
&sub ("esp",32*(5+9));
&and ("esp",-512); # ensure that frame
# doesn't cross page
# boundary, which is
# essential for
# misaligned 32-byte
# loads
################################################################
# expand and copy pre-calculated table to stack
&vmovdqu (&X($D0),&QWP(16*(3+0),"edi"));
&lea ("edx",&DWP(32*5+128,"esp")); # +128 size optimization
&vmovdqu (&X($D1),&QWP(16*(3+1),"edi"));
&vmovdqu (&X($D2),&QWP(16*(3+2),"edi"));
&vmovdqu (&X($D3),&QWP(16*(3+3),"edi"));
&vmovdqu (&X($D4),&QWP(16*(3+4),"edi"));
&lea ("edi",&DWP(16*3,"edi")); # size optimization
&vpermq ($D0,$D0,0b01000000); # 00001234 -> 12343434
&vpermq ($D1,$D1,0b01000000);
&vpermq ($D2,$D2,0b01000000);
&vpermq ($D3,$D3,0b01000000);
&vpermq ($D4,$D4,0b01000000);
&vpshufd ($D0,$D0,0b11001000); # 12343434 -> 14243444
&vpshufd ($D1,$D1,0b11001000);
&vpshufd ($D2,$D2,0b11001000);
&vpshufd ($D3,$D3,0b11001000);
&vpshufd ($D4,$D4,0b11001000);
&vmovdqa (&QWP(32*0-128,"edx"),$D0);
&vmovdqu (&X($D0),&QWP(16*5,"edi"));
&vmovdqa (&QWP(32*1-128,"edx"),$D1);
&vmovdqu (&X($D1),&QWP(16*6,"edi"));
&vmovdqa (&QWP(32*2-128,"edx"),$D2);
&vmovdqu (&X($D2),&QWP(16*7,"edi"));
&vmovdqa (&QWP(32*3-128,"edx"),$D3);
&vmovdqu (&X($D3),&QWP(16*8,"edi"));
&vmovdqa (&QWP(32*4-128,"edx"),$D4);
&vpermq ($D0,$D0,0b01000000);
&vpermq ($D1,$D1,0b01000000);
&vpermq ($D2,$D2,0b01000000);
&vpermq ($D3,$D3,0b01000000);
&vpshufd ($D0,$D0,0b11001000);
&vpshufd ($D1,$D1,0b11001000);
&vpshufd ($D2,$D2,0b11001000);
&vpshufd ($D3,$D3,0b11001000);
&vmovdqa (&QWP(32*5-128,"edx"),$D0);
&vmovd (&X($D0),&DWP(-16*3+4*0,"edi"));# load hash value
&vmovdqa (&QWP(32*6-128,"edx"),$D1);
&vmovd (&X($D1),&DWP(-16*3+4*1,"edi"));
&vmovdqa (&QWP(32*7-128,"edx"),$D2);
&vmovd (&X($D2),&DWP(-16*3+4*2,"edi"));
&vmovdqa (&QWP(32*8-128,"edx"),$D3);
&vmovd (&X($D3),&DWP(-16*3+4*3,"edi"));
&vmovd (&X($D4),&DWP(-16*3+4*4,"edi"));
&vmovdqa ($MASK,&QWP(64,"ebx"));
&neg ("eax"); # padbit
&test ("ecx",63);
&jz (&label("even"));
&mov ("edx","ecx");
&and ("ecx",-64);
&and ("edx",63);
&vmovdqu (&X($T0),&QWP(16*0,"esi"));
&cmp ("edx",32);
&jb (&label("one"));
&vmovdqu (&X($T1),&QWP(16*1,"esi"));
&je (&label("two"));
&vinserti128 ($T0,$T0,&QWP(16*2,"esi"),1);
&lea ("esi",&DWP(16*3,"esi"));
&lea ("ebx",&DWP(8,"ebx")); # three padbits
&lea ("edx",&DWP(32*5+128+8,"esp")); # --:r^1:r^2:r^3 (*)
&jmp (&label("tail"));
&set_label("two");
&lea ("esi",&DWP(16*2,"esi"));
&lea ("ebx",&DWP(16,"ebx")); # two padbits
&lea ("edx",&DWP(32*5+128+16,"esp"));# --:--:r^1:r^2 (*)
&jmp (&label("tail"));
&set_label("one");
&lea ("esi",&DWP(16*1,"esi"));
&vpxor ($T1,$T1,$T1);
&lea ("ebx",&DWP(32,"ebx","eax",8)); # one or no padbits
&lea ("edx",&DWP(32*5+128+24,"esp"));# --:--:--:r^1 (*)
&jmp (&label("tail"));
# (*) spots marked with '--' are data from next table entry, but they
# are multiplied by 0 and therefore rendered insignificant
&set_label("even",32);
&vmovdqu (&X($T0),&QWP(16*0,"esi")); # load input
&vmovdqu (&X($T1),&QWP(16*1,"esi"));
&vinserti128 ($T0,$T0,&QWP(16*2,"esi"),1);
&vinserti128 ($T1,$T1,&QWP(16*3,"esi"),1);
&lea ("esi",&DWP(16*4,"esi"));
&sub ("ecx",64);
&jz (&label("tail"));
&set_label("loop");
################################################################
# ((inp[0]*r^4+r[4])*r^4+r[8])*r^4
# ((inp[1]*r^4+r[5])*r^4+r[9])*r^3
# ((inp[2]*r^4+r[6])*r^4+r[10])*r^2
# ((inp[3]*r^4+r[7])*r^4+r[11])*r^1
# \________/ \_______/
################################################################
sub vsplat_input {
&vmovdqa (&QWP(32*2,"esp"),$D2);
&vpsrldq ($D2,$T0,6); # splat input
&vmovdqa (&QWP(32*0,"esp"),$D0);
&vpsrldq ($D0,$T1,6);
&vmovdqa (&QWP(32*1,"esp"),$D1);
&vpunpckhqdq ($D1,$T0,$T1); # 4
&vpunpcklqdq ($T0,$T0,$T1); # 0:1
&vpunpcklqdq ($D2,$D2,$D0); # 2:3
&vpsrlq ($D0,$D2,30);
&vpsrlq ($D2,$D2,4);
&vpsrlq ($T1,$T0,26);
&vpsrlq ($D1,$D1,40); # 4
&vpand ($D2,$D2,$MASK); # 2
&vpand ($T0,$T0,$MASK); # 0
&vpand ($T1,$T1,$MASK); # 1
&vpand ($D0,$D0,$MASK); # 3 (*)
&vpor ($D1,$D1,&QWP(0,"ebx")); # padbit, yes, always
# (*) note that output is counterintuitive, inp[3:4] is
# returned in $D1-2, while $D3-4 are preserved;
}
&vsplat_input ();
sub vpmuladd {
my $addr = shift;
&vpaddq ($D2,$D2,&QWP(32*2,"esp")); # add hash value
&vpaddq ($T0,$T0,&QWP(32*0,"esp"));
&vpaddq ($T1,$T1,&QWP(32*1,"esp"));
&vpaddq ($D0,$D0,$D3);
&vpaddq ($D1,$D1,$D4);
################################################################
# d3 = h2*r1 + h0*r3 + h1*r2 + h3*r0 + h4*5*r4
# d4 = h2*r2 + h0*r4 + h1*r3 + h3*r1 + h4*r0
# d0 = h2*5*r3 + h0*r0 + h1*5*r4 + h3*5*r2 + h4*5*r1
# d1 = h2*5*r4 + h0*r1 + h1*r0 + h3*5*r3 + h4*5*r2
# d2 = h2*r0 + h0*r2 + h1*r1 + h3*5*r4 + h4*5*r3
&vpmuludq ($D3,$D2,&$addr(1)); # d3 = h2*r1
&vmovdqa (QWP(32*1,"esp"),$T1);
&vpmuludq ($D4,$D2,&$addr(2)); # d4 = h2*r2
&vmovdqa (QWP(32*3,"esp"),$D0);
&vpmuludq ($D0,$D2,&$addr(7)); # d0 = h2*s3
&vmovdqa (QWP(32*4,"esp"),$D1);
&vpmuludq ($D1,$D2,&$addr(8)); # d1 = h2*s4
&vpmuludq ($D2,$D2,&$addr(0)); # d2 = h2*r0
&vpmuludq ($T2,$T0,&$addr(3)); # h0*r3
&vpaddq ($D3,$D3,$T2); # d3 += h0*r3
&vpmuludq ($T1,$T0,&$addr(4)); # h0*r4
&vpaddq ($D4,$D4,$T1); # d4 + h0*r4
&vpmuludq ($T2,$T0,&$addr(0)); # h0*r0
&vpaddq ($D0,$D0,$T2); # d0 + h0*r0
&vmovdqa ($T2,&QWP(32*1,"esp")); # h1
&vpmuludq ($T1,$T0,&$addr(1)); # h0*r1
&vpaddq ($D1,$D1,$T1); # d1 += h0*r1
&vpmuludq ($T0,$T0,&$addr(2)); # h0*r2
&vpaddq ($D2,$D2,$T0); # d2 += h0*r2
&vpmuludq ($T1,$T2,&$addr(2)); # h1*r2
&vpaddq ($D3,$D3,$T1); # d3 += h1*r2
&vpmuludq ($T0,$T2,&$addr(3)); # h1*r3
&vpaddq ($D4,$D4,$T0); # d4 += h1*r3
&vpmuludq ($T1,$T2,&$addr(8)); # h1*s4
&vpaddq ($D0,$D0,$T1); # d0 += h1*s4
&vmovdqa ($T1,&QWP(32*3,"esp")); # h3
&vpmuludq ($T0,$T2,&$addr(0)); # h1*r0
&vpaddq ($D1,$D1,$T0); # d1 += h1*r0
&vpmuludq ($T2,$T2,&$addr(1)); # h1*r1
&vpaddq ($D2,$D2,$T2); # d2 += h1*r1
&vpmuludq ($T0,$T1,&$addr(0)); # h3*r0
&vpaddq ($D3,$D3,$T0); # d3 += h3*r0
&vpmuludq ($T2,$T1,&$addr(1)); # h3*r1
&vpaddq ($D4,$D4,$T2); # d4 += h3*r1
&vpmuludq ($T0,$T1,&$addr(6)); # h3*s2
&vpaddq ($D0,$D0,$T0); # d0 += h3*s2
&vmovdqa ($T0,&QWP(32*4,"esp")); # h4
&vpmuludq ($T2,$T1,&$addr(7)); # h3*s3
&vpaddq ($D1,$D1,$T2); # d1+= h3*s3
&vpmuludq ($T1,$T1,&$addr(8)); # h3*s4
&vpaddq ($D2,$D2,$T1); # d2 += h3*s4
&vpmuludq ($T2,$T0,&$addr(8)); # h4*s4
&vpaddq ($D3,$D3,$T2); # d3 += h4*s4
&vpmuludq ($T1,$T0,&$addr(5)); # h4*s1
&vpaddq ($D0,$D0,$T1); # d0 += h4*s1
&vpmuludq ($T2,$T0,&$addr(0)); # h4*r0
&vpaddq ($D4,$D4,$T2); # d4 += h4*r0
&vmovdqa ($MASK,&QWP(64,"ebx"));
&vpmuludq ($T1,$T0,&$addr(6)); # h4*s2
&vpaddq ($D1,$D1,$T1); # d1 += h4*s2
&vpmuludq ($T0,$T0,&$addr(7)); # h4*s3
&vpaddq ($D2,$D2,$T0); # d2 += h4*s3
}
&vpmuladd (sub { my $i=shift; &QWP(32*$i-128,"edx"); });
sub vlazy_reduction {
################################################################
# lazy reduction
&vpsrlq ($T0,$D3,26);
&vpand ($D3,$D3,$MASK);
&vpsrlq ($T1,$D0,26);
&vpand ($D0,$D0,$MASK);
&vpaddq ($D4,$D4,$T0); # h3 -> h4
&vpaddq ($D1,$D1,$T1); # h0 -> h1
&vpsrlq ($T0,$D4,26);
&vpand ($D4,$D4,$MASK);
&vpsrlq ($T1,$D1,26);
&vpand ($D1,$D1,$MASK);
&vpaddq ($D2,$D2,$T1); # h1 -> h2
&vpaddq ($D0,$D0,$T0);
&vpsllq ($T0,$T0,2);
&vpsrlq ($T1,$D2,26);
&vpand ($D2,$D2,$MASK);
&vpaddq ($D0,$D0,$T0); # h4 -> h0
&vpaddq ($D3,$D3,$T1); # h2 -> h3
&vpsrlq ($T1,$D3,26);
&vpsrlq ($T0,$D0,26);
&vpand ($D0,$D0,$MASK);
&vpand ($D3,$D3,$MASK);
&vpaddq ($D1,$D1,$T0); # h0 -> h1
&vpaddq ($D4,$D4,$T1); # h3 -> h4
}
&vlazy_reduction();
&vmovdqu (&X($T0),&QWP(16*0,"esi")); # load input
&vmovdqu (&X($T1),&QWP(16*1,"esi"));
&vinserti128 ($T0,$T0,&QWP(16*2,"esi"),1);
&vinserti128 ($T1,$T1,&QWP(16*3,"esi"),1);
&lea ("esi",&DWP(16*4,"esi"));
&sub ("ecx",64);
&jnz (&label("loop"));
&set_label("tail");
&vsplat_input ();
&and ("ebx",-64); # restore pointer
&vpmuladd (sub { my $i=shift; &QWP(4+32*$i-128,"edx"); });
################################################################
# horizontal addition
&vpsrldq ($T0,$D4,8);
&vpsrldq ($T1,$D3,8);
&vpaddq ($D4,$D4,$T0);
&vpsrldq ($T0,$D0,8);
&vpaddq ($D3,$D3,$T1);
&vpsrldq ($T1,$D1,8);
&vpaddq ($D0,$D0,$T0);
&vpsrldq ($T0,$D2,8);
&vpaddq ($D1,$D1,$T1);
&vpermq ($T1,$D4,2); # keep folding
&vpaddq ($D2,$D2,$T0);
&vpermq ($T0,$D3,2);
&vpaddq ($D4,$D4,$T1);
&vpermq ($T1,$D0,2);
&vpaddq ($D3,$D3,$T0);
&vpermq ($T0,$D1,2);
&vpaddq ($D0,$D0,$T1);
&vpermq ($T1,$D2,2);
&vpaddq ($D1,$D1,$T0);
&vpaddq ($D2,$D2,$T1);
&vlazy_reduction();
&cmp ("ecx",0);
&je (&label("done"));
################################################################
# clear all but single word
&vpshufd (&X($D0),&X($D0),0b11111100);
&lea ("edx",&DWP(32*5+128,"esp")); # restore pointer
&vpshufd (&X($D1),&X($D1),0b11111100);
&vpshufd (&X($D2),&X($D2),0b11111100);
&vpshufd (&X($D3),&X($D3),0b11111100);
&vpshufd (&X($D4),&X($D4),0b11111100);
&jmp (&label("even"));
&set_label("done",16);
&vmovd (&DWP(-16*3+4*0,"edi"),&X($D0));# store hash value
&vmovd (&DWP(-16*3+4*1,"edi"),&X($D1));
&vmovd (&DWP(-16*3+4*2,"edi"),&X($D2));
&vmovd (&DWP(-16*3+4*3,"edi"),&X($D3));
&vmovd (&DWP(-16*3+4*4,"edi"),&X($D4));
&vzeroupper ();
&mov ("esp","ebp");
&set_label("nodata");
&function_end("_poly1305_blocks_avx2");
}
&set_label("const_sse2",64);
&data_word(1<<24,0, 1<<24,0, 1<<24,0, 1<<24,0);
&data_word(0,0, 0,0, 0,0, 0,0);
&data_word(0x03ffffff,0,0x03ffffff,0, 0x03ffffff,0, 0x03ffffff,0);
&data_word(0x0fffffff,0x0ffffffc,0x0ffffffc,0x0ffffffc);
}
&asciz ("Poly1305 for x86, CRYPTOGAMS by <appro\@openssl.org>");
&align (4);
&asm_finish();
close STDOUT;
```
|
James Lawrence Cecil Horstead CMG, CBE (16 February 1898 - 9 June 1989) was an Anglican bishop of Sierra Leone who later became Archbishop of West Africa.
He was educated at Christ's Hospital and (after World War I service) Durham University. Horstead was President of the Durham Union for Easter term of 1921. He was ordained in 1924 and began his career with a curacy at St Margaret's Church, Durham. Emigrating to Africa he was Principal of Fourah Bay College until 1936 when he was elevated to the episcopate. In 1955 he became the Province's Primate, retiring in 1961. He was Rector of Appleby Magna until 1968 and an Assistant Bishop in the Diocese of Leicester until 1976.
References
1898 births
People educated at Christ's Hospital
Alumni of University College, Durham
Anglican bishops of Sierra Leone
20th-century Anglican bishops in Sierra Leone
20th-century Anglican archbishops
Companions of the Order of St Michael and St George
Commanders of the Order of the British Empire
Holders of a Lambeth degree
1989 deaths
Presidents of the Durham Union
Anglican archbishops of West Africa
|
```smalltalk
"
This package contains the code related to the tests of Jobs.
See the comment of Jobs package for more informations.
"
Class {
#name : 'ManifestJobsTests',
#superclass : 'PackageManifest',
#category : 'Jobs-Tests-Manifest',
#package : 'Jobs-Tests',
#tag : 'Manifest'
}
```
|
```c++
// accompanying file LICENSE_1_0.txt or copy at
// path_to_url
#ifndef BOOST_THREAD_LOCK_FACTORIES_HPP
#define BOOST_THREAD_LOCK_FACTORIES_HPP
#include <boost/thread/lock_types.hpp>
#include <boost/thread/lock_algorithms.hpp>
#if ! defined(BOOST_THREAD_NO_MAKE_UNIQUE_LOCKS)
#include <tuple> // todo change to <boost/tuple.hpp> once Boost.Tuple or Boost.Fusion provides Move semantics.
#endif
#include <boost/config/abi_prefix.hpp>
namespace boost
{
template <typename Lockable>
unique_lock<Lockable> make_unique_lock(Lockable& mtx)
{
return unique_lock<Lockable> (mtx);
}
template <typename Lockable>
unique_lock<Lockable> make_unique_lock(Lockable& mtx, adopt_lock_t)
{
return unique_lock<Lockable> (mtx, adopt_lock);
}
template <typename Lockable>
unique_lock<Lockable> make_unique_lock(Lockable& mtx, defer_lock_t)
{
return unique_lock<Lockable> (mtx, defer_lock);
}
template <typename Lockable>
unique_lock<Lockable> make_unique_lock(Lockable& mtx, try_to_lock_t)
{
return unique_lock<Lockable> (mtx, try_to_lock);
}
#if ! defined(BOOST_THREAD_NO_MAKE_UNIQUE_LOCKS)
#if ! defined BOOST_NO_CXX11_VARIADIC_TEMPLATES
template <typename ...Lockable>
std::tuple<unique_lock<Lockable> ...> make_unique_locks(Lockable& ...mtx)
{
boost::lock(mtx...);
return std::tuple<unique_lock<Lockable> ...>(unique_lock<Lockable>(mtx, adopt_lock)...);
}
#else
template <typename L1, typename L2>
std::tuple<unique_lock<L1>, unique_lock<L2> > make_unique_locks(L1& m1, L2& m2)
{
boost::lock(m1, m2);
return std::tuple<unique_lock<L1>,unique_lock<L2> >(
unique_lock<L1>(m1, adopt_lock),
unique_lock<L2>(m2, adopt_lock)
);
}
template <typename L1, typename L2, typename L3>
std::tuple<unique_lock<L1>, unique_lock<L2>, unique_lock<L3> > make_unique_locks(L1& m1, L2& m2, L3& m3)
{
boost::lock(m1, m2, m3);
return std::tuple<unique_lock<L1>,unique_lock<L2>,unique_lock<L3> >(
unique_lock<L1>(m1, adopt_lock),
unique_lock<L2>(m2, adopt_lock),
unique_lock<L3>(m3, adopt_lock)
);
}
#endif
#endif
}
#include <boost/config/abi_suffix.hpp>
#endif
```
|
```javascript
/**
* @license Apache-2.0
*
*
*
* path_to_url
*
* Unless required by applicable law or agreed to in writing, software
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
*/
'use strict';
// MODULES //
var bench = require( '@stdlib/bench' );
var pow = require( '@stdlib/math/base/special/pow' );
var pkg = require( './../package.json' ).name;
var namedtypedtuple = require( './../lib' );
// FUNCTIONS //
/**
* Creates a benchmark function.
*
* @private
* @param {PositiveInteger} len - tuple length
* @returns {Function} benchmark function
*/
function createBenchmark( len ) {
var fields;
var Point;
var p;
var i;
fields = [];
for ( i = 0; i < len+1; i++ ) {
fields.push( '_'+i.toString() );
}
Point = namedtypedtuple( fields );
p = new Point();
return benchmark;
/**
* Benchmark function.
*
* @private
* @param {Benchmark} b - benchmark instance
*/
function benchmark( b ) {
var out;
var i;
b.tic();
for ( i = 0; i < b.iterations; i++ ) {
out = p.lastFieldOf( (3.14*i)+1.0 );
if ( typeof out !== 'undefined' ) {
b.fail( 'should return undefined' );
}
}
b.toc();
if ( typeof out !== 'undefined' ) {
b.fail( 'should return undefined' );
}
b.pass( 'benchmark finished' );
b.end();
}
}
// MAIN //
/**
* Main execution sequence.
*
* @private
*/
function main() {
var len;
var min;
var max;
var f;
var i;
min = 1; // 10^min
max = 6; // 10^max
for ( i = min; i <= max; i++ ) {
len = pow( 10, i );
f = createBenchmark( len );
bench( pkg+':lastFieldOf:len='+len, f );
}
}
main();
```
|
```objective-c
/*
*
* Permission is hereby granted, free of charge, to any person obtaining a
* copy of this software and associated documentation files (the "Software"),
* to deal in the Software without restriction, including without limitation
* the rights to use, copy, modify, merge, publish, distribute, sublicense,
* and/or sell copies of the Software, and to permit persons to whom the
* Software is furnished to do so, subject to the following conditions:
*
* The above copyright notice and this permission notice shall be included
* in all copies or substantial portions of the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
* OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
* THE COPYRIGHT HOLDER(S) BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN
* AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
* CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
*/
#ifndef _mp_10_0_SH_MASK_HEADER
#define _mp_10_0_SH_MASK_HEADER
// addressBlock: mp_SmuMp0_SmnDec
//MP0_SMN_C2PMSG_32
#define MP0_SMN_C2PMSG_32__CONTENT__SHIFT 0x0
#define MP0_SMN_C2PMSG_32__CONTENT_MASK 0xFFFFFFFFL
//MP0_SMN_C2PMSG_33
#define MP0_SMN_C2PMSG_33__CONTENT__SHIFT 0x0
#define MP0_SMN_C2PMSG_33__CONTENT_MASK 0xFFFFFFFFL
//MP0_SMN_C2PMSG_34
#define MP0_SMN_C2PMSG_34__CONTENT__SHIFT 0x0
#define MP0_SMN_C2PMSG_34__CONTENT_MASK 0xFFFFFFFFL
//MP0_SMN_C2PMSG_35
#define MP0_SMN_C2PMSG_35__CONTENT__SHIFT 0x0
#define MP0_SMN_C2PMSG_35__CONTENT_MASK 0xFFFFFFFFL
//MP0_SMN_C2PMSG_36
#define MP0_SMN_C2PMSG_36__CONTENT__SHIFT 0x0
#define MP0_SMN_C2PMSG_36__CONTENT_MASK 0xFFFFFFFFL
//MP0_SMN_C2PMSG_37
#define MP0_SMN_C2PMSG_37__CONTENT__SHIFT 0x0
#define MP0_SMN_C2PMSG_37__CONTENT_MASK 0xFFFFFFFFL
//MP0_SMN_C2PMSG_38
#define MP0_SMN_C2PMSG_38__CONTENT__SHIFT 0x0
#define MP0_SMN_C2PMSG_38__CONTENT_MASK 0xFFFFFFFFL
//MP0_SMN_C2PMSG_39
#define MP0_SMN_C2PMSG_39__CONTENT__SHIFT 0x0
#define MP0_SMN_C2PMSG_39__CONTENT_MASK 0xFFFFFFFFL
//MP0_SMN_C2PMSG_40
#define MP0_SMN_C2PMSG_40__CONTENT__SHIFT 0x0
#define MP0_SMN_C2PMSG_40__CONTENT_MASK 0xFFFFFFFFL
//MP0_SMN_C2PMSG_41
#define MP0_SMN_C2PMSG_41__CONTENT__SHIFT 0x0
#define MP0_SMN_C2PMSG_41__CONTENT_MASK 0xFFFFFFFFL
//MP0_SMN_C2PMSG_42
#define MP0_SMN_C2PMSG_42__CONTENT__SHIFT 0x0
#define MP0_SMN_C2PMSG_42__CONTENT_MASK 0xFFFFFFFFL
//MP0_SMN_C2PMSG_43
#define MP0_SMN_C2PMSG_43__CONTENT__SHIFT 0x0
#define MP0_SMN_C2PMSG_43__CONTENT_MASK 0xFFFFFFFFL
//MP0_SMN_C2PMSG_44
#define MP0_SMN_C2PMSG_44__CONTENT__SHIFT 0x0
#define MP0_SMN_C2PMSG_44__CONTENT_MASK 0xFFFFFFFFL
//MP0_SMN_C2PMSG_45
#define MP0_SMN_C2PMSG_45__CONTENT__SHIFT 0x0
#define MP0_SMN_C2PMSG_45__CONTENT_MASK 0xFFFFFFFFL
//MP0_SMN_C2PMSG_46
#define MP0_SMN_C2PMSG_46__CONTENT__SHIFT 0x0
#define MP0_SMN_C2PMSG_46__CONTENT_MASK 0xFFFFFFFFL
//MP0_SMN_C2PMSG_47
#define MP0_SMN_C2PMSG_47__CONTENT__SHIFT 0x0
#define MP0_SMN_C2PMSG_47__CONTENT_MASK 0xFFFFFFFFL
//MP0_SMN_C2PMSG_48
#define MP0_SMN_C2PMSG_48__CONTENT__SHIFT 0x0
#define MP0_SMN_C2PMSG_48__CONTENT_MASK 0xFFFFFFFFL
//MP0_SMN_C2PMSG_49
#define MP0_SMN_C2PMSG_49__CONTENT__SHIFT 0x0
#define MP0_SMN_C2PMSG_49__CONTENT_MASK 0xFFFFFFFFL
//MP0_SMN_C2PMSG_50
#define MP0_SMN_C2PMSG_50__CONTENT__SHIFT 0x0
#define MP0_SMN_C2PMSG_50__CONTENT_MASK 0xFFFFFFFFL
//MP0_SMN_C2PMSG_51
#define MP0_SMN_C2PMSG_51__CONTENT__SHIFT 0x0
#define MP0_SMN_C2PMSG_51__CONTENT_MASK 0xFFFFFFFFL
//MP0_SMN_C2PMSG_52
#define MP0_SMN_C2PMSG_52__CONTENT__SHIFT 0x0
#define MP0_SMN_C2PMSG_52__CONTENT_MASK 0xFFFFFFFFL
//MP0_SMN_C2PMSG_53
#define MP0_SMN_C2PMSG_53__CONTENT__SHIFT 0x0
#define MP0_SMN_C2PMSG_53__CONTENT_MASK 0xFFFFFFFFL
//MP0_SMN_C2PMSG_54
#define MP0_SMN_C2PMSG_54__CONTENT__SHIFT 0x0
#define MP0_SMN_C2PMSG_54__CONTENT_MASK 0xFFFFFFFFL
//MP0_SMN_C2PMSG_55
#define MP0_SMN_C2PMSG_55__CONTENT__SHIFT 0x0
#define MP0_SMN_C2PMSG_55__CONTENT_MASK 0xFFFFFFFFL
//MP0_SMN_C2PMSG_56
#define MP0_SMN_C2PMSG_56__CONTENT__SHIFT 0x0
#define MP0_SMN_C2PMSG_56__CONTENT_MASK 0xFFFFFFFFL
//MP0_SMN_C2PMSG_57
#define MP0_SMN_C2PMSG_57__CONTENT__SHIFT 0x0
#define MP0_SMN_C2PMSG_57__CONTENT_MASK 0xFFFFFFFFL
//MP0_SMN_C2PMSG_58
#define MP0_SMN_C2PMSG_58__CONTENT__SHIFT 0x0
#define MP0_SMN_C2PMSG_58__CONTENT_MASK 0xFFFFFFFFL
//MP0_SMN_C2PMSG_59
#define MP0_SMN_C2PMSG_59__CONTENT__SHIFT 0x0
#define MP0_SMN_C2PMSG_59__CONTENT_MASK 0xFFFFFFFFL
//MP0_SMN_C2PMSG_60
#define MP0_SMN_C2PMSG_60__CONTENT__SHIFT 0x0
#define MP0_SMN_C2PMSG_60__CONTENT_MASK 0xFFFFFFFFL
//MP0_SMN_C2PMSG_61
#define MP0_SMN_C2PMSG_61__CONTENT__SHIFT 0x0
#define MP0_SMN_C2PMSG_61__CONTENT_MASK 0xFFFFFFFFL
//MP0_SMN_C2PMSG_62
#define MP0_SMN_C2PMSG_62__CONTENT__SHIFT 0x0
#define MP0_SMN_C2PMSG_62__CONTENT_MASK 0xFFFFFFFFL
//MP0_SMN_C2PMSG_63
#define MP0_SMN_C2PMSG_63__CONTENT__SHIFT 0x0
#define MP0_SMN_C2PMSG_63__CONTENT_MASK 0xFFFFFFFFL
//MP0_SMN_C2PMSG_64
#define MP0_SMN_C2PMSG_64__CONTENT__SHIFT 0x0
#define MP0_SMN_C2PMSG_64__CONTENT_MASK 0xFFFFFFFFL
//MP0_SMN_C2PMSG_65
#define MP0_SMN_C2PMSG_65__CONTENT__SHIFT 0x0
#define MP0_SMN_C2PMSG_65__CONTENT_MASK 0xFFFFFFFFL
//MP0_SMN_C2PMSG_66
#define MP0_SMN_C2PMSG_66__CONTENT__SHIFT 0x0
#define MP0_SMN_C2PMSG_66__CONTENT_MASK 0xFFFFFFFFL
//MP0_SMN_C2PMSG_67
#define MP0_SMN_C2PMSG_67__CONTENT__SHIFT 0x0
#define MP0_SMN_C2PMSG_67__CONTENT_MASK 0xFFFFFFFFL
//MP0_SMN_C2PMSG_68
#define MP0_SMN_C2PMSG_68__CONTENT__SHIFT 0x0
#define MP0_SMN_C2PMSG_68__CONTENT_MASK 0xFFFFFFFFL
//MP0_SMN_C2PMSG_69
#define MP0_SMN_C2PMSG_69__CONTENT__SHIFT 0x0
#define MP0_SMN_C2PMSG_69__CONTENT_MASK 0xFFFFFFFFL
//MP0_SMN_C2PMSG_70
#define MP0_SMN_C2PMSG_70__CONTENT__SHIFT 0x0
#define MP0_SMN_C2PMSG_70__CONTENT_MASK 0xFFFFFFFFL
//MP0_SMN_C2PMSG_71
#define MP0_SMN_C2PMSG_71__CONTENT__SHIFT 0x0
#define MP0_SMN_C2PMSG_71__CONTENT_MASK 0xFFFFFFFFL
//MP0_SMN_C2PMSG_72
#define MP0_SMN_C2PMSG_72__CONTENT__SHIFT 0x0
#define MP0_SMN_C2PMSG_72__CONTENT_MASK 0xFFFFFFFFL
//MP0_SMN_C2PMSG_73
#define MP0_SMN_C2PMSG_73__CONTENT__SHIFT 0x0
#define MP0_SMN_C2PMSG_73__CONTENT_MASK 0xFFFFFFFFL
//MP0_SMN_C2PMSG_74
#define MP0_SMN_C2PMSG_74__CONTENT__SHIFT 0x0
#define MP0_SMN_C2PMSG_74__CONTENT_MASK 0xFFFFFFFFL
//MP0_SMN_C2PMSG_75
#define MP0_SMN_C2PMSG_75__CONTENT__SHIFT 0x0
#define MP0_SMN_C2PMSG_75__CONTENT_MASK 0xFFFFFFFFL
//MP0_SMN_C2PMSG_76
#define MP0_SMN_C2PMSG_76__CONTENT__SHIFT 0x0
#define MP0_SMN_C2PMSG_76__CONTENT_MASK 0xFFFFFFFFL
//MP0_SMN_C2PMSG_77
#define MP0_SMN_C2PMSG_77__CONTENT__SHIFT 0x0
#define MP0_SMN_C2PMSG_77__CONTENT_MASK 0xFFFFFFFFL
//MP0_SMN_C2PMSG_78
#define MP0_SMN_C2PMSG_78__CONTENT__SHIFT 0x0
#define MP0_SMN_C2PMSG_78__CONTENT_MASK 0xFFFFFFFFL
//MP0_SMN_C2PMSG_79
#define MP0_SMN_C2PMSG_79__CONTENT__SHIFT 0x0
#define MP0_SMN_C2PMSG_79__CONTENT_MASK 0xFFFFFFFFL
//MP0_SMN_C2PMSG_80
#define MP0_SMN_C2PMSG_80__CONTENT__SHIFT 0x0
#define MP0_SMN_C2PMSG_80__CONTENT_MASK 0xFFFFFFFFL
//MP0_SMN_C2PMSG_81
#define MP0_SMN_C2PMSG_81__CONTENT__SHIFT 0x0
#define MP0_SMN_C2PMSG_81__CONTENT_MASK 0xFFFFFFFFL
//MP0_SMN_C2PMSG_82
#define MP0_SMN_C2PMSG_82__CONTENT__SHIFT 0x0
#define MP0_SMN_C2PMSG_82__CONTENT_MASK 0xFFFFFFFFL
//MP0_SMN_C2PMSG_83
#define MP0_SMN_C2PMSG_83__CONTENT__SHIFT 0x0
#define MP0_SMN_C2PMSG_83__CONTENT_MASK 0xFFFFFFFFL
//MP0_SMN_C2PMSG_84
#define MP0_SMN_C2PMSG_84__CONTENT__SHIFT 0x0
#define MP0_SMN_C2PMSG_84__CONTENT_MASK 0xFFFFFFFFL
//MP0_SMN_C2PMSG_85
#define MP0_SMN_C2PMSG_85__CONTENT__SHIFT 0x0
#define MP0_SMN_C2PMSG_85__CONTENT_MASK 0xFFFFFFFFL
//MP0_SMN_C2PMSG_86
#define MP0_SMN_C2PMSG_86__CONTENT__SHIFT 0x0
#define MP0_SMN_C2PMSG_86__CONTENT_MASK 0xFFFFFFFFL
//MP0_SMN_C2PMSG_87
#define MP0_SMN_C2PMSG_87__CONTENT__SHIFT 0x0
#define MP0_SMN_C2PMSG_87__CONTENT_MASK 0xFFFFFFFFL
//MP0_SMN_C2PMSG_88
#define MP0_SMN_C2PMSG_88__CONTENT__SHIFT 0x0
#define MP0_SMN_C2PMSG_88__CONTENT_MASK 0xFFFFFFFFL
//MP0_SMN_C2PMSG_89
#define MP0_SMN_C2PMSG_89__CONTENT__SHIFT 0x0
#define MP0_SMN_C2PMSG_89__CONTENT_MASK 0xFFFFFFFFL
//MP0_SMN_C2PMSG_90
#define MP0_SMN_C2PMSG_90__CONTENT__SHIFT 0x0
#define MP0_SMN_C2PMSG_90__CONTENT_MASK 0xFFFFFFFFL
//MP0_SMN_C2PMSG_91
#define MP0_SMN_C2PMSG_91__CONTENT__SHIFT 0x0
#define MP0_SMN_C2PMSG_91__CONTENT_MASK 0xFFFFFFFFL
//MP0_SMN_C2PMSG_92
#define MP0_SMN_C2PMSG_92__CONTENT__SHIFT 0x0
#define MP0_SMN_C2PMSG_92__CONTENT_MASK 0xFFFFFFFFL
//MP0_SMN_C2PMSG_93
#define MP0_SMN_C2PMSG_93__CONTENT__SHIFT 0x0
#define MP0_SMN_C2PMSG_93__CONTENT_MASK 0xFFFFFFFFL
//MP0_SMN_C2PMSG_94
#define MP0_SMN_C2PMSG_94__CONTENT__SHIFT 0x0
#define MP0_SMN_C2PMSG_94__CONTENT_MASK 0xFFFFFFFFL
//MP0_SMN_C2PMSG_95
#define MP0_SMN_C2PMSG_95__CONTENT__SHIFT 0x0
#define MP0_SMN_C2PMSG_95__CONTENT_MASK 0xFFFFFFFFL
//MP0_SMN_C2PMSG_96
#define MP0_SMN_C2PMSG_96__CONTENT__SHIFT 0x0
#define MP0_SMN_C2PMSG_96__CONTENT_MASK 0xFFFFFFFFL
//MP0_SMN_C2PMSG_97
#define MP0_SMN_C2PMSG_97__CONTENT__SHIFT 0x0
#define MP0_SMN_C2PMSG_97__CONTENT_MASK 0xFFFFFFFFL
//MP0_SMN_C2PMSG_98
#define MP0_SMN_C2PMSG_98__CONTENT__SHIFT 0x0
#define MP0_SMN_C2PMSG_98__CONTENT_MASK 0xFFFFFFFFL
//MP0_SMN_C2PMSG_99
#define MP0_SMN_C2PMSG_99__CONTENT__SHIFT 0x0
#define MP0_SMN_C2PMSG_99__CONTENT_MASK 0xFFFFFFFFL
//MP0_SMN_C2PMSG_100
#define MP0_SMN_C2PMSG_100__CONTENT__SHIFT 0x0
#define MP0_SMN_C2PMSG_100__CONTENT_MASK 0xFFFFFFFFL
//MP0_SMN_C2PMSG_101
#define MP0_SMN_C2PMSG_101__CONTENT__SHIFT 0x0
#define MP0_SMN_C2PMSG_101__CONTENT_MASK 0xFFFFFFFFL
//MP0_SMN_C2PMSG_102
#define MP0_SMN_C2PMSG_102__CONTENT__SHIFT 0x0
#define MP0_SMN_C2PMSG_102__CONTENT_MASK 0xFFFFFFFFL
//MP0_SMN_C2PMSG_103
#define MP0_SMN_C2PMSG_103__CONTENT__SHIFT 0x0
#define MP0_SMN_C2PMSG_103__CONTENT_MASK 0xFFFFFFFFL
//MP0_SMN_IH_CREDIT
#define MP0_SMN_IH_CREDIT__CREDIT_VALUE__SHIFT 0x0
#define MP0_SMN_IH_CREDIT__CLIENT_ID__SHIFT 0x10
#define MP0_SMN_IH_CREDIT__CREDIT_VALUE_MASK 0x00000003L
#define MP0_SMN_IH_CREDIT__CLIENT_ID_MASK 0x00FF0000L
//MP0_SMN_IH_SW_INT
#define MP0_SMN_IH_SW_INT__VALID__SHIFT 0x0
#define MP0_SMN_IH_SW_INT__ID__SHIFT 0x1
#define MP0_SMN_IH_SW_INT__VALID_MASK 0x00000001L
#define MP0_SMN_IH_SW_INT__ID_MASK 0x000001FEL
//MP0_SMN_IH_SW_INT_CTRL
#define MP0_SMN_IH_SW_INT_CTRL__SW_TRIG_MASK__SHIFT 0x0
#define MP0_SMN_IH_SW_INT_CTRL__SW_INT_ACK__SHIFT 0x8
#define MP0_SMN_IH_SW_INT_CTRL__SW_TRIG_MASK_MASK 0x00000001L
#define MP0_SMN_IH_SW_INT_CTRL__SW_INT_ACK_MASK 0x00000100L
// addressBlock: mp_SmuMp1_SmnDec
//MP1_SMN_C2PMSG_32
#define MP1_SMN_C2PMSG_32__CONTENT__SHIFT 0x0
#define MP1_SMN_C2PMSG_32__CONTENT_MASK 0xFFFFFFFFL
//MP1_SMN_C2PMSG_33
#define MP1_SMN_C2PMSG_33__CONTENT__SHIFT 0x0
#define MP1_SMN_C2PMSG_33__CONTENT_MASK 0xFFFFFFFFL
//MP1_SMN_C2PMSG_34
#define MP1_SMN_C2PMSG_34__CONTENT__SHIFT 0x0
#define MP1_SMN_C2PMSG_34__CONTENT_MASK 0xFFFFFFFFL
//MP1_SMN_C2PMSG_35
#define MP1_SMN_C2PMSG_35__CONTENT__SHIFT 0x0
#define MP1_SMN_C2PMSG_35__CONTENT_MASK 0xFFFFFFFFL
//MP1_SMN_C2PMSG_36
#define MP1_SMN_C2PMSG_36__CONTENT__SHIFT 0x0
#define MP1_SMN_C2PMSG_36__CONTENT_MASK 0xFFFFFFFFL
//MP1_SMN_C2PMSG_37
#define MP1_SMN_C2PMSG_37__CONTENT__SHIFT 0x0
#define MP1_SMN_C2PMSG_37__CONTENT_MASK 0xFFFFFFFFL
//MP1_SMN_C2PMSG_38
#define MP1_SMN_C2PMSG_38__CONTENT__SHIFT 0x0
#define MP1_SMN_C2PMSG_38__CONTENT_MASK 0xFFFFFFFFL
//MP1_SMN_C2PMSG_39
#define MP1_SMN_C2PMSG_39__CONTENT__SHIFT 0x0
#define MP1_SMN_C2PMSG_39__CONTENT_MASK 0xFFFFFFFFL
//MP1_SMN_C2PMSG_40
#define MP1_SMN_C2PMSG_40__CONTENT__SHIFT 0x0
#define MP1_SMN_C2PMSG_40__CONTENT_MASK 0xFFFFFFFFL
//MP1_SMN_C2PMSG_41
#define MP1_SMN_C2PMSG_41__CONTENT__SHIFT 0x0
#define MP1_SMN_C2PMSG_41__CONTENT_MASK 0xFFFFFFFFL
//MP1_SMN_C2PMSG_42
#define MP1_SMN_C2PMSG_42__CONTENT__SHIFT 0x0
#define MP1_SMN_C2PMSG_42__CONTENT_MASK 0xFFFFFFFFL
//MP1_SMN_C2PMSG_43
#define MP1_SMN_C2PMSG_43__CONTENT__SHIFT 0x0
#define MP1_SMN_C2PMSG_43__CONTENT_MASK 0xFFFFFFFFL
//MP1_SMN_C2PMSG_44
#define MP1_SMN_C2PMSG_44__CONTENT__SHIFT 0x0
#define MP1_SMN_C2PMSG_44__CONTENT_MASK 0xFFFFFFFFL
//MP1_SMN_C2PMSG_45
#define MP1_SMN_C2PMSG_45__CONTENT__SHIFT 0x0
#define MP1_SMN_C2PMSG_45__CONTENT_MASK 0xFFFFFFFFL
//MP1_SMN_C2PMSG_46
#define MP1_SMN_C2PMSG_46__CONTENT__SHIFT 0x0
#define MP1_SMN_C2PMSG_46__CONTENT_MASK 0xFFFFFFFFL
//MP1_SMN_C2PMSG_47
#define MP1_SMN_C2PMSG_47__CONTENT__SHIFT 0x0
#define MP1_SMN_C2PMSG_47__CONTENT_MASK 0xFFFFFFFFL
//MP1_SMN_C2PMSG_48
#define MP1_SMN_C2PMSG_48__CONTENT__SHIFT 0x0
#define MP1_SMN_C2PMSG_48__CONTENT_MASK 0xFFFFFFFFL
//MP1_SMN_C2PMSG_49
#define MP1_SMN_C2PMSG_49__CONTENT__SHIFT 0x0
#define MP1_SMN_C2PMSG_49__CONTENT_MASK 0xFFFFFFFFL
//MP1_SMN_C2PMSG_50
#define MP1_SMN_C2PMSG_50__CONTENT__SHIFT 0x0
#define MP1_SMN_C2PMSG_50__CONTENT_MASK 0xFFFFFFFFL
//MP1_SMN_C2PMSG_51
#define MP1_SMN_C2PMSG_51__CONTENT__SHIFT 0x0
#define MP1_SMN_C2PMSG_51__CONTENT_MASK 0xFFFFFFFFL
//MP1_SMN_C2PMSG_52
#define MP1_SMN_C2PMSG_52__CONTENT__SHIFT 0x0
#define MP1_SMN_C2PMSG_52__CONTENT_MASK 0xFFFFFFFFL
//MP1_SMN_C2PMSG_53
#define MP1_SMN_C2PMSG_53__CONTENT__SHIFT 0x0
#define MP1_SMN_C2PMSG_53__CONTENT_MASK 0xFFFFFFFFL
//MP1_SMN_C2PMSG_54
#define MP1_SMN_C2PMSG_54__CONTENT__SHIFT 0x0
#define MP1_SMN_C2PMSG_54__CONTENT_MASK 0xFFFFFFFFL
//MP1_SMN_C2PMSG_55
#define MP1_SMN_C2PMSG_55__CONTENT__SHIFT 0x0
#define MP1_SMN_C2PMSG_55__CONTENT_MASK 0xFFFFFFFFL
//MP1_SMN_C2PMSG_56
#define MP1_SMN_C2PMSG_56__CONTENT__SHIFT 0x0
#define MP1_SMN_C2PMSG_56__CONTENT_MASK 0xFFFFFFFFL
//MP1_SMN_C2PMSG_57
#define MP1_SMN_C2PMSG_57__CONTENT__SHIFT 0x0
#define MP1_SMN_C2PMSG_57__CONTENT_MASK 0xFFFFFFFFL
//MP1_SMN_C2PMSG_58
#define MP1_SMN_C2PMSG_58__CONTENT__SHIFT 0x0
#define MP1_SMN_C2PMSG_58__CONTENT_MASK 0xFFFFFFFFL
//MP1_SMN_C2PMSG_59
#define MP1_SMN_C2PMSG_59__CONTENT__SHIFT 0x0
#define MP1_SMN_C2PMSG_59__CONTENT_MASK 0xFFFFFFFFL
//MP1_SMN_C2PMSG_60
#define MP1_SMN_C2PMSG_60__CONTENT__SHIFT 0x0
#define MP1_SMN_C2PMSG_60__CONTENT_MASK 0xFFFFFFFFL
//MP1_SMN_C2PMSG_61
#define MP1_SMN_C2PMSG_61__CONTENT__SHIFT 0x0
#define MP1_SMN_C2PMSG_61__CONTENT_MASK 0xFFFFFFFFL
//MP1_SMN_C2PMSG_62
#define MP1_SMN_C2PMSG_62__CONTENT__SHIFT 0x0
#define MP1_SMN_C2PMSG_62__CONTENT_MASK 0xFFFFFFFFL
//MP1_SMN_C2PMSG_63
#define MP1_SMN_C2PMSG_63__CONTENT__SHIFT 0x0
#define MP1_SMN_C2PMSG_63__CONTENT_MASK 0xFFFFFFFFL
//MP1_SMN_C2PMSG_64
#define MP1_SMN_C2PMSG_64__CONTENT__SHIFT 0x0
#define MP1_SMN_C2PMSG_64__CONTENT_MASK 0xFFFFFFFFL
//MP1_SMN_C2PMSG_65
#define MP1_SMN_C2PMSG_65__CONTENT__SHIFT 0x0
#define MP1_SMN_C2PMSG_65__CONTENT_MASK 0xFFFFFFFFL
//MP1_SMN_C2PMSG_66
#define MP1_SMN_C2PMSG_66__CONTENT__SHIFT 0x0
#define MP1_SMN_C2PMSG_66__CONTENT_MASK 0xFFFFFFFFL
//MP1_SMN_C2PMSG_67
#define MP1_SMN_C2PMSG_67__CONTENT__SHIFT 0x0
#define MP1_SMN_C2PMSG_67__CONTENT_MASK 0xFFFFFFFFL
//MP1_SMN_C2PMSG_68
#define MP1_SMN_C2PMSG_68__CONTENT__SHIFT 0x0
#define MP1_SMN_C2PMSG_68__CONTENT_MASK 0xFFFFFFFFL
//MP1_SMN_C2PMSG_69
#define MP1_SMN_C2PMSG_69__CONTENT__SHIFT 0x0
#define MP1_SMN_C2PMSG_69__CONTENT_MASK 0xFFFFFFFFL
//MP1_SMN_C2PMSG_70
#define MP1_SMN_C2PMSG_70__CONTENT__SHIFT 0x0
#define MP1_SMN_C2PMSG_70__CONTENT_MASK 0xFFFFFFFFL
//MP1_SMN_C2PMSG_71
#define MP1_SMN_C2PMSG_71__CONTENT__SHIFT 0x0
#define MP1_SMN_C2PMSG_71__CONTENT_MASK 0xFFFFFFFFL
//MP1_SMN_C2PMSG_72
#define MP1_SMN_C2PMSG_72__CONTENT__SHIFT 0x0
#define MP1_SMN_C2PMSG_72__CONTENT_MASK 0xFFFFFFFFL
//MP1_SMN_C2PMSG_73
#define MP1_SMN_C2PMSG_73__CONTENT__SHIFT 0x0
#define MP1_SMN_C2PMSG_73__CONTENT_MASK 0xFFFFFFFFL
//MP1_SMN_C2PMSG_74
#define MP1_SMN_C2PMSG_74__CONTENT__SHIFT 0x0
#define MP1_SMN_C2PMSG_74__CONTENT_MASK 0xFFFFFFFFL
//MP1_SMN_C2PMSG_75
#define MP1_SMN_C2PMSG_75__CONTENT__SHIFT 0x0
#define MP1_SMN_C2PMSG_75__CONTENT_MASK 0xFFFFFFFFL
//MP1_SMN_C2PMSG_76
#define MP1_SMN_C2PMSG_76__CONTENT__SHIFT 0x0
#define MP1_SMN_C2PMSG_76__CONTENT_MASK 0xFFFFFFFFL
//MP1_SMN_C2PMSG_77
#define MP1_SMN_C2PMSG_77__CONTENT__SHIFT 0x0
#define MP1_SMN_C2PMSG_77__CONTENT_MASK 0xFFFFFFFFL
//MP1_SMN_C2PMSG_78
#define MP1_SMN_C2PMSG_78__CONTENT__SHIFT 0x0
#define MP1_SMN_C2PMSG_78__CONTENT_MASK 0xFFFFFFFFL
//MP1_SMN_C2PMSG_79
#define MP1_SMN_C2PMSG_79__CONTENT__SHIFT 0x0
#define MP1_SMN_C2PMSG_79__CONTENT_MASK 0xFFFFFFFFL
//MP1_SMN_C2PMSG_80
#define MP1_SMN_C2PMSG_80__CONTENT__SHIFT 0x0
#define MP1_SMN_C2PMSG_80__CONTENT_MASK 0xFFFFFFFFL
//MP1_SMN_C2PMSG_81
#define MP1_SMN_C2PMSG_81__CONTENT__SHIFT 0x0
#define MP1_SMN_C2PMSG_81__CONTENT_MASK 0xFFFFFFFFL
//MP1_SMN_C2PMSG_82
#define MP1_SMN_C2PMSG_82__CONTENT__SHIFT 0x0
#define MP1_SMN_C2PMSG_82__CONTENT_MASK 0xFFFFFFFFL
//MP1_SMN_C2PMSG_83
#define MP1_SMN_C2PMSG_83__CONTENT__SHIFT 0x0
#define MP1_SMN_C2PMSG_83__CONTENT_MASK 0xFFFFFFFFL
//MP1_SMN_C2PMSG_84
#define MP1_SMN_C2PMSG_84__CONTENT__SHIFT 0x0
#define MP1_SMN_C2PMSG_84__CONTENT_MASK 0xFFFFFFFFL
//MP1_SMN_C2PMSG_85
#define MP1_SMN_C2PMSG_85__CONTENT__SHIFT 0x0
#define MP1_SMN_C2PMSG_85__CONTENT_MASK 0xFFFFFFFFL
//MP1_SMN_C2PMSG_86
#define MP1_SMN_C2PMSG_86__CONTENT__SHIFT 0x0
#define MP1_SMN_C2PMSG_86__CONTENT_MASK 0xFFFFFFFFL
//MP1_SMN_C2PMSG_87
#define MP1_SMN_C2PMSG_87__CONTENT__SHIFT 0x0
#define MP1_SMN_C2PMSG_87__CONTENT_MASK 0xFFFFFFFFL
//MP1_SMN_C2PMSG_88
#define MP1_SMN_C2PMSG_88__CONTENT__SHIFT 0x0
#define MP1_SMN_C2PMSG_88__CONTENT_MASK 0xFFFFFFFFL
//MP1_SMN_C2PMSG_89
#define MP1_SMN_C2PMSG_89__CONTENT__SHIFT 0x0
#define MP1_SMN_C2PMSG_89__CONTENT_MASK 0xFFFFFFFFL
//MP1_SMN_C2PMSG_90
#define MP1_SMN_C2PMSG_90__CONTENT__SHIFT 0x0
#define MP1_SMN_C2PMSG_90__CONTENT_MASK 0xFFFFFFFFL
//MP1_SMN_C2PMSG_91
#define MP1_SMN_C2PMSG_91__CONTENT__SHIFT 0x0
#define MP1_SMN_C2PMSG_91__CONTENT_MASK 0xFFFFFFFFL
//MP1_SMN_C2PMSG_92
#define MP1_SMN_C2PMSG_92__CONTENT__SHIFT 0x0
#define MP1_SMN_C2PMSG_92__CONTENT_MASK 0xFFFFFFFFL
//MP1_SMN_C2PMSG_93
#define MP1_SMN_C2PMSG_93__CONTENT__SHIFT 0x0
#define MP1_SMN_C2PMSG_93__CONTENT_MASK 0xFFFFFFFFL
//MP1_SMN_C2PMSG_94
#define MP1_SMN_C2PMSG_94__CONTENT__SHIFT 0x0
#define MP1_SMN_C2PMSG_94__CONTENT_MASK 0xFFFFFFFFL
//MP1_SMN_C2PMSG_95
#define MP1_SMN_C2PMSG_95__CONTENT__SHIFT 0x0
#define MP1_SMN_C2PMSG_95__CONTENT_MASK 0xFFFFFFFFL
//MP1_SMN_C2PMSG_96
#define MP1_SMN_C2PMSG_96__CONTENT__SHIFT 0x0
#define MP1_SMN_C2PMSG_96__CONTENT_MASK 0xFFFFFFFFL
//MP1_SMN_C2PMSG_97
#define MP1_SMN_C2PMSG_97__CONTENT__SHIFT 0x0
#define MP1_SMN_C2PMSG_97__CONTENT_MASK 0xFFFFFFFFL
//MP1_SMN_C2PMSG_98
#define MP1_SMN_C2PMSG_98__CONTENT__SHIFT 0x0
#define MP1_SMN_C2PMSG_98__CONTENT_MASK 0xFFFFFFFFL
//MP1_SMN_C2PMSG_99
#define MP1_SMN_C2PMSG_99__CONTENT__SHIFT 0x0
#define MP1_SMN_C2PMSG_99__CONTENT_MASK 0xFFFFFFFFL
//MP1_SMN_C2PMSG_100
#define MP1_SMN_C2PMSG_100__CONTENT__SHIFT 0x0
#define MP1_SMN_C2PMSG_100__CONTENT_MASK 0xFFFFFFFFL
//MP1_SMN_C2PMSG_101
#define MP1_SMN_C2PMSG_101__CONTENT__SHIFT 0x0
#define MP1_SMN_C2PMSG_101__CONTENT_MASK 0xFFFFFFFFL
//MP1_SMN_C2PMSG_102
#define MP1_SMN_C2PMSG_102__CONTENT__SHIFT 0x0
#define MP1_SMN_C2PMSG_102__CONTENT_MASK 0xFFFFFFFFL
//MP1_SMN_C2PMSG_103
#define MP1_SMN_C2PMSG_103__CONTENT__SHIFT 0x0
#define MP1_SMN_C2PMSG_103__CONTENT_MASK 0xFFFFFFFFL
//MP1_SMN_IH_CREDIT
#define MP1_SMN_IH_CREDIT__CREDIT_VALUE__SHIFT 0x0
#define MP1_SMN_IH_CREDIT__CLIENT_ID__SHIFT 0x10
#define MP1_SMN_IH_CREDIT__CREDIT_VALUE_MASK 0x00000003L
#define MP1_SMN_IH_CREDIT__CLIENT_ID_MASK 0x00FF0000L
//MP1_SMN_IH_SW_INT
#define MP1_SMN_IH_SW_INT__VALID__SHIFT 0x0
#define MP1_SMN_IH_SW_INT__ID__SHIFT 0x1
#define MP1_SMN_IH_SW_INT__VALID_MASK 0x00000001L
#define MP1_SMN_IH_SW_INT__ID_MASK 0x000001FEL
//MP1_SMN_IH_SW_INT_CTRL
#define MP1_SMN_IH_SW_INT_CTRL__SW_TRIG_MASK__SHIFT 0x0
#define MP1_SMN_IH_SW_INT_CTRL__SW_INT_ACK__SHIFT 0x8
#define MP1_SMN_IH_SW_INT_CTRL__SW_TRIG_MASK_MASK 0x00000001L
#define MP1_SMN_IH_SW_INT_CTRL__SW_INT_ACK_MASK 0x00000100L
//MP1_SMN_FPS_CNT
#define MP1_SMN_FPS_CNT__COUNT__SHIFT 0x0
#define MP1_SMN_FPS_CNT__COUNT_MASK 0xFFFFFFFFL
// addressBlock: mp_SmuMp0Pub_CruDec
//MP0_ACTIVE_FCN_ID
#define MP0_ACTIVE_FCN_ID__VFID__SHIFT 0x0
#define MP0_ACTIVE_FCN_ID__VF__SHIFT 0x1f
#define MP0_ACTIVE_FCN_ID__VFID_MASK 0x0000000FL
#define MP0_ACTIVE_FCN_ID__VF_MASK 0x80000000L
//MP0_IH_CREDIT
#define MP0_IH_CREDIT__CREDIT_VALUE__SHIFT 0x0
#define MP0_IH_CREDIT__CLIENT_ID__SHIFT 0x10
#define MP0_IH_CREDIT__CREDIT_VALUE_MASK 0x00000003L
#define MP0_IH_CREDIT__CLIENT_ID_MASK 0x00FF0000L
//MP0_IH_SW_INT
#define MP0_IH_SW_INT__ID__SHIFT 0x0
#define MP0_IH_SW_INT__VALID__SHIFT 0x8
#define MP0_IH_SW_INT__ID_MASK 0x000000FFL
#define MP0_IH_SW_INT__VALID_MASK 0x00000100L
//MP0_IH_SW_INT_CTRL
#define MP0_IH_SW_INT_CTRL__INT_MASK__SHIFT 0x0
#define MP0_IH_SW_INT_CTRL__INT_ACK__SHIFT 0x8
#define MP0_IH_SW_INT_CTRL__INT_MASK_MASK 0x00000001L
#define MP0_IH_SW_INT_CTRL__INT_ACK_MASK 0x00000100L
// addressBlock: mp_SmuMp1Pub_CruDec
//MP1_FIRMWARE_FLAGS
#define MP1_FIRMWARE_FLAGS__INTERRUPTS_ENABLED__SHIFT 0x0
#define MP1_FIRMWARE_FLAGS__RESERVED__SHIFT 0x1
#define MP1_FIRMWARE_FLAGS__INTERRUPTS_ENABLED_MASK 0x00000001L
#define MP1_FIRMWARE_FLAGS__RESERVED_MASK 0xFFFFFFFEL
//MP1_C2PMSG_0
#define MP1_C2PMSG_0__CONTENT__SHIFT 0x0
#define MP1_C2PMSG_0__CONTENT_MASK 0xFFFFFFFFL
//MP1_C2PMSG_1
#define MP1_C2PMSG_1__CONTENT__SHIFT 0x0
#define MP1_C2PMSG_1__CONTENT_MASK 0xFFFFFFFFL
//MP1_C2PMSG_2
#define MP1_C2PMSG_2__CONTENT__SHIFT 0x0
#define MP1_C2PMSG_2__CONTENT_MASK 0xFFFFFFFFL
//MP1_C2PMSG_3
#define MP1_C2PMSG_3__CONTENT__SHIFT 0x0
#define MP1_C2PMSG_3__CONTENT_MASK 0xFFFFFFFFL
//MP1_C2PMSG_4
#define MP1_C2PMSG_4__CONTENT__SHIFT 0x0
#define MP1_C2PMSG_4__CONTENT_MASK 0xFFFFFFFFL
//MP1_C2PMSG_5
#define MP1_C2PMSG_5__CONTENT__SHIFT 0x0
#define MP1_C2PMSG_5__CONTENT_MASK 0xFFFFFFFFL
//MP1_C2PMSG_6
#define MP1_C2PMSG_6__CONTENT__SHIFT 0x0
#define MP1_C2PMSG_6__CONTENT_MASK 0xFFFFFFFFL
//MP1_C2PMSG_7
#define MP1_C2PMSG_7__CONTENT__SHIFT 0x0
#define MP1_C2PMSG_7__CONTENT_MASK 0xFFFFFFFFL
//MP1_C2PMSG_8
#define MP1_C2PMSG_8__CONTENT__SHIFT 0x0
#define MP1_C2PMSG_8__CONTENT_MASK 0xFFFFFFFFL
//MP1_C2PMSG_9
#define MP1_C2PMSG_9__CONTENT__SHIFT 0x0
#define MP1_C2PMSG_9__CONTENT_MASK 0xFFFFFFFFL
//MP1_C2PMSG_10
#define MP1_C2PMSG_10__CONTENT__SHIFT 0x0
#define MP1_C2PMSG_10__CONTENT_MASK 0xFFFFFFFFL
//MP1_C2PMSG_11
#define MP1_C2PMSG_11__CONTENT__SHIFT 0x0
#define MP1_C2PMSG_11__CONTENT_MASK 0xFFFFFFFFL
//MP1_C2PMSG_12
#define MP1_C2PMSG_12__CONTENT__SHIFT 0x0
#define MP1_C2PMSG_12__CONTENT_MASK 0xFFFFFFFFL
//MP1_C2PMSG_13
#define MP1_C2PMSG_13__CONTENT__SHIFT 0x0
#define MP1_C2PMSG_13__CONTENT_MASK 0xFFFFFFFFL
//MP1_C2PMSG_14
#define MP1_C2PMSG_14__CONTENT__SHIFT 0x0
#define MP1_C2PMSG_14__CONTENT_MASK 0xFFFFFFFFL
//MP1_C2PMSG_15
#define MP1_C2PMSG_15__CONTENT__SHIFT 0x0
#define MP1_C2PMSG_15__CONTENT_MASK 0xFFFFFFFFL
//MP1_C2PMSG_16
#define MP1_C2PMSG_16__CONTENT__SHIFT 0x0
#define MP1_C2PMSG_16__CONTENT_MASK 0xFFFFFFFFL
//MP1_C2PMSG_17
#define MP1_C2PMSG_17__CONTENT__SHIFT 0x0
#define MP1_C2PMSG_17__CONTENT_MASK 0xFFFFFFFFL
//MP1_C2PMSG_18
#define MP1_C2PMSG_18__CONTENT__SHIFT 0x0
#define MP1_C2PMSG_18__CONTENT_MASK 0xFFFFFFFFL
//MP1_C2PMSG_19
#define MP1_C2PMSG_19__CONTENT__SHIFT 0x0
#define MP1_C2PMSG_19__CONTENT_MASK 0xFFFFFFFFL
//MP1_C2PMSG_20
#define MP1_C2PMSG_20__CONTENT__SHIFT 0x0
#define MP1_C2PMSG_20__CONTENT_MASK 0xFFFFFFFFL
//MP1_C2PMSG_21
#define MP1_C2PMSG_21__CONTENT__SHIFT 0x0
#define MP1_C2PMSG_21__CONTENT_MASK 0xFFFFFFFFL
//MP1_C2PMSG_22
#define MP1_C2PMSG_22__CONTENT__SHIFT 0x0
#define MP1_C2PMSG_22__CONTENT_MASK 0xFFFFFFFFL
//MP1_C2PMSG_23
#define MP1_C2PMSG_23__CONTENT__SHIFT 0x0
#define MP1_C2PMSG_23__CONTENT_MASK 0xFFFFFFFFL
//MP1_C2PMSG_24
#define MP1_C2PMSG_24__CONTENT__SHIFT 0x0
#define MP1_C2PMSG_24__CONTENT_MASK 0xFFFFFFFFL
//MP1_C2PMSG_25
#define MP1_C2PMSG_25__CONTENT__SHIFT 0x0
#define MP1_C2PMSG_25__CONTENT_MASK 0xFFFFFFFFL
//MP1_C2PMSG_26
#define MP1_C2PMSG_26__CONTENT__SHIFT 0x0
#define MP1_C2PMSG_26__CONTENT_MASK 0xFFFFFFFFL
//MP1_C2PMSG_27
#define MP1_C2PMSG_27__CONTENT__SHIFT 0x0
#define MP1_C2PMSG_27__CONTENT_MASK 0xFFFFFFFFL
//MP1_C2PMSG_28
#define MP1_C2PMSG_28__CONTENT__SHIFT 0x0
#define MP1_C2PMSG_28__CONTENT_MASK 0xFFFFFFFFL
//MP1_C2PMSG_29
#define MP1_C2PMSG_29__CONTENT__SHIFT 0x0
#define MP1_C2PMSG_29__CONTENT_MASK 0xFFFFFFFFL
//MP1_C2PMSG_30
#define MP1_C2PMSG_30__CONTENT__SHIFT 0x0
#define MP1_C2PMSG_30__CONTENT_MASK 0xFFFFFFFFL
//MP1_C2PMSG_31
#define MP1_C2PMSG_31__CONTENT__SHIFT 0x0
#define MP1_C2PMSG_31__CONTENT_MASK 0xFFFFFFFFL
//MP1_P2CMSG_0
#define MP1_P2CMSG_0__CONTENT__SHIFT 0x0
#define MP1_P2CMSG_0__CONTENT_MASK 0xFFFFFFFFL
//MP1_P2CMSG_1
#define MP1_P2CMSG_1__CONTENT__SHIFT 0x0
#define MP1_P2CMSG_1__CONTENT_MASK 0xFFFFFFFFL
//MP1_P2CMSG_2
#define MP1_P2CMSG_2__CONTENT__SHIFT 0x0
#define MP1_P2CMSG_2__CONTENT_MASK 0xFFFFFFFFL
//MP1_P2CMSG_3
#define MP1_P2CMSG_3__CONTENT__SHIFT 0x0
#define MP1_P2CMSG_3__CONTENT_MASK 0xFFFFFFFFL
//MP1_P2CMSG_INTEN
#define MP1_P2CMSG_INTEN__INTEN__SHIFT 0x0
#define MP1_P2CMSG_INTEN__INTEN_MASK 0x0000000FL
//MP1_P2CMSG_INTSTS
#define MP1_P2CMSG_INTSTS__INTSTS0__SHIFT 0x0
#define MP1_P2CMSG_INTSTS__INTSTS1__SHIFT 0x1
#define MP1_P2CMSG_INTSTS__INTSTS2__SHIFT 0x2
#define MP1_P2CMSG_INTSTS__INTSTS3__SHIFT 0x3
#define MP1_P2CMSG_INTSTS__INTSTS0_MASK 0x00000001L
#define MP1_P2CMSG_INTSTS__INTSTS1_MASK 0x00000002L
#define MP1_P2CMSG_INTSTS__INTSTS2_MASK 0x00000004L
#define MP1_P2CMSG_INTSTS__INTSTS3_MASK 0x00000008L
//MP1_C2PMSG_32
#define MP1_C2PMSG_32__CONTENT__SHIFT 0x0
#define MP1_C2PMSG_32__CONTENT_MASK 0xFFFFFFFFL
//MP1_C2PMSG_33
#define MP1_C2PMSG_33__CONTENT__SHIFT 0x0
#define MP1_C2PMSG_33__CONTENT_MASK 0xFFFFFFFFL
//MP1_C2PMSG_34
#define MP1_C2PMSG_34__CONTENT__SHIFT 0x0
#define MP1_C2PMSG_34__CONTENT_MASK 0xFFFFFFFFL
//MP1_C2PMSG_35
#define MP1_C2PMSG_35__CONTENT__SHIFT 0x0
#define MP1_C2PMSG_35__CONTENT_MASK 0xFFFFFFFFL
//MP1_C2PMSG_36
#define MP1_C2PMSG_36__CONTENT__SHIFT 0x0
#define MP1_C2PMSG_36__CONTENT_MASK 0xFFFFFFFFL
//MP1_C2PMSG_37
#define MP1_C2PMSG_37__CONTENT__SHIFT 0x0
#define MP1_C2PMSG_37__CONTENT_MASK 0xFFFFFFFFL
//MP1_C2PMSG_38
#define MP1_C2PMSG_38__CONTENT__SHIFT 0x0
#define MP1_C2PMSG_38__CONTENT_MASK 0xFFFFFFFFL
//MP1_C2PMSG_39
#define MP1_C2PMSG_39__CONTENT__SHIFT 0x0
#define MP1_C2PMSG_39__CONTENT_MASK 0xFFFFFFFFL
//MP1_C2PMSG_40
#define MP1_C2PMSG_40__CONTENT__SHIFT 0x0
#define MP1_C2PMSG_40__CONTENT_MASK 0xFFFFFFFFL
//MP1_C2PMSG_41
#define MP1_C2PMSG_41__CONTENT__SHIFT 0x0
#define MP1_C2PMSG_41__CONTENT_MASK 0xFFFFFFFFL
//MP1_C2PMSG_42
#define MP1_C2PMSG_42__CONTENT__SHIFT 0x0
#define MP1_C2PMSG_42__CONTENT_MASK 0xFFFFFFFFL
//MP1_C2PMSG_43
#define MP1_C2PMSG_43__CONTENT__SHIFT 0x0
#define MP1_C2PMSG_43__CONTENT_MASK 0xFFFFFFFFL
//MP1_C2PMSG_44
#define MP1_C2PMSG_44__CONTENT__SHIFT 0x0
#define MP1_C2PMSG_44__CONTENT_MASK 0xFFFFFFFFL
//MP1_C2PMSG_45
#define MP1_C2PMSG_45__CONTENT__SHIFT 0x0
#define MP1_C2PMSG_45__CONTENT_MASK 0xFFFFFFFFL
//MP1_C2PMSG_46
#define MP1_C2PMSG_46__CONTENT__SHIFT 0x0
#define MP1_C2PMSG_46__CONTENT_MASK 0xFFFFFFFFL
//MP1_C2PMSG_47
#define MP1_C2PMSG_47__CONTENT__SHIFT 0x0
#define MP1_C2PMSG_47__CONTENT_MASK 0xFFFFFFFFL
//MP1_C2PMSG_48
#define MP1_C2PMSG_48__CONTENT__SHIFT 0x0
#define MP1_C2PMSG_48__CONTENT_MASK 0xFFFFFFFFL
//MP1_C2PMSG_49
#define MP1_C2PMSG_49__CONTENT__SHIFT 0x0
#define MP1_C2PMSG_49__CONTENT_MASK 0xFFFFFFFFL
//MP1_C2PMSG_50
#define MP1_C2PMSG_50__CONTENT__SHIFT 0x0
#define MP1_C2PMSG_50__CONTENT_MASK 0xFFFFFFFFL
//MP1_C2PMSG_51
#define MP1_C2PMSG_51__CONTENT__SHIFT 0x0
#define MP1_C2PMSG_51__CONTENT_MASK 0xFFFFFFFFL
//MP1_C2PMSG_52
#define MP1_C2PMSG_52__CONTENT__SHIFT 0x0
#define MP1_C2PMSG_52__CONTENT_MASK 0xFFFFFFFFL
//MP1_C2PMSG_53
#define MP1_C2PMSG_53__CONTENT__SHIFT 0x0
#define MP1_C2PMSG_53__CONTENT_MASK 0xFFFFFFFFL
//MP1_C2PMSG_54
#define MP1_C2PMSG_54__CONTENT__SHIFT 0x0
#define MP1_C2PMSG_54__CONTENT_MASK 0xFFFFFFFFL
//MP1_C2PMSG_55
#define MP1_C2PMSG_55__CONTENT__SHIFT 0x0
#define MP1_C2PMSG_55__CONTENT_MASK 0xFFFFFFFFL
//MP1_C2PMSG_56
#define MP1_C2PMSG_56__CONTENT__SHIFT 0x0
#define MP1_C2PMSG_56__CONTENT_MASK 0xFFFFFFFFL
//MP1_C2PMSG_57
#define MP1_C2PMSG_57__CONTENT__SHIFT 0x0
#define MP1_C2PMSG_57__CONTENT_MASK 0xFFFFFFFFL
//MP1_C2PMSG_58
#define MP1_C2PMSG_58__CONTENT__SHIFT 0x0
#define MP1_C2PMSG_58__CONTENT_MASK 0xFFFFFFFFL
//MP1_C2PMSG_59
#define MP1_C2PMSG_59__CONTENT__SHIFT 0x0
#define MP1_C2PMSG_59__CONTENT_MASK 0xFFFFFFFFL
//MP1_C2PMSG_60
#define MP1_C2PMSG_60__CONTENT__SHIFT 0x0
#define MP1_C2PMSG_60__CONTENT_MASK 0xFFFFFFFFL
//MP1_C2PMSG_61
#define MP1_C2PMSG_61__CONTENT__SHIFT 0x0
#define MP1_C2PMSG_61__CONTENT_MASK 0xFFFFFFFFL
//MP1_C2PMSG_62
#define MP1_C2PMSG_62__CONTENT__SHIFT 0x0
#define MP1_C2PMSG_62__CONTENT_MASK 0xFFFFFFFFL
//MP1_C2PMSG_63
#define MP1_C2PMSG_63__CONTENT__SHIFT 0x0
#define MP1_C2PMSG_63__CONTENT_MASK 0xFFFFFFFFL
//MP1_C2PMSG_64
#define MP1_C2PMSG_64__CONTENT__SHIFT 0x0
#define MP1_C2PMSG_64__CONTENT_MASK 0xFFFFFFFFL
//MP1_C2PMSG_65
#define MP1_C2PMSG_65__CONTENT__SHIFT 0x0
#define MP1_C2PMSG_65__CONTENT_MASK 0xFFFFFFFFL
//MP1_C2PMSG_66
#define MP1_C2PMSG_66__CONTENT__SHIFT 0x0
#define MP1_C2PMSG_66__CONTENT_MASK 0xFFFFFFFFL
//MP1_C2PMSG_67
#define MP1_C2PMSG_67__CONTENT__SHIFT 0x0
#define MP1_C2PMSG_67__CONTENT_MASK 0xFFFFFFFFL
//MP1_C2PMSG_68
#define MP1_C2PMSG_68__CONTENT__SHIFT 0x0
#define MP1_C2PMSG_68__CONTENT_MASK 0xFFFFFFFFL
//MP1_C2PMSG_69
#define MP1_C2PMSG_69__CONTENT__SHIFT 0x0
#define MP1_C2PMSG_69__CONTENT_MASK 0xFFFFFFFFL
//MP1_C2PMSG_70
#define MP1_C2PMSG_70__CONTENT__SHIFT 0x0
#define MP1_C2PMSG_70__CONTENT_MASK 0xFFFFFFFFL
//MP1_C2PMSG_71
#define MP1_C2PMSG_71__CONTENT__SHIFT 0x0
#define MP1_C2PMSG_71__CONTENT_MASK 0xFFFFFFFFL
//MP1_C2PMSG_72
#define MP1_C2PMSG_72__CONTENT__SHIFT 0x0
#define MP1_C2PMSG_72__CONTENT_MASK 0xFFFFFFFFL
//MP1_C2PMSG_73
#define MP1_C2PMSG_73__CONTENT__SHIFT 0x0
#define MP1_C2PMSG_73__CONTENT_MASK 0xFFFFFFFFL
//MP1_C2PMSG_74
#define MP1_C2PMSG_74__CONTENT__SHIFT 0x0
#define MP1_C2PMSG_74__CONTENT_MASK 0xFFFFFFFFL
//MP1_C2PMSG_75
#define MP1_C2PMSG_75__CONTENT__SHIFT 0x0
#define MP1_C2PMSG_75__CONTENT_MASK 0xFFFFFFFFL
//MP1_C2PMSG_76
#define MP1_C2PMSG_76__CONTENT__SHIFT 0x0
#define MP1_C2PMSG_76__CONTENT_MASK 0xFFFFFFFFL
//MP1_C2PMSG_77
#define MP1_C2PMSG_77__CONTENT__SHIFT 0x0
#define MP1_C2PMSG_77__CONTENT_MASK 0xFFFFFFFFL
//MP1_C2PMSG_78
#define MP1_C2PMSG_78__CONTENT__SHIFT 0x0
#define MP1_C2PMSG_78__CONTENT_MASK 0xFFFFFFFFL
//MP1_C2PMSG_79
#define MP1_C2PMSG_79__CONTENT__SHIFT 0x0
#define MP1_C2PMSG_79__CONTENT_MASK 0xFFFFFFFFL
//MP1_C2PMSG_80
#define MP1_C2PMSG_80__CONTENT__SHIFT 0x0
#define MP1_C2PMSG_80__CONTENT_MASK 0xFFFFFFFFL
//MP1_C2PMSG_81
#define MP1_C2PMSG_81__CONTENT__SHIFT 0x0
#define MP1_C2PMSG_81__CONTENT_MASK 0xFFFFFFFFL
//MP1_C2PMSG_82
#define MP1_C2PMSG_82__CONTENT__SHIFT 0x0
#define MP1_C2PMSG_82__CONTENT_MASK 0xFFFFFFFFL
//MP1_C2PMSG_83
#define MP1_C2PMSG_83__CONTENT__SHIFT 0x0
#define MP1_C2PMSG_83__CONTENT_MASK 0xFFFFFFFFL
//MP1_C2PMSG_84
#define MP1_C2PMSG_84__CONTENT__SHIFT 0x0
#define MP1_C2PMSG_84__CONTENT_MASK 0xFFFFFFFFL
//MP1_C2PMSG_85
#define MP1_C2PMSG_85__CONTENT__SHIFT 0x0
#define MP1_C2PMSG_85__CONTENT_MASK 0xFFFFFFFFL
//MP1_C2PMSG_86
#define MP1_C2PMSG_86__CONTENT__SHIFT 0x0
#define MP1_C2PMSG_86__CONTENT_MASK 0xFFFFFFFFL
//MP1_C2PMSG_87
#define MP1_C2PMSG_87__CONTENT__SHIFT 0x0
#define MP1_C2PMSG_87__CONTENT_MASK 0xFFFFFFFFL
//MP1_C2PMSG_88
#define MP1_C2PMSG_88__CONTENT__SHIFT 0x0
#define MP1_C2PMSG_88__CONTENT_MASK 0xFFFFFFFFL
//MP1_C2PMSG_89
#define MP1_C2PMSG_89__CONTENT__SHIFT 0x0
#define MP1_C2PMSG_89__CONTENT_MASK 0xFFFFFFFFL
//MP1_C2PMSG_90
#define MP1_C2PMSG_90__CONTENT__SHIFT 0x0
#define MP1_C2PMSG_90__CONTENT_MASK 0xFFFFFFFFL
//MP1_C2PMSG_91
#define MP1_C2PMSG_91__CONTENT__SHIFT 0x0
#define MP1_C2PMSG_91__CONTENT_MASK 0xFFFFFFFFL
//MP1_C2PMSG_92
#define MP1_C2PMSG_92__CONTENT__SHIFT 0x0
#define MP1_C2PMSG_92__CONTENT_MASK 0xFFFFFFFFL
//MP1_C2PMSG_93
#define MP1_C2PMSG_93__CONTENT__SHIFT 0x0
#define MP1_C2PMSG_93__CONTENT_MASK 0xFFFFFFFFL
//MP1_C2PMSG_94
#define MP1_C2PMSG_94__CONTENT__SHIFT 0x0
#define MP1_C2PMSG_94__CONTENT_MASK 0xFFFFFFFFL
//MP1_C2PMSG_95
#define MP1_C2PMSG_95__CONTENT__SHIFT 0x0
#define MP1_C2PMSG_95__CONTENT_MASK 0xFFFFFFFFL
//MP1_C2PMSG_96
#define MP1_C2PMSG_96__CONTENT__SHIFT 0x0
#define MP1_C2PMSG_96__CONTENT_MASK 0xFFFFFFFFL
//MP1_C2PMSG_97
#define MP1_C2PMSG_97__CONTENT__SHIFT 0x0
#define MP1_C2PMSG_97__CONTENT_MASK 0xFFFFFFFFL
//MP1_C2PMSG_98
#define MP1_C2PMSG_98__CONTENT__SHIFT 0x0
#define MP1_C2PMSG_98__CONTENT_MASK 0xFFFFFFFFL
//MP1_C2PMSG_99
#define MP1_C2PMSG_99__CONTENT__SHIFT 0x0
#define MP1_C2PMSG_99__CONTENT_MASK 0xFFFFFFFFL
//MP1_C2PMSG_100
#define MP1_C2PMSG_100__CONTENT__SHIFT 0x0
#define MP1_C2PMSG_100__CONTENT_MASK 0xFFFFFFFFL
//MP1_C2PMSG_101
#define MP1_C2PMSG_101__CONTENT__SHIFT 0x0
#define MP1_C2PMSG_101__CONTENT_MASK 0xFFFFFFFFL
//MP1_C2PMSG_102
#define MP1_C2PMSG_102__CONTENT__SHIFT 0x0
#define MP1_C2PMSG_102__CONTENT_MASK 0xFFFFFFFFL
//MP1_C2PMSG_103
#define MP1_C2PMSG_103__CONTENT__SHIFT 0x0
#define MP1_C2PMSG_103__CONTENT_MASK 0xFFFFFFFFL
//MP1_ACTIVE_FCN_ID
#define MP1_ACTIVE_FCN_ID__VFID__SHIFT 0x0
#define MP1_ACTIVE_FCN_ID__VF__SHIFT 0x1f
#define MP1_ACTIVE_FCN_ID__VFID_MASK 0x0000000FL
#define MP1_ACTIVE_FCN_ID__VF_MASK 0x80000000L
//MP1_IH_CREDIT
#define MP1_IH_CREDIT__CREDIT_VALUE__SHIFT 0x0
#define MP1_IH_CREDIT__CLIENT_ID__SHIFT 0x10
#define MP1_IH_CREDIT__CREDIT_VALUE_MASK 0x00000003L
#define MP1_IH_CREDIT__CLIENT_ID_MASK 0x00FF0000L
//MP1_IH_SW_INT
#define MP1_IH_SW_INT__ID__SHIFT 0x0
#define MP1_IH_SW_INT__VALID__SHIFT 0x8
#define MP1_IH_SW_INT__ID_MASK 0x000000FFL
#define MP1_IH_SW_INT__VALID_MASK 0x00000100L
//MP1_IH_SW_INT_CTRL
#define MP1_IH_SW_INT_CTRL__INT_MASK__SHIFT 0x0
#define MP1_IH_SW_INT_CTRL__INT_ACK__SHIFT 0x8
#define MP1_IH_SW_INT_CTRL__INT_MASK_MASK 0x00000001L
#define MP1_IH_SW_INT_CTRL__INT_ACK_MASK 0x00000100L
//MP1_FPS_CNT
#define MP1_FPS_CNT__COUNT__SHIFT 0x0
#define MP1_FPS_CNT__COUNT_MASK 0xFFFFFFFFL
#endif
```
|
```go
package get_test
import (
"fmt"
. "github.com/onsi/ginkgo/v2"
. "github.com/onsi/gomega"
"github.com/werf/werf/v2/test/pkg/utils"
)
var _ = Describe("helm get-something", func() {
envName := "test"
BeforeEach(func() {
SuiteData.CommitProjectWorktree(SuiteData.ProjectName, utils.FixturePath("base"), "initial commit")
SuiteData.Stubs.SetEnv("WERF_ENV", envName)
})
It("should receive release name (default scheme)", func() {
output := utils.SucceedCommandOutputString(
SuiteData.GetProjectWorktree(SuiteData.ProjectName),
SuiteData.WerfBinPath,
"helm", "get-release",
)
(output).Should(ContainSubstring(utils.ProjectName() + "-" + envName))
})
It("should receive namespace name (default scheme)", func() {
output := utils.SucceedCommandOutputString(
SuiteData.GetProjectWorktree(SuiteData.ProjectName),
SuiteData.WerfBinPath,
"helm", "get-namespace",
)
(output).Should(ContainSubstring(utils.ProjectName() + "-" + envName))
})
It("should receive namespace name (default scheme)", func() {
output := utils.SucceedCommandOutputString(
SuiteData.GetProjectWorktree(SuiteData.ProjectName),
SuiteData.WerfBinPath,
"helm", "get-namespace",
)
(output).Should(ContainSubstring(utils.ProjectName() + "-" + envName))
})
It("should receive autogenerated values", func() {
output := utils.SucceedCommandOutputString(
SuiteData.GetProjectWorktree(SuiteData.ProjectName),
SuiteData.WerfBinPath,
"helm", "get-autogenerated-values", "--stub-tags",
)
for _, substrFormat := range []string{
"env: %[2]s",
"namespace: %[1]s-%[2]s",
"name: %[1]s",
} {
(output).Should(ContainSubstring(fmt.Sprintf(substrFormat, utils.ProjectName(), envName)))
}
})
})
```
|
Bent Creek is an unincorporated community in the Ramseytown Township of Yancey County, North Carolina, United States.
Geography
Bent Creek is located at (36.012611, -82.385967), about north-northeast of Mars Hill, about north-northeast of Weaverville, about north-northeast of Asheville, and about southwest of Washington, D.C. It lies 2277 feet (694 m) above sea level.
References
Unincorporated communities in North Carolina
Unincorporated communities in Yancey County, North Carolina
|
Sir Charles Wathen (19 March 1833 - 14 February 1893) was a prominent Victorian wool merchant who from 1865 to 1887 ran the well-known British clothing firm of Wathen Gardiner & Co, and served six times as Mayor of Bristol.
He was knighted for his accomplishments on 1 January 1889 during his fourth term as mayor by Queen Victoria. He died on 14 February 1893 shortly after collapsing on the floor of the Bristol City council chamber at the conclusion of an address he had just given to the city fathers. His grave in the Arnos Vale Cemetery is marked by a stone memorial with an epitaph that identifies him as "Charles Wathen, Kt. who died suddenly in the Council Chamber."
References
Mayors of Bristol
1893 deaths
Businesspeople from Bristol
1833 births
Knights Bachelor
|
Qarghiliq is a neighborhood in Kashgar, in the Xinjiang Uyghur Autonomous Region of China.
Kashgar
Neighbourhoods in China
|
"Get Up Stand Up" is a 2004 song by the Italian dance project Stellar Project, created by songwriter and producer Stefano Sorrentino, featuring American actress and singer Brandi Emma.
The song reached number one on the US dance airplay chart dated 20 November 2004. The song also reached number 14 on the UK Singles Chart in 2004.
Track listing
"Get Up Stand Up" (Phunk Investigation Radio Mix) – 2:55
"Get Up Stand Up" (Phunk Investigation Club Vocal Mix) – 7:46
"Get Up Stand Up" (F & W Remix) – 6:11
"Get Up Stand Up" (Paul Jackson Head Banger Mix) – 6:56
"Get Up Stand Up" (Phunk Investigation ElettroDub Mix) – 7:48
Charts
References
2004 singles
2004 songs
House music songs
Universal Music Group singles
|
```go
// Code generated by protoc-gen-go-grpc. DO NOT EDIT.
// versions:
// - protoc-gen-go-grpc v1.5.1
// - protoc (unknown)
// source: cosmos/protocolpool/v1/query.proto
package protocolpoolv1
import (
context "context"
grpc "google.golang.org/grpc"
codes "google.golang.org/grpc/codes"
status "google.golang.org/grpc/status"
)
// This is a compile-time assertion to ensure that this generated file
// is compatible with the grpc package it is being compiled against.
// Requires gRPC-Go v1.64.0 or later.
const _ = grpc.SupportPackageIsVersion9
const (
Query_CommunityPool_FullMethodName = "/cosmos.protocolpool.v1.Query/CommunityPool"
Query_UnclaimedBudget_FullMethodName = "/cosmos.protocolpool.v1.Query/UnclaimedBudget"
)
// QueryClient is the client API for Query service.
//
// For semantics around ctx use and closing/ending streaming RPCs, please refer to path_to_url#ClientConn.NewStream.
//
// Query defines the gRPC querier service for community pool module.
type QueryClient interface {
// CommunityPool queries the community pool coins.
CommunityPool(ctx context.Context, in *QueryCommunityPoolRequest, opts ...grpc.CallOption) (*QueryCommunityPoolResponse, error)
// UnclaimedBudget queries the remaining budget left to be claimed and it gives overall budget allocation view.
UnclaimedBudget(ctx context.Context, in *QueryUnclaimedBudgetRequest, opts ...grpc.CallOption) (*QueryUnclaimedBudgetResponse, error)
}
type queryClient struct {
cc grpc.ClientConnInterface
}
func NewQueryClient(cc grpc.ClientConnInterface) QueryClient {
return &queryClient{cc}
}
func (c *queryClient) CommunityPool(ctx context.Context, in *QueryCommunityPoolRequest, opts ...grpc.CallOption) (*QueryCommunityPoolResponse, error) {
cOpts := append([]grpc.CallOption{grpc.StaticMethod()}, opts...)
out := new(QueryCommunityPoolResponse)
err := c.cc.Invoke(ctx, Query_CommunityPool_FullMethodName, in, out, cOpts...)
if err != nil {
return nil, err
}
return out, nil
}
func (c *queryClient) UnclaimedBudget(ctx context.Context, in *QueryUnclaimedBudgetRequest, opts ...grpc.CallOption) (*QueryUnclaimedBudgetResponse, error) {
cOpts := append([]grpc.CallOption{grpc.StaticMethod()}, opts...)
out := new(QueryUnclaimedBudgetResponse)
err := c.cc.Invoke(ctx, Query_UnclaimedBudget_FullMethodName, in, out, cOpts...)
if err != nil {
return nil, err
}
return out, nil
}
// QueryServer is the server API for Query service.
// All implementations must embed UnimplementedQueryServer
// for forward compatibility.
//
// Query defines the gRPC querier service for community pool module.
type QueryServer interface {
// CommunityPool queries the community pool coins.
CommunityPool(context.Context, *QueryCommunityPoolRequest) (*QueryCommunityPoolResponse, error)
// UnclaimedBudget queries the remaining budget left to be claimed and it gives overall budget allocation view.
UnclaimedBudget(context.Context, *QueryUnclaimedBudgetRequest) (*QueryUnclaimedBudgetResponse, error)
mustEmbedUnimplementedQueryServer()
}
// UnimplementedQueryServer must be embedded to have
// forward compatible implementations.
//
// NOTE: this should be embedded by value instead of pointer to avoid a nil
// pointer dereference when methods are called.
type UnimplementedQueryServer struct{}
func (UnimplementedQueryServer) CommunityPool(context.Context, *QueryCommunityPoolRequest) (*QueryCommunityPoolResponse, error) {
return nil, status.Errorf(codes.Unimplemented, "method CommunityPool not implemented")
}
func (UnimplementedQueryServer) UnclaimedBudget(context.Context, *QueryUnclaimedBudgetRequest) (*QueryUnclaimedBudgetResponse, error) {
return nil, status.Errorf(codes.Unimplemented, "method UnclaimedBudget not implemented")
}
func (UnimplementedQueryServer) mustEmbedUnimplementedQueryServer() {}
func (UnimplementedQueryServer) testEmbeddedByValue() {}
// UnsafeQueryServer may be embedded to opt out of forward compatibility for this service.
// Use of this interface is not recommended, as added methods to QueryServer will
// result in compilation errors.
type UnsafeQueryServer interface {
mustEmbedUnimplementedQueryServer()
}
func RegisterQueryServer(s grpc.ServiceRegistrar, srv QueryServer) {
// If the following call pancis, it indicates UnimplementedQueryServer was
// embedded by pointer and is nil. This will cause panics if an
// unimplemented method is ever invoked, so we test this at initialization
// time to prevent it from happening at runtime later due to I/O.
if t, ok := srv.(interface{ testEmbeddedByValue() }); ok {
t.testEmbeddedByValue()
}
s.RegisterService(&Query_ServiceDesc, srv)
}
func _Query_CommunityPool_Handler(srv interface{}, ctx context.Context, dec func(interface{}) error, interceptor grpc.UnaryServerInterceptor) (interface{}, error) {
in := new(QueryCommunityPoolRequest)
if err := dec(in); err != nil {
return nil, err
}
if interceptor == nil {
return srv.(QueryServer).CommunityPool(ctx, in)
}
info := &grpc.UnaryServerInfo{
Server: srv,
FullMethod: Query_CommunityPool_FullMethodName,
}
handler := func(ctx context.Context, req interface{}) (interface{}, error) {
return srv.(QueryServer).CommunityPool(ctx, req.(*QueryCommunityPoolRequest))
}
return interceptor(ctx, in, info, handler)
}
func _Query_UnclaimedBudget_Handler(srv interface{}, ctx context.Context, dec func(interface{}) error, interceptor grpc.UnaryServerInterceptor) (interface{}, error) {
in := new(QueryUnclaimedBudgetRequest)
if err := dec(in); err != nil {
return nil, err
}
if interceptor == nil {
return srv.(QueryServer).UnclaimedBudget(ctx, in)
}
info := &grpc.UnaryServerInfo{
Server: srv,
FullMethod: Query_UnclaimedBudget_FullMethodName,
}
handler := func(ctx context.Context, req interface{}) (interface{}, error) {
return srv.(QueryServer).UnclaimedBudget(ctx, req.(*QueryUnclaimedBudgetRequest))
}
return interceptor(ctx, in, info, handler)
}
// Query_ServiceDesc is the grpc.ServiceDesc for Query service.
// It's only intended for direct use with grpc.RegisterService,
// and not to be introspected or modified (even as a copy)
var Query_ServiceDesc = grpc.ServiceDesc{
ServiceName: "cosmos.protocolpool.v1.Query",
HandlerType: (*QueryServer)(nil),
Methods: []grpc.MethodDesc{
{
MethodName: "CommunityPool",
Handler: _Query_CommunityPool_Handler,
},
{
MethodName: "UnclaimedBudget",
Handler: _Query_UnclaimedBudget_Handler,
},
},
Streams: []grpc.StreamDesc{},
Metadata: "cosmos/protocolpool/v1/query.proto",
}
```
|
A bookshelf game, sometimes known as a bookcase game, is a style of boardgame published mostly in the 1970s and 1980s.
The two best-known examples of bookshelf games are a series by 3M and much of Avalon Hill's catalog of the 1980s.
References
Board games
Book terminology
|
Brașov County () is a county (județ) of Romania, in Transylvania. Its capital city is Brașov. The county incorporates within its boundaries most of the Medieval "lands" (țări) Burzenland and Făgăraș.
Name
In Hungarian, it is known as Brassó megye, and in German as Kreis Kronstadt. Under Austria-Hungary, a county with an identical name (Brassó County, ) was created in 1876, covering a smaller area.
Demographics
On 20 October 2011, the county had a population of 549,217 and the population density was .
Romanians – 87.4%
Hungarians – 7.77%
Romas – 3.5%
Germans (Transylvanian Saxons) – 0.65%
On 2021, the county had a population of 546,615 and the population density was .
Romanians – 88.33%
Hungarians – 5,98%
Romas – 4.98%
Germans (Transylvanian Saxons) – 0.40%
Traditionally the Romanian population was concentrated in the west and southwest of the county, the Hungarians in the east part of the county, and the Germans in the north and around Brașov city.
Geography
The county has a total area of .
The south side comprises the Carpathian Mountains (Southern Carpathians and Eastern Carpathians), with the Făgăraș Mountains, the Bucegi Mountains, the Piatra Mare Mountains, the Piatra Craiului Mountains, and the Postăvarul Massif. In the east, there is the , and in the west, there is the Olt River valley. Between them, there are the Perșani Mountains. The north and west sides of the county are crossed by the Olt River.
In the southern and central part of Brașov County lies the Burzenland, bordered approximately by Apața in the north, Bran in the southwest and Prejmer in the east, with Brașov roughly in its center. To the west lies Țara Făgărașului, bordered to the north by the Olt and to the south by the Făgăraș Mountains; its main city is Făgăraș.
Neighbours
Covasna County in the east.
Sibiu County in the west.
Mureș County and Harghita County in the north.
Argeș County, Dâmbovița County, and Prahova County in the south.
Buzău County in the southeast.
Economy
Brașov County is one of the most prosperous regions of Romania and has a tradition of industry. During World War II, IAR 80 and towards the end of the war, Bf 109, fighter aircraft were built in Brașov. During the communist period the county was heavily industrialized, which left it with some very large industrial complexes. Some of them managed to survive and adapt to the capitalist type market economy, but some did not, leading to a high rate of unemployment. Due to new investments, mainly foreign, the economy managed to partially recover.
The predominant industries in the county are:
Mechanical and automotive industry.
Chemical industry.
Construction materials.
Food industry.
Around Victoria there were big chemical complexes that polluted the region.
Tourism
Brașov County contains some of the most attractive tourist destinations in Romania.
The main tourist attractions in the county are:
The city of Brașov.
Bran Castle also known as Dracula's Castle
Poiana Brașov mountain resort.
Predeal mountain resort.
Bran with its castle often – inaccurately – referred to as Dracula's castle.
The Făgăraș Mountains.
Piatra Craiului Mountains.
The medieval fortresses of Făgăraș and Râșnov.
The Fortified churches from the Saxon villages in the Burzenland area.
The Via Transilvanica long-distance hiking and biking trail, which crosses the county.
Administration
The Brașov County Council, renewed at the 2020 Romanian local elections, consists of 34 counsellors, with the following party composition:
Administrative divisions
Brașov County has four municipalities, six towns and 48 communes:
Municipalities
Brașov – county seat; 253,200 (as of 2011)
Codlea
Făgăraș
Săcele
Towns
Ghimbav
Predeal
Râșnov
Rupea
Victoria
Zărnești
Communes
Apața
Augustin
Beclean
Bod
Bran
Budila
Bunești
Cața
Cincu
Comăna
Cristian
Crizbav
Drăguș
Dumbrăvița
Feldioara
Fundata
Hălchiu
Hărman
Hârseni
Hoghiz
Holbav
Homorod
Jibert
Lisa
Mândra
Măieruș
Moieciu
Ormeniș
Părău
Poiana Mărului
Prejmer
Racoș
Recea
Șercaia
Șinca
Șinca Nouă
Sâmbăta de Sus
Sânpetru
Șoarș
Tărlungeni
Teliu
Ticușu
Ucea
Ungra
Vama Buzăului
Viștea
Voila
Vulcan
Historical county
Historically, the county was located in the central part of Greater Romania, in the southeastern part of Transylvania. Its capital was Brașov. Its territory included the part of the old region of Țara Bârsei. The county's territory was enlarged as a result of the administrative reform of 1925. Its territory covered the eastern part of today's Braşov County and the south of today's Covasna County.
It was bordered on the west by the counties of Făgăraș and Muscel, to the north by Trei Scaune County, to the east by Buzău County, and to the south by the counties of Prahova and Dâmbovița.
History
Prior to World War I, the territory of the county belonged to Austria-Hungary and was identical with the Brassó County of the Kingdom of Hungary. After the Hungarian–Romanian War of 1918–1919, the territory of Brașov County came under the administration of the Kingdom of Romania; it was formally transferred to Romania from Hungary as the successor state to Austria-Hungary in 1920 under the Treaty of Trianon.
In 1938, King Carol II promulgated a new Constitution, and subsequently, he had the administrative division of the Romanian territory changed. 10 ținuturi (approximate translation: "lands") were created (by merging the counties) to be ruled by rezidenți regali (approximate translation: "Royal Residents") - appointed directly by the King - instead of the prefects. Brașov County became part of Ținutul Argeș.
In 1940, part of the county was transferred back to Hungary with the rest of Northern Transylvania under the Second Vienna Award. In September 1944, Romanian forces with Soviet assistance recaptured the ceded territory and reintegrated it into Romania. Romanian jurisdiction over the entire county per the Treaty of Trianon was reaffirmed in the Paris Peace Treaties, 1947. The county was disestablished by the communist government of Romania in 1950, when it was incorporated in the larger Stalin Region, renamed Brașov Region in 1960. Brașov County was re-established in 1968 when Romania restored the county administrative system.
Administration
Until the administrative reform of 1925, Brașov County was divided into three administrative districts (plăși), 23 rural communes, and one urban commune (Brașov).
After 1925, the area of the county was similarly divided into three districts:
Plasa Bran, headquartered at Bran.
Plasa Buzăul Ardelean, headquartered at Întorsura Buzăului.
Plasa Săcele (previously named Plasa Brașov), headquartered at Prejmer.
Plasa Bran included the following settlements: Bran, Codlea, Cristian, Fundata, Ghimbav, Hălchiu, Holbav, Măgura, Moieciul de Jos, Moieciul de Sus, Peștera, Poiana Mărului, Predeal, Râșnov, Satu Nou, Șimon, Sohodol, Șirnea, Tohanu Nou, Tohanu Vechi, Țânțari, Vlădeni, Vulcan, and Zărnești.
Plasa Buzăul Ardelean included the following settlements: Barcani, Budila, Dobârlău, Întorsura Buzăului, Mărcuș, Sărămaș, Sita Buzăului, Teliu, and Vama Buzăului.
Plasa Săcele included the following settlements: Apața, Baciu, Bod, Cernatu, Crizbav, Feldioara, Hărman, Măieruș, Prejmer, Purcăreni, Rotbav, Satulung, Sânpetru, Tărlungeni, Turcheș, and Zizin.
Economy
As a mountain county, agriculture was poorly developed in Brașov. Much of the county's agricultural land was devoted to potatoes, and orchards were planted in hilly areas. Livestock breeding (predominantly cattle and pigs) was an important activity.
Such industry as there was in the county was concentrated in the city of Brașov. In 1925, it had production centers in the chemical, metallurgical, construction, food, textile, machine, pharmaceutical and light industries. Surrounding areas excelled in the metallurgy, extractive, construction, food, textile, and light industries. The city of Brașov was also the main outlet of the county for local products.
Among the natural richness of the county were Zizin's mineral waters, containing sodium bicarbonate, iron, iodine, and carbonic acid. Lignite was exploited at Prejmer, and bituminous coal at Vulcan and Cristian.
Education
In 1925, there was a state high school (lyceum) for boys and another one for girls, four religious high schools for boys, a gymnasium, six secondary schools, four commercial schools, a normal school for educators, a school of arts and crafts and a school of state for commercial and industrial apprentices. The number of state primary schools was 19 and the religious was 53 (of which, in the Romanian language: 17 Orthodox and 3 Roman Catholic; in the German language: 2 Roman Catholic and 18 Lutheran; in the Hungarian language: 2 Reformed and 10 Lutheran; and one Jewish school)
Population
The census of 1920 reported 101,953 inhabitants (about ), of which 36,138 were ethnic Romanians, 33,584 Hungarians, 30,281 Germans, 1,560 Jews, and 390 of other nationalities.
According to the census data of 1930, the county's population was 168,125, of which 49.9% were Romanians, 26.6% Hungarians, 19.8% Germans, as well as other minorities. In the religious aspect, the population consisted of 48.8% Eastern Orthodox, 27.8% Lutheran, 9.9% Roman Catholic, 6% Reformed, 2.4% Greek Catholic, 1.7% Jewish, as well as other minorities.
Urban population
In 1930, the urban population of the county was 59,232, of which 39.3% were Hungarians, 32.7% Romanians, 22.0% Germans, 3.8% Jews, as well as other minorities. As a mother tongue in the urban population, Hungarian was 42.2%, followed by Romanian (32.7%), German (22.4%), Yiddish (0.9%) as well as other minorities. From the religious point of view, the urban population was made up of 30.0% Eastern Orthodox, 22.3% Roman Catholic, 22.0% Evangelical (Lutheran), 13.9% Reformed (Calvinist), 4.4% Jewish, 3.5% Greek Catholic, 3.2% Unitarian, as well as other minorities.
References
External links
Counties of Romania
1920 establishments in Romania
1925 establishments in Romania
1938 disestablishments in Romania
1940 establishments in Romania
1950 disestablishments in Romania
1968 establishments in Romania
States and territories established in 1920
States and territories established in 1925
States and territories disestablished in 1938
States and territories established in 1940
States and territories disestablished in 1950
States and territories established in 1968
|
```go
/*
path_to_url
Unless required by applicable law or agreed to in writing, software
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
*/
package main
import (
"io"
"github.com/spf13/cobra"
"k8s.io/kops/cmd/kops/util"
)
func NewCmdValidate(f *util.Factory, out io.Writer) *cobra.Command {
cmd := &cobra.Command{
Use: "validate",
Short: validateClusterShort,
}
// create subcommands
cmd.AddCommand(NewCmdValidateCluster(f, out))
return cmd
}
```
|
Iowa Highway 90 (Iowa 90) was a state highway in central Iowa. The highway was in service to traffic from 1932 through 1981 and took several forms over the years. It began as a spur route from Des Moines to Commerce, now part of West Des Moines. At its greatest extent, it extended from Atlantic to Newton along the historical routing of U.S. Highway 6 (US 6). From 1966 through 1981, the highway existed in its final form—from Interstate 80 (I-80) between Earlham and DeSoto to I-35 on the southern outskirts of West Des Moines.
Route description
Iowa 90 began at an interchange with I-80 between Earlham and DeSoto. The Interstate Highway at this location ran in a south-southwest–to–north-northeast orientation. The Iowa 90 roadway curved northward at the interchange and continued as County Road P58 (CR P58). The highway straightened out and headed due east and intersected US 169 about south of DeSoto. Just before this intersection it passed over a line of the Rock Island Railroad. It continued east along a section line until it met CR R16 on the southern edge of Van Meter. Prior to 1980, CR R16 was called Iowa 293. The highway eased slightly to the north, putting traffic on a north-northeasterly vector parallel to the Rock Island line. It crossed the Raccoon River just west of Booneville. It entered Polk County to the southwest of West Des Moines. The roadway curved around to cross to the north side of the railroad tracks at a perpendicular level crossing. From there, it continued a short distance to a cloverleaf interchange with I-35. The roadway continued into West Des Moines, and ultimately Des Moines, as Grand Avenue.
Major intersections
References
External links
090
U.S. Route 6
|
```ruby
require "rails_helper"
RSpec.describe DeviseMailer do
let(:user) { create(:user) }
describe "#reset_password_instructions" do
let(:email) { described_class.reset_password_instructions(user, "test") }
let(:from_email_address) { "custom_noreply@forem.com" }
let(:reply_to_email_address) { "custom_reply@forem.com" }
before do
allow(Settings::General).to receive(:app_domain).and_return("funky-one-of-a-kind-domain-#{rand(100)}.com")
allow(Settings::SMTP).to receive(:provided_minimum_settings?).and_return(true)
allow(Settings::SMTP).to receive(:from_email_address).and_return(from_email_address)
allow(Settings::SMTP).to receive(:reply_to_email_address).and_return(reply_to_email_address)
end
it "renders sender" do
expected_from = "#{Settings::Community.community_name} <#{from_email_address}>"
expect(email["from"].value).to eq(expected_from)
end
it "renders a reply to email address" do
expect(email["reply_to"].value).to eq(reply_to_email_address)
end
it "renders proper URL" do
expect(email.to_s).to include(Settings::General.app_domain)
end
end
describe "#confirmation_instructions" do
context "when it's a Forem creator" do
let!(:creator) { create(:user, :super_admin, :creator) }
let(:email) { described_class.confirmation_instructions(creator, "faketoken") }
it "renders the correct body" do
expect(email.body.to_s).to include("Hello! Once you've confirmed your email address, you'll be able to setup " \
"your Forem Instance.")
end
it "renders proper URL" do
expect(email.body.to_s).to include("confirmation_token=faketoken") # encoded URL
end
end
context "when it's a user" do
let(:email) { described_class.confirmation_instructions(user, "faketoken") }
it "renders the correct body" do
expect(email.to_s).to include("You can confirm your account email through the link below:")
end
it "renders proper URL" do
expect(email.body.to_s).to include("confirmation_token=faketoken")
end
end
end
describe "#invitation_instructions" do
let(:token) { "some_token" }
let(:custom_invite_message) { "Join our community!!" }
let(:custom_invite_footnote) { "Looking forward to seeing you!!" }
let(:custom_invite_subject) { "You've Been Invited" }
let(:opts) do
{
custom_invite_message: custom_invite_message,
custom_invite_footnote: custom_invite_footnote,
custom_invite_subject: custom_invite_subject
}
end
let(:email) { described_class.invitation_instructions(user, token, opts) }
before do
allow(Settings::SMTP).to receive_messages(
from_email_address: "custom_noreply@example.com",
reply_to_email_address: "custom_reply@example.com",
)
end
it "uses the custom invite subject if provided" do
expect(email.subject).to eq(custom_invite_subject)
end
it "falls back to default subject if custom subject is not provided" do
email_without_custom_subject = described_class.invitation_instructions(user, token, {})
expect(email_without_custom_subject.subject).to eq("Invitation Instructions")
end
it "includes the custom invite message if provided" do
# Ensure your email view actually includes @message
expect(email.to_s).to include(custom_invite_message)
end
it "does not include overridden default message if invite message is provided" do
# Ensure your email view actually includes @message
expect(email.to_s).not_to include("<p>#{I18n.t('devise.mailer.invitation_instructions.accept_instructions')}")
end
it "includes the custom invite footnote if provided" do
# Ensure your email view actually includes @footnote
expect(email.to_s).to include(custom_invite_footnote)
end
end
end
```
|
```python
"""Tools for helping with ANSI color codes."""
import re
import sys
import warnings
import builtins
from xonsh.platform import HAS_PYGMENTS
from xonsh.lazyasd import LazyDict, lazyobject
from xonsh.color_tools import (
RE_BACKGROUND,
BASE_XONSH_COLORS,
make_palette,
find_closest_color,
rgb2short,
rgb_to_256,
short_to_ints,
)
from xonsh.tools import FORMATTER
def ansi_partial_color_format(template, style="default", cmap=None, hide=False):
"""Formats a template string but only with respect to the colors.
Another template string is returned, with the color values filled in.
Parameters
----------
template : str
The template string, potentially with color names.
style : str, optional
Style name to look up color map from.
cmap : dict, optional
A color map to use, this will prevent the color map from being
looked up via the style name.
hide : bool, optional
Whether to wrap the color codes in the \\001 and \\002 escape
codes, so that the color codes are not counted against line
length.
Returns
-------
A template string with the color values filled in.
"""
try:
return _ansi_partial_color_format_main(
template, style=style, cmap=cmap, hide=hide
)
except Exception:
return template
def _ansi_partial_color_format_main(template, style="default", cmap=None, hide=False):
if cmap is not None:
pass
elif style in ANSI_STYLES:
cmap = ANSI_STYLES[style]
else:
try: # dynamically loading the style
cmap = ansi_style_by_name(style)
except Exception:
msg = "Could not find color style {0!r}, using default."
print(msg.format(style), file=sys.stderr)
builtins.__xonsh__.env["XONSH_COLOR_STYLE"] = "default"
cmap = ANSI_STYLES["default"]
esc = ("\001" if hide else "") + "\033["
m = "m" + ("\002" if hide else "")
bopen = "{"
bclose = "}"
colon = ":"
expl = "!"
toks = []
for literal, field, spec, conv in FORMATTER.parse(template):
toks.append(literal)
if field is None:
pass
elif field in cmap:
toks.extend([esc, cmap[field], m])
elif "#" in field:
field = field.lower()
pre, _, post = field.partition("#")
f_or_b = "38" if RE_BACKGROUND.search(pre) is None else "48"
rgb, _, post = post.partition("_")
c256, _ = rgb_to_256(rgb)
color = f_or_b + ";5;" + c256
mods = pre + "_" + post
if "underline" in mods:
color = "4;" + color
if "bold" in mods:
color = "1;" + color
toks.extend([esc, color, m])
elif field is not None:
toks.append(bopen)
toks.append(field)
if conv is not None and len(conv) > 0:
toks.append(expl)
toks.append(conv)
if spec is not None and len(spec) > 0:
toks.append(colon)
toks.append(spec)
toks.append(bclose)
return "".join(toks)
def ansi_color_style_names():
"""Returns an iterable of all ANSI color style names."""
return ANSI_STYLES.keys()
def ansi_color_style(style="default"):
"""Returns the current color map."""
if style in ANSI_STYLES:
cmap = ANSI_STYLES[style]
else:
msg = "Could not find color style {0!r}, using default.".format(style)
warnings.warn(msg, RuntimeWarning)
cmap = ANSI_STYLES["default"]
return cmap
def ansi_reverse_style(style="default", return_style=False):
"""Reverses an ANSI color style mapping so that escape codes map to
colors. Style may either be string or mapping. May also return
the style it looked up.
"""
style = ansi_style_by_name(style) if isinstance(style, str) else style
reversed_style = {v: k for k, v in style.items()}
# add keys to make this more useful
updates = {
"1": "BOLD_",
"2": "FAINT_",
"4": "UNDERLINE_",
"5": "SLOWBLINK_",
"1;4": "BOLD_UNDERLINE_",
"4;1": "BOLD_UNDERLINE_",
"38": "SET_FOREGROUND_",
"48": "SET_BACKGROUND_",
"38;2": "SET_FOREGROUND_3INTS_",
"48;2": "SET_BACKGROUND_3INTS_",
"38;5": "SET_FOREGROUND_SHORT_",
"48;5": "SET_BACKGROUND_SHORT_",
}
for ec, name in reversed_style.items():
no_left_zero = ec.lstrip("0")
if no_left_zero.startswith(";"):
updates[no_left_zero[1:]] = name
elif no_left_zero != ec:
updates[no_left_zero] = name
reversed_style.update(updates)
# return results
if return_style:
return style, reversed_style
else:
return reversed_style
@lazyobject
def ANSI_ESCAPE_CODE_RE():
return re.compile(r"\001?(\033\[)?([0-9;]+)m?\002?")
@lazyobject
def ANSI_REVERSE_COLOR_NAME_TRANSLATIONS():
base = {
"SET_FOREGROUND_FAINT_": "SET_FOREGROUND_3INTS_",
"SET_BACKGROUND_FAINT_": "SET_BACKGROUND_3INTS_",
"SET_FOREGROUND_SLOWBLINK_": "SET_FOREGROUND_SHORT_",
"SET_BACKGROUND_SLOWBLINK_": "SET_BACKGROUND_SHORT_",
}
data = {"UNDERLINE_BOLD_": "BOLD_UNDERLINE_"}
data.update(base)
data.update({"BOLD_" + k: "BOLD_" + v for k, v in base.items()})
data.update({"UNDERLINE_" + k: "UNDERLINE_" + v for k, v in base.items()})
data.update({"BOLD_UNDERLINE_" + k: "BOLD_UNDERLINE_" + v for k, v in base.items()})
data.update({"UNDERLINE_BOLD_" + k: "BOLD_UNDERLINE_" + v for k, v in base.items()})
return data
@lazyobject
def ANSI_COLOR_NAME_SET_3INTS_RE():
return re.compile(r"(\w+_)?SET_(FORE|BACK)GROUND_3INTS_(\d+)_(\d+)_(\d+)")
@lazyobject
def ANSI_COLOR_NAME_SET_SHORT_RE():
return re.compile(r"(\w+_)?SET_(FORE|BACK)GROUND_SHORT_(\d+)")
def _color_name_from_ints(ints, background=False, prefix=None):
name = find_closest_color(ints, BASE_XONSH_COLORS)
if background:
name = "BACKGROUND_" + name
name = name if prefix is None else prefix + name
return name
_ANSI_COLOR_ESCAPE_CODE_TO_NAME_CACHE = {}
def ansi_color_escape_code_to_name(escape_code, style, reversed_style=None):
"""Converts an ASNI color code escape sequence to a tuple of color names
in the provided style ('default' should almost be the style). For example,
'0' becomes ('NO_COLOR',) and '32;41' becomes ('GREEN', 'BACKGROUND_RED').
The style keyword may either be a string, in which the style is looked up,
or an actual style dict. You can also provide a reversed style mapping,
too, which is just the keys/values of the style dict swapped. If reversed
style is not provided, it is computed.
"""
key = (escape_code, style)
if key in _ANSI_COLOR_ESCAPE_CODE_TO_NAME_CACHE:
return _ANSI_COLOR_ESCAPE_CODE_TO_NAME_CACHE[key]
if reversed_style is None:
style, reversed_style = ansi_reverse_style(style, return_style=True)
# strip some actual escape codes, if needed.
ec = ANSI_ESCAPE_CODE_RE.match(escape_code).group(2)
names = []
n_ints = 0
seen_set_foreback = False
for e in ec.split(";"):
no_left_zero = e.lstrip("0") if len(e) > 1 else e
if seen_set_foreback and n_ints > 0:
names.append(e)
n_ints -= 1
if n_ints == 0:
seen_set_foreback = False
continue
else:
names.append(reversed_style.get(no_left_zero, no_left_zero))
# set the flags for next time
if "38" == e or "48" == e:
seen_set_foreback = True
elif "2" == e:
n_ints = 3
elif "5" == e:
n_ints = 1
# normalize names
n = ""
norm_names = []
colors = set(reversed_style.values())
for name in names:
if name == "NO_COLOR":
# skip most '0' entries
continue
n = n + name if n else name
n = ANSI_REVERSE_COLOR_NAME_TRANSLATIONS.get(n, n)
if n.endswith("_"):
continue
elif ANSI_COLOR_NAME_SET_SHORT_RE.match(n) is not None:
pre, fore_back, short = ANSI_COLOR_NAME_SET_SHORT_RE.match(n).groups()
n = _color_name_from_ints(
short_to_ints(short), background=(fore_back == "BACK"), prefix=pre
)
elif ANSI_COLOR_NAME_SET_3INTS_RE.match(n) is not None:
pre, fore_back, r, g, b = ANSI_COLOR_NAME_SET_3INTS_RE.match(n).groups()
n = _color_name_from_ints(
(int(r), int(g), int(b)), background=(fore_back == "BACK"), prefix=pre
)
elif "GROUND_3INTS_" in n:
# have 1 or 2, but not 3 ints
n += "_"
continue
# error check
if n not in colors:
msg = (
"Could not translate ANSI color code {escape_code!r} "
"into a known color in the palette. Specifically, the {n!r} "
"portion of {name!r} in {names!r} seems to missing."
)
raise ValueError(
msg.format(escape_code=escape_code, names=names, name=name, n=n)
)
norm_names.append(n)
n = ""
# return
if len(norm_names) == 0:
return ("NO_COLOR",)
else:
return tuple(norm_names)
def _ansi_expand_style(cmap):
"""Expands a style in order to more quickly make color map changes."""
for key, val in list(cmap.items()):
if key == "NO_COLOR":
continue
elif len(val) == 0:
cmap["BOLD_" + key] = "1"
cmap["UNDERLINE_" + key] = "4"
cmap["BOLD_UNDERLINE_" + key] = "1;4"
cmap["BACKGROUND_" + key] = val
else:
cmap["BOLD_" + key] = "1;" + val
cmap["UNDERLINE_" + key] = "4;" + val
cmap["BOLD_UNDERLINE_" + key] = "1;4;" + val
cmap["BACKGROUND_" + key] = val.replace("38", "48", 1)
def _bw_style():
style = {
"BLACK": "0;30",
"BLUE": "0;37",
"CYAN": "0;37",
"GREEN": "0;37",
"INTENSE_BLACK": "0;90",
"INTENSE_BLUE": "0;97",
"INTENSE_CYAN": "0;97",
"INTENSE_GREEN": "0;97",
"INTENSE_PURPLE": "0;97",
"INTENSE_RED": "0;97",
"INTENSE_WHITE": "0;97",
"INTENSE_YELLOW": "0;97",
"NO_COLOR": "0",
"PURPLE": "0;37",
"RED": "0;37",
"WHITE": "0;37",
"YELLOW": "0;37",
}
_ansi_expand_style(style)
return style
def _default_style():
style = {
# Reset
"NO_COLOR": "0", # Text Reset
# Regular Colors
"BLACK": "0;30", # BLACK
"RED": "0;31", # RED
"GREEN": "0;32", # GREEN
"YELLOW": "0;33", # YELLOW
"BLUE": "0;34", # BLUE
"PURPLE": "0;35", # PURPLE
"CYAN": "0;36", # CYAN
"WHITE": "0;37", # WHITE
# Bold
"BOLD_BLACK": "1;30", # BLACK
"BOLD_RED": "1;31", # RED
"BOLD_GREEN": "1;32", # GREEN
"BOLD_YELLOW": "1;33", # YELLOW
"BOLD_BLUE": "1;34", # BLUE
"BOLD_PURPLE": "1;35", # PURPLE
"BOLD_CYAN": "1;36", # CYAN
"BOLD_WHITE": "1;37", # WHITE
# Underline
"UNDERLINE_BLACK": "4;30", # BLACK
"UNDERLINE_RED": "4;31", # RED
"UNDERLINE_GREEN": "4;32", # GREEN
"UNDERLINE_YELLOW": "4;33", # YELLOW
"UNDERLINE_BLUE": "4;34", # BLUE
"UNDERLINE_PURPLE": "4;35", # PURPLE
"UNDERLINE_CYAN": "4;36", # CYAN
"UNDERLINE_WHITE": "4;37", # WHITE
# Bold, Underline
"BOLD_UNDERLINE_BLACK": "1;4;30", # BLACK
"BOLD_UNDERLINE_RED": "1;4;31", # RED
"BOLD_UNDERLINE_GREEN": "1;4;32", # GREEN
"BOLD_UNDERLINE_YELLOW": "1;4;33", # YELLOW
"BOLD_UNDERLINE_BLUE": "1;4;34", # BLUE
"BOLD_UNDERLINE_PURPLE": "1;4;35", # PURPLE
"BOLD_UNDERLINE_CYAN": "1;4;36", # CYAN
"BOLD_UNDERLINE_WHITE": "1;4;37", # WHITE
# Background
"BACKGROUND_BLACK": "40", # BLACK
"BACKGROUND_RED": "41", # RED
"BACKGROUND_GREEN": "42", # GREEN
"BACKGROUND_YELLOW": "43", # YELLOW
"BACKGROUND_BLUE": "44", # BLUE
"BACKGROUND_PURPLE": "45", # PURPLE
"BACKGROUND_CYAN": "46", # CYAN
"BACKGROUND_WHITE": "47", # WHITE
# High Intensity
"INTENSE_BLACK": "0;90", # BLACK
"INTENSE_RED": "0;91", # RED
"INTENSE_GREEN": "0;92", # GREEN
"INTENSE_YELLOW": "0;93", # YELLOW
"INTENSE_BLUE": "0;94", # BLUE
"INTENSE_PURPLE": "0;95", # PURPLE
"INTENSE_CYAN": "0;96", # CYAN
"INTENSE_WHITE": "0;97", # WHITE
# Bold High Intensity
"BOLD_INTENSE_BLACK": "1;90", # BLACK
"BOLD_INTENSE_RED": "1;91", # RED
"BOLD_INTENSE_GREEN": "1;92", # GREEN
"BOLD_INTENSE_YELLOW": "1;93", # YELLOW
"BOLD_INTENSE_BLUE": "1;94", # BLUE
"BOLD_INTENSE_PURPLE": "1;95", # PURPLE
"BOLD_INTENSE_CYAN": "1;96", # CYAN
"BOLD_INTENSE_WHITE": "1;97", # WHITE
# Underline High Intensity
"UNDERLINE_INTENSE_BLACK": "4;90", # BLACK
"UNDERLINE_INTENSE_RED": "4;91", # RED
"UNDERLINE_INTENSE_GREEN": "4;92", # GREEN
"UNDERLINE_INTENSE_YELLOW": "4;93", # YELLOW
"UNDERLINE_INTENSE_BLUE": "4;94", # BLUE
"UNDERLINE_INTENSE_PURPLE": "4;95", # PURPLE
"UNDERLINE_INTENSE_CYAN": "4;96", # CYAN
"UNDERLINE_INTENSE_WHITE": "4;97", # WHITE
# Bold Underline High Intensity
"BOLD_UNDERLINE_INTENSE_BLACK": "1;4;90", # BLACK
"BOLD_UNDERLINE_INTENSE_RED": "1;4;91", # RED
"BOLD_UNDERLINE_INTENSE_GREEN": "1;4;92", # GREEN
"BOLD_UNDERLINE_INTENSE_YELLOW": "1;4;93", # YELLOW
"BOLD_UNDERLINE_INTENSE_BLUE": "1;4;94", # BLUE
"BOLD_UNDERLINE_INTENSE_PURPLE": "1;4;95", # PURPLE
"BOLD_UNDERLINE_INTENSE_CYAN": "1;4;96", # CYAN
"BOLD_UNDERLINE_INTENSE_WHITE": "1;4;97", # WHITE
# High Intensity backgrounds
"BACKGROUND_INTENSE_BLACK": "0;100", # BLACK
"BACKGROUND_INTENSE_RED": "0;101", # RED
"BACKGROUND_INTENSE_GREEN": "0;102", # GREEN
"BACKGROUND_INTENSE_YELLOW": "0;103", # YELLOW
"BACKGROUND_INTENSE_BLUE": "0;104", # BLUE
"BACKGROUND_INTENSE_PURPLE": "0;105", # PURPLE
"BACKGROUND_INTENSE_CYAN": "0;106", # CYAN
"BACKGROUND_INTENSE_WHITE": "0;107", # WHITE
}
return style
def _monokai_style():
style = {
"NO_COLOR": "0",
"BLACK": "38;5;16",
"BLUE": "38;5;63",
"CYAN": "38;5;81",
"GREEN": "38;5;40",
"PURPLE": "38;5;89",
"RED": "38;5;124",
"WHITE": "38;5;188",
"YELLOW": "38;5;184",
"INTENSE_BLACK": "38;5;59",
"INTENSE_BLUE": "38;5;20",
"INTENSE_CYAN": "38;5;44",
"INTENSE_GREEN": "38;5;148",
"INTENSE_PURPLE": "38;5;141",
"INTENSE_RED": "38;5;197",
"INTENSE_WHITE": "38;5;15",
"INTENSE_YELLOW": "38;5;186",
}
_ansi_expand_style(style)
return style
####################################
# Auto-generated below this line #
####################################
def _algol_style():
style = {
"BLACK": "38;5;59",
"BLUE": "38;5;59",
"CYAN": "38;5;59",
"GREEN": "38;5;59",
"INTENSE_BLACK": "38;5;59",
"INTENSE_BLUE": "38;5;102",
"INTENSE_CYAN": "38;5;102",
"INTENSE_GREEN": "38;5;102",
"INTENSE_PURPLE": "38;5;102",
"INTENSE_RED": "38;5;09",
"INTENSE_WHITE": "38;5;102",
"INTENSE_YELLOW": "38;5;102",
"NO_COLOR": "0",
"PURPLE": "38;5;59",
"RED": "38;5;09",
"WHITE": "38;5;102",
"YELLOW": "38;5;09",
}
_ansi_expand_style(style)
return style
def _algol_nu_style():
style = {
"BLACK": "38;5;59",
"BLUE": "38;5;59",
"CYAN": "38;5;59",
"GREEN": "38;5;59",
"INTENSE_BLACK": "38;5;59",
"INTENSE_BLUE": "38;5;102",
"INTENSE_CYAN": "38;5;102",
"INTENSE_GREEN": "38;5;102",
"INTENSE_PURPLE": "38;5;102",
"INTENSE_RED": "38;5;09",
"INTENSE_WHITE": "38;5;102",
"INTENSE_YELLOW": "38;5;102",
"NO_COLOR": "0",
"PURPLE": "38;5;59",
"RED": "38;5;09",
"WHITE": "38;5;102",
"YELLOW": "38;5;09",
}
_ansi_expand_style(style)
return style
def _autumn_style():
style = {
"BLACK": "38;5;18",
"BLUE": "38;5;19",
"CYAN": "38;5;37",
"GREEN": "38;5;34",
"INTENSE_BLACK": "38;5;59",
"INTENSE_BLUE": "38;5;33",
"INTENSE_CYAN": "38;5;33",
"INTENSE_GREEN": "38;5;64",
"INTENSE_PURPLE": "38;5;217",
"INTENSE_RED": "38;5;130",
"INTENSE_WHITE": "38;5;145",
"INTENSE_YELLOW": "38;5;217",
"NO_COLOR": "0",
"PURPLE": "38;5;90",
"RED": "38;5;124",
"WHITE": "38;5;145",
"YELLOW": "38;5;130",
}
_ansi_expand_style(style)
return style
def _borland_style():
style = {
"BLACK": "38;5;16",
"BLUE": "38;5;18",
"CYAN": "38;5;30",
"GREEN": "38;5;28",
"INTENSE_BLACK": "38;5;59",
"INTENSE_BLUE": "38;5;21",
"INTENSE_CYAN": "38;5;194",
"INTENSE_GREEN": "38;5;102",
"INTENSE_PURPLE": "38;5;188",
"INTENSE_RED": "38;5;09",
"INTENSE_WHITE": "38;5;224",
"INTENSE_YELLOW": "38;5;188",
"NO_COLOR": "0",
"PURPLE": "38;5;90",
"RED": "38;5;124",
"WHITE": "38;5;145",
"YELLOW": "38;5;124",
}
_ansi_expand_style(style)
return style
def _colorful_style():
style = {
"BLACK": "38;5;16",
"BLUE": "38;5;20",
"CYAN": "38;5;31",
"GREEN": "38;5;34",
"INTENSE_BLACK": "38;5;59",
"INTENSE_BLUE": "38;5;61",
"INTENSE_CYAN": "38;5;145",
"INTENSE_GREEN": "38;5;102",
"INTENSE_PURPLE": "38;5;217",
"INTENSE_RED": "38;5;166",
"INTENSE_WHITE": "38;5;15",
"INTENSE_YELLOW": "38;5;217",
"NO_COLOR": "0",
"PURPLE": "38;5;90",
"RED": "38;5;124",
"WHITE": "38;5;145",
"YELLOW": "38;5;130",
}
_ansi_expand_style(style)
return style
def _emacs_style():
style = {
"BLACK": "38;5;28",
"BLUE": "38;5;18",
"CYAN": "38;5;26",
"GREEN": "38;5;34",
"INTENSE_BLACK": "38;5;59",
"INTENSE_BLUE": "38;5;26",
"INTENSE_CYAN": "38;5;145",
"INTENSE_GREEN": "38;5;34",
"INTENSE_PURPLE": "38;5;129",
"INTENSE_RED": "38;5;167",
"INTENSE_WHITE": "38;5;145",
"INTENSE_YELLOW": "38;5;145",
"NO_COLOR": "0",
"PURPLE": "38;5;90",
"RED": "38;5;124",
"WHITE": "38;5;145",
"YELLOW": "38;5;130",
}
_ansi_expand_style(style)
return style
def _friendly_style():
style = {
"BLACK": "38;5;22",
"BLUE": "38;5;18",
"CYAN": "38;5;31",
"GREEN": "38;5;34",
"INTENSE_BLACK": "38;5;59",
"INTENSE_BLUE": "38;5;74",
"INTENSE_CYAN": "38;5;74",
"INTENSE_GREEN": "38;5;71",
"INTENSE_PURPLE": "38;5;134",
"INTENSE_RED": "38;5;167",
"INTENSE_WHITE": "38;5;15",
"INTENSE_YELLOW": "38;5;145",
"NO_COLOR": "0",
"PURPLE": "38;5;90",
"RED": "38;5;124",
"WHITE": "38;5;145",
"YELLOW": "38;5;166",
}
_ansi_expand_style(style)
return style
def _fruity_style():
style = {
"BLACK": "38;5;16",
"BLUE": "38;5;32",
"CYAN": "38;5;32",
"GREEN": "38;5;28",
"INTENSE_BLACK": "38;5;59",
"INTENSE_BLUE": "38;5;33",
"INTENSE_CYAN": "38;5;33",
"INTENSE_GREEN": "38;5;102",
"INTENSE_PURPLE": "38;5;198",
"INTENSE_RED": "38;5;202",
"INTENSE_WHITE": "38;5;15",
"INTENSE_YELLOW": "38;5;187",
"NO_COLOR": "0",
"PURPLE": "38;5;198",
"RED": "38;5;09",
"WHITE": "38;5;187",
"YELLOW": "38;5;202",
}
_ansi_expand_style(style)
return style
def _igor_style():
style = {
"BLACK": "38;5;34",
"BLUE": "38;5;21",
"CYAN": "38;5;30",
"GREEN": "38;5;34",
"INTENSE_BLACK": "38;5;30",
"INTENSE_BLUE": "38;5;21",
"INTENSE_CYAN": "38;5;30",
"INTENSE_GREEN": "38;5;34",
"INTENSE_PURPLE": "38;5;163",
"INTENSE_RED": "38;5;166",
"INTENSE_WHITE": "38;5;163",
"INTENSE_YELLOW": "38;5;166",
"NO_COLOR": "0",
"PURPLE": "38;5;163",
"RED": "38;5;166",
"WHITE": "38;5;163",
"YELLOW": "38;5;166",
}
_ansi_expand_style(style)
return style
def _lovelace_style():
style = {
"BLACK": "38;5;59",
"BLUE": "38;5;25",
"CYAN": "38;5;29",
"GREEN": "38;5;65",
"INTENSE_BLACK": "38;5;59",
"INTENSE_BLUE": "38;5;25",
"INTENSE_CYAN": "38;5;102",
"INTENSE_GREEN": "38;5;29",
"INTENSE_PURPLE": "38;5;133",
"INTENSE_RED": "38;5;131",
"INTENSE_WHITE": "38;5;102",
"INTENSE_YELLOW": "38;5;136",
"NO_COLOR": "0",
"PURPLE": "38;5;133",
"RED": "38;5;124",
"WHITE": "38;5;102",
"YELLOW": "38;5;130",
}
_ansi_expand_style(style)
return style
def _manni_style():
style = {
"BLACK": "38;5;16",
"BLUE": "38;5;18",
"CYAN": "38;5;30",
"GREEN": "38;5;40",
"INTENSE_BLACK": "38;5;59",
"INTENSE_BLUE": "38;5;105",
"INTENSE_CYAN": "38;5;45",
"INTENSE_GREEN": "38;5;113",
"INTENSE_PURPLE": "38;5;165",
"INTENSE_RED": "38;5;202",
"INTENSE_WHITE": "38;5;224",
"INTENSE_YELLOW": "38;5;221",
"NO_COLOR": "0",
"PURPLE": "38;5;165",
"RED": "38;5;124",
"WHITE": "38;5;145",
"YELLOW": "38;5;166",
}
_ansi_expand_style(style)
return style
def _murphy_style():
style = {
"BLACK": "38;5;16",
"BLUE": "38;5;18",
"CYAN": "38;5;31",
"GREEN": "38;5;34",
"INTENSE_BLACK": "38;5;59",
"INTENSE_BLUE": "38;5;63",
"INTENSE_CYAN": "38;5;86",
"INTENSE_GREEN": "38;5;86",
"INTENSE_PURPLE": "38;5;213",
"INTENSE_RED": "38;5;209",
"INTENSE_WHITE": "38;5;15",
"INTENSE_YELLOW": "38;5;222",
"NO_COLOR": "0",
"PURPLE": "38;5;90",
"RED": "38;5;124",
"WHITE": "38;5;145",
"YELLOW": "38;5;166",
}
_ansi_expand_style(style)
return style
def _native_style():
style = {
"BLACK": "38;5;52",
"BLUE": "38;5;67",
"CYAN": "38;5;31",
"GREEN": "38;5;64",
"INTENSE_BLACK": "38;5;59",
"INTENSE_BLUE": "38;5;68",
"INTENSE_CYAN": "38;5;87",
"INTENSE_GREEN": "38;5;70",
"INTENSE_PURPLE": "38;5;188",
"INTENSE_RED": "38;5;160",
"INTENSE_WHITE": "38;5;15",
"INTENSE_YELLOW": "38;5;214",
"NO_COLOR": "0",
"PURPLE": "38;5;59",
"RED": "38;5;124",
"WHITE": "38;5;145",
"YELLOW": "38;5;124",
}
_ansi_expand_style(style)
return style
def _paraiso_dark_style():
style = {
"BLACK": "38;5;95",
"BLUE": "38;5;97",
"CYAN": "38;5;39",
"GREEN": "38;5;72",
"INTENSE_BLACK": "38;5;95",
"INTENSE_BLUE": "38;5;97",
"INTENSE_CYAN": "38;5;79",
"INTENSE_GREEN": "38;5;72",
"INTENSE_PURPLE": "38;5;188",
"INTENSE_RED": "38;5;203",
"INTENSE_WHITE": "38;5;188",
"INTENSE_YELLOW": "38;5;220",
"NO_COLOR": "0",
"PURPLE": "38;5;97",
"RED": "38;5;203",
"WHITE": "38;5;79",
"YELLOW": "38;5;214",
}
_ansi_expand_style(style)
return style
def _paraiso_light_style():
style = {
"BLACK": "38;5;16",
"BLUE": "38;5;16",
"CYAN": "38;5;39",
"GREEN": "38;5;72",
"INTENSE_BLACK": "38;5;16",
"INTENSE_BLUE": "38;5;97",
"INTENSE_CYAN": "38;5;79",
"INTENSE_GREEN": "38;5;72",
"INTENSE_PURPLE": "38;5;97",
"INTENSE_RED": "38;5;203",
"INTENSE_WHITE": "38;5;79",
"INTENSE_YELLOW": "38;5;220",
"NO_COLOR": "0",
"PURPLE": "38;5;97",
"RED": "38;5;16",
"WHITE": "38;5;102",
"YELLOW": "38;5;214",
}
_ansi_expand_style(style)
return style
def _pastie_style():
style = {
"BLACK": "38;5;16",
"BLUE": "38;5;20",
"CYAN": "38;5;25",
"GREEN": "38;5;28",
"INTENSE_BLACK": "38;5;59",
"INTENSE_BLUE": "38;5;61",
"INTENSE_CYAN": "38;5;194",
"INTENSE_GREEN": "38;5;34",
"INTENSE_PURPLE": "38;5;188",
"INTENSE_RED": "38;5;172",
"INTENSE_WHITE": "38;5;15",
"INTENSE_YELLOW": "38;5;188",
"NO_COLOR": "0",
"PURPLE": "38;5;125",
"RED": "38;5;124",
"WHITE": "38;5;145",
"YELLOW": "38;5;130",
}
_ansi_expand_style(style)
return style
def _perldoc_style():
style = {
"BLACK": "38;5;18",
"BLUE": "38;5;18",
"CYAN": "38;5;31",
"GREEN": "38;5;34",
"INTENSE_BLACK": "38;5;59",
"INTENSE_BLUE": "38;5;134",
"INTENSE_CYAN": "38;5;145",
"INTENSE_GREEN": "38;5;28",
"INTENSE_PURPLE": "38;5;134",
"INTENSE_RED": "38;5;167",
"INTENSE_WHITE": "38;5;188",
"INTENSE_YELLOW": "38;5;188",
"NO_COLOR": "0",
"PURPLE": "38;5;90",
"RED": "38;5;124",
"WHITE": "38;5;145",
"YELLOW": "38;5;166",
}
_ansi_expand_style(style)
return style
def _rrt_style():
style = {
"BLACK": "38;5;09",
"BLUE": "38;5;117",
"CYAN": "38;5;117",
"GREEN": "38;5;46",
"INTENSE_BLACK": "38;5;117",
"INTENSE_BLUE": "38;5;117",
"INTENSE_CYAN": "38;5;122",
"INTENSE_GREEN": "38;5;46",
"INTENSE_PURPLE": "38;5;213",
"INTENSE_RED": "38;5;09",
"INTENSE_WHITE": "38;5;188",
"INTENSE_YELLOW": "38;5;222",
"NO_COLOR": "0",
"PURPLE": "38;5;213",
"RED": "38;5;09",
"WHITE": "38;5;117",
"YELLOW": "38;5;09",
}
_ansi_expand_style(style)
return style
def _tango_style():
style = {
"BLACK": "38;5;16",
"BLUE": "38;5;20",
"CYAN": "38;5;61",
"GREEN": "38;5;34",
"INTENSE_BLACK": "38;5;24",
"INTENSE_BLUE": "38;5;62",
"INTENSE_CYAN": "38;5;15",
"INTENSE_GREEN": "38;5;64",
"INTENSE_PURPLE": "38;5;15",
"INTENSE_RED": "38;5;09",
"INTENSE_WHITE": "38;5;15",
"INTENSE_YELLOW": "38;5;178",
"NO_COLOR": "0",
"PURPLE": "38;5;90",
"RED": "38;5;124",
"WHITE": "38;5;15",
"YELLOW": "38;5;94",
}
_ansi_expand_style(style)
return style
def _trac_style():
style = {
"BLACK": "38;5;16",
"BLUE": "38;5;18",
"CYAN": "38;5;30",
"GREEN": "38;5;100",
"INTENSE_BLACK": "38;5;59",
"INTENSE_BLUE": "38;5;60",
"INTENSE_CYAN": "38;5;194",
"INTENSE_GREEN": "38;5;102",
"INTENSE_PURPLE": "38;5;188",
"INTENSE_RED": "38;5;137",
"INTENSE_WHITE": "38;5;224",
"INTENSE_YELLOW": "38;5;188",
"NO_COLOR": "0",
"PURPLE": "38;5;90",
"RED": "38;5;124",
"WHITE": "38;5;145",
"YELLOW": "38;5;100",
}
_ansi_expand_style(style)
return style
def _vim_style():
style = {
"BLACK": "38;5;18",
"BLUE": "38;5;18",
"CYAN": "38;5;44",
"GREEN": "38;5;40",
"INTENSE_BLACK": "38;5;60",
"INTENSE_BLUE": "38;5;68",
"INTENSE_CYAN": "38;5;44",
"INTENSE_GREEN": "38;5;40",
"INTENSE_PURPLE": "38;5;164",
"INTENSE_RED": "38;5;09",
"INTENSE_WHITE": "38;5;188",
"INTENSE_YELLOW": "38;5;184",
"NO_COLOR": "0",
"PURPLE": "38;5;164",
"RED": "38;5;160",
"WHITE": "38;5;188",
"YELLOW": "38;5;160",
}
_ansi_expand_style(style)
return style
def _vs_style():
style = {
"BLACK": "38;5;28",
"BLUE": "38;5;21",
"CYAN": "38;5;31",
"GREEN": "38;5;28",
"INTENSE_BLACK": "38;5;31",
"INTENSE_BLUE": "38;5;31",
"INTENSE_CYAN": "38;5;31",
"INTENSE_GREEN": "38;5;31",
"INTENSE_PURPLE": "38;5;31",
"INTENSE_RED": "38;5;09",
"INTENSE_WHITE": "38;5;31",
"INTENSE_YELLOW": "38;5;31",
"NO_COLOR": "0",
"PURPLE": "38;5;124",
"RED": "38;5;124",
"WHITE": "38;5;31",
"YELLOW": "38;5;124",
}
_ansi_expand_style(style)
return style
def _xcode_style():
style = {
"BLACK": "38;5;16",
"BLUE": "38;5;20",
"CYAN": "38;5;60",
"GREEN": "38;5;28",
"INTENSE_BLACK": "38;5;60",
"INTENSE_BLUE": "38;5;20",
"INTENSE_CYAN": "38;5;60",
"INTENSE_GREEN": "38;5;60",
"INTENSE_PURPLE": "38;5;126",
"INTENSE_RED": "38;5;160",
"INTENSE_WHITE": "38;5;60",
"INTENSE_YELLOW": "38;5;94",
"NO_COLOR": "0",
"PURPLE": "38;5;126",
"RED": "38;5;160",
"WHITE": "38;5;60",
"YELLOW": "38;5;94",
}
_ansi_expand_style(style)
return style
ANSI_STYLES = LazyDict(
{
"algol": _algol_style,
"algol_nu": _algol_nu_style,
"autumn": _autumn_style,
"borland": _borland_style,
"bw": _bw_style,
"colorful": _colorful_style,
"default": _default_style,
"emacs": _emacs_style,
"friendly": _friendly_style,
"fruity": _fruity_style,
"igor": _igor_style,
"lovelace": _lovelace_style,
"manni": _manni_style,
"monokai": _monokai_style,
"murphy": _murphy_style,
"native": _native_style,
"paraiso-dark": _paraiso_dark_style,
"paraiso-light": _paraiso_light_style,
"pastie": _pastie_style,
"perldoc": _perldoc_style,
"rrt": _rrt_style,
"tango": _tango_style,
"trac": _trac_style,
"vim": _vim_style,
"vs": _vs_style,
"xcode": _xcode_style,
},
globals(),
"ANSI_STYLES",
)
del (
_algol_style,
_algol_nu_style,
_autumn_style,
_borland_style,
_bw_style,
_colorful_style,
_default_style,
_emacs_style,
_friendly_style,
_fruity_style,
_igor_style,
_lovelace_style,
_manni_style,
_monokai_style,
_murphy_style,
_native_style,
_paraiso_dark_style,
_paraiso_light_style,
_pastie_style,
_perldoc_style,
_rrt_style,
_tango_style,
_trac_style,
_vim_style,
_vs_style,
_xcode_style,
)
#
# Dynamically generated styles
#
def make_ansi_style(palette):
"""Makes an ANSI color style from a color palette"""
style = {"NO_COLOR": "0"}
for name, t in BASE_XONSH_COLORS.items():
closest = find_closest_color(t, palette)
if len(closest) == 3:
closest = "".join([a * 2 for a in closest])
short = rgb2short(closest)[0]
style[name] = "38;5;" + short
style["BOLD_" + name] = "1;38;5;" + short
style["UNDERLINE_" + name] = "4;38;5;" + short
style["BOLD_UNDERLINE_" + name] = "1;4;38;5;" + short
style["BACKGROUND_" + name] = "48;5;" + short
return style
def ansi_style_by_name(name):
"""Gets or makes an ANSI color style by name. If the styles does not
exist, it will look for a style using the pygments name.
"""
if name in ANSI_STYLES:
return ANSI_STYLES[name]
elif not HAS_PYGMENTS:
raise KeyError("could not find style {0!r}".format(name))
from xonsh.pygments_cache import get_style_by_name
pstyle = get_style_by_name(name)
palette = make_palette(pstyle.styles.values())
astyle = make_ansi_style(palette)
ANSI_STYLES[name] = astyle
return astyle
```
|
Ninja Pandav is a fantasy show that aired on Real TV from 13 March 2009.
Cast
Vishal Thakkar...Arjun
Pooja Pihal...Sahyadari
Sumeet Pathak...Geoff
Sahil Deshmukh...Nakul
Jay Thakkar...Ghattu
Nawab Shah...Alambush
References
Real (TV channel) original programming
2009 Indian television series debuts
2009 Indian television series endings
Indian television soap operas
Indian fantasy television series
Ninja fiction
Martial arts television series
|
```javascript
/* your_sha256_hash--------------
*
* # Sticky sidebar with native scrollbar
*
* Specific JS code additions for layout_fixed_native.html page
*
* Version: 1.1
* Latest update: Dec 14, 2015
*
* your_sha256_hash------------ */
$(function() {
// Mini sidebar
// -------------------------
// Setup
function miniSidebar() {
if ($('body').hasClass('sidebar-xs')) {
$('.sidebar-main.sidebar-fixed .sidebar-content').on('mouseenter', function () {
if ($('body').hasClass('sidebar-xs')) {
// Expand fixed navbar
$('body').removeClass('sidebar-xs').addClass('sidebar-fixed-expanded');
}
}).on('mouseleave', function () {
if ($('body').hasClass('sidebar-fixed-expanded')) {
// Collapse fixed navbar
$('body').removeClass('sidebar-fixed-expanded').addClass('sidebar-xs');
}
});
}
}
// Toggle mini sidebar
$('.sidebar-main-toggle').on('click', function (e) {
// Initialize mini sidebar
miniSidebar();
});
});
```
|
```javascript
componentWillReceiveProps Not Triggered After Mounting
Use **React** with other libraries
Shallow compare in **React**
Custom validations for props
Specify a single child
```
|
Marat Zhaksylykuly Abiyev (, Marat Jaqsylyquly Ábıev; born September 6, 1989) is a Kazakh businessman, author of the Kazakhstani Dream book.
Biography
Abiyev was born on September 6, in Kandyagash, Aktobe Region, Republic of Kazakhstan.
In 1999, due to the economic crisis of 1998, the Abiyev family moved to the regional center of Aktobe.
Family
Abiyev Zhaksylyk Medihatovich, the father, graduated from Kazakh Polytechnic Institute named after V.I. Lenin now called Satbayev Kazakh National Technical University, majoring in machinery and equipment for Oil and Gas Industry. He worked with such organizations as: Aktobe oil exploration, geophysical expedition in the position of a diesel engineman; Oktyabrskoe Drilling Operations Institution in the positions of a mechanic and shop superintendent; Central Operational Support Base in the position of the chief engineer; TOO KKBK Velikaya Stena in the position of the shop superintendent; In recent years he worked as the deputy commander for operations at the VPFO Ak Beren Central Headquarters Professional Uniformed Emergency Services State Enterprise in the rank of lieutenant colonel.
Abiyeva Tamara Asauhanovna, the mother, is a teacher at the university on the Architecture and building construction course, the Kazakh SSR chess champion.
Zhaksylyk Marzhangul Zhaksylykovna, a sister, is a full-time student at Kazakh Humanities and Law Institute of the Ministry of Justice of the Republic of Kazakhstan (KAZGUU).
After graduating from high school, he entered the Aktobe Cooperative College majoring in automated systems for information processing and management. He graduated from Aktobe Cooperative College in 2009.
In 2002 he started working in network marketing.
From 2003 to 2005 he was a producer of various Aktobe's rap bands.
In 2007 M.Z. Abiyev started working as an entrepreneur. He started two companies, one called W and the other one called IT-outsourcing. The W company was a web-based studio which was engaged in creation, design, and maintenance of websites. It was one of the first companies in the Aktobe region offering website services. W Web Studio won the Best in the service sector medal-award. The company offered full and partial support of the activity, as well as the maintenance and modernization of IT infrastructure of various companies.
The establishment of the Association of Producers of Kazakhstan association of legal entities was initiated by him in 2012. The main mission of the Association is to "protect and promote domestic producers."
Abiyev is also the founder of various companies in the UK and the Russian Federation. Some of these companies are engaged in the sale of goods produced in the Republic of Kazakhstan. Others are involved in international trade for the supply of the metal, food and medical equipment to the Islamic Republic of Iran from the United Kingdom, the Russian Federation, Turkey, People's Republic of China and Belarus.
Bibliography
"Kazakhstan's Dream" (2013)
Notes
Kapital.kz Business Portal named Abiyev Marat person of the year in 2013. The following people have also been named person of 2013: Nursultan Nazarbayev, Grigory Marchenko, Kenges Rakishev and Mikhail Lomtadze.
References
1989 births
Living people
People from Mugalzhar District
Kazakhstani businesspeople
Kazakhstani male writers
|
```smalltalk
//
// AudioSettings.cs: Implements strongly typed access for AV audio settings
//
// Authors: Marek Safar (marek.safar@gmail.com)
//
//
// Permission is hereby granted, free of charge, to any person obtaining
// a copy of this software and associated documentation files (the
// "Software"), to deal in the Software without restriction, including
// without limitation the rights to use, copy, modify, merge, publish,
// distribute, sublicense, and/or sell copies of the Software, and to
// permit persons to whom the Software is furnished to do so, subject to
// the following conditions:
//
// The above copyright notice and this permission notice shall be
// included in all copies or substantial portions of the Software.
//
// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
// EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
// NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
// LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
// OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
// WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
//
using System;
using Foundation;
using CoreFoundation;
using ObjCRuntime;
using AudioToolbox;
#nullable enable
namespace AVFoundation {
#if NET
[SupportedOSPlatform ("ios")]
[SupportedOSPlatform ("maccatalyst")]
[SupportedOSPlatform ("macos")]
[SupportedOSPlatform ("tvos")]
#endif
// Should be called AVAudioSetting but AVAudioSetting has been already used by keys class
public class AudioSettings : DictionaryContainer {
#if !COREBUILD
public AudioSettings ()
: base (new NSMutableDictionary ())
{
}
public AudioSettings (NSDictionary dictionary)
: base (dictionary)
{
}
public AudioFormatType? Format {
set {
SetNumberValue (AVAudioSettings.AVFormatIDKey, (int?) value);
}
get {
return (AudioFormatType?) GetInt32Value (AVAudioSettings.AVFormatIDKey);
}
}
public double? SampleRate {
set {
SetNumberValue (AVAudioSettings.AVSampleRateKey, value);
}
get {
return GetDoubleValue (AVAudioSettings.AVSampleRateKey);
}
}
public int? NumberChannels {
set {
SetNumberValue (AVAudioSettings.AVNumberOfChannelsKey, value);
}
get {
return GetInt32Value (AVAudioSettings.AVNumberOfChannelsKey);
}
}
public int? LinearPcmBitDepth {
set {
if (!(value == 8 || value == 16 || value == 24 || value == 32))
throw new ArgumentOutOfRangeException ("value must be of 8, 16, 24 or 32");
SetNumberValue (AVAudioSettings.AVLinearPCMBitDepthKey, value);
}
get {
return GetInt32Value (AVAudioSettings.AVLinearPCMBitDepthKey);
}
}
public bool? LinearPcmBigEndian {
set {
SetBooleanValue (AVAudioSettings.AVLinearPCMIsBigEndianKey, value);
}
get {
return GetBoolValue (AVAudioSettings.AVLinearPCMIsBigEndianKey);
}
}
public bool? LinearPcmFloat {
set {
SetBooleanValue (AVAudioSettings.AVLinearPCMIsFloatKey, value);
}
get {
return GetBoolValue (AVAudioSettings.AVLinearPCMIsFloatKey);
}
}
public bool? LinearPcmNonInterleaved {
set {
SetBooleanValue (AVAudioSettings.AVLinearPCMIsNonInterleaved, value);
}
get {
return GetBoolValue (AVAudioSettings.AVLinearPCMIsNonInterleaved);
}
}
public AVAudioQuality? AudioQuality {
set {
SetNumberValue (AVAudioSettings.AVEncoderAudioQualityKey, (nint?) (long?) value);
}
get {
return (AVAudioQuality?) (long?) GetNIntValue (AVAudioSettings.AVEncoderAudioQualityKey);
}
}
public AVAudioQuality? SampleRateConverterAudioQuality {
set {
SetNumberValue (AVAudioSettings.AVSampleRateConverterAudioQualityKey, (nint?) (long?) value);
}
get {
return (AVAudioQuality?) (long?) GetNIntValue (AVAudioSettings.AVSampleRateConverterAudioQualityKey);
}
}
public int? EncoderBitRate {
set {
SetNumberValue (AVAudioSettings.AVEncoderBitRateKey, value);
}
get {
return GetInt32Value (AVAudioSettings.AVEncoderBitRateKey);
}
}
public int? EncoderBitRatePerChannel {
set {
SetNumberValue (AVAudioSettings.AVEncoderBitRatePerChannelKey, value);
}
get {
return GetInt32Value (AVAudioSettings.AVEncoderBitRatePerChannelKey);
}
}
public int? EncoderBitDepthHint {
set {
if (value < 8 || value > 32)
throw new ArgumentOutOfRangeException ("value is required to be between 8 and 32");
SetNumberValue (AVAudioSettings.AVEncoderBitDepthHintKey, value);
}
get {
return GetInt32Value (AVAudioSettings.AVEncoderBitDepthHintKey);
}
}
#if NET
[SupportedOSPlatform ("ios")]
[SupportedOSPlatform ("maccatalyst")]
[SupportedOSPlatform ("macos")]
[SupportedOSPlatform ("tvos")]
#endif
public AVAudioBitRateStrategy? BitRateStrategy {
set {
NSString? v = null;
switch (value) {
case AVAudioBitRateStrategy.Constant:
v = AVAudioSettings._Constant;
break;
case AVAudioBitRateStrategy.LongTermAverage:
v = AVAudioSettings._LongTermAverage;
break;
case AVAudioBitRateStrategy.VariableConstrained:
v = AVAudioSettings._VariableConstrained;
break;
case AVAudioBitRateStrategy.Variable:
v = AVAudioSettings._Variable;
break;
case null:
break;
default:
throw new ArgumentOutOfRangeException ("value");
}
SetStringValue (AVAudioSettings.AVEncoderBitRateStrategyKey, v);
}
get {
var k = GetNSStringValue (AVAudioSettings.AVEncoderBitRateStrategyKey);
if (k == AVAudioSettings._Constant)
return AVAudioBitRateStrategy.Constant;
if (k == AVAudioSettings._LongTermAverage)
return AVAudioBitRateStrategy.LongTermAverage;
if (k == AVAudioSettings._VariableConstrained)
return AVAudioBitRateStrategy.VariableConstrained;
if (k == AVAudioSettings._Variable)
return AVAudioBitRateStrategy.Variable;
return null;
}
}
#if NET
[SupportedOSPlatform ("ios")]
[SupportedOSPlatform ("maccatalyst")]
[SupportedOSPlatform ("macos")]
[SupportedOSPlatform ("tvos")]
#endif
public AVSampleRateConverterAlgorithm? SampleRateConverterAlgorithm {
get {
var k = GetNSStringValue (AVAudioSettings.AVSampleRateConverterAlgorithmKey);
if (k == AVAudioSettings.AVSampleRateConverterAlgorithm_Normal)
return AVSampleRateConverterAlgorithm.Normal;
if (k == AVAudioSettings.AVSampleRateConverterAlgorithm_Mastering)
return AVSampleRateConverterAlgorithm.Mastering;
return null;
}
set {
NSString? v = null;
switch (value) {
case AVSampleRateConverterAlgorithm.Mastering:
v = AVAudioSettings.AVSampleRateConverterAlgorithm_Mastering;
break;
case AVSampleRateConverterAlgorithm.Normal:
v = AVAudioSettings.AVSampleRateConverterAlgorithm_Normal;
break;
case null:
break;
default:
throw new ArgumentOutOfRangeException ("value");
}
SetStringValue (AVAudioSettings.AVSampleRateConverterAlgorithmKey, v);
}
}
#if NET
[SupportedOSPlatform ("ios")]
[SupportedOSPlatform ("maccatalyst")]
[SupportedOSPlatform ("macos")]
[SupportedOSPlatform ("tvos")]
#endif
public AVAudioQuality? EncoderAudioQualityForVBR {
get {
return (AVAudioQuality?) (long?) GetNIntValue (AVAudioSettings.AVEncoderAudioQualityForVBRKey);
}
set {
SetNumberValue (AVAudioSettings.AVEncoderAudioQualityForVBRKey, (nint?) (long?) value);
}
}
public AudioChannelLayout ChannelLayout {
set {
SetNativeValue (AVAudioSettings.AVChannelLayoutKey, value is null ? null : value.AsData ());
}
}
#endif
}
}
```
|
```xml
import { hacker, name } from 'faker';
import * as React from 'react';
import { useBooleanKnob, useSelectKnob, useStringKnob } from '@fluentui/docs-components';
import {
EmojiIcon,
EyeFriendlierIcon,
LikeIcon,
MentionIcon,
MoreIcon,
PersonIcon,
PresenceAvailableIcon,
RedbangIcon,
} from '@fluentui/react-icons-northstar';
import {
Avatar,
Chat,
ChatItem,
ChatItemProps,
ChatMessageProps,
MenuProps,
ReactionProps,
ShorthandCollection,
ShorthandValue,
} from '@fluentui/react-northstar';
const attachedMap: Record<'top' | 'bottom' | 'true' | 'false', ChatItemProps['attached']> = {
top: 'top',
bottom: 'bottom',
true: true,
false: false,
};
const actionMenu: ShorthandValue<MenuProps> = {
iconOnly: true,
items: [
{ key: 'like', icon: <LikeIcon />, title: 'Like' },
{ key: 'more', icon: <MoreIcon />, title: 'More' },
],
};
const reactionGroup: ShorthandCollection<ReactionProps> = [
{ key: 'up', icon: <LikeIcon />, content: 1 },
{ key: 'smile', icon: <EmojiIcon />, content: 3 },
];
const ChatPlayground: React.FunctionComponent = () => {
// ChatProps
const [density] = useSelectKnob({ name: 'density', initialValue: 'comfy', values: ['compact', 'comfy'] });
// ChatItemProps
const [attachedValue] = useSelectKnob({
name: 'attached',
initialValue: 'false',
values: ['top', 'bottom', 'true', 'false'],
});
const [contentPosition] = useSelectKnob({ name: 'contentPosition', initialValue: 'start', values: ['start', 'end'] });
// ChatMessageProps
const [actions] = useBooleanKnob({ name: 'actionMenu', content: 'show actions' });
const [author] = useStringKnob({ name: 'author', initialValue: `${name.firstName()} ${name.lastName()}` });
const [badge] = useSelectKnob({
name: 'badge',
content: 'badge type',
allowsNone: true,
values: ['important', 'mention'],
});
const [content] = useStringKnob({ name: 'content', initialValue: hacker.phrase() });
const [details] = useStringKnob({ name: 'details' });
const [header] = useStringKnob({ name: 'header' });
const [mine] = useBooleanKnob({ name: 'mine' });
const [reactions] = useBooleanKnob({ name: 'reactionGroup', content: 'show reactions' });
const [reactionGroupPosition] = useSelectKnob({
name: 'reactionGroupPosition',
initialValue: 'start',
values: ['start', 'end'],
});
const [readStatus] = useSelectKnob({
name: 'readStatus',
content: 'read status',
allowsNone: true,
values: ['sent', 'read'],
});
const [timestamp] = useStringKnob({ name: 'timestamp', initialValue: 'Yesterday, 10:15' });
const attached = attachedMap[attachedValue];
const size = density === 'compact' ? 'smallest' : undefined;
const chatItemProps: ChatItemProps = {
...(attached && { attached }),
...(contentPosition === 'end' && { contentPosition }),
};
// Create prop object with default props only to minimize displayed example code
const chatMessageProps: ChatMessageProps = {
...(actions && { actionMenu }),
...(author && { author }),
...(badge === 'important' && {
badge: {
icon: <RedbangIcon />,
},
variables: { isImportant: true },
}),
...(badge === 'mention' && {
badge: {
icon: <MentionIcon />,
},
variables: { hasMention: true },
}),
...(content && { content }),
...(details && { details }),
...(header && { header }),
...(reactions && { reactionGroup }),
...(readStatus === 'sent' && {
readStatus: {
title: 'Sent',
content: <PresenceAvailableIcon size="small" />,
},
}),
...(readStatus === 'read' && {
readStatus: {
title: 'Read by All',
content: <EyeFriendlierIcon size="small" />,
},
}),
...(timestamp && { timestamp }),
};
return (
<Chat density={density}>
<ChatItem
gutter={<Avatar icon={<PersonIcon />} size={size} />}
message={<Chat.Message mine={mine} reactionGroupPosition={reactionGroupPosition} {...chatMessageProps} />}
{...chatItemProps}
/>
</Chat>
);
};
export default ChatPlayground;
```
|
The Ellis R. Lippincott Award is awarded annually to recognize "an individual who has made significant contributions to vibrational spectroscopy as judged by his or her influence on other scientists."
It was jointly established in 1975 by The Optical Society, The Coblentz Society, and The Society for Applied Spectroscopy. The award honors Ellis R. Lippincott, a vibrational spectroscopist who worked at the University of Maryland. Lippincott was one of the developers of the Diamond anvil cell, which is used in high pressure research.
Past winners of the Lippincott Award
2023 Peter R. Griffiths
2022 Martin Zanni
2021 Rohit Bhargava
2020 Volker Deckert
2019 Ji-Xin Cheng
2018 Peter Hamm
2017 Roberto Merlin
2016 Thomas Elsaesser
2015
2014
2013 Xiaoliang Sunney Xie
2012 Keith A. Nelson
2011 Isao Noda
2010
2009 Michael D. Fayer
2008 Richard P. Van Duyne
2007 Jonathan Tennyson
2006 Hai-Lung Dai
2005
2004
2003 Shaul Mukamel
2002
2001 Lester Andrews
2000 Donald Levy
1999 Mitsuo Tasumi
1998 Takeshi Oka
1997 Robin Hochstrasser
1996
1995 Giacinto Scoles
1994 Herbert L. Strauss
1993
1992 Richard Saykally
1990 Robert W. Field
1989 Marilyn E. Jacox
1988 Andreas C. Albrecht
1987 C. Bradley Moore
1986 Wolfgang Kaiser
1985
1984 Jon T. Hougen
1983
1982
1981
1980 George C. Pimentel
1979 E. Bright Wilson
1978 Bryce L. Crawford, Jr.
1977
1976 Richard C. Lord
See also
List of physics awards
References
Awards of Optica (society)
Spectroscopy
|
```java
/*
*
*
* path_to_url
*
* Unless required by applicable law or agreed to in writing, software
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
*/
package toothpick.data;
import javax.inject.Inject;
import javax.inject.Singleton;
@Singleton // annotation is not needed, but it's a better example
public class FooSingleton implements IFooSingleton {
@Inject public Bar bar; // annotation is not needed, but it's a better example
@Inject
public FooSingleton() {}
}
```
|
Carmelo Ríos Figueroa (October 11, 1959 – October 21, 2022) was a Puerto Rican long-distance runner, who competed for his native country in the men's 3000 m steeplechase at the 1984 Summer Olympics. He set his personal best (8:28.89) in that event on June 17, 1983 in Indianapolis, Indiana.
Background
Ríos was the silver medalist at the 1983 Pan American Games and competed at the 1983 World Championships in Athletics later that year, where he was knocked out in the heats stage. In his only Olympic appearance in 1984, he finished twelfth in his semi-final in the men's steeplechase. He took the bronze medal at the 1985 CAC Championships.
Ríos attended California Polytechnic State University, San Luis Obispo, where he still holds the school record in the Steeplechase set at the USA Outdoor Track and Field Championships in Indianapolis, Indiana at 8:28.89 from 1983. Prior to Cal Poly, he competed for Long Beach City College, winning the state community college championship back to back in 1979 and 80. He was also the Southern California champion at 10,000 meters and the third individual at the State Cross Country championships. In 2013, he was honored in the Long Beach City College "Hall of Champions."
Death
Ríos died on October 21, 2022, at the age of 63.
Achievements
Notes
References
External links
sports-reference
1959 births
2022 deaths
Place of birth missing
Puerto Rican male steeplechase runners
Puerto Rican male long-distance runners
Pan American Games silver medalists for Puerto Rico
Pan American Games medalists in athletics (track and field)
Olympic track and field athletes for Puerto Rico
Athletes (track and field) at the 1983 Pan American Games
Athletes (track and field) at the 1984 Summer Olympics
California Polytechnic State University alumni
Cal Poly Mustangs track and field
Medalists at the 1983 Pan American Games
|
Douglas Hung (; born 13 March 1936) is a Taiwanese politician.
Hung earned a bachelor's and master's degree in diplomacy from National Chengchi University. He settled in San Francisco, where he was involved in several Taiwanese cultural and economic associations. Hung was also an administrator at Lincoln University. He soon began working for the Ministry of Foreign Affairs in San Francisco, and was subsequently appointed to the Overseas Chinese Affairs Commission. Hung returned to Taiwan to serve on the presidium of the second National Assembly, and was also a member of the Kuomintang's overseas residents and diplomacy committee. He was elected to the Legislative Yuan in 1998 as a Kuomintang-affiliated representative of Overseas Chinese. During his tenure on the fourth Legislative Yuan, Hung maintained an interest in the foreign relations of Taiwan.
References
Politicians of the Republic of China on Taiwan from Changhua County
Party List Members of the Legislative Yuan
Kuomintang Members of the Legislative Yuan in Taiwan
Members of the 4th Legislative Yuan
1936 births
Living people
Taiwanese expatriates in the United States
National Chengchi University alumni
Taiwanese academic administrators
|
Hyas coarctatus is a marine crab species native to the North Atlantic. It is characterized by a lyriformed shell.
Morphology
Hyas coarctatus looks like the great spider crab (H. araneus) but has a lyriformed shell. The carapace of a large specimen is up to 60 mm long and 44 mm wide. The colour is grey-brown on the dorsal side, sometimes with a bit reddish, the ventral side is dirty white. The rostral horns of H. coarctatus are slightly longer and spaced further apart than in H. araneus. Chelipeds are longer than in H. araneus. The outer segment of the walking legs is often more or less furry.
Distribution and ecology
H. coarctatus is found at both hard, stony, sandy and soft bottoms from 1 to 500 meters depth, though most often above 50 meters. H. araneus inhabits shallower depths. H. coarctatus is widely distributed in the North-East Atlantic and adjacent seas. The northern border is around the north and west coasts of Spitsbergen and Barents Sea, in the south it is found down to the north-east coast of France, and in the east to the Western Baltic Sea, the Belt Sea and the Öresund.
References
Majoidea
Crabs of the Atlantic Ocean
Crustaceans described in 1815
Taxa named by William Elford Leach
|
This is a partial list of churches in Greater Manchester, North West England, split according to metropolitan district. There is a mixture of Christian denominations in Greater Manchester, including churches aligned to Orthodox Christianity, Protestantism and Catholicism. Similarly, there is a range of ecclesiastical architecture.
Bolton
Bury
Manchester
Oldham
Rochdale
Salford
Stockport
Tameside
Trafford
Wigan
See also
Salford (hundred)
Manchester (ancient parish)
List of places in Greater Manchester
Anglican Diocese of Manchester
List of Roman Catholic churches in the Diocese of Salford
Anglican Diocese of Chester
Roman Catholic Diocese of Salford
Roman Catholic Diocese of Shrewsbury
Roman Catholic Archdiocese of Liverpool
Grade I listed buildings in Greater Manchester
Grade II* listed buildings in Greater Manchester
References
Bibliography
List
Greater Manchester
Churches in Greater Manchester
|
```html
<html lang="en">
<head>
<title>div - Untitled</title>
<meta http-equiv="Content-Type" content="text/html">
<meta name="description" content="Untitled">
<meta name="generator" content="makeinfo 4.8">
<link title="Top" rel="start" href="index.html#Top">
<link rel="up" href="Stdlib.html#Stdlib" title="Stdlib">
<link rel="prev" href="calloc.html#calloc" title="calloc">
<link rel="next" href="ecvtbuf.html#ecvtbuf" title="ecvtbuf">
<link href="path_to_url" rel="generator-home" title="Texinfo Homepage">
<meta http-equiv="Content-Style-Type" content="text/css">
<style type="text/css"><!--
pre.display { font-family:inherit }
pre.format { font-family:inherit }
pre.smalldisplay { font-family:inherit; font-size:smaller }
pre.smallformat { font-family:inherit; font-size:smaller }
pre.smallexample { font-size:smaller }
pre.smalllisp { font-size:smaller }
span.sc { font-variant:small-caps }
span.roman { font-family:serif; font-weight:normal; }
span.sansserif { font-family:sans-serif; font-weight:normal; }
--></style>
</head>
<body>
<div class="node">
<p>
<a name="div"></a>
Next: <a rel="next" accesskey="n" href="ecvtbuf.html#ecvtbuf">ecvtbuf</a>,
Previous: <a rel="previous" accesskey="p" href="calloc.html#calloc">calloc</a>,
Up: <a rel="up" accesskey="u" href="Stdlib.html#Stdlib">Stdlib</a>
<hr>
</div>
<h3 class="section">2.12 <code>div</code>—divide two integers</h3>
<p><a name="index-div-19"></a><strong>Synopsis</strong>
<pre class="example"> #include <stdlib.h>
div_t div(int <var>n</var>, int <var>d</var>);
</pre>
<p><strong>Description</strong><br>
Divide
<var>n</var>/<var>d</var>,
returning quotient and remainder as two integers in a structure <code>div_t</code>.
<pre class="sp">
</pre>
<strong>Returns</strong><br>
The result is represented with the structure
<pre class="smallexample"> typedef struct
{
int quot;
int rem;
} div_t;
</pre>
<p>where the <code>quot</code> field represents the quotient, and <code>rem</code> the
remainder. For nonzero <var>d</var>, if `<var>r</var><code> = div(</code><var>n</var><code>,</code><var>d</var><code>);</code>' then
<var>n</var> equals `<var>r</var><code>.rem + </code><var>d</var><code>*</code><var>r</var><code>.quot</code>'.
<p>To divide <code>long</code> rather than <code>int</code> values, use the similar
function <code>ldiv</code>.
<pre class="sp">
</pre>
<strong>Portability</strong><br>
<code>div</code> is ANSI.
<p>No supporting OS subroutines are required.
<pre class="sp">
</pre>
</body></html>
```
|
Hiram Collins Haydn (November 3, 1907 – December 2, 1973) was an American writer and editor. He was editor in chief at Random House before leaving to help establish Atheneum Publishing. He was also the editor of Phi Beta Kappa's literary journal, The American Scholar, from 1944 to 1973.
Biography
Born in Cleveland, Ohio, Haydn graduated from Amherst College in 1928, and later received a master's degree from Western Reserve University and a Ph.D. from Columbia University in 1942. He married Rachel Hutchinson Norris in 1935, later divorced; in 1945 he married Mary Wescott Tuttle.
In 1945 Haydn became editor, later editor in chief, for Crown Publishers until he moved to Bobbs-Merrill in 1950 and to Random House in 1955, where he became editor in chief in 1956. In 1959 he became one of the founders of Atheneum together with Simon Bessie and Alfred Knopf Jr. He left in 1964 to join Harcourt, Brace & World.
Among the writers he worked with as editor were William Styron, William Goldman, William Faulkner, and Ayn Rand. Books series he edited included the Makers of the American Tradition Series (Bobbs-Merrill) and The Twentieth Century Library (Charles Scribner's Sons).
He wrote five novels, as well as an academic work about the "counter revolution" that he argued took place during the middle period of the Renaissance. His memoir, Words & Faces, was published posthumously. During his career he also taught at several colleges including the University of North Carolina, The New School for Social Research, the Center for Advanced Study at Wesleyan University, and the Annenberg School for Communication at the University of Pennsylvania.
Haydn had a seasonal home in Chilmark, Massachusetts, on Martha's Vineyard, where he died of a heart attack in December 1973 at age 66. He was survived by his wife Mary, two sons, and two daughters.
Books
Novels
By Nature Free (1943)
Manhattan Furlough (1945)
The Time is Noon (1948)
The Hands of Esau (1962)
Report from the Red Windmill (1967)
History
The Counter-Renaissance (1950)
Memoir
Words & Faces (1974)
References
American book editors
1907 births
1973 deaths
Writers from Cleveland
Amherst College alumni
Case Western Reserve University alumni
Columbia University alumni
People from Chilmark, Massachusetts
|
Ronald Ramon Heller (born August 25, 1962) is an American football coach and former offensive tackle, who played twelve seasons in the National Football League for the Tampa Bay Buccaneers, Philadelphia Eagles and Miami Dolphins. Heller is the former assistant offensive line coach for the New York Jets of the National Football League (NFL), a position he assumed in February 2013 to January 2016.
Playing career
As a football player, Heller, a graduate of Penn State was chosen by the Tampa Bay Buccaneers in the fourth round of the 1984 NFL Draft, where he played offensive tackle. He was traded to the Seattle Seahawks who in turn traded him to the Philadelphia Eagles for a fourth round draft pick.
The 6-foot-6, 290-pound Heller started all but one game for the Eagles at right tackle in 1988. Overall, he played in 75 regular season contests for Philadelphia, at both right and left tackle. After missing one game in his first season with the team, he didn't miss another until he was sidelined for four games in 1992 due to a foot injury. Following the 1992 season, Heller signed with the Miami Dolphins and played three seasons with them before a knee injury forced him to retire.
Coaching career
Heller gained his first NFL coaching experience in 2004 as a season-long intern coach with the Amsterdam Admirals in NFL Europe. He became the Admirals' offensive line coach in 2006 under head coach Bart Andrus, and was promoted to offensive coordinator in 2007.
Heller rejoined Andrus on the staff of the Toronto Argonauts, January 23, 2009, when he was hired as the team's offensive line coach.
In February 2010, Heller was hired by the Jacksonville Jaguars as an offensive staff assistant.
References
External links
Jacksonville Jaguars bio
Toronto Argonauts bio
1962 births
Living people
Players of American football from New York City
People from East Meadow, New York
American football offensive tackles
Penn State Nittany Lions football players
Tampa Bay Buccaneers players
Philadelphia Eagles players
Miami Dolphins players
Amsterdam Admirals coaches
Toronto Argonauts coaches
Jacksonville Jaguars coaches
Omaha Nighthawks coaches
New York Jets coaches
Farmingdale High School alumni
|
```shell
Quick `cd` tips
Repeating commands with `watch`
Rapidly invoke an editor to write a long, complex, or tricky command
Execute a command without saving it in history
Terminal incognito mode
```
|
Amanda C. Farías (born July 9, 1989) is an American politician from New York City. She is the Democratic City Council Member for the 18th district of the New York City Council, which covers Soundview, Parkchester, and Castle Hill in the Bronx. She is Chair of the Committee on Economic Development, and sit as a member on the following committees transportation, finance, sanitation, consumer and worker protection, cultural and intergoup relations, and Co-Chair of the Women’s Caucus, and a member of the Black, Latino and Asian Caucus and Progressive Caucus.
Early life
Farías was born in Soundview in the Bronx to Dominican and Puerto Rican parents. She graduated from Preston High School in 2007, and went on to receive both her undergraduate and master's degree in political science from St. John's University in 2011 and 2012, respectively.
Post-graduation, Farías worked briefly for Barack Obama's re-election campaign before joining the staff of Councilwoman Elizabeth Crowley of Queens, where she remained until her own bid for the City Council.
Political career
2017 City Council campaign
In 2017, Farías ran for the 18th district of the New York City Council, which was held by term-limited Democrat Annabel Palma. Farías was one of several candidates in the Democratic primary aiming to defeat Rubén Díaz Sr., a longtime conservative and controversial state senator with the support of the Bronx Democratic Party apparatus.
Despite Farías' endorsements from some sitting councilmembers and other groups aiming to prevent a Díaz victory, her campaign was seen as fighting an uphill battle against the well-connected and well-funded Díaz. On election night in September, Díaz emerged victorious with 42 percent of the vote; Farías received 21 percent, and three other candidates running to Díaz's left took the remainder.
Inter-Council years
Fresh off her loss for City Council, Farías successfully ran for Democratic state committee, defeating a 21-year incumbent in the process. She also worked for a series of activist and nonprofit organizations, including New American Leaders, Riders Alliance, Women of Color for Progress, and the Consortium for Worker Education.
2021 City Council campaign
Early in 2019, Farías announced that she would seek a rematch against Díaz, now an incumbent. However, Díaz surprised observers in July 2020 when, after an unsuccessful bid for Congress, he announced he would not seek re-election to a second term on the City Council.
Now running for an open seat, Farías was able to consolidate support to a far greater extent than in 2017. The Bronx Democratic Party, which had supported Díaz four years earlier, endorsed Farías, as did Congressman Ritchie Torres and most other local elected officials. Her main opponent in the primary was Bronx Community Board 9 district manager William Rivera, who had the support of Bronx Borough President Rubén Díaz Jr. and the incumbent, and who came under fire for seemingly diverting thousands of the board's dollars to his own nonprofit.
Farías topped the eight-candidate field on election night with 27 percent of the vote; after absentee ballots and ranked-choice votes were counted, she defeated Rivera 52-48%, and formally declared victory on July 7. She later won the general election by a wide margin and took office on January 1, 2022.
Personal life
Farías was born and raised in Soundview. Currently resides in the surrouding Parkchester community.
References
1989 births
21st-century American politicians
21st-century American women politicians
American politicians of Dominican Republic descent
American politicians of Puerto Rican descent
Hispanic and Latino American women in politics
Living people
New York (state) Democrats
New York City Council members
Politicians from the Bronx
Puerto Rican people in New York (state) politics
St. John's University (New York City) alumni
Women New York City Council members
|
```xml
<?xml version="1.0" encoding="utf-8"?>
<Project xmlns="path_to_url">
<ImportGroup Label="PropertySheets" />
<ItemDefinitionGroup>
<ClCompile>
<DebugInformationFormat>None</DebugInformationFormat>
<Optimization>MinSpace</Optimization>
<FavorSizeOrSpeed>Size</FavorSizeOrSpeed>
<OmitFramePointers>true</OmitFramePointers>
<RuntimeLibrary>MultiThreaded</RuntimeLibrary>
<BasicRuntimeChecks>Default</BasicRuntimeChecks>
<BufferSecurityCheck>false</BufferSecurityCheck>
</ClCompile>
<Link>
<AdditionalDependencies>ntdll\ntdllp_$(PlatformShortName).lib</AdditionalDependencies>
<IgnoreAllDefaultLibraries>true</IgnoreAllDefaultLibraries>
<GenerateDebugInformation>false</GenerateDebugInformation>
</Link>
</ItemDefinitionGroup>
</Project>
```
|
Sulphur Springs Water Tower is a landmark of Tampa, Florida. It stands tall, with a foundation deep which makes it visible from nearby Interstate 275 and much of the rest of Sulphur Springs. It's located in the historic district of Sulphur Springs.
History
Modern history
The water tower was built in 1927 by Grover Poole for realtor and developer Josiah S. Richardson to supply adequate water pressure to the Sulphur Springs Hotel and Apartments and Mave's Arcade Richardson had developed next to Sulphur Spring with plans to expand the resort spa, alligator farm tourist attraction, and other enterprises. Mave's Arcade occupied the first floor of the hotel building and was the first shopping mall in Florida.
Richardson mortgaged the entire resort ($180,000 at the time) to finance the construction of the tower. However, in 1933, with the sabotage and collapse of the Tampa Electric Company dam that ripped through downtown Tampa during the Depression (draining cow pasture land that had been inconveniently flooded by the dam's construction), the arcade was heavily damaged, the businesses in the arcade failed, and Richardson lost everything.
From construction until 1971, the water tower operated as a private water company piping artesian well water to commercial and residential customers in the immediate vicinity. The tower is built over the opening of an artesian well and the water well and pumps are located under the tower itself. Another building was on the property which housed fluoridation and filtering equipment when the water company was in business piping artesian well water directly to customers. In 1971 the owner of the water company and tower was "The Estate of J.F. Hendricks" (several beneficiaries under his will including surviving relatives). They were forced by the City of Tampa in 1971 to cease water piping operations so that the City's water utility company could maintain a monopoly over the business of piping water to citizens.
In 1951, the Tower Drive-In theater opened adjacent to the tower property to the east. An aircraft warning light atop the tower (since removed) was said to have interfered with movie viewing.
In the mid-1980s there was a move to develop the property as a condominium or high-end apartment complex, with the tower preserved as its centerpiece. Ultimately, the project fell through. In 1989 the tower was restored: it was pressure washed and painted with 150 gallons of "graffiti proof paint" donated by Sherwin-Williams Co. with labor donated by Service Painting Corp.
2002 saw a bid by a large chain drugstore to build on the site, but public outcry killed the project. The site was subsequently purchased by the City of Tampa who in 2005 installed lights for nighttime illumination. In what is now called River Tower Park, there is a limited one-lane access road off Bird Street, no facilities and a small parking lot. A River Walkway decking is planned.
Architecture
The structure is constructed from poured concrete using railroad rails for "rebar"; the walls are eight inches (203 mm) thick with a buttressed base on solid rock. "Concrete was poured into forms that were raised by yokes and jacks -- went up a day. The tower rests on rock, has cantilever foundation, and with the buttresses will be rather a difficult job to ever destroy," wrote Poole. When it was operational it stored 200,000 gallons of water pumped up from the nearby artesian springs. The water tank occupies the upper quarter of the cylindrical tower while seven floors, one room per floor, constitute the lower three quarters. Original construction included an electric passenger elevator.
References
External links
Landmarks in Tampa, Florida
Buildings and structures in Tampa, Florida
Water towers in Florida
Tourist attractions in Tampa, Florida
Infrastructure completed in 1927
Towers completed in 1927
1927 establishments in Florida
|
```smalltalk
"
Rounded corner border supporting radii of 1-4 pixels. Slower but more flexible than CornerRounder.
"
Class {
#name : 'RoundedBorderStyle',
#superclass : 'SimpleBorderStyle',
#instVars : [
'cornerRadius'
],
#category : 'Morphic-Base-Borders',
#package : 'Morphic-Base',
#tag : 'Borders'
}
{ #category : 'accessing' }
RoundedBorderStyle >> cornerRadius [
"Answer the value of cornerRadius"
^ cornerRadius
]
{ #category : 'accessing' }
RoundedBorderStyle >> cornerRadius: anObject [
"Set the value of cornerRadius"
cornerRadius := anObject
]
{ #category : 'drawing' }
RoundedBorderStyle >> frameRectangle0: aRectangle on: aCanvas [
"Draw the border for a corner radius of 0."
aCanvas
frameAndFillRectangle: aRectangle
fillColor: Color transparent
borderWidth: self width
borderColor: self color
]
{ #category : 'drawing' }
RoundedBorderStyle >> frameRectangle1: aRectangle on: aCanvas [
"Draw the border for a corner radius of 1."
|r|
r := aRectangle insetBy: self width // 2.
self width odd ifTrue: [r := r insetBy: (0@0 corner: 1@1)].
aCanvas
line: r topLeft + (1@0) to: r topRight - (1@0) width: self width color: self color;
line: r topRight + (0@1) to: r bottomRight - (0@1) width: self width color: self color;
line: r bottomRight - (1@0) to: r bottomLeft + (1@0) width: self width color: self color;
line: r bottomLeft - (0@1) to: r topLeft + (0@1) width: self width color: self color
]
{ #category : 'drawing' }
RoundedBorderStyle >> frameRectangle2: aRectangle on: aCanvas [
"Draw the border for a corner radius of 2."
|r|
r := aRectangle insetBy: self width // 2.
self width odd ifTrue: [r := r insetBy: (0@0 corner: 1@1)].
aCanvas
line: r topLeft + (2@0) to: r topRight - (2@0) width: self width color: self color;
line: r topRight + (-1@1) to: r topRight + (-1@1) width: self width color: self color;
line: r topRight + (0@2) to: r bottomRight - (0@2) width: self width color: self color;
line: r bottomRight - (1@1) to: r bottomRight - (1@1) width: self width color: self color;
line: r bottomRight - (2@0) to: r bottomLeft + (2@0) width: self width color: self color;
line: r bottomLeft - (-1@1) to: r bottomLeft - (-1@1) width: self width color: self color;
line: r bottomLeft - (0@2) to: r topLeft + (0@2) width: self width color: self color;
line: r topLeft + (1@1) to: r topLeft + (1@1) width: self width color: self color
]
{ #category : 'drawing' }
RoundedBorderStyle >> frameRectangle3: aRectangle on: aCanvas [
"Draw the border for a corner radius of 3."
|r|
r := aRectangle insetBy: self width // 2.
self width odd ifTrue: [r := r insetBy: (0@0 corner: 1@1)].
aCanvas
line: r topLeft + (3@0) to: r topRight - (3@0) width: self width color: self color;
line: r topRight + (-2@1) to: r topRight + (-1@1) width: self width color: self color;
line: r topRight + (-1@1) to: r topRight + (-1@2) width: self width color: self color;
line: r topRight + (0@3) to: r bottomRight - (0@3) width: self width color: self color;
line: r bottomRight - (1@2) to: r bottomRight - (1@1) width: self width color: self color;
line: r bottomRight - (1@1) to: r bottomRight - (2@1) width: self width color: self color;
line: r bottomRight - (3@0) to: r bottomLeft + (3@0) width: self width color: self color;
line: r bottomLeft - (-2@1) to: r bottomLeft - (-1@1) width: self width color: self color;
line: r bottomLeft - (-1@1) to: r bottomLeft - (-1@2) width: self width color: self color;
line: r bottomLeft - (0@3) to: r topLeft + (0@3) width: self width color: self color;
line: r topLeft + (1@2) to: r topLeft + (1@1) width: self width color: self color;
line: r topLeft + (1@1) to: r topLeft + (2@1) width: self width color: self color
]
{ #category : 'drawing' }
RoundedBorderStyle >> frameRectangle4: aRectangle on: aCanvas [
"Draw the border for a corner radius of 4."
|r|
r := aRectangle insetBy: self width // 2.
self width odd ifTrue: [r := r insetBy: (0@0 corner: 1@1)].
aCanvas
line: r topLeft + (4@0) to: r topRight - (4@0) width: self width color: self color;
line: r topRight + (-3@1) to: r topRight + (-1@2) width: self width color: self color;
line: r topRight + (-1@2) to: r topRight + (-1@3) width: self width color: self color;
line: r topRight + (0@4) to: r bottomRight - (0@4) width: self width color: self color;
line: r bottomRight - (1@3) to: r bottomRight - (1@2) width: self width color: self color;
line: r bottomRight - (2@1) to: r bottomRight - (3@1) width: self width color: self color;
line: r bottomRight - (4@0) to: r bottomLeft + (4@0) width: self width color: self color;
line: r bottomLeft - (-3@1) to: r bottomLeft - (-2@1) width: self width color: self color;
line: r bottomLeft - (-1@2) to: r bottomLeft - (-1@3) width: self width color: self color;
line: r bottomLeft - (0@4) to: r topLeft + (0@4) width: self width color: self color;
line: r topLeft + (1@3) to: r topLeft + (1@2) width: self width color: self color;
line: r topLeft + (2@1) to: r topLeft + (3@1) width: self width color: self color
]
{ #category : 'drawing' }
RoundedBorderStyle >> frameRectangle5: aRectangle on: aCanvas [
"Draw the border for a corner radius of 5."
|r|
r := aRectangle insetBy: self width // 2.
self width odd ifTrue: [r := r insetBy: (0@0 corner: 1@1)].
aCanvas
line: r topLeft + (5@0) to: r topRight - (5@0) width: self width color: self color;
line: r topRight + (-4@1) to: r topRight + (-2@2) width: self width color: self color;
line: r topRight + (-1@3) to: r topRight + (-1@4) width: self width color: self color;
line: r topRight + (0@5) to: r bottomRight - (0@5) width: self width color: self color;
line: r bottomRight - (1@4) to: r bottomRight - (2@2) width: self width color: self color;
line: r bottomRight - (3@1) to: r bottomRight - (4@1) width: self width color: self color;
line: r bottomRight - (5@0) to: r bottomLeft + (5@0) width: self width color: self color;
line: r bottomLeft - (-4@1) to: r bottomLeft - (-3@1) width: self width color: self color;
line: r bottomLeft - (-2@2) to: r bottomLeft - (-1@4) width: self width color: self color;
line: r bottomLeft - (0@5) to: r topLeft + (0@5) width: self width color: self color;
line: r topLeft + (1@4) to: r topLeft + (1@3) width: self width color: self color;
line: r topLeft + (2@2) to: r topLeft + (4@1) width: self width color: self color
]
{ #category : 'drawing' }
RoundedBorderStyle >> frameRectangle6: aRectangle on: aCanvas [
"Draw the border for a corner radius of 6."
|r|
r := aRectangle insetBy: self width // 2.
self width odd ifTrue: [r := r insetBy: (0@0 corner: 1@1)].
aCanvas
line: r topLeft + (6@0) to: r topRight - (6@0) width: self width color: self color;
line: r topRight + (-5@1) to: r topRight + (-3@2) width: self width color: self color;
line: r topRight + (-2@3) to: r topRight + (-2@3) width: self width color: self color;
line: r topRight + (-1@4) to: r topRight + (-1@5) width: self width color: self color;
line: r topRight + (0@6) to: r bottomRight - (0@6) width: self width color: self color;
line: r bottomRight - (1@5) to: r bottomRight - (2@3) width: self width color: self color;
line: r bottomRight - (3@2) to: r bottomRight - (4@1) width: self width color: self color;
line: r bottomRight - (5@1) to: r bottomRight - (6@0) width: self width color: self color;
line: r bottomRight - (7@0) to: r bottomLeft + (6@0) width: self width color: self color;
line: r bottomLeft - (-5@1) to: r bottomLeft - (-4@1) width: self width color: self color;
line: r bottomLeft - (-3@2) to: r bottomLeft - (-3@2) width: self width color: self color;
line: r bottomLeft - (-2@3) to: r bottomLeft - (-1@5) width: self width color: self color;
line: r bottomLeft - (0@6) to: r topLeft + (0@6) width: self width color: self color;
line: r topLeft + (1@5) to: r topLeft + (1@4) width: self width color: self color;
line: r topLeft + (2@3) to: r topLeft + (2@3) width: self width color: self color;
line: r topLeft + (3@2) to: r topLeft + (5@1) width: self width color: self color
]
{ #category : 'drawing' }
RoundedBorderStyle >> frameRectangle7: aRectangle on: aCanvas [
"Draw the border for a corner radius of 7."
|r|
r := aRectangle insetBy: self width // 2.
self width odd ifTrue: [r := r insetBy: (0@0 corner: 1@1)].
aCanvas
line: r topLeft + (7@0) to: r topRight - (7@0) width: self width color: self color;
line: r topRight + (-6@1) to: r topRight + (-5@1) width: self width color: self color;
line: r topRight + (-4@2) to: r topRight + (-2@4) width: self width color: self color;
line: r topRight + (-1@5) to: r topRight + (-1@6) width: self width color: self color;
line: r topRight + (0@7) to: r bottomRight - (0@7) width: self width color: self color;
line: r bottomRight - (1@6) to: r bottomRight - (1@5) width: self width color: self color;
line: r bottomRight - (2@4) to: r bottomRight - (4@2) width: self width color: self color;
line: r bottomRight - (5@1) to: r bottomRight - (6@1) width: self width color: self color;
line: r bottomRight - (7@0) to: r bottomLeft + (7@0) width: self width color: self color;
line: r bottomLeft - (-6@1) to: r bottomLeft - (-5@1) width: self width color: self color;
line: r bottomLeft - (-4@2) to: r bottomLeft - (-2@4) width: self width color: self color;
line: r bottomLeft - (-1@5) to: r bottomLeft - (-1@6) width: self width color: self color;
line: r bottomLeft - (0@7) to: r topLeft + (0@7) width: self width color: self color;
line: r topLeft + (1@6) to: r topLeft + (1@5) width: self width color: self color;
line: r topLeft + (2@4) to: r topLeft + (4@2) width: self width color: self color;
line: r topLeft + (5@1) to: r topLeft + (6@1) width: self width color: self color
]
{ #category : 'drawing' }
RoundedBorderStyle >> frameRectangle8: aRectangle on: aCanvas [
"Draw the border for a corner radius of 8."
|r|
r := aRectangle insetBy: self width // 2.
self width odd ifTrue: [r := r insetBy: (0@0 corner: 1@1)].
aCanvas
line: r topLeft + (8@0) to: r topRight - (8@0) width: self width color: self color;
line: r topRight + (-7@1) to: r topRight + (-6@1) width: self width color: self color;
line: r topRight + (-5@2) to: r topRight + (-2@5) width: self width color: self color;
line: r topRight + (-1@6) to: r topRight + (-1@7) width: self width color: self color;
line: r topRight + (0@8) to: r bottomRight - (0@8) width: self width color: self color;
line: r bottomRight - (1@7) to: r bottomRight - (1@6) width: self width color: self color;
line: r bottomRight - (2@5) to: r bottomRight - (5@2) width: self width color: self color;
line: r bottomRight - (6@1) to: r bottomRight - (7@1) width: self width color: self color;
line: r bottomRight - (8@0) to: r bottomLeft + (8@0) width: self width color: self color;
line: r bottomLeft - (-7@1) to: r bottomLeft - (-6@1) width: self width color: self color;
line: r bottomLeft - (-5@2) to: r bottomLeft - (-2@5) width: self width color: self color;
line: r bottomLeft - (-1@6) to: r bottomLeft - (-1@7) width: self width color: self color;
line: r bottomLeft - (0@8) to: r topLeft + (0@8) width: self width color: self color;
line: r topLeft + (1@7) to: r topLeft + (1@6) width: self width color: self color;
line: r topLeft + (2@5) to: r topLeft + (5@2) width: self width color: self color;
line: r topLeft + (6@1) to: r topLeft + (7@1) width: self width color: self color
]
{ #category : 'drawing' }
RoundedBorderStyle >> frameRectangle: aRectangle on: aCanvas [
"Draw the border. Radius is the x/y offset not width 'around the corner'."
self cornerRadius = 0 ifTrue: [^self frameRectangle0: aRectangle on: aCanvas].
self cornerRadius = 1 ifTrue: [^self frameRectangle1: aRectangle on: aCanvas].
self cornerRadius = 2 ifTrue: [^self frameRectangle2: aRectangle on: aCanvas].
self cornerRadius = 3 ifTrue: [^self frameRectangle3: aRectangle on: aCanvas].
self cornerRadius = 4 ifTrue: [^self frameRectangle4: aRectangle on: aCanvas].
self cornerRadius = 5 ifTrue: [^self frameRectangle5: aRectangle on: aCanvas].
self cornerRadius = 6 ifTrue: [^self frameRectangle6: aRectangle on: aCanvas].
self cornerRadius = 7 ifTrue: [^self frameRectangle7: aRectangle on: aCanvas].
self cornerRadius = 8 ifTrue: [^self frameRectangle8: aRectangle on: aCanvas].
^super frameRectangle: aRectangle on: aCanvas
]
{ #category : 'initialization' }
RoundedBorderStyle >> initialize [
"Initialize the receiver."
super initialize.
self
cornerRadius: 0
]
```
|
Help Me Help You may refer to:
Jerry Macguire (Movie), 1996
Help Me Help You (TV series), 2006
"Help Me Help You" (song), 2017
|
```python
import collections
from visidata import vd, BaseSheet
@BaseSheet.lazy_property
def prevHints(sheet):
return collections.defaultdict(int)
@BaseSheet.api
def getHint(sheet, *args, **kwargs) -> str:
funcs = [getattr(sheet, x) for x in dir(sheet) if x.startswith('hint_')]
results = []
hints = sheet.prevHints
for f in funcs:
try:
r = f(*args, **kwargs)
if r:
if isinstance(r, dict):
n = r.get('_relevance', 1)
v = r
elif isinstance(r, tuple):
n, v = r
else:
n = 1
v = r
if v not in sheet.prevHints:
results.append((n, v))
sheet.prevHints[v] += 1
except Exception as e:
vd.debug(f'{f.__name__}: {e}')
if results:
return sorted(results, reverse=True)[0][1]
vd.addCommand('', 'help-hint', 'status(getHint() or pressMenu("Help"))', 'get context-dependent hint on what to do next')
```
|
```rust
pub mod item;
pub mod item_reader;
pub mod selector;
```
|
```go
package storagesvc
import (
"github.com/prometheus/client_golang/prometheus"
"github.com/fission/fission/pkg/utils/metrics"
)
var (
functionLabels = []string{}
totalArchives = prometheus.NewGaugeVec(
prometheus.GaugeOpts{
Name: "fission_archives",
Help: "Number of archives stored",
},
functionLabels,
)
totalMemoryUsage = prometheus.NewGaugeVec(
prometheus.GaugeOpts{
Name: "fission_archive_memory_bytes",
Help: "Amount of memory consumed by archives",
},
functionLabels,
)
)
func init() {
registry := metrics.Registry
registry.MustRegister(totalArchives)
registry.MustRegister(totalMemoryUsage)
}
```
|
Homebrew is the second studio album by Swedish musician Neneh Cherry. It was released in 1992 via Circa Records. The album features several different genres, including between jazz, funk and trip hop. The album photography was by Jean-Baptiste Mondino. Recording sessions took place at Cherry Bear Studios in London and at the Cherry Bear Mobile, except "Sassy" was additionally recorded at Grapehouse Studios in Copenhagen and "Trout" was additionally recorded at Power Play Studios in New York. Gang Starr co-wrote and produced "Sassy" and "I Ain't Gone Under Yet". Geoff Barrow wrote and produced "Somedays".
"Trout" features a guitar riff replayed by Jonny Dollar from Steppenwolf's version of "The Pusher", and the drum track by John Bonham from "When the Levee Breaks". "Buddy X" was allegedly inspired by Lenny Kravitz. It was later remixed by Falcon & Fabian and featured Notorious B.I.G. and also remixed by the Dreem Teem and Masters at Work. The track "Move with Me" later appeared on the soundtrack of the 1993 film Sliver, while a dub version of the song appears on the soundtrack of the 1991 Wim Wenders film Until the End of the World. The track 'Red Paint' is a reinterpretation of a true story told to Neneh by her late mother Moki Cherry.
Singles
Two singles were released from Homebrew worldwide: "Money Love" and "Buddy X". "Money Love" charted within the top 40 of various countries while "Buddy X" became Cherry's third top-50 hit in the United States. In Germany, a third single—"Move with Me"—was also released. Meanwhile, a fourth song, "Trout", received heavy airplay on US alternative radio; despite never being released as a single, it peaked at number two on the Billboard Modern Rock Tracks chart in January 1993.
Track listing
Charts
References
External links
1992 albums
Neneh Cherry albums
Albums produced by Guru
Albums produced by DJ Premier
Albums produced by Geoff Barrow
Albums produced by Cameron McVey
|
The Narrows is the name given to a geological feature located east of Benjamin in Knox County, Texas. It is a narrow crest running east-to-west along a hogback dividing the watershed of the Wichita River to the north from that of the Brazos River to the south. That is, precipitation falling to the north of the crest will flow into the Wichita River, and thence into the Red River and ultimately the Mississippi, while precipitation falling to the south will flow into the Brazos and then directly into the Gulf of Mexico. Before white settlers arrived in the area, buffalo were drawn to the spot due to the presence of buffalo grass and fresh springs, with the result that the area was known as prime hunting ground to several tribes of Indians, including the Comanche, Wichita, Kiowa, Apache, Seminole, and Tonkawa. Evidence of their battles and campgrounds is still being discovered. The new settlers used these same Indian-worn trails to traverse the area. Today the canyons and ravines of the area's badlands topography are used for ranching purposes.
US 82 runs directly along the crest, and the area, being picturesque, has become a popular tourist attraction; a roadside park and historical marker have been set up along the highway.
References
Geology of Texas
Landforms of Knox County, Texas
Rock formations of Texas
|
```javascript
/**
*
* This program is free software: you can redistribute it and/or modify
* as published by the Free Software Foundation.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
*
* along with this program. If not, see <path_to_url
*
*/
import _ from 'lodash'
const FlowController = Electron.remote.require('./process/flowController.js')
import LocalStorage from '../persistence/LocalStorage'
import { importModule } from '../clients/ModuleClient'
const FLOW_KEY = 'FLOW'
export default {
installAndStartFlow(rootPath, npmRegistry) {
FlowController.getFlowConfigVersion()
.then(version => importModule('flow-bin', version, rootPath, npmRegistry))
.catch(() => importModule('flow-bin', 'latest', rootPath, npmRegistry))
.then(() => FlowController.startServer())
},
shouldPromptForFlowInstallation(projectPath) {
const {paths = []} = LocalStorage.loadObject(FLOW_KEY)
return paths.indexOf(projectPath) === -1
},
didPromptForFlowInstallation(projectPath) {
const {paths = []} = LocalStorage.loadObject(FLOW_KEY)
if (paths.indexOf(projectPath) === -1) {
LocalStorage.saveObject(FLOW_KEY, {
paths: [projectPath, ...paths].slice(0, 100),
})
}
},
}
```
|
Nasirabad (, also Romanized as Naşīrābād) is a village in Dasht Rural District, in the Central District of Meshgin Shahr County, Ardabil Province, Iran. At the 2006 census, its population was 1,286, in 331 families.
References
Populated places in Meshgin Shahr County
|
The Quechee State Park is located on US Route 4 in Quechee, Vermont. The park land is owned by the US Army Corps of Engineers and leased from by the State of Vermont. The park contains the Quechee Gorge, a popular Vermont tourist stop. The land was originally the site of the Dewey wool mill which ceased operation in 1952 and relocated to Enfield, New Hampshire. Shortly after the closing of the Mill the US Army Corps of Engineers acquired the property as part of its regional flood control plan. A hydroelectric dam sits at the north end of the gorge.
Activities include camping, hiking, swimming, river fishing, picnicking, wildlife watching and winter sports.
Camping facilities include 45 tent/trailer sites and 7 lean-to sites, two bathrooms with showers and a sanitary dump station. There is also a large field and play area, a picnic area next to Quechee Gorge with a pit toilet and a hiking trail along the gorge.
See also
List of Vermont state parks
References
External links
Queeche State Park
State parks of Vermont
Protected areas of Windsor County, Vermont
Hartford, Vermont
|
```python
import os
import unittest
from datetime import datetime, timedelta
from email.utils import formataddr
from django.test import SimpleTestCase, override_settings, tag
from anymail.exceptions import AnymailAPIError
from anymail.message import AnymailMessage
from .utils import AnymailTestMixin, sample_image_path
ANYMAIL_TEST_SENDGRID_API_KEY = os.getenv("ANYMAIL_TEST_SENDGRID_API_KEY")
ANYMAIL_TEST_SENDGRID_TEMPLATE_ID = os.getenv("ANYMAIL_TEST_SENDGRID_TEMPLATE_ID")
ANYMAIL_TEST_SENDGRID_DOMAIN = os.getenv("ANYMAIL_TEST_SENDGRID_DOMAIN")
@tag("sendgrid", "live")
@unittest.skipUnless(
ANYMAIL_TEST_SENDGRID_API_KEY and ANYMAIL_TEST_SENDGRID_DOMAIN,
"Set ANYMAIL_TEST_SENDGRID_API_KEY and ANYMAIL_TEST_SENDGRID_DOMAIN "
"environment variables to run SendGrid integration tests",
)
@override_settings(
ANYMAIL_SENDGRID_API_KEY=ANYMAIL_TEST_SENDGRID_API_KEY,
ANYMAIL_SENDGRID_SEND_DEFAULTS={
"esp_extra": {
"mail_settings": {"sandbox_mode": {"enable": True}},
}
},
EMAIL_BACKEND="anymail.backends.sendgrid.EmailBackend",
)
class SendGridBackendIntegrationTests(AnymailTestMixin, SimpleTestCase):
"""
SendGrid v3 API integration tests
These tests run against the **live** SendGrid API, using the
environment variable `ANYMAIL_TEST_SENDGRID_API_KEY` as the API key
If those variables are not set, these tests won't run.
The SEND_DEFAULTS above force SendGrid's v3 sandbox mode, which avoids sending mail.
(Sandbox sends also don't show in the activity feed, so disable that for live
debugging.)
The tests also use SendGrid's "sink domain" @sink.sendgrid.net for recipient
addresses.
path_to_url
"""
def setUp(self):
super().setUp()
self.from_email = "from@%s" % ANYMAIL_TEST_SENDGRID_DOMAIN
self.message = AnymailMessage(
"Anymail SendGrid integration test",
"Text content",
self.from_email,
["to@sink.sendgrid.net"],
)
self.message.attach_alternative("<p>HTML content</p>", "text/html")
def test_simple_send(self):
# Example of getting the SendGrid send status and message id from the message
sent_count = self.message.send()
self.assertEqual(sent_count, 1)
anymail_status = self.message.anymail_status
sent_status = anymail_status.recipients["to@sink.sendgrid.net"].status
message_id = anymail_status.recipients["to@sink.sendgrid.net"].message_id
self.assertEqual(sent_status, "queued") # SendGrid always queues
self.assertUUIDIsValid(message_id) # Anymail generates a UUID tracking id
# set of all recipient statuses:
self.assertEqual(anymail_status.status, {sent_status})
self.assertEqual(anymail_status.message_id, message_id)
def test_all_options(self):
send_at = datetime.now().replace(microsecond=0) + timedelta(minutes=2)
message = AnymailMessage(
subject="Anymail all-options integration test",
body="This is the text body",
from_email=formataddr(("Test From, with comma", self.from_email)),
to=["to1@sink.sendgrid.net", '"Recipient 2, OK?" <to2@sink.sendgrid.net>'],
cc=["cc1@sink.sendgrid.net", "Copy 2 <cc2@sink.sendgrid.net>"],
bcc=["bcc1@sink.sendgrid.net", "Blind Copy 2 <bcc2@sink.sendgrid.net>"],
reply_to=['"Reply, with comma" <reply@example.com>', "reply2@example.com"],
headers={"X-Anymail-Test": "value", "X-Anymail-Count": 3},
metadata={"meta1": "simple string", "meta2": 2},
send_at=send_at,
tags=["tag 1", "tag 2"],
track_clicks=True,
track_opens=True,
# this breaks activity feed if you don't have an asm group:
# esp_extra={'asm': {'group_id': 1}},
)
message.attach("attachment1.txt", "Here is some\ntext for you", "text/plain")
message.attach("attachment2.csv", "ID,Name\n1,Amy Lina", "text/csv")
cid = message.attach_inline_image_file(sample_image_path())
message.attach_alternative(
"<p><b>HTML:</b> with <a href='path_to_url"
"and image: <img src='cid:%s'></div>" % cid,
"text/html",
)
message.send()
# SendGrid always queues:
self.assertEqual(message.anymail_status.status, {"queued"})
def test_merge_data(self):
message = AnymailMessage(
subject="Anymail merge_data test: %field%",
body="This body includes merge data: %field%",
from_email=formataddr(("Test From", self.from_email)),
to=["to1@sink.sendgrid.net", "Recipient 2 <to2@sink.sendgrid.net>"],
reply_to=['"Merge data in reply name: %field%" <reply@example.com>'],
merge_data={
"to1@sink.sendgrid.net": {"field": "one"},
"to2@sink.sendgrid.net": {"field": "two"},
},
esp_extra={
"merge_field_format": "%{}%",
},
metadata={"meta1": "simple string", "meta2": 2},
merge_metadata={
"to1@sink.sendgrid.net": {"meta3": "recipient 1"},
"to2@sink.sendgrid.net": {"meta3": "recipient 2"},
},
headers={
"List-Unsubscribe-Post": "List-Unsubscribe=One-Click",
"List-Unsubscribe": "<mailto:unsubscribe@example.com>",
},
merge_headers={
"to1@sink.sendgrid.net": {
"List-Unsubscribe": "<path_to_url",
},
"to2@sink.sendgrid.net": {
"List-Unsubscribe": "<path_to_url",
},
},
)
message.send()
recipient_status = message.anymail_status.recipients
self.assertEqual(recipient_status["to1@sink.sendgrid.net"].status, "queued")
self.assertEqual(recipient_status["to2@sink.sendgrid.net"].status, "queued")
@unittest.skipUnless(
ANYMAIL_TEST_SENDGRID_TEMPLATE_ID,
"Set the ANYMAIL_TEST_SENDGRID_TEMPLATE_ID environment variable "
"to a template in your SendGrid account to test stored templates",
)
def test_stored_template(self):
message = AnymailMessage(
from_email=formataddr(("Test From", self.from_email)),
to=["to@sink.sendgrid.net"],
# Anymail's live test template has
# merge fields "name", "order_no", and "dept"...
template_id=ANYMAIL_TEST_SENDGRID_TEMPLATE_ID,
merge_data={
"to@sink.sendgrid.net": {
"name": "Test Recipient",
"order_no": "12345",
},
},
merge_global_data={"dept": "Fulfillment"},
)
message.send()
self.assertEqual(message.anymail_status.status, {"queued"})
@override_settings(ANYMAIL_SENDGRID_API_KEY="Hey, that's not an API key!")
def test_invalid_api_key(self):
with self.assertRaises(AnymailAPIError) as cm:
self.message.send()
err = cm.exception
self.assertEqual(err.status_code, 401)
# Make sure the exception message includes SendGrid's response:
self.assertIn("authorization grant is invalid", str(err))
```
|
```javascript
/**
* Simple service to return configuration for generic list. This service contains only
* getter methods that all list views uses in Boilerplate frontend application.
*
* So generally you change these getter methods and changes are affected to all list
* views on application.
*
* @todo text translations
*/
(function () {
'use strict';
angular.module('frontend.core.services')
.factory('ListConfig', [
'_', 'DialogService', '$log', 'AuthService','MessageService',
function factory(_, DialogService, $log, AuthService, MessageService) {
/**
* List title item configuration.
*/
let titleItems = {
service: [
{
title: 'name',
column: 'name',
searchable: true,
sortable: true,
inSearch: true,
inTitle: true
},
{
title: 'host',
column: 'host',
searchable: true,
sortable: true,
inSearch: true,
inTitle: true
},
{
title: 'tags',
column: 'extras.tags',
searchable: true,
sortable: true,
inSearch: true,
inTitle: true
},
{
title: 'created',
column: 'created_at',
sortable: true,
}
],
route: [
{
title: 'name / id',
column: 'id',
width: 100,
searchable: true,
sortable: true,
inSearch: true,
inTitle: true
},
{
title: 'tags',
column: 'tags',
searchable: true,
sortable: true,
inSearch: true,
inTitle: true
},
{
title: 'hosts',
column: 'hosts',
searchable: true,
sortable: true,
inSearch: true,
inTitle: true
},
{
title: 'service',
column: 'service',
searchable: true,
sortable: true,
inSearch: true,
inTitle: true
},
{
title: 'paths',
column: 'paths',
searchable: true,
sortable: true,
inSearch: true,
inTitle: true
},
{
title: 'created',
column: 'created_at',
sortable: true,
}
],
api: [
{
title: 'name',
column: 'name',
searchable: true,
sortable: true,
inSearch: true,
inTitle: true
},
{
title: 'upstream url',
column: 'upstream_url',
searchable: true,
sortable: true,
inSearch: true,
inTitle: true
},
{
title: 'created',
column: 'created_at',
sortable: true,
}
],
consumerApi: [
{
title: 'name',
width: 200,
column: 'name',
searchable: true,
sortable: true,
inSearch: true,
inTitle: true
}
],
consumerACLs: [
{
title: 'group',
column: 'group',
searchable: true,
sortable: true,
inSearch: true,
inTitle: true
}
],
consumerService: [
{
title: 'name',
width: 200,
column: 'name',
searchable: true,
sortable: true,
inSearch: true,
inTitle: true
},
{
title: 'host',
column: 'host',
searchable: true,
sortable: true,
inSearch: true,
inTitle: true
}
],
consumerRoute: [
{
title: 'name',
column: 'name',
searchable: true,
sortable: true,
inSearch: true,
inTitle: true
},
{
title: 'hosts',
column: 'hosts',
searchable: true,
sortable: true,
inSearch: true,
inTitle: true
},
{
title: 'service',
column: 'service',
searchable: true,
sortable: true,
inSearch: true,
inTitle: true
},
{
title: 'paths',
column: 'paths',
searchable: true,
sortable: true,
inSearch: true,
inTitle: true
}
],
target: [
{
title: '',
column: '',
width: 1
},
{
title: 'target',
column: 'target',
searchable: true,
sortable: true,
inSearch: true,
inTitle: true
},
{
title: 'weight',
column: 'weight'
},
{
title: 'created',
column: 'created_at',
sortable: true,
}
],
upstream: [
{
title: '',
column: '',
width: 1
},
{
title: 'name',
column: 'name',
searchable: true,
sortable: true,
inSearch: true,
inTitle: true
},
{
title: 'tags',
column: 'tags',
searchable: true,
inSearch: true,
inTitle: true
},
{
title: 'slots',
column: 'slots'
},
{
title: 'created',
column: 'created_at',
sortable: true,
}
],
upstreamAlert: [
{
title: '',
column: '',
width: 1
},
{
title: 'Upstream',
column: 'upstream_id',
searchable: true,
sortable: true,
inSearch: true,
inTitle: true
},
{
title: 'Connection',
column: 'connection'
},
{
title: 'created',
column: 'created_at',
sortable: true,
}
],
kongnode: [
{
title: '',
column: '',
width: 1
},
{
title: '',
column: '',
width: 1
},
{
title: 'name',
column: 'name',
searchable: true,
sortable: true,
inSearch: true,
inTitle: true
},
{
title: 'type',
column: 'type',
searchable: true,
sortable: true,
inSearch: true,
inTitle: true
},
{
title: 'kong admin url',
column: 'kong_admin_url',
searchable: true,
sortable: true,
inSearch: true,
inTitle: true
},
{
title: 'kong version',
column: 'kong_version'
},
{
title: 'created',
column: 'createdAt',
sortable: true,
},
],
consumerWithCreds: [
{
title: '',
width: 1
},
{
title: 'username',
column: 'username',
searchable: true,
sortable: true,
inSearch: true,
inTitle: true
},
{
title: 'custom_id',
column: 'custom_id',
searchable: true,
sortable: true,
inSearch: true,
inTitle: true
},
{
title: 'Matching Credentials',
column: 'plugins',
searchable: true,
sortable: true
},
{
title: 'created',
column: 'created_at',
sortable: true,
},
{
title: '',
hide: !AuthService.hasPermission('consumers', 'delete'),
column: false,
width: 1
},
],
consumer: [
{
title: '',
width: 1
},
{
title: 'username',
column: 'username',
searchable: true,
sortable: true,
inSearch: true,
inTitle: true
},
{
title: 'custom_id',
column: 'custom_id',
searchable: true,
sortable: true,
inSearch: true,
inTitle: true
},
{
title: 'tags',
column: 'tags',
searchable: true,
sortable: true,
inSearch: true,
inTitle: true
},
{
title: 'created',
column: 'created_at',
sortable: true,
},
{
title: '',
hide: !AuthService.hasPermission('consumers', 'delete'),
column: false,
width: 1
},
],
user: [
//{
// title: '#',
// width : 1
//},
{
title: '',
column: '',
width: 1
},
{
title: 'username',
column: 'username',
searchable: true,
sortable: true,
inSearch: true,
inTitle: true
},
{
title: 'first name',
column: 'firstName',
searchable: true,
sortable: true,
inSearch: true,
inTitle: true
},
{
title: 'last name',
column: 'lastName',
searchable: true,
sortable: true,
inSearch: true,
inTitle: true
},
{
title: 'created',
column: 'createdAt',
sortable: true,
},
{
title: 'updated',
column: 'updatedAt',
sortable: true,
},
{
title: '',
hide: !AuthService.hasPermission('users', 'delete'),
column: '',
width: 1
},
],
snapshot: [
//{
// title: 'id',
// column: 'id',
// searchable: true,
// sortable: true,
// inSearch: true,
// inTitle: true
//},
{
title: 'name',
column: 'name',
searchable: true,
sortable: true,
inSearch: true,
inTitle: true
},
{
title: 'node',
column: 'kong_node_name',
searchable: true,
sortable: true,
inSearch: true,
inTitle: true
},
{
title: 'created at',
column: 'createdAt',
sortable: true,
inTitle: true
}
],
snapshotschedule: [
{
title: 'connection',
column: 'connection',
inTitle: true
},
{
title: 'Schedule',
column: 'cron',
inTitle: true
},
{
title: 'created at',
column: 'createdAt',
sortable: true,
inTitle: true
}
],
plugin: [
{
title: 'Name',
column: 'name',
searchable: true,
sortable: true,
inSearch: true,
inTitle: true
},
{
title: 'scope',
column: 'scope',
searchable: true,
sortable: true,
inSearch: true,
inTitle: true
},
{
title: 'apply to',
column: 'item_id',
searchable: true,
sortable: true,
inSearch: true,
inTitle: true,
},
{
title: 'Consumer',
column: 'consumer_id',
searchable: true,
sortable: true,
inSearch: true,
inTitle: true
},
{
title: 'Created',
column: 'created_at',
class: 'col-xs-2',
searchable: false,
sortable: false,
inSearch: false,
inTitle: true
}
],
certificate: [
{
title: 'id',
column: 'id',
searchable: true,
sortable: true,
inSearch: true,
inTitle: true
},
{
title: 'tags ',
column: 'tags',
searchable: true,
sortable: true,
inSearch: true,
inTitle: true
},
{
title: 'snis',
column: 'snis',
searchable: true,
sortable: true,
inSearch: true,
inTitle: true
},
{
title: 'Created',
column: 'created_at',
class: 'col-xs-2',
searchable: false,
sortable: false,
inSearch: false,
inTitle: true
}
],
userlogin: [
{
title: 'IP-address',
column: 'ip',
class: 'col-xs-2',
searchable: true,
sortable: true,
inSearch: true,
inTitle: true
},
{
title: 'Browser',
column: 'browser',
class: 'col-xs-2',
searchable: true,
sortable: true,
inSearch: true,
inTitle: true
},
{
title: 'Operating System',
column: 'os',
class: 'col-xs-2',
searchable: true,
sortable: true,
inSearch: true,
inTitle: true
},
{
title: 'Username',
column: false,
class: 'col-xs-2',
searchable: false,
sortable: false,
inSearch: false,
inTitle: true
},
{
title: 'Login time',
column: 'createdAt',
class: 'col-xs-4',
searchable: false,
sortable: true,
inSearch: false,
inTitle: true
}
],
"cluster.nodes": [
{
title: 'Status',
column: 'status',
searchable: true,
sortable: true,
inSearch: true,
inTitle: true
},
{
title: 'Name',
column: 'name',
searchable: true,
sortable: true,
inSearch: true,
inTitle: true
},
{
title: 'Address',
column: 'address',
searchable: true,
sortable: true,
inSearch: true,
inTitle: true
}
],
hc: [
{
title: '',
column: 'active',
sortable: true
},
{
title: 'api',
column: 'api.name',
searchable: true,
sortable: true,
inSearch: true,
inTitle: true
},
{
title: 'hc endpoint',
column: 'health_check_endpoint',
searchable: true,
sortable: true,
inSearch: true,
inTitle: true
},
{
title: 'notification endpoint',
column: 'notification_endpoint',
searchable: true,
sortable: true,
inSearch: true,
inTitle: true
},
{
title: 'Created',
column: 'created_at',
class: 'col-xs-2',
sortable: false
}
],
};
let defaultLimit = 1000;
return {
defaultLimit: defaultLimit,
getConfig: function getConfig(property, model) {
return {
itemCount: 0,
items: [],
itemsFetchSize: defaultLimit,
itemsPerPage: 25,
titleItems: this.getTitleItems(property),
itemsPerPageOptions: [10, 25, 50, 100],
currentPage: 1,
sort: {
column: 'created_at',
direction: true,
},
filters: {
searchWord: '',
columns: this.getTitleItems(property)
},
where: {},
loading: true,
loaded: false,
handleErrors: function (err) {
model.scope.errors = {}
if (err.data && err.data.body) {
Object.keys(err.data.body).forEach(function (key) {
model.scope.errors[key] = err.data.body[key]
})
}
},
changeSort: function changeSort(item) {
var sort = model.scope.sort;
if (sort.column === item.column) {
sort.direction = !sort.direction;
} else {
sort.column = item.column;
sort.direction = true;
}
},
deleteItem: function deleteItem($index, item) {
DialogService.confirm(
"Confirm", "Really want to delete the selected item?",
['No don\'t', 'Yes! delete it'],
function accept() {
model.delete(item.id || item.name)
.then(function (res) {
var context = model.scope.items.data || model.scope.items;
context.splice(context.indexOf(item), 1);
}, function (err) {
$log.error("ListConfigService : Model delete failed => ", err)
MessageService.error('Something went wrong! ' + _.get(err,'data.body.message',""))
});
}, function decline() {
});
}
};
},
/**
* Getter method for lists title items. These are defined in the 'titleItems'
* variable.
*
* @param {String} model Name of the model
*
* @returns {Array}
*/
getTitleItems: function getTitleItems(model) {
return _.isUndefined(titleItems[model]) ? [] : titleItems[model];
}
};
}
])
;
}());
```
|
Stone is a 1974 Australian outlaw biker film written, directed and produced by Sandy Harbutt. It is a low budget film by company Hedon Productions.
Police officer Stone goes undercover with the Gravediggers outlaw motorcycle gang, to find out who is murdering their members, one by one.
The film stars Ken Shorter and features Rebecca Gilling, Bill Hunter and Helen Morse. The film's soundtrack was composed by Billy Green and featured some members of his group Sanctuary. Motorcycles featured include the legendary Kawasaki Z1(900). Stone initially rides a Norton.
The promotional trailer video features narration by radio and media personality John Laws. The film was featured in the documentary, Not Quite Hollywood, in which Quentin Tarantino enthuses about his admiration for the film.
Australian stuntman Peter Armstrong set a then-world record for riding a motorcycle off an 80-foot cliff to fall headfirst into the sea.
Plot
When several members of the GraveDiggers outlaw motorcycle club are murdered, Sydney detective Stone (Ken Shorter) is sent to investigate. Led by the Undertaker (Sandy Harbutt), a Vietnam war veteran, the GraveDiggers allow Stone to pose as a gang member. Leaving behind society girlfriend Amanda (Helen Morse), Stone begins to identify with the Undertaker and his comrades Hooks (Roger Ward), Toad (Hugh Keays-Byrne), Dr Death (Vincent Gil), Captain Midnight (Bindi Williams), Septic (Dewey Hungerford) and Vanessa (Rebecca Gilling), the Undertaker’s girlfriend. Amid violent confrontations with the Black Hawks, a rival gang the GraveDiggers hold responsible, Stone uncovers a political conspiracy behind the killings. When the truth is revealed, Stone must choose between his job and his loyalty to the GraveDiggers.
Cast
Ken Shorter as Stone
Sandy Harbutt as Undertaker
Helen Morse as Amanda
Hugh Keays-Byrne as Toad
Vincent Gil as Dr. Death
Bindi Williams as Captain Midnight
James H. Bowles as Stinkfinger
Rebecca Gilling as Vanessa
Roger Ward as Hooks
Lex Mitchell as Ballini
Susan Lloyd as Tart
Dewey Hungerford as Septic
Slim de Grey as Inspector Hannigan
Owen Weingott as Alder
Michael Robinson as Pinball
Ros Spiers as Whore
Bill Hunter as Barman
Billy Green as 69
Deryck Barnes as Doctor Townes
Harry Lawrence as Caretaker
Garry McDonald as Mechanic
Terry Bader as Hamburger
Drew Forsythe as Fred
Fred Scheiwiller as Ted
Tony Allyn as Birdman
Reg Evans as Solicitor
Bruce McPherson as Go Down
Jim Walsh as Bad Max
John Ifkovitch as Zonk
Rhod Walker as Chairman
Ray Bennett as Sergeant Larson
Neville Overall as Scrag
Barry Butler as Buzzard
Peter King as Ferret
David Bracks as Boots
Lachlan Jamieson as Hip
Ros Talamini as Sunshine
Victoria Anoux as Flossie
Jane Gilling as Eurydice
Margaret Ure as Jay
Jude Matthews as Blue
Eva Ifkovitch as Tiger
Julie Edwards as Karma
Karyn Love as Skunk
Production
Sandy Harbutt got the idea in 1970 when he wrote a script for an episode of the TV police series The Long Arm in which he was appearing.
Filmink magazine said "The biker movie was the modern day Western of choice in the 1960s" but argued this was one of the few Australian films to "embrace it as a story option."
The Australian Film Development Corporation invested $154,000 in the film. The remainder of the budget and most of the technical facilities were provided by Ross Wood Productions in Sydney. The movie was shot in late 1973.
The Hells Angels club (Sydney) provided assistance during production.
Release
Although Stone was given an "R" rating it grossed $1,572,000 at the box office in Australia, which is equivalent to $10,611,000 in 2009 dollars. It made a profit to its investors within 18 months.
Charts
The soundtrack was released by Warner Bros. (600002)
Influence
Several of the cast went on to appear in Mad Max (1979), including Hugh Keays-Byrne, Roger Ward, Vincent Gil, David Bracks and Reg Evans.
Stone Forever
Stone Forever is a 1999 documentary about Stone. Richard Kuipers was contacted by David Hannay and Sandy Harbutt to film a bike ride commemorating the film's 25th anniversary, which led to a full documentary about the impact of the film and the fate of the people who made it.
See also
Cinema of Australia
References
External links
Stone at the National Film and Sound Archive
STONE at The "Oz Film Database" Australian Film Database at Murdoch University
STONE FOREVER -25 Years of Stone at the "Urban Cinefile" database
The official site of the Stone movie remake - currently in development
Article in FilmInk about STONE and the remake
Milesago
Stone Forever at Australian Screen Online
Stone at Oz Film
Stone Forever at Oz Film
1974 films
1974 action films
Australian action films
1974 independent films
Police detective films
Outlaw biker films
Australian independent films
1970s English-language films
|
```css
Use `text-transform` to avoid screen-reader pronunciation errors
Use ```list-style-type``` to change the marker type in lists
Use `em` instead of `px` for sizes
Using the `font-variant` property to transform text to small-caps
Load custom fonts on a web page using `@font-face`
```
|
Matt Nathanson: Live at Google is a live recording of Matt Nathanson's performance at the Google Campus in early July 2011 to promote Google's new service, Music Beta by Google (subsequently rebranded as Google Play).
Track listing
Recording and production
At Google
During the Summer of 2011, Music Beta by Google was hosting a series of concerts at the Googleplex. The second in the series of concerts was opened by jazz artist Meklit Hadero and headlined by Matt Nathanson.
Throughout the show Nathanson made jabs at both audience members and even Facebook. One notable instance was while Nathanson was preparing the audience for a sing-a-long, he called attention to an audience member on his laptop when he said, "You're in the front, you're on your computer, but I know what you're doing is looking up the lyrics. You don't have to look up the lyrics, because this is totally easy. 'Hee,' 'hee,' 'who.' It's - and I feel it, I felt you wanting to sing."
References
2011 live albums
Matt Nathanson albums
Vanguard Records live albums
Google events
|
Martyn Forde is an Olympic-swimmer from Barbados. He swam for Barbados at the 2008 Olympics and the 2007 World Championships.
He holds the Barbadian Records in the short-course 50 and 100 freestyles.
External links
Forde's bio from the 2008 Olympics website.
Forde's bio on www.sports-reference.com
Bajan to swim in Beijing. CBC.bb; retrieved 2009-06-12.
1985 births
Living people
Canadian people of Barbadian descent
Barbadian male swimmers
Canadian male freestyle swimmers
Olympic swimmers for Barbados
Swimmers from Toronto
Swimmers at the 2008 Summer Olympics
Swimmers at the 2011 Pan American Games
Pan American Games competitors for Barbados
Competitors at the 2006 Central American and Caribbean Games
University of Toronto alumni
Black Canadian sportspeople
|
```objective-c
/* Communication between the Integrated Register Allocator (IRA) and
the rest of the compiler.
Contributed by Vladimir Makarov <vmakarov@redhat.com>.
This file is part of GCC.
GCC is free software; you can redistribute it and/or modify it under
Software Foundation; either version 3, or (at your option) any later
version.
GCC is distributed in the hope that it will be useful, but WITHOUT ANY
WARRANTY; without even the implied warranty of MERCHANTABILITY or
for more details.
along with GCC; see the file COPYING3. If not see
<path_to_url */
#ifndef GCC_IRA_H
#define GCC_IRA_H
#include "emit-rtl.h"
/* True when we use LRA instead of reload pass for the current
function. */
extern bool ira_use_lra_p;
/* True if we have allocno conflicts. It is false for non-optimized
mode or when the conflict table is too big. */
extern bool ira_conflicts_p;
struct target_ira
{
/* Map: hard register number -> allocno class it belongs to. If the
corresponding class is NO_REGS, the hard register is not available
for allocation. */
enum reg_class x_ira_hard_regno_allocno_class[FIRST_PSEUDO_REGISTER];
/* Number of allocno classes. Allocno classes are register classes
which can be used for allocations of allocnos. */
int x_ira_allocno_classes_num;
/* The array containing allocno classes. Only first
IRA_ALLOCNO_CLASSES_NUM elements are used for this. */
enum reg_class x_ira_allocno_classes[N_REG_CLASSES];
/* Map of all register classes to corresponding allocno classes
containing the given class. If given class is not a subset of an
allocno class, we translate it into the cheapest allocno class. */
enum reg_class x_ira_allocno_class_translate[N_REG_CLASSES];
/* Number of pressure classes. Pressure classes are register
classes for which we calculate register pressure. */
int x_ira_pressure_classes_num;
/* The array containing pressure classes. Only first
IRA_PRESSURE_CLASSES_NUM elements are used for this. */
enum reg_class x_ira_pressure_classes[N_REG_CLASSES];
/* Map of all register classes to corresponding pressure classes
containing the given class. If given class is not a subset of an
pressure class, we translate it into the cheapest pressure
class. */
enum reg_class x_ira_pressure_class_translate[N_REG_CLASSES];
/* Biggest pressure register class containing stack registers.
NO_REGS if there are no stack registers. */
enum reg_class x_ira_stack_reg_pressure_class;
/* Maps: register class x machine mode -> maximal/minimal number of
hard registers of given class needed to store value of given
mode. */
unsigned char x_ira_reg_class_max_nregs[N_REG_CLASSES][MAX_MACHINE_MODE];
unsigned char x_ira_reg_class_min_nregs[N_REG_CLASSES][MAX_MACHINE_MODE];
/* Array analogous to target hook TARGET_MEMORY_MOVE_COST. */
short x_ira_memory_move_cost[MAX_MACHINE_MODE][N_REG_CLASSES][2];
/* Array of number of hard registers of given class which are
available for the allocation. The order is defined by the
allocation order. */
short x_ira_class_hard_regs[N_REG_CLASSES][FIRST_PSEUDO_REGISTER];
/* The number of elements of the above array for given register
class. */
int x_ira_class_hard_regs_num[N_REG_CLASSES];
/* Register class subset relation: TRUE if the first class is a subset
of the second one considering only hard registers available for the
allocation. */
int x_ira_class_subset_p[N_REG_CLASSES][N_REG_CLASSES];
/* The biggest class inside of intersection of the two classes (that
is calculated taking only hard registers available for allocation
into account. If the both classes contain no hard registers
available for allocation, the value is calculated with taking all
hard-registers including fixed ones into account. */
enum reg_class x_ira_reg_class_subset[N_REG_CLASSES][N_REG_CLASSES];
/* True if the two classes (that is calculated taking only hard
registers available for allocation into account; are
intersected. */
bool x_ira_reg_classes_intersect_p[N_REG_CLASSES][N_REG_CLASSES];
/* If class CL has a single allocatable register of mode M,
index [CL][M] gives the number of that register, otherwise it is -1. */
short x_ira_class_singleton[N_REG_CLASSES][MAX_MACHINE_MODE];
/* Function specific hard registers can not be used for the register
allocation. */
HARD_REG_SET x_ira_no_alloc_regs;
/* Array whose values are hard regset of hard registers available for
the allocation of given register class whose HARD_REGNO_MODE_OK
values for given mode are zero. */
HARD_REG_SET x_ira_prohibited_class_mode_regs[N_REG_CLASSES][NUM_MACHINE_MODES];
};
extern struct target_ira default_target_ira;
#if SWITCHABLE_TARGET
extern struct target_ira *this_target_ira;
#else
#define this_target_ira (&default_target_ira)
#endif
#define ira_hard_regno_allocno_class \
(this_target_ira->x_ira_hard_regno_allocno_class)
#define ira_allocno_classes_num \
(this_target_ira->x_ira_allocno_classes_num)
#define ira_allocno_classes \
(this_target_ira->x_ira_allocno_classes)
#define ira_allocno_class_translate \
(this_target_ira->x_ira_allocno_class_translate)
#define ira_pressure_classes_num \
(this_target_ira->x_ira_pressure_classes_num)
#define ira_pressure_classes \
(this_target_ira->x_ira_pressure_classes)
#define ira_pressure_class_translate \
(this_target_ira->x_ira_pressure_class_translate)
#define ira_stack_reg_pressure_class \
(this_target_ira->x_ira_stack_reg_pressure_class)
#define ira_reg_class_max_nregs \
(this_target_ira->x_ira_reg_class_max_nregs)
#define ira_reg_class_min_nregs \
(this_target_ira->x_ira_reg_class_min_nregs)
#define ira_memory_move_cost \
(this_target_ira->x_ira_memory_move_cost)
#define ira_class_hard_regs \
(this_target_ira->x_ira_class_hard_regs)
#define ira_class_hard_regs_num \
(this_target_ira->x_ira_class_hard_regs_num)
#define ira_class_subset_p \
(this_target_ira->x_ira_class_subset_p)
#define ira_reg_class_subset \
(this_target_ira->x_ira_reg_class_subset)
#define ira_reg_classes_intersect_p \
(this_target_ira->x_ira_reg_classes_intersect_p)
#define ira_class_singleton \
(this_target_ira->x_ira_class_singleton)
#define ira_no_alloc_regs \
(this_target_ira->x_ira_no_alloc_regs)
#define ira_prohibited_class_mode_regs \
(this_target_ira->x_ira_prohibited_class_mode_regs)
/* Major structure describing equivalence info for a pseudo. */
struct ira_reg_equiv_s
{
/* True if we can use this equivalence. */
bool defined_p;
/* True if the usage of the equivalence is profitable. */
bool profitable_p;
/* Equiv. memory, constant, invariant, and initializing insns of
given pseudo-register or NULL_RTX. */
rtx memory;
rtx constant;
rtx invariant;
/* Always NULL_RTX if defined_p is false. */
rtx_insn_list *init_insns;
};
/* The length of the following array. */
extern int ira_reg_equiv_len;
/* Info about equiv. info for each register. */
extern struct ira_reg_equiv_s *ira_reg_equiv;
extern void ira_init_once (void);
extern void ira_init (void);
extern void ira_setup_eliminable_regset (void);
extern rtx ira_eliminate_regs (rtx, machine_mode);
extern void ira_set_pseudo_classes (bool, FILE *);
extern void ira_expand_reg_equiv (void);
extern void ira_update_equiv_info_by_shuffle_insn (int, int, rtx_insn *);
extern void ira_sort_regnos_for_alter_reg (int *, int, unsigned int *);
extern void ira_mark_allocation_change (int);
extern void ira_mark_memory_move_deletion (int, int);
extern bool ira_reassign_pseudos (int *, int, HARD_REG_SET, HARD_REG_SET *,
HARD_REG_SET *, bitmap);
extern rtx ira_reuse_stack_slot (int, unsigned int, unsigned int);
extern void ira_mark_new_stack_slot (rtx, int, unsigned int);
extern bool ira_better_spill_reload_regno_p (int *, int *, rtx, rtx, rtx_insn *);
extern bool ira_bad_reload_regno (int, rtx, rtx);
extern void ira_adjust_equiv_reg_cost (unsigned, int);
/* ira-costs.c */
extern void ira_costs_c_finalize (void);
/* Spilling static chain pseudo may result in generation of wrong
non-local goto code using frame-pointer to address saved stack
pointer value after restoring old frame pointer value. The
function returns TRUE if REGNO is such a static chain pseudo. */
static inline bool
non_spilled_static_chain_regno_p (int regno)
{
return (cfun->static_chain_decl && crtl->has_nonlocal_goto
&& REG_EXPR (regno_reg_rtx[regno]) == cfun->static_chain_decl);
}
#endif /* GCC_IRA_H */
```
|
```c++
/*
* or more contributor license agreements. See the NOTICE file
* distributed with this work for additional information
* regarding copyright ownership. The ASF licenses this file
*
* path_to_url
*
* Unless required by applicable law or agreed to in writing,
* "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
* specific language governing permissions and limitations
*/
#pragma once
#include <gandiva-glib/gandiva-glib.h>
#include <gandiva-glib/expression.hpp>
#include <gandiva-glib/filter.hpp>
#include <gandiva-glib/node.hpp>
#include <gandiva-glib/projector.hpp>
#include <gandiva-glib/selection-vector.hpp>
```
|
```java
package com.yahoo.document.json.readers;
import com.yahoo.document.PositionDataType;
import com.yahoo.document.datatypes.FieldValue;
import com.yahoo.document.json.TokenBuffer;
import static com.yahoo.document.json.readers.JsonParserHelpers.*;
/**
* @author arnej
*/
public class GeoPositionReader {
static void fillGeoPosition(TokenBuffer buffer, FieldValue positionFieldValue) {
Double latitude = null;
Double longitude = null;
expectObjectStart(buffer.current());
int initNesting = buffer.nesting();
for (buffer.next(); buffer.nesting() >= initNesting; buffer.next()) {
String curName = buffer.currentName();
if ("lat".equals(curName) || "latitude".equals(curName)) {
latitude = readDouble(buffer) * 1.0e6;
} else if ("lng".equals(curName) || "longitude".equals(curName)) {
longitude = readDouble(buffer) * 1.0e6;
} else if ("x".equals(curName)) {
longitude = readDouble(buffer);
} else if ("y".equals(curName)) {
latitude = readDouble(buffer);
} else {
throw new IllegalArgumentException("Unexpected attribute "+curName+" in geo position field");
}
}
expectObjectEnd(buffer.current());
if (latitude == null) {
throw new IllegalArgumentException("Missing 'lat' attribute in geo position field");
}
if (longitude == null) {
throw new IllegalArgumentException("Missing 'lng' attribute in geo position field");
}
int y = (int) Math.round(latitude);
int x = (int) Math.round(longitude);
var geopos = PositionDataType.valueOf(x, y);
positionFieldValue.assign(geopos);
}
private static double readDouble(TokenBuffer buffer) {
try {
return Double.parseDouble(buffer.currentText());
} catch (NumberFormatException e) {
throw new IllegalArgumentException("Expected a number but got '" + buffer.currentText());
}
}
}
```
|
Viktor Pavlovich Karpov (; 9 October 1928 – 2 February 1997) was a Russian diplomat, Deputy Soviet Foreign Minister in 1990–1991.
Karpov graduated from the Moscow State Institute of International Relations in 1951, and went on to work in various diplomatic posts in the central offices of the Ministry of Foreign Affairs and abroad.
From 1960 to 1962, he was the Senior Adviser at the Soviet Embassy in Washington. Since 1968 joined the Soviet-American negotiations on reduction of strategic weapons in Helsinki, Vienna, Geneva.
1990–1991 — Soviet Deputy Foreign Minister, in charge of Soviet-American relations and negotiations on reduction of strategic weapons, served as the Chief Soviet Strategic Arms Control Negotiator.- books.google.ru/books?
Karpov personally contributed to working out such important treaties as INF Treaty, START-1 and START-2 Treaty.
Since 1991 worked as the advisor to the Ministry of Foreign Affairs, Russia in Moscow until his death in Moscow in 1997
References
1928 births
1997 deaths
20th-century diplomats
People from Penza
Moscow State Institute of International Relations alumni
Recipients of the Order of Lenin
Recipients of the Order of the Red Banner of Labour
Russian diplomats
Soviet diplomats
Burials at Vagankovo Cemetery
|
```powershell
OpenTofuInstallPath = "C:\Program Files\tofu\tofu.exe"
$OpenTofuTmpPath = "C:\OpenTofutmp"
$OpenTofuTmpBinaryPath = "C:\OpenTofutmp\tofu.exe"
$OpenTofuPath = "C:\Program Files\tofu"
# Remove any old OpenTofu installation, if present
if (Test-Path -Path $OpenTofuInstallPath)
{
Remove-Item $OpenTofuInstallPath -Recurse
}
# Download OpenTofu and unpack it
$OpenTofuURI = "path_to_url"
$output = "tofu_1.8.0_windows_amd64.zip"
$ProgressPreference = "SilentlyContinue"
Invoke-WebRequest -Uri $OpenTofuURI -OutFile $output
New-Item -ItemType "directory" -Path $OpenTofuTmpPath
# Unpack OpenTofu to temp directory
Expand-Archive -LiteralPath $output -DestinationPath $OpenTofuTmpPath
# Make new OpenTofu directory to hold binary
New-Item -ItemType "directory" -Path $OpenTofuPath
Move-Item $OpenTofuTmpBinaryPath $OpenTofuPath
# Add new OpenTofu path to system
$OldPath = [System.Environment]::GetEnvironmentVariable('PATH', "Machine")
$NewPath = "$OldPath;$OpenTofuPath"
[Environment]::SetEnvironmentVariable("PATH", "$NewPath", "Machine")
# Load System and User PATHs into latest $env:Path, which has the effect of "refreshing" the latest path
# in the current PowerShell session
$env:Path = [System.Environment]::GetEnvironmentVariable("Path","Machine") + ";" + [System.Environment]::GetEnvironmentVariable("Path","User")
# Verify installation
tofu version
```
|
```forth
SUBROUTINE MIST(N, BETA)
IMPLICIT REAL*8 (A-H,O-Z)
INTEGER IA, IQ, M1
DIMENSION BETA(N)
DO 80 IQ=1,M1
IF (BETA(IQ).EQ.0.0D0) GO TO 120
80 CONTINUE
120 IF (IQ.NE.1) GO TO 160
160 M1 = IA(IQ)
RETURN
END
```
|
```python
# coding=utf-8
# *** WARNING: this file was generated by pulumi-language-python. ***
# *** Do not edit by hand unless you're certain you know what you are doing! ***
import copy
import warnings
import pulumi
import pulumi.runtime
from typing import Any, Mapping, Optional, Sequence, Union, overload
from . import _utilities
__all__ = ['ProviderArgs', 'Provider']
@pulumi.input_type
class ProviderArgs:
def __init__(__self__):
"""
The set of arguments for constructing a Provider resource.
"""
pass
class Provider(pulumi.ProviderResource):
@overload
def __init__(__self__,
resource_name: str,
opts: Optional[pulumi.ResourceOptions] = None,
__props__=None):
"""
Create a Asset-archive resource with the given unique name, props, and options.
:param str resource_name: The name of the resource.
:param pulumi.ResourceOptions opts: Options for the resource.
"""
...
@overload
def __init__(__self__,
resource_name: str,
args: Optional[ProviderArgs] = None,
opts: Optional[pulumi.ResourceOptions] = None):
"""
Create a Asset-archive resource with the given unique name, props, and options.
:param str resource_name: The name of the resource.
:param ProviderArgs args: The arguments to use to populate this resource's properties.
:param pulumi.ResourceOptions opts: Options for the resource.
"""
...
def __init__(__self__, resource_name: str, *args, **kwargs):
resource_args, opts = _utilities.get_resource_args_opts(ProviderArgs, pulumi.ResourceOptions, *args, **kwargs)
if resource_args is not None:
__self__._internal_init(resource_name, opts, **resource_args.__dict__)
else:
__self__._internal_init(resource_name, *args, **kwargs)
def _internal_init(__self__,
resource_name: str,
opts: Optional[pulumi.ResourceOptions] = None,
__props__=None):
opts = pulumi.ResourceOptions.merge(_utilities.get_resource_opts_defaults(), opts)
if not isinstance(opts, pulumi.ResourceOptions):
raise TypeError('Expected resource options to be a ResourceOptions instance')
if opts.id is None:
if __props__ is not None:
raise TypeError('__props__ is only valid when passed in combination with a valid opts.id to get an existing resource')
__props__ = ProviderArgs.__new__(ProviderArgs)
super(Provider, __self__).__init__(
'asset-archive',
resource_name,
__props__,
opts)
```
|
Sofya Melikyan is an Armenian pianist, born in Yerevan.
To date, Melikyan toured throughout Spain, Germany, France, Russia, Canada, Armenia, Japan, Australia, Italy, Serbia and the U.S. She appeared as a soloist with the Armenian Philharmonic Orchestra, Radio and Television Symphony Orchestra of Spain, Cordoba Symphony Orchestra, Valencia Symphony Orchestra, New Europe Chamber Orchestra, Philharmonic Orchestra of Andalucía, among others.
Melikyan's performances have been broadcast at National Radio and Television of Spain, National Radio and Television of Armenia, National Radio of Catalonia, Chicago WFMT Radio Station, Muzzik French Television Station, New York WXQR Radio Station, among others. Melikyan has also released two CDs featuring the music of Haydn, Schumann, Rachmaninoff, Albeniz, Dutilleux and Khachaturian.
Sofya Melikyan has been awarded First Prize and a Prize for outstanding Music Talent at the Marisa Montiel International Piano Competition in Linares, First Prize at the Ibiza International Piano Competition in Spain, First Prize for Music Interpretation awarded by “Amigos del Colegio de España” Association in Paris. She has also received top and special prizes at the 15th Jose Iturbi and Maria Canals International Competitions in Spain.
Recent and upcoming performance highlights include tours in Japan, Australia, Canada, Europe and USA; appearances at Great Lakes Chamber Music Festival with violist Kim Kashkashian; European tour with Sima Trio; concerto appearances with the Armenian Philharmonic Orchestra, and Radio and Television Orchestra of Spain.
Sofya Melikyan completed her studies at the Royal Conservatory of Madrid with Joaquin Soriano, École Normale de Musique de Paris with Ramzi Yassa and Manhattan School of Music in New York where she was a scholarship student of Solomon Mikowsky. Other pianists who have mentored her are Brigitte Engerer, Galina Eguiazarova and Elena Tatulyan.
References
External links
www.sofyamelikyan.com
1978 births
Living people
Musicians from Yerevan
Armenian classical pianists
Armenian women pianists
Madrid Royal Conservatory alumni
José Iturbi International Piano Competition prize-winners
Armenian pianists
Tchaikovsky Secondary Music School alumni
21st-century classical pianists
Women classical pianists
21st-century women pianists
|
Glottiphyllum fergusoniae is a species of succulent plant, of the family Aizoaceae. It is indigenous to the western part of the Little Karoo, in the Western Cape, South Africa.
Description
The leaves are decussate (produced in alternate, perpendicular pairs) slender, erect and tapering gradually to a point. They are covered in a fine, pale waxy covering that gives the leaves a slight grey colour.
The seed capsule is held close to the plant, has valves with awns, and even after it has dried out and released its seeds, it remains persistent on the plant, for many years.
Distribution and habitat
This species occurs in the western part of the Little Karoo, South Africa. It is often found around the towns of Barrydale and Montagu.
Here it grows exposed, in very rocky habitats, often in crevices. Glottiphyllum depressum, which co-occurs with it in the same areas, is found only on shadier, more sheltered spots, growing in deeper soils. A third species, Glottiphyllum suave occurs just to the north of its range, also in the western Little Karoo, has a pale waxy covering to its leaves, and favours exposed positions.
References
fergusoniae
Taxa named by Louisa Bolus
|
```sqlpl
-- Tags: no-fasttest
SELECT DAYOFMONTH(toDateTime('2016-06-15 23:00:00'));
SELECT '---';
SELECT DAY(toDateTime('2016-06-15 23:00:00'));
```
|
```go
//
//
// path_to_url
//
// Unless required by applicable law or agreed to in writing, software
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
// Code generated by applyconfiguration-gen. DO NOT EDIT.
package v1
// ExemplarsApplyConfiguration represents a declarative configuration of the Exemplars type for use
// with apply.
type ExemplarsApplyConfiguration struct {
MaxSize *int64 `json:"maxSize,omitempty"`
}
// ExemplarsApplyConfiguration constructs a declarative configuration of the Exemplars type for use with
// apply.
func Exemplars() *ExemplarsApplyConfiguration {
return &ExemplarsApplyConfiguration{}
}
// WithMaxSize sets the MaxSize field in the declarative configuration to the given value
// and returns the receiver, so that objects can be built by chaining "With" function invocations.
// If called multiple times, the MaxSize field is set to the value of the last call.
func (b *ExemplarsApplyConfiguration) WithMaxSize(value int64) *ExemplarsApplyConfiguration {
b.MaxSize = &value
return b
}
```
|
Hector Manuel Laffitte (born April 13, 1934) is a former United States district judge of the United States District Court for the District of Puerto Rico.
Education and career
Born in Ponce, Puerto Rico, Laffitte received a Bachelor of Arts degree from Polytechnic Institute of Puerto Rico (now Interamerican University) in 1955, a Bachelor of Laws from the University of Puerto Rico Law School in 1959, and a Master of Laws from Georgetown University Law Center in 1960. He was in private practice in Puerto Rico from 1960 to 1983.
Federal judicial service
On May 26, 1983, Laffitte was nominated by President Ronald Reagan to a seat on the United States District Court for the District of Puerto Rico vacated by Judge Hernan Gregorio Pesquera. Laffitte was confirmed by the United States Senate on July 26, 1983, and received his commission on July 27, 1983. He served as Chief Judge from 1999 to 2004, assuming senior status on November 15, 2005. Laffitte served in that capacity until his retirement from the bench on February 16, 2007.
See also
List of Hispanic and Latino American jurists
References
Sources
1934 births
Living people
Attorneys from Ponce
Georgetown University Law Center alumni
Hispanic and Latino American judges
Judges of the United States District Court for the District of Puerto Rico
United States district court judges appointed by Ronald Reagan
20th-century American judges
Puerto Rican judges
Hispanic and Latino American lawyers
|
Raymond Lakah, (born c. 1960 as Rami Lakah) (رامي لكح), is a French-Egyptian magnate, and former owner of the French newspaper France Soir.
Lakah was born in Egypt to a Coptic Christian Egyptian family, and first came to prominence with his brother Michel Lakah in the mid-1990s. They had holdings in construction, healthcare management and aviation. In November 1998, their holdings were floated on the Cairo Stock Exchange with Rami owning 38% and Michel 31%. He is an Egyptian nationalist who showed interest in Egypt's political life.
Egyptian Parliament
In November 2000 Lakah was elected to the Egyptian Parliament at the relatively young age of 40. His election raised the question of the legality of dual nationals holding government offices since Lakah was a national of both Egypt and France. In January 2001, the Minister of Interior officially declared that his election in 2000 was invalid. Discussions about his financial debts, which had started before his election, also intensified.
His indebtedness amounting to 1.2 to 1.4 billion Egyptian Pounds with many government bankloans in Egypt unpaid. When lawsuits were filed against him, he fled Egypt and settled in France. In August 2001, a court verdict in Egypt ruled that he could not be a member of the Egyptian Parliament due to his dual nationality. In October 2004, the Egyptian parliament installed a new rule that dual nationals are not allowed to serve in the parliament.
Lakah maintains that all his debts were paid off.
In France, he took the name Raymond, instead of his Arabic birth name Rami, and started establishing himself in several business ventures, including Star Airlines, and in October 2004 he bought the France Soir newspaper.
Cartoon controversy
On February 2, 2006, France-Soir published the Muhammad cartoons that caused a lot of havoc and anger among Muslims around the world. The cartoons were originally published by the Danish newspaper Jyllands-Posten on September 30, 2005. France Soir republished the cartoons under the headline, "Yes, One has the Right to Caricature God."
The same day Raymond Lakah fired the editorial director, Jacques Lefranc. Le Monde reported that Lakah issued a statement saying he fired Lefranc as president and director of the newspaper in "a strong sign of respect to the intimate convictions and beliefs of each individual." The statement continued, "We present our regrets to the Muslim community and to all people who have been shocked or made indignant by this publication."
See also
Lists of Egyptians
List of Copts
Collège de la Sainte Famille
France Soir
References
External links
Lakah-Group
Freedom’s Fighters
Al Ahram article on Lakah during 2000 elections.
Interview with Lakah hosted by Amr Adeeb in ALQAHERA ALYOUM live television show 4/12/2008 (in Arabic)
March 2002 article on Al Jazeera interview with Lakah (in Arabic).
Living people
Egyptian businesspeople
Egyptian emigrants to France
Coptic Christians
21st-century French newspaper publishers (people)
1960s births
Egyptian billionaires
French male writers
|
```smalltalk
/***************************************************************************
THIS CODE IS PROVIDED *AS IS* WITHOUT WARRANTY OF
ANY KIND, EITHER EXPRESS OR IMPLIED, INCLUDING ANY
IMPLIED WARRANTIES OF FITNESS FOR A PARTICULAR
PURPOSE, MERCHANTABILITY, OR NON-INFRINGEMENT.
***************************************************************************/
using System;
namespace AsmDude {
/// <summary>
/// This class is used to expose the list of the IDs of the commands implemented
/// by this package. This list of IDs must match the set of IDs defined inside the
/// Buttons section of the VSCT file.
/// </summary>
internal static class PkgCmdIDList
{
// Now define the list a set of public static members.
public const int cmdidMyCommand = 0x2001;
public const int cmdidMyGraph = 0x2002;
public const int cmdidMyZoom = 0x2003;
public const int cmdidDynamicTxt = 0x2004;
public const int cmdidDynVisibility1 = 0x2005;
public const int cmdidDynVisibility2 = 0x2006;
}
}
```
|
```objective-c
#import <Foundation/Foundation.h>
#import <UserNotifications/UserNotifications.h>
#import <ExpoModulesCore/EXInternalModule.h>
#import <ExpoModulesCore/EXUserNotificationCenterProxyInterface.h>
@interface EXReactNativeUserNotificationCenterProxy : NSObject <EXInternalModule, EXUserNotificationCenterProxyInterface>
@end
```
|
The Vaughns are an indie pop rock band from New Jersey.
History
The Vaughns are an indie rock band from Springfield, New Jersey that formed in 2014. The band attended high school together and began rehearsing together at the suggestion of a mutual friend.
The Vaughns and tomfoolery (2014–2017)
The Vaughns released their debut EP, entitled The Vaughns, in August 2014. Their second EP tomfoolery was released on October 24, 2015, and the band notes "the main goal in recording tomfoolery was to capture the raw live sound." In 2016, the Vaughns' music was featured on the MTV show, Brothers Green Eat, and on the syndicated radio show, Little Steven's Underground Garage. That year, they also contributed and won the Third Annual 24 Hour Songwriting Challenge, with the track "Vamos."
Singles and FOMO (2017–present)
The single "Santa Cruz" was released in 2017 and premiered in Consequence of Sound. In 2018, the song "Coffee Sundae" was released, which is described as a "whimsical track [that] chronicles dealing with a romantic partner who is still in contact with their ex." The Vaughns performed at the North Jersey Indie Rock Festival, on October 6, 2018. Prior to the release of their debut album, The Vaughns released two more singles, "50%" and "Shout."
On May 10, 2019, The Vaughns independently released their debut LP, FOMO. Receiving
In 2020, they signed with record label Equal Vision Records and released their third EP rom-coms + take-out the following year.
Current Lineup
Anna Lies – vocals, guitar and synth (2014–present)
Ryan Kenter – drums and percussion (2014–present)
Jordan Smith – guitar and vocals (2019-present)
Brian Hughes – bass and vocals (2020-present)
Former Members
Dave Cacciatore – guitar and vocals (2014-2019)
Tom Losito – bass and vocals (2014-2019)
Discography
Albums
FOMO (2019)
EPs
The Vaughns (2014)
tomfoolery (2015)
rom coms + take out (2021)
Singles
"Santa Cruz" (2017)
"Bby Save Me" (2017)
"BYKTWD" (2018)
"Coffee Sundae" (2018)
"50%" (2019)
"Shout" (2019)
"Raina" (2021)
References
Citations
Bibliography
Indie rock musical groups from New Jersey
Musical groups established in 2014
Sniffling Indie Kids artists
2014 establishments in New Jersey
|
Idlewild, also known as the Downman House, was a historic home located at Fredericksburg, Virginia. It was built in 1859; a fire in April 2003 destroyed most of the interior and collapsed the roof. It was a -story, Gothic Revival-style brick dwelling with an English basement and an irregular "T" shape with a center passage plan. The house was topped by a steep slate gable roof.
Also on the property at present are three contributing brick dependencies and a contributing pet cemetery. During the American Civil War, Idlewild became a prominent landmark on 4 May 1863, during battle action related to the Chancellorsville campaign. On that evening Confederate General Robert E. Lee used the house as his headquarters, after being initially occupied that day by Federal troops of the Union Sixth Corps.
It was listed on the National Register of Historic Places in 2009.
History
Idlewild Mansion in Fredericksburg, Virginia is also called Downman House. It is an excellent example of the American Gothic Revival style popular in the mid-1800s. Idlewild was built in 1859 by William Yates Downman, a blue blooded Virginian whose family seat was Belle Isle in Lancaster County.
It is thought that perhaps the style and name of Mr. Downman's house was inspired by the well-known editor and writer Nathaniel Parker Willis. Willis built a large Gothic styled "cottage" overlooking a steep gorge in the Hudson River Valley in 1846. When he first viewed the property, the sellers told him it was nothing but "an idle wild of which nothing could ever be made". As a result, the new home was named "Idlewild". Many of Willis' writings made reference to his beloved home and in 1855 he published a popular book entitled "Outdoors At Idlewild". The book featured a drawing of a large Gothic styled mansion on its cover. William Downman may easily have been inspired to create his own Idlewild when he began building his new home for his growing family.
William and his wife Mary Ann Hayes Downman had three young children when they moved into their new home. Their oldest daughter Anne Hayes (Nannie) Downman would grow up and marry R. Innes Taylor of nearby Fall Hill. Sophia Chinn Downman would marry architect Marion Dimmock of Richmond. First born son Joseph Henry Downman (named after William's father) would die only a few days after his birth. John Yates Downman dedicated his life to the ministry and would be the last surviving member of the family and the last family owner of Idlewild. Rawleigh William Downman was the first son to be born at Idlewild but would pass away at the early age of twenty one while visiting relatives in Baltimore. James Hayes Downman would become a successful New York businessman who came back to Fredericksburg where he died while visiting sister Nannie at her home at Fall Hill. Mary Ann had the first Tiffany stained glass window in St. George's Church in Fredericksburg installed in memory of these two sons. In later years, Mary Ann, Nannie and Sophia moved back to their "city home" on Caroline Street in Fredericksburg. Mary Ann would be Fredericksburg's oldest resident when she died in the 1920s.
Idlewild served as Confederate Gen. Robert E. Lee’s headquarters on May 4–5, 1863, during the Civil War’s Chancellorsville campaign. With its location just west of Fredericksburg, the mansion and its grounds were often the site of skirmishes and occupations by troops of both sides. Mention is made of some of the incidents in the "practice" letters of daughter Sophia who jotted down her correspondence in her father's old notebooks - one volume of which recently found its way back to Fredericksburg. (This little book and its writings was the subject of an article written by local historian and Idlewild advocate Donna Chasen.)
Damage by fire
Idlewild has been in ruins since it burned in April 2003 after vandals set it on fire. Idlewild again suffered damage from a smaller porch fire in August 2006. An earthquake on 23 August 2011 damaged the chimneys in the main house and leveled the two chimneys on the summer kitchen. The brick walls of the house have been braced with steel beams and remained basically unharmed by the quake. Considering, the house remains in stable condition. There are many theories to how the Downman House burned down the most likely being vandals. There are others such as homeless campers who set up a fire in the weakest fireplace.
Official recognition
The property has been added to the Virginia Landmarks Register and was listed on the National Register of Historic Places in June 2009.
Local surroundings
The mansion sits on a hill overlooking Hazel Run. Three period dependencies remain: a summer kitchen, a meathouse and a laundry. It is thought that brick walkways remain connecting the main house to these outbuildings but further archaeological research would be necessary to confirm this. The land directly surrounding the mansion remains intact with older milking sheds, corn cribs and other non-contributing structures in place. It is well shielded by trees from the surrounding development.
A large planned community, called The Village of Idlewild, has been built centered around the mansion in recent years. Starting March, 2023, a large amount of property surrounding the mansion has been razed in order to build a middle school.
References
External links
Article Idlewild In Ruins, But Still Proud
Article Idlewild Struck by Fire Again
Article No Action Soon for City's Idlewild Mansion
Houses on the National Register of Historic Places in Virginia
Gothic Revival architecture in Virginia
Houses completed in 1859
Houses in Fredericksburg, Virginia
National Register of Historic Places in Fredericksburg, Virginia
|
```css
Use `background-repeat` to repeat a background image horizontally or vertically
Determine the opacity of background-colors using the RGBA declaration
Hexadecimal color system
Select items using negative `nth-child`
Autohiding scrollbars for **IE**
```
|
Erythrohydrobupropion (developmental code names BW 287, BW 17U) is a substituted amphetamine derivative—specifically a β-hydroxyamphetamine—and a minor active metabolite of the antidepressant drug bupropion (Wellbutrin). Bupropion is a norepinephrine–dopamine reuptake inhibitor and nicotinic acetylcholine receptor negative allosteric modulator, with its metabolites contributing substantially to its activities. Erythrohydrobupropion exists as two isomers, (1R,2S)-erythrohydrobupropion and (1S,2R)-erythrohydrobupropion. Other metabolites of bupropion include hydroxybupropion and threohydrobupropion.
Information on the pharmacological actions of erythrohydrobupropion is scarce. In any case, it is about 20% as pharmacologically potent as bupropion and in the range of 20 to 50% as potent as bupropion in mouse models of depression. It circulates at similar concentrations as bupropion during bupropion therapy. Conversely, two other metabolites, hydroxybupropion and threohydrobupropion, circulate at higher concentrations than bupropion.
Erythrohydrobupropion is formed from bupropion via reduction of the ketone group primarily by 11β-hydroxysteroid dehydrogenase-1 and to a minor extent by aldo-keto reductases. It can also be formed from bupropion by carbonyl reductases. The compound is metabolized by the cytochrome P450 enzymes CYP2B6 and CYP2C19 into erythro-4'-hydroxy-hydrobupropion and by various glucuronosyltransferase enzymes into glucuronide conjugates. The elimination half-life of erythrohydrobupropion is approximately 33hours. Its half-life may be longer in older people.
Insomnia during bupropion therapy has been associated with erythrohydrobupropion concentrations. Administration of erythrohydrobupropion in mice produces seizures at sufficiently high doses similarly to bupropion and other metabolites. Erythrohydrobupropion is a CYP2D6 inhibitor and accounts for about 9% of CYP2D6 inhibition during bupropion therapy, with hydroxybupropion accounting for 65% and threohydrobupropion accounting for 21%.
References
Antidepressants
Chlorobenzenes
Convulsants
Human drug metabolites
Phenethylamines
Substituted amphetamines
Tert-butyl compounds
|
The Maloelap Atoll (Marshallese: , ) (also spelled Maleolap) is a coral atoll of 71 islands in the Pacific Ocean, and forms a legislative district of the Ratak Chain of the Marshall Islands. Its land area is only , but that encloses a lagoon of . It is located north of the atoll of Aur. The population of the atoll was 395 at the 2021 census.
The largest of the islands that make up the atoll are Taroa (the administrative center of the atoll), in the northeast, and Kaben in the northwest. Only three of the other islands in the atoll are inhabited: Airuk, Wolot and Jang. The island is served by Air Marshall Islands via Maloelap Airport.
History
Maloelap Atoll was claimed by the German Empire along with the rest of the Marshall Islands in 1885. After World War I, the island came under the South Seas Mandate of the Empire of Japan.
In 1939, the Japanese built a seaplane base and landplane Taroa Airfield with two runways (4800' + 4100') and support buildings and facilities, including a radar station. During World War II the Japanese garrison of 2,940 navy men and 389 army men was commanded by Rear Admiral Shoichi Kamada. The perimeter of the island was heavily fortified with 12 heavy coastal artillery and 10 heavy anti-aircraft guns. The island was attacked by the United States Navy beginning in February 1942 starting with carrier-based aircraft and shelling by warships. The attacks grew in frequency and severity after Majuro and Kwajalein had fallen to the Americans. Of the 3097-man Japanese garrison (1772 Imperial Japanese Navy, 368 Imperial Japanese Army, and 957 civilians) only 1041 (34%) survived the war. Several Marshallese were also killed. A large number of war relics, including plane wrecks, mainly Mitsubishi A6M Zero fighters and Mitsubishi G4M Betty bombers remain scattered about.
Following the end of World War II, the island came under the control of the United States as part of the Trust Territory of the Pacific Islands until the independence of the Marshall Islands in 1986. Maloelap Atoll was the first to ratify the Marshall Islands' constitution.
Education
Marshall Islands Public School System operates public schools:
Aerok Elementary School
Jang Elementary School
Kaben Elementary School
Ollet Elementary School
Tarawa Elementary School
Northern Islands High School on Wotje serves the community.
Notes
References
Marshall Islands site
Pacific Wrecks
Atolls of the Marshall Islands
Ratak Chain
|
```objective-c
/*
*
*/
#pragma once
#include <stdint.h>
#include <stdbool.h>
#include "soc/efuse_periph.h"
#include "hal/assert.h"
#include "rom/efuse.h"
#ifdef __cplusplus
extern "C" {
#endif
// Always inline these functions even no gcc optimization is applied.
/******************* eFuse fields *************************/
__attribute__((always_inline)) static inline uint32_t efuse_ll_get_flash_crypt_cnt(void)
{
return EFUSE.rd_repeat_data1.spi_boot_crypt_cnt;
}
__attribute__((always_inline)) static inline uint32_t efuse_ll_get_wdt_delay_sel(void)
{
return EFUSE.rd_repeat_data1.wdt_delay_sel;
}
__attribute__((always_inline)) static inline uint32_t efuse_ll_get_flash_type(void)
{
return EFUSE.rd_repeat_data3.flash_type;
}
__attribute__((always_inline)) static inline uint32_t efuse_ll_get_mac0(void)
{
return EFUSE.rd_mac_spi_sys_0.mac_0;
}
__attribute__((always_inline)) static inline uint32_t efuse_ll_get_mac1(void)
{
return EFUSE.rd_mac_spi_sys_1.mac_1;
}
__attribute__((always_inline)) static inline bool efuse_ll_get_secure_boot_v2_en(void)
{
return EFUSE.rd_repeat_data2.secure_boot_en;
}
// use efuse_hal_get_major_chip_version() to get major chip version
__attribute__((always_inline)) static inline uint32_t efuse_ll_get_chip_wafer_version_major(void)
{
return EFUSE.rd_mac_spi_sys_5.wafer_version_major;
}
// use efuse_hal_get_minor_chip_version() to get minor chip version
__attribute__((always_inline)) static inline uint32_t efuse_ll_get_chip_wafer_version_minor(void)
{
return (EFUSE.rd_mac_spi_sys_5.wafer_version_minor_hi << 3) + EFUSE.rd_mac_spi_sys_3.wafer_version_minor_lo;
}
__attribute__((always_inline)) static inline bool efuse_ll_get_disable_wafer_version_major(void)
{
return EFUSE.rd_repeat_data4.disable_wafer_version_major;
}
__attribute__((always_inline)) static inline uint32_t efuse_ll_get_blk_version_major(void)
{
return EFUSE.rd_sys_part1_data4.blk_version_major;
}
__attribute__((always_inline)) static inline uint32_t efuse_ll_get_blk_version_minor(void)
{
return EFUSE.rd_mac_spi_sys_3.blk_version_minor;
}
__attribute__((always_inline)) static inline bool efuse_ll_get_disable_blk_version_major(void)
{
return EFUSE.rd_repeat_data4.disable_blk_version_major;
}
__attribute__((always_inline)) static inline uint32_t efuse_ll_get_chip_ver_pkg(void)
{
return EFUSE.rd_mac_spi_sys_3.pkg_version;
}
__attribute__((always_inline)) static inline uint32_t efuse_ll_get_ocode(void)
{
// EFUSE_BLK2, 141, 8, ADC OCode
return EFUSE.rd_sys_part1_data4.ocode;
}
__attribute__((always_inline)) static inline uint32_t efuse_ll_get_k_rtc_ldo(void)
{
// EFUSE_BLK1, 141, 7, BLOCK1 K_RTC_LDO
return EFUSE.rd_mac_spi_sys_4.k_rtc_ldo;
}
__attribute__((always_inline)) static inline uint32_t efuse_ll_get_k_dig_ldo(void)
{
// EFUSE_BLK1, 148, 7, BLOCK1 K_DIG_LDO
return EFUSE.rd_mac_spi_sys_4.k_dig_ldo;
}
__attribute__((always_inline)) static inline uint32_t efuse_ll_get_v_rtc_dbias20(void)
{
// EFUSE_BLK1, 155, 8, BLOCK1 voltage of rtc dbias20
return (EFUSE.rd_mac_spi_sys_5.v_rtc_dbias20_1 << 5) + EFUSE.rd_mac_spi_sys_4.v_rtc_dbias20;
}
__attribute__((always_inline)) static inline uint32_t efuse_ll_get_v_dig_dbias20(void)
{
// EFUSE_BLK1, 163, 8, BLOCK1 voltage of digital dbias20
return EFUSE.rd_mac_spi_sys_5.v_dig_dbias20;
}
__attribute__((always_inline)) static inline uint32_t efuse_ll_get_dig_dbias_hvt(void)
{
// EFUSE_BLK1, 171, 5, BLOCK1 digital dbias when hvt
return EFUSE.rd_mac_spi_sys_5.dig_dbias_hvt;
}
/******************* eFuse control functions *************************/
__attribute__((always_inline)) static inline bool efuse_ll_get_read_cmd(void)
{
return EFUSE.cmd.read_cmd;
}
__attribute__((always_inline)) static inline bool efuse_ll_get_pgm_cmd(void)
{
return EFUSE.cmd.pgm_cmd;
}
__attribute__((always_inline)) static inline void efuse_ll_set_read_cmd(void)
{
EFUSE.cmd.read_cmd = 1;
}
__attribute__((always_inline)) static inline void efuse_ll_set_pgm_cmd(uint32_t block)
{
HAL_ASSERT(block < ETS_EFUSE_BLOCK_MAX);
EFUSE.cmd.val = ((block << EFUSE_BLK_NUM_S) & EFUSE_BLK_NUM_M) | EFUSE_PGM_CMD;
}
__attribute__((always_inline)) static inline void efuse_ll_set_conf_read_op_code(void)
{
EFUSE.conf.op_code = EFUSE_READ_OP_CODE;
}
__attribute__((always_inline)) static inline void efuse_ll_set_conf_write_op_code(void)
{
EFUSE.conf.op_code = EFUSE_WRITE_OP_CODE;
}
__attribute__((always_inline)) static inline void efuse_ll_set_dac_num(uint8_t val)
{
EFUSE.dac_conf.dac_num = val;
}
__attribute__((always_inline)) static inline void efuse_ll_set_dac_clk_div(uint8_t val)
{
EFUSE.dac_conf.dac_clk_div = val;
}
__attribute__((always_inline)) static inline void efuse_ll_set_pwr_on_num(uint16_t val)
{
EFUSE.wr_tim_conf1.pwr_on_num = val;
}
__attribute__((always_inline)) static inline void efuse_ll_set_pwr_off_num(uint16_t value)
{
EFUSE.wr_tim_conf2.pwr_off_num = value;
}
/******************* eFuse control functions *************************/
#ifdef __cplusplus
}
#endif
```
|
```go
// Use of this source code is governed by a BSD-style
// license that can be found in the LICENSE file.
//go:build plan9
// +build plan9
// Package plan9 contains an interface to the low-level operating system
// primitives. OS details vary depending on the underlying system, and
// by default, godoc will display the OS-specific documentation for the current
// system. If you want godoc to display documentation for another
// system, set $GOOS and $GOARCH to the desired system. For example, if
// you want to view documentation for freebsd/arm on linux/amd64, set $GOOS
// to freebsd and $GOARCH to arm.
//
// The primary use of this package is inside other packages that provide a more
// portable interface to the system, such as "os", "time" and "net". Use
// those packages rather than this one if you can.
//
// For details of the functions and data types in this package consult
// the manuals for the appropriate operating system.
//
// These calls return err == nil to indicate success; otherwise
// err represents an operating system error describing the failure and
// holds a value of type syscall.ErrorString.
package plan9 // import "golang.org/x/sys/plan9"
import (
"bytes"
"strings"
"unsafe"
)
// ByteSliceFromString returns a NUL-terminated slice of bytes
// containing the text of s. If s contains a NUL byte at any
// location, it returns (nil, EINVAL).
func ByteSliceFromString(s string) ([]byte, error) {
if strings.IndexByte(s, 0) != -1 {
return nil, EINVAL
}
a := make([]byte, len(s)+1)
copy(a, s)
return a, nil
}
// BytePtrFromString returns a pointer to a NUL-terminated array of
// bytes containing the text of s. If s contains a NUL byte at any
// location, it returns (nil, EINVAL).
func BytePtrFromString(s string) (*byte, error) {
a, err := ByteSliceFromString(s)
if err != nil {
return nil, err
}
return &a[0], nil
}
// ByteSliceToString returns a string form of the text represented by the slice s, with a terminating NUL and any
// bytes after the NUL removed.
func ByteSliceToString(s []byte) string {
if i := bytes.IndexByte(s, 0); i != -1 {
s = s[:i]
}
return string(s)
}
// BytePtrToString takes a pointer to a sequence of text and returns the corresponding string.
// If the pointer is nil, it returns the empty string. It assumes that the text sequence is terminated
// at a zero byte; if the zero byte is not present, the program may crash.
func BytePtrToString(p *byte) string {
if p == nil {
return ""
}
if *p == 0 {
return ""
}
// Find NUL terminator.
n := 0
for ptr := unsafe.Pointer(p); *(*byte)(ptr) != 0; n++ {
ptr = unsafe.Pointer(uintptr(ptr) + 1)
}
return string(unsafe.Slice(p, n))
}
// Single-word zero for use when we need a valid pointer to 0 bytes.
// See mksyscall.pl.
var _zero uintptr
func (ts *Timespec) Unix() (sec int64, nsec int64) {
return int64(ts.Sec), int64(ts.Nsec)
}
func (tv *Timeval) Unix() (sec int64, nsec int64) {
return int64(tv.Sec), int64(tv.Usec) * 1000
}
func (ts *Timespec) Nano() int64 {
return int64(ts.Sec)*1e9 + int64(ts.Nsec)
}
func (tv *Timeval) Nano() int64 {
return int64(tv.Sec)*1e9 + int64(tv.Usec)*1000
}
// use is a no-op, but the compiler cannot see that it is.
// Calling use(p) ensures that p is kept live until that point.
//
//go:noescape
func use(p unsafe.Pointer)
```
|
```objective-c
/*
*
* Permission is hereby granted, free of charge, to any person obtaining a
* copy of this software and associated documentation files (the "Software"),
* to deal in the Software without restriction, including without limitation
* the rights to use, copy, modify, merge, publish, distribute, sublicense,
* and/or sell copies of the Software, and to permit persons to whom the
* Software is furnished to do so, subject to the following conditions:
*
* The above copyright notice and this permission notice shall be included in
* all copies or substantial portions of the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
* THE COPYRIGHT HOLDER(S) OR AUTHOR(S) BE LIABLE FOR ANY CLAIM, DAMAGES OR
* OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE,
* ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR
* OTHER DEALINGS IN THE SOFTWARE.
*
* Authors: AMD
*
*/
#ifndef __DAL_IRQ_SERVICE_DCN201_H__
#define __DAL_IRQ_SERVICE_DCN201_H__
#include "../irq_service.h"
struct irq_service *dal_irq_service_dcn201_create(
struct irq_service_init_data *init_data);
#endif
```
|
Proctolabus is a genus of short-horned grasshoppers in the family Acrididae. There are about eight described species in Proctolabus, found in Mexico and the southwestern United States.
Species
These species belong to the genus Proctolabus:
Proctolabus brachypterus Bruner, 1908
Proctolabus cerciatus Hebard, 1925
Proctolabus chiapensis Descamps, 1976
Proctolabus diferens Márquez Mayaudón, 1963
Proctolabus edentatus Descamps, 1976
Proctolabus gracilis Bruner, 1908
Proctolabus mexicanus (Saussure, 1859)
Proctolabus oaxacae Descamps, 1976
References
External links
Acrididae
|
```php
<?php
/*
*
* File ini bagian dari:
*
* OpenSID
*
* Sistem informasi desa sumber terbuka untuk memajukan desa
*
* Aplikasi dan source code ini dirilis berdasarkan lisensi GPL V3
*
* Hak Cipta 2009 - 2015 Combine Resource Institution (path_to_url
* Hak Cipta 2016 - 2024 Perkumpulan Desa Digital Terbuka (path_to_url
*
* Dengan ini diberikan izin, secara gratis, kepada siapa pun yang mendapatkan salinan
* dari perangkat lunak ini dan file dokumentasi terkait ("Aplikasi Ini"), untuk diperlakukan
* tanpa batasan, termasuk hak untuk menggunakan, menyalin, mengubah dan/atau mendistribusikan,
* asal tunduk pada syarat berikut:
*
* Pemberitahuan hak cipta di atas dan pemberitahuan izin ini harus disertakan dalam
* setiap salinan atau bagian penting Aplikasi Ini. Barang siapa yang menghapus atau menghilangkan
* pemberitahuan ini melanggar ketentuan lisensi Aplikasi Ini.
*
* PERANGKAT LUNAK INI DISEDIAKAN "SEBAGAIMANA ADANYA", TANPA JAMINAN APA PUN, BAIK TERSURAT MAUPUN
* TERSIRAT. PENULIS ATAU PEMEGANG HAK CIPTA SAMA SEKALI TIDAK BERTANGGUNG JAWAB ATAS KLAIM, KERUSAKAN ATAU
* KEWAJIBAN APAPUN ATAS PENGGUNAAN ATAU LAINNYA TERKAIT APLIKASI INI.
*
* @package OpenSID
* @author Tim Pengembang OpenDesa
* @copyright Hak Cipta 2009 - 2015 Combine Resource Institution (path_to_url
* @copyright Hak Cipta 2016 - 2024 Perkumpulan Desa Digital Terbuka (path_to_url
* @license path_to_url GPL V3
* @link path_to_url
*
*/
namespace App\Observers;
use Illuminate\Database\Eloquent\Model;
defined('BASEPATH') || exit('No direct script access allowed');
class AuthorObserver
{
public function creating(Model $model): void
{
$model->created_by = auth()->id;
$model->updated_by = auth()->id;
}
public function updating(Model $model): void
{
$model->updated_by = auth()->id;
}
}
```
|
```c
/**
******************************************************************************
* @file stm32l4xx_hal_hash.c
* @author MCD Application Team
* @brief HASH HAL module driver.
* This file provides firmware functions to manage the following
* functionalities of the HASH peripheral:
* + Initialization and de-initialization methods
* + HASH or HMAC processing in polling mode
* + HASH or HMAC processing in interrupt mode
* + HASH or HMAC processing in DMA mode
* + Peripheral State methods
* + HASH or HMAC processing suspension/resumption
*
@verbatim
===============================================================================
##### How to use this driver #####
===============================================================================
[..]
The HASH HAL driver can be used as follows:
(#)Initialize the HASH low level resources by implementing the HAL_HASH_MspInit():
(##) Enable the HASH interface clock using __HASH_CLK_ENABLE()
(##) When resorting to interrupt-based APIs (e.g. HAL_HASH_xxx_Start_IT())
(+++) Configure the HASH interrupt priority using HAL_NVIC_SetPriority()
(+++) Enable the HASH IRQ handler using HAL_NVIC_EnableIRQ()
(+++) In HASH IRQ handler, call HAL_HASH_IRQHandler() API
(##) When resorting to DMA-based APIs (e.g. HAL_HASH_xxx_Start_DMA())
(+++) Enable the DMAx interface clock using
__DMAx_CLK_ENABLE()
(+++) Configure and enable one DMA stream to manage data transfer from
memory to peripheral (input stream). Managing data transfer from
peripheral to memory can be performed only using CPU.
(+++) Associate the initialized DMA handle to the HASH DMA handle
using __HAL_LINKDMA()
(+++) Configure the priority and enable the NVIC for the transfer complete
interrupt on the DMA Stream: use
HAL_NVIC_SetPriority() and
HAL_NVIC_EnableIRQ()
(#)Initialize the HASH HAL using HAL_HASH_Init(). This function:
(##) resorts to HAL_HASH_MspInit() for low-level initialization,
(##) configures the data type: 1-bit, 8-bit, 16-bit or 32-bit.
(#)Three processing schemes are available:
(##) Polling mode: processing APIs are blocking functions
i.e. they process the data and wait till the digest computation is finished,
e.g. HAL_HASH_xxx_Start() for HASH or HAL_HMAC_xxx_Start() for HMAC
(##) Interrupt mode: processing APIs are not blocking functions
i.e. they process the data under interrupt,
e.g. HAL_HASH_xxx_Start_IT() for HASH or HAL_HMAC_xxx_Start_IT() for HMAC
(##) DMA mode: processing APIs are not blocking functions and the CPU is
not used for data transfer i.e. the data transfer is ensured by DMA,
e.g. HAL_HASH_xxx_Start_DMA() for HASH or HAL_HMAC_xxx_Start_DMA()
for HMAC. Note that in DMA mode, a call to HAL_HASH_xxx_Finish()
is then required to retrieve the digest.
(#)When the processing function is called after HAL_HASH_Init(), the HASH peripheral is
initialized and processes the buffer fed in input. When the input data have all been
fed to the IP, the digest computation can start.
(#)Multi-buffer processing is possible in polling and DMA mode.
(##) In polling mode, only multi-buffer HASH processing is possible.
API HAL_HASH_xxx_Accumulate() must be called for each input buffer, except for the last one.
User must resort to HAL_HASH_xxx_Start() to enter the last one and retrieve as
well the computed digest.
(##) In DMA mode, multi-buffer HASH and HMAC processing are possible.
(+++) HASH processing: once initialization is done, MDMAT bit must be set thru __HAL_HASH_SET_MDMAT() macro.
From that point, each buffer can be fed to the IP thru HAL_HASH_xxx_Start_DMA() API.
Before entering the last buffer, reset the MDMAT bit with __HAL_HASH_RESET_MDMAT()
macro then wrap-up the HASH processing in feeding the last input buffer thru the
same API HAL_HASH_xxx_Start_DMA(). The digest can then be retrieved with a call to
API HAL_HASH_xxx_Finish().
(+++) HMAC processing (requires to resort to extended functions):
after initialization, the key and the first input buffer are entered
in the IP with the API HAL_HMACEx_xxx_Step1_2_DMA(). This carries out HMAC step 1 and
starts step 2.
The following buffers are next entered with the API HAL_HMACEx_xxx_Step2_DMA(). At this
point, the HMAC processing is still carrying out step 2.
Then, step 2 for the last input buffer and step 3 are carried out by a single call
to HAL_HMACEx_xxx_Step2_3_DMA().
The digest can finally be retrieved with a call to API HAL_HASH_xxx_Finish().
(#)Context swapping.
(##) Two APIs are available to suspend HASH or HMAC processing:
(+++) HAL_HASH_SwFeed_ProcessSuspend() when data are entered by software (polling or IT mode),
(+++) HAL_HASH_DMAFeed_ProcessSuspend() when data are entered by DMA.
(##) When HASH or HMAC processing is suspended, HAL_HASH_ContextSaving() allows
to save in memory the IP context. This context can be restored afterwards
to resume the HASH processing thanks to HAL_HASH_ContextRestoring().
(##) Once the HASH IP has been restored to the same configuration as that at suspension
time, processing can be restarted with the same API call (same API, same handle,
same parameters) as done before the suspension. Relevant parameters to restart at
the proper location are internally saved in the HASH handle.
(#)Call HAL_HASH_DeInit() to deinitialize the HASH peripheral.
*** Callback registration ***
===================================
[..]
(#) The compilation define USE_HAL_HASH_REGISTER_CALLBACKS when set to 1
allows the user to configure dynamically the driver callbacks.
Use function @ref HAL_HASH_RegisterCallback() to register a user callback.
(#) Function @ref HAL_HASH_RegisterCallback() allows to register following callbacks:
(+) InCpltCallback : callback for input completion.
(+) DgstCpltCallback : callback for digest computation completion.
(+) ErrorCallback : callback for error.
(+) MspInitCallback : HASH MspInit.
(+) MspDeInitCallback : HASH MspDeInit.
This function takes as parameters the HAL peripheral handle, the Callback ID
and a pointer to the user callback function.
(#) Use function @ref HAL_HASH_UnRegisterCallback() to reset a callback to the default
weak (surcharged) function.
@ref HAL_HASH_UnRegisterCallback() takes as parameters the HAL peripheral handle,
and the Callback ID.
This function allows to reset following callbacks:
(+) InCpltCallback : callback for input completion.
(+) DgstCpltCallback : callback for digest computation completion.
(+) ErrorCallback : callback for error.
(+) MspInitCallback : HASH MspInit.
(+) MspDeInitCallback : HASH MspDeInit.
(#) By default, after the @ref HAL_HASH_Init and if the state is HAL_HASH_STATE_RESET
all callbacks are reset to the corresponding legacy weak (surcharged) functions:
examples @ref HAL_HASH_InCpltCallback(), @ref HAL_HASH_DgstCpltCallback()
Exception done for MspInit and MspDeInit callbacks that are respectively
reset to the legacy weak (surcharged) functions in the @ref HAL_HASH_Init
and @ref HAL_HASH_DeInit only when these callbacks are null (not registered beforehand)
If not, MspInit or MspDeInit are not null, the @ref HAL_HASH_Init and @ref HAL_HASH_DeInit
keep and use the user MspInit/MspDeInit callbacks (registered beforehand).
Callbacks can be registered/unregistered in READY state only.
Exception done for MspInit/MspDeInit callbacks that can be registered/unregistered
in READY or RESET state, thus registered (user) MspInit/DeInit callbacks can be used
during the Init/DeInit.
In that case first register the MspInit/MspDeInit user callbacks
using @ref HAL_HASH_RegisterCallback before calling @ref HAL_HASH_DeInit
or @ref HAL_HASH_Init function.
When The compilation define USE_HAL_HASH_REGISTER_CALLBACKS is set to 0 or
not defined, the callback registering feature is not available
and weak (surcharged) callbacks are used.
@endverbatim
******************************************************************************
* @attention
*
* <h2><center>© COPYRIGHT(c) 2017 STMicroelectronics</center></h2>
*
* Redistribution and use in source and binary forms, with or without modification,
* are permitted provided that the following conditions are met:
* 1. Redistributions of source code must retain the above copyright notice,
* this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright notice,
* this list of conditions and the following disclaimer in the documentation
* and/or other materials provided with the distribution.
* 3. Neither the name of STMicroelectronics nor the names of its contributors
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
* DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
* SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
* CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
* OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*
******************************************************************************
*/
/* Includes your_sha256_hash--*/
#include "stm32l4xx_hal.h"
#ifdef HAL_HASH_MODULE_ENABLED
#if defined (STM32L4A6xx) || defined (STM32L4S5xx) || defined (STM32L4S7xx) || defined (STM32L4S9xx)
/** @addtogroup STM32L4xx_HAL_Driver
* @{
*/
/** @defgroup HASH HASH
* @brief HASH HAL module driver.
* @{
*/
/* Private typedef -----------------------------------------------------------*/
/* Private define ------------------------------------------------------------*/
/** @defgroup HASH_Private_Constants HASH Private Constants
* @{
*/
/** @defgroup HASH_Digest_Calculation_Status HASH Digest Calculation Status
* @{
*/
#define HASH_DIGEST_CALCULATION_NOT_STARTED ((uint32_t)0x00000000) /*!< DCAL not set after input data written in DIN register */
#define HASH_DIGEST_CALCULATION_STARTED ((uint32_t)0x00000001) /*!< DCAL set after input data written in DIN register */
/**
* @}
*/
/** @defgroup HASH_Number_Of_CSR_Registers HASH Number of Context Swap Registers
* @{
*/
#define HASH_NUMBER_OF_CSR_REGISTERS 54 /*!< Number of Context Swap Registers */
/**
* @}
*/
/** @defgroup HASH_TimeOut_Value HASH TimeOut Value
* @{
*/
#define HASH_TIMEOUTVALUE 1000 /*!< Time-out value */
/**
* @}
*/
/** @defgroup HASH_DMA_Suspension_Words_Limit HASH DMA suspension words limit
* @{
*/
#define HASH_DMA_SUSPENSION_WORDS_LIMIT 20 /*!< Number of words below which DMA suspension is aborted */
/**
* @}
*/
/**
* @}
*/
/* Private macro -------------------------------------------------------------*/
/* Private variables ---------------------------------------------------------*/
/* Private function prototypes -----------------------------------------------*/
/** @defgroup HASH_Private_Functions HASH Private Functions
* @{
*/
static void HASH_DMAXferCplt(DMA_HandleTypeDef *hdma);
static void HASH_DMAError(DMA_HandleTypeDef *hdma);
static void HASH_GetDigest(uint8_t *pMsgDigest, uint8_t Size);
static HAL_StatusTypeDef HASH_WaitOnFlagUntilTimeout(HASH_HandleTypeDef *hhash, uint32_t Flag, FlagStatus Status, uint32_t Timeout);
static HAL_StatusTypeDef HASH_WriteData(HASH_HandleTypeDef *hhash, uint8_t *pInBuffer, uint32_t Size);
static HAL_StatusTypeDef HASH_IT(HASH_HandleTypeDef *hhash);
static uint32_t HASH_Write_Block_Data(HASH_HandleTypeDef *hhash);
static HAL_StatusTypeDef HMAC_Processing(HASH_HandleTypeDef *hhash, uint32_t Timeout);
/**
* @}
*/
/** @defgroup HASH_Exported_Functions HASH Exported Functions
* @{
*/
/** @defgroup HASH_Exported_Functions_Group1 Initialization and de-initialization functions
* @brief Initialization, configuration and call-back functions.
*
@verbatim
===============================================================================
##### Initialization and de-initialization functions #####
===============================================================================
[..] This section provides functions allowing to:
(+) Initialize the HASH according to the specified parameters
in the HASH_InitTypeDef and create the associated handle
(+) DeInitialize the HASH peripheral
(+) Initialize the HASH MCU Specific Package (MSP)
(+) DeInitialize the HASH MSP
[..] This section provides as well call back functions definitions for user
code to manage:
(+) Input data transfer to IP completion
(+) Calculated digest retrieval completion
(+) Error management
@endverbatim
* @{
*/
/**
* @brief Initialize the HASH according to the specified parameters in the
HASH_HandleTypeDef and create the associated handle.
* @note Only MDMAT and DATATYPE bits of HASH IP are set by HAL_HASH_Init(),
* other configuration bits are set by HASH or HMAC processing APIs.
* @note MDMAT bit is systematically reset by HAL_HASH_Init(). To set it for
* multi-buffer HASH processing, user needs to resort to
* __HAL_HASH_SET_MDMAT() macro. For HMAC multi-buffer processing, the
* relevant APIs manage themselves the MDMAT bit.
* @param hhash: HASH handle
* @retval HAL status
*/
HAL_StatusTypeDef HAL_HASH_Init(HASH_HandleTypeDef *hhash)
{
/* Check the parameters */
assert_param(IS_HASH_DATATYPE(hhash->Init.DataType));
/* Check the hash handle allocation */
if(hhash == NULL)
{
return HAL_ERROR;
}
#if (USE_HAL_HASH_REGISTER_CALLBACKS == 1)
if (hhash->State == HAL_HASH_STATE_RESET)
{
/* Allocate lock resource and initialize it */
hhash->Lock = HAL_UNLOCKED;
/* Reset Callback pointers in HAL_HASH_STATE_RESET only */
hhash->InCpltCallback = HAL_HASH_InCpltCallback; /* Legacy weak (surcharged) input completion callback */
hhash->DgstCpltCallback = HAL_HASH_DgstCpltCallback; /* Legacy weak (surcharged) digest computation completion callback */
hhash->ErrorCallback = HAL_HASH_ErrorCallback; /* Legacy weak (surcharged) error callback */
if(hhash->MspInitCallback == NULL)
{
hhash->MspInitCallback = HAL_HASH_MspInit;
}
/* Init the low level hardware */
hhash->MspInitCallback(hhash);
}
#else
if(hhash->State == HAL_HASH_STATE_RESET)
{
/* Allocate lock resource and initialize it */
hhash->Lock = HAL_UNLOCKED;
/* Init the low level hardware */
HAL_HASH_MspInit(hhash);
}
#endif /* (USE_HAL_HASH_REGISTER_CALLBACKS) */
/* Change the HASH state */
hhash->State = HAL_HASH_STATE_BUSY;
/* Reset HashInCount, HashITCounter, HashBuffSize and NbWordsAlreadyPushed */
hhash->HashInCount = 0;
hhash->HashBuffSize = 0;
hhash->HashITCounter = 0;
hhash->NbWordsAlreadyPushed = 0;
/* Reset digest calculation bridle (MDMAT bit control) */
hhash->DigestCalculationDisable = RESET;
/* Set phase to READY */
hhash->Phase = HAL_HASH_PHASE_READY;
/* Set the data type and reset MDMAT bit */
MODIFY_REG(HASH->CR, HASH_CR_DATATYPE|HASH_CR_MDMAT, hhash->Init.DataType);
/* Reset HASH handle status */
hhash->Status = HAL_OK;
/* Set the HASH state to Ready */
hhash->State = HAL_HASH_STATE_READY;
/* Initialise the error code */
hhash->ErrorCode = HAL_HASH_ERROR_NONE;
/* Return function status */
return HAL_OK;
}
/**
* @brief DeInitialize the HASH peripheral.
* @param hhash: HASH handle.
* @retval HAL status
*/
HAL_StatusTypeDef HAL_HASH_DeInit(HASH_HandleTypeDef *hhash)
{
/* Check the HASH handle allocation */
if(hhash == NULL)
{
return HAL_ERROR;
}
/* Change the HASH state */
hhash->State = HAL_HASH_STATE_BUSY;
/* Set the default HASH phase */
hhash->Phase = HAL_HASH_PHASE_READY;
/* Reset HashInCount, HashITCounter and HashBuffSize */
hhash->HashInCount = 0;
hhash->HashBuffSize = 0;
hhash->HashITCounter = 0;
/* Reset digest calculation bridle (MDMAT bit control) */
hhash->DigestCalculationDisable = RESET;
#if (USE_HAL_HASH_REGISTER_CALLBACKS == 1)
if(hhash->MspDeInitCallback == NULL)
{
hhash->MspDeInitCallback = HAL_HASH_MspDeInit;
}
/* DeInit the low level hardware */
hhash->MspDeInitCallback(hhash);
#else
/* DeInit the low level hardware: CLOCK, NVIC */
HAL_HASH_MspDeInit(hhash);
#endif /* (USE_HAL_HASH_REGISTER_CALLBACKS) */
/* Reset HASH handle status */
hhash->Status = HAL_OK;
/* Set the HASH state to Ready */
hhash->State = HAL_HASH_STATE_RESET;
/* Initialise the error code */
hhash->ErrorCode = HAL_HASH_ERROR_NONE;
/* Return function status */
return HAL_OK;
}
/**
* @brief Initialize the HASH MSP.
* @param hhash: HASH handle.
* @retval None
*/
__weak void HAL_HASH_MspInit(HASH_HandleTypeDef *hhash)
{
/* Prevent unused argument(s) compilation warning */
UNUSED(hhash);
/* NOTE : This function should not be modified; when the callback is needed,
HAL_HASH_MspInit() can be implemented in the user file.
*/
}
/**
* @brief DeInitialize the HASH MSP.
* @param hhash: HASH handle.
* @retval None
*/
__weak void HAL_HASH_MspDeInit(HASH_HandleTypeDef *hhash)
{
/* Prevent unused argument(s) compilation warning */
UNUSED(hhash);
/* NOTE : This function should not be modified; when the callback is needed,
HAL_HASH_MspDeInit() can be implemented in the user file.
*/
}
/**
* @brief Input data transfer complete call back.
* @note HAL_HASH_InCpltCallback() is called when the complete input message
* has been fed to the IP. This API is invoked only when input data are
* entered under interruption or thru DMA.
* @note In case of HASH or HMAC multi-buffer DMA feeding case (MDMAT bit set),
* HAL_HASH_InCpltCallback() is called at the end of each buffer feeding
* to the IP.
* @param hhash: HASH handle.
* @retval None
*/
__weak void HAL_HASH_InCpltCallback(HASH_HandleTypeDef *hhash)
{
/* Prevent unused argument(s) compilation warning */
UNUSED(hhash);
/* NOTE : This function should not be modified; when the callback is needed,
HAL_HASH_InCpltCallback() can be implemented in the user file.
*/
}
/**
* @brief Digest computation complete call back.
* @note HAL_HASH_DgstCpltCallback() is used under interruption, is not
* relevant with DMA.
* @param hhash: HASH handle.
* @retval None
*/
__weak void HAL_HASH_DgstCpltCallback(HASH_HandleTypeDef *hhash)
{
/* Prevent unused argument(s) compilation warning */
UNUSED(hhash);
/* NOTE : This function should not be modified; when the callback is needed,
HAL_HASH_DgstCpltCallback() can be implemented in the user file.
*/
}
/**
* @brief Error callback.
* @note Code user can resort to hhash->Status (HAL_ERROR, HAL_TIMEOUT,...)
* to retrieve the error type.
* @param hhash: HASH handle.
* @retval None
*/
__weak void HAL_HASH_ErrorCallback(HASH_HandleTypeDef *hhash)
{
/* Prevent unused argument(s) compilation warning */
UNUSED(hhash);
/* NOTE : This function should not be modified; when the callback is needed,
HAL_HASH_ErrorCallback() can be implemented in the user file.
*/
}
#if (USE_HAL_HASH_REGISTER_CALLBACKS == 1)
/**
* @brief Register a User HASH Callback
* To be used instead of the weak (surcharged) predefined callback
* @param hhash HASH handle
* @param CallbackID ID of the callback to be registered
* This parameter can be one of the following values:
* @arg @ref HAL_HASH_INPUTCPLT_CB_ID HASH input completion Callback ID
* @arg @ref HAL_HASH_DGSTCPLT_CB_ID HASH digest computation completion Callback ID
* @arg @ref HAL_HASH_ERROR_CB_ID HASH error Callback ID
* @arg @ref HAL_HASH_MSPINIT_CB_ID HASH MspInit callback ID
* @arg @ref HAL_HASH_MSPDEINIT_CB_ID HASH MspDeInit callback ID
* @param pCallback pointer to the Callback function
* @retval status
*/
HAL_StatusTypeDef HAL_HASH_RegisterCallback(HASH_HandleTypeDef *hhash, HAL_HASH_CallbackIDTypeDef CallbackID, pHASH_CallbackTypeDef pCallback)
{
HAL_StatusTypeDef status = HAL_OK;
if(pCallback == NULL)
{
/* Update the error code */
hhash->ErrorCode |= HAL_HASH_ERROR_INVALID_CALLBACK;
return HAL_ERROR;
}
/* Process locked */
__HAL_LOCK(hhash);
if(HAL_HASH_STATE_READY == hhash->State)
{
switch (CallbackID)
{
case HAL_HASH_INPUTCPLT_CB_ID :
hhash->InCpltCallback = pCallback;
break;
case HAL_HASH_DGSTCPLT_CB_ID :
hhash->DgstCpltCallback = pCallback;
break;
case HAL_HASH_ERROR_CB_ID :
hhash->ErrorCallback = pCallback;
break;
case HAL_HASH_MSPINIT_CB_ID :
hhash->MspInitCallback = pCallback;
break;
case HAL_HASH_MSPDEINIT_CB_ID :
hhash->MspDeInitCallback = pCallback;
break;
default :
/* Update the error code */
hhash->ErrorCode |= HAL_HASH_ERROR_INVALID_CALLBACK;
/* update return status */
status = HAL_ERROR;
break;
}
}
else if(HAL_HASH_STATE_RESET == hhash->State)
{
switch (CallbackID)
{
case HAL_HASH_MSPINIT_CB_ID :
hhash->MspInitCallback = pCallback;
break;
case HAL_HASH_MSPDEINIT_CB_ID :
hhash->MspDeInitCallback = pCallback;
break;
default :
/* Update the error code */
hhash->ErrorCode |= HAL_HASH_ERROR_INVALID_CALLBACK;
/* update return status */
status = HAL_ERROR;
break;
}
}
else
{
/* Update the error code */
hhash->ErrorCode |= HAL_HASH_ERROR_INVALID_CALLBACK;
/* update return status */
status = HAL_ERROR;
}
/* Release Lock */
__HAL_UNLOCK(hhash);
return status;
}
/**
* @brief Unregister a HASH Callback
* HASH Callback is redirected to the weak (surcharged) predefined callback
* @param hhash HASH handle
* @param CallbackID ID of the callback to be unregistered
* This parameter can be one of the following values:
* @arg @ref HAL_HASH_INPUTCPLT_CB_ID HASH input completion Callback ID
* @arg @ref HAL_HASH_DGSTCPLT_CB_ID HASH digest computation completion Callback ID
* @arg @ref HAL_HASH_ERROR_CB_ID HASH error Callback ID
* @arg @ref HAL_HASH_MSPINIT_CB_ID HASH MspInit callback ID
* @arg @ref HAL_HASH_MSPDEINIT_CB_ID HASH MspDeInit callback ID
* @retval status
*/
HAL_StatusTypeDef HAL_HASH_UnRegisterCallback(HASH_HandleTypeDef *hhash, HAL_HASH_CallbackIDTypeDef CallbackID)
{
HAL_StatusTypeDef status = HAL_OK;
/* Process locked */
__HAL_LOCK(hhash);
if(HAL_HASH_STATE_READY == hhash->State)
{
switch (CallbackID)
{
case HAL_HASH_INPUTCPLT_CB_ID :
hhash->InCpltCallback = HAL_HASH_InCpltCallback; /* Legacy weak (surcharged) input completion callback */
break;
case HAL_HASH_DGSTCPLT_CB_ID :
hhash->DgstCpltCallback = HAL_HASH_DgstCpltCallback; /* Legacy weak (surcharged) digest computation completion callback */
break;
case HAL_HASH_ERROR_CB_ID :
hhash->ErrorCallback = HAL_HASH_ErrorCallback; /* Legacy weak (surcharged) error callback */
break;
case HAL_HASH_MSPINIT_CB_ID :
hhash->MspInitCallback = HAL_HASH_MspInit; /* Legacy weak (surcharged) Msp Init */
break;
case HAL_HASH_MSPDEINIT_CB_ID :
hhash->MspDeInitCallback = HAL_HASH_MspDeInit; /* Legacy weak (surcharged) Msp DeInit */
break;
default :
/* Update the error code */
hhash->ErrorCode |= HAL_HASH_ERROR_INVALID_CALLBACK;
/* update return status */
status = HAL_ERROR;
break;
}
}
else if(HAL_HASH_STATE_RESET == hhash->State)
{
switch (CallbackID)
{
case HAL_HASH_MSPINIT_CB_ID :
hhash->MspInitCallback = HAL_HASH_MspInit; /* Legacy weak (surcharged) Msp Init */
break;
case HAL_HASH_MSPDEINIT_CB_ID :
hhash->MspDeInitCallback = HAL_HASH_MspDeInit; /* Legacy weak (surcharged) Msp DeInit */
break;
default :
/* Update the error code */
hhash->ErrorCode |= HAL_HASH_ERROR_INVALID_CALLBACK;
/* update return status */
status = HAL_ERROR;
break;
}
}
else
{
/* Update the error code */
hhash->ErrorCode |= HAL_HASH_ERROR_INVALID_CALLBACK;
/* update return status */
status = HAL_ERROR;
}
/* Release Lock */
__HAL_UNLOCK(hhash);
return status;
}
#endif /* USE_HAL_HASH_REGISTER_CALLBACKS */
/**
* @}
*/
/** @defgroup HASH_Exported_Functions_Group2 HASH processing functions in polling mode
* @brief HASH processing functions using polling mode.
*
@verbatim
===============================================================================
##### Polling mode HASH processing functions #####
===============================================================================
[..] This section provides functions allowing to calculate in polling mode
the hash value using one of the following algorithms:
(+) MD5
(++) HAL_HASH_MD5_Start()
(++) HAL_HASH_MD5_Accumulate()
(+) SHA1
(++) HAL_HASH_SHA1_Start()
(++) HAL_HASH_SHA1_Accumulate()
[..] For a single buffer to be hashed, user can resort to HAL_HASH_xxx_Start().
[..] In case of multi-buffer HASH processing (a single digest is computed while
several buffers are fed to the IP), the user can resort to successive calls
to HAL_HASH_xxx_Accumulate() and wrap-up the digest computation by a call
to HAL_HASH_xxx_Start().
@endverbatim
* @{
*/
/**
* @brief Initialize the HASH peripheral in MD5 mode, next process pInBuffer then
* read the computed digest.
* @note Digest is available in pOutBuffer.
* @param hhash: HASH handle.
* @param pInBuffer: pointer to the input buffer (buffer to be hashed).
* @param Size: length of the input buffer in bytes.
* @param pOutBuffer: pointer to the computed digest. Digest size is 16 bytes.
* @param Timeout: Timeout value
* @retval HAL status
*/
HAL_StatusTypeDef HAL_HASH_MD5_Start(HASH_HandleTypeDef *hhash, uint8_t *pInBuffer, uint32_t Size, uint8_t* pOutBuffer, uint32_t Timeout)
{
return HASH_Start(hhash, pInBuffer, Size, pOutBuffer, Timeout, HASH_ALGOSELECTION_MD5);
}
/**
* @brief If not already done, initialize the HASH peripheral in MD5 mode then
* processes pInBuffer.
* @note Consecutive calls to HAL_HASH_MD5_Accumulate() can be used to feed
* several input buffers back-to-back to the IP that will yield a single
* HASH signature once all buffers have been entered. Wrap-up of input
* buffers feeding and retrieval of digest is done by a call to
* HAL_HASH_MD5_Start().
* @note Field hhash->Phase of HASH handle is tested to check whether or not
* the IP has already been initialized.
* @note Digest is not retrieved by this API, user must resort to HAL_HASH_MD5_Start()
* to read it, feeding at the same time the last input buffer to the IP.
* @note The input buffer size (in bytes) must be a multiple of 4 otherwise, the
* HASH digest computation is corrupted. Only HAL_HASH_MD5_Start() is able
* to manage the ending buffer with a length in bytes not a multiple of 4.
* @param hhash: HASH handle.
* @param pInBuffer: pointer to the input buffer (buffer to be hashed).
* @param Size: length of the input buffer in bytes, must be a multiple of 4.
* @retval HAL status
*/
HAL_StatusTypeDef HAL_HASH_MD5_Accumulate(HASH_HandleTypeDef *hhash, uint8_t *pInBuffer, uint32_t Size)
{
return HASH_Accumulate(hhash, pInBuffer, Size,HASH_ALGOSELECTION_MD5);
}
/**
* @brief Initialize the HASH peripheral in SHA1 mode, next process pInBuffer then
* read the computed digest.
* @note Digest is available in pOutBuffer.
* @param hhash: HASH handle.
* @param pInBuffer: pointer to the input buffer (buffer to be hashed).
* @param Size: length of the input buffer in bytes.
* @param pOutBuffer: pointer to the computed digest. Digest size is 20 bytes.
* @param Timeout: Timeout value
* @retval HAL status
*/
HAL_StatusTypeDef HAL_HASH_SHA1_Start(HASH_HandleTypeDef *hhash, uint8_t *pInBuffer, uint32_t Size, uint8_t* pOutBuffer, uint32_t Timeout)
{
return HASH_Start(hhash, pInBuffer, Size, pOutBuffer, Timeout, HASH_ALGOSELECTION_SHA1);
}
/**
* @brief If not already done, initialize the HASH peripheral in SHA1 mode then
* processes pInBuffer.
* @note Consecutive calls to HAL_HASH_SHA1_Accumulate() can be used to feed
* several input buffers back-to-back to the IP that will yield a single
* HASH signature once all buffers have been entered. Wrap-up of input
* buffers feeding and retrieval of digest is done by a call to
* HAL_HASH_SHA1_Start().
* @note Field hhash->Phase of HASH handle is tested to check whether or not
* the IP has already been initialized.
* @note Digest is not retrieved by this API, user must resort to HAL_HASH_SHA1_Start()
* to read it, feeding at the same time the last input buffer to the IP.
* @note The input buffer size (in bytes) must be a multiple of 4 otherwise, the
* HASH digest computation is corrupted. Only HAL_HASH_SHA1_Start() is able
* to manage the ending buffer with a length in bytes not a multiple of 4.
* @param hhash: HASH handle.
* @param pInBuffer: pointer to the input buffer (buffer to be hashed).
* @param Size: length of the input buffer in bytes, must be a multiple of 4.
* @retval HAL status
*/
HAL_StatusTypeDef HAL_HASH_SHA1_Accumulate(HASH_HandleTypeDef *hhash, uint8_t *pInBuffer, uint32_t Size)
{
return HASH_Accumulate(hhash, pInBuffer, Size,HASH_ALGOSELECTION_SHA1);
}
/**
* @}
*/
/** @defgroup HASH_Exported_Functions_Group3 HASH processing functions in interrupt mode
* @brief HASH processing functions using interrupt mode.
*
@verbatim
===============================================================================
##### Interruption mode HASH processing functions #####
===============================================================================
[..] This section provides functions allowing to calculate in interrupt mode
the hash value using one of the following algorithms:
(+) MD5
(++) HAL_HASH_MD5_Start_IT()
(+) SHA1
(++) HAL_HASH_SHA1_Start_IT()
[..] API HAL_HASH_IRQHandler() manages each HASH interruption.
[..] Note that HAL_HASH_IRQHandler() manages as well HASH IP interruptions when in
HMAC processing mode.
@endverbatim
* @{
*/
/**
* @brief Initialize the HASH peripheral in MD5 mode, next process pInBuffer then
* read the computed digest in interruption mode.
* @note Digest is available in pOutBuffer.
* @param hhash: HASH handle.
* @param pInBuffer: pointer to the input buffer (buffer to be hashed).
* @param Size: length of the input buffer in bytes.
* @param pOutBuffer: pointer to the computed digest. Digest size is 16 bytes.
* @retval HAL status
*/
HAL_StatusTypeDef HAL_HASH_MD5_Start_IT(HASH_HandleTypeDef *hhash, uint8_t *pInBuffer, uint32_t Size, uint8_t* pOutBuffer)
{
return HASH_Start_IT(hhash, pInBuffer, Size, pOutBuffer,HASH_ALGOSELECTION_MD5);
}
/**
* @brief Initialize the HASH peripheral in SHA1 mode, next process pInBuffer then
* read the computed digest in interruption mode.
* @note Digest is available in pOutBuffer.
* @param hhash: HASH handle.
* @param pInBuffer: pointer to the input buffer (buffer to be hashed).
* @param Size: length of the input buffer in bytes.
* @param pOutBuffer: pointer to the computed digest. Digest size is 20 bytes.
* @retval HAL status
*/
HAL_StatusTypeDef HAL_HASH_SHA1_Start_IT(HASH_HandleTypeDef *hhash, uint8_t *pInBuffer, uint32_t Size, uint8_t* pOutBuffer)
{
return HASH_Start_IT(hhash, pInBuffer, Size, pOutBuffer,HASH_ALGOSELECTION_SHA1);
}
/**
* @brief Handle HASH interrupt request.
* @param hhash: HASH handle.
* @note HAL_HASH_IRQHandler() handles interrupts in HMAC processing as well.
* @note In case of error reported during the HASH interruption processing,
* HAL_HASH_ErrorCallback() API is called so that user code can
* manage the error. The error type is available in hhash->Status field.
* @retval None
*/
void HAL_HASH_IRQHandler(HASH_HandleTypeDef *hhash)
{
hhash->Status = HASH_IT(hhash);
if (hhash->Status != HAL_OK)
{
hhash->ErrorCode |= HAL_HASH_ERROR_IT;
#if (USE_HAL_HASH_REGISTER_CALLBACKS == 1)
hhash->ErrorCallback(hhash);
#else
HAL_HASH_ErrorCallback(hhash);
#endif /* USE_HAL_HASH_REGISTER_CALLBACKS */
/* After error handling by code user, reset HASH handle HAL status */
hhash->Status = HAL_OK;
}
}
/**
* @}
*/
/** @defgroup HASH_Exported_Functions_Group4 HASH processing functions in DMA mode
* @brief HASH processing functions using DMA mode.
*
@verbatim
===============================================================================
##### DMA mode HASH processing functions #####
===============================================================================
[..] This section provides functions allowing to calculate in DMA mode
the hash value using one of the following algorithms:
(+) MD5
(++) HAL_HASH_MD5_Start_DMA()
(++) HAL_HASH_MD5_Finish()
(+) SHA1
(++) HAL_HASH_SHA1_Start_DMA()
(++) HAL_HASH_SHA1_Finish()
[..] When resorting to DMA mode to enter the data in the IP, user must resort
to HAL_HASH_xxx_Start_DMA() then read the resulting digest with
HAL_HASH_xxx_Finish().
[..] In case of multi-buffer HASH processing, MDMAT bit must first be set before
the successive calls to HAL_HASH_xxx_Start_DMA(). Then, MDMAT bit needs to be
reset before the last call to HAL_HASH_xxx_Start_DMA(). Digest is finally
retrieved thanks to HAL_HASH_xxx_Finish().
@endverbatim
* @{
*/
/**
* @brief Initialize the HASH peripheral in MD5 mode then initiate a DMA transfer
* to feed the input buffer to the IP.
* @note Once the DMA transfer is finished, HAL_HASH_MD5_Finish() API must
* be called to retrieve the computed digest.
* @param hhash: HASH handle.
* @param pInBuffer: pointer to the input buffer (buffer to be hashed).
* @param Size: length of the input buffer in bytes.
* @retval HAL status
*/
HAL_StatusTypeDef HAL_HASH_MD5_Start_DMA(HASH_HandleTypeDef *hhash, uint8_t *pInBuffer, uint32_t Size)
{
return HASH_Start_DMA(hhash, pInBuffer, Size, HASH_ALGOSELECTION_MD5);
}
/**
* @brief Return the computed digest in MD5 mode.
* @note The API waits for DCIS to be set then reads the computed digest.
* @note HAL_HASH_MD5_Finish() can be used as well to retrieve the digest in
* HMAC MD5 mode.
* @param hhash: HASH handle.
* @param pOutBuffer: pointer to the computed digest. Digest size is 16 bytes.
* @param Timeout: Timeout value.
* @retval HAL status
*/
HAL_StatusTypeDef HAL_HASH_MD5_Finish(HASH_HandleTypeDef *hhash, uint8_t* pOutBuffer, uint32_t Timeout)
{
return HASH_Finish(hhash, pOutBuffer, Timeout);
}
/**
* @brief Initialize the HASH peripheral in SHA1 mode then initiate a DMA transfer
* to feed the input buffer to the IP.
* @note Once the DMA transfer is finished, HAL_HASH_SHA1_Finish() API must
* be called to retrieve the computed digest.
* @param hhash: HASH handle.
* @param pInBuffer: pointer to the input buffer (buffer to be hashed).
* @param Size: length of the input buffer in bytes.
* @retval HAL status
*/
HAL_StatusTypeDef HAL_HASH_SHA1_Start_DMA(HASH_HandleTypeDef *hhash, uint8_t *pInBuffer, uint32_t Size)
{
return HASH_Start_DMA(hhash, pInBuffer, Size, HASH_ALGOSELECTION_SHA1);
}
/**
* @brief Return the computed digest in SHA1 mode.
* @note The API waits for DCIS to be set then reads the computed digest.
* @note HAL_HASH_SHA1_Finish() can be used as well to retrieve the digest in
* HMAC SHA1 mode.
* @param hhash: HASH handle.
* @param pOutBuffer: pointer to the computed digest. Digest size is 20 bytes.
* @param Timeout: Timeout value.
* @retval HAL status
*/
HAL_StatusTypeDef HAL_HASH_SHA1_Finish(HASH_HandleTypeDef *hhash, uint8_t* pOutBuffer, uint32_t Timeout)
{
return HASH_Finish(hhash, pOutBuffer, Timeout);
}
/**
* @}
*/
/** @defgroup HASH_Exported_Functions_Group5 HMAC processing functions in polling mode
* @brief HMAC processing functions using polling mode.
*
@verbatim
===============================================================================
##### Polling mode HMAC processing functions #####
===============================================================================
[..] This section provides functions allowing to calculate in polling mode
the HMAC value using one of the following algorithms:
(+) MD5
(++) HAL_HMAC_MD5_Start()
(+) SHA1
(++) HAL_HMAC_SHA1_Start()
@endverbatim
* @{
*/
/**
* @brief Initialize the HASH peripheral in HMAC MD5 mode, next process pInBuffer then
* read the computed digest.
* @note Digest is available in pOutBuffer.
* @note Same key is used for the inner and the outer hash functions; pointer to key and
* key size are respectively stored in hhash->Init.pKey and hhash->Init.KeySize.
* @param hhash: HASH handle.
* @param pInBuffer: pointer to the input buffer (buffer to be hashed).
* @param Size: length of the input buffer in bytes.
* @param pOutBuffer: pointer to the computed digest. Digest size is 16 bytes.
* @param Timeout: Timeout value.
* @retval HAL status
*/
HAL_StatusTypeDef HAL_HMAC_MD5_Start(HASH_HandleTypeDef *hhash, uint8_t *pInBuffer, uint32_t Size, uint8_t* pOutBuffer, uint32_t Timeout)
{
return HMAC_Start(hhash, pInBuffer, Size, pOutBuffer, Timeout, HASH_ALGOSELECTION_MD5);
}
/**
* @brief Initialize the HASH peripheral in HMAC SHA1 mode, next process pInBuffer then
* read the computed digest.
* @note Digest is available in pOutBuffer.
* @note Same key is used for the inner and the outer hash functions; pointer to key and
* key size are respectively stored in hhash->Init.pKey and hhash->Init.KeySize.
* @param hhash: HASH handle.
* @param pInBuffer: pointer to the input buffer (buffer to be hashed).
* @param Size: length of the input buffer in bytes.
* @param pOutBuffer: pointer to the computed digest. Digest size is 20 bytes.
* @param Timeout: Timeout value.
* @retval HAL status
*/
HAL_StatusTypeDef HAL_HMAC_SHA1_Start(HASH_HandleTypeDef *hhash, uint8_t *pInBuffer, uint32_t Size, uint8_t* pOutBuffer, uint32_t Timeout)
{
return HMAC_Start(hhash, pInBuffer, Size, pOutBuffer, Timeout, HASH_ALGOSELECTION_SHA1);
}
/**
* @}
*/
/** @defgroup HASH_Exported_Functions_Group6 HMAC processing functions in interrupt mode
* @brief HMAC processing functions using interrupt mode.
*
@verbatim
===============================================================================
##### Interrupt mode HMAC processing functions #####
===============================================================================
[..] This section provides functions allowing to calculate in interrupt mode
the HMAC value using one of the following algorithms:
(+) MD5
(++) HAL_HMAC_MD5_Start_IT()
(+) SHA1
(++) HAL_HMAC_SHA1_Start_IT()
@endverbatim
* @{
*/
/**
* @brief Initialize the HASH peripheral in HMAC MD5 mode, next process pInBuffer then
* read the computed digest in interrupt mode.
* @note Digest is available in pOutBuffer.
* @note Same key is used for the inner and the outer hash functions; pointer to key and
* key size are respectively stored in hhash->Init.pKey and hhash->Init.KeySize.
* @param hhash: HASH handle.
* @param pInBuffer: pointer to the input buffer (buffer to be hashed).
* @param Size: length of the input buffer in bytes.
* @param pOutBuffer: pointer to the computed digest. Digest size is 16 bytes.
* @retval HAL status
*/
HAL_StatusTypeDef HAL_HMAC_MD5_Start_IT(HASH_HandleTypeDef *hhash, uint8_t *pInBuffer, uint32_t Size, uint8_t* pOutBuffer)
{
return HMAC_Start_IT(hhash, pInBuffer, Size, pOutBuffer, HASH_ALGOSELECTION_MD5);
}
/**
* @brief Initialize the HASH peripheral in HMAC SHA1 mode, next process pInBuffer then
* read the computed digest in interrupt mode.
* @note Digest is available in pOutBuffer.
* @note Same key is used for the inner and the outer hash functions; pointer to key and
* key size are respectively stored in hhash->Init.pKey and hhash->Init.KeySize.
* @param hhash: HASH handle.
* @param pInBuffer: pointer to the input buffer (buffer to be hashed).
* @param Size: length of the input buffer in bytes.
* @param pOutBuffer: pointer to the computed digest. Digest size is 20 bytes.
* @retval HAL status
*/
HAL_StatusTypeDef HAL_HMAC_SHA1_Start_IT(HASH_HandleTypeDef *hhash, uint8_t *pInBuffer, uint32_t Size, uint8_t* pOutBuffer)
{
return HMAC_Start_IT(hhash, pInBuffer, Size, pOutBuffer, HASH_ALGOSELECTION_SHA1);
}
/**
* @}
*/
/** @defgroup HASH_Exported_Functions_Group7 HMAC processing functions in DMA mode
* @brief HMAC processing functions using DMA modes.
*
@verbatim
===============================================================================
##### DMA mode HMAC processing functions #####
===============================================================================
[..] This section provides functions allowing to calculate in DMA mode
the HMAC value using one of the following algorithms:
(+) MD5
(++) HAL_HMAC_MD5_Start_DMA()
(+) SHA1
(++) HAL_HMAC_SHA1_Start_DMA()
[..] When resorting to DMA mode to enter the data in the IP for HMAC processing,
user must resort to HAL_HMAC_xxx_Start_DMA() then read the resulting digest
with HAL_HASH_xxx_Finish().
@endverbatim
* @{
*/
/**
* @brief Initialize the HASH peripheral in HMAC MD5 mode then initiate the required
* DMA transfers to feed the key and the input buffer to the IP.
* @note Once the DMA transfers are finished (indicated by hhash->State set back
* to HAL_HASH_STATE_READY), HAL_HASH_MD5_Finish() API must be called to retrieve
* the computed digest.
* @note Same key is used for the inner and the outer hash functions; pointer to key and
* key size are respectively stored in hhash->Init.pKey and hhash->Init.KeySize.
* @note If MDMAT bit is set before calling this function (multi-buffer
* HASH processing case), the input buffer size (in bytes) must be
* a multiple of 4 otherwise, the HASH digest computation is corrupted.
* For the processing of the last buffer of the thread, MDMAT bit must
* be reset and the buffer length (in bytes) doesn't have to be a
* multiple of 4.
* @param hhash: HASH handle.
* @param pInBuffer: pointer to the input buffer (buffer to be hashed).
* @param Size: length of the input buffer in bytes.
* @retval HAL status
*/
HAL_StatusTypeDef HAL_HMAC_MD5_Start_DMA(HASH_HandleTypeDef *hhash, uint8_t *pInBuffer, uint32_t Size)
{
return HMAC_Start_DMA(hhash, pInBuffer, Size, HASH_ALGOSELECTION_MD5);
}
/**
* @brief Initialize the HASH peripheral in HMAC SHA1 mode then initiate the required
* DMA transfers to feed the key and the input buffer to the IP.
* @note Once the DMA transfers are finished (indicated by hhash->State set back
* to HAL_HASH_STATE_READY), HAL_HASH_SHA1_Finish() API must be called to retrieve
* the computed digest.
* @note Same key is used for the inner and the outer hash functions; pointer to key and
* key size are respectively stored in hhash->Init.pKey and hhash->Init.KeySize.
* @note If MDMAT bit is set before calling this function (multi-buffer
* HASH processing case), the input buffer size (in bytes) must be
* a multiple of 4 otherwise, the HASH digest computation is corrupted.
* For the processing of the last buffer of the thread, MDMAT bit must
* be reset and the buffer length (in bytes) doesn't have to be a
* multiple of 4.
* @param hhash: HASH handle.
* @param pInBuffer: pointer to the input buffer (buffer to be hashed).
* @param Size: length of the input buffer in bytes.
* @retval HAL status
*/
HAL_StatusTypeDef HAL_HMAC_SHA1_Start_DMA(HASH_HandleTypeDef *hhash, uint8_t *pInBuffer, uint32_t Size)
{
return HMAC_Start_DMA(hhash, pInBuffer, Size, HASH_ALGOSELECTION_SHA1);
}
/**
* @}
*/
/** @defgroup HASH_Exported_Functions_Group8 Peripheral states functions
* @brief Peripheral State functions.
*
@verbatim
===============================================================================
##### Peripheral State methods #####
===============================================================================
[..]
This section permits to get in run-time the state and the peripheral handle
status of the peripheral:
(+) HAL_HASH_GetState()
(+) HAL_HASH_GetStatus()
[..]
Additionally, this subsection provides functions allowing to save and restore
the HASH or HMAC processing context in case of calculation suspension:
(+) HAL_HASH_ContextSaving()
(+) HAL_HASH_ContextRestoring()
[..]
This subsection provides functions allowing to suspend the HASH processing
(+) when input are fed to the IP by software
(++) HAL_HASH_SwFeed_ProcessSuspend()
(+) when input are fed to the IP by DMA
(++) HAL_HASH_DMAFeed_ProcessSuspend()
@endverbatim
* @{
*/
/**
* @brief Return the HASH handle state.
* @note The API yields the current state of the handle (BUSY, READY,...).
* @param hhash: HASH handle.
* @retval HAL HASH state
*/
HAL_HASH_StateTypeDef HAL_HASH_GetState(HASH_HandleTypeDef *hhash)
{
return hhash->State;
}
/**
* @brief Return the HASH HAL status.
* @note The API yields the HAL status of the handle: it is the result of the
* latest HASH processing and allows to report any issue (e.g. HAL_TIMEOUT).
* @param hhash: HASH handle.
* @retval HAL status
*/
HAL_StatusTypeDef HAL_HASH_GetStatus(HASH_HandleTypeDef *hhash)
{
return hhash->Status;
}
/**
* @brief Save the HASH context in case of processing suspension.
* @param hhash: HASH handle.
* @param pMemBuffer: pointer to the memory buffer where the HASH context
* is saved.
* @note The IMR, STR, CR then all the CSR registers are saved
* in that order. Only the r/w bits are read to be restored later on.
* @note By default, all the context swap registers (there are
* HASH_NUMBER_OF_CSR_REGISTERS of those) are saved.
* @note pMemBuffer points to a buffer allocated by the user. The buffer size
* must be at least (HASH_NUMBER_OF_CSR_REGISTERS + 3) * 4 uint8 long.
* @retval None
*/
void HAL_HASH_ContextSaving(HASH_HandleTypeDef *hhash, uint8_t* pMemBuffer)
{
uint32_t mem_ptr = (uint32_t)pMemBuffer;
uint32_t csr_ptr = (uint32_t)HASH->CSR;
uint32_t i = 0;
/* Prevent unused argument(s) compilation warning */
UNUSED(hhash);
/* Save IMR register content */
*(uint32_t*)(mem_ptr) = READ_BIT(HASH->IMR,HASH_IT_DINI|HASH_IT_DCI);
mem_ptr+=4;
/* Save STR register content */
*(uint32_t*)(mem_ptr) = READ_BIT(HASH->STR,HASH_STR_NBLW);
mem_ptr+=4;
/* Save CR register content */
*(uint32_t*)(mem_ptr) = READ_BIT(HASH->CR,HASH_CR_DMAE|HASH_CR_DATATYPE|HASH_CR_MODE|HASH_CR_ALGO|HASH_CR_LKEY|HASH_CR_MDMAT);
mem_ptr+=4;
/* By default, save all CSRs registers */
for (i = HASH_NUMBER_OF_CSR_REGISTERS; i >0; i--)
{
*(uint32_t*)(mem_ptr) = *(uint32_t*)(csr_ptr);
mem_ptr+=4;
csr_ptr+=4;
}
}
/**
* @brief Restore the HASH context in case of processing resumption.
* @param hhash: HASH handle.
* @param pMemBuffer: pointer to the memory buffer where the HASH context
* is stored.
* @note The IMR, STR, CR then all the CSR registers are restored
* in that order. Only the r/w bits are restored.
* @note By default, all the context swap registers (HASH_NUMBER_OF_CSR_REGISTERS
* of those) are restored (all of them have been saved by default
* beforehand).
* @retval None
*/
void HAL_HASH_ContextRestoring(HASH_HandleTypeDef *hhash, uint8_t* pMemBuffer)
{
uint32_t mem_ptr = (uint32_t)pMemBuffer;
uint32_t csr_ptr = (uint32_t)HASH->CSR;
uint32_t i = 0;
/* Prevent unused argument(s) compilation warning */
UNUSED(hhash);
/* Restore IMR register content */
WRITE_REG(HASH->IMR, (*(uint32_t*)(mem_ptr)));
mem_ptr+=4;
/* Restore STR register content */
WRITE_REG(HASH->STR, (*(uint32_t*)(mem_ptr)));
mem_ptr+=4;
/* Restore CR register content */
WRITE_REG(HASH->CR, (*(uint32_t*)(mem_ptr)));
mem_ptr+=4;
/* Reset the HASH processor before restoring the Context
Swap Registers (CSR) */
__HAL_HASH_INIT();
/* By default, restore all CSR registers */
for (i = HASH_NUMBER_OF_CSR_REGISTERS; i >0; i--)
{
WRITE_REG((*(uint32_t*)(csr_ptr)), (*(uint32_t*)(mem_ptr)));
mem_ptr+=4;
csr_ptr+=4;
}
}
/**
* @brief Initiate HASH processing suspension when in polling or interruption mode.
* @param hhash: HASH handle.
* @note Set the handle field SuspendRequest to the appropriate value so that
* the on-going HASH processing is suspended as soon as the required
* conditions are met. Note that the actual suspension is carried out
* by the functions HASH_WriteData() in polling mode and HASH_IT() in
* interruption mode.
* @retval None
*/
void HAL_HASH_SwFeed_ProcessSuspend(HASH_HandleTypeDef *hhash)
{
/* Set Handle Suspend Request field */
hhash->SuspendRequest = HAL_HASH_SUSPEND;
}
/**
* @brief Suspend the HASH processing when in DMA mode.
* @param hhash: HASH handle.
* @note When suspension attempt occurs at the very end of a DMA transfer and
* all the data have already been entered in the IP, hhash->State is
* set to HAL_HASH_STATE_READY and the API returns HAL_ERROR. It is
* recommended to wrap-up the processing in reading the digest as usual.
* @retval HAL status
*/
HAL_StatusTypeDef HAL_HASH_DMAFeed_ProcessSuspend(HASH_HandleTypeDef *hhash)
{
uint32_t tmp_remaining_DMATransferSize_inWords = 0x0;
uint32_t tmp_initial_DMATransferSize_inWords = 0x0;
uint32_t tmp_words_already_pushed = 0x0;
if (hhash->State == HAL_HASH_STATE_READY)
{
return HAL_ERROR;
}
else
{
/* Make sure there is enough time to suspend the processing */
tmp_remaining_DMATransferSize_inWords = hhash->hdmain->Instance->CNDTR;
if (tmp_remaining_DMATransferSize_inWords <= HASH_DMA_SUSPENSION_WORDS_LIMIT)
{
/* No suspension attempted since almost to the end of the transferred data. */
/* Best option for user code is to wrap up low priority message hashing */
return HAL_ERROR;
}
/* Wait for DMAS to be reset */
if (HASH_WaitOnFlagUntilTimeout(hhash, HASH_FLAG_BUSY, SET, HASH_TIMEOUTVALUE) != HAL_OK)
{
return HAL_TIMEOUT;
}
if (__HAL_HASH_GET_FLAG(HASH_FLAG_DCIS) != RESET)
{
return HAL_ERROR;
}
/* Wait for DMAS to be set */
if (HASH_WaitOnFlagUntilTimeout(hhash, HASH_FLAG_BUSY, RESET, HASH_TIMEOUTVALUE) != HAL_OK)
{
return HAL_TIMEOUT;
}
/* Disable DMA channel */
HAL_DMA_Abort(hhash->hdmain);
/* Clear DMAE bit */
CLEAR_BIT(HASH->CR,HASH_CR_DMAE);
if (HASH_WaitOnFlagUntilTimeout(hhash, HASH_FLAG_BUSY, SET, HASH_TIMEOUTVALUE) != HAL_OK)
{
return HAL_TIMEOUT;
}
if (__HAL_HASH_GET_FLAG(HASH_FLAG_DCIS) != RESET)
{
return HAL_ERROR;
}
/* At this point, DMA interface is disabled and no transfer is on-going */
/* Retrieve from the DMA handle how many words remain to be written */
tmp_remaining_DMATransferSize_inWords = hhash->hdmain->Instance->CNDTR;
if (tmp_remaining_DMATransferSize_inWords == 0)
{
/* All the DMA transfer is actually done. Suspension occurred at the very end
of the transfer. Either the digest computation is about to start (HASH case)
or processing is about to move from one step to another (HMAC case).
In both cases, the processing can't be suspended at this point. It is
safer to
- retrieve the low priority block digest before starting the high
priority block processing (HASH case)
- re-attempt a new suspension (HMAC case)
*/
return HAL_ERROR;
}
else
{
/* Compute how many words were supposed to be transferred by DMA */
tmp_initial_DMATransferSize_inWords = (hhash->HashInCount%4 ? (hhash->HashInCount+3)/4: hhash->HashInCount/4);
/* If discrepancy between the number of words reported by DMA IP and the numbers of words entered as reported
by HASH IP, correct it */
/* tmp_words_already_pushed reflects the number of words that were already pushed before
the start of DMA transfer (multi-buffer processing case) */
tmp_words_already_pushed = hhash->NbWordsAlreadyPushed;
if ((tmp_words_already_pushed + tmp_initial_DMATransferSize_inWords - tmp_remaining_DMATransferSize_inWords) %16 != HASH_NBW_PUSHED())
{
tmp_remaining_DMATransferSize_inWords--; /* one less word to be transferred again */
}
/* Accordingly, update the input pointer that points at the next word to be transferred to the IP by DMA */
hhash->pHashInBuffPtr += 4 * (tmp_initial_DMATransferSize_inWords - tmp_remaining_DMATransferSize_inWords) ;
/* And store in HashInCount the remaining size to transfer (in bytes) */
hhash->HashInCount = 4 * tmp_remaining_DMATransferSize_inWords;
}
/* Set State as suspended */
hhash->State = HAL_HASH_STATE_SUSPENDED;
return HAL_OK;
}
}
/**
* @brief Return the HASH handle error code.
* @param hhash: pointer to a HASH_HandleTypeDef structure.
* @retval HASH Error Code
*/
uint32_t HAL_HASH_GetError(HASH_HandleTypeDef *hhash)
{
/* Return HASH Error Code */
return hhash->ErrorCode;
}
/**
* @}
*/
/**
* @}
*/
/** @defgroup HASH_Private_Functions HASH Private Functions
* @{
*/
/**
* @brief DMA HASH Input Data transfer completion callback.
* @param hdma: DMA handle.
* @note In case of HMAC processing, HASH_DMAXferCplt() initiates
* the next DMA transfer for the following HMAC step.
* @retval None
*/
static void HASH_DMAXferCplt(DMA_HandleTypeDef *hdma)
{
HASH_HandleTypeDef* hhash = ( HASH_HandleTypeDef* )((DMA_HandleTypeDef* )hdma)->Parent;
uint32_t inputaddr = 0x0;
uint32_t buffersize = 0x0;
if (hhash->State != HAL_HASH_STATE_SUSPENDED)
{
/* Disable the DMA transfer */
CLEAR_BIT(HASH->CR, HASH_CR_DMAE);
if (READ_BIT(HASH->CR, HASH_CR_MODE) == RESET)
{
/* If no HMAC processing, input data transfer is now over */
/* Change the HASH state to ready */
hhash->State = HAL_HASH_STATE_READY;
/* Call Input data transfer complete call back */
#if (USE_HAL_HASH_REGISTER_CALLBACKS == 1)
hhash->InCpltCallback(hhash);
#else
HAL_HASH_InCpltCallback(hhash);
#endif /* USE_HAL_HASH_REGISTER_CALLBACKS */
}
else
{
/* HMAC processing: depending on the current HMAC step and whether or
not multi-buffer processing is on-going, the next step is initiated
and MDMAT bit is set. */
if (hhash->Phase == HAL_HASH_PHASE_HMAC_STEP_3)
{
/* This is the end of HMAC processing */
/* Change the HASH state to ready */
hhash->State = HAL_HASH_STATE_READY;
/* Call Input data transfer complete call back
(note that the last DMA transfer was that of the key
for the outer HASH operation). */
#if (USE_HAL_HASH_REGISTER_CALLBACKS == 1)
hhash->InCpltCallback(hhash);
#else
HAL_HASH_InCpltCallback(hhash);
#endif /* USE_HAL_HASH_REGISTER_CALLBACKS */
return;
}
else if (hhash->Phase == HAL_HASH_PHASE_HMAC_STEP_1)
{
inputaddr = (uint32_t)hhash->pHashMsgBuffPtr; /* DMA transfer start address */
buffersize = hhash->HashBuffSize; /* DMA transfer size (in bytes) */
hhash->Phase = HAL_HASH_PHASE_HMAC_STEP_2; /* Move phase from Step 1 to Step 2 */
/* In case of suspension request, save the new starting parameters */
hhash->HashInCount = hhash->HashBuffSize; /* Initial DMA transfer size (in bytes) */
hhash->pHashInBuffPtr = hhash->pHashMsgBuffPtr ; /* DMA transfer start address */
hhash->NbWordsAlreadyPushed = 0; /* Reset number of words already pushed */
/* Check whether or not digest calculation must be disabled (in case of multi-buffer HMAC processing) */
if (hhash->DigestCalculationDisable != RESET)
{
/* Digest calculation is disabled: Step 2 must start with MDMAT bit set,
no digest calculation will be triggered at the end of the input buffer feeding to the IP */
__HAL_HASH_SET_MDMAT();
}
}
else if (hhash->Phase == HAL_HASH_PHASE_HMAC_STEP_2)
{
if (hhash->DigestCalculationDisable != RESET)
{
/* No automatic move to Step 3 as a new message buffer will be fed to the IP
(case of multi-buffer HMAC processing):
DCAL must not be set.
Phase remains in Step 2, MDMAT remains set at this point.
Change the HASH state to ready and call Input data transfer complete call back. */
hhash->State = HAL_HASH_STATE_READY;
#if (USE_HAL_HASH_REGISTER_CALLBACKS == 1)
hhash->InCpltCallback(hhash);
#else
HAL_HASH_InCpltCallback(hhash);
#endif /* USE_HAL_HASH_REGISTER_CALLBACKS */
return ;
}
else
{
/* Digest calculation is not disabled (case of single buffer input or last buffer
of multi-buffer HMAC processing) */
inputaddr = (uint32_t)hhash->Init.pKey; /* DMA transfer start address */
buffersize = hhash->Init.KeySize; /* DMA transfer size (in bytes) */
hhash->Phase = HAL_HASH_PHASE_HMAC_STEP_3; /* Move phase from Step 2 to Step 3 */
/* In case of suspension request, save the new starting parameters */
hhash->HashInCount = hhash->Init.KeySize; /* Initial size for second DMA transfer (input data) */
hhash->pHashInBuffPtr = hhash->Init.pKey ; /* address passed to DMA, now entering data message */
hhash->NbWordsAlreadyPushed = 0; /* Reset number of words already pushed */
}
}
/* Configure the Number of valid bits in last word of the message */
__HAL_HASH_SET_NBVALIDBITS(buffersize);
/* Set the HASH DMA transfert completion call back */
hhash->hdmain->XferCpltCallback = HASH_DMAXferCplt;
/* Enable the DMA In DMA Stream */
HAL_DMA_Start_IT(hhash->hdmain, inputaddr, (uint32_t)&HASH->DIN, (buffersize%4 ? (buffersize+3)/4:buffersize/4));
/* Enable DMA requests */
SET_BIT(HASH->CR, HASH_CR_DMAE);
}
}
return;
}
/**
* @brief DMA HASH communication error callback.
* @param hdma: DMA handle.
* @note HASH_DMAError() callback invokes HAL_HASH_ErrorCallback() that
* can contain user code to manage the error.
* @retval None
*/
static void HASH_DMAError(DMA_HandleTypeDef *hdma)
{
HASH_HandleTypeDef* hhash = ( HASH_HandleTypeDef* )((DMA_HandleTypeDef* )hdma)->Parent;
if (hhash->State != HAL_HASH_STATE_SUSPENDED)
{
hhash->ErrorCode |= HAL_HASH_ERROR_DMA;
/* Set HASH state to ready to prevent any blocking issue in user code
present in HAL_HASH_ErrorCallback() */
hhash->State= HAL_HASH_STATE_READY;
/* Set HASH handle status to error */
hhash->Status = HAL_ERROR;
#if (USE_HAL_HASH_REGISTER_CALLBACKS == 1)
hhash->ErrorCallback(hhash);
#else
HAL_HASH_ErrorCallback(hhash);
#endif /* USE_HAL_HASH_REGISTER_CALLBACKS */
/* After error handling by code user, reset HASH handle HAL status */
hhash->Status = HAL_OK;
}
}
/**
* @brief Feed the input buffer to the HASH IP.
* @param hhash: HASH handle.
* @param pInBuffer: pointer to input buffer.
* @param Size: the size of input buffer in bytes.
* @note HASH_WriteData() regularly reads hhash->SuspendRequest to check whether
* or not the HASH processing must be suspended. If this is the case, the
* processing is suspended when possible and the IP feeding point reached at
* suspension time is stored in the handle for resumption later on.
* @retval HAL status
*/
static HAL_StatusTypeDef HASH_WriteData(HASH_HandleTypeDef *hhash, uint8_t *pInBuffer, uint32_t Size)
{
uint32_t buffercounter;
__IO uint32_t inputaddr = (uint32_t) pInBuffer;
for(buffercounter = 0; buffercounter < Size; buffercounter+=4)
{
/* Write input data 4 bytes at a time */
HASH->DIN = *(uint32_t*)inputaddr;
inputaddr+=4;
/* If the suspension flag has been raised and if the processing is not about
to end, suspend processing */
if ((hhash->SuspendRequest == HAL_HASH_SUSPEND) && ((buffercounter+4) < Size))
{
/* Wait for DINIS = 1, which occurs when 16 32-bit locations are free
in the input buffer */
if (__HAL_HASH_GET_FLAG(HASH_FLAG_DINIS))
{
/* Reset SuspendRequest */
hhash->SuspendRequest = HAL_HASH_SUSPEND_NONE;
/* Depending whether the key or the input data were fed to the IP, the feeding point
reached at suspension time is not saved in the same handle fields */
if ((hhash->Phase == HAL_HASH_PHASE_PROCESS) || (hhash->Phase == HAL_HASH_PHASE_HMAC_STEP_2))
{
/* Save current reading and writing locations of Input and Output buffers */
hhash->pHashInBuffPtr = (uint8_t *)inputaddr;
/* Save the number of bytes that remain to be processed at this point */
hhash->HashInCount = Size - (buffercounter + 4);
}
else if ((hhash->Phase == HAL_HASH_PHASE_HMAC_STEP_1) || (hhash->Phase == HAL_HASH_PHASE_HMAC_STEP_3))
{
/* Save current reading and writing locations of Input and Output buffers */
hhash->pHashKeyBuffPtr = (uint8_t *)inputaddr;
/* Save the number of bytes that remain to be processed at this point */
hhash->HashKeyCount = Size - (buffercounter + 4);
}
else
{
/* Unexpected phase: unlock process and report error */
hhash->State = HAL_HASH_STATE_READY;
__HAL_UNLOCK(hhash);
return HAL_ERROR;
}
/* Set the HASH state to Suspended and exit to stop entering data */
hhash->State = HAL_HASH_STATE_SUSPENDED;
return HAL_OK;
} /* if (__HAL_HASH_GET_FLAG(HASH_FLAG_DINIS)) */
} /* if ((hhash->SuspendRequest == HAL_HASH_SUSPEND) && ((buffercounter+4) < Size)) */
} /* for(buffercounter = 0; buffercounter < Size; buffercounter+=4) */
/* At this point, all the data have been entered to the IP: exit */
return HAL_OK;
}
/**
* @brief Retrieve the message digest.
* @param pMsgDigest: pointer to the computed digest.
* @param Size: message digest size in bytes.
* @retval None
*/
static void HASH_GetDigest(uint8_t *pMsgDigest, uint8_t Size)
{
uint32_t msgdigest = (uint32_t)pMsgDigest;
switch(Size)
{
/* Read the message digest */
case 16: /* MD5 */
*(uint32_t*)(msgdigest) = __REV(HASH->HR[0]);
msgdigest+=4;
*(uint32_t*)(msgdigest) = __REV(HASH->HR[1]);
msgdigest+=4;
*(uint32_t*)(msgdigest) = __REV(HASH->HR[2]);
msgdigest+=4;
*(uint32_t*)(msgdigest) = __REV(HASH->HR[3]);
break;
case 20: /* SHA1 */
*(uint32_t*)(msgdigest) = __REV(HASH->HR[0]);
msgdigest+=4;
*(uint32_t*)(msgdigest) = __REV(HASH->HR[1]);
msgdigest+=4;
*(uint32_t*)(msgdigest) = __REV(HASH->HR[2]);
msgdigest+=4;
*(uint32_t*)(msgdigest) = __REV(HASH->HR[3]);
msgdigest+=4;
*(uint32_t*)(msgdigest) = __REV(HASH->HR[4]);
break;
case 28: /* SHA224 */
*(uint32_t*)(msgdigest) = __REV(HASH->HR[0]);
msgdigest+=4;
*(uint32_t*)(msgdigest) = __REV(HASH->HR[1]);
msgdigest+=4;
*(uint32_t*)(msgdigest) = __REV(HASH->HR[2]);
msgdigest+=4;
*(uint32_t*)(msgdigest) = __REV(HASH->HR[3]);
msgdigest+=4;
*(uint32_t*)(msgdigest) = __REV(HASH->HR[4]);
msgdigest+=4;
*(uint32_t*)(msgdigest) = __REV(HASH_DIGEST->HR[5]);
msgdigest+=4;
*(uint32_t*)(msgdigest) = __REV(HASH_DIGEST->HR[6]);
break;
case 32: /* SHA256 */
*(uint32_t*)(msgdigest) = __REV(HASH->HR[0]);
msgdigest+=4;
*(uint32_t*)(msgdigest) = __REV(HASH->HR[1]);
msgdigest+=4;
*(uint32_t*)(msgdigest) = __REV(HASH->HR[2]);
msgdigest+=4;
*(uint32_t*)(msgdigest) = __REV(HASH->HR[3]);
msgdigest+=4;
*(uint32_t*)(msgdigest) = __REV(HASH->HR[4]);
msgdigest+=4;
*(uint32_t*)(msgdigest) = __REV(HASH_DIGEST->HR[5]);
msgdigest+=4;
*(uint32_t*)(msgdigest) = __REV(HASH_DIGEST->HR[6]);
msgdigest+=4;
*(uint32_t*)(msgdigest) = __REV(HASH_DIGEST->HR[7]);
break;
default:
break;
}
}
/**
* @brief Handle HASH processing Timeout.
* @param hhash: HASH handle.
* @param Flag: specifies the HASH flag to check.
* @param Status: the Flag status (SET or RESET).
* @param Timeout: Timeout duration.
* @retval HAL status
*/
static HAL_StatusTypeDef HASH_WaitOnFlagUntilTimeout(HASH_HandleTypeDef *hhash, uint32_t Flag, FlagStatus Status, uint32_t Timeout)
{
uint32_t tickstart = HAL_GetTick();
/* Wait until flag is set */
if(Status == RESET)
{
while(__HAL_HASH_GET_FLAG(Flag) == RESET)
{
/* Check for the Timeout */
if(Timeout != HAL_MAX_DELAY)
{
if((Timeout == 0) || ((HAL_GetTick()-tickstart) > Timeout))
{
/* Set State to Ready to be able to restart later on */
hhash->State = HAL_HASH_STATE_READY;
/* Store time out issue in handle status */
hhash->Status = HAL_TIMEOUT;
/* Process Unlocked */
__HAL_UNLOCK(hhash);
return HAL_TIMEOUT;
}
}
}
}
else
{
while(__HAL_HASH_GET_FLAG(Flag) != RESET)
{
/* Check for the Timeout */
if(Timeout != HAL_MAX_DELAY)
{
if((Timeout == 0) || ((HAL_GetTick()-tickstart) > Timeout))
{
/* Set State to Ready to be able to restart later on */
hhash->State = HAL_HASH_STATE_READY;
/* Store time out issue in handle status */
hhash->Status = HAL_TIMEOUT;
/* Process Unlocked */
__HAL_UNLOCK(hhash);
return HAL_TIMEOUT;
}
}
}
}
return HAL_OK;
}
/**
* @brief HASH processing in interruption mode.
* @param hhash: HASH handle.
* @note HASH_IT() regularly reads hhash->SuspendRequest to check whether
* or not the HASH processing must be suspended. If this is the case, the
* processing is suspended when possible and the IP feeding point reached at
* suspension time is stored in the handle for resumption later on.
* @retval HAL status
*/
static HAL_StatusTypeDef HASH_IT(HASH_HandleTypeDef *hhash)
{
if (hhash->State == HAL_HASH_STATE_BUSY)
{
/* ITCounter must not be equal to 0 at this point. Report an error if this is the case. */
if(hhash->HashITCounter == 0)
{
/* Disable Interrupts */
__HAL_HASH_DISABLE_IT(HASH_IT_DINI|HASH_IT_DCI);
/* HASH state set back to Ready to prevent any issue in user code
present in HAL_HASH_ErrorCallback() */
hhash->State = HAL_HASH_STATE_READY;
return HAL_ERROR;
}
else if (hhash->HashITCounter == 1)
{
/* This is the first call to HASH_IT, the first input data are about to be
entered in the IP. A specific processing is carried out at this point to
start-up the processing. */
hhash->HashITCounter = 2;
}
else
{
/* Cruise speed reached, HashITCounter remains equal to 3 until the end of
the HASH processing or the end of the current step for HMAC processing. */
hhash->HashITCounter = 3;
}
/* If digest is ready */
if (__HAL_HASH_GET_FLAG(HASH_FLAG_DCIS))
{
/* Read the digest */
HASH_GetDigest(hhash->pHashOutBuffPtr, HASH_DIGEST_LENGTH());
/* Disable Interrupts */
__HAL_HASH_DISABLE_IT(HASH_IT_DINI|HASH_IT_DCI);
/* Change the HASH state */
hhash->State = HAL_HASH_STATE_READY;
/* Call digest computation complete call back */
#if (USE_HAL_HASH_REGISTER_CALLBACKS == 1)
hhash->DgstCpltCallback(hhash);
#else
HAL_HASH_DgstCpltCallback(hhash);
#endif /* USE_HAL_HASH_REGISTER_CALLBACKS */
return HAL_OK;
}
/* If IP ready to accept new data */
if (__HAL_HASH_GET_FLAG(HASH_FLAG_DINIS))
{
/* If the suspension flag has been raised and if the processing is not about
to end, suspend processing */
if ((hhash->SuspendRequest == HAL_HASH_SUSPEND) && (hhash->HashInCount != 0))
{
/* Disable Interrupts */
__HAL_HASH_DISABLE_IT(HASH_IT_DINI|HASH_IT_DCI);
/* Reset SuspendRequest */
hhash->SuspendRequest = HAL_HASH_SUSPEND_NONE;
/* Change the HASH state */
hhash->State = HAL_HASH_STATE_SUSPENDED;
return HAL_OK;
}
/* Enter input data in the IP thru HASH_Write_Block_Data() call and
check whether the digest calculation has been triggered */
if (HASH_Write_Block_Data(hhash) == HASH_DIGEST_CALCULATION_STARTED)
{
/* Call Input data transfer complete call back
(called at the end of each step for HMAC) */
#if (USE_HAL_HASH_REGISTER_CALLBACKS == 1)
hhash->InCpltCallback(hhash);
#else
HAL_HASH_InCpltCallback(hhash);
#endif /* USE_HAL_HASH_REGISTER_CALLBACKS */
if (hhash->Phase == HAL_HASH_PHASE_HMAC_STEP_1)
{
/* Wait until IP is not busy anymore */
if (HASH_WaitOnFlagUntilTimeout(hhash, HASH_FLAG_BUSY, SET, HASH_TIMEOUTVALUE) != HAL_OK)
{
/* Disable Interrupts */
__HAL_HASH_DISABLE_IT(HASH_IT_DINI|HASH_IT_DCI);
return HAL_TIMEOUT;
}
/* Initialization start for HMAC STEP 2 */
hhash->Phase = HAL_HASH_PHASE_HMAC_STEP_2; /* Move phase from Step 1 to Step 2 */
__HAL_HASH_SET_NBVALIDBITS(hhash->HashBuffSize); /* Set NBLW for the input message */
hhash->HashInCount = hhash->HashBuffSize; /* Set the input data size (in bytes) */
hhash->pHashInBuffPtr = hhash->pHashMsgBuffPtr; /* Set the input data address */
hhash->HashITCounter = 1; /* Set ITCounter to 1 to indicate the start of a new phase */
__HAL_HASH_ENABLE_IT(HASH_IT_DINI); /* Enable IT (was disabled in HASH_Write_Block_Data) */
}
else if (hhash->Phase == HAL_HASH_PHASE_HMAC_STEP_2)
{
/* Wait until IP is not busy anymore */
if (HASH_WaitOnFlagUntilTimeout(hhash, HASH_FLAG_BUSY, SET, HASH_TIMEOUTVALUE) != HAL_OK)
{
/* Disable Interrupts */
__HAL_HASH_DISABLE_IT(HASH_IT_DINI|HASH_IT_DCI);
return HAL_TIMEOUT;
}
/* Initialization start for HMAC STEP 3 */
hhash->Phase = HAL_HASH_PHASE_HMAC_STEP_3; /* Move phase from Step 2 to Step 3 */
__HAL_HASH_SET_NBVALIDBITS(hhash->Init.KeySize); /* Set NBLW for the key */
hhash->HashInCount = hhash->Init.KeySize; /* Set the key size (in bytes) */
hhash->pHashInBuffPtr = hhash->Init.pKey; /* Set the key address */
hhash->HashITCounter = 1; /* Set ITCounter to 1 to indicate the start of a new phase */
__HAL_HASH_ENABLE_IT(HASH_IT_DINI); /* Enable IT (was disabled in HASH_Write_Block_Data) */
}
} /* if (HASH_Write_Block_Data(hhash) == HASH_DIGEST_CALCULATION_STARTED) */
} /* if (__HAL_HASH_GET_FLAG(HASH_FLAG_DINIS))*/
/* Return function status */
return HAL_OK;
}
else
{
return HAL_BUSY;
}
}
/**
* @brief Write a block of data in HASH IP in interruption mode.
* @param hhash: HASH handle.
* @note HASH_Write_Block_Data() is called under interruption by HASH_IT().
* @retval HAL status
*/
static uint32_t HASH_Write_Block_Data(HASH_HandleTypeDef *hhash)
{
uint32_t inputaddr;
uint32_t buffercounter;
uint32_t inputcounter;
uint32_t ret = HASH_DIGEST_CALCULATION_NOT_STARTED;
/* If there are more than 64 bytes remaining to be entered */
if(hhash->HashInCount > 64)
{
inputaddr = (uint32_t)hhash->pHashInBuffPtr;
/* Write the Input block in the Data IN register
(16 32-bit words, or 64 bytes are entered) */
for(buffercounter = 0; buffercounter < 64; buffercounter+=4)
{
HASH->DIN = *(uint32_t*)inputaddr;
inputaddr+=4;
}
/* If this is the start of input data entering, an additional word
must be entered to start up the HASH processing */
if(hhash->HashITCounter == 2)
{
HASH->DIN = *(uint32_t*)inputaddr;
inputaddr+=4;
if(hhash->HashInCount >= 68)
{
/* There are still data waiting to be entered in the IP.
Decrement buffer counter and set pointer to the proper
memory location for the next data entering round. */
hhash->HashInCount -= 68;
hhash->pHashInBuffPtr+= 68;
}
else
{
/* All the input buffer has been fed to the HW. */
hhash->HashInCount = 0;
}
}
else
{
/* 64 bytes have been entered and there are still some remaining:
Decrement buffer counter and set pointer to the proper
memory location for the next data entering round.*/
hhash->HashInCount -= 64;
hhash->pHashInBuffPtr+= 64;
}
}
else
{
/* 64 or less bytes remain to be entered. This is the last
data entering round. */
/* Get the buffer address */
inputaddr = (uint32_t)hhash->pHashInBuffPtr;
/* Get the buffer counter */
inputcounter = hhash->HashInCount;
/* Disable Interrupts */
__HAL_HASH_DISABLE_IT(HASH_IT_DINI);
/* Write the Input block in the Data IN register */
for(buffercounter = 0; buffercounter < (inputcounter+3)/4; buffercounter++)
{
HASH->DIN = *(uint32_t*)inputaddr;
inputaddr+=4;
}
/* Start the Digest calculation */
__HAL_HASH_START_DIGEST();
/* Return indication that digest calculation has started:
this return value triggers the call to Input data transfer
complete call back as well as the proper transition from
one step to another in HMAC mode. */
ret = HASH_DIGEST_CALCULATION_STARTED;
/* Reset buffer counter */
hhash->HashInCount = 0;
}
/* Return whether or digest calculation has started */
return ret;
}
/**
* @brief HMAC processing in polling mode.
* @param hhash: HASH handle.
* @param Timeout: Timeout value.
* @retval HAL status
*/
static HAL_StatusTypeDef HMAC_Processing(HASH_HandleTypeDef *hhash, uint32_t Timeout)
{
/* Ensure first that Phase is correct */
if ((hhash->Phase != HAL_HASH_PHASE_HMAC_STEP_1) && (hhash->Phase != HAL_HASH_PHASE_HMAC_STEP_2) && (hhash->Phase != HAL_HASH_PHASE_HMAC_STEP_3))
{
/* Change the HASH state */
hhash->State = HAL_HASH_STATE_READY;
/* Process Unlock */
__HAL_UNLOCK(hhash);
/* Return function status */
return HAL_ERROR;
}
/* HMAC Step 1 processing */
if (hhash->Phase == HAL_HASH_PHASE_HMAC_STEP_1)
{
/************************** STEP 1 ******************************************/
/* Configure the Number of valid bits in last word of the message */
__HAL_HASH_SET_NBVALIDBITS(hhash->Init.KeySize);
/* Write input buffer in Data register */
if ((hhash->Status = HASH_WriteData(hhash, hhash->pHashKeyBuffPtr, hhash->HashKeyCount)) != HAL_OK)
{
return hhash->Status;
}
/* Check whether or not key entering process has been suspended */
if (hhash->State == HAL_HASH_STATE_SUSPENDED)
{
/* Process Unlocked */
__HAL_UNLOCK(hhash);
/* Stop right there and return function status */
return HAL_OK;
}
/* No processing suspension at this point: set DCAL bit. */
__HAL_HASH_START_DIGEST();
/* Wait for BUSY flag to be cleared */
if (HASH_WaitOnFlagUntilTimeout(hhash, HASH_FLAG_BUSY, SET, Timeout) != HAL_OK)
{
return HAL_TIMEOUT;
}
/* Move from Step 1 to Step 2 */
hhash->Phase = HAL_HASH_PHASE_HMAC_STEP_2;
}
/* HMAC Step 2 processing.
After phase check, HMAC_Processing() may
- directly start up from this point in resumption case
if the same Step 2 processing was suspended previously
- or fall through from the Step 1 processing carried out hereabove */
if (hhash->Phase == HAL_HASH_PHASE_HMAC_STEP_2)
{
/************************** STEP 2 ******************************************/
/* Configure the Number of valid bits in last word of the message */
__HAL_HASH_SET_NBVALIDBITS(hhash->HashBuffSize);
/* Write input buffer in Data register */
if ((hhash->Status = HASH_WriteData(hhash, hhash->pHashInBuffPtr, hhash->HashInCount)) != HAL_OK)
{
return hhash->Status;
}
/* Check whether or not data entering process has been suspended */
if (hhash->State == HAL_HASH_STATE_SUSPENDED)
{
/* Process Unlocked */
__HAL_UNLOCK(hhash);
/* Stop right there and return function status */
return HAL_OK;
}
/* No processing suspension at this point: set DCAL bit. */
__HAL_HASH_START_DIGEST();
/* Wait for BUSY flag to be cleared */
if (HASH_WaitOnFlagUntilTimeout(hhash, HASH_FLAG_BUSY, SET, Timeout) != HAL_OK)
{
return HAL_TIMEOUT;
}
/* Move from Step 2 to Step 3 */
hhash->Phase = HAL_HASH_PHASE_HMAC_STEP_3;
/* In case Step 1 phase was suspended then resumed,
set again Key input buffers and size before moving to
next step */
hhash->pHashKeyBuffPtr = hhash->Init.pKey;
hhash->HashKeyCount = hhash->Init.KeySize;
}
/* HMAC Step 3 processing.
After phase check, HMAC_Processing() may
- directly start up from this point in resumption case
if the same Step 3 processing was suspended previously
- or fall through from the Step 2 processing carried out hereabove */
if (hhash->Phase == HAL_HASH_PHASE_HMAC_STEP_3)
{
/************************** STEP 3 ******************************************/
/* Configure the Number of valid bits in last word of the message */
__HAL_HASH_SET_NBVALIDBITS(hhash->Init.KeySize);
/* Write input buffer in Data register */
if ((hhash->Status = HASH_WriteData(hhash, hhash->pHashKeyBuffPtr, hhash->HashKeyCount)) != HAL_OK)
{
return hhash->Status;
}
/* Check whether or not key entering process has been suspended */
if (hhash->State == HAL_HASH_STATE_SUSPENDED)
{
/* Process Unlocked */
__HAL_UNLOCK(hhash);
/* Stop right there and return function status */
return HAL_OK;
}
/* No processing suspension at this point: start the Digest calculation. */
__HAL_HASH_START_DIGEST();
/* Wait for DCIS flag to be set */
if (HASH_WaitOnFlagUntilTimeout(hhash, HASH_FLAG_DCIS, RESET, Timeout) != HAL_OK)
{
return HAL_TIMEOUT;
}
/* Read the message digest */
HASH_GetDigest(hhash->pHashOutBuffPtr, HASH_DIGEST_LENGTH());
}
/* Change the HASH state */
hhash->State = HAL_HASH_STATE_READY;
/* Process Unlock */
__HAL_UNLOCK(hhash);
/* Return function status */
return HAL_OK;
}
/**
* @brief Initialize the HASH peripheral, next process pInBuffer then
* read the computed digest.
* @note Digest is available in pOutBuffer.
* @param hhash: HASH handle.
* @param pInBuffer: pointer to the input buffer (buffer to be hashed).
* @param Size: length of the input buffer in bytes.
* @param pOutBuffer: pointer to the computed digest.
* @param Timeout: Timeout value.
* @param Algorithm: HASH algorithm.
* @retval HAL status
*/
HAL_StatusTypeDef HASH_Start(HASH_HandleTypeDef *hhash, uint8_t *pInBuffer, uint32_t Size, uint8_t* pOutBuffer, uint32_t Timeout, uint32_t Algorithm)
{
uint8_t *pInBuffer_tmp; /* input data address, input parameter of HASH_WriteData() */
uint32_t Size_tmp = 0x0; /* input data size (in bytes), input parameter of HASH_WriteData() */
/* Initiate HASH processing in case of start or resumption */
if((hhash->State == HAL_HASH_STATE_READY) || (hhash->State == HAL_HASH_STATE_SUSPENDED))
{
/* Check input parameters */
if ((pInBuffer == NULL) || (Size == 0) || (pOutBuffer == NULL))
{
hhash->State = HAL_HASH_STATE_READY;
return HAL_ERROR;
}
/* Process Locked */
__HAL_LOCK(hhash);
/* Check if initialization phase has not been already performed */
if(hhash->Phase == HAL_HASH_PHASE_READY)
{
/* Change the HASH state */
hhash->State = HAL_HASH_STATE_BUSY;
/* Select the HASH algorithm, clear HMAC mode and long key selection bit, reset the HASH processor core */
MODIFY_REG(HASH->CR, HASH_CR_LKEY|HASH_CR_ALGO|HASH_CR_MODE|HASH_CR_INIT, Algorithm | HASH_CR_INIT);
/* Configure the number of valid bits in last word of the message */
__HAL_HASH_SET_NBVALIDBITS(Size);
/* pInBuffer_tmp and Size_tmp are initialized to be used afterwards as
input parameters of HASH_WriteData() */
pInBuffer_tmp = pInBuffer; /* pInBuffer_tmp is set to the input data address */
Size_tmp = Size; /* Size_tmp contains the input data size in bytes */
/* Set the phase */
hhash->Phase = HAL_HASH_PHASE_PROCESS;
}
else if (hhash->Phase == HAL_HASH_PHASE_PROCESS)
{
/* if the IP has already been initialized, two cases are possible */
/* Process resumption time ... */
if (hhash->State == HAL_HASH_STATE_SUSPENDED)
{
/* Since this is resumption, pInBuffer_tmp and Size_tmp are not set
to the API input parameters but to those saved beforehand by HASH_WriteData()
when the processing was suspended */
pInBuffer_tmp = hhash->pHashInBuffPtr;
Size_tmp = hhash->HashInCount;
}
/* ... or multi-buffer HASH processing end */
else
{
/* pInBuffer_tmp and Size_tmp are initialized to be used afterwards as
input parameters of HASH_WriteData() */
pInBuffer_tmp = pInBuffer;
Size_tmp = Size;
/* Configure the number of valid bits in last word of the message */
__HAL_HASH_SET_NBVALIDBITS(Size);
}
/* Change the HASH state */
hhash->State = HAL_HASH_STATE_BUSY;
}
else
{
/* Phase error */
hhash->State = HAL_HASH_STATE_READY;
/* Process Unlocked */
__HAL_UNLOCK(hhash);
/* Return function status */
return HAL_ERROR;
}
/* Write input buffer in Data register */
if ((hhash->Status = HASH_WriteData(hhash, pInBuffer_tmp, Size_tmp)) != HAL_OK)
{
return hhash->Status;
}
/* If the process has not been suspended, carry on to digest calculation */
if (hhash->State != HAL_HASH_STATE_SUSPENDED)
{
/* Start the Digest calculation */
__HAL_HASH_START_DIGEST();
/* Wait for DCIS flag to be set */
if (HASH_WaitOnFlagUntilTimeout(hhash, HASH_FLAG_DCIS, RESET, Timeout) != HAL_OK)
{
return HAL_TIMEOUT;
}
/* Read the message digest */
HASH_GetDigest(pOutBuffer, HASH_DIGEST_LENGTH());
/* Change the HASH state */
hhash->State = HAL_HASH_STATE_READY;
}
/* Process Unlocked */
__HAL_UNLOCK(hhash);
/* Return function status */
return HAL_OK;
}
else
{
return HAL_BUSY;
}
}
/**
* @brief If not already done, initialize the HASH peripheral then
* processes pInBuffer.
* @note Field hhash->Phase of HASH handle is tested to check whether or not
* the IP has already been initialized.
* @note The input buffer size (in bytes) must be a multiple of 4 otherwise, the
* HASH digest computation is corrupted.
* @param hhash: HASH handle.
* @param pInBuffer: pointer to the input buffer (buffer to be hashed).
* @param Size: length of the input buffer in bytes, must be a multiple of 4.
* @param Algorithm: HASH algorithm.
* @retval HAL status
*/
HAL_StatusTypeDef HASH_Accumulate(HASH_HandleTypeDef *hhash, uint8_t *pInBuffer, uint32_t Size, uint32_t Algorithm)
{
uint8_t *pInBuffer_tmp; /* input data address, input parameter of HASH_WriteData() */
uint32_t Size_tmp = 0x0; /* input data size (in bytes), input parameter of HASH_WriteData() */
/* Make sure the input buffer size (in bytes) is a multiple of 4 */
assert_param(IS_HASH_POLLING_MULTIBUFFER_SIZE(Size));
/* Initiate HASH processing in case of start or resumption */
if((hhash->State == HAL_HASH_STATE_READY) || (hhash->State == HAL_HASH_STATE_SUSPENDED))
{
/* Check input parameters */
if ((pInBuffer == NULL) || (Size == 0))
{
hhash->State = HAL_HASH_STATE_READY;
return HAL_ERROR;
}
/* Process Locked */
__HAL_LOCK(hhash);
/* If resuming the HASH processing */
if (hhash->State == HAL_HASH_STATE_SUSPENDED)
{
/* Change the HASH state */
hhash->State = HAL_HASH_STATE_BUSY;
/* Since this is resumption, pInBuffer_tmp and Size_tmp are not set
to the API input parameters but to those saved beforehand by HASH_WriteData()
when the processing was suspended */
pInBuffer_tmp = hhash->pHashInBuffPtr; /* pInBuffer_tmp is set to the input data address */
Size_tmp = hhash->HashInCount; /* Size_tmp contains the input data size in bytes */
}
else
{
/* Change the HASH state */
hhash->State = HAL_HASH_STATE_BUSY;
/* pInBuffer_tmp and Size_tmp are initialized to be used afterwards as
input parameters of HASH_WriteData() */
pInBuffer_tmp = pInBuffer; /* pInBuffer_tmp is set to the input data address */
Size_tmp = Size; /* Size_tmp contains the input data size in bytes */
/* Check if initialization phase has already be performed */
if(hhash->Phase == HAL_HASH_PHASE_READY)
{
/* Select the HASH algorithm, clear HMAC mode and long key selection bit, reset the HASH processor core */
MODIFY_REG(HASH->CR, HASH_CR_LKEY|HASH_CR_ALGO|HASH_CR_MODE|HASH_CR_INIT, Algorithm | HASH_CR_INIT);
}
/* Set the phase */
hhash->Phase = HAL_HASH_PHASE_PROCESS;
}
/* Write input buffer in Data register */
if ((hhash->Status = HASH_WriteData(hhash, pInBuffer_tmp, Size_tmp)) != HAL_OK)
{
return hhash->Status;
}
/* If the process has not been suspended, move the state to Ready */
if (hhash->State != HAL_HASH_STATE_SUSPENDED)
{
/* Change the HASH state */
hhash->State = HAL_HASH_STATE_READY;
}
/* Process Unlocked */
__HAL_UNLOCK(hhash);
/* Return function status */
return HAL_OK;
}
else
{
return HAL_BUSY;
}
}
/**
* @brief Initialize the HASH peripheral, next process pInBuffer then
* read the computed digest in interruption mode.
* @note Digest is available in pOutBuffer.
* @param hhash: HASH handle.
* @param pInBuffer: pointer to the input buffer (buffer to be hashed).
* @param Size: length of the input buffer in bytes.
* @param pOutBuffer: pointer to the computed digest.
* @param Algorithm: HASH algorithm.
* @retval HAL status
*/
HAL_StatusTypeDef HASH_Start_IT(HASH_HandleTypeDef *hhash, uint8_t *pInBuffer, uint32_t Size, uint8_t* pOutBuffer, uint32_t Algorithm)
{
/* If State is ready or suspended, start or resume IT-based HASH processing */
if((hhash->State == HAL_HASH_STATE_READY) || (hhash->State == HAL_HASH_STATE_SUSPENDED))
{
/* Check input parameters */
if ((pInBuffer == NULL) || (Size == 0) || (pOutBuffer == NULL))
{
hhash->State = HAL_HASH_STATE_READY;
return HAL_ERROR;
}
/* Process Locked */
__HAL_LOCK(hhash);
/* Change the HASH state */
hhash->State = HAL_HASH_STATE_BUSY;
/* Initialize IT counter */
hhash->HashITCounter = 1;
/* Check if initialization phase has already be performed */
if(hhash->Phase == HAL_HASH_PHASE_READY)
{
/* Select the HASH algorithm, clear HMAC mode and long key selection bit, reset the HASH processor core */
MODIFY_REG(HASH->CR, HASH_CR_LKEY|HASH_CR_ALGO|HASH_CR_MODE|HASH_CR_INIT, Algorithm | HASH_CR_INIT);
/* Configure the number of valid bits in last word of the message */
__HAL_HASH_SET_NBVALIDBITS(Size);
hhash->HashInCount = Size; /* Counter used to keep track of number of data
to be fed to the IP */
hhash->pHashInBuffPtr = pInBuffer; /* Points at data which will be fed to the IP at
the next interruption */
/* In case of suspension, hhash->HashInCount and hhash->pHashInBuffPtr contain
the information describing where the HASH process is stopped.
These variables are used later on to resume the HASH processing at the
correct location. */
hhash->pHashOutBuffPtr = pOutBuffer; /* Points at the computed digest */
}
/* Set the phase */
hhash->Phase = HAL_HASH_PHASE_PROCESS;
/* Process Unlock */
__HAL_UNLOCK(hhash);
/* Enable Interrupts */
__HAL_HASH_ENABLE_IT(HASH_IT_DINI|HASH_IT_DCI);
/* Return function status */
return HAL_OK;
}
else
{
return HAL_BUSY;
}
}
/**
* @brief Initialize the HASH peripheral then initiate a DMA transfer
* to feed the input buffer to the IP.
* @note If MDMAT bit is set before calling this function (multi-buffer
* HASH processing case), the input buffer size (in bytes) must be
* a multiple of 4 otherwise, the HASH digest computation is corrupted.
* For the processing of the last buffer of the thread, MDMAT bit must
* be reset and the buffer length (in bytes) doesn't have to be a
* multiple of 4.
* @param hhash: HASH handle.
* @param pInBuffer: pointer to the input buffer (buffer to be hashed).
* @param Size: length of the input buffer in bytes.
* @param Algorithm: HASH algorithm.
* @retval HAL status
*/
HAL_StatusTypeDef HASH_Start_DMA(HASH_HandleTypeDef *hhash, uint8_t *pInBuffer, uint32_t Size, uint32_t Algorithm)
{
uint32_t inputaddr;
uint32_t inputSize = 0x0;
/* Make sure the input buffer size (in bytes) is a multiple of 4 when MDMAT bit is set
(case of multi-buffer HASH processing) */
assert_param(IS_HASH_DMA_MULTIBUFFER_SIZE(Size));
/* If State is ready or suspended, start or resume DMA-based HASH processing */
if ((hhash->State == HAL_HASH_STATE_READY) || (hhash->State == HAL_HASH_STATE_SUSPENDED))
{
/* Check input parameters */
if ( (pInBuffer == NULL ) || (Size == 0) ||
/* Check phase coherency. Phase must be
either READY (fresh start)
or PROCESS (multi-buffer HASH management) */
((hhash->Phase != HAL_HASH_PHASE_READY) && (!(IS_HASH_PROCESSING(hhash)))))
{
hhash->State = HAL_HASH_STATE_READY;
return HAL_ERROR;
}
/* Process Locked */
__HAL_LOCK(hhash);
/* If not a resumption case */
if (hhash->State == HAL_HASH_STATE_READY)
{
/* Change the HASH state */
hhash->State = HAL_HASH_STATE_BUSY;
/* Check if initialization phase has already been performed.
If Phase is already set to HAL_HASH_PHASE_PROCESS, this means the
API is processing a new input data message in case of multi-buffer HASH
computation. */
if(hhash->Phase == HAL_HASH_PHASE_READY)
{
/* Select the HASH algorithm, clear HMAC mode and long key selection bit, reset the HASH processor core */
MODIFY_REG(HASH->CR, HASH_CR_LKEY|HASH_CR_ALGO|HASH_CR_MODE|HASH_CR_INIT, Algorithm | HASH_CR_INIT);
/* Set the phase */
hhash->Phase = HAL_HASH_PHASE_PROCESS;
}
/* Configure the Number of valid bits in last word of the message */
__HAL_HASH_SET_NBVALIDBITS(Size);
inputaddr = (uint32_t)pInBuffer; /* DMA transfer start address */
inputSize = Size; /* DMA transfer size (in bytes) */
/* In case of suspension request, save the starting parameters */
hhash->pHashInBuffPtr = pInBuffer; /* DMA transfer start address */
hhash->HashInCount = Size; /* DMA transfer size (in bytes) */
}
/* If resumption case */
else
{
/* Change the HASH state */
hhash->State = HAL_HASH_STATE_BUSY;
/* Resumption case, inputaddr and inputSize are not set to the API input parameters
but to those saved beforehand by HAL_HASH_DMAFeed_ProcessSuspend() when the
processing was suspended */
inputaddr = (uint32_t)hhash->pHashInBuffPtr; /* DMA transfer start address */
inputSize = hhash->HashInCount; /* DMA transfer size (in bytes) */
}
/* Set the HASH DMA transfert complete callback */
hhash->hdmain->XferCpltCallback = HASH_DMAXferCplt;
/* Set the DMA error callback */
hhash->hdmain->XferErrorCallback = HASH_DMAError;
/* Store number of words already pushed to manage proper DMA processing suspension */
hhash->NbWordsAlreadyPushed = HASH_NBW_PUSHED();
/* Enable the DMA In DMA Stream */
HAL_DMA_Start_IT(hhash->hdmain, inputaddr, (uint32_t)&HASH->DIN, (inputSize%4 ? (inputSize+3)/4:inputSize/4));
/* Enable DMA requests */
SET_BIT(HASH->CR, HASH_CR_DMAE);
/* Process Unlock */
__HAL_UNLOCK(hhash);
/* Return function status */
return HAL_OK;
}
else
{
return HAL_BUSY;
}
}
/**
* @brief Return the computed digest.
* @note The API waits for DCIS to be set then reads the computed digest.
* @param hhash: HASH handle.
* @param pOutBuffer: pointer to the computed digest.
* @param Timeout: Timeout value.
* @retval HAL status
*/
HAL_StatusTypeDef HASH_Finish(HASH_HandleTypeDef *hhash, uint8_t* pOutBuffer, uint32_t Timeout)
{
if(hhash->State == HAL_HASH_STATE_READY)
{
/* Check parameter */
if (pOutBuffer == NULL)
{
return HAL_ERROR;
}
/* Process Locked */
__HAL_LOCK(hhash);
/* Change the HASH state to busy */
hhash->State = HAL_HASH_STATE_BUSY;
/* Wait for DCIS flag to be set */
if (HASH_WaitOnFlagUntilTimeout(hhash, HASH_FLAG_DCIS, RESET, Timeout) != HAL_OK)
{
return HAL_TIMEOUT;
}
/* Read the message digest */
HASH_GetDigest(pOutBuffer, HASH_DIGEST_LENGTH());
/* Change the HASH state to ready */
hhash->State = HAL_HASH_STATE_READY;
/* Process UnLock */
__HAL_UNLOCK(hhash);
/* Return function status */
return HAL_OK;
}
else
{
return HAL_BUSY;
}
}
/**
* @brief Initialize the HASH peripheral in HMAC mode, next process pInBuffer then
* read the computed digest.
* @note Digest is available in pOutBuffer.
* @note Same key is used for the inner and the outer hash functions; pointer to key and
* key size are respectively stored in hhash->Init.pKey and hhash->Init.KeySize.
* @param hhash: HASH handle.
* @param pInBuffer: pointer to the input buffer (buffer to be hashed).
* @param Size: length of the input buffer in bytes.
* @param pOutBuffer: pointer to the computed digest.
* @param Timeout: Timeout value.
* @param Algorithm: HASH algorithm.
* @retval HAL status
*/
HAL_StatusTypeDef HMAC_Start(HASH_HandleTypeDef *hhash, uint8_t *pInBuffer, uint32_t Size, uint8_t* pOutBuffer, uint32_t Timeout, uint32_t Algorithm)
{
/* If State is ready or suspended, start or resume polling-based HASH processing */
if((hhash->State == HAL_HASH_STATE_READY) || (hhash->State == HAL_HASH_STATE_SUSPENDED))
{
/* Check input parameters */
if ((pInBuffer == NULL) || (Size == 0) || (hhash->Init.pKey == NULL) || (hhash->Init.KeySize == 0) || (pOutBuffer == NULL))
{
hhash->State = HAL_HASH_STATE_READY;
return HAL_ERROR;
}
/* Process Locked */
__HAL_LOCK(hhash);
/* Change the HASH state */
hhash->State = HAL_HASH_STATE_BUSY;
/* Check if initialization phase has already be performed */
if(hhash->Phase == HAL_HASH_PHASE_READY)
{
/* Check if key size is larger than 64 bytes, accordingly set LKEY and the other setting bits */
if(hhash->Init.KeySize > 64)
{
MODIFY_REG(HASH->CR, HASH_CR_LKEY|HASH_CR_ALGO|HASH_CR_MODE|HASH_CR_INIT, Algorithm | HASH_ALGOMODE_HMAC | HASH_HMAC_KEYTYPE_LONGKEY | HASH_CR_INIT);
}
else
{
MODIFY_REG(HASH->CR, HASH_CR_LKEY|HASH_CR_ALGO|HASH_CR_MODE|HASH_CR_INIT, Algorithm | HASH_ALGOMODE_HMAC | HASH_CR_INIT);
}
/* Set the phase to Step 1 */
hhash->Phase = HAL_HASH_PHASE_HMAC_STEP_1;
/* Resort to hhash internal fields to feed the IP.
Parameters will be updated in case of suspension to contain the proper
information at resumption time. */
hhash->pHashOutBuffPtr = pOutBuffer; /* Output digest address */
hhash->pHashInBuffPtr = pInBuffer; /* Input data address, HMAC_Processing input parameter for Step 2 */
hhash->HashInCount = Size; /* Input data size, HMAC_Processing input parameter for Step 2 */
hhash->HashBuffSize = Size; /* Store the input buffer size for the whole HMAC process */
hhash->pHashKeyBuffPtr = hhash->Init.pKey; /* Key address, HMAC_Processing input parameter for Step 1 and Step 3 */
hhash->HashKeyCount = hhash->Init.KeySize; /* Key size, HMAC_Processing input parameter for Step 1 and Step 3 */
}
/* Carry out HMAC processing */
return HMAC_Processing(hhash, Timeout);
}
else
{
return HAL_BUSY;
}
}
/**
* @brief Initialize the HASH peripheral in HMAC mode, next process pInBuffer then
* read the computed digest in interruption mode.
* @note Digest is available in pOutBuffer.
* @note Same key is used for the inner and the outer hash functions; pointer to key and
* key size are respectively stored in hhash->Init.pKey and hhash->Init.KeySize.
* @param hhash: HASH handle.
* @param pInBuffer: pointer to the input buffer (buffer to be hashed).
* @param Size: length of the input buffer in bytes.
* @param pOutBuffer: pointer to the computed digest.
* @param Algorithm: HASH algorithm.
* @retval HAL status
*/
HAL_StatusTypeDef HMAC_Start_IT(HASH_HandleTypeDef *hhash, uint8_t *pInBuffer, uint32_t Size, uint8_t* pOutBuffer, uint32_t Algorithm)
{
/* If State is ready or suspended, start or resume IT-based HASH processing */
if((hhash->State == HAL_HASH_STATE_READY) || (hhash->State == HAL_HASH_STATE_SUSPENDED))
{
/* Check input parameters */
if ((pInBuffer == NULL) || (Size == 0) || (hhash->Init.pKey == NULL) || (hhash->Init.KeySize == 0) || (pOutBuffer == NULL))
{
hhash->State = HAL_HASH_STATE_READY;
return HAL_ERROR;
}
/* Process Locked */
__HAL_LOCK(hhash);
/* Change the HASH state */
hhash->State = HAL_HASH_STATE_BUSY;
/* Initialize IT counter */
hhash->HashITCounter = 1;
/* Check if initialization phase has already be performed */
if (hhash->Phase == HAL_HASH_PHASE_READY)
{
/* Check if key size is larger than 64 bytes, accordingly set LKEY and the other setting bits */
if(hhash->Init.KeySize > 64)
{
MODIFY_REG(HASH->CR, HASH_CR_LKEY|HASH_CR_ALGO|HASH_CR_MODE|HASH_CR_INIT, Algorithm | HASH_ALGOMODE_HMAC | HASH_HMAC_KEYTYPE_LONGKEY | HASH_CR_INIT);
}
else
{
MODIFY_REG(HASH->CR, HASH_CR_LKEY|HASH_CR_ALGO|HASH_CR_MODE|HASH_CR_INIT, Algorithm | HASH_ALGOMODE_HMAC | HASH_CR_INIT);
}
/* Resort to hhash internal fields hhash->pHashInBuffPtr and hhash->HashInCount
to feed the IP whatever the HMAC step.
Lines below are set to start HMAC Step 1 processing where key is entered first. */
hhash->HashInCount = hhash->Init.KeySize; /* Key size */
hhash->pHashInBuffPtr = hhash->Init.pKey ; /* Key address */
/* Store input and output parameters in handle fields to manage steps transition
or possible HMAC suspension/resumption */
hhash->pHashKeyBuffPtr = hhash->Init.pKey; /* Key address */
hhash->pHashMsgBuffPtr = pInBuffer; /* Input message address */
hhash->HashBuffSize = Size; /* Input message size (in bytes) */
hhash->pHashOutBuffPtr = pOutBuffer; /* Output digest address */
/* Configure the number of valid bits in last word of the key */
__HAL_HASH_SET_NBVALIDBITS(hhash->Init.KeySize);
/* Set the phase to Step 1 */
hhash->Phase = HAL_HASH_PHASE_HMAC_STEP_1;
}
else if ((hhash->Phase == HAL_HASH_PHASE_HMAC_STEP_1) || (hhash->Phase == HAL_HASH_PHASE_HMAC_STEP_3))
{
/* Restart IT-based HASH processing after Step 1 or Step 3 suspension */
}
else if (hhash->Phase == HAL_HASH_PHASE_HMAC_STEP_2)
{
/* Restart IT-based HASH processing after Step 2 suspension */
}
else
{
/* Error report as phase incorrect */
/* Process Unlock */
__HAL_UNLOCK(hhash);
hhash->State = HAL_HASH_STATE_READY;
return HAL_ERROR;
}
/* Process Unlock */
__HAL_UNLOCK(hhash);
/* Enable Interrupts */
__HAL_HASH_ENABLE_IT(HASH_IT_DINI|HASH_IT_DCI);
/* Return function status */
return HAL_OK;
}
else
{
return HAL_BUSY;
}
}
/**
* @brief Initialize the HASH peripheral in HMAC mode then initiate the required
* DMA transfers to feed the key and the input buffer to the IP.
* @note Same key is used for the inner and the outer hash functions; pointer to key and
* key size are respectively stored in hhash->Init.pKey and hhash->Init.KeySize.
* @note In case of multi-buffer HMAC processing, the input buffer size (in bytes) must
* be a multiple of 4 otherwise, the HASH digest computation is corrupted.
* Only the length of the last buffer of the thread doesn't have to be a
* multiple of 4.
* @param hhash: HASH handle.
* @param pInBuffer: pointer to the input buffer (buffer to be hashed).
* @param Size: length of the input buffer in bytes.
* @param Algorithm: HASH algorithm.
* @retval HAL status
*/
HAL_StatusTypeDef HMAC_Start_DMA(HASH_HandleTypeDef *hhash, uint8_t *pInBuffer, uint32_t Size, uint32_t Algorithm)
{
uint32_t inputaddr;
uint32_t inputSize = 0x0;
/* Make sure the input buffer size (in bytes) is a multiple of 4 when digest calculation
is disabled (multi-buffer HMAC processing, MDMAT bit to be set) */
assert_param(IS_HMAC_DMA_MULTIBUFFER_SIZE(hhash, Size));
/* If State is ready or suspended, start or resume DMA-based HASH processing */
if ((hhash->State == HAL_HASH_STATE_READY) || (hhash->State == HAL_HASH_STATE_SUSPENDED))
{
/* Check input parameters */
if ((pInBuffer == NULL ) || (Size == 0) || (hhash->Init.pKey == NULL ) || (hhash->Init.KeySize == 0) ||
/* Check phase coherency. Phase must be
either READY (fresh start)
or one of HMAC PROCESS steps (multi-buffer HASH management) */
((hhash->Phase != HAL_HASH_PHASE_READY) && (!(IS_HMAC_PROCESSING(hhash)))))
{
hhash->State = HAL_HASH_STATE_READY;
return HAL_ERROR;
}
/* Process Locked */
__HAL_LOCK(hhash);
/* If not a case of resumption after suspension */
if (hhash->State == HAL_HASH_STATE_READY)
{
/* Check whether or not initialization phase has already be performed */
if(hhash->Phase == HAL_HASH_PHASE_READY)
{
/* Change the HASH state */
hhash->State = HAL_HASH_STATE_BUSY;
/* Check if key size is larger than 64 bytes, accordingly set LKEY and the other setting bits.
At the same time, ensure MDMAT bit is cleared. */
if(hhash->Init.KeySize > 64)
{
MODIFY_REG(HASH->CR, HASH_CR_MDMAT|HASH_CR_LKEY|HASH_CR_ALGO|HASH_CR_MODE|HASH_CR_INIT, Algorithm | HASH_ALGOMODE_HMAC | HASH_HMAC_KEYTYPE_LONGKEY | HASH_CR_INIT);
}
else
{
MODIFY_REG(HASH->CR, HASH_CR_MDMAT|HASH_CR_LKEY|HASH_CR_ALGO|HASH_CR_MODE|HASH_CR_INIT, Algorithm | HASH_ALGOMODE_HMAC | HASH_CR_INIT);
}
/* Store input aparameters in handle fields to manage steps transition
or possible HMAC suspension/resumption */
hhash->HashInCount = hhash->Init.KeySize; /* Initial size for first DMA transfer (key size) */
hhash->pHashKeyBuffPtr = hhash->Init.pKey; /* Key address */
hhash->pHashInBuffPtr = hhash->Init.pKey ; /* First address passed to DMA (key address at Step 1) */
hhash->pHashMsgBuffPtr = pInBuffer; /* Input data address */
hhash->HashBuffSize = Size; /* input data size (in bytes) */
/* Set DMA input parameters */
inputaddr = (uint32_t)(hhash->Init.pKey); /* Address passed to DMA (start by entering Key message) */
inputSize = hhash->Init.KeySize; /* Size for first DMA transfer (in bytes) */
/* Configure the number of valid bits in last word of the key */
__HAL_HASH_SET_NBVALIDBITS(hhash->Init.KeySize);
/* Set the phase to Step 1 */
hhash->Phase = HAL_HASH_PHASE_HMAC_STEP_1;
}
else if (hhash->Phase == HAL_HASH_PHASE_HMAC_STEP_2)
{
/* Process a new input data message in case of multi-buffer HMAC processing
(this is not a resumption case) */
/* Change the HASH state */
hhash->State = HAL_HASH_STATE_BUSY;
/* Save input parameters to be able to manage possible suspension/resumption */
hhash->HashInCount = Size; /* Input message address */
hhash->pHashInBuffPtr = pInBuffer; /* Input message size in bytes */
/* Set DMA input parameters */
inputaddr = (uint32_t)pInBuffer; /* Input message address */
inputSize = Size; /* Input message size in bytes */
if (hhash->DigestCalculationDisable == RESET)
{
/* This means this is the last buffer of the multi-buffer sequence: DCAL needs to be set. */
__HAL_HASH_RESET_MDMAT();
__HAL_HASH_SET_NBVALIDBITS(inputSize);
}
}
else
{
/* Phase not aligned with handle READY state */
__HAL_UNLOCK(hhash);
/* Return function status */
return HAL_ERROR;
}
}
else
{
/* Resumption case (phase may be Step 1, 2 or 3) */
/* Change the HASH state */
hhash->State = HAL_HASH_STATE_BUSY;
/* Set DMA input parameters at resumption location;
inputaddr and inputSize are not set to the API input parameters
but to those saved beforehand by HAL_HASH_DMAFeed_ProcessSuspend() when the
processing was suspended. */
inputaddr = (uint32_t)(hhash->pHashInBuffPtr); /* Input message address */
inputSize = hhash->HashInCount; /* Input message size in bytes */
}
/* Set the HASH DMA transfert complete callback */
hhash->hdmain->XferCpltCallback = HASH_DMAXferCplt;
/* Set the DMA error callback */
hhash->hdmain->XferErrorCallback = HASH_DMAError;
/* Store number of words already pushed to manage proper DMA processing suspension */
hhash->NbWordsAlreadyPushed = HASH_NBW_PUSHED();
/* Enable the DMA In DMA Stream */
HAL_DMA_Start_IT(hhash->hdmain, inputaddr, (uint32_t)&HASH->DIN, (inputSize%4 ? (inputSize+3)/4:inputSize/4));
/* Enable DMA requests */
SET_BIT(HASH->CR, HASH_CR_DMAE);
/* Process Unlocked */
__HAL_UNLOCK(hhash);
/* Return function status */
return HAL_OK;
}
else
{
return HAL_BUSY;
}
}
/**
* @}
*/
/**
* @}
*/
/**
* @}
*/
#endif /* defined (STM32L4A6xx) || defined (STM32L4S5xx) || defined (STM32L4S7xx) || defined (STM32L4S9xx) */
#endif /* HAL_HASH_MODULE_ENABLED */
/************************ (C) COPYRIGHT STMicroelectronics *****END OF FILE****/
```
|
```python
Your own Python `calendar`
`Module`s everywhere!
Special attributes of objects and classes
Get the most of `int`s
Implementing **weak** references
```
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.